代码搜索：continue
找到约 10,000 项符合「continue」的源代码
代码结果 10,000
www.eeworm.com/read/192259/8391148
c zap.c
#include
#include
#include
#include
#include "ourhdr.h"
int
main(int argc, char *argv[])
{
int i;
struct stat statbuf;
struct utimbuf
www.eeworm.com/read/291584/8408613
m emd6.m
function [signal1,p1,signal2,p2]=emd4(x);%对imf顺次叠加的和进行t-test。按照统计检验的方法来确定noise order的问题。
%涉及到要用t-test.返回值是去除noise order后的重构信号。
tic;%计时函数。
if size(x,2)==1
x=x';
end
n=x;%把x的值赋给n.
emd(n);%调用e
www.eeworm.com/read/191804/8421589
txt list2.txt
#include
#include
#include
/*构建结点结构体 */
typedef struct LNode{
int data;
struct LNode * next;
}LNode, * LinkList;
/*用于创建链表的函数 */
/*反序构建的*/
www.eeworm.com/read/390894/8435345
asv crossover.asv
%交叉操作，概率为0.7，单点交叉
for i=1:2:40
cross_pos=round(9*rand(10)); %交叉位置为0~9，若位置为0，则不进行交叉操作
if cross_pos==0
continue;
end
cross_P=rand; %随机产生一个数，以比较交叉概率
if cr
www.eeworm.com/read/189283/8480541
m chenmh_arnoldipro.m
function [V,H,k,istop] = Chenmh_ArnoldiPro(A,m,k,V,H);
k = k + 1; istop = 0;
H = [H, V(:,1:k)'*A*V(:,k)];
w = A*V(:,k) - V*H(:,k);
nw = (w'*w)^0.5;
H(k+1,k) = nw;
if ( (nw>=eps) & (k
www.eeworm.com/read/189219/8484024
c loop.c
#include "calld.h"
#include
#include
static void cli_done(int);
static void child_done(int);
static fd_set allset; /* one bit per client conn, plus one for listenfd */
/
www.eeworm.com/read/189219/8484158
c zap.c
#include
#include
#include
#include
#include "ourhdr.h"
int
main(int argc, char *argv[])
{
int i;
struct stat statbuf;
struct utimbuf timebuf;
www.eeworm.com/read/188852/8510727
cpp registry.cpp
/*
InterruptHook
Copyright (C) 2003 Alexander M.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the F
www.eeworm.com/read/188471/8538375
lst dviic.lst
C51 COMPILER V7.50 DVIIC 01/17/2007 12:46:54 PAGE 1
C51 COMPILER V7.50, COMPILATION OF MODULE DVIIC
OBJECT MODULE PLACED IN .
www.eeworm.com/read/188471/8538460
c dviic.c
#include "mtv415.h"
#include "dvIIC.h"
#include "extData.h"
#include "intrins.h"
// ---------------------------------------------------------------------------
// G L O B A L D E F I N I