代码搜索:while

找到约 10,000 项符合「while」的源代码

代码结果 10,000
www.eeworm.com/read/306236/13749011

c 企业员工管理系统.c

#include #include #include #define N 100 void password(); char *getpassword(char password[]); void change(); void welcome(); void manage(); void minput(); vo
www.eeworm.com/read/306051/13753398

c main_c.c

/********************************************************************************************************* ** ** ** **
www.eeworm.com/read/306051/13753402

bak main_c.c.bak

/********************************************************************************************************* ** ** ** **
www.eeworm.com/read/306033/13754376

htm demo_js_lists.htm

LISPPA: Linked lists (paxJavaScript). pri
www.eeworm.com/read/306033/13754392

htm demo_c_polynomials.htm

LISPPA: Polynomials (paxC). void
www.eeworm.com/read/306033/13754442

htm demo_js_polynomials.htm

LISPPA: Polynomials (paxJavaScript). func
www.eeworm.com/read/306033/13754503

htm demo_c_lists.htm

LISPPA: Linked lists (paxC). variant
www.eeworm.com/read/306033/13754727

pc c_polinomials.pc

// Addition of polynomials (a cyclic linked list application). void Add(InitP, InitQ) { variant P, Q; P = & InitP; Q = & InitQ; while (true) { while (P[0][1] < Q[0][1]) Q = & Q[1];
www.eeworm.com/read/306033/13754739

js javascript_polinomials.js

// Addition of polynomials (a cyclic linked list application). function Add(InitP, InitQ) { var P, Q; P = & InitP; Q = & InitQ; while (true) { while (P[0][1] < Q[0][1]) Q = & Q[1];
www.eeworm.com/read/306033/13754742

js javascript_lists.js

println 'Create a list'; L = [100, [200, [300, null]]]; println L; println 'Insert new item at the beginning'; L = [50, L]; println L; println 'Add new item at the end'; P = & L; // Create