Home | History | Annotate | Download | only in bin_search_tree_

Lines Matching defs:m_p_nd

118       : m_p_nd(const_cast<Node_Pointer>(p_nd))
123 : m_p_nd(other.m_p_nd)
130 m_p_nd = other.m_p_nd;
138 m_p_nd = other.m_p_nd;
145 _GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);
146 return &m_p_nd->m_value;
152 _GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);
153 return m_p_nd->m_value;
158 { return m_p_nd == other.m_p_nd; }
162 { return m_p_nd == other.m_p_nd; }
166 { return m_p_nd != other.m_p_nd; }
170 { return m_p_nd != other.m_p_nd; }
175 _GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);
183 PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
198 PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
211 if (m_p_nd->special()&&
212 m_p_nd->m_p_parent->m_p_parent == m_p_nd)
214 m_p_nd = m_p_nd->m_p_left;
218 if (m_p_nd->m_p_right != 0)
220 m_p_nd = m_p_nd->m_p_right;
221 while (m_p_nd->m_p_left != 0)
222 m_p_nd = m_p_nd->m_p_left;
226 Node_Pointer p_y = m_p_nd->m_p_parent;
227 while (m_p_nd == p_y->m_p_right)
229 m_p_nd = p_y;
233 if (m_p_nd->m_p_right != p_y)
234 m_p_nd = p_y;
244 if (m_p_nd->special() && m_p_nd->m_p_parent->m_p_parent == m_p_nd)
246 m_p_nd = m_p_nd->m_p_right;
250 if (m_p_nd->m_p_left != 0)
252 Node_Pointer p_y = m_p_nd->m_p_left;
255 m_p_nd = p_y;
259 Node_Pointer p_y = m_p_nd->m_p_parent;
260 while (m_p_nd == p_y->m_p_left)
262 m_p_nd = p_y;
265 if (m_p_nd->m_p_left != p_y)
266 m_p_nd = p_y;
270 Node_Pointer m_p_nd;
292 : PB_DS_TREE_CONST_IT_C_DEC(other.m_p_nd)
299 base_it_type::m_p_nd = other.m_p_nd;
307 base_it_type::m_p_nd = other.m_p_nd;
314 _GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != 0);
315 return &base_it_type::m_p_nd->m_value;
321 _GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != 0);
322 return base_it_type::m_p_nd->m_value;
335 PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);
350 PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);