Home
last modified time | relevance | path

Searched refs:check_return_right (Results 1 – 4 of 4) sorted by relevance

/third_party/boost/boost/intrusive/
Davltree_algorithms.hpp87 const return_type& check_return_left, const return_type& check_return_right, in operator ()()
90 … const int height_diff = check_return_right.height - check_return_left.height; (void)height_diff; in operator ()()
97 …(check_return_left.height > check_return_right.height ? check_return_left.height : check_return_ri… in operator ()()
98 base_checker_t::operator()(p, check_return_left, check_return_right, check_return); in operator ()()
Dbstree_algorithms.hpp83 const return_type& check_return_left, const return_type& check_return_right, in operator ()()
88 if (check_return_right.min_key_node_ptr) in operator ()()
89 BOOST_INTRUSIVE_INVARIANT_ASSERT(!comp_(check_return_right.min_key_node_ptr, p)); in operator ()()
91 …check_return.max_key_node_ptr = node_traits::get_right(p)? check_return_right.max_key_node_ptr : p; in operator ()()
92 check_return.node_count = check_return_left.node_count + check_return_right.node_count + 1; in operator ()()
93 base_checker_t::operator()(p, check_return_left, check_return_right, check_return); in operator ()()
2061 typename Checker::return_type check_return_right; in check_subtree() local
2070 check_subtree(right, checker, check_return_right); in check_subtree()
2072 checker(node, check_return_left, check_return_right, check_return); in check_subtree()
Drbtree_algorithms.hpp89 const return_type& check_return_left, const return_type& check_return_right, in operator ()()
104 BOOST_INTRUSIVE_INVARIANT_ASSERT(l_black_count == check_return_right.black_count_); in operator ()()
107 base_checker_t::operator()(p, check_return_left, check_return_right, check_return); in operator ()()
Dtreap_algorithms.hpp53 const return_type& check_return_left, const return_type& check_return_right, in operator ()()
60 base_checker_t::operator()(p, check_return_left, check_return_right, check_return); in operator ()()