| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_set.h | 409 std::pair<typename _Rep_type::iterator, bool> __p = local
411 return std::pair<iterator, bool>(__p.first, __p.second);
418 std::pair<typename _Rep_type::iterator, bool> __p = local
420 return std::pair<iterator, bool>(__p.first, __p.second);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_set.h | 414 std::pair<typename _Rep_type::iterator, bool> __p = local
416 return std::pair<iterator, bool>(__p.first, __p.second);
423 std::pair<typename _Rep_type::iterator, bool> __p = local
425 return std::pair<iterator, bool>(__p.first, __p.second);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_set.h | 462 std::pair<typename _Rep_type::iterator, bool> __p = local
464 return std::pair<iterator, bool>(__p.first, __p.second);
471 std::pair<typename _Rep_type::iterator, bool> __p = local
473 return std::pair<iterator, bool>(__p.first, __p.second);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_set.h | 501 std::pair<typename _Rep_type::iterator, bool> __p = local
503 return std::pair<iterator, bool>(__p.first, __p.second);
510 std::pair<typename _Rep_type::iterator, bool> __p = local
512 return std::pair<iterator, bool>(__p.first, __p.second);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/ |
| hashtable_policy.h | 102 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
103 : _M_cur(__p) { }
142 _Node_iterator(_Hash_node<_Value, __cache>* __p)
143 : _Node_iterator_base<_Value, __cache>(__p) { }
183 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
184 : _Node_iterator_base<_Value, __cache>(__p) { }
280 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
282 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
325 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
327 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
430 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
444 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
472 const unsigned long* __p = local
545 typename _Hashtable::_Node* __p = local
564 typename _Hashtable::_Node* __p = local
584 typename _Hashtable::_Node* __p = local
602 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/ |
| rc_string_base.h | 186 _M_data(_CharT* __p)
187 { _M_dataplus._M_p = __p; }
438 _Rep* __p = new (__place) _Rep; local
439 __p->_M_info._M_capacity = __capacity;
440 return __p;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
423 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
437 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
465 const unsigned long* __p = local
527 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| shared_ptr_base.h | 285 _Sp_counted_ptr(_Ptr __p)
286 : _M_ptr(__p) { }
335 // __d(__p) must not throw.
336 _Sp_counted_deleter(_Ptr __p, _Deleter __d)
337 : _M_ptr(__p), _M_del(__d, _Alloc()) { }
339 // __d(__p) must not throw.
340 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a)
341 : _M_ptr(__p), _M_del(__d, __a) { }
448 __shared_count(_Ptr __p) : _M_pi(0)
452 _M_pi = new _Sp_counted_ptr<_Ptr, _Lp>(__p);
961 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/ |
| rc_string_base.h | 185 _M_data(_CharT* __p)
186 { _M_dataplus._M_p = __p; }
437 _Rep* __p = new (__place) _Rep; local
438 __p->_M_info._M_capacity = __capacity;
439 return __p;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
423 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
437 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
465 const unsigned long* __p = local
527 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| shared_ptr_base.h | 285 _Sp_counted_ptr(_Ptr __p)
286 : _M_ptr(__p) { }
335 // __d(__p) must not throw.
336 _Sp_counted_deleter(_Ptr __p, _Deleter __d)
337 : _M_ptr(__p), _M_del(__d, _Alloc()) { }
339 // __d(__p) must not throw.
340 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a)
341 : _M_ptr(__p), _M_del(__d, __a) { }
448 __shared_count(_Ptr __p) : _M_pi(0)
452 _M_pi = new _Sp_counted_ptr<_Ptr, _Lp>(__p);
961 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/ |
| rc_string_base.h | 185 _M_data(_CharT* __p)
186 { _M_dataplus._M_p = __p; }
437 _Rep* __p = new (__place) _Rep; local
438 __p->_M_info._M_capacity = __capacity;
439 return __p;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
423 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
437 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
465 const unsigned long* __p = local
527 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/ |
| rc_string_base.h | 184 _M_data(_CharT* __p)
185 { _M_dataplus._M_p = __p; }
424 _Rep* __p = new (__place) _Rep; local
425 __p->_M_info._M_capacity = __capacity;
426 return __p;
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 125 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
126 : _M_cur(__p) { }
167 _Node_iterator(_Hash_node<_Value, __cache>* __p)
168 : _Node_iterator_base<_Value, __cache>(__p) { }
208 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
209 : _Node_iterator_base<_Value, __cache>(__p) { }
307 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
309 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
352 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
354 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
457 const unsigned long* __p = __lower_bound(__prime_list, __prime_list local
471 const unsigned long* __p = __lower_bound(__prime_list, __prime_list local
499 const unsigned long* __p = local
571 typename _Hashtable::_Node* __p = local
591 typename _Hashtable::_Node* __p = local
609 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/ |
| rc_string_base.h | 184 _M_data(_CharT* __p)
185 { _M_dataplus._M_p = __p; }
424 _Rep* __p = new (__place) _Rep; local
425 __p->_M_info._M_capacity = __capacity;
426 return __p;
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 125 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
126 : _M_cur(__p) { }
167 _Node_iterator(_Hash_node<_Value, __cache>* __p)
168 : _Node_iterator_base<_Value, __cache>(__p) { }
208 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
209 : _Node_iterator_base<_Value, __cache>(__p) { }
307 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
309 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
352 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
354 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
457 const unsigned long* __p = __lower_bound(__prime_list, __prime_list local
471 const unsigned long* __p = __lower_bound(__prime_list, __prime_list local
499 const unsigned long* __p = local
571 typename _Hashtable::_Node* __p = local
591 typename _Hashtable::_Node* __p = local
609 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/ |
| rc_string_base.h | 184 _M_data(_CharT* __p)
185 { _M_dataplus._M_p = __p; }
424 _Rep* __p = new (__place) _Rep; local
425 __p->_M_info._M_capacity = __capacity;
426 return __p;
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 125 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
126 : _M_cur(__p) { }
167 _Node_iterator(_Hash_node<_Value, __cache>* __p)
168 : _Node_iterator_base<_Value, __cache>(__p) { }
208 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
209 : _Node_iterator_base<_Value, __cache>(__p) { }
307 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
309 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
352 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
354 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
457 const unsigned long* __p = __lower_bound(__prime_list, __prime_list local
471 const unsigned long* __p = __lower_bound(__prime_list, __prime_list local
499 const unsigned long* __p = local
571 typename _Hashtable::_Node* __p = local
591 typename _Hashtable::_Node* __p = local
609 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/ |
| rc_string_base.h | 184 _M_data(_CharT* __p)
185 { _M_dataplus._M_p = __p; }
424 _Rep* __p = new (__place) _Rep; local
425 __p->_M_info._M_capacity = __capacity;
426 return __p;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/tr1_impl/ |
| hashtable_policy.h | 125 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
126 : _M_cur(__p) { }
167 _Node_iterator(_Hash_node<_Value, __cache>* __p)
168 : _Node_iterator_base<_Value, __cache>(__p) { }
208 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
209 : _Node_iterator_base<_Value, __cache>(__p) { }
307 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
309 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
352 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
354 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
457 const unsigned long* __p = __lower_bound(__prime_list, __prime_list local
471 const unsigned long* __p = __lower_bound(__prime_list, __prime_list local
499 const unsigned long* __p = local
571 typename _Hashtable::_Node* __p = local
591 typename _Hashtable::_Node* __p = local
609 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hashtable_policy.h | 102 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
103 : _M_cur(__p) { }
142 _Node_iterator(_Hash_node<_Value, __cache>* __p)
143 : _Node_iterator_base<_Value, __cache>(__p) { }
183 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
184 : _Node_iterator_base<_Value, __cache>(__p) { }
280 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
282 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
325 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
327 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
430 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
444 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
472 const unsigned long* __p = local
545 typename _Hashtable::_Node* __p = local
564 typename _Hashtable::_Node* __p = local
584 typename _Hashtable::_Node* __p = local
602 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/ |
| rc_string_base.h | 186 _M_data(_CharT* __p)
187 { _M_dataplus._M_p = __p; }
438 _Rep* __p = new (__place) _Rep; local
439 __p->_M_info._M_capacity = __capacity;
440 return __p;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| hashtable_policy.h | 91 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
92 : _M_cur(__p) { }
133 _Node_iterator(_Hash_node<_Value, __cache>* __p)
134 : _Node_iterator_base<_Value, __cache>(__p) { }
174 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
175 : _Node_iterator_base<_Value, __cache>(__p) { }
273 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
275 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
318 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
320 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) {
423 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
437 const unsigned long* __p = std::lower_bound(__prime_list, __prime_list local
465 const unsigned long* __p = local
527 typename _Hashtable::_Node* __p = local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| shared_ptr_base.h | 288 _Sp_counted_ptr(_Ptr __p)
289 : _M_ptr(__p) { }
338 // __d(__p) must not throw.
339 _Sp_counted_deleter(_Ptr __p, _Deleter __d)
340 : _M_ptr(__p), _M_del(__d, _Alloc()) { }
342 // __d(__p) must not throw.
343 _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a)
344 : _M_ptr(__p), _M_del(__d, __a) { }
451 __shared_count(_Ptr __p) : _M_pi(0)
455 _M_pi = new _Sp_counted_ptr<_Ptr, _Lp>(__p);
1001 void* __p = _M_refcount._M_get_deleter(typeid(__tag)); local
[all...] |
