Home
last modified time | relevance | path

Searched refs:BOOST_INTRUSIVE_INVARIANT_ASSERT (Results 1 – 14 of 14) sorted by relevance

/third_party/boost/boost/intrusive/detail/
Dassert.hpp24 #if !defined(BOOST_INTRUSIVE_INVARIANT_ASSERT)
26 #define BOOST_INTRUSIVE_INVARIANT_ASSERT BOOST_ASSERT macro
Dhashtable_node.hpp51 BOOST_INTRUSIVE_INVARIANT_ASSERT(Slist::empty()); in ~bucket_impl()
57 BOOST_INTRUSIVE_INVARIANT_ASSERT(Slist::empty()); in operator =()
Dcommon_slist_algorithms.hpp50 BOOST_INTRUSIVE_INVARIANT_ASSERT(p); in get_previous_node()
/third_party/boost/boost/intrusive/
Dlist.hpp638 …BOOST_INTRUSIVE_INVARIANT_ASSERT(node_algorithms::distance(b.pointed_node(), e.pointed_node()) == … in erase()
978 …BOOST_INTRUSIVE_INVARIANT_ASSERT(n == node_algorithms::distance(f.pointed_node(), e.pointed_node()… in splice()
1273 BOOST_INTRUSIVE_INVARIANT_ASSERT(!node_algorithms::inited(value_traits::to_node_ptr(value))); in s_iterator_to()
1292 BOOST_INTRUSIVE_INVARIANT_ASSERT(!node_algorithms::inited(value_traits::to_node_ptr(r))); in s_iterator_to()
1307 …BOOST_INTRUSIVE_INVARIANT_ASSERT(!node_algorithms::inited(this->priv_value_traits().to_node_ptr(va… in iterator_to()
1323 …BOOST_INTRUSIVE_INVARIANT_ASSERT(!node_algorithms::inited(this->priv_value_traits().to_node_ptr(r)… in iterator_to()
1337 BOOST_INTRUSIVE_INVARIANT_ASSERT(node_traits::get_next(header_ptr)); in check()
1338 BOOST_INTRUSIVE_INVARIANT_ASSERT(node_traits::get_previous(header_ptr)); in check()
1340 BOOST_INTRUSIVE_INVARIANT_ASSERT((node_traits::get_next(header_ptr) == header_ptr) in check()
1345 BOOST_INTRUSIVE_INVARIANT_ASSERT(this->priv_size_traits().get_size() == 0); in check()
[all …]
Drbtree_algorithms.hpp97 …BOOST_INTRUSIVE_INVARIANT_ASSERT(!p_left || node_traits::get_color(p_left) == node_traits::black… in operator ()()
98 …BOOST_INTRUSIVE_INVARIANT_ASSERT(!p_right || node_traits::get_color(p_right) == node_traits::black… in operator ()()
100 BOOST_INTRUSIVE_INVARIANT_ASSERT(node_traits::get_parent(node_traits::get_parent(p)) != p); in operator ()()
104 BOOST_INTRUSIVE_INVARIANT_ASSERT(l_black_count == check_return_right.black_count_); in operator ()()
475 BOOST_INTRUSIVE_INVARIANT_ASSERT(w); in rebalance_after_erasure_restore_invariants()
481 BOOST_INTRUSIVE_INVARIANT_ASSERT(w); in rebalance_after_erasure_restore_invariants()
497 BOOST_INTRUSIVE_INVARIANT_ASSERT(w); in rebalance_after_erasure_restore_invariants()
516 BOOST_INTRUSIVE_INVARIANT_ASSERT(w); in rebalance_after_erasure_restore_invariants()
532 BOOST_INTRUSIVE_INVARIANT_ASSERT(w); in rebalance_after_erasure_restore_invariants()
Dslist.hpp201 BOOST_INTRUSIVE_INVARIANT_ASSERT(cache_last); in get_last_node()
208 BOOST_INTRUSIVE_INVARIANT_ASSERT(cache_last); in set_last_node()
634 BOOST_INTRUSIVE_INVARIANT_ASSERT(cache_last); in last()
648 BOOST_INTRUSIVE_INVARIANT_ASSERT(cache_last); in last()
963 …BOOST_INTRUSIVE_INVARIANT_ASSERT(node_algorithms::distance((++const_iterator(before_f)).pointed_no… in erase_after()
1345 …BOOST_INTRUSIVE_INVARIANT_ASSERT(node_algorithms::distance(before_f.pointed_node(), before_l.point… in splice_after()
1463 BOOST_INTRUSIVE_INVARIANT_ASSERT(counter[i].empty()); in sort()
1794 …BOOST_INTRUSIVE_INVARIANT_ASSERT(linear || !node_algorithms::inited(this->priv_value_traits().to_n… in iterator_to()
1810 …BOOST_INTRUSIVE_INVARIANT_ASSERT (linear || !node_algorithms::inited(this->priv_value_traits().to_… in iterator_to()
1912 BOOST_INTRUSIVE_INVARIANT_ASSERT(n > 0); in incorporate_after()
[all …]
Dpointer_plus_bits.hpp89 BOOST_INTRUSIVE_INVARIANT_ASSERT(0 == (uintptr_t(p) & Mask)); in set_pointer()
98 BOOST_INTRUSIVE_INVARIANT_ASSERT(uintptr_t(c) <= Mask); in set_bits()
Davltree_algorithms.hpp91 BOOST_INTRUSIVE_INVARIANT_ASSERT( in operator ()()
517 BOOST_INTRUSIVE_INVARIANT_ASSERT(x_parent_left); in rebalance_after_erasure_restore_invariants()
520 BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_right(x_parent_left)); in rebalance_after_erasure_restore_invariants()
541 BOOST_INTRUSIVE_INVARIANT_ASSERT(x_parent_right); in rebalance_after_erasure_restore_invariants()
544 BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_left(x_parent_right)); in rebalance_after_erasure_restore_invariants()
558 BOOST_INTRUSIVE_INVARIANT_ASSERT(false); // never reached in rebalance_after_erasure_restore_invariants()
603 BOOST_INTRUSIVE_INVARIANT_ASSERT(false); // never reached in rebalance_after_insertion()
629 BOOST_INTRUSIVE_INVARIANT_ASSERT(false); // never reached in left_right_balancing()
Dbstree_algorithms.hpp87 BOOST_INTRUSIVE_INVARIANT_ASSERT(!comp_(p, check_return_left.max_key_node_ptr)); in operator ()()
89 BOOST_INTRUSIVE_INVARIANT_ASSERT(!comp_(check_return_right.min_key_node_ptr, p)); in operator ()()
796 BOOST_INTRUSIVE_INVARIANT_ASSERT(comp(x, upper_key)); in bounded_range()
810 …BOOST_INTRUSIVE_INVARIANT_ASSERT(left_closed || right_closed || comp(lower_key, x) || comp(x, uppe… in bounded_range()
1415 BOOST_INTRUSIVE_INVARIANT_ASSERT(super_root); in rebalance_subtree()
1457 BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_left(header) == header); in check()
1458 BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_right(header) == header); in check()
1462 BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_parent(root_node_ptr) == header); in check()
1468 BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_left(header) == p); in check()
1471 BOOST_INTRUSIVE_INVARIANT_ASSERT(NodeTraits::get_right(header) == p); in check()
[all …]
Dtreap_algorithms.hpp57 BOOST_INTRUSIVE_INVARIANT_ASSERT(!prio_comp_(node_traits::get_left(p), p)); in operator ()()
59 BOOST_INTRUSIVE_INVARIANT_ASSERT(!prio_comp_(node_traits::get_right(p), p)); in operator ()()
Dhashtable.hpp174 BOOST_INTRUSIVE_INVARIANT_ASSERT(bound != primes_end); in suggested_lower_bucket_count_impl()
1524 … BOOST_INTRUSIVE_INVARIANT_ASSERT(sizeof(size_type) >= sizeof(std::size_t) || bc <= size_type(-1)); in bucket_count()
1816 BOOST_INTRUSIVE_INVARIANT_ASSERT(bucket_sz != 0); in hashtable_impl()
1818 BOOST_INTRUSIVE_INVARIANT_ASSERT in hashtable_impl()
1849 BOOST_INTRUSIVE_INVARIANT_ASSERT(bucket_sz != 0); in hashtable_impl()
1851 BOOST_INTRUSIVE_INVARIANT_ASSERT in hashtable_impl()
3159 BOOST_INTRUSIVE_INVARIANT_ASSERT in rehash_impl()
3263 BOOST_INTRUSIVE_INVARIANT_ASSERT in priv_clone_from()
3265 BOOST_INTRUSIVE_INVARIANT_ASSERT in priv_clone_from()
Dsgtree.hpp186 BOOST_INTRUSIVE_INVARIANT_ASSERT(0); in set_alpha()
926 BOOST_INTRUSIVE_INVARIANT_ASSERT((new_alpha > 0.5f && new_alpha < 1.0f)); in balance_factor()
Dsplaytree_algorithms.hpp718 BOOST_INTRUSIVE_INVARIANT_ASSERT(false); in rotate()
Dbstree.hpp2065 … BOOST_INTRUSIVE_INVARIANT_ASSERT(this->sz_traits().get_size() == checker_return.node_count); in check()