Home
last modified time | relevance | path

Searched refs:__last2 (Results 1 – 25 of 35) sorted by relevance

12

/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
H A Dstl_algo.h143 _ForwardIterator2 __first2, _ForwardIterator2 __last2, in _GLIBCXX_VISIBILITY()
147 if (__first1 == __last1 || __first2 == __last2) in _GLIBCXX_VISIBILITY()
152 if (++__p1 == __last2) in _GLIBCXX_VISIBILITY()
175 if (++__p == __last2) in _GLIBCXX_VISIBILITY()
278 _ForwardIterator2 __first2, _ForwardIterator2 __last2, in _GLIBCXX_VISIBILITY()
282 if (__first2 == __last2) in _GLIBCXX_VISIBILITY()
289 = std::__search(__first1, __last1, __first2, __last2, __comp); in _GLIBCXX_VISIBILITY()
309 _BidirectionalIterator2 __last2, in _GLIBCXX_VISIBILITY()
325 _RevIterator2(__last2), __rlast2, in _GLIBCXX_VISIBILITY()
333 std::advance(__result, -std::distance(__first2, __last2)); in _GLIBCXX_VISIBILITY()
[all …]
H A Dstl_algobase.h1210 _RAI2 __first2, _RAI2 __last2) in _GLIBCXX_VISIBILITY()
1215 __diff2 = __last2 - __first2; in _GLIBCXX_VISIBILITY()
1229 _II2 __first2, _II2 __last2, in _GLIBCXX_VISIBILITY()
1236 __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2); in _GLIBCXX_VISIBILITY()
1237 for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); in _GLIBCXX_VISIBILITY()
1245 return __first1 == __last1 && __first2 != __last2; in _GLIBCXX_VISIBILITY()
1254 __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) in _GLIBCXX_VISIBILITY()
1258 __first2, __last2, in _GLIBCXX_VISIBILITY()
1270 const _Up* __first2, const _Up* __last2) in _GLIBCXX_VISIBILITY()
1273 const size_t __len2 = __last2 - __first2; in _GLIBCXX_VISIBILITY()
[all …]
H A Dlist.tcc309 _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()
408 iterator __last2 = __x.end(); in merge() local
413 while (__first1 != __last1 && __first2 != __last2) in merge()
422 if (__first2 != __last2) in merge()
423 _M_transfer(__last1, __first2, __last2); in merge()
431 const size_t __dist = std::distance(__first2, __last2); in merge()
459 iterator __last2 = __x.end(); in merge() local
[all …]
H A Dranges_algo.h331 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
335 for (auto __iter = __first2; __iter != __last2; ++__iter) in _GLIBCXX_VISIBILITY()
456 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
459 while (__first1 != __last1 && __first2 != __last2 in _GLIBCXX_VISIBILITY()
497 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
500 if (__first1 == __last1 || __first2 == __last2) in _GLIBCXX_VISIBILITY()
519 if (++__cur2 == __last2) in _GLIBCXX_VISIBILITY()
651 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
658 auto __i2 = ranges::next(__first2, __last2); in _GLIBCXX_VISIBILITY()
676 if (__first2 == __last2) in _GLIBCXX_VISIBILITY()
[all …]
H A Dranges_algobase.h82 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, in _GLIBCXX_VISIBILITY()
90 std::move(__first2), std::move(__last2), in _GLIBCXX_VISIBILITY()
96 __first2.base(), __last2.base(), in _GLIBCXX_VISIBILITY()
103 auto __d2 = ranges::distance(__first2, __last2); in _GLIBCXX_VISIBILITY()
132 for (; __first1 != __last1 && __first2 != __last2; in _GLIBCXX_VISIBILITY()
138 return __first1 == __last1 && __first2 == __last2; in _GLIBCXX_VISIBILITY()
H A Dstl_uninitialized.h420 _InputIterator2 __last2, in _GLIBCXX_VISIBILITY()
429 return std::__uninitialized_move_a(__first2, __last2, __mid, __alloc); in _GLIBCXX_VISIBILITY()
448 _InputIterator2 __last2, in _GLIBCXX_VISIBILITY()
457 return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc); in _GLIBCXX_VISIBILITY()
496 _ForwardIterator __last2, const _Tp& __x, in _GLIBCXX_VISIBILITY()
504 std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc); in _GLIBCXX_VISIBILITY()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
H A Dstl_algo.h146 _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 …]
H A Dstl_algobase.h1266 _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 …]
H A Dlist.tcc309 _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 …]
H A Dranges_algo.h248 _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 …]
H A Ddeque.tcc1272 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 …]
H A Dranges_algobase.h83 _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()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/
H A Dparallel_backend_utils.h140 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_union_construct() argument
147 if (__first2 == __last2) in __set_union_construct()
162 return __cc_range(__first2, __last2, __result); in __set_union_construct()
168 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_intersection_construct() argument
172 for (; __first1 != __last1 && __first2 != __last2;) in __set_intersection_construct()
194 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_difference_construct() argument
201 if (__first2 == __last2) in __set_difference_construct()
223 … _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_symmetric_difference_construct() argument
230 if (__first2 == __last2) in __set_symmetric_difference_construct()
251 return __cc_range(__first2, __last2, __result); in __set_symmetric_difference_construct()
H A Dalgorithm_impl.h392 … _ForwardIterator2 __last2, _BinaryPredicate __p, /* IsVector = */ std::false_type) noexcept in __brick_equal() argument
394 return std::equal(__first1, __last1, __first2, __last2, __p); in __brick_equal()
400 … _RandomAccessIterator2 __last2, _BinaryPredicate __p, /* is_vector = */ std::true_type) noexcept in __brick_equal() argument
402 if (__last1 - __first1 != __last2 - __first2) in __brick_equal()
412 … _ForwardIterator2 __last2, _BinaryPredicate __p, _IsVector __is_vector, /* is_parallel = */ in __pattern_equal() argument
415 return __internal::__brick_equal(__first1, __last1, __first2, __last2, __p, __is_vector); in __pattern_equal()
422 … _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __p, in __pattern_equal() argument
425 if (__last1 - __first1 != __last2 - __first2) in __pattern_equal()
2611 _ForwardIterator2 __last2, _OutputIterator __d_first, _Compare __comp, in __brick_merge() argument
2614 return std::merge(__first1, __last1, __first2, __last2, __d_first, __comp); in __brick_merge()
[all …]
H A Dglue_algorithm_impl.h673 _ForwardIterator2 __last2, _BinaryPredicate __pred) in mismatch() argument
676 std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __pred, in mismatch()
695 _ForwardIterator2 __last2) in mismatch() argument
697 … return std::mismatch(std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, in mismatch()
733 _ForwardIterator2 __last2, _BinaryPredicate __p) in equal() argument
736 std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __p, in equal()
744 _ForwardIterator2 __last2) in equal() argument
746 …return equal(std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, std::eq… in equal()
859 _ForwardIterator2 __last2, _ForwardIterator __d_first, _Compare __comp) in merge() argument
862 … std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __d_first, __comp, in merge()
[all …]
H A Dglue_algorithm_defs.h313 _ForwardIterator2 __last2, _BinaryPredicate __pred);
323 _ForwardIterator2 __last2);
343 _ForwardIterator2 __last2, _BinaryPredicate __p);
348 _ForwardIterator2 __last2);
413 _ForwardIterator2 __last2, _ForwardIterator __d_first, _Compare __comp);
418 _ForwardIterator2 __last2, _ForwardIterator __d_first);
435 _ForwardIterator2 __last2, _Compare __comp);
440 _ForwardIterator2 __last2);
448 _ForwardIterator2 __last2, _ForwardIterator __result, _Compare __comp);
453 _ForwardIterator2 __last2, _ForwardIterator __result);
[all …]
H A Dparallel_backend_serial.h113 … _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _RandomAccessIterator3 __outit, in __parallel_merge() argument
116 __leaf_merge(__first1, __last1, __first2, __last2, __outit, __comp); in __parallel_merge()
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/
H A Dalgorithm_impl.h392 … _ForwardIterator2 __last2, _BinaryPredicate __p, /* IsVector = */ std::false_type) noexcept in __brick_equal() argument
394 return std::equal(__first1, __last1, __first2, __last2, __p); in __brick_equal()
400 … _RandomAccessIterator2 __last2, _BinaryPredicate __p, /* is_vector = */ std::true_type) noexcept in __brick_equal() argument
402 if (__last1 - __first1 != __last2 - __first2) in __brick_equal()
414 … _ForwardIterator2 __last2, _BinaryPredicate __p, _IsVector __is_vector, /* is_parallel = */ in __pattern_equal() argument
417 return __internal::__brick_equal(__first1, __last1, __first2, __last2, __p, __is_vector); in __pattern_equal()
424 … _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __p, in __pattern_equal() argument
427 if (__last1 - __first1 != __last2 - __first2) in __pattern_equal()
2573 _ForwardIterator2 __last2, _OutputIterator __d_first, _Compare __comp, in __brick_merge() argument
2576 return std::merge(__first1, __last1, __first2, __last2, __d_first, __comp); in __brick_merge()
[all …]
H A Dglue_algorithm_impl.h685 _ForwardIterator2 __last2, _BinaryPredicate __pred) in mismatch() argument
689 std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __pred, in mismatch()
706 _ForwardIterator2 __last2) in mismatch() argument
708 … return std::mismatch(std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, in mismatch()
746 _ForwardIterator2 __last2, _BinaryPredicate __p) in equal() argument
750 std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __p, in equal()
758 _ForwardIterator2 __last2) in equal() argument
760 return std::equal(std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, in equal()
873 _ForwardIterator2 __last2, _ForwardIterator __d_first, _Compare __comp) in merge() argument
877 … std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __d_first, __comp, in merge()
[all …]
H A Dglue_algorithm_defs.h313 _ForwardIterator2 __last2, _BinaryPredicate __pred);
323 _ForwardIterator2 __last2);
343 _ForwardIterator2 __last2, _BinaryPredicate __p);
348 _ForwardIterator2 __last2);
413 _ForwardIterator2 __last2, _ForwardIterator __d_first, _Compare __comp);
418 _ForwardIterator2 __last2, _ForwardIterator __d_first);
435 _ForwardIterator2 __last2, _Compare __comp);
440 _ForwardIterator2 __last2);
448 _ForwardIterator2 __last2, _ForwardIterator __result, _Compare __comp);
453 _ForwardIterator2 __last2, _ForwardIterator __result);
[all …]
H A Dparallel_backend_serial.h113 … _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _RandomAccessIterator3 __out, in __parallel_merge() argument
116 __leaf_merge(__first1, __last1, __first2, __last2, __out, __comp); in __parallel_merge()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/debug/
H A Dsafe_iterator.tcc480 _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/apache2/llvm/dist/libcxx/include/
H A Dalgorithm967 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
972 if (__first2 == __last2)
989 if (++__m2 == __last2)
1009 … _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred,
1013 if (__first2 == __last2)
1016 _BidirectionalIterator2 __l2 = __last2;
1020 // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks
1048 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
1052 typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2;
1060 _RandomAccessIterator2 __l2 = __last2;
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/
H A Dalgorithm129 _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/ext/
H A Dalgorithm129 _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 …]

12