42 inline typename PB_DS_CLASS_C_DEC::point_iterator
44 push(const_reference r_val)
47 node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val);
50 return point_iterator(p_new_nd);
56 push_imp(node_pointer p_nd)
58 p_nd->m_p_l_child = 0;
59 if (base_type::m_p_root == 0)
61 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0;
62 base_type::m_p_root = p_nd;
64 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 0;
67 base_type::make_child_of(base_type::m_p_root, p_nd);
69 base_type::m_p_root = p_nd;
73 base_type::make_child_of(p_nd, base_type::m_p_root);
81 modify(point_iterator it, const_reference r_new_val)
84 remove_node(it.m_p_nd);
85 it.m_p_nd->m_value = r_new_val;
#define PB_DS_CLASS_C_DEC
Definition: bin_search_tree_.hpp:71
#define PB_DS_CLASS_T_DEC
Definition: bin_search_tree_.hpp:67
return(unsigned int) __res
#define PB_DS_ASSERT_NODE_CONSISTENT(_Node)
Definition: bin_search_tree_.hpp:402
#define PB_DS_ASSERT_VALID(X)
Definition: binary_heap_.hpp:324