Lines Matching refs:_Rb_tree_node_base
87 struct _Rb_tree_node_base
89 typedef _Rb_tree_node_base* _Base_ptr;
90 typedef const _Rb_tree_node_base* _Const_Base_ptr;
127 struct _Rb_tree_node : public _Rb_tree_node_base
135 : _Rb_tree_node_base(),
140 _Rb_tree_node_base*
141 _Rb_tree_increment(_Rb_tree_node_base* __x);
143 const _Rb_tree_node_base*
144 _Rb_tree_increment(const _Rb_tree_node_base* __x);
146 _Rb_tree_node_base*
147 _Rb_tree_decrement(_Rb_tree_node_base* __x);
149 const _Rb_tree_node_base*
150 _Rb_tree_decrement(const _Rb_tree_node_base* __x);
163 typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
235 typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
311 _Rb_tree_node_base* __x,
312 _Rb_tree_node_base* __p,
313 _Rb_tree_node_base& __header);
315 _Rb_tree_node_base*
316 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
317 _Rb_tree_node_base& __header);
328 typedef _Rb_tree_node_base* _Base_ptr;
329 typedef const _Rb_tree_node_base* _Const_Base_ptr;
429 _Rb_tree_node_base _M_header;
573 { return _Rb_tree_node_base::_S_minimum(__x); }
577 { return _Rb_tree_node_base::_S_minimum(__x); }
581 { return _Rb_tree_node_base::_S_maximum(__x); }
585 { return _Rb_tree_node_base::_S_maximum(__x); }
1492 _Rb_tree_black_count(const _Rb_tree_node_base* __node,
1493 const _Rb_tree_node_base* __root);
1526 if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
1528 if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
