/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
regex_nfa.h | 205 _StateIdT _M_next; // outgoing transition 212 : _M_opcode(__opcode), _M_next(_S_invalid_state_id) 216 : _M_opcode(_S_opcode_match), _M_next(_S_invalid_state_id), _M_matches(__m) 220 : _M_opcode(__opcode), _M_next(_S_invalid_state_id), _M_subexpr(__s), 225 : _M_opcode(_S_opcode_alternative), _M_next(__next), _M_alt(__alt)
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
hashtable_policy.h | 76 _Hash_node* _M_next; 83 _Hash_node* _M_next; 96 { _M_cur = _M_cur->_M_next; } 215 _M_cur_node = _M_cur_node->_M_next;
|
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/debug/ |
_debug.h | 287 __owned_link(const __owned_list* __c) : _M_self(this), _M_owner(0), _M_next(0) 293 __owned_link(const __owned_list* __c) : _M_owner(0), _M_next(0) 323 void _Invalidate() { _M_owner = 0; _M_next = 0; } 324 void _Link_to_self() { _M_next = 0; } 326 __owned_link* _Next() { return _M_next; } 327 const __owned_link* _Next() const { return _M_next; } 335 __owned_link* _M_next; 344 _M_node._M_next = 0; 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; }
|
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/debug/ |
_debug.h | 287 __owned_link(const __owned_list* __c) : _M_self(this), _M_owner(0), _M_next(0) 293 __owned_link(const __owned_list* __c) : _M_owner(0), _M_next(0) 323 void _Invalidate() { _M_owner = 0; _M_next = 0; } 324 void _Link_to_self() { _M_next = 0; } 326 __owned_link* _Next() { return _M_next; } 327 const __owned_link* _Next() const { return _M_next; } 335 __owned_link* _M_next; 344 _M_node._M_next = 0; 360 const __owned_link* _First() const { return (__owned_link*)_M_node._M_next; }
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
hashtable_policy.h | 77 _Hash_node* _M_next; 82 _M_hash_code(), _M_next() { } 89 _Hash_node* _M_next; 94 _M_next() { } 107 { _M_cur = _M_cur->_M_next; } 224 _M_cur_node = _M_cur_node->_M_next;
|
regex_nfa.h | 205 _StateIdT _M_next; // outgoing transition 212 : _M_opcode(__opcode), _M_next(_S_invalid_state_id) 216 : _M_opcode(_S_opcode_match), _M_next(_S_invalid_state_id), _M_matches(__m) 220 : _M_opcode(__opcode), _M_next(_S_invalid_state_id), _M_subexpr(__s), 225 : _M_opcode(_S_opcode_alternative), _M_next(__next), _M_alt(__alt)
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
hashtable_policy.h | 76 _Hash_node* _M_next; 83 _Hash_node* _M_next; 96 { _M_cur = _M_cur->_M_next; } 215 _M_cur_node = _M_cur_node->_M_next;
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
forward_list.h | 51 _Fwd_list_node_base() : _M_next(0) { } 53 _Fwd_list_node_base* _M_next; 59 _Fwd_list_node_base* __keep = __begin->_M_next; 62 __begin->_M_next = __end->_M_next; 63 __end->_M_next = _M_next; 66 __begin->_M_next = 0; 67 _M_next = __keep; 74 _Fwd_list_node_base* __tail = _M_next; [all...] |
regex_nfa.h | 205 _StateIdT _M_next; // outgoing transition 212 : _M_opcode(__opcode), _M_next(_S_invalid_state_id) 216 : _M_opcode(_S_opcode_match), _M_next(_S_invalid_state_id), _M_matches(__m) 220 : _M_opcode(__opcode), _M_next(_S_invalid_state_id), _M_subexpr(__s), 225 : _M_opcode(_S_opcode_alternative), _M_next(__next), _M_alt(__alt)
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
hashtable_policy.h | 76 _Hash_node* _M_next; 83 _Hash_node* _M_next; 96 { _M_cur = _M_cur->_M_next; } 215 _M_cur_node = _M_cur_node->_M_next;
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
regex_nfa.h | 216 _StateIdT _M_next; // outgoing transition 223 : _M_opcode(__opcode), _M_next(_S_invalid_state_id) 227 : _M_opcode(_S_opcode_match), _M_next(_S_invalid_state_id), _M_matches(__m) 231 : _M_opcode(__opcode), _M_next(_S_invalid_state_id), _M_subexpr(__s), 236 : _M_opcode(_S_opcode_alternative), _M_next(__next), _M_alt(__alt)
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/tr1/ |
hashtable_policy.h | 76 _Hash_node* _M_next; 83 _Hash_node* _M_next; 96 { _M_cur = _M_cur->_M_next; } 215 _M_cur_node = _M_cur_node->_M_next;
|
/external/stlport/src/ |
allocators.cpp | 242 _Node_alloc_obj * _M_next; 329 *__my_free_list = __r->_M_next; 346 __pobj->_M_next = *__my_free_list; 387 __REINTERPRET_CAST(_Obj*, _S_start_free)->_M_next = *__my_free_list; 408 *__my_free_list = __p -> _M_next; 423 __REINTERPRET_CAST(_Obj*, _S_start_free)->_M_next = _S_chunks; 451 __current_obj->_M_next = __next_obj; 453 __next_obj->_M_next = 0; 471 __pnext = __pcur->_M_next; 683 _Obj* __next = __chunk->_M_next; [all...] |
/external/stlport/stlport/stl/ |
_list.h | 58 _List_node_base* _M_next; 91 void _M_incr() { _M_node = _M_node->_M_next; } 199 _M_node._M_data._M_prev->_M_next = _M_node._M_data._M_next->_M_prev = &_M_node._M_data; 208 bool empty() const { return _M_node._M_data._M_next == &_M_node._M_data; } 211 _M_node._M_data._M_next = &_M_node._M_data; 212 _M_node._M_data._M_prev = _M_node._M_data._M_next; 367 iterator begin() { return iterator(this->_M_node._M_data._M_next); } 368 const_iterator begin() const { return const_iterator(this->_M_node._M_data._M_next); } 393 __x._M_node._M_data._M_next = this->_M_node._M_data._M_next [all...] |
/ndk/sources/cxx-stl/stlport/src/ |
allocators.cpp | 242 _Node_alloc_obj * _M_next; 329 *__my_free_list = __r->_M_next; 346 __pobj->_M_next = *__my_free_list; 387 __REINTERPRET_CAST(_Obj*, _S_start_free)->_M_next = *__my_free_list; 408 *__my_free_list = __p -> _M_next; 423 __REINTERPRET_CAST(_Obj*, _S_start_free)->_M_next = _S_chunks; 451 __current_obj->_M_next = __next_obj; 453 __next_obj->_M_next = 0; 471 __pnext = __pcur->_M_next; 683 _Obj* __next = __chunk->_M_next; [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_list.h | 58 _List_node_base* _M_next; 91 void _M_incr() { _M_node = _M_node->_M_next; } 199 _M_node._M_data._M_prev->_M_next = _M_node._M_data._M_next->_M_prev = &_M_node._M_data; 208 bool empty() const { return _M_node._M_data._M_next == &_M_node._M_data; } 211 _M_node._M_data._M_next = &_M_node._M_data; 212 _M_node._M_data._M_prev = _M_node._M_data._M_next; 367 iterator begin() { return iterator(this->_M_node._M_data._M_next); } 368 const_iterator begin() const { return const_iterator(this->_M_node._M_data._M_next); } 393 __x._M_node._M_data._M_next = this->_M_node._M_data._M_next [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/ |
hashtable.h | 85 _Hashtable_node* _M_next; 425 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next) 510 __first = __first->_M_next) 522 __first = __first->_M_next) 534 __cur = __cur->_M_next) 601 __n->_M_next = 0; 638 _M_cur = _M_cur->_M_next; 666 _M_cur = _M_cur->_M_next; 703 __cur1 = __cur1->_M_next, __cur2 = __cur2->_M_next) [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
forward_list.h | 61 _Pointer _M_next; 63 _Fwd_list_node_base() : _M_next(0) { } 67 { std::swap(__x._M_next, __y._M_next); } 137 _M_node = _M_node->_M_next; 145 _M_node = _M_node->_M_next; 158 _M_next() const 161 return _Fwd_list_iterator(_M_node->_M_next); 208 _M_node = _M_node->_M_next; 216 _M_node = _M_node->_M_next; [all...] |
stl_list.h | 73 _List_node_base* _M_next; 143 _M_node = _M_node->_M_next; 151 _M_node = _M_node->_M_next; 223 _M_node = _M_node->_M_next; 231 _M_node = _M_node->_M_next; 368 this->_M_impl._M_node._M_next = &this->_M_impl._M_node; 690 { return iterator(this->_M_impl._M_node._M_next); } 699 { return const_iterator(this->_M_impl._M_node._M_next); } 763 { return const_iterator(this->_M_impl._M_node._M_next); } 800 { return this->_M_impl._M_node._M_next == &this->_M_impl._M_node; [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
mt_allocator.h | 129 _Block_address* _M_next; 198 _Block_record* _M_next; 274 _Thread_record* _M_next; 283 _Block_record* _M_next; 706 __bin._M_first[__thread_id] = __block->_M_next;
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/backward/ |
hashtable.h | 87 _Hashtable_node* _M_next; 445 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next) 530 __first = __first->_M_next) 542 __first = __first->_M_next) 554 __cur = __cur->_M_next) 621 __n->_M_next = 0; 658 _M_cur = _M_cur->_M_next; 686 _M_cur = _M_cur->_M_next; 723 __cur1 = __cur1->_M_next, __cur2 = __cur2->_M_next) [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
forward_list.h | 49 _Fwd_list_node_base() : _M_next(0) { } 51 _Fwd_list_node_base* _M_next; 57 while (__end && __end->_M_next) 58 __end = __end->_M_next; 66 _Fwd_list_node_base* __keep = __begin->_M_next; 69 __begin->_M_next = __end->_M_next; 70 __end->_M_next = _M_next; 73 __begin->_M_next = 0 [all...] |
stl_list.h | 79 _List_node_base* _M_next; 174 _M_node = _M_node->_M_next; 182 _M_node = _M_node->_M_next; 254 _M_node = _M_node->_M_next; 262 _M_node = _M_node->_M_next; 400 this->_M_impl._M_node._M_next = &this->_M_impl._M_node; 751 { return iterator(this->_M_impl._M_node._M_next); } 760 { return const_iterator(this->_M_impl._M_node._M_next); } 824 { return const_iterator(this->_M_impl._M_node._M_next); } 861 { return this->_M_impl._M_node._M_next == &this->_M_impl._M_node; [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/ |
mt_allocator.h | 131 _Block_address* _M_next; 200 _Block_record* _M_next; 276 _Thread_record* _M_next; 285 _Block_record* _M_next; 708 __bin._M_first[__thread_id] = __block->_M_next;
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/backward/ |
hashtable.h | 87 _Hashtable_node* _M_next; 445 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next) 530 __first = __first->_M_next) 542 __first = __first->_M_next) 554 __cur = __cur->_M_next) 621 __n->_M_next = 0; 658 _M_cur = _M_cur->_M_next; 686 _M_cur = _M_cur->_M_next; 723 __cur1 = __cur1->_M_next, __cur2 = __cur2->_M_next) [all...] |