42 template<
typename Pred>
51 if (base_type::empty())
58 base_type::to_linked_list();
59 node_pointer p_out = base_type::prune(pred);
66 node_pointer p_next = p_out->m_p_next_sibling;
67 other.make_root_and_link(p_out);
72 node_pointer p_cur = base_type::m_p_root;
74 base_type::m_p_root = 0;
77 node_pointer p_next = p_cur->m_p_next_sibling;
78 make_root_and_link(p_cur);
94 node_pointer p_other = other.m_p_root;
97 node_pointer p_next = p_other->m_p_next_sibling;
98 make_root_and_link(p_other);
101 base_type::m_size += other.m_size;
#define _GLIBCXX_DEBUG_ASSERT(_Condition)
Definition: debug.h:61
#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_VALID(X)
Definition: binary_heap_.hpp:324