Lines Matching refs:__first1
898 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
910 if (__first1 == __last1) // if source exhausted return last correct answer
912 if (__pred(*__first1, *__first2))
914 ++__first1;
916 // *__first1 matches *__first2, now match elements after here
917 _ForwardIterator1 __m1 = __first1;
923 __r = __first1;
924 ++__first1;
931 ++__first1;
940 __find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1,
955 if (__first1 == __l1) // return __last1 if no element matches *__first2
967 if (__m1 == __first1) // Otherwise if source exhaused, pattern not found
979 __find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
987 typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1;
990 …const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go befo…
1021 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1025 (__first1, __last1, __first2, __last2, __pred,
1033 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1038 return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1045 find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1048 for (; __first1 != __last1; ++__first1)
1050 if (__pred(*__first1, *__j))
1051 return __first1;
1058 find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1063 return _VSTD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1128 mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
1131 for (; __first1 != __last1; ++__first1, ++__first2)
1132 if (!__pred(*__first1, *__first2))
1134 return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
1140 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2)
1144 return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1151 mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
1155 for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
1156 if (!__pred(*__first1, *__first2))
1158 return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
1164 mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
1169 return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1178 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate…
1180 for (; __first1 != __last1; ++__first1, ++__first2)
1181 if (!__pred(*__first1, *__first2))
1189 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2)
1193 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1200 __equal(_InputIterator1 __first1, _InputIterator1 __last1,
1204 for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
1205 if (!__pred(*__first1, *__first2))
1207 return __first1 == __last1 && __first2 == __last2;
1213 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
1217 if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2))
1221 (__first1, __last1, __first2, __pred );
1227 equal(_InputIterator1 __first1, _InputIterator1 __last1,
1231 (__first1, __last1, __first2, __last2, __pred,
1239 equal(_InputIterator1 __first1, _InputIterator1 __last1,
1244 return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(),
1254 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1258 for (; __first1 != __last1; ++__first1, ++__first2)
1259 if (!__pred(*__first1, *__first2))
1263 // __first1 != __last1 && *__first1 != *__first2
1265 _D1 __l1 = _VSTD::distance(__first1, __last1);
1271 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1274 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1301 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1306 return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1312 __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1318 for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
1319 if (!__pred(*__first1, *__first2))
1321 return __first1 == __last1 && __first2 == __last2;
1323 // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2
1325 _D1 __l1 = _VSTD::distance(__first1, __last1);
1334 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1337 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1363 __is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1,
1368 if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2))
1372 (__first1, __last1, __first2, __pred );
1378 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1383 (__first1, __last1, __first2, __last2, __pred,
1391 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1396 return _VSTD::__is_permutation(__first1, __last1, __first2, __last2,
1407 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1412 return __first1; // Everything matches an empty sequence
1418 if (__first1 == __last1) // return __last1 if no element matches *__first2
1420 if (__pred(*__first1, *__first2))
1422 ++__first1;
1424 // *__first1 matches *__first2, now match elements after here
1425 _ForwardIterator1 __m1 = __first1;
1429 …if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element patte…
1430 return __first1;
1433 if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1
1435 ++__first1;
1444 __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
1453 return __first1;
1454 _D1 __len1 = __last1 - __first1;
1463 if (__first1 == __s)
1465 if (__pred(*__first1, *__first2))
1467 ++__first1;
1470 for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll)
1472 if (__pred(*__first1, *__first2))
1474 if (__pred(*++__first1, *__first2))
1476 if (__pred(*++__first1, *__first2))
1478 if (__pred(*++__first1, *__first2))
1480 ++__first1;
1482 switch (__s - __first1)
1485 if (__pred(*__first1, *__first2))
1487 ++__first1;
1489 if (__pred(*__first1, *__first2))
1491 ++__first1;
1493 if (__pred(*__first1, *__first2))
1500 _RandomAccessIterator1 __m1 = __first1;
1506 return __first1;
1510 ++__first1;
1546 return __first1;
1549 ++__first1;
1557 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1561 (__first1, __last1, __first2, __last2, __pred,
1569 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
1574 return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1949 transform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
1952 for (; __first1 != __last1; ++__first1, ++__first2, ++__result)
1953 *__result = __binary_op(*__first1, *__first2);
3787 __insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1,
3791 if (__first1 != __last1)
3796 ::new(__last2) value_type(_VSTD::move(*__first1));
3798 for (++__last2; ++__first1 != __last1; ++__last2)
3802 if (__comp(*__first1, *--__i2))
3806 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2)
3808 *__j2 = _VSTD::move(*__first1);
3812 ::new(__j2) value_type(_VSTD::move(*__first1));
4298 __merge(_InputIterator1 __first1, _InputIterator1 __last1,
4301 for (; __first1 != __last1; ++__result)
4304 return _VSTD::copy(__first1, __last1, __result);
4305 if (__comp(*__first2, *__first1))
4312 *__result = *__first1;
4313 ++__first1;
4322 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4328 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
4331 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
4338 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4343 return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>());
4524 __merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1,
4533 if (__first1 == __last1)
4542 for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0))
4543 ::new (__result) value_type(_VSTD::move(*__first1));
4547 if (__comp(*__first2, *__first1))
4555 ::new (__result) value_type(_VSTD::move(*__first1));
4557 ++__first1;
4564 __merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1,
4568 for (; __first1 != __last1; ++__result)
4572 for (; __first1 != __last1; ++__first1, ++__result)
4573 *__result = _VSTD::move(*__first1);
4576 if (__comp(*__first2, *__first1))
4583 *__result = _VSTD::move(*__first1);
4584 ++__first1;
4599 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp,
4609 ::new(__first2) value_type(_VSTD::move(*__first1));
4614 if (__comp(*--__last1, *__first1))
4619 ::new(__first2) value_type(_VSTD::move(*__first1));
4623 ::new(__first2) value_type(_VSTD::move(*__first1));
4633 __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp);
4637 _RandomAccessIterator __m = __first1 + __l2;
4638 __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2);
4640 __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp);
5301 __includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputItera…
5304 for (; __first2 != __last2; ++__first1)
5306 if (__first1 == __last1 || __comp(*__first2, *__first1))
5308 if (!__comp(*__first1, *__first2))
5317 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato…
5323 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c);
5326 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5333 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato…
5335 return _VSTD::includes(__first1, __last1, __first2, __last2,
5344 __set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5347 for (; __first1 != __last1; ++__result)
5350 return _VSTD::copy(__first1, __last1, __result);
5351 if (__comp(*__first2, *__first1))
5358 *__result = *__first1;
5359 if (!__comp(*__first1, *__first2))
5361 ++__first1;
5370 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5376 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5379 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5386 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5389 return _VSTD::set_union(__first1, __last1, __first2, __last2, __result,
5398 __set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5401 while (__first1 != __last1 && __first2 != __last2)
5403 if (__comp(*__first1, *__first2))
5404 ++__first1;
5407 if (!__comp(*__first2, *__first1))
5409 *__result = *__first1;
5411 ++__first1;
5422 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5428 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5431 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5438 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5441 return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result,
5450 __set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5453 while (__first1 != __last1)
5456 return _VSTD::copy(__first1, __last1, __result);
5457 if (__comp(*__first1, *__first2))
5459 *__result = *__first1;
5461 ++__first1;
5465 if (!__comp(*__first2, *__first1))
5466 ++__first1;
5476 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5482 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5485 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5492 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5495 return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result,
5504 __set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5507 while (__first1 != __last1)
5510 return _VSTD::copy(__first1, __last1, __result);
5511 if (__comp(*__first1, *__first2))
5513 *__result = *__first1;
5515 ++__first1;
5519 if (__comp(*__first2, *__first1))
5525 ++__first1;
5535 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5541 … return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c);
5544 …return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __com…
5551 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5554 return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result,
5563 __lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5566 for (; __first2 != __last2; ++__first1, ++__first2)
5568 if (__first1 == __last1 || __comp(*__first1, *__first2))
5570 if (__comp(*__first2, *__first1))
5579 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5585 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c);
5588 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5595 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
5598 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2,