| /dports/biology/iqtree/IQ-TREE-2.0.6/ncl/ |
| H A D | nxstreesblock.cpp | 33 ntrees = 0; in NxsTreesBlock()
168 ntrees++; in HandleTreeDescription()
357 ntrees = 0; in Reset()
381 return ntrees; in GetNumTrees()
392 assert(i < ntrees); in GetTreeName()
406 assert(i < ntrees); in GetTranslatedTreeDescription()
465 assert(i < ntrees); in GetTreeDescription()
508 if (ntrees == 0) in Report()
517 if (ntrees == 0) in Report()
548 if (ntrees == 0) in BriefReport()
[all …]
|
| /dports/biology/iqtree/IQ-TREE-2.0.6/main/ |
| H A D | treetesting.cpp | 769 size_t ntrees = info.size(); in performAUTest() local
890 for (tid = 0; tid < ntrees; tid++) { in performAUTest()
1032 if (ntrees < distinct_ids.size()) { in evaluateTrees()
1037 if (ntrees == 0) return; in evaluateTrees()
1091 ntrees*sizeof(TreeInfo) + in evaluateTrees()
1092 params.do_weighted_test*(ntrees * nptn * sizeof(double) + ntrees*ntrees*sizeof(double)); in evaluateTrees()
1123 if (!(lhdiff_weights = new double [ntrees * ntrees])) in evaluateTrees()
1138 info.resize(ntrees); in evaluateTrees()
1224 ASSERT(tid == ntrees); in evaluateTrees()
1229 int *tree_ranks = new int[ntrees]; in evaluateTrees()
[all …]
|
| /dports/net-p2p/libswift/libswift-dc0cbcc/tests/ |
| H A D | livepptest.cpp | 89 int ntrees = 20;
91 bin_t new_munro_bin = bin_t(5,481+ntrees);
92 tint new_munro_tint = NOW + TINT_SEC + ntrees*TINT_SEC;
99 …double expbytes = ((ntrees*SWIFT_DEFAULT_LIVE_NCHUNKS_PER_SIGN)+SWIFT_DEFAULT_LIVE_NCHUNKS_PER_SIG…
101 double expbitrate = expbytes / ntrees;
110 bin_t exp_current_bin = bin_t(5,481+ntrees/2);
111 tint exp_current_tint = NOW + TINT_SEC + (ntrees/2)*TINT_SEC;
|
| /dports/x11/xlockmore/xlockmore-5.67/modes/ |
| H A D | forest.c | 87 int ntrees; member
156 fp->ntrees = MI_COUNT(mi); in init_forest()
157 if (fp->ntrees < -MINTREES) in init_forest()
158 fp->ntrees = NRAND(-fp->ntrees - MINTREES + 1) + MINTREES; in init_forest()
159 else if (fp->ntrees < MINTREES) in init_forest()
160 fp->ntrees = MINTREES; in init_forest()
179 if (fp->time < fp->ntrees) { in draw_forest()
|
| /dports/biology/python-nexus/python-nexus-1.63/nexus/bin/ |
| H A D | nexus_treemanip.py | 205 if num_trees > nexus_obj.trees.ntrees:
207 "Treefile only has %d trees in it." % nexus_obj.trees.ntrees
209 elif num_trees == nexus_obj.trees.ntrees: # pragma: no cover
215 (nexus_obj.trees.ntrees, num_trees)
262 if nexus.trees.ntrees == 0:
266 (nexus.trees.ntrees, len(nexus.trees.translators))
294 (nexus.trees.ntrees, newnexus)
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/clsfy/ |
| H A D | clsfy_random_forest_builder.h | 32 clsfy_random_forest_builder(unsigned ntrees,
89 void set_ntrees(unsigned ntrees) {ntrees_=ntrees;} in set_ntrees() argument
91 unsigned ntrees() const {return ntrees_;} in ntrees() function
|
| /dports/biology/iqtree/IQ-TREE-2.0.6/tree/ |
| H A D | phylosupertreeplen.cpp | 295 int ntrees = size(); in computeFunction() local
340 int part, ntrees = size(); in computeLikelihoodFromBuffer() local
353 int ntrees = size(); in computeFuncDerv() local
533 part_move.resize(ntrees); in doNNI()
601 int part, ntrees = size(); in swapNNIBranch() local
931 node1_link.resize(ntrees); in swapNNIBranch()
932 node2_link.resize(ntrees); in swapNNIBranch()
1612 int ntrees = size(); in initializeAllPartialLh() local
1614 block_size.resize(ntrees); in initializeAllPartialLh()
1618 mem_size.resize(ntrees); in initializeAllPartialLh()
[all …]
|
| /dports/biology/p5-Bio-Phylo/Bio-Phylo-v2.0.1/lib/Bio/Phylo/ |
| H A D | Generator.pm | 150 my $ntrees = $options{'-trees'} || 10;
152 for ( 0 .. ( $ntrees - 1 ) ) {
325 my $ntrees = $args{'-trees'} || 10;
329 for my $i ( 1 .. $ntrees ) {
409 my $ntrees = $options{'-trees'} || 1;
412 for my $i ( 1 .. $ntrees ) {
|
| /dports/graphics/opencv/opencv-4.5.3/modules/objdetect/src/ |
| H A D | cascadedetect.hpp | 181 int ntrees; member
500 int wi, ntrees = stage.ntrees; in predictOrdered() local
503 for( wi = 0; wi < ntrees; wi++ ) in predictOrdered()
544 int wi, ntrees = stage.ntrees; in predictCategorical() local
547 for( wi = 0; wi < ntrees; wi++ ) in predictCategorical()
588 int ntrees = stage.ntrees; in predictOrderedStump() local
589 for( int i = 0; i < ntrees; i++ ) in predictOrderedStump()
601 cascadeStumps += ntrees; in predictOrderedStump()
626 int wi, ntrees = stage.ntrees; in predictCategoricalStump() local
629 for( wi = 0; wi < ntrees; wi++ ) in predictCategoricalStump()
[all …]
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/apps/src/face_detection/ |
| H A D | face_trainer.cpp | 14 int ntrees = 10; in main() local
21 pcl::console::parse_argument(argc, argv, "-ntrees", ntrees); in main()
32 fdrf.setNumTrees(ntrees); in main()
|
| /dports/graphics/opencv/opencv-4.5.3/modules/ml/src/ |
| H A D | rtrees.cpp | 182 for( treeidx = 0; treeidx < ntrees; treeidx++ ) in train()
321 int k, ntrees = (int)roots.size(); in write() local
323 fs << "ntrees" << ntrees in write()
326 for( k = 0; k < ntrees; k++ ) in write()
353 int ntrees = (int)fn["ntrees"]; in read() local
361 CV_Assert( ntrees == (int)trees_node.size() ); in read()
363 for( int treeidx = 0; treeidx < ntrees; treeidx++, ++it ) in read()
374 int nclasses = (int)classLabels.size(), ntrees = (int)roots.size(); in getVotes() local
387 output.create(nsamples, ntrees, CV_32F); in getVotes()
391 for( j = 0; j < ntrees; j++ ) in getVotes()
[all …]
|
| /dports/emulators/qemu60/qemu-6.0.0/roms/edk2/BaseTools/Source/C/BrotliCompress/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
149 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/www/firefox-esr/firefox-91.8.0/modules/brotli/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
144 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
145 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
153 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/archivers/py-brotli/Brotli-1.0.9/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
144 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
145 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
153 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/archivers/brotli/brotli-1.0.9/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
144 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
145 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
153 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/emulators/qemu/qemu-6.2.0/roms/edk2/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
149 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/emulators/qemu/qemu-6.2.0/roms/edk2/BaseTools/Source/C/BrotliCompress/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
149 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/emulators/qemu5/qemu-5.2.0/roms/edk2/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
149 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/emulators/qemu60/qemu-6.0.0/roms/edk2/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
149 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/www/firefox/firefox-99.0/modules/brotli/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
144 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
145 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
153 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/emulators/qemu5/qemu-5.2.0/roms/edk2/BaseTools/Source/C/BrotliCompress/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
149 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/sysutils/uefi-edk2-bhyve/edk2-edk2-stable202102/BaseTools/Source/C/BrotliCompress/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
149 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/sysutils/uefi-edk2-bhyve/edk2-edk2-stable202102/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in BrotliDecoderHuffmanTreeGroupInit() argument
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in BrotliDecoderHuffmanTreeGroupInit()
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in BrotliDecoderHuffmanTreeGroupInit()
149 group->num_htrees = (uint16_t)ntrees; in BrotliDecoderHuffmanTreeGroupInit()
151 group->codes = (HuffmanCode*)(&p[ntrees]); in BrotliDecoderHuffmanTreeGroupInit()
|
| /dports/sysutils/edk2/edk2-edk2-stable202102/MdeModulePkg/Library/BrotliCustomDecompressLib/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) { in main()
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size; in main()
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees; in main()
149 group->num_htrees = (uint16_t)ntrees; in main()
151 group->codes = (HuffmanCode*)(&p[ntrees]); in main()
|
| /dports/sysutils/edk2/edk2-edk2-stable202102/BaseTools/Source/C/BrotliCompress/brotli/c/dec/ |
| H A D | state.c | 138 uint32_t alphabet_size_limit, uint32_t ntrees) {
142 const size_t code_size = sizeof(HuffmanCode) * ntrees * max_table_size;
143 const size_t htree_size = sizeof(HuffmanCode*) * ntrees;
149 group->num_htrees = (uint16_t)ntrees;
151 group->codes = (HuffmanCode*)(&p[ntrees]);
|