Home
last modified time | relevance | path

Searched refs:_M_tree_ptr (Results 1 – 2 of 2) sorted by relevance

/haiku/headers/cpp/
H A Dstl_rope.h950 _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos) {} in _Rope_const_iterator()
1044 : _Rope_iterator_base<_CharT,_Alloc>(__r->_M_tree_ptr, __pos), in _Rope_iterator()
1171 : _M_tree_ptr(__t), _M_data_allocator(__a) {} in _Rope_alloc_base()
1178 _RopeRep* _M_tree_ptr; variable
1201 : _M_tree_ptr(__t) {} in _Rope_alloc_base()
1206 _RopeRep *_M_tree_ptr;
1242 _Rope_base(_RopeRep * __t, const allocator_type&) : _M_tree_ptr(__t) {} in _Rope_base()
1247 _RopeRep* _M_tree_ptr;
1287 using _Base::_M_tree_ptr;
1407 _S_apply_to_pieces(__c, _M_tree_ptr, __begin, __end);
[all …]
H A Dropeimpl.h246 if (_M_root_rope->_M_tree_ptr != _M_root) { in _M_check()
249 _M_root = _M_root_rope->_M_tree_ptr; in _M_check()
265 : _Rope_iterator_base<_CharT,_Alloc>(__r._M_tree_ptr, __pos), in _Rope_iterator()
952 _S_apply_to_pieces(__c, _M_tree_ptr, __start, size()); in find()
1325 _RopeRep* __old = _M_root->_M_tree_ptr;
1351 _M_root->_M_tree_ptr = __result;
1361 return _My_rope::_S_fetch(_M_root->_M_tree_ptr, _M_pos); in _CharT()
1399 __remainder_rope._M_tree_ptr = __remainder; in rope()
1413 __base_rope._M_tree_ptr = __base_leaf; in rope()
1417 __stl_assert(2 == __result._M_tree_ptr->_M_refcount); in rope()
[all …]