Lines Matching refs:p_nd
54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
56 p_nd->m_metadata = 0;
58 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL;
62 p_nd->m_p_next_sibling = NULL;
64 m_p_max = base_type::m_p_root = p_nd;
68 return point_iterator(p_nd);
71 p_nd->m_p_next_sibling = base_type::m_p_root;
75 base_type::m_p_root = p_nd;
77 update_max(p_nd);
81 return point_iterator(p_nd);
87 make_root(node_pointer p_nd)
89 p_nd->m_metadata =
90 p_nd->m_p_l_child == NULL?
92 1 + p_nd->m_p_l_child->m_metadata;
98 make_root_and_link(node_pointer p_nd)
100 make_root(p_nd);
102 p_nd->m_p_prev_or_parent = NULL;
104 p_nd->m_p_next_sibling = base_type::m_p_root;
109 base_type::m_p_root = p_nd;
111 update_max(p_nd);
276 node_pointer p_nd = it.m_p_nd;
278 _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
280 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value);
282 p_nd->m_value = r_new_val;
286 remove_node(p_nd);
288 p_nd->m_p_l_child = NULL;
290 make_root_and_link(p_nd);
297 if (p_nd->m_p_prev_or_parent == NULL)
299 update_max(p_nd);
306 node_pointer p_y = p_nd->m_p_prev_or_parent;
309 if (p_nd->m_p_next_sibling != NULL)
310 p_nd->m_p_next_sibling->m_p_prev_or_parent = p_y;
312 if (p_y->m_p_l_child == p_nd)
313 p_y->m_p_l_child = p_nd->m_p_next_sibling;
315 p_y->m_p_next_sibling = p_nd->m_p_next_sibling;
319 make_root_and_link(p_nd);
327 update_max(node_pointer p_nd)
329 if (m_p_max == NULL || Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value))
330 m_p_max = p_nd;