Searched refs:children_count (Results 1 – 7 of 7) sorted by relevance
| /third_party/eudev/src/udev/ |
| D | udevadm-hwdb.c | 50 size_t children_count; member
60 uint8_t children_count; member
90 … child = realloc(node->children, (node->children_count + 1) * sizeof(struct trie_child_entry)); in node_add_child()
95 trie->children_count++; in node_add_child()
96 node->children[node->children_count].c = c; in node_add_child()
97 node->children[node->children_count].child = node_child; in node_add_child()
98 node->children_count++; in node_add_child()
99 … qsort(node->children, node->children_count, sizeof(struct trie_child_entry), trie_children_cmp); in node_add_child()
110 …child = bsearch(&search, node->children, node->children_count, sizeof(struct trie_child_entry), tr… in node_lookup()
119 for (i = 0; i < node->children_count; i++) in trie_node_cleanup()
[all …]
|
| /third_party/boost/boost/geometry/index/detail/rtree/rstar/ |
| D | choose_next_node.hpp | 98 const size_t children_count = children.size(); in choose_by_minimum_overlap_cost() local
106 children_contents(children_count); in choose_by_minimum_overlap_cost()
108 for ( size_t i = 0 ; i < children_count ; ++i ) in choose_by_minimum_overlap_cost()
135 size_t first_n_children_count = children_count; in choose_by_minimum_overlap_cost()
147 children_count, in choose_by_minimum_overlap_cost()
165 size_t const children_count, in choose_by_minimum_overlap_cost_first_n() argument
169 BOOST_GEOMETRY_INDEX_ASSERT(first_n_children_count <= children_count, "unexpected value"); in choose_by_minimum_overlap_cost_first_n()
170 …BOOST_GEOMETRY_INDEX_ASSERT(children_contents.size() == children_count, "unexpected number of elem… in choose_by_minimum_overlap_cost_first_n()
194 for ( size_t j = 0 ; j < children_count ; ++j ) in choose_by_minimum_overlap_cost_first_n()
229 size_t children_count = children.size(); in choose_by_minimum_content_cost() local
[all …]
|
| /third_party/eudev/src/shared/ |
| D | strbuf.c | 71 for (i = 0; i < node->children_count; i++) in strbuf_node_cleanup()
109 int left = 0, right = node->children_count; in bubbleinsert()
120 sizeof(struct strbuf_child_entry) * (node->children_count - left)); in bubbleinsert()
123 node->children_count ++; in bubbleinsert()
161 child = bsearch(&search, node->children, node->children_count, in strbuf_add_string()
186 … child = realloc(node->children, (node->children_count + 1) * sizeof(struct strbuf_child_entry)); in strbuf_add_string()
|
| D | strbuf.h | 43 uint8_t children_count; member
|
| /third_party/eudev/src/libudev/ |
| D | libudev-hwdb.c | 111 base += node->children_count * le64toh(hwdb->head->child_entry_size); in trie_node_values()
135 child = bsearch(&search, trie_node_children(hwdb, node), node->children_count, in node_lookup_f()
166 for (i = 0; i < node->children_count; i++) { in trie_fnmatch_f()
|
| D | libudev-hwdb-def.h | 52 uint8_t children_count; member
|
| /third_party/boost/boost/geometry/index/detail/rtree/visitors/ |
| D | insert.hpp | 65 size_t children_count = children.size(); in apply() local
73 for ( size_t i = 0 ; i < children_count ; ++i ) in apply()
|