/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...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
ropeimpl.h | 70 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index]; 115 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1]; 116 const _RopeRep* __curr_rope; 154 _RopeRep* __left = __c->_M_left; 193 const _RopeRep* __current_node = __x._M_path_end[__current_index]; 299 _RopeRep::_S_unref(this->_M_root); 301 _RopeRep::_S_ref(this->_M_root); 319 { _RopeRep::_S_ref(this->_M_root); } 444 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len, 490 typename rope<_CharT, _Alloc>::_RopeRep* [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/ |
ropeimpl.h | 72 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index]; 117 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1]; 118 const _RopeRep* __curr_rope; 156 _RopeRep* __left = __c->_M_left; 195 const _RopeRep* __current_node = __x._M_path_end[__current_index]; 301 _RopeRep::_S_unref(this->_M_root); 303 _RopeRep::_S_ref(this->_M_root); 321 { _RopeRep::_S_ref(this->_M_root); } 446 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len, 492 typename rope<_CharT, _Alloc>::_RopeRep* [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/ |
ropeimpl.h | 72 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index]; 117 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1]; 118 const _RopeRep* __curr_rope; 156 _RopeRep* __left = __c->_M_left; 195 const _RopeRep* __current_node = __x._M_path_end[__current_index]; 301 _RopeRep::_S_unref(this->_M_root); 303 _RopeRep::_S_ref(this->_M_root); 321 { _RopeRep::_S_ref(this->_M_root); } 446 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len, 492 typename rope<_CharT, _Alloc>::_RopeRep* [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/ |
ropeimpl.h | 70 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index]; 115 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1]; 116 const _RopeRep* __curr_rope; 154 _RopeRep* __left = __c->_M_left; 193 const _RopeRep* __current_node = __x._M_path_end[__current_index]; 299 _RopeRep::_S_unref(this->_M_root); 301 _RopeRep::_S_ref(this->_M_root); 319 { _RopeRep::_S_ref(this->_M_root); } 444 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len, 490 typename rope<_CharT, _Alloc>::_RopeRep* [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/ |
ropeimpl.h | 70 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index]; 115 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1]; 116 const _RopeRep* __curr_rope; 154 _RopeRep* __left = __c->_M_left; 193 const _RopeRep* __current_node = __x._M_path_end[__current_index]; 299 _RopeRep::_S_unref(this->_M_root); 301 _RopeRep::_S_ref(this->_M_root); 319 { _RopeRep::_S_ref(this->_M_root); } 444 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len, 490 typename rope<_CharT, _Alloc>::_RopeRep* [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/ |
ropeimpl.h | 70 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index]; 115 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1]; 116 const _RopeRep* __curr_rope; 154 _RopeRep* __left = __c->_M_left; 193 const _RopeRep* __current_node = __x._M_path_end[__current_index]; 299 _RopeRep::_S_unref(this->_M_root); 301 _RopeRep::_S_ref(this->_M_root); 319 { _RopeRep::_S_ref(this->_M_root); } 444 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len, 490 typename rope<_CharT, _Alloc>::_RopeRep* [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/ |
ropeimpl.h | 70 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index]; 115 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1]; 116 const _RopeRep* __curr_rope; 154 _RopeRep* __left = __c->_M_left; 193 const _RopeRep* __current_node = __x._M_path_end[__current_index]; 299 _RopeRep::_S_unref(this->_M_root); 301 _RopeRep::_S_ref(this->_M_root); 319 { _RopeRep::_S_ref(this->_M_root); } 444 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len, 490 typename rope<_CharT, _Alloc>::_RopeRep* [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/ |
ropeimpl.h | 72 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index]; 117 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1]; 118 const _RopeRep* __curr_rope; 156 _RopeRep* __left = __c->_M_left; 195 const _RopeRep* __current_node = __x._M_path_end[__current_index]; 301 _RopeRep::_S_unref(this->_M_root); 303 _RopeRep::_S_ref(this->_M_root); 321 { _RopeRep::_S_ref(this->_M_root); } 446 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len, 492 typename rope<_CharT, _Alloc>::_RopeRep* [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/ |
ropeimpl.h | 72 const _RopeRep* __leaf = __x._M_path_end[__x._M_leaf_index]; 117 const _RopeRep* __path[int(__detail::_S_max_rope_depth) + 1]; 118 const _RopeRep* __curr_rope; 156 _RopeRep* __left = __c->_M_left; 195 const _RopeRep* __current_node = __x._M_path_end[__current_index]; 301 _RopeRep::_S_unref(this->_M_root); 303 _RopeRep::_S_ref(this->_M_root); 321 { _RopeRep::_S_ref(this->_M_root); } 446 _RopeRep::__STL_FREE_STRING(__new_data, __old_len + __len, 492 typename rope<_CharT, _Alloc>::_RopeRep* [all...] |