detail/bin_search_tree_/point_iterators.hpp

134       : m_p_nd(const_cast<Node_Pointer>(p_nd))
139       : m_p_nd(other.m_p_nd)
146 	m_p_nd = other.m_p_nd;
154 	m_p_nd = other.m_p_nd;
161 	_GLIBCXX_DEBUG_ASSERT(m_p_nd != NULL);
162 	return &m_p_nd->m_value;
168 	_GLIBCXX_DEBUG_ASSERT(m_p_nd != NULL);
169 	return m_p_nd->m_value;
174       { return m_p_nd == other.m_p_nd; }
178       { return m_p_nd == other.m_p_nd; }
182       { return m_p_nd != other.m_p_nd; }
186       { return m_p_nd != other.m_p_nd; }
191 	_GLIBCXX_DEBUG_ASSERT(m_p_nd != NULL);
199 	PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
214 	PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);
227 	if (m_p_nd->special()&&
228 	    m_p_nd->m_p_parent->m_p_parent == m_p_nd)
230 	    m_p_nd = m_p_nd->m_p_left;
234 	if (m_p_nd->m_p_right != NULL)
236 	    m_p_nd = m_p_nd->m_p_right;
237 	    while (m_p_nd->m_p_left != NULL)
238 	      m_p_nd = m_p_nd->m_p_left;
242 	Node_Pointer p_y = m_p_nd->m_p_parent;
243 	while (m_p_nd == p_y->m_p_right)
245 	    m_p_nd = p_y;
249 	if (m_p_nd->m_p_right != p_y)
250 	  m_p_nd = p_y;
260 	if (m_p_nd->special() && m_p_nd->m_p_parent->m_p_parent == m_p_nd)
262 	    m_p_nd = m_p_nd->m_p_right;
266 	if (m_p_nd->m_p_left != NULL)
268 	    Node_Pointer p_y = m_p_nd->m_p_left;
271 	    m_p_nd = p_y;
275 	Node_Pointer p_y = m_p_nd->m_p_parent;
276 	while (m_p_nd == p_y->m_p_left)
278 	    m_p_nd = p_y;
281 	if (m_p_nd->m_p_left != p_y)
282 	  m_p_nd = p_y;
286       Node_Pointer m_p_nd;
312       : PB_DS_TREE_CONST_IT_C_DEC(other.m_p_nd)
319 	base_it_type::m_p_nd = other.m_p_nd;
327 	base_it_type::m_p_nd = other.m_p_nd;
334 	_GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != NULL);
335 	return &base_it_type::m_p_nd->m_value;
341 	_GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != NULL);
342 	return base_it_type::m_p_nd->m_value;
355 	PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);
370 	PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);