代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/485291/6557458
c process_create.c
#include
int main()
{
int p1,p2;
while((p1=fork())==-1);
if(p1==0)
putchar('b');
else
{
while((p2=fork())==-1);
if(p2==0)
putchar('c');
else
putchar('a');
www.eeworm.com/read/485291/6557462
c process_manage.c
#include
int main()
{
int p1,p2,i;
while((p1=fork())==-1);
if(p1==0)
{
lockf(1,1,0);
for(i=0; i
www.eeworm.com/read/485311/6557755
lst 矩阵键盘c编程.lst
C51 COMPILER V8.08 矩誣键盘C编程 08/17/2008 17:54:40 PAGE 1
C51 COMPILER V8.08, COMPILATION OF MODULE 矩誣键盘C编程
OBJECT MODULE PLACED IN 矩阵键盘C
www.eeworm.com/read/485311/6557770
lst 4×3矩阵键盘c编程.lst
C51 COMPILER V8.08 4×3矩誣键盘C编程 08/12/2008 19:31:25 PAGE 1
C51 COMPILER V8.08, COMPILATION OF MODULE 4×3矩誣键盘C编程
OBJECT MODULE PLACED IN 4×3
www.eeworm.com/read/485392/6561107
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
www.eeworm.com/read/485122/6565216
cpp qcksrt.cpp
void qcksrt(int n, double arr[])
{
int m = 7; int nstack = 50; int fm = 7875; int fa = 211;
int fc = 1663; double a,fmi = 0.00012698413;
int istack[51];
int jstack = 0;
int i,j,
www.eeworm.com/read/485122/6565218
cpp sort2.cpp
void sort2(int n, double ra[], double rb[])
{
int l,ir,i,j;
double rra,rrb;
l = n / 2 + 1;
ir = n;
do
{
if (l > 1)
{
l = l - 1;
rra = ra[l];
www.eeworm.com/read/485122/6565221
cpp indexx.cpp
void indexx(int n, double arrin[], int indx[])
{
int i,j,l,ir,indxt;
double q;
for (j = 1; j
www.eeworm.com/read/485122/6565224
cpp sort.cpp
void sort(int n, double ra[])
{
int i,j,l,ir;
double rra;
l = int(n / 2) + 1;
ir = n;
do
{
if (l > 1)
{
l = l - 1;
rra = ra[l];
}
www.eeworm.com/read/484945/6569254
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]内的全部实