代码搜索：while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/340943/12120164
c cs6-1.c
#include
unsigned char dis0=0x66;
unsigned char dis1=0x4f;
unsigned char dis2=0x5b;
unsigned char dis3=0x06;
void delay(void)
{
unsigned int i,j;
for(i=0;i
www.eeworm.com/read/152351/12120432
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/340943/12120517
c cs14-1.c
#include
#define uchar unsigned char
#define uint unsigned int
/****************************************************************/
void delay(uint k)
{
uint i,j;
fo
www.eeworm.com/read/254750/12120680
cpp crout.cpp
//author:张鹏飞 ID :00512080 NO.3
#include"stdio.h"
#include"math.h"
#include"string.h"
#define N 100 //N表示程序可以求解的方程组的阶数
int n;
bool inputerror=false; //标识数据输入有没有错误，若取true，则表示有错误
bool metho
www.eeworm.com/read/254538/12131138
m chap1_9_1.m
%用差分格式(1.43-1)和(1.43-2)计算两点边值问题的程序
function[Y,E,e]=chap1_9_1(m,Z)%m为等分的分数,Z为欲知该点函数值的点集,Y为对应的函数值.E为对应的误差绝对值,e为最大误差．
for i=2:m
X(1,i)=(i-1)/m;
B(1,i)=2+(1/m)^2*(1+sin(X(1,i)));
D(1,i)=(
www.eeworm.com/read/254538/12131141
m chap1_9_2.m
%用差分格式(1.45-1)~(1.45-3)计算两点边值问题的程序
function[Y,E,e]=chap1_9_2(m,Z)%m为等分的分数,Z为欲知该点函数值的点集,Y为对应的函数值.E为对应的误差绝对值,e为最大误差．
for i=2:m
X(1,i)=(i-1)/m;
B(1,i)=2+(1/m)^2*(1+sin(X(1,i)));
D(1,i)=(
www.eeworm.com/read/152199/12132736
cpp transferfunctions.cpp
#define PRE_AGREED_PORT 8686
#define SEND_BUFFER_SIZE 4096
BOOL CYourServerClass::SendFileToRemoteRecipient(CString fName)
{
/***************************
// listens for a connection from
www.eeworm.com/read/254434/12136226
c 44blib.c
#include
#include
#include
#include
#include
#include "..\target\44b.h"
#include "..\target\44blib.h"
#include "..\target\def.h"
#inclu
www.eeworm.com/read/152141/12136342
c tab.c
/*
* Copyright (c) 1996, 1997, 1998, 1999, 2000
* Tama Communications Corporation
*
* This file is part of GNU GLOBAL.
*
* GNU GLOBAL is free software; you can redistribute it and/or modify
* i
www.eeworm.com/read/152141/12136395
h queue.h
/*
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permi