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

/external/stlport/stlport/stl/
H A D_rope.h662 _My_rope* _M_root; // The whole rope. member in class:_Rope_char_ref_proxy
665 _M_pos(__p), _M_current_valid(false), _M_root(__r) {}
667 _M_pos(__x._M_pos), _M_current_valid(false), _M_root(__x._M_root) {}
673 : _M_pos(__p), _M_current(__c), _M_current_valid(true), _M_root(__r) {}
720 rope<_CharT,_Alloc>* _M_root; // The whole rope. member in class:_Rope_char_ptr_proxy
723 : _M_pos(__x._M_pos), _M_root(__x._M_root) {}
725 : _M_pos(__x._M_pos), _M_root(__x._M_root) {}
766 _RopeRep* _M_root; member in class:_Rope_iterator_base
[all...]
H A D_tree.c328 if (__x._M_root() == 0) {
329 _M_root() = 0;
334 _M_root() = _M_copy(__x._M_root(), &this->_M_header._M_data);
335 _M_leftmost() = _S_minimum(_M_root());
336 _M_rightmost() = _S_maximum(_M_root());
361 _M_root() = __new_node;
389 _Base_ptr __x = _M_root();
407 _Base_ptr __x = _M_root();
689 int __len = __black_count(_M_leftmost(), _M_root());
[all...]
H A D_tree.h335 _Base_ptr _M_root() const function in class:_Rb_tree
342 _Base_ptr& _M_root() function in class:_Rb_tree
397 if (__x._M_root() != 0) {
399 _M_root() = _M_copy(__x._M_root(), &this->_M_header._M_data);
400 _M_leftmost() = _S_minimum(_M_root());
401 _M_rightmost() = _S_maximum(_M_root());
532 _M_erase(_M_root());
534 _M_root() = 0;
550 _Base_ptr __x = _M_root(); // Curren
[all...]
H A D_rope.c61 _M_root_rope(__r) { _RopeRep::_S_ref(this->_M_root); }
68 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*this);
71 _RopeRep::_S_ref(this->_M_root); if (!(__r.empty()))_S_setcache(*__x);
145 _STLP_ASSERT(__pos <= __x._M_root->_M_size._M_data)
146 if (__pos >= __x._M_root->_M_size._M_data) {
150 __curr_rope = __x._M_root;
217 _STLP_ASSERT(__x._M_current_pos <= __x._M_root->_M_size._M_data)
300 if (_M_root_rope->_M_tree_ptr._M_data != this->_M_root) {
302 _RopeRep::_S_unref(this->_M_root);
303 this->_M_root
[all...]

Completed in 120 milliseconds