| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_tree.h | 323 _Rb_tree_node_base* __p,
373 _M_put_node(_Link_type __p)
374 { _M_impl._Node_allocator::deallocate(__p, 1); }
393 _M_destroy_node(_Link_type __p)
395 get_allocator().destroy(std::__addressof(__p->_M_value_field));
396 _M_put_node(__p);
419 _M_destroy_node(_Link_type __p)
421 _M_get_Node_allocator().destroy(__p);
422 _M_put_node(__p);
606 _M_insert_lower_node(_Base_ptr __p, _Link_type __z)
1769 pair<iterator, iterator> __p = equal_range(__x); local
1817 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/ |
| ropeimpl.h | 327 const _CharT* __p = __s; local
329 while (!_S_is0(*__p))
330 ++__p;
331 return (__p - __s);
869 _Rope_find_char_char_consumer(_CharT __p)
870 : _M_pattern(__p), _M_count(0) {}
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| basic_string.h | 186 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
187 return *reinterpret_cast<_Rep*>(__p);
296 _M_data(_CharT* __p)
297 { return (_M_dataplus._M_p = __p); }
384 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
386 for (; __k1 != __k2; ++__k1, ++__p)
387 traits_type::assign(*__p, *__k1); // These types are off.
391 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
392 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
395 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
[all...] |
| stl_algo.h | 1600 _RandomAccessIterator __p = __first; local
4243 pair<const _Tp*, const _Tp*> __p = local
4252 pair<const _Tp*, const _Tp*> __p = local
4789 _ForwardIterator2 __p; local
[all...] |
| stl_tree.h | 323 _Rb_tree_node_base* __p,
373 _M_put_node(_Link_type __p)
374 { _M_impl._Node_allocator::deallocate(__p, 1); }
393 _M_destroy_node(_Link_type __p)
395 get_allocator().destroy(std::__addressof(__p->_M_value_field));
396 _M_put_node(__p);
419 _M_destroy_node(_Link_type __p)
421 _M_get_Node_allocator().destroy(__p);
422 _M_put_node(__p);
606 _M_insert_lower_node(_Base_ptr __p, _Link_type __z)
1769 pair<iterator, iterator> __p = equal_range(__x); local
1817 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/ |
| ropeimpl.h | 327 const _CharT* __p = __s; local
329 while (!_S_is0(*__p))
330 ++__p;
331 return (__p - __s);
869 _Rope_find_char_char_consumer(_CharT __p)
870 : _M_pattern(__p), _M_count(0) {}
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| basic_string.h | 178 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
179 return *reinterpret_cast<_Rep*>(__p);
276 _M_data(_CharT* __p)
277 { return (_M_dataplus._M_p = __p); }
364 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
366 for (; __k1 != __k2; ++__k1, ++__p)
367 traits_type::assign(*__p, *__k1); // These types are off.
371 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
372 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
375 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
[all...] |
| stl_algo.h | 1651 _RandomAccessIterator __p = __first; local
4203 pair<const _Tp*, const _Tp*> __p = local
4212 pair<const _Tp*, const _Tp*> __p = local
4610 _ForwardIterator2 __p; local
[all...] |
| stl_tree.h | 312 _Rb_tree_node_base* __p,
362 _M_put_node(_Link_type __p)
363 { _M_impl._Node_allocator::deallocate(__p, 1); }
381 _M_destroy_node(_Link_type __p)
383 get_allocator().destroy(&__p->_M_value_field);
384 _M_put_node(__p);
406 _M_destroy_node(_Link_type __p)
408 _M_get_Node_allocator().destroy(__p);
409 _M_put_node(__p);
608 _M_copy(_Const_Link_type __x, _Link_type __p);
1412 pair<iterator, iterator> __p = equal_range(__x); local
1486 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/ |
| ropeimpl.h | 326 const _CharT* __p = __s; local
328 while (!_S_is0(*__p))
329 ++__p;
330 return (__p - __s);
868 _Rope_find_char_char_consumer(_CharT __p)
869 : _M_pattern(__p), _M_count(0) {}
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 133 _ForwardIter2 __p = __p1;
138 while (*__current == *__p) {
139 if (++__p == __last2)
465 _RandomAccessIter __p = __first; local
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
474 *__p = *(__p + __k)
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| basic_string.h | 178 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
179 return *reinterpret_cast<_Rep*>(__p);
276 _M_data(_CharT* __p)
277 { return (_M_dataplus._M_p = __p); }
364 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
366 for (; __k1 != __k2; ++__k1, ++__p)
367 traits_type::assign(*__p, *__k1); // These types are off.
371 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
372 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
375 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
[all...] |
| stl_algo.h | 1651 _RandomAccessIterator __p = __first; local
4203 pair<const _Tp*, const _Tp*> __p = local
4212 pair<const _Tp*, const _Tp*> __p = local
4610 _ForwardIterator2 __p; local
[all...] |
| stl_tree.h | 312 _Rb_tree_node_base* __p,
362 _M_put_node(_Link_type __p)
363 { _M_impl._Node_allocator::deallocate(__p, 1); }
381 _M_destroy_node(_Link_type __p)
383 get_allocator().destroy(&__p->_M_value_field);
384 _M_put_node(__p);
406 _M_destroy_node(_Link_type __p)
408 _M_get_Node_allocator().destroy(__p);
409 _M_put_node(__p);
608 _M_copy(_Const_Link_type __x, _Link_type __p);
1412 pair<iterator, iterator> __p = equal_range(__x); local
1486 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/ |
| ropeimpl.h | 326 const _CharT* __p = __s; local
328 while (!_S_is0(*__p))
329 ++__p;
330 return (__p - __s);
868 _Rope_find_char_char_consumer(_CharT __p)
869 : _M_pattern(__p), _M_count(0) {}
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 133 _ForwardIter2 __p = __p1;
138 while (*__current == *__p) {
139 if (++__p == __last2)
465 _RandomAccessIter __p = __first; local
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
474 *__p = *(__p + __k)
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| basic_string.h | 178 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
179 return *reinterpret_cast<_Rep*>(__p);
276 _M_data(_CharT* __p)
277 { return (_M_dataplus._M_p = __p); }
364 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
366 for (; __k1 != __k2; ++__k1, ++__p)
367 traits_type::assign(*__p, *__k1); // These types are off.
371 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
372 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
375 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
[all...] |
| stl_algo.h | 1651 _RandomAccessIterator __p = __first; local
4203 pair<const _Tp*, const _Tp*> __p = local
4212 pair<const _Tp*, const _Tp*> __p = local
4610 _ForwardIterator2 __p; local
[all...] |
| stl_tree.h | 312 _Rb_tree_node_base* __p,
362 _M_put_node(_Link_type __p)
363 { _M_impl._Node_allocator::deallocate(__p, 1); }
381 _M_destroy_node(_Link_type __p)
383 get_allocator().destroy(&__p->_M_value_field);
384 _M_put_node(__p);
406 _M_destroy_node(_Link_type __p)
408 _M_get_Node_allocator().destroy(__p);
409 _M_put_node(__p);
608 _M_copy(_Const_Link_type __x, _Link_type __p);
1412 pair<iterator, iterator> __p = equal_range(__x); local
1486 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/ |
| ropeimpl.h | 326 const _CharT* __p = __s; local
328 while (!_S_is0(*__p))
329 ++__p;
330 return (__p - __s);
868 _Rope_find_char_char_consumer(_CharT __p)
869 : _M_pattern(__p), _M_count(0) {}
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 133 _ForwardIter2 __p = __p1;
138 while (*__current == *__p) {
139 if (++__p == __last2)
465 _RandomAccessIter __p = __first; local
469 if (__p > __first + __l) {
470 *__p = *(__p - __l);
471 __p -= __l;
474 *__p = *(__p + __k)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| basic_string.h | 178 void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); local
179 return *reinterpret_cast<_Rep*>(__p);
276 _M_data(_CharT* __p)
277 { return (_M_dataplus._M_p = __p); }
364 _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
366 for (; __k1 != __k2; ++__k1, ++__p)
367 traits_type::assign(*__p, *__k1); // These types are off.
371 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
372 { _S_copy_chars(__p, __k1.base(), __k2.base()); }
375 _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2
[all...] |
| stl_algo.h | 1651 _RandomAccessIterator __p = __first; local
4203 pair<const _Tp*, const _Tp*> __p = local
4212 pair<const _Tp*, const _Tp*> __p = local
4610 _ForwardIterator2 __p; local
[all...] |
| stl_tree.h | 312 _Rb_tree_node_base* __p,
362 _M_put_node(_Link_type __p)
363 { _M_impl._Node_allocator::deallocate(__p, 1); }
381 _M_destroy_node(_Link_type __p)
383 get_allocator().destroy(&__p->_M_value_field);
384 _M_put_node(__p);
406 _M_destroy_node(_Link_type __p)
408 _M_get_Node_allocator().destroy(__p);
409 _M_put_node(__p);
608 _M_copy(_Const_Link_type __x, _Link_type __p);
1404 pair<iterator, iterator> __p = equal_range(__x); local
1478 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/ |
| ropeimpl.h | 326 const _CharT* __p = __s; local
328 while (!_S_is0(*__p))
329 ++__p;
330 return (__p - __s);
868 _Rope_find_char_char_consumer(_CharT __p)
869 : _M_pattern(__p), _M_count(0) {}
[all...] |
