/dports/www/chromium-legacy/chromium-88.0.4324.182/ui/accessibility/ |
H A D | tree_generator.cc | 48 BuildUniqueTreeUpdate(tree_index, &update); in BuildUniqueTree() 68 void TreeGenerator::BuildUniqueTreeWithIgnoredNodes(int tree_index, in BuildUniqueTreeWithIgnoredNodes() argument 72 BuildUniqueTreeUpdate(tree_index, &update); in BuildUniqueTreeWithIgnoredNodes() 85 void TreeGenerator::BuildUniqueTreeUpdate(int tree_index, in BuildUniqueTreeUpdate() argument 87 CHECK_LT(tree_index, total_unique_tree_count_); in BuildUniqueTreeUpdate() 103 int tree_index, in BuildUniqueTreeUpdateWithSize() argument 108 CHECK_LT(tree_index, unique_tree_count); in BuildUniqueTreeUpdateWithSize() 116 int index = tree_index % p; in BuildUniqueTreeUpdateWithSize() 117 tree_index /= p; in BuildUniqueTreeUpdateWithSize() 140 int parent_index = (tree_index % i); in BuildUniqueTreeUpdateWithSize() [all …]
|
H A D | tree_generator.h | 55 void BuildUniqueTree(int tree_index, AXTree* out_tree) const; 59 int IgnoredPermutationCountPerUniqueTree(int tree_index) const; 60 void BuildUniqueTreeWithIgnoredNodes(int tree_index, 65 void BuildUniqueTreeUpdate(int tree_index, 68 int tree_index,
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/ml/include/pcl/ml/dt/ |
H A D | decision_forest.h | 69 for (std::size_t tree_index = 0; tree_index < this->size(); ++tree_index) { in serialize() local 70 (*this)[tree_index].serialize(stream); in serialize() 94 for (std::size_t tree_index = 0; tree_index < this->size(); ++tree_index) { in deserialize() local 95 (*this)[tree_index].deserialize(stream); in deserialize()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/ui/accessibility/ |
H A D | tree_generator.cc | 46 void TreeGenerator::BuildUniqueTree(int tree_index, AXTree* out_tree) const { in BuildUniqueTree() argument 47 CHECK_LT(tree_index, total_unique_tree_count_); in BuildUniqueTree() 52 if (tree_index - unique_tree_count_so_far < unique_tree_count) { in BuildUniqueTree() 54 tree_index - unique_tree_count_so_far, in BuildUniqueTree() 63 int node_count, int tree_index, AXTree* out_tree) const { in BuildUniqueTreeWithSize() argument 67 CHECK_LT(tree_index, unique_tree_count); in BuildUniqueTreeWithSize() 75 int index = tree_index % p; in BuildUniqueTreeWithSize() 76 tree_index /= p; in BuildUniqueTreeWithSize() 100 int parent_index = (tree_index % i); in BuildUniqueTreeWithSize() 101 tree_index /= i; in BuildUniqueTreeWithSize()
|
H A D | tree_generator.h | 50 void BuildUniqueTree(int tree_index, AXTree* out_tree) const; 54 int node_count, int tree_index, AXTree* out_tree) const;
|
/dports/security/s2n/s2n-tls-1.1.2/pq-crypto/sike_r3/ |
H A D | sikep434r3_sidh.c | 66 tree_index = 0; in EphemeralKeyGeneration_A() 74 tree_index += m; in EphemeralKeyGeneration_A() 87 tree_index = pts_index[npts-1]; in EphemeralKeyGeneration_A() 141 tree_index = 0; in EphemeralKeyGeneration_B() 149 tree_index += m; in EphemeralKeyGeneration_B() 162 tree_index = pts_index[npts-1]; in EphemeralKeyGeneration_B() 216 tree_index = 0; in EphemeralSecretAgreement_A() 224 tree_index += m; in EphemeralSecretAgreement_A() 234 tree_index = pts_index[npts-1]; in EphemeralSecretAgreement_A() 280 tree_index = 0; in EphemeralSecretAgreement_B() [all …]
|
/dports/biology/py-scikit-bio/scikit-bio-0.5.6/skbio/diversity/beta/ |
H A D | _unifrac.py | 145 u_node_counts, v_node_counts, _, _, tree_index =\ 149 tree_index['length']) 282 branch_lengths = tree_index['length'] 285 tip_indices = _get_tip_indices(tree_index) 314 counts_by_node, tree_index, branch_lengths = \ 324 tree_index) 451 counts_by_node, tree_index, branch_lengths = \ 454 return counts_by_node, tree_index, branch_lengths 520 counts_by_node, tree_index, branch_lengths = \ 522 tip_indices = _get_tip_indices(tree_index) [all …]
|
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/bstm/ |
H A D | bstm_time_block.cxx | 70 int tree_index = 0; in init_empty_block() local 78 treeBlk[4] = (tree_index) & 0xff; in init_empty_block() 79 treeBlk[5] = (tree_index>>8) & 0xff; in init_empty_block() 80 treeBlk[6] = (tree_index>>16) & 0xff; in init_empty_block() 81 treeBlk[7] = (tree_index>>24) & 0xff; in init_empty_block() 86 ++tree_index; in init_empty_block() 91 tree_index += 32; in init_empty_block() 106 unsigned index = tree_index(local_time); in get_cell_tt() 112 unsigned index = tree_index(local_t); in set_cell_tt() 128 unsigned bstm_time_block::tree_index(double local_time) in tree_index() function in bstm_time_block
|
H A D | bstm_block.cxx | 89 int tree_index = 0; in init_empty_block() local 100 treeBlk[10] = (tree_index) & 0xff; in init_empty_block() 101 treeBlk[11] = (tree_index>>8) & 0xff; in init_empty_block() 102 treeBlk[12] = (tree_index>>16) & 0xff; in init_empty_block() 103 treeBlk[13] = (tree_index>>24) & 0xff; in init_empty_block() 108 tree_index += 1; in init_empty_block() 112 tree_index += 9; //root + 1st in init_empty_block() 117 tree_index += 1 + 8 + 64; //root + 1st + 2nd in init_empty_block() 123 tree_index += 1 + 8 + 64 + 512; // root + 1st + 2nd + 3rd... in init_empty_block()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/ui/base/ime/ |
H A D | character_composer.cc | 231 uint16_t tree_index = 0; in CheckSequence() local 233 DCHECK(tree_index < data_.tree_entries); in CheckSequence() 238 tree_index += 2 * data_.tree[tree_index] + 1; // internal unicode table in CheckSequence() 239 tree_index += 2 * data_.tree[tree_index] + 1; // leaf unicode table in CheckSequence() 249 uint16_t entries = data_.tree[tree_index++]; in CheckSequence() 251 Find(tree_index, entries, static_cast<uint16_t>(character), &result)) { in CheckSequence() 252 tree_index = result; in CheckSequence() 257 tree_index += 2 * entries; in CheckSequence() 258 entries = data_.tree[tree_index++]; in CheckSequence() 260 Find(tree_index, entries, static_cast<uint16_t>(character), &result)) { in CheckSequence()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/ui/base/ime/ |
H A D | character_composer.cc | 233 uint16_t tree_index = 0; in CheckSequence() local 235 DCHECK(tree_index < data_.tree_entries); in CheckSequence() 240 tree_index += 2 * data_.tree[tree_index] + 1; // internal unicode table in CheckSequence() 241 tree_index += 2 * data_.tree[tree_index] + 1; // leaf unicode table in CheckSequence() 251 uint16_t entries = data_.tree[tree_index++]; in CheckSequence() 253 Find(tree_index, entries, static_cast<uint16_t>(character), &result)) { in CheckSequence() 254 tree_index = result; in CheckSequence() 259 tree_index += 2 * entries; in CheckSequence() 260 entries = data_.tree[tree_index++]; in CheckSequence() 262 Find(tree_index, entries, static_cast<uint16_t>(character), &result)) { in CheckSequence()
|
/dports/devel/libgit2/libgit2-1.3.0/tests/index/ |
H A D | read_index.c | 80 git_index *tree_index; in roundtrip_with_read_index() local 84 cl_git_pass(git_index_new(&tree_index)); in roundtrip_with_read_index() 85 cl_git_pass(git_index_read_tree(tree_index, tree)); in roundtrip_with_read_index() 86 cl_git_pass(git_index_read_index(_index, tree_index)); in roundtrip_with_read_index() 90 git_index_free(tree_index); in roundtrip_with_read_index() 112 git_index *tree_index, *new_index; in test_index_read_index__read_and_writes() local 116 cl_git_pass(git_index_new(&tree_index)); in test_index_read_index__read_and_writes() 117 cl_git_pass(git_index_read_tree(tree_index, tree)); in test_index_read_index__read_and_writes() 118 cl_git_pass(git_index_read_index(_index, tree_index)); in test_index_read_index__read_and_writes() 127 git_index_free(tree_index); in test_index_read_index__read_and_writes()
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/fe/ |
H A D | fe_tools_extrapolate.templates.h | 110 , tree_index(tree_index_) 128 unsigned int tree_index; 481 : tree_index(0) 490 : tree_index(0) 811 const unsigned int tree_index = 963 tree_index, 1009 trees.insert(it->tree_index); 1017 const unsigned int tree_index = 1249 cell_data.tree_index = tree_index; 1254 tree_index, [all …]
|
/dports/math/dune-pdelab/dune-pdelab-20c7085389d3eb4f8ca99e1bc60f7fa6036536c8/dune/pdelab/ordering/ |
H A D | utility.hh | 70 … store(DOFIndex& dof_index, const GeometryType& gt, SizeType entity_index, IndexType tree_index) in store() 75 dof_index.treeIndex().push_back(tree_index); in store() 82 … store(DOFIndex& dof_index, const GeometryType& gt, SizeType entity_index, IndexType tree_index) in store() 86 dof_index.treeIndex() = tree_index; in store() 93 store(DOFIndex& dof_index, SizeType gt_index, SizeType entity_index, IndexType tree_index) in store() 98 dof_index.treeIndex().push_back(tree_index); in store() 105 store(DOFIndex& dof_index, SizeType gt_index, SizeType entity_index, IndexType tree_index) in store() 109 dof_index.treeIndex() = tree_index; in store() 162 …void store(DOFIndex& dof_index, const GeometryType& gt, SizeType entity_index, SizeType tree_index) in store()
|
/dports/audio/rhvoice/RHVoice-1.2.4/src/third-party/hts_engine/ |
H A D | HTS106_model.c | 1092 (*tree_index) = 2; 1105 (*tree_index)++; 1119 int tree_index, pdf_index; 1143 (*tree_index) = 2; 1158 (*tree_index)++; 1172 int tree_index, pdf_index; 1203 (*tree_index) = 2; 1219 (*tree_index)++; 1233 int tree_index, pdf_index; 1258 (*tree_index) = 2; [all …]
|
/dports/math/py-optuna/optuna-2.10.0/optuna/importance/_fanova/ |
H A D | _fanova.py | 92 for tree_index, tree in enumerate(self._trees): 95 fraction = self._variances[features][tree_index] / tree_variance 119 for tree_index, tree in enumerate(self._trees): 126 marginal_variance -= self._variances[sub_features][tree_index] 128 variances[tree_index] = numpy.clip(marginal_variance, 0.0, numpy.inf)
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/ml/include/pcl/ml/impl/dt/ |
H A D | decision_forest_trainer.hpp | 70 for (std::size_t tree_index = 0; tree_index < num_of_trees_to_train_; ++tree_index) { in train() local
|
/dports/biology/py-scikit-bio/scikit-bio-0.5.6/skbio/diversity/ |
H A D | _util.py | 123 tree_index = tree.to_array(nan_length_value=0.0) 126 counts_by_node = _nodes_by_counts(counts, otu_ids, tree_index) 127 branch_lengths = tree_index['length'] 131 return counts_by_node.T, tree_index, branch_lengths
|
/dports/editors/neovim/neovim-0.6.1/runtime/lua/vim/treesitter/ |
H A D | languagetree.lua | 308 for tree_index, tree in ipairs(self._trees) do 363 if not injections[tree_index] then 364 injections[tree_index] = {} 367 if not injections[tree_index][lang] then 368 injections[tree_index][lang] = {} 374 if not injections[tree_index][lang][pattern] then 375 injections[tree_index][lang][pattern] = { combined = combined, regions = {} } 378 table.insert(injections[tree_index][lang][pattern].regions, ranges)
|
/dports/math/dune-pdelab/dune-pdelab-20c7085389d3eb4f8ca99e1bc60f7fa6036536c8/dune/pdelab/common/ |
H A D | globaldofindex.hh | 84 View(const EntityID& entity_id, const TreeIndex& tree_index) in View() argument 86 , _tree_index_view(tree_index) in View() 98 GlobalDOFIndex(const EntityID& entity_id, const TreeIndex& tree_index) in GlobalDOFIndex() argument 100 , _tree_index(tree_index) in GlobalDOFIndex()
|
/dports/lang/swi-pl/swipl-8.2.3/packages/xpce/src/ker/ |
H A D | inline.c | 67 return class == super || (class->tree_index >= super->tree_index && in instanceOfObject() 68 class->tree_index < super->neighbour_index); in instanceOfObject() 79 return class == super || (class->tree_index >= super->tree_index && in objectIsInstanceOf() 80 class->tree_index < super->neighbour_index); in objectIsInstanceOf()
|
/dports/sysutils/htop/htop-3.1.2/ |
H A D | ProcessList.c | 255 previous_process->tree_depth = proc->tree_index; in ProcessList_updateTreeSetLayer() 284 unsigned int newLeftBound = proc->tree_index; in ProcessList_updateTreeSetLayer() 292 proc->tree_index = idx; in ProcessList_updateTreeSetLayer() 303 Hashtable_put(this->draftingTreeSet, proc->tree_index, proc); in ProcessList_updateTreeSetLayer() 315 unsigned int tree_index = 1; in ProcessList_updateTreeSet() local 322 ProcessList_updateTreeSetLayer(this, 0, vsize, 0, 0, vsize * 2 + 1, &index, &tree_index, -1); in ProcessList_updateTreeSet() 381 process->tree_index = index; in ProcessList_buildTreeBranch() 424 process->tree_index = node_index++; in ProcessList_buildTree() 428 Hashtable_put(this->displayTreeSet, process->tree_index, process); in ProcessList_buildTree() 467 process->tree_index = node_index++; in ProcessList_buildTree() [all …]
|
/dports/biology/iqtree/IQ-TREE-2.0.6/utils/ |
H A D | pllnni.cpp | 844 unsigned int tree_index = -1; in pllSaveCurrentTree() local 859 tree_index = *((int *)item_ptr->data); in pllSaveCurrentTree() 872 pllUFBootDataPtr->treels_logl[tree_index] = cur_logl; in pllSaveCurrentTree() 882 (pllUFBootDataPtr->treels_ptnlh)[tree_index] = in pllSaveCurrentTree() 904 tree_index = pllUFBootDataPtr->candidate_trees_count; in pllSaveCurrentTree() 911 pllUFBootDataPtr->treels_logl[tree_index] = cur_logl; in pllSaveCurrentTree() 914 printf("Add treels_logl[%d] := %f\n", tree_index, cur_logl); in pllSaveCurrentTree() 926 pllUFBootDataPtr->treels_ptnlh[tree_index] = pattern_lh; in pllSaveCurrentTree() 944 tree_index = *((int *)item_ptr->data); in pllSaveCurrentTree() 960 pllUFBootDataPtr->boot_trees[sample] = tree_index; in pllSaveCurrentTree() [all …]
|
/dports/www/drupal9/drupal-9.2.10/core/modules/taxonomy/src/Form/ |
H A D | OverviewTerms.php | 163 $tree_index = 0; 166 if (empty($tree[$tree_index])) { 182 $term = $tree[$tree_index]; 185 while ($pterm = $tree[--$tree_index]) { 189 $tree_index--; 223 } while (isset($tree[++$tree_index]));
|
/dports/misc/tudu/tudu-0.10.3/src/ |
H A D | config.cc | 262 tree_index = 0; in resetTheme() 413 tree_index=0; in getThemeTree() 416 if (tree_index>MAX_THEME_TREECOLS) in getThemeTree() 425 tree_columns[tree_index] = WTREE; in getThemeTree() 429 tree_columns[tree_index] = WPRIORITY; in getThemeTree() 433 tree_columns[tree_index] = WCATEGORY; in getThemeTree() 437 tree_columns[tree_index] = WDEADLINE; in getThemeTree() 441 tree_index--; in getThemeTree() 444 tree_index++; in getThemeTree() 790 for (int k=0; k<tree_index; ++k) in genWindowTree() [all …]
|