Searched refs:right_child (Results 1 – 9 of 9) sorted by relevance
| /third_party/glib/glib/ |
| D | gtree.c | 97 guint8 right_child; member
142 node->right_child = FALSE; in g_tree_node_new()
281 while (tmp->right_child) in g_tree_node_last()
308 while (tmp->right_child) in g_tree_node_previous()
334 if (node->right_child) in g_tree_node_next()
638 if (node->right_child) in g_tree_insert_internal()
650 node->right_child = TRUE; in g_tree_insert_internal()
798 if (!node->right_child) in g_tree_remove_internal()
815 if (!node->right_child) in g_tree_remove_internal()
827 parent->right_child = FALSE; in g_tree_remove_internal()
[all …]
|
| /third_party/boost/boost/graph/ |
| D | king_ordering.hpp | 117 int right_child = Qptr->size() - right_child_heap; in percolate_down() local
123 bool valid = (right_child < heap_last) ? false : true; in percolate_down()
129 > get(degree, (*Qptr)[right_child])) in percolate_down()
130 ? right_child in percolate_down()
146 right_child = Qptr->size() - right_child_heap; in percolate_down()
151 valid = (right_child < heap_last) ? false : true; in percolate_down()
155 > get(degree, (*Qptr)[right_child])) in percolate_down()
156 ? right_child in percolate_down()
|
| /third_party/boost/boost/mpi/collectives/ |
| D | reduce.hpp | 173 int right_child = (root + comm.size()) / 2; in tree_reduce_impl() local
191 if (right_child != root) { in tree_reduce_impl()
195 detail::packed_archive_recv(comm, right_child, tag, ia, status); in tree_reduce_impl()
221 int left_child, right_child; in tree_reduce_impl() local
224 right_child = (parent + right_bound) / 2; in tree_reduce_impl()
235 parent = right_child; in tree_reduce_impl()
264 if (right_child != rank) { in tree_reduce_impl()
268 detail::packed_archive_recv(comm, right_child, tag, ia, status); in tree_reduce_impl()
|
| /third_party/grpc/src/core/lib/iomgr/ |
| D | timer_heap.cc | 56 uint32_t right_child = left_child + 1; in adjust_downwards() local
57 uint32_t next_i = right_child < length && first[left_child]->deadline > in adjust_downwards()
58 first[right_child]->deadline in adjust_downwards()
59 ? right_child in adjust_downwards()
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | hb-priority-queue.hh | 100 static constexpr unsigned right_child (unsigned index) in right_child() function
108 unsigned right = right_child (index); in bubble_down()
|
| /third_party/harfbuzz/src/ |
| D | hb-priority-queue.hh | 100 static constexpr unsigned right_child (unsigned index) in right_child() function
108 unsigned right = right_child (index); in bubble_down()
|
| /third_party/grpc/test/core/iomgr/ |
| D | timer_heap_test.cc | 56 size_t right_child = left_child + 1u; in check_valid() local
60 if (right_child < pq->timer_count) { in check_valid()
61 GPR_ASSERT(pq->timers[i]->deadline <= pq->timers[right_child]->deadline); in check_valid()
|
| /third_party/flutter/skia/third_party/externals/spirv-tools/source/util/ |
| D | move_to_front.h | 430 bool right_child; in InsertNode() local
437 right_child = TimestampOf(iter) > TimestampOf(node); in InsertNode()
438 iter = right_child ? RightOf(iter) : LeftOf(iter); in InsertNode()
445 if (right_child) in InsertNode()
|
| /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()
88 , m_right_child(right_child) in lazy_list_node()
|