Searched refs:children_count (Results 1 – 5 of 5) sorted by relevance
71 const size_t children_count = children.size(); in choose_by_minimum_overlap_cost() local81 children_contents.resize(children_count); in choose_by_minimum_overlap_cost()83 for ( size_t i = 0 ; i < children_count ; ++i ) in choose_by_minimum_overlap_cost()110 size_t first_n_children_count = children_count; in choose_by_minimum_overlap_cost()120 …um_overlap_cost_first_n(children, indexable, first_n_children_count, children_count, children_cont… in choose_by_minimum_overlap_cost()136 size_t const children_count, in choose_by_minimum_overlap_cost_first_n() argument139 BOOST_GEOMETRY_INDEX_ASSERT(first_n_children_count <= children_count, "unexpected value"); in choose_by_minimum_overlap_cost_first_n()140 …BOOST_GEOMETRY_INDEX_ASSERT(children_contents.size() == children_count, "unexpected number of elem… in choose_by_minimum_overlap_cost_first_n()160 for ( size_t j = 0 ; j < children_count ; ++j ) in choose_by_minimum_overlap_cost_first_n()196 size_t children_count = children.size(); in choose_by_minimum_content_cost() local[all …]
70 unsigned int children_count; member192 return node->count + node->children_count; in callchain_cumul_counts()
654 new->children_count = 0; in add_child()818 new->children_count = parent->children_count; in split_add_child()819 parent->children_count = callchain_cumul_counts(new); in split_add_child()831 parent->children_count += 1; in split_add_child()909 root->children_count++; in append_chain_children()
53 size_t children_count = children.size(); in apply() local61 for ( size_t i = 0 ; i < children_count ; ++i ) in apply()
184 rem_node.count = child->parent->children_count - cumul_count; in __callchain__fprintf_graph()