| /dports/science/opensph/sph-7de6c044339f649e3d19e61f735a6a24572b792a/core/objects/finders/test/ |
| H A D | Finders.cpp | 70 const Size nTree = finder.findAll(refIdx, radius, treeNeighs); in checkNeighbors() local
82 const Size nTree = finder.findLowerRank(refIdx, radius, treeNeighs); in checkNeighbors() local
96 const Size nTree = finder.findAll(point, radius, treeNeighs); in checkNeighbors() local
116 const Size nTree = finder.findAll(Vector(0._f), 1.f, treeNeighs); in checkEmpty() local
128 Size nTree = finder.findAll(0, 1.f, treeNeighs); in checkLargeValues() local
|
| /dports/devel/R-cran-randomForest/randomForest/src/ |
| H A D | regrf.c | 23 int *nthsize, int *nrnodes, int *nTree, int *mtry, int *imp, in regRF()
|
| /dports/biology/iqtree/IQ-TREE-2.0.6/pll/ |
| H A D | utils.c | 2056 checkTreeInclusion (pllInstance * pInst, pllNewickTree * nTree) in checkTreeInclusion()
2135 linkTaxa (pllInstance * pInst, pllNewickTree * nTree, int taxaExist) in linkTaxa()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/libreofficekit/qa/gtktiledviewer/ |
| H A D | gtv-signal-handlers.cxx | 509 for (size_t nTree = 0; nTree < aTrees.size(); ++nTree) in documentRepair() local
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/libreofficekit/qa/gtktiledviewer/ |
| H A D | gtv-signal-handlers.cxx | 507 for (size_t nTree = 0; nTree < aTrees.size(); ++nTree) in documentRepair() local
|
| /dports/databases/sqlcipher/sqlcipher-3.4.2/src/ |
| H A D | vdbesort.c | 257 int nTree; /* Used size of aTree/aReadr (power of 2) */ member
2113 int nTree = pMerger->nTree; in vdbeMergeEngineInit() local
|
| /dports/databases/sqlite3/sqlite-src-3350500/src/ |
| H A D | vdbesort.c | 257 int nTree; /* Used size of aTree/aReadr (power of 2) */ member
2118 int nTree; /* Number of subtrees to merge */ in vdbeMergeEngineInit() local
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/sqlite/src/src/ |
| H A D | vdbesort.c | 257 int nTree; /* Used size of aTree/aReadr (power of 2) */ member
2115 int nTree; /* Number of subtrees to merge */ in vdbeMergeEngineInit() local
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/sqlite/src/src/ |
| H A D | vdbesort.c | 257 int nTree; /* Used size of aTree/aReadr (power of 2) */ member
2118 int nTree; /* Number of subtrees to merge */ in vdbeMergeEngineInit() local
|
| /dports/databases/sqlite3/sqlite-src-3350500/ext/lsm1/ |
| H A D | lsm_sorted.c | 217 int nTree; /* Size of aTree[] array */ member
|
| /dports/databases/sqlcipher/sqlcipher-3.4.2/ext/lsm1/ |
| H A D | lsm_sorted.c | 217 int nTree; /* Size of aTree[] array */ member
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/sqlite/src/ext/lsm1/ |
| H A D | lsm_sorted.c | 217 int nTree; /* Size of aTree[] array */ member
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/sqlite/src/ext/lsm1/ |
| H A D | lsm_sorted.c | 217 int nTree; /* Size of aTree[] array */ member
|
| /dports/math/cbc/Cbc-releases-2.10.5/Cbc/src/ |
| H A D | CbcModel.cpp | 17571 int nTree = CoinMax(10000, 2 * numberRows + numberColumns); local
|