代码搜索：reverse
找到约 4,015 项符合「reverse」的源代码
代码结果 4,015
www.eeworm.com/read/226560/14459306
cpp reversible.cpp
//: C04:Reversible.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 2000
// Copyright notice in Copyright.txt
// Using reversible containers
www.eeworm.com/read/226467/14463700
txt mowangyuyan.txt
#include
#include
#define MAXQUEUE 200
int queue[MAXQUEUE];
int front=-1;
int rear=-1;
int EnQueue(char value) /*进队*/
{
if(rear>=MAXQUEUE) return -1;
www.eeworm.com/read/224480/14588344
m p108_2.m
wns=[0.1:0.1:1]; z=0.55; yy=[]; t=0:.1:12;
for i=1:length(wns)
wn=wns(i); %z in (0,1)
wd=wn*sqrt(1-z^2); th=atan(sqrt(1-z^2)/z);
y=1-exp(-z*wn*t).*sin(wd*t+th)/sqrt(1-z^2);
yy=[yy;y]
www.eeworm.com/read/224480/14588629
m p110_3.m
wns=[0.1:0.1:1]; z=0.707; yy=[]; t=0:.1:12;
for i=1:length(wns)
wn=wns(i);
y=wn*exp(-z*wn*t).*sin(wn*sqrt(1-z^2)*t)/sqrt(1-z^2);
yy=[yy;y];
end
plot(t,yy)
mesh(wns,t,yy'); set(gca,'
www.eeworm.com/read/122684/14674281
cpp reversible.cpp
//: C20:Reversible.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 1999
// Copyright notice in Copyright.txt
// Using reversible contain
www.eeworm.com/read/120923/14783476
cpp reversible.cpp
//: C07:Reversible.cpp
// From "Thinking in C++, 2nd Edition, Volume 2"
// by Bruce Eckel & Chuck Allison, (c) 2001 MindView, Inc.
// Available at www.BruceEckel.com.
// Using reversible container
www.eeworm.com/read/220692/14791658
txt 可用的提升小波的名字.txt
% 可用的小波名称wname有:
% 'db1', 'db2', 'db3', 'db4', 'db5', 'db6', 'db7', 'db8'
% 'sym2', 'sym3', 'sym4', 'sym5', 'sym6', 'sym7', 'sym8'
% 'bior1.1', 'bior1.3' , 'bior1.5', ...
%
www.eeworm.com/read/220690/14791780
c 实例11-9.c
#include
#include
#define StartX 1
#define StartY 1
void initial();
main()
{
int x=StartX;
int
www.eeworm.com/read/208919/15231084
c memstore.direct.c
/* ---------------------------------------------------------------------------
*
* MEASUREMENT OF THE MEMORY INITIALIZATION SPEED IN BOTH DIRECTIONS
* =======================================