代码搜索：continue
找到约 10,000 项符合「continue」的源代码
代码结果 10,000
www.eeworm.com/read/133356/14047284
cpp cmsq_sys.cpp
/**********************************************************
* name: CMSQ_Sys.cpp
*
* Description:
* SYSTEM MESSAGE QUEUE.
*
* Copyright to DDP 2000-2001 All rights reverved.
* 2001.01.0
www.eeworm.com/read/235820/14051018
c decode_smb.c
/*
decode_smb.c
Microsoft Server Message Block.
Copyright (c) 2000 Dug Song
$Id: decode_smb.c,v 1.3 2000/11/06 14:08:42 dugsong Exp $
*/
#include "config.h"
#inclu
www.eeworm.com/read/132819/14071952
m divider.m
function [N,M]=divider(N1);
%DIVIDER Find dividers of an integer.
% [N,M]=DIVIDER(N1) find two integers N and M such that M*N=N1 and
% M and N as close as possible from sqrt(N1).
%
% Example :
% N1
www.eeworm.com/read/204978/15330655
c parameterlist.c
#include "ParameterList.h"
#include "Pareto.h"
#include
#include
#include
void ParameterList::add(char* vb, char* fn, char* sn, PType t, void* pv) {
if(sz==n)
www.eeworm.com/read/203618/15354314
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/202630/15377485
f fft1d.f
***********************************************************************
* This is a subroutine for FFT transform program *
* Made by Dr. Xue-bin Chi
www.eeworm.com/read/202558/15378548
txt 结果.txt
input e:
0.000001
1 x[0]=2.5 x[1]=2.09091 x[2]=1.22727
2 x[0]=2.97727 x[1]=2.02893 x[2]=1.00413
3 x[0]=3.00981 x[1]=1.99681 x[2]=0.995891
4 x[0]=2.99
www.eeworm.com/read/201680/15398735
c zap.c
#include
#include
#include
#include
#include "ourhdr.h"
int
main(int argc, char *argv[])
{
int i;
struct
www.eeworm.com/read/112193/15492063
cpp threadname.cpp
/*
Copyright (C)2003 Barry Dunne (http://www.emule-project.net)
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as publi