/ndk/sources/cxx-stl/stlport/stlport/stl/ |
D | _list.c | 144 _Literator __next = __first; in _S_remove_if() local 145 ++__next; in _S_remove_if() 147 __first = __next; in _S_remove_if() 157 _Literator __next = __first; in _S_unique() local 158 while (++__next != __last) { in _S_unique() 159 if (__binary_pred(*__first, *__next)) in _S_unique() 160 __that.erase(__next); in _S_unique() 162 __first = __next; in _S_unique() 163 __next = __first; in _S_unique() 179 _Literator __next = __first2; in _S_merge() [all …]
|
D | _slist_base.c | 79 _Slist_node_base* __next = __node->_M_next; in __reverse() local 82 __node = __next; in __reverse()
|
D | _num_get.c | 151 _Integer __next = __STATIC_CAST(_Integer, __base * __result - __n); in __get_integer() local 153 __ovflow = __ovflow || __next >= __result; in __get_integer() 154 __result = __next; in __get_integer() 211 _Integer __next = __STATIC_CAST(_Integer, __base * __result + __n); in __get_integer() local 213 __ovflow = __ovflow || __next <= __result; in __get_integer() 214 __result = __next; in __get_integer()
|
D | _algo.h | 87 _ForwardIter __next = __first; in adjacent_find() local 88 while(++__next != __last) { in adjacent_find() 89 if (__binary_pred(*__first, *__next)) in adjacent_find() 91 __first = __next; in adjacent_find() 271 _ForwardIter __next = __first; in remove() local 272 return remove_copy(++__next, __last, __first, __val); in remove() 284 _ForwardIter __next = __first; in remove_if() local 285 return remove_copy_if(++__next, __last, __first, __pred); in remove_if()
|
D | _algo.c | 685 _ForwardIter __next = __first; in __partition() local 687 while (++__next != __last) { in __partition() 688 if (__pred(*__next)) { in __partition() 689 _STLP_STD::swap(*__first, *__next); in __partition() 909 _RandomAccessIter __next = __last; in __unguarded_linear_insert() local 910 --__next; in __unguarded_linear_insert() 911 while (__comp(__val, *__next)) { in __unguarded_linear_insert() 912 _STLP_VERBOSE_ASSERT(!__comp(*__next, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in __unguarded_linear_insert() 913 *__last = *__next; in __unguarded_linear_insert() 914 __last = __next; in __unguarded_linear_insert() [all …]
|
D | _slist.h | 174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next); 175 _Slist_node_base* __next_next = __next->_M_next; 177 _STLP_STD::_Destroy(&__next->_M_data); 178 _M_head.deallocate(__next,1);
|
D | _list.h | 638 iterator __next = __first; 639 ++__next; 641 __first = __next;
|
D | _deque.c | 245 iterator __next = __pos; in _M_erase() local 246 ++__next; in _M_erase() 249 copy_backward(this->_M_start, __pos, __next); in _M_erase() 253 _STLP_STD::copy(__next, this->_M_finish, __pos); in _M_erase()
|
D | _rope.h | 920 _CharT *__next = this->_M_buf_ptr + 1; 921 if ( __next < this->_M_buf_end ) { 922 this->_M_buf_ptr = __next;
|
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
D | _list.h | 342 _Base_iterator __next = __first; in remove() local 343 ++__next; in remove() 348 __first = __next; in remove() 418 _Base_iterator __next = __first; in unique() local 419 while (++__next != __last) { in unique() 420 if (*__first == *__next) { in unique() 421 _Invalidate_iterator(iterator(&_M_iter_list, __next)); in unique() 422 _M_non_dbg_impl.erase(__next); in unique() 425 __first = __next; in unique() 426 __next = __first; in unique() [all …]
|
D | _slist.h | 505 _Base_iterator __next = __first; in remove() local 506 ++__next; in remove() 511 __first = __next; in remove() 517 _Base_iterator __next = __first; in unique() local 518 while (++__next != __last) { in unique() 519 if (*__first == *__next) { in unique() 520 _Invalidate_iterator(iterator(&_M_iter_list, __next)); in unique() 521 _M_non_dbg_impl.erase(__next); in unique() 524 __first = __next; in unique() 525 __next = __first; in unique() [all …]
|
D | _debug.c | 542 __owned_link* __prev, *__next; in _M_detach() local 544 for (__prev = &__l->_M_node; (__next = __prev->_M_next) != __c_node; in _M_detach() 545 __prev = __next) { in _M_detach() 546 _STLP_ASSERT(__next && __next->_Owner() == __l) in _M_detach()
|
/ndk/sources/cxx-stl/llvm-libc++/include/ |
D | __debug | 38 __i_node(void* __i, __i_node* __next, __c_node* __c) 39 : __i_(__i), __next_(__next), __c_(__c) {} 54 __c_node(void* __c, __c_node* __next) 55 : __c_(__c), __next_(__next), beg_(nullptr), end_(nullptr), cap_(nullptr) {}
|
D | iterator | 1424 __debug_iter* __next; 1428 _LIBCPP_INLINE_VISIBILITY __debug_iter() : __next(0), __cont(0) {} 1430 : __i(__x.base()), __next(0), __cont(0) {__set_owner(__x.__cont);} 1434 : __i(__u.base()), __next(0), __cont(0) {__set_owner(__u.__cont);} 1456 : __i(__x), __next(0), __cont(0) {__set_owner(__c);} 1549 __next = __head; 1561 __head = __next; 1565 for (__debug_iter* __p = __head->__next; __p != this; __p = __p->__next) 1567 __prev->__next = __next; 1583 __debug_iter* __n = __p->__next; [all …]
|
D | __hash_table | 973 __node_pointer __next = __np->__next_; 976 __np = __next; 1046 __node_pointer __next = __cache->__next_; 1048 __cache = __next; 1104 __node_pointer __next = __cache->__next_; 1106 __cache = __next; 1138 __node_pointer __next = __cache->__next_; 1140 __cache = __next;
|
D | forward_list | 527 __node_pointer __next = __p->__next_; 530 __p = __next; 1126 __node_pointer __next = __first->__next_; 1129 __first = __next; 1176 __node_pointer __next = __first->__next_; 1179 __first = __next;
|
D | __tree | 1208 __node_pointer __next = __detach(__cache); 1210 __cache = __next; 1248 __node_pointer __next = __detach(__cache); 1250 __cache = __next; 1372 __node_pointer __next = __detach(__cache); 1374 __cache = __next; 1666 const_iterator __next = _VSTD::next(__hint); 1667 if (__next == end() || value_comp()(__v, *__next)) 1677 __parent = const_cast<__node_pointer&>(__next.__ptr_);
|
D | map | 1101 const_iterator __next = _VSTD::next(__hint); 1102 if (__next == end() || __tree_.value_comp().key_comp()(__k, __next->first)) 1112 __parent = const_cast<__node_pointer&>(__next.__ptr_);
|
D | string | 1689 __p = __p->__next; 1693 __p = __p->__next; 1703 __p = __p->__next; 1707 __p = __p->__next;
|
D | regex | 2266 const _CharT* __next = _VSTD::next(__s.__current_); 2267 if (__next != __s.__last_) 2269 pair<_CharT, _CharT> __ch2(*__s.__current_, *__next);
|
/ndk/sources/cxx-stl/stlport/src/ |
D | allocators.cpp | 683 _Obj* __next = __chunk->_M_next; in _S_chunk_dealloc() local 685 __chunk = __next; in _S_chunk_dealloc() 774 _Pthread_alloc_per_thread_state() : __next(0) in _Pthread_alloc_per_thread_state() 780 _Pthread_alloc_per_thread_state *__next; member 887 __s -> __next = _S_free_per_thread_states; in _S_destructor() 895 _S_free_per_thread_states = _S_free_per_thread_states -> __next; in _S_new_per_thread_state()
|