代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/198623/7921719
c ind0.c
#
# include "econs.h"
# include "ecmn.h"
/*int mbuf[1024]; /*INSTR*/
/*int tbuf[12]; /*INSTR*/
int (*acts[])() {0,
&coll,
&save,
&out,
&error,
&hyphen,
&pno
};
char *tmp[2] {"/t
www.eeworm.com/read/198623/7921733
c ind1.c
#
# include "econs.h"
# include "ecmn.h"
# define SKIP 0
# define COLLECT 1
# define SKIP2 2
char mone -1;
int tlno 1;
coll()
{
cs = COLLECT;
temp[t1].beg = &line[l];
return;
}
save()
{
extern
www.eeworm.com/read/198623/7921762
c upost.c
/*int mbuf[1024]; /*INSTR*/
int psw 1;
int initf 1;
main(argc, argv)
char *argv[];
{
auto f,fct,file;
if(argc < 2) {
printf("Usage: cpost [-d] file1 file2 ...\n");
exit();
}
if(*argv[1] ==
www.eeworm.com/read/198623/7921768
c crpost.c
/*int mbuf[1024]; /*INSTR*/
int ig 100;
int esw;
int initf 1;
char ssp[270];
char *sym[9] {ssp,
ssp + 30,
ssp + 60,
ssp + 90,
ssp + 120,
ssp + 150,
ssp + 180,
ssp + 210,
ssp + 240,
s
www.eeworm.com/read/198623/7921788
c mtab.c
# include "../mcons.h"
struct {
int cl[NUMC];
}tab[NUMS];
char state[NUMS][SIZS];
char class[NUMC][SIZC];
char act[NUMA][SIZA];
char def[NUMS][SIZA];
char temp[SIZA];
char *st[NUMS];
char *df[NUMS
www.eeworm.com/read/198617/7922286
pl author.pl
open(In,"Ts300.gb");
while(){
chomp;
if (/^\d+(.*)：(.*)/){
$Author=$1;
$Title=$2;
if ( defined $Hash{$Author} ){
$Hash{$Author}=$Hash{$Author}."\n".$Title;
}else{
$Hash{$A
www.eeworm.com/read/433514/7924857
c qsort2.c
//快速排序的递归算法。
#define MAX 16 //元素个数的最大值
int R[MAX+1]={0,9,2,13,5,10,16,17,11,4,6,8,1,7}; //用数组来储存待排序元素,R[0]为辅助单元
QUICKSORT (int low,int high) reentrant //快速排序的递归算法
{
int i,j;
if (low>=h
www.eeworm.com/read/433514/7924894
c selsort.c
//直接选择排序算法
#define MAX 10 //元素的最大个数
int R[MAX+1]={0,5,2,9,12,3,1,4} ; //有效元素序号从1到n,其中R[0]单元作为机动单元
int n; //元素的实际个数
SELECTSORT ( ) //直接选择排序算法
{ int i,j,k; //定义辅助变量
for (i=1;i
www.eeworm.com/read/398754/7925846
lua sort.lua
-- two implementations of a sort function
-- this is an example only. Lua has now a built-in function "sort"
-- extracted from Programming Pearls, page 110
function qsort(x,l,u,f)
if l
www.eeworm.com/read/198548/7928364
m instfreq.m
function [fnormhat,t]=instfreq(x,t,L,trace);
%INSTFREQ Instantaneous frequency estimation.
% [FNORMHAT,T]=INSTFREQ(X,T,L,TRACE) computes the instantaneous
% frequency of the analytic signal X at time