Home | History | Annotate | Download | only in bin_search_tree_

Lines Matching refs:m_p_nd

128       : m_p_nd(const_cast<Node_Pointer>(p_nd))
133 : m_p_nd(other.m_p_nd)
140 m_p_nd = other.m_p_nd;
148 m_p_nd = other.m_p_nd;
155 _GLIBCXX_DEBUG_ASSERT(m_p_nd != NULL);
156 return &m_p_nd->m_value;
162 _GLIBCXX_DEBUG_ASSERT(m_p_nd != NULL);
163 return m_p_nd->m_value;
168 { return m_p_nd == other.m_p_nd; }
172 { return m_p_nd == other.m_p_nd; }
176 { return m_p_nd != other.m_p_nd; }
180 { return m_p_nd != other.m_p_nd; }
185 _GLIBCXX_DEBUG_ASSERT(m_p_nd != NULL);
193 PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
208 PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
221 if (m_p_nd->special()&&
222 m_p_nd->m_p_parent->m_p_parent == m_p_nd)
224 m_p_nd = m_p_nd->m_p_left;
228 if (m_p_nd->m_p_right != NULL)
230 m_p_nd = m_p_nd->m_p_right;
231 while (m_p_nd->m_p_left != NULL)
232 m_p_nd = m_p_nd->m_p_left;
236 Node_Pointer p_y = m_p_nd->m_p_parent;
237 while (m_p_nd == p_y->m_p_right)
239 m_p_nd = p_y;
243 if (m_p_nd->m_p_right != p_y)
244 m_p_nd = p_y;
254 if (m_p_nd->special() && m_p_nd->m_p_parent->m_p_parent == m_p_nd)
256 m_p_nd = m_p_nd->m_p_right;
260 if (m_p_nd->m_p_left != NULL)
262 Node_Pointer p_y = m_p_nd->m_p_left;
265 m_p_nd = p_y;
269 Node_Pointer p_y = m_p_nd->m_p_parent;
270 while (m_p_nd == p_y->m_p_left)
272 m_p_nd = p_y;
275 if (m_p_nd->m_p_left != p_y)
276 m_p_nd = p_y;
280 Node_Pointer m_p_nd;
306 : PB_DS_TREE_CONST_IT_C_DEC(other.m_p_nd)
313 base_it_type::m_p_nd = other.m_p_nd;
321 base_it_type::m_p_nd = other.m_p_nd;
328 _GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != NULL);
329 return &base_it_type::m_p_nd->m_value;
335 _GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != NULL);
336 return base_it_type::m_p_nd->m_value;
349 PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);
364 PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);