Searched refs:leaf_nodes (Results 1 – 4 of 4) sorted by relevance
1132 node_stats(size_type l, size_type i) : leaf_nodes(l), internal_nodes(i) {}1135 leaf_nodes += other.leaf_nodes;1140 size_type leaf_nodes;1390 size_type leaf_nodes() const { return internal_stats(root()).leaf_nodes; }1396 return stats.leaf_nodes + stats.internal_nodes;1402 if (stats.leaf_nodes == 1 && stats.internal_nodes == 0) {1405 return sizeof(*this) + stats.leaf_nodes * node_type::LeafSize() +
1064 node_stats(size_type l, size_type i) : leaf_nodes(l), internal_nodes(i) {}1067 leaf_nodes += other.leaf_nodes;1072 size_type leaf_nodes;1322 size_type leaf_nodes() const { return internal_stats(root()).leaf_nodes; }1328 return stats.leaf_nodes + stats.internal_nodes;1334 if (stats.leaf_nodes == 1 && stats.internal_nodes == 0) {1337 return sizeof(*this) + stats.leaf_nodes * node_type::LeafSize() +
1889 …std::size_t leaf_nodes = count + one_szt - std::size_t(one_szt << detail::floor_log2(count + one_s… in vine_to_subtree() local1890 compress_subtree(super_root, leaf_nodes); //create deepest leaves in vine_to_subtree()1891 std::size_t vine_nodes = count - leaf_nodes; in vine_to_subtree()
10637 _argument_list_tree_nodes leaf_nodes; in getArgumentListsForVariableType() local10649 leaf_nodes.push_back(current_node_ptr); in getArgumentListsForVariableType()10664 const unsigned int n_leaf_nodes = (unsigned int)leaf_nodes.size(); in getArgumentListsForVariableType()10670 _argument_list_tree_node* current_node_ptr = leaf_nodes[n_leaf_node]; in getArgumentListsForVariableType()