Home | History | Annotate | Download | only in rb_tree_map_

Lines Matching full:node_pointer

56   const node_pointer p_x = other.split_min();
68 join_imp(node_pointer p_x, node_pointer p_r)
76   node_pointer p_x_l;
77   node_pointer p_x_r;
78   std::pair<node_pointer, node_pointer> join_pos;
99   node_pointer p_parent = join_pos.second;
132 inline typename PB_DS_CLASS_C_DEC::node_pointer
136   node_pointer p_min = base_type::m_p_head->m_p_left;
139   const node_pointer p_head = base_type::m_p_head;
149   typename PB_DS_CLASS_C_DEC::node_pointer,
150   typename PB_DS_CLASS_C_DEC::node_pointer>
152 find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r)
157     return (std::make_pair((node_pointer)0, base_type::m_p_head));
159   node_pointer p_l_parent = base_type::m_p_head;
186   typename PB_DS_CLASS_C_DEC::node_pointer,
187   typename PB_DS_CLASS_C_DEC::node_pointer>
189 find_join_pos_left(node_pointer p_r, size_type h_l, size_type h_r)
193     return (std::make_pair((node_pointer)0,
195   node_pointer p_r_parent = base_type::m_p_head;
223 black_height(node_pointer p_nd)
255   node_pointer p_nd = upper_bound(r_key).m_p_nd;
258       node_pointer p_next_nd = p_nd->m_p_parent;
276 split_at_node(node_pointer p_nd, PB_DS_CLASS_C_DEC& other)
280   node_pointer p_l = p_nd->m_p_left;
281   node_pointer p_r = p_nd->m_p_right;
282   node_pointer p_parent = p_nd->m_p_parent;