Lines Matching full:__last1
926 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
931 _ForwardIterator1 __r = __last1; // __last1 is the "default" answer
938 if (__first1 == __last1) // if source exhausted return last correct answer
939 return __r; // (or __last1 if never found)
955 if (++__m1 == __last1) // Source exhausted, return last answer
968 __find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1,
974 return __last1; // Everything matches an empty sequence
975 _BidirectionalIterator1 __l1 = __last1;
983 if (__first1 == __l1) // return __last1 if no element matches *__first2
984 return __last1;
996 return __last1;
1007 __find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
1014 return __last1;
1015 typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1;
1017 return __last1;
1019 _RandomAccessIterator1 __l1 = __last1;
1027 return __last1;
1049 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1053 (__first1, __last1, __first2, __last2, __pred,
1061 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1066 return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1073 __find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1076 for (; __first1 != __last1; ++__first1)
1080 return __last1;
1087 find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1090 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred);
1096 find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1101 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1166 mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
1169 for (; __first1 != __last1; ++__first1, (void) ++__first2)
1178 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2)
1182 return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1189 mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
1193 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2)
1202 mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
1207 return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1216 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred)
1218 for (; __first1 != __last1; ++__first1, (void) ++__first2)
1227 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2)
1231 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1238 __equal(_InputIterator1 __first1, _InputIterator1 __last1,
1242 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2)
1245 return __first1 == __last1 && __first2 == __last2;
1251 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
1255 if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2))
1259 (__first1, __last1, __first2, __pred );
1265 equal(_InputIterator1 __first1, _InputIterator1 __last1,
1269 (__first1, __last1, __first2, __last2, __pred,
1277 equal(_InputIterator1 __first1, _InputIterator1 __last1,
1282 return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(),
1292 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1296 for (; __first1 != __last1; ++__first1, (void) ++__first2)
1301 // __first1 != __last1 && *__first1 != *__first2
1303 _D1 __l1 = _VSTD::distance(__first1, __last1);
1309 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1325 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1339 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1344 return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1350 __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1356 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2)
1359 return __first1 == __last1 && __first2 == __last2;
1361 // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2
1363 _D1 __l1 = _VSTD::distance(__first1, __last1);
1372 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1388 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1401 __is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1,
1406 if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2))
1410 (__first1, __last1, __first2, __pred );
1416 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1421 (__first1, __last1, __first2, __last2, __pred,
1429 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1434 return _VSTD::__is_permutation(__first1, __last1, __first2, __last2,
1445 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1456 if (__first1 == __last1) // return __last1 if no element matches *__first2
1457 return make_pair(__last1, __last1);
1469 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found
1470 return make_pair(__last1, __last1);
1483 __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
1493 const _D1 __len1 = __last1 - __first1;
1495 return make_pair(__last1, __last1);
1496 const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here
1503 return make_pair(__last1, __last1);
1528 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1532 (__first1, __last1, __first2, __last2, __pred,
1541 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1546 return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1932 transform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
1935 for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result)
3853 __insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1,
3857 if (__first1 != __last1)
3864 for (++__last2; ++__first1 != __last1; ++__last2)
4364 __merge(_InputIterator1 __first1, _InputIterator1 __last1,
4367 for (; __first1 != __last1; ++__result)
4370 return _VSTD::copy(__first1, __last1, __result);
4388 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4394 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
4397 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
4404 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4409 return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>());
4416 void __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1,
4420 for (; __first1 != __last1; ++__result)
4424 _VSTD::move(__first1, __last1, __result);
4599 __merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1,
4608 if (__first1 == __last1)
4617 for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0))
4639 __merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1,
4643 for (; __first1 != __last1; ++__result)
4647 for (; __first1 != __last1; ++__first1, ++__result)
4674 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp,
4689 if (__comp(*--__last1, *__first1))
4691 ::new(__first2) value_type(_VSTD::move(*__last1));
4701 ::new(__first2) value_type(_VSTD::move(*__last1));
4708 __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp);
4714 __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
4715 __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp);
5390 __includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2,
5395 if (__first1 == __last1 || __comp(*__first2, *__first1))
5406 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2,
5412 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c);
5415 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5422 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2)
5424 return _VSTD::includes(__first1, __last1, __first2, __last2,
5433 __set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5436 for (; __first1 != __last1; ++__result)
5439 return _VSTD::copy(__first1, __last1, __result);
5459 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5465 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5468 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5475 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5478 return _VSTD::set_union(__first1, __last1, __first2, __last2, __result,
5487 __set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5490 while (__first1 != __last1 && __first2 != __last2)
5511 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5517 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5520 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5527 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5530 return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result,
5539 __set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5542 while (__first1 != __last1)
5545 return _VSTD::copy(__first1, __last1, __result);
5565 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5571 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5574 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5581 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5584 return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result,
5593 __set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5596 while (__first1 != __last1)
5599 return _VSTD::copy(__first1, __last1, __result);
5624 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5630 return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5633 return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5640 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5643 return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result,
5652 __lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5657 if (__first1 == __last1 || __comp(*__first1, *__first2))
5668 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5674 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c);
5677 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5684 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5687 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2,
