Searched refs:p_right (Results 1 – 3 of 3) sorted by relevance
| /third_party/boost/boost/intrusive/detail/ |
| D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /third_party/boost/boost/intrusive/ |
| D | rbtree_algorithms.hpp | 96 const node_ptr p_right(node_traits::get_right(p)); (void)p_right; in operator ()() local
98 …BOOST_INTRUSIVE_INVARIANT_ASSERT(!p_right || node_traits::get_color(p_right) == node_traits::black… in operator ()()
|
| D | bstree_algorithms.hpp | 1799 static void rotate_left_no_parent_fix(node_ptr p, node_ptr p_right) in rotate_left_no_parent_fix() argument
1801 node_ptr p_right_left(NodeTraits::get_left(p_right)); in rotate_left_no_parent_fix()
1806 NodeTraits::set_left(p_right, p); in rotate_left_no_parent_fix()
1807 NodeTraits::set_parent(p, p_right); in rotate_left_no_parent_fix()
1811 static void rotate_left(node_ptr p, node_ptr p_right, node_ptr p_parent, node_ptr header) in rotate_left() argument
1814 rotate_left_no_parent_fix(p, p_right); in rotate_left()
1815 NodeTraits::set_parent(p_right, p_parent); in rotate_left()
1816 set_child(header, p_right, p_parent, p_was_left); in rotate_left()
|