Searched refs:_M_root (Results 1 - 3 of 3) sorted by relevance

/haiku/headers/cpp/
H A Dstl_rope.h766 _My_rope* _M_root; // The whole rope. member in class:_Rope_char_ref_proxy
769 _M_pos(__p), _M_current_valid(false), _M_root(__r) {}
771 _M_pos(__x._M_pos), _M_current_valid(false), _M_root(__x._M_root) {}
778 _M_pos(__p), _M_current(__c), _M_current_valid(true), _M_root(__r) {}
819 rope<_CharT,_Alloc>* _M_root; // The whole rope. member in class:_Rope_char_ptr_proxy
822 : _M_pos(__x._M_pos), _M_root(__x._M_root) {}
824 : _M_pos(__x._M_pos), _M_root(__x._M_root) {}
869 _RopeRep* _M_root; // The whole rope. member in class:_Rope_iterator_base
[all...]
H A Dstl_tree.h581 _Link_type& _M_root() const function in class:_Rb_tree
660 if (__x._M_root() == 0)
664 _M_root() = _M_copy(__x._M_root(), _M_header);
665 _M_leftmost() = _S_minimum(_M_root());
666 _M_rightmost() = _S_maximum(_M_root());
678 _M_root() = 0;
734 _M_erase(_M_root());
736 _M_root() = 0;
804 if (__x._M_root()
[all...]
H A Dropeimpl.h88 __stl_assert(__pos <= __x._M_root->_M_size);
89 if (__pos >= __x._M_root->_M_size) {
93 __curr_rope = __x._M_root;
162 __stl_assert(__x._M_current_pos <= __x._M_root->_M_size);
246 if (_M_root_rope->_M_tree_ptr != _M_root) {
248 _RopeRep::_S_unref(_M_root);
249 _M_root = _M_root_rope->_M_tree_ptr;
250 _RopeRep::_S_ref(_M_root);
268 _RopeRep::_S_ref(_M_root);
1325 _RopeRep* __old = _M_root
[all...]

Completed in 28 milliseconds