代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/191860/8419271
cpp graph3.cpp
//图的运算的实现文件graph3.cpp
#include"graph3.h"
//构造函数,初始化图的邻接矩阵与边集数组
adjMList::adjMList(RCW GE[],int n,int e)
{int i,j;
for(i=0; i
www.eeworm.com/read/291340/8423515
txt cdecl.txt
#include
#include
#include
#include
#define MAXTOKENS 100
#define MAXTOKENLEN 64
enum type_tag { IDENTIFIER, QUALIFIER, TYPE };
struct token {
www.eeworm.com/read/191613/8426077
cpp exd01.cpp
// Programming with C++, Second Edition, by John R. Hubbard
// Copyright McGraw-Hill, 2000
// Example D.1 on page 355
// Using an iterator on a vector object
#include
#include
www.eeworm.com/read/190618/8440346
c asm2ghs.c
/*************************************************************
* File: tools/asm2ghs.c
* Purpose: Convert standard MIPS asm syntax to GHS syntax
* Author: Phil Bunce (pjb@carmel.com)
* Revision Hi
www.eeworm.com/read/290929/8450511
cpp gaojingdu.cpp
#include
using namespace std;
int main()
{
int A[1000],B[1000],C[1000];
int n;
char a;
cin>>n;
getchar();
for(int i=0;i
www.eeworm.com/read/189375/8473197
plx textarray.plx
program
integer a[10],b,c,d;
begin
b := 5;
c := 0;
d := 0;
while c
www.eeworm.com/read/189298/8477231
c fact_itr.c
/*
** Compute the factorial of n, iteratively
*/
long
factorial( int n )
{
int result = 1;
while( n > 1 ){
result *= n;
n -= 1;
}
return result;
}
www.eeworm.com/read/290380/8486732
c fstreql.c
int fstreql(char far *str1, char far *str2)
{
while ((*str1 == *str2) && (*str1))
{
str1++;
str2++;
}
return((*str1 == NULL) && (*str2 == NULL));
}
www.eeworm.com/read/390075/8487057
m gs.m
function [x,st]=gs(a,b,n,x1)
D=zeros(n,n);
L=zeros(n,n);
U=zeros(n,n);
for i=1:n
for j=1:n
if j==i
D(i,j)=a(i,j);
end
if j
www.eeworm.com/read/390075/8487122
m jac.m
function [x,st]=jac(a,b,n,x1)
D=zeros(n,n);
L=zeros(n,n);
U=zeros(n,n);
for i=1:n
for j=1:n
if j==i
D(i,j)=a(i,j);
end
if j