| /netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| D | stl_algo.h | 146 _ForwardIterator2 __first2, _ForwardIterator2 __last2, in _GLIBCXX_VISIBILITY()
150 if (__first1 == __last1 || __first2 == __last2) in _GLIBCXX_VISIBILITY()
155 if (++__p1 == __last2) in _GLIBCXX_VISIBILITY()
178 if (++__p == __last2) in _GLIBCXX_VISIBILITY()
281 _ForwardIterator2 __first2, _ForwardIterator2 __last2, in _GLIBCXX_VISIBILITY()
285 if (__first2 == __last2) in _GLIBCXX_VISIBILITY()
292 = std::__search(__first1, __last1, __first2, __last2, __comp); in _GLIBCXX_VISIBILITY()
312 _BidirectionalIterator2 __last2, in _GLIBCXX_VISIBILITY()
328 _RevIterator2(__last2), __rlast2, in _GLIBCXX_VISIBILITY()
336 std::advance(__result, -std::distance(__first2, __last2)); in _GLIBCXX_VISIBILITY()
[all …]
|
| D | stl_algobase.h | 1266 _RAI2 __first2, _RAI2 __last2) in _GLIBCXX_VISIBILITY()
1271 __diff2 = __last2 - __first2; in _GLIBCXX_VISIBILITY()
1285 _II2 __first2, _II2 __last2, in _GLIBCXX_VISIBILITY()
1292 __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2); in _GLIBCXX_VISIBILITY()
1293 for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); in _GLIBCXX_VISIBILITY()
1301 return __first1 == __last1 && __first2 != __last2; in _GLIBCXX_VISIBILITY()
1310 __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) in _GLIBCXX_VISIBILITY()
1314 __first2, __last2, in _GLIBCXX_VISIBILITY()
1321 __3way(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) in _GLIBCXX_VISIBILITY()
1325 if (__first2 == __last2) in _GLIBCXX_VISIBILITY()
[all …]
|
| D | list.tcc | 309 _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2, in _M_assign_dispatch() argument
314 for (; __first1 != __last1 && __first2 != __last2; in _M_assign_dispatch()
317 if (__first2 == __last2) in _M_assign_dispatch()
320 insert(__last1, __first2, __last2); in _M_assign_dispatch()
418 iterator __last2 = __x.end(); in merge() local
422 while (__first1 != __last1 && __first2 != __last2) in merge()
431 if (__first2 != __last2) in merge()
433 _M_transfer(__last1, __first2, __last2); in merge()
434 __first2 = __last2; in merge()
458 iterator __last2 = __x.end(); in merge() local
[all …]
|
| D | ranges_algo.h | 248 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
252 for (auto __iter = __first2; __iter != __last2; ++__iter) in _GLIBCXX_VISIBILITY()
441 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
448 auto __i2 = ranges::next(__first2, __last2); in _GLIBCXX_VISIBILITY()
466 if (__first2 == __last2) in _GLIBCXX_VISIBILITY()
474 __first2, __last2, in _GLIBCXX_VISIBILITY()
557 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
566 auto __d2 = ranges::distance(__first2, __last2); in _GLIBCXX_VISIBILITY()
573 for (; __first1 != __last1 && __first2 != __last2; in _GLIBCXX_VISIBILITY()
588 auto __d2 = ranges::distance(__first2, __last2); in _GLIBCXX_VISIBILITY()
[all …]
|
| D | deque.tcc | 1272 const _Tp2* __first2, const _Tp2* __last2) in _M_insert_aux() argument
1290 const ptrdiff_t __len2 = __last2 - __first2; in _M_insert_aux()
1301 __first2, __last2); in _M_insert_aux()
1310 _Tp2* __first2, _Tp2* __last2) in _M_insert_aux() argument
1311 { return std::__lex_cmp_dit(__first1, __last1, __first2, __last2) < 0; } in _M_insert_aux()
1318 _GLIBCXX_STD_C::_Deque_iterator<_Tp2, _Ref2, _Ptr2> __last2) in _M_insert_aux() argument
1319 { return std::__lex_cmp_dit(__first2, __last2, __first1, __last1) > 0; } in _M_insert_aux()
1328 _GLIBCXX_STD_C::_Deque_iterator<_Tp2, _Ref2, _Ptr2> __last2) in _M_insert_aux() argument
1346 const ptrdiff_t __len2 = __first2._M_node == __last2._M_node in _M_insert_aux()
1347 ? __last2._M_cur - __first2._M_cur in _M_insert_aux()
[all …]
|
| D | ranges_algobase.h | 83 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
91 std::move(__first2), std::move(__last2), in _GLIBCXX_VISIBILITY()
97 __first2.base(), __last2.base(), in _GLIBCXX_VISIBILITY()
104 auto __d2 = ranges::distance(__first2, __last2); in _GLIBCXX_VISIBILITY()
133 for (; __first1 != __last1 && __first2 != __last2; in _GLIBCXX_VISIBILITY()
139 return __first1 == __last1 && __first2 == __last2; in _GLIBCXX_VISIBILITY()
|
| D | stl_uninitialized.h | 486 _InputIterator2 __last2, in _GLIBCXX_VISIBILITY()
495 return std::__uninitialized_move_a(__first2, __last2, __mid, __alloc); in _GLIBCXX_VISIBILITY()
514 _InputIterator2 __last2, in _GLIBCXX_VISIBILITY()
523 return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc); in _GLIBCXX_VISIBILITY()
562 _ForwardIterator __last2, const _Tp& __x, in _GLIBCXX_VISIBILITY()
570 std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc); in _GLIBCXX_VISIBILITY()
|
| D | ranges_util.h | 557 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
560 while (__first1 != __last1 && __first2 != __last2 in _GLIBCXX_VISIBILITY()
598 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
601 if (__first1 == __last1 || __first2 == __last2) in _GLIBCXX_VISIBILITY()
620 if (++__cur2 == __last2) in _GLIBCXX_VISIBILITY()
|
| D | stl_list.h | 199 _List_node_base* const __last2 = std::__addressof(__x); in _GLIBCXX_VISIBILITY()
201 while (__first1 != __last1 && __first2 != __last2) in _GLIBCXX_VISIBILITY()
212 if (__first2 != __last2) in _GLIBCXX_VISIBILITY()
213 this->_M_transfer(__first2, __last2); in _GLIBCXX_VISIBILITY()
|
| /netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/debug/ |
| D | safe_iterator.tcc | 480 _II2 __first2, _II2 __last2) in __lexicographical_compare_aux() argument
484 __glibcxx_check_valid_range(__first2, __last2); in __lexicographical_compare_aux()
489 __first2, __last2); in __lexicographical_compare_aux()
491 __first2, __last2); in __lexicographical_compare_aux()
500 const ::__gnu_debug::_Safe_iterator<_Ite2, _Seq2, _Cat2>& __last2) in __lexicographical_compare_aux() argument
504 __glibcxx_check_valid_range2(__first2, __last2, __dist2); in __lexicographical_compare_aux()
509 __last2.base()); in __lexicographical_compare_aux()
511 __first2, __last2); in __lexicographical_compare_aux()
521 const ::__gnu_debug::_Safe_iterator<_Ite2, _Seq2, _Cat2>& __last2) in __lexicographical_compare_aux() argument
526 __glibcxx_check_valid_range2(__first2, __last2, __dist2); in __lexicographical_compare_aux()
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/ |
| D | algorithm | 129 _InputIterator2 __last2)
131 while (__first1 != __last1 && __first2 != __last2)
140 if (__first2 == __last2)
150 const unsigned char* __last2)
153 const std::ptrdiff_t __len2 = __last2 - __first2;
162 const char* __first2, const char* __last2)
168 (const signed char*) __last2);
173 (const unsigned char*) __last2);
182 * @param __last2 An input iterator.
197 _InputIterator2 __last2)
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
| D | algobase.h | 122 _InputIterator2 __first2, _InputIterator2 __last2, in _GLIBCXX_VISIBILITY()
124 { return _GLIBCXX_STD_A::mismatch(__first1, __last1, __first2, __last2); } in _GLIBCXX_VISIBILITY()
131 _InputIterator2 __first2, _InputIterator2 __last2, in _GLIBCXX_VISIBILITY()
135 return _GLIBCXX_STD_A::mismatch(__first1, __last1, __first2, __last2, in _GLIBCXX_VISIBILITY()
|