代码搜索：combination
找到约 1,190 项符合「combination」的源代码
代码结果 1,190
www.eeworm.com/read/167728/5453308
c combination.c
/* combination/combination.c
* based on permutation/permutation.c by Brian Gough
*
* Copyright (C) 2001 Szymon Jaroszewicz
*
* This program is free software; you can redistribute it and/or modi
www.eeworm.com/read/416749/2111651
js combination.js
/*
* Ext JS Library 2.1
* Copyright(c) 2006-2008, Ext JS, LLC.
* licensing@extjs.com
*
* http://extjs.com/license
*/
/*
* ================ TabPanel with nested layouts =============
www.eeworm.com/read/411928/2180132
js combination.js
/*
* Ext JS Library 2.2
* Copyright(c) 2006-2008, Ext JS, LLC.
* licensing@extjs.com
*
* http://extjs.com/license
*/
/*
* ================ TabPanel with nested layouts =============
www.eeworm.com/read/388751/2547864
js combination.js
/*
* Ext JS Library 2.2
* Copyright(c) 2006-2008, Ext JS, LLC.
* licensing@extjs.com
*
* http://extjs.com/license
*/
/*
* ================ TabPanel with nested layouts =============
www.eeworm.com/read/376940/2705933
js combination.js
/*
* Ext JS Library 2.2
* Copyright(c) 2006-2008, Ext JS, LLC.
* licensing@extjs.com
*
* http://extjs.com/license
*/
/*
* ================ TabPanel with nested layouts =============
www.eeworm.com/read/393851/8259550
m combination.m
function xpop=combination(mutax,emigx,fristx,pop,res_flg,gk,hk,cmax,emig_ratio,n,tpop,tmax)
% 染色体重组算子，把变异后的群体mutax和混沌移民染色体emigx重组得到子代，
% 以便于送入下一轮作为父代进行进化操作。fristx为上一代中的最优染色体，
% 直接进入xpop实现最优染色体保护策略
www.eeworm.com/read/368337/9701180
c combination.c
#include
#include
int
main (void)
{
gsl_combination * c;
size_t i;
printf ("All subsets of {0,1,2,3} by size:\n") ;
for (i = 0; i
www.eeworm.com/read/368337/9701201
out combination.out
All subsets of {0,1,2,3} by size:
{ }
{ 0 }
{ 1 }
{ 2 }
{ 3 }
{ 0 1 }
{ 0 2 }
{ 0 3 }
{ 1 2 }
{ 1 3 }
{ 2 3 }
{ 0 1 2 }
{ 0 1 3 }
{ 0 2 3 }
{ 1 2 3 }
{ 0 1 2 3 }
www.eeworm.com/read/368337/9701503
texi combination.texi
@cindex combinations
This chapter describes functions for creating and manipulating
combinations. A combination @math{c} is represented by an array of
@math{k} integers in the range 0 .. @math{n-
www.eeworm.com/read/204256/15342792
cpp combination.cpp
// combination.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
#include
#include "Fraction.h"
//小于1000的数中约数最多的数是840,其约数个数为31(不包