代码搜索：Loop
找到约 10,000 项符合「Loop」的源代码
代码结果 10,000
www.eeworm.com/read/109800/15548170
v clock.v
module clock(clk,clk_1k,mode,change,turn,alert,hour,min,sec,
LD_alert,LD_hour,LD_min);
input clk,clk_1k,mode,change,turn;
output alert,LD_alert,LD_hour,LD_min;
output[7:0] hour,min,sec;
reg[7:0]
www.eeworm.com/read/109799/15548321
v clock.v
module clock(clk,clk_1k,mode,change,turn,alert,hour,min,sec,
LD_alert,LD_hour,LD_min);
input clk,clk_1k,mode,change,turn;
output alert,LD_alert,LD_hour,LD_min;
output[7:0] hour,min,sec;
reg[7:0]
www.eeworm.com/read/109586/15553965
txt 简单的多项式求和.txt
\\多项式运算（系数为1）
@子过程 pow 完成的是pow(x , subloop)的功能
const Times = 6 ;
var loop , x , result , subresult ,subloop;
procedure pow;
begin
subloop:=loop;
subresult :
www.eeworm.com/read/109555/15554433
cpp 2_10.cpp
#include
void main()
{
enum color{red,yellow,blue,white,black};
enum color pri;
int n,loop,i,j,k;
char c;
n=0;
for(i=red;i
www.eeworm.com/read/109554/15554570
cpp 2_12.cpp
#include
void main()
{
enum color{red,yellow,blue,white,black};
enum color pri;
int n,loop,i,j,k;
n=0;
for(i=red;i
www.eeworm.com/read/109232/15561308
cpp main.cpp
#include
#include
using namespace std;
int AddUp(int Numbers[], int Count) {
int loop;
int sum = 0;
for (loop = 0; loop < Count; loop++) {
sum += N
www.eeworm.com/read/109232/15561325
cpp main.cpp
#include
#include
using namespace std;
int main(int argc, char argv[][])
{
int loop;
for (loop = 0; loop < argc; loop++) {
cout
www.eeworm.com/read/109232/15561412
cpp main.cpp
#include
#include
using namespace std;
template
class CoolHolder {
public:
T first;
T second;
T third;
T sum() {
return first +
www.eeworm.com/read/108548/15584353
c fft.c
/*
* fft.c
*
* Version 2.6 by Steve Sampson, Public Domain, November 1988
*
* This program produces a Frequency Domain display from the Time Domain
* data input; using the Fast Fourier Tra