Home
last modified time | relevance | path

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

12

/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
Dlist.tcc342 iterator __next = __first; in remove() local
343 ++__next; in remove()
355 __first = __next; in remove()
378 iterator __next = __first; in unique() local
379 while (++__next != __last) in unique()
381 if (*__first == *__next) in unique()
383 __to_destroy.splice(__to_destroy.begin(), *this, __next); in unique()
389 __first = __next; in unique()
390 __next = __first; in unique()
425 iterator __next = __first2; in merge() local
[all …]
Dlocale_conv.h66 auto __next = __first; in _GLIBCXX_VISIBILITY() local
72 __outstr.resize(__outstr.size() + (__last - __next) * __maxlen); in _GLIBCXX_VISIBILITY()
75 __result = (__cvt.*__fn)(__state, __next, __last, __next, in _GLIBCXX_VISIBILITY()
79 while (__result == codecvt_base::partial && __next != __last in _GLIBCXX_VISIBILITY()
84 __count = __next - __first; in _GLIBCXX_VISIBILITY()
100 __count = __next - __first; in _GLIBCXX_VISIBILITY()
588 const _Elem* __next = __first; in _GLIBCXX_VISIBILITY() local
592 __start = __next; in _GLIBCXX_VISIBILITY()
595 auto __result = _M_cvt->out(_M_state, __next, __last, __next, in _GLIBCXX_VISIBILITY()
600 return _M_put(__next, __pending); in _GLIBCXX_VISIBILITY()
[all …]
Dregex.tcc406 auto __next = std::find(__fmt_first, __fmt_last, '$'); in format() local
407 if (__next == __fmt_last) in format()
410 __out = std::copy(__fmt_first, __next, __out); in format()
414 if (*__next == __ch) in format()
416 ++__next; in format()
422 if (++__next == __fmt_last) in format()
440 else if (__fctyp.is(__ctype_type::digit, *__next)) in format()
442 long __num = __traits.value(*__next, 10); in format()
443 if (++__next != __fmt_last in format()
444 && __fctyp.is(__ctype_type::digit, *__next)) in format()
[all …]
Dparse_numbers.h165 using __next = typename _Power_help<_Base, _Digs...>::type; in _GLIBCXX_VISIBILITY()
168 = __ull_constant<__next::value * (__valid_digit{} ? _Base : 1ULL)>; in _GLIBCXX_VISIBILITY()
193 using __next = _Number_help<_Base, in _GLIBCXX_VISIBILITY()
196 using type = __ull_constant<_Pow * __digit::value + __next::type::value>; in _GLIBCXX_VISIBILITY()
Dregex_automaton.h243 _M_insert_alt(_StateIdT __next, _StateIdT __alt, in _GLIBCXX_VISIBILITY()
249 __tmp._M_next = __next; in _GLIBCXX_VISIBILITY()
255 _M_insert_repeat(_StateIdT __next, _StateIdT __alt, bool __neg) in _GLIBCXX_VISIBILITY()
260 __tmp._M_next = __next; in _GLIBCXX_VISIBILITY()
Dforward_list.tcc345 iterator __next = __first; in unique() local
346 while (++__next != __last) in unique()
348 if (__binary_pred(*__first, *__next)) in unique()
355 __first = __next; in unique()
356 __next = __first; in unique()
Dstl_algo.h889 _ForwardIterator __next = __first; in _GLIBCXX_VISIBILITY() local
890 while (++__next != __last) in _GLIBCXX_VISIBILITY()
892 if (__binary_pred(__first, __next)) in _GLIBCXX_VISIBILITY()
894 __first = __next; in _GLIBCXX_VISIBILITY()
1001 _ForwardIterator __next = __first; in _GLIBCXX_VISIBILITY()
1003 while (++__next != __last) in _GLIBCXX_VISIBILITY()
1004 if (!__binary_pred(__first, __next)) in _GLIBCXX_VISIBILITY()
1006 __first = __next; in _GLIBCXX_VISIBILITY()
1453 _ForwardIterator __next = __first; in _GLIBCXX_VISIBILITY() local
1455 while (++__next != __last) in _GLIBCXX_VISIBILITY()
[all …]
Dranges_algo.h522 auto __next = __first; in _GLIBCXX_VISIBILITY() local
523 for (; ++__next != __last; __first = __next) in _GLIBCXX_VISIBILITY()
527 std::__invoke(__proj, *__next))) in _GLIBCXX_VISIBILITY()
530 return __next; in _GLIBCXX_VISIBILITY()
1218 auto __next = __first; in _GLIBCXX_VISIBILITY() local
1219 *__result = *__next; in _GLIBCXX_VISIBILITY()
1220 while (++__next != __last) in _GLIBCXX_VISIBILITY()
1223 std::__invoke(__proj, *__next))) in _GLIBCXX_VISIBILITY()
1225 __first = __next; in _GLIBCXX_VISIBILITY()
1228 return {__next, std::move(++__result)}; in _GLIBCXX_VISIBILITY()
[all …]
Dregex_executor.tcc149 _M_lookahead(_StateIdT __next) in _M_lookahead() argument
156 __sub._M_states._M_start = __next; in _M_lookahead()
Ddeque.tcc238 iterator __next = __position; in _M_erase() local
239 ++__next; in _M_erase()
244 _GLIBCXX_MOVE_BACKWARD3(begin(), __position, __next); in _M_erase()
249 if (__next != end()) in _M_erase()
250 _GLIBCXX_MOVE3(__next, end(), __position); in _M_erase()
Dfstream.tcc977 char* __next; in _M_terminate_output() local
979 __buf + __blen, __next); in _M_terminate_output()
985 __ilen = __next - __buf; in _M_terminate_output()
Dregex_executor.h208 _M_lookahead(_StateIdT __next); in _GLIBCXX_VISIBILITY()
Dhashtable.h2033 _M_remove_bucket_begin(size_type __bkt, __node_ptr __next, in _GLIBCXX_VISIBILITY()
2036 if (!__next || __next_bkt != __bkt) in _GLIBCXX_VISIBILITY()
2040 if (__next) in _GLIBCXX_VISIBILITY()
2045 _M_before_begin._M_nxt = __next; in _GLIBCXX_VISIBILITY()
2583 __node_ptr __next = __p->_M_next(); in _GLIBCXX_VISIBILITY() local
2601 __p = __next; in _GLIBCXX_VISIBILITY()
2630 __node_ptr __next = __p->_M_next(); in _GLIBCXX_VISIBILITY() local
2683 __p = __next; in _GLIBCXX_VISIBILITY()
Dstl_list.h205 _List_node_base* __next = __first2->_M_next; in _GLIBCXX_VISIBILITY()
206 __first1->_M_transfer(__first2, __next); in _GLIBCXX_VISIBILITY()
207 __first2 = __next; in _GLIBCXX_VISIBILITY()
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/backward/
Dhashtable.h891 _Node* __next = __cur->_M_next; in _GLIBCXX_VISIBILITY()
892 while (__next) in _GLIBCXX_VISIBILITY()
894 if (_M_equals(_M_get_key(__next->_M_val), __key)) in _GLIBCXX_VISIBILITY()
896 if (&_M_get_key(__next->_M_val) != &__key) in _GLIBCXX_VISIBILITY()
898 __cur->_M_next = __next->_M_next; in _GLIBCXX_VISIBILITY()
899 _M_delete_node(__next); in _GLIBCXX_VISIBILITY()
900 __next = __cur->_M_next; in _GLIBCXX_VISIBILITY()
907 __cur = __next; in _GLIBCXX_VISIBILITY()
908 __next = __cur->_M_next; in _GLIBCXX_VISIBILITY()
913 __cur = __next; in _GLIBCXX_VISIBILITY()
[all …]
/netbsd/src/sys/external/bsd/drm2/include/linux/
Dinterval_tree_generic.h121 T *__next; \
124 __next = rb_tree_iterate(&__root->rb_root.rbr_tree, __node, \
126 if (__next == NULL) \
128 if (__last < START(__next)) \
130 KASSERT(LAST(__next) >= __start); \
132 return __next; \
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/debug/
Dfunctions.h221 _ForwardIterator __next = __first; in __check_sorted_aux() local
222 for (++__next; __next != __last; __first = __next, (void)++__next) in __check_sorted_aux()
223 if (*__next < *__first) in __check_sorted_aux()
249 _ForwardIterator __next = __first; in __check_sorted_aux() local
250 for (++__next; __next != __last; __first = __next, (void)++__next) in __check_sorted_aux()
251 if (__pred(*__next, *__first)) in __check_sorted_aux()
Dlist704 _Base_iterator __next = __first;
705 ++__next;
718 __first = __next;
741 _Base_iterator __next = __x;
742 ++__next;
752 __x = __next;
778 _Base_iterator __next = __first;
779 while (++__next != __last)
780 if (*__first == *__next)
782 this->_M_invalidate_if(_Equal(__next));
[all …]
Dforward_list474 _Base_const_iterator __next = std::next(__pos.base());
475 this->_M_invalidate_if([__next](_Base_const_iterator __it)
476 { return __it == __next; });
613 _Base_const_iterator __next = std::next(__i.base());
614 this->_M_transfer_from_if(__list, [__next](_Base_const_iterator __it)
615 { return __it == __next; });
708 _Base_const_iterator __next = std::next(__old);
709 this->_M_invalidate_if([__next](_Base_const_iterator __it)
710 { return __it == __next; });
771 _Base_const_iterator __next = std::next(__first);
[all …]
Dunordered_map710 auto __next = _Base::erase(__first.base(), __last.base());
712 return { __next, this };
747 _Base_iterator __next = _Base::erase(__victim);
749 return __next;
1427 auto __next = _Base::erase(__first.base(), __last.base());
1429 return { __next, this };
1464 _Base_iterator __next = _Base::erase(__victim);
1466 return __next;
Dunordered_set595 auto __next = _Base::erase(__first.base(), __last.base());
597 return { __next, this };
629 _Base_iterator __next = _Base::erase(__victim);
631 return __next;
1302 _Base_iterator __next = _Base::erase(__victim);
1304 return __next;
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
Dlist_partition.h119 size_t __cur = 1, __next = 1; variable
124 __cur = __next;
143 __next = __os_starts.size() / 2 + 1;
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/
Dalgorithm490 _ForwardIterator __next = __first;
491 for (++__next; __next != __last; __first = __next, ++__next)
492 if (*__next < *__first)
517 _ForwardIterator __next = __first;
518 for (++__next; __next != __last; __first = __next, ++__next)
519 if (__comp(*__next, *__first))
Dslist126 _Slist_node_base* __next = __node->_M_next;
129 __node = __next;
252 _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next);
253 _Slist_node_base* __next_next = __next->_M_next;
256 __alloc_traits<allocator_type>::destroy(__a, &__next->_M_data);
257 _M_put_node(__next);
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/
Dhashtable.h967 _Node* __next = __cur->_M_next; in _GLIBCXX_VISIBILITY() local
968 while (__next != __p) in _GLIBCXX_VISIBILITY()
970 __cur = __next; in _GLIBCXX_VISIBILITY()
971 __next = __cur->_M_next; in _GLIBCXX_VISIBILITY()
973 __cur->_M_next = __next->_M_next; in _GLIBCXX_VISIBILITY()

12