Home
last modified time | relevance | path

Searched refs:_M_right (Results 1 – 3 of 3) sorted by relevance

/haiku/headers/cpp/
H A Dstl_tree.h79 _Base_ptr _M_right; member
89 while (__x->_M_right != 0) __x = __x->_M_right; in _S_maximum()
111 if (_M_node->_M_right != 0) { in _M_increment()
112 _M_node = _M_node->_M_right; in _M_increment()
118 while (_M_node == __y->_M_right) { in _M_increment()
122 if (_M_node->_M_right != __y) in _M_increment()
131 _M_node = _M_node->_M_right; in _M_decrement()
134 while (__y->_M_right != 0) in _M_decrement()
135 __y = __y->_M_right; in _M_decrement()
219 _Rb_tree_node_base* __y = __x->_M_right; in _Rb_tree_rotate_left()
[all …]
H A Dropeimpl.h124 __curr_rope = __c->_M_right; in _S_setcache()
191 __current_node = __c->_M_right; in _S_setcache_for_incr()
499 && _RopeRep::_S_leaf == ((_RopeConcatenation*)__r)->_M_right->_M_tag) { in _S_concat_char_iter()
501 (_RopeLeaf* )(((_RopeConcatenation* )__r)->_M_right); in _S_concat_char_iter()
554 _RopeLeaf* __right = (_RopeLeaf*)(((_RopeConcatenation*)__r)->_M_right); in _S_destr_concat_char_iter()
568 ((_RopeConcatenation*)__r)->_M_right = __new_right; in _S_destr_concat_char_iter()
610 ((_RopeConcatenation*)__left)->_M_right->_M_tag) { in _S_concat()
612 (_RopeLeaf*)(((_RopeConcatenation*)__left)->_M_right); in _S_concat()
659 _RopeRep* __right = __c->_M_right; in _S_substring()
852 _RopeRep* __right = __conc->_M_right; in _S_apply_to_pieces()
[all …]
H A Dstl_rope.h591 _Rope_RopeRep<_CharT,_Alloc>* _M_right; member
599 _M_left(__l), _M_right(__r) in _Rope_RopeConcatenation()
605 _M_right->_M_unref_nonnil(); in ~_Rope_RopeConcatenation()