Home
last modified time | relevance | path

Searched refs:numtrees (Results 1 – 20 of 20) sorted by relevance

/dports/math/fxt/fxt/demo/comb/
H A Dschroeder-tree-demo.cc16 int m, k, n, p, top, last, r, numtrees, j, sum; variable
79 numtrees++; in visit()
82 cout << setw(4) << numtrees << ": "; in visit()
154 numtrees = 0; in main()
178 cout << "ct=" << numtrees << endl; in main()
/dports/biology/fluctuate/fluctuate1.4/
H A Dcoal_modellike.c34 extern long locus, numseq, totchains, numloci, numtrees;
367 temp[firstlong] = (double *)calloc(1,op->numchains[1]*numtrees*sizeof(double)); in combined_fnx()
369 sign[firstlong] = (double *)calloc(1,op->numchains[1]*numtrees*sizeof(double)); in combined_fnx()
371 temp[i] = temp[firstlong] + (i-firstlong)*numtrees; in combined_fnx()
372 sign[i] = sign[firstlong] + (i-firstlong)*numtrees; in combined_fnx()
444 temp[i] = temp[firstlong] + (i-firstlong)*numtrees; in combined_dfnx()
445 sign[i] = sign[firstlong] + (i-firstlong)*numtrees; in combined_dfnx()
638 num[firstlong] = (double *)calloc(1,op->numchains[1]*numtrees*sizeof(double)); in combined_llike()
640 num[i] = num[firstlong] + (i-firstlong)*numtrees; in combined_llike()
714 treewt[0][0] = (double *)calloc(1,numloci*totchains*numtrees*sizeof(double)); in coal_combined_locus_estimate()
[all …]
H A Dfluc_modellike.c32 extern long locus, numseq, totchains, numloci, numtrees, holding;
144 (treerec *)calloc(numloci*(1+op->numchains[1])*numtrees,sizeof(treerec)); in model_alloc()
147 sum[i][j] = sum[0][0] + i*(1+op->numchains[1])*numtrees + j*numtrees; in model_alloc()
152 for (k = 0; k < numtrees; k++) { in model_alloc()
1449 llike = (double *)calloc(numtrees,sizeof(double)); in fluc_liketable()
1756 for (k=0; k<numtrees;k++) { in modelfree()
H A Dfluctuate.c40 slidenum, numloci, numtrees, locus, totchains, holding; variable
1163 numtrees = MAX(op->steps[0]/op->increm[0],op->steps[1]/op->increm[1]); in firstinit()
1166 sametree[0] = (boolean *)calloc(numloci*numtrees,sizeof(boolean)); in firstinit()
1168 sametree[i] = sametree[0] + i*numtrees; in firstinit()
1191 for (j = 0; j < numtrees; j++) { in locusinit()
/dports/biology/treepuzzle/tree-puzzle-5.2/src/
H A Dtreesort.c532 … int numtrees, /* how many occurred, e.g. in parallel */ in addtree2list() argument
547 (*newptr).count = numtrees; in addtree2list()
549 *numsum = numtrees; in addtree2list()
557 (*tmpptr).count += numtrees; in addtree2list()
558 *numsum += numtrees; in addtree2list()
569 (*newptr).count = numtrees; in addtree2list()
573 *numsum += numtrees; in addtree2list()
581 (*newptr).count = numtrees; in addtree2list()
585 *numsum += numtrees; in addtree2list()
H A Dtreesort.h190 … int numtrees, /* how many occurred, e.g. in parallel */
H A Dpuzzle.h554 int numtrees,
/dports/biology/seaview/seaview/csrc/
H A Dseq.c3531 if (numtrees == 2) { in standev()
3536 while (which <= numtrees) { in standev()
3565 if(numtrees > MAXSHIMOTREES){ in standev()
3568 numtrees = MAXSHIMOTREES; in standev()
3576 for (i = 0; i < numtrees; i++) in standev()
3659 for (i = 0; i < numtrees; i++) in standev()
3676 if (numtrees == 2) { in standev2()
3681 while (which <= numtrees) { in standev2()
3710 if(numtrees > MAXSHIMOTREES){ in standev2()
3713 numtrees = MAXSHIMOTREES; in standev2()
[all …]
H A Ddnapars.c1360 long i, j, numtrees, nextnode; in maketree() local
1365 numtrees = 0; in maketree()
1472 numtrees = 1; in maketree()
1493 while (which <= numtrees) { in maketree()
1518 if (which < numtrees) in maketree()
1524 if (numtrees > 1 && chars > 1 ) in maketree()
1525 standev(chars, numtrees, minwhich, minsteps, nsteps, fsteps, seed); in maketree()
H A Dprotpars.c1876 long i, j, numtrees; in maketree() local
1993 numtrees = 1; in maketree()
2003 while (which <= numtrees) { in maketree()
2024 if (numtrees > 1 && chars > 1 ) in maketree()
2025 standev(chars, numtrees, minwhich, minsteps, nsteps, fsteps, seed); in maketree()
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/phylip/src/
H A Dseq.cpp3537 if (numtrees == 2) { in standev()
3542 while (which <= numtrees) { in standev()
3571 if(numtrees > MAXSHIMOTREES){ in standev()
3574 numtrees = MAXSHIMOTREES; in standev()
3582 for (i = 0; i < numtrees; i++) in standev()
3665 for (i = 0; i < numtrees; i++) in standev()
3682 if (numtrees == 2) { in standev2()
3687 while (which <= numtrees) { in standev2()
3716 if(numtrees > MAXSHIMOTREES){ in standev2()
3719 numtrees = MAXSHIMOTREES; in standev2()
[all …]
/dports/audio/flite/flite-2.1-release/src/cg/
H A Dcst_cg_map.c289 int numtrees; in cst_read_tree_array() local
292 numtrees = cst_read_int(fd,bs); in cst_read_tree_array()
293 if (numtrees > 0) in cst_read_tree_array()
295 trees = cst_alloc(cst_cart *,numtrees+1); in cst_read_tree_array()
297 for(i=0;i<numtrees;i++) in cst_read_tree_array()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/boxm2/ocl/pro/processes/
H A Dboxm2_ocl_batch_probability_process.cxx153 std::size_t numtrees = info_buffer->scene_dims[0]* in boxm2_ocl_batch_probability_process() local
156 std::size_t gThreads[] = {numtrees,1}; in boxm2_ocl_batch_probability_process()
/dports/biology/fastdnaml/fastDNAml_1.2.2/source/
H A DfastDNAml.h190 int numtrees; /* number of alternatives tested */ member
H A DfastDNAml.c557 bt->numtrees = 0; in initBestTree()
3299 bt->numtrees += tested; in optimize()
4689 bt->numtrees = 1; in makeDenovoTree()
4725 bt->numtrees += tested; in makeDenovoTree()
4749 printf("\nExamined %d %s\n", bt->numtrees, in makeDenovoTree()
4750 bt->numtrees != 1 ? "trees" : "tree"); in makeDenovoTree()
/dports/biology/recombine/recombine1.41/
H A Drec_modellike.c34 extern long population, locus, totchains, numtrees;
112 sum[0][0] = (treerec *)calloc(1,numloci*(1+op->numchains[1])*numtrees * in model_alloc()
116 sum[i][j] = sum[0][0] + i*(1+op->numchains[1])*numtrees + j*numtrees; in model_alloc()
120 for (k = 0; k < numtrees; k++) { in model_alloc()
2832 for(i = 0; i < numtrees; i++) in rec_estimate()
2979 llike = (double *)calloc(numtrees,sizeof(double)); in rec_liketable()
H A Drecombine.c121 long rootnum, apps, col, numtrees, totchains; variable
2267 numtrees = MAX(op->steps[0]/op->increm[0],op->steps[1]/op->increm[1]); in firstinit()
2275 sametree[0] = (boolean *)calloc(1,numloci*numtrees * sizeof(boolean)); in firstinit()
2277 sametree[i] = sametree[0] + i*numtrees; in firstinit()
/dports/biology/iqtree/IQ-TREE-2.0.6/pll/
H A Dpll.h1357 int numtrees; /**< number of alternatives tested */ member
H A Dtopologies.c495 bt->numtrees = 0; in initBestTree()
/dports/games/tuxracer/tuxracer-0.61/
H A DChangeLog972 - Some clean up: s/numtrees/num_tress/, s/numitems/num_items/, etc.