/external/stlport/stlport/stl/ |
_rope.c | 61 _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); 92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index]; 97 case _RopeRep::_S_leaf: 103 case _RopeRep::_S_function: 104 case _RopeRep::_S_substringfn: 138 const _RopeRep* __path[_RopeRep::_S_max_rope_depth+1]; 139 const _RopeRep* __curr_rope [all...] |
_rope.h | 319 // are members of _RopeRep. Most of the more complex algorithms 322 // Some of the static member functions of _RopeRep have identically 323 // named functions in rope that simply invoke the _RopeRep versions. 459 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 460 typedef typename _RopeRep::_IsBasicCharType _IsBasicCharType; 468 typedef typename _RopeRep::allocator_type allocator_type; 471 : _Rope_RopeRep<_CharT,_Alloc>(_RopeRep::_S_leaf, 0, true, _p_size, __a), 489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator()); 496 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 499 _RopeRep* _M_left [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_rope.c | 61 _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); 92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index]; 97 case _RopeRep::_S_leaf: 103 case _RopeRep::_S_function: 104 case _RopeRep::_S_substringfn: 138 const _RopeRep* __path[_RopeRep::_S_max_rope_depth+1]; 139 const _RopeRep* __curr_rope [all...] |
_rope.h | 319 // are members of _RopeRep. Most of the more complex algorithms 322 // Some of the static member functions of _RopeRep have identically 323 // named functions in rope that simply invoke the _RopeRep versions. 459 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 460 typedef typename _RopeRep::_IsBasicCharType _IsBasicCharType; 468 typedef typename _RopeRep::allocator_type allocator_type; 471 : _Rope_RopeRep<_CharT,_Alloc>(_RopeRep::_S_leaf, 0, true, _p_size, __a), 489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator()); 496 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 499 _RopeRep* _M_left [all...] |
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
_rope.c | 61 _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); 92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index]; 97 case _RopeRep::_S_leaf: 103 case _RopeRep::_S_function: 104 case _RopeRep::_S_substringfn: 138 const _RopeRep* __path[_RopeRep::_S_max_rope_depth+1]; 139 const _RopeRep* __curr_rope [all...] |
_rope.h | 319 // are members of _RopeRep. Most of the more complex algorithms 322 // Some of the static member functions of _RopeRep have identically 323 // named functions in rope that simply invoke the _RopeRep versions. 459 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 460 typedef typename _RopeRep::_IsBasicCharType _IsBasicCharType; 468 typedef typename _RopeRep::allocator_type allocator_type; 471 : _Rope_RopeRep<_CharT,_Alloc>(_RopeRep::_S_leaf, 0, true, _p_size, __a), 489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator()); 496 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 499 _RopeRep* _M_left [all...] |
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
_rope.c | 61 _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); 92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index]; 97 case _RopeRep::_S_leaf: 103 case _RopeRep::_S_function: 104 case _RopeRep::_S_substringfn: 138 const _RopeRep* __path[_RopeRep::_S_max_rope_depth+1]; 139 const _RopeRep* __curr_rope [all...] |
_rope.h | 319 // are members of _RopeRep. Most of the more complex algorithms 322 // Some of the static member functions of _RopeRep have identically 323 // named functions in rope that simply invoke the _RopeRep versions. 459 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 460 typedef typename _RopeRep::_IsBasicCharType _IsBasicCharType; 468 typedef typename _RopeRep::allocator_type allocator_type; 471 : _Rope_RopeRep<_CharT,_Alloc>(_RopeRep::_S_leaf, 0, true, _p_size, __a), 489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator()); 496 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 499 _RopeRep* _M_left [all...] |
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
_rope.c | 61 _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); 92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index]; 97 case _RopeRep::_S_leaf: 103 case _RopeRep::_S_function: 104 case _RopeRep::_S_substringfn: 138 const _RopeRep* __path[_RopeRep::_S_max_rope_depth+1]; 139 const _RopeRep* __curr_rope [all...] |
_rope.h | 319 // are members of _RopeRep. Most of the more complex algorithms 322 // Some of the static member functions of _RopeRep have identically 323 // named functions in rope that simply invoke the _RopeRep versions. 459 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 460 typedef typename _RopeRep::_IsBasicCharType _IsBasicCharType; 468 typedef typename _RopeRep::allocator_type allocator_type; 471 : _Rope_RopeRep<_CharT,_Alloc>(_RopeRep::_S_leaf, 0, true, _p_size, __a), 489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator()); 496 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 499 _RopeRep* _M_left [all...] |
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
_rope.c | 61 _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); 92 const _RopeRep* __leaf = __x._M_path_end._M_data[__x._M_leaf_index]; 97 case _RopeRep::_S_leaf: 103 case _RopeRep::_S_function: 104 case _RopeRep::_S_substringfn: 138 const _RopeRep* __path[_RopeRep::_S_max_rope_depth+1]; 139 const _RopeRep* __curr_rope [all...] |
_rope.h | 319 // are members of _RopeRep. Most of the more complex algorithms 322 // Some of the static member functions of _RopeRep have identically 323 // named functions in rope that simply invoke the _RopeRep versions. 459 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 460 typedef typename _RopeRep::_IsBasicCharType _IsBasicCharType; 468 typedef typename _RopeRep::allocator_type allocator_type; 471 : _Rope_RopeRep<_CharT,_Alloc>(_RopeRep::_S_leaf, 0, true, _p_size, __a), 489 _RopeRep::_S_free_string(_M_data, this->_M_size._M_data, this->get_allocator()); 496 typedef _Rope_RopeRep<_CharT,_Alloc> _RopeRep; 499 _RopeRep* _M_left [all...] |