Searched refs:left_child (Results 1 – 9 of 9) sorted by relevance
| /third_party/glib/glib/ |
| D | gtree.c | 96 guint8 left_child; member
141 node->left_child = FALSE; in g_tree_node_new()
252 while (tmp->left_child) in g_tree_node_first()
307 if (node->left_child) in g_tree_node_previous()
335 while (tmp->left_child) in g_tree_node_next()
615 if (node->left_child) in g_tree_insert_internal()
627 node->left_child = TRUE; in g_tree_insert_internal()
790 if (!node->left_child) in g_tree_remove_internal()
813 if (!node->left_child) in g_tree_remove_internal()
821 parent->left_child = FALSE; in g_tree_remove_internal()
[all …]
|
| /third_party/grpc/src/core/lib/iomgr/ |
| D | timer_heap.cc | 54 uint32_t left_child = 1u + 2u * i; in adjust_downwards() local
55 if (left_child >= length) break; in adjust_downwards()
56 uint32_t right_child = left_child + 1; in adjust_downwards()
57 uint32_t next_i = right_child < length && first[left_child]->deadline > in adjust_downwards()
60 : left_child; in adjust_downwards()
|
| /third_party/boost/boost/mpi/collectives/ |
| D | reduce.hpp | 172 int left_child = root / 2; in tree_reduce_impl() local
176 if (left_child != root) { in tree_reduce_impl()
180 detail::packed_archive_recv(comm, left_child, tag, ia, status); in tree_reduce_impl()
221 int left_child, right_child; in tree_reduce_impl() local
223 left_child = (left_bound + parent) / 2; in tree_reduce_impl()
230 parent = left_child; in tree_reduce_impl()
249 if (left_child != rank) { in tree_reduce_impl()
253 detail::packed_archive_recv(comm, left_child, tag, ia, status); in tree_reduce_impl()
|
| /third_party/boost/boost/graph/ |
| D | king_ordering.hpp | 120 int left_child = Qptr->size() - left_child_heap; in percolate_down() local
128 && get(degree, (*Qptr)[left_child]) in percolate_down()
131 : left_child; in percolate_down()
149 left_child = Qptr->size() - left_child_heap; in percolate_down()
154 && get(degree, (*Qptr)[left_child]) in percolate_down()
157 : left_child; in percolate_down()
|
| /third_party/grpc/test/core/iomgr/ |
| D | timer_heap_test.cc | 55 size_t left_child = 1u + 2u * i; in check_valid() local
56 size_t right_child = left_child + 1u; in check_valid()
57 if (left_child < pq->timer_count) { in check_valid()
58 GPR_ASSERT(pq->timers[i]->deadline <= pq->timers[left_child]->deadline); in check_valid()
|
| /third_party/harfbuzz/src/ |
| D | hb-priority-queue.hh | 95 static constexpr unsigned left_child (unsigned index) in left_child() function
107 unsigned left = left_child (index); in bubble_down()
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | hb-priority-queue.hh | 95 static constexpr unsigned left_child (unsigned index) in left_child() function
107 unsigned left = left_child (index); in bubble_down()
|
| /third_party/boost/boost/graph/planar_detail/ |
| D | face_handles.hpp | 84 lazy_list_node(ptr_t left_child, ptr_t right_child) in lazy_list_node()
87 , m_left_child(left_child) in lazy_list_node()
|
| /third_party/boost/boost/intrusive/ |
| D | bstree_algorithms.hpp | 1013 bool left_child = true; in insert_unique_check() local
1017 x = (left_child = comp(key, x)) ? in insert_unique_check()
1028 commit_data.link_left = left_child; in insert_unique_check()
|