46 assert_valid(
const char* __file,
int __line)
const
48 if (m_p_head->m_p_parent != 0)
49 m_p_head->m_p_parent->assert_valid(
this, __file, __line);
50 assert_iterators(__file, __line);
51 assert_reverse_iterators(__file, __line);
52 if (m_p_head->m_p_parent == 0)
68 assert_iterators(
const char* __file,
int __line)
const
70 size_type calc_size = 0;
71 for (const_iterator it = begin(); it != end(); ++it)
74 debug_base::check_key_exists(
PB_DS_V2F(*it), __file, __line);
84 assert_reverse_iterators(
const char* __file,
int __line)
const
86 size_type calc_size = 0;
87 for (const_reverse_iterator it = rbegin(); it != rend(); ++it)
90 node_const_pointer p_nd =
98 typename PB_DS_CLASS_C_DEC::size_type
100 recursive_count_leafs(node_const_pointer p_nd,
const char* __file,
int __line)
104 if (p_nd->m_type == leaf_node)
108 for (
typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin();
109 it !=
static_cast<inode_const_pointer
>(p_nd)->end();
111 ret += recursive_count_leafs(*it, __file, __line);
#define PB_DS_CLASS_C_DEC
Definition: bin_search_tree_.hpp:71
#define PB_DS_CLASS_T_DEC
Definition: bin_search_tree_.hpp:67
#define PB_DS_DEBUG_VERIFY(_Cond)
Definition: binary_heap_.hpp:327
#define PB_DS_V2F(X)
Definition: container_base_dispatch.hpp:80