41 #ifdef PB_DS_CLASS_C_DEC
48 assert_valid(
const char* __file,
int __line)
const
50 if (m_p_head->m_p_parent != 0)
51 m_p_head->m_p_parent->assert_valid(
this, __file, __line);
52 assert_iterators(__file, __line);
53 assert_reverse_iterators(__file, __line);
54 if (m_p_head->m_p_parent == 0)
56 PB_DS_DEBUG_VERIFY(m_p_head->m_p_min == m_p_head);
57 PB_DS_DEBUG_VERIFY(m_p_head->m_p_max == m_p_head);
58 PB_DS_DEBUG_VERIFY(empty());
62 PB_DS_DEBUG_VERIFY(m_p_head->m_p_min->m_type == leaf_node);
63 PB_DS_DEBUG_VERIFY(m_p_head->m_p_max->m_type == leaf_node);
64 PB_DS_DEBUG_VERIFY(!empty());
70 assert_iterators(
const char* __file,
int __line)
const
72 size_type calc_size = 0;
73 for (const_iterator it =
begin(); it !=
end(); ++it)
76 debug_base::check_key_exists(PB_DS_V2F(*it), __file, __line);
77 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it);
78 PB_DS_DEBUG_VERIFY(--upper_bound(PB_DS_V2F(*it)) == it);
80 PB_DS_DEBUG_VERIFY(calc_size == m_size);
86 assert_reverse_iterators(
const char* __file,
int __line)
const
88 size_type calc_size = 0;
89 for (const_reverse_iterator it = rbegin(); it != rend(); ++it)
92 node_const_pointer p_nd =
93 const_cast<PB_DS_CLASS_C_DEC*
>(
this)->find_imp(PB_DS_V2F(*it));
94 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd);
96 PB_DS_DEBUG_VERIFY(calc_size == m_size);
100 typename PB_DS_CLASS_C_DEC::size_type
102 recursive_count_leafs(node_const_pointer p_nd,
const char* __file,
int __line)
106 if (p_nd->m_type == leaf_node)
108 PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node);
110 for (
typename inode::const_iterator it =
static_cast<inode_const_pointer
>(p_nd)->
begin();
111 it !=
static_cast<inode_const_pointer
>(p_nd)->
end();
113 ret += recursive_count_leafs(*it, __file, __line);
constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept
Return an iterator pointing to the first element of the initializer_list.
constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept
Return an iterator pointing to one past the last element of the initializer_list.