| /haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
| H A D | locale_conv.h | 67 auto __next = __first; local
73 __outstr.resize(__outstr.size() + (__last - __next) * __maxlen);
76 __result = (__cvt.*__fn)(__state, __next, __last, __next,
80 while (__result == codecvt_base::partial && __next != __last
94 __count = __next - __first;
497 const _Elem* __next = __first; local
501 __start = __next;
504 auto __result = _M_cvt->out(_M_state, __next, __last, __next,
[all...] |
| H A D | regex_automaton.h | 179 _M_insert_alt(_StateIdT __next, _StateIdT __alt, bool __neg) argument
184 __tmp._M_next = __next;
190 _M_insert_repeat(_StateIdT __next, _StateIdT __alt, bool __neg) argument
195 __tmp._M_next = __next;
|
| H A D | stl_algo.h | 947 _ForwardIterator __next = __first;
948 while (++__next != __last)
950 if (__binary_pred(__first, __next))
952 __first = __next;
1055 _ForwardIterator __next = __first; local
1057 while (++__next != __last)
1058 if (!__binary_pred(__first, __next))
1060 __first = __next;
1495 _ForwardIterator __next = __first;
1497 while (++__next !
1821 _RandomAccessIterator __next = __last; local
3332 _ForwardIterator __next = __first; local
[all...] |
| H A D | hashtable.h | 1481 _M_remove_bucket_begin(size_type __bkt, __node_type* __next, argument
1484 if (!__next || __next_bkt != __bkt)
1488 if (__next)
1493 _M_before_begin._M_nxt = __next;
1980 __node_type* __next = __p->_M_next(); local
1996 __p = __next;
2026 __node_type* __next = __p->_M_next(); local
2078 __p = __next;
|
| H A D | hashtable_policy.h | 233 _Hash_node_base(_Hash_node_base* __next) noexcept : _M_nxt(__next) { }
|
| /haiku-buildtools/gcc/libstdc++-v3/include/backward/ |
| H A D | hashtable.h | 892 _Node* __next = __cur->_M_next; local
893 while (__next)
895 if (_M_equals(_M_get_key(__next->_M_val), __key))
897 if (&_M_get_key(__next->_M_val) != &__key)
899 __cur->_M_next = __next->_M_next;
900 _M_delete_node(__next);
901 __next = __cur->_M_next;
908 __cur = __next;
909 __next = __cur->_M_next;
914 __cur = __next;
956 _Node* __next = __cur->_M_next; local
1055 _Node* __next = __tmp[__bucket]->_M_next; local
1076 _Node* __next; local
1099 _Node* __next = __cur->_M_next; local
1120 _Node* __next = __cur->_M_next; local
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/include/parallel/ |
| H A D | list_partition.h | 119 size_t __cur = 1, __next = 1; local
124 __cur = __next;
143 __next = __os_starts.size() / 2 + 1;
|
| /haiku-buildtools/legacy/gcc/libstdc++/stl/ |
| H A D | stl_hashtable.h | 821 _Node* __next = __cur->_M_next; local
822 while (__next) {
823 if (_M_equals(_M_get_key(__next->_M_val), __key)) {
824 __cur->_M_next = __next->_M_next;
825 _M_delete_node(__next);
826 __next = __cur->_M_next;
831 __cur = __next;
832 __next = __cur->_M_next;
858 _Node* __next = __cur->_M_next; local
859 while (__next) {
963 _Node* __next; local
983 _Node* __next = __cur->_M_next; local
997 _Node* __next = __cur->_M_next; local
[all...] |
| H A D | stl_list.h | 668 iterator __next = __first; local
669 ++__next;
671 __first = __next;
681 iterator __next = __first;
682 while (++__next != __last) {
683 if (*__first == *__next)
684 erase(__next);
686 __first = __next;
687 __next = __first;
700 iterator __next local
759 iterator __next = __first; local
792 iterator __next = __first2; local
[all...] |
| H A D | stl_slist.h | 81 _Slist_node_base* __next = __node->_M_next; local
84 __node = __next;
242 _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next); local
243 _Slist_node_base* __next_next = __next->_M_next;
245 destroy(&__next->_M_data);
246 _M_put_node(__next);
269 _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next); local
270 _Slist_node_base* __next_next = __next->_M_next;
272 destroy(&__next->_M_data);
273 _M_put_node(__next);
[all...] |
| H A D | stl_algo.h | 208 _ForwardIter __next = __first;
209 while(++__next != __last) {
210 if (*__first == *__next)
212 __first = __next;
222 _ForwardIter __next = __first;
223 while(++__next != __last) {
224 if (__binary_pred(*__first, *__next))
226 __first = __next;
987 _ForwardIter __next = __first;
989 while (++__next !
1152 _RandomAccessIter __next = __last; local
1165 _RandomAccessIter __next = __last; local
[all...] |
| H A D | pthread_alloc | 55 _Pthread_alloc_per_thread_state<_Max_size> * __next;
61 _Pthread_alloc_per_thread_state() : __next(0)
181 __s -> __next = _S_free_per_thread_states;
193 _S_free_per_thread_states = _S_free_per_thread_states -> __next;
|
| H A D | stl_deque.h | 815 iterator __next = __pos; local
816 ++__next;
819 copy_backward(_M_start, __pos, __next);
823 copy(__next, _M_finish, __pos);
|
| H A D | stl_rope.h | 966 __GC_CONST _CharT* __next; local
967 if (0 != _M_buf_ptr && (__next = _M_buf_ptr + 1) < _M_buf_end) {
968 _M_buf_ptr = __next;
|
| /haiku-buildtools/gcc/libstdc++-v3/include/debug/ |
| H A D | functions.h | 338 _ForwardIterator __next = __first;
339 for (++__next; __next != __last; __first = __next, ++__next)
340 if (*__next < *__first)
364 _ForwardIterator __next = __first;
365 for (++__next; __next != __last; __first = __next,
[all...] |
| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
| H A D | pr44357.C | 94 _RandomAccessIterator __next = __last; local
95 while (__comp (__val, *__next))
|
| H A D | pr57140.C | 101 iterator __next = __first2; local
102 __first2 = __next;
|
| /haiku-buildtools/gcc/libstdc++-v3/src/c++11/ |
| H A D | ios.cc | 183 _Callback_list* __next = __p->_M_next; local
185 __p = __next;
|
| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/tm/ |
| H A D | pr46567.C | 2465 iterator __next = __first; local
2466 ++__next;
2474 __first = __next;
2488 iterator __next = __first;
2489 while (++__next != __last)
2491 if (*__first == *__next)
2492 _M_erase(__next);
2494 __first = __next;
2495 __next = __first;
2513 iterator __next local
2539 iterator __next = __first2; local
2591 iterator __next = __first; local
[all...] |
| H A D | 20100727.C | 766 iterator __next = __first; local
767 ++__next;
775 __first = __next;
|
| /haiku-buildtools/gcc/libstdc++-v3/include/tr1/ |
| H A D | hashtable.h | 957 _Node* __next = __cur->_M_next; local
958 while (__next != __p)
960 __cur = __next;
961 __next = __cur->_M_next;
963 __cur->_M_next = __next->_M_next;
|
| /haiku-buildtools/gcc/gcc/testsuite/g++.dg/lto/ |
| H A D | pr47333.C | 339 struct __pthread_internal_slist *__next; member in struct:__pthread_internal_slist
|