Lines Matching defs:__last2
143 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
147 if (__first1 == __last1 || __first2 == __last2)
152 if (++__p1 == __last2)
175 if (++__p == __last2)
278 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
282 if (__first2 == __last2)
289 = std::__search(__first1, __last1, __first2, __last2, __comp);
309 _BidirectionalIterator2 __last2,
325 _RevIterator2(__last2), __rlast2,
333 std::advance(__result, -std::distance(__first2, __last2));
344 * @param __last2 End of sequence to match.
346 * @p [__first1,__last1-(__last2-__first2)) such that @c *(i+N) ==
348 * [0,__last2-__first2), or @p __last1 if no such iterator exists.
352 * [__first2,__last2) and returns an iterator to the __first
359 * __last1-(__last2-__first2) where @p __last2-__first2 is the
362 * [__first1,__last1-(__last2-__first2))
368 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
377 __glibcxx_requires_valid_range(__first2, __last2);
379 return std::__find_end(__first1, __last1, __first2, __last2,
391 * @param __last2 End of sequence to match.
394 * [__first1,__last1-(__last2-__first2)) such that @c
396 * range @p [0,__last2-__first2), or @p __last1 if no such iterator
401 * [__first2,__last2) using comp as a predicate and returns an
408 * __last1-(__last2-__first2) where @p __last2-__first2 is the
411 * [__first1,__last1-(__last2-__first2))
418 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
428 __glibcxx_requires_valid_range(__first2, __last2);
430 return std::__find_end(__first1, __last1, __first2, __last2,
2326 _InputIterator2 __first2, _InputIterator2 __last2,
2329 while (__first1 != __last1 && __first2 != __last2)
2354 _BidirectionalIterator2 __last2,
2360 _GLIBCXX_MOVE_BACKWARD3(__first2, __last2, __result);
2363 else if (__first2 == __last2)
2367 --__last2;
2370 if (__comp(__last2, __last1))
2375 _GLIBCXX_MOVE_BACKWARD3(__first2, ++__last2, __result);
2382 *--__result = _GLIBCXX_MOVE(*__last2);
2383 if (__first2 == __last2)
2385 --__last2;
2656 _InputIterator __first2, _InputIterator __last2,
2659 while (__first1 != __last1 && __first2 != __last2)
2673 return _GLIBCXX_MOVE3(__first2, __last2,
2807 _InputIterator2 __first2, _InputIterator2 __last2,
2810 while (__first1 != __last1 && __first2 != __last2)
2821 return __first2 == __last2;
2829 * @param __last2 End of sequence.
2830 * @return True if each element in [__first2,__last2) is contained in order
2835 * [__first2,__last2) to be sorted. Searches for the presence of
2836 * each element in [__first2,__last2) within [__first1,__last1).
2838 * linear algorithm. If an element in [__first2,__last2) is not
2839 * found before the search iterator reaches @p __last2, false is
2846 _InputIterator2 __first2, _InputIterator2 __last2)
2858 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
2860 __glibcxx_requires_irreflexive2(__first2, __last2);
2862 return std::__includes(__first1, __last1, __first2, __last2,
2873 * @param __last2 End of sequence.
2875 * @return True if each element in [__first2,__last2) is contained
2880 * [__first2,__last2) to be sorted. Searches for the presence of
2881 * each element in [__first2,__last2) within [__first1,__last1),
2884 * [__first2,__last2) is not found before the search iterator
2885 * reaches @p __last2, false is returned.
2892 _InputIterator2 __first2, _InputIterator2 __last2,
2905 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
2907 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
2909 return std::__includes(__first1, __last1, __first2, __last2,
3553 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
3566 auto __d2 = std::distance(__first2, __last2);
3573 for (; __first1 != __last1 && __first2 != __last2;
3586 auto __d2 = std::distance(__first2, __last2);
3599 auto __matches = std::__count_if(__first2, __last2,
3617 * @param __last2 End of first range.
3619 * [__first2, __last2), beginning with ForwardIterator2 begin,
3627 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
3630 __glibcxx_requires_valid_range(__first2, __last2);
3633 std::__is_permutation(__first1, __last1, __first2, __last2,
3644 * @param __last2 End of first range.
3647 * [__first2, __last2), beginning with ForwardIterator2 begin,
3656 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
3660 __glibcxx_requires_valid_range(__first2, __last2);
3662 return std::__is_permutation(__first1, __last1, __first2, __last2,
3944 * @param __last2 End of match candidates.
3947 * iterator in [__first2,__last2), or @p __last1 if no such iterator exists.
3950 * equal to some element in the range [__first2,__last2). If
3958 _ForwardIterator __first2, _ForwardIterator __last2)
3967 __glibcxx_requires_valid_range(__first2, __last2);
3970 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
3982 * @param __last2 End of match candidates.
3986 * and i2 is an iterator in [__first2,__last2), or @p __last1 if no
3991 * equal to some element in the range [__first2,__last2). If
4000 _ForwardIterator __first2, _ForwardIterator __last2,
4010 __glibcxx_requires_valid_range(__first2, __last2);
4013 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
4125 * @param __last2 A forward iterator.
4127 * [__first1,__last1-(__last2-__first2)) such that @c *(i+N) == @p
4129 * [0,__last2-__first2), or @p __last1 if no such iterator exists.
4133 * [__first2,__last2) and returns an iterator to the first element
4139 * __last1-(__last2-__first2) where @p __last2-__first2 is the
4143 * @p [__first1,__last1-(__last2-__first2))
4149 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
4158 __glibcxx_requires_valid_range(__first2, __last2);
4160 return std::__search(__first1, __last1, __first2, __last2,
4170 * @param __last2 A forward iterator.
4173 * @p [__first1,__last1-(__last2-__first2)) such that
4175 * @p [0,__last2-__first2), or @p __last1 if no such iterator exists.
4179 * [__first2,__last2), using @p __predicate to determine equality,
4190 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
4200 __glibcxx_requires_valid_range(__first2, __last2);
4202 return std::__search(__first1, __last1, __first2, __last2,
4907 _InputIterator2 __first2, _InputIterator2 __last2,
4910 while (__first1 != __last1 && __first2 != __last2)
4924 return std::copy(__first2, __last2,
4934 * @param __last2 Another iterator.
4937 * + (__last2 - __first2).
4939 * Merges the ranges @p [__first1,__last1) and @p [__first2,__last2) into
4941 * (__last2-__first2)). Both input ranges must be sorted, and the
4952 _InputIterator2 __first2, _InputIterator2 __last2,
4966 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
4968 __glibcxx_requires_irreflexive2(__first2, __last2);
4971 __first2, __last2, __result,
4981 * @param __last2 Another iterator.
4985 * + (__last2 - __first2).
4987 * Merges the ranges @p [__first1,__last1) and @p [__first2,__last2) into
4989 * (__last2-__first2)). Both input ranges must be sorted, and the
5003 _InputIterator2 __first2, _InputIterator2 __last2,
5017 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5019 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5022 __first2, __last2, __result,
5121 _InputIterator2 __first2, _InputIterator2 __last2,
5124 while (__first1 != __last1 && __first2 != __last2)
5144 return std::copy(__first2, __last2,
5154 * @param __last2 End of second range.
5172 _InputIterator2 __first2, _InputIterator2 __last2,
5189 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5191 __glibcxx_requires_irreflexive2(__first2, __last2);
5194 __first2, __last2, __result,
5204 * @param __last2 End of second range.
5223 _InputIterator2 __first2, _InputIterator2 __last2,
5240 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5242 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5245 __first2, __last2, __result,
5255 _InputIterator2 __first2, _InputIterator2 __last2,
5258 while (__first1 != __last1 && __first2 != __last2)
5279 * @param __last2 End of second range.
5296 _InputIterator2 __first2, _InputIterator2 __last2,
5311 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5313 __glibcxx_requires_irreflexive2(__first2, __last2);
5316 __first2, __last2, __result,
5327 * @param __last2 End of second range.
5346 _InputIterator2 __first2, _InputIterator2 __last2,
5361 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5363 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5366 __first2, __last2, __result,
5376 _InputIterator2 __first2, _InputIterator2 __last2,
5379 while (__first1 != __last1 && __first2 != __last2)
5402 * @param __last2 End of second range.
5421 _InputIterator2 __first2, _InputIterator2 __last2,
5436 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5438 __glibcxx_requires_irreflexive2(__first2, __last2);
5441 __first2, __last2, __result,
5452 * @param __last2 End of second range.
5473 _InputIterator2 __first2, _InputIterator2 __last2,
5488 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5490 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5493 __first2, __last2, __result,
5505 _InputIterator2 __last2,
5509 while (__first1 != __last1 && __first2 != __last2)
5527 return std::copy(__first2, __last2,
5537 * @param __last2 End of second range.
5554 _InputIterator2 __first2, _InputIterator2 __last2,
5571 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5573 __glibcxx_requires_irreflexive2(__first2, __last2);
5576 __first2, __last2, __result,
5587 * @param __last2 End of second range.
5606 _InputIterator2 __first2, _InputIterator2 __last2,
5624 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5626 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5629 __first2, __last2, __result,