Home
last modified time | relevance | path

Searched refs:__next (Results 1 – 25 of 26) sorted by relevance

12

/openbsd/src/gnu/lib/libstdc++/libstdc++/include/bits/
Dlist.tcc187 iterator __next = __first; in remove() local
188 ++__next; in remove()
191 __first = __next; in remove()
203 iterator __next = __first; in unique() local
204 while (++__next != __last) in unique()
206 if (*__first == *__next) in unique()
207 erase(__next); in unique()
209 __first = __next; in unique()
210 __next = __first; in unique()
230 iterator __next = __first2; in merge() local
[all …]
Dpthread_allocimpl.h93 _Pthread_alloc_per_thread_state<_Max_size> * __next; member
99 _Pthread_alloc_per_thread_state() : __next(0) in _Pthread_alloc_per_thread_state()
220 __s -> __next = _S_free_per_thread_states; in _S_destructor()
232 _S_free_per_thread_states = _S_free_per_thread_states -> __next; in _S_new_per_thread_state()
Dstl_algo.h339 _ForwardIter __next = __first; in adjacent_find() local
340 while(++__next != __last) { in adjacent_find()
341 if (*__first == *__next) in adjacent_find()
343 __first = __next; in adjacent_find()
370 _ForwardIter __next = __first; in adjacent_find() local
371 while(++__next != __last) { in adjacent_find()
372 if (__binary_pred(*__first, *__next)) in adjacent_find()
374 __first = __next; in adjacent_find()
1693 _ForwardIter __next = __first; in __partition() local
1695 while (++__next != __last) in __partition()
[all …]
Ddeque.tcc112 iterator __next = __position; in erase() local
113 ++__next; in erase()
117 copy_backward(_M_start, __position, __next); in erase()
122 copy(__next, _M_finish, __position); in erase()
/openbsd/src/gnu/gcc/libstdc++-v3/include/bits/
Dlist.tcc181 iterator __next = __first; in remove() local
182 ++__next; in remove()
185 __first = __next; in remove()
198 iterator __next = __first; in unique() local
199 while (++__next != __last) in unique()
201 if (*__first == *__next) in unique()
202 _M_erase(__next); in unique()
204 __first = __next; in unique()
205 __next = __first; in unique()
227 iterator __next = __first2; in merge() local
[all …]
Dstl_algo.h371 _ForwardIterator __next = __first; in adjacent_find() local
372 while(++__next != __last) in adjacent_find()
374 if (*__first == *__next) in adjacent_find()
376 __first = __next; in adjacent_find()
404 _ForwardIterator __next = __first; in adjacent_find() local
405 while(++__next != __last) in adjacent_find()
407 if (__binary_pred(*__first, *__next)) in adjacent_find()
409 __first = __next; in adjacent_find()
1319 _ForwardIterator __next = __first; in __unique_copy() local
1321 while (++__next != __last) in __unique_copy()
[all …]
Ddeque.tcc114 iterator __next = __position; in erase() local
115 ++__next; in erase()
120 std::copy_backward(begin(), __position, __next); in erase()
125 if (__next != end()) in erase()
126 std::copy(__next, end(), __position); in erase()
Dfstream.tcc784 char* __next; in _M_terminate_output() local
786 __buf + __blen, __next); in _M_terminate_output()
792 __ilen = __next - __buf; in _M_terminate_output()
/openbsd/src/gnu/gcc/libstdc++-v3/include/debug/
Dfunctions.h207 _ForwardIterator __next = __first; in __check_sorted_aux() local
208 for (++__next; __next != __last; __first = __next, ++__next) { in __check_sorted_aux()
209 if (*__next < *__first) in __check_sorted_aux()
234 _ForwardIterator __next = __first; in __check_sorted_aux() local
235 for (++__next; __next != __last; __first = __next, ++__next) { in __check_sorted_aux()
236 if (__pred(*__next, *__first)) in __check_sorted_aux()
Dlist420 iterator __next = __first;
421 while (++__next != __last)
423 if (*__first == *__next)
424 erase(__next);
426 __first = __next;
427 __next = __first;
439 iterator __next = __first;
440 while (++__next != __last)
442 if (__binary_pred(*__first, *__next))
443 erase(__next);
[all …]
/openbsd/src/gnu/lib/libstdc++/libstdc++/include/ext/
Dstl_hashtable.h774 _Node* __next = __cur->_M_next;
775 while (__next) {
776 if (_M_equals(_M_get_key(__next->_M_val), __key)) {
777 __cur->_M_next = __next->_M_next;
778 _M_delete_node(__next);
779 __next = __cur->_M_next;
784 __cur = __next;
785 __next = __cur->_M_next;
812 _Node* __next = __cur->_M_next;
813 while (__next) {
[all …]
Dalgorithm498 _ForwardIter __next = __first;
499 for (++__next; __next != __last; __first = __next, ++__next) {
500 if (*__next < *__first)
525 _ForwardIter __next = __first;
526 for (++__next; __next != __last; __first = __next, ++__next) {
527 if (__comp(*__next, *__first))
Dslist131 _Slist_node_base* __next = __node->_M_next;
134 __node = __next;
273 _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next);
274 _Slist_node_base* __next_next = __next->_M_next;
276 _Destroy(&__next->_M_data);
277 _M_put_node(__next);
Dstl_rope.h962 __GC_CONST _CharT* __next; variable
963 if (0 != _M_buf_ptr && (__next = _M_buf_ptr + 1) < _M_buf_end) {
964 _M_buf_ptr = __next;
/openbsd/src/gnu/gcc/libstdc++-v3/include/ext/
Dhashtable.h877 _Node* __next = __cur->_M_next;
878 while (__next)
880 if (_M_equals(_M_get_key(__next->_M_val), __key))
882 __cur->_M_next = __next->_M_next;
883 _M_delete_node(__next);
884 __next = __cur->_M_next;
890 __cur = __next;
891 __next = __cur->_M_next;
923 _Node* __next = __cur->_M_next;
924 while (__next)
[all …]
Dalgorithm491 _ForwardIterator __next = __first;
492 for (++__next; __next != __last; __first = __next, ++__next)
493 if (*__next < *__first)
518 _ForwardIterator __next = __first;
519 for (++__next; __next != __last; __first = __next, ++__next)
520 if (__comp(*__next, *__first))
Dslist136 _Slist_node_base* __next = __node->_M_next;
139 __node = __next;
262 _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next);
263 _Slist_node_base* __next_next = __next->_M_next;
265 get_allocator().destroy(&__next->_M_data);
266 _M_put_node(__next);
Drope1168 __GC_CONST _CharT* __next;
1170 && (__next = this->_M_buf_ptr + 1) < this->_M_buf_end)
1172 this->_M_buf_ptr = __next;
/openbsd/src/gnu/llvm/libcxx/include/
D__debug52 __i_node(void* __i, __i_node* __next, __c_node* __c)
53 : __i_(__i), __next_(__next), __c_(__c) {}
69 explicit __c_node(void* __c, __c_node* __next)
70 : __c_(__c), __next_(__next), beg_(nullptr), end_(nullptr), cap_(nullptr) {}
162 …BCPP_INLINE_VISIBILITY static __c_node* __create_C_node(void *__mem, void *__c, __c_node *__next) {
163 return ::new (__mem) _C_node<_Cont>(__c, __next);
Dforward_list639 __node_pointer __next = __p->__next_;
642 __p = __next;
1256 __node_pointer __next = __first->__next_;
1259 __first = __next;
1302 __node_pointer __next = __first->__next_;
1305 __first = __next;
D__hash_table1520 __next_pointer __next = __np->__next_;
1539 __np = __next;
1609 __next_pointer __next = __cache->__next_;
1611 __cache = __next;
1669 __next_pointer __next = __cache->__next_;
1671 __cache = __next;
1709 __next_pointer __next = __cache->__next_;
1711 __cache = __next;
D__tree2057 const_iterator __next = _VSTD::next(__hint);
2058 if (__next == end() || value_comp()(__v, *__next))
2068 __parent = static_cast<__parent_pointer>(__next.__ptr_);
/openbsd/src/gnu/gcc/libstdc++-v3/src/
Dios.cc187 _Callback_list* __next = __p->_M_next; in _M_dispose_callbacks() local
189 __p = __next; in _M_dispose_callbacks()
/openbsd/src/gnu/lib/libstdc++/libstdc++/src/
Dios.cc356 _Callback_list* __next = __p->_M_next; in _M_dispose_callbacks() local
358 __p = __next; in _M_dispose_callbacks()
/openbsd/src/gnu/gcc/libstdc++-v3/include/tr1/
Dhashtable979 _Node* __next = __cur->_M_next;
980 while (__next != __p)
982 __cur = __next;
983 __next = __cur->_M_next;
985 __cur->_M_next = __next->_M_next;

12