代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/438810/7726144
c 16rbkey.c
int rbkey(p,n,a,b,m)
int n,*m;
BISERCH *p[];
double a,b;
{ int i,j,k;
i=1; j=n;
while (i=a)&&((*p[k-1]).KEY
www.eeworm.com/read/438810/7726159
c 12cplx.c
#include "stdlib.h"
int cplx(n,m,a,b,alpha,eps,x,xx,k,s,f)
int n,m,k;
void (*s)();
double a[],b[],alpha,eps,x[],xx[],(*f)();
{ double rn(double *);
int r,g,i,j,it,kt,jt,kk;
www.eeworm.com/read/438810/7726187
c 5sstq.c
#include "stdio.h"
#include "math.h"
int sstq(n,b,c,q,eps,l)
int n,l;
double b[],c[],q[],eps;
{ int i,j,k,m,it,u,v;
double d,f,h,g,p,r,e,s;
c[n-1]=0.0; d=0.0; f=0.0;
www.eeworm.com/read/438810/7726396
c 15ikey.c
void ikey(p,n,k,m)
int n,k,m;
HEAPSORT *p[];
{ int i,l;
HEAPSORT *w;
void pisift();
if (kn-1) m=n-1;
l=m-k+1;
for (i=l/2-1; i>=0; i--)
www.eeworm.com/read/438810/7726404
c 15hbub.c
#include "string.h"
void hbub(p,n,k,m)
char *p[];
int k,m,n;
{ int j,i;
char *d;
if (kn-1) m=n-1;
while (k
www.eeworm.com/read/438810/7726405
c 15ckey.c
void ckey(p,n,k,m)
int n,k,m;
HEAPSORT *p[];
{ int i,l;
HEAPSORT *w;
void pcsift();
if (kn-1) m=n-1;
l=m-k+1;
for (i=l/2-1; i>=0; i--)
www.eeworm.com/read/438810/7726439
c 3rab1.c
int rab1(a,b,r)
int a,b,*r;
{ int k,l,m,i,p;
k=b-a+1; l=2;
while (l
www.eeworm.com/read/438437/7731402
h chdef.h
/** @file chdef.h These are the definitions particular to the Intel NX implementation.
*/
#ifndef __comm_v
#define __comm_v
extern int __NUMNODES, __MYPROCID;
#define PI_NO_NSEND
#define PI_NO_NRE
www.eeworm.com/read/437619/7744675
c pathname.c
/* Convert relative to absolute pathnames
*/
#include
#include "global.h"
#include "dirutil.h"
static void crunch(char *buf,char *path);
/* Given a working directory and an arbitr
www.eeworm.com/read/437574/7745601
m digis1.m
function [x,y,varargout]=digis1(alfa,varargin);
%[a b]=digis1(alfa) - alfa - string, name of
%image file with spot or 2D-array, or 3D array
%(color).
%a,b - vectors of curve (spot border) coordin