Lines Matching refs:__first2
957 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
962 if (__first2 == __last2)
970 if (__pred(*__first1, *__first2))
974 // *__first1 matches *__first2, now match elements after here
976 _ForwardIterator2 __m2 = __first2;
999 … _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred,
1003 if (__first2 == __last2)
1013 if (__first1 == __l1) // return __last1 if no element matches *__first2
1023 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
1038 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
1042 typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2;
1065 if (__m2 == __first2)
1081 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred)
1084 (__first1, __last1, __first2, __last2, __pred,
1094 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
1098 return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1106 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred)
1109 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1121 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred)
1123 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred);
1131 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
1135 … return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1206 _InputIterator2 __first2, _BinaryPredicate __pred)
1208 for (; __first1 != __last1; ++__first1, (void) ++__first2)
1209 if (!__pred(*__first1, *__first2))
1211 return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
1218 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2)
1222 return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1231 _InputIterator2 __first2, _InputIterator2 __last2,
1234 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2)
1235 if (!__pred(*__first1, *__first2))
1237 return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
1245 _InputIterator2 __first2, _InputIterator2 __last2)
1249 return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1259 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate…
1261 for (; __first1 != __last1; ++__first1, (void) ++__first2)
1262 if (!__pred(*__first1, *__first2))
1271 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2)
1275 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1283 _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred,
1286 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2)
1287 if (!__pred(*__first1, *__first2))
1289 return __first1 == __last1 && __first2 == __last2;
1296 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
1299 if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2))
1303 (__first1, __last1, __first2, __pred );
1311 _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred )
1314 (__first1, __last1, __first2, __last2, __pred,
1324 _InputIterator2 __first2, _InputIterator2 __last2)
1328 return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(),
1339 _ForwardIterator2 __first2, _BinaryPredicate __pred)
1342 for (; __first1 != __last1; ++__first1, (void) ++__first2)
1343 if (!__pred(*__first1, *__first2))
1348 // __first1 != __last1 && *__first1 != *__first2
1353 _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1);
1366 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1388 _ForwardIterator2 __first2)
1392 return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>());
1399 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
1404 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2)
1405 if (!__pred(*__first1, *__first2))
1408 return __first2 == __last2;
1409 else if (__first2 == __last2)
1416 _D2 __l2 = _VSTD::distance(__first2, __last2);
1432 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1452 _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2,
1456 if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2))
1460 (__first1, __last1, __first2, __pred );
1468 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
1472 (__first1, __last1, __first2, __last2, __pred,
1482 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
1486 return _VSTD::__is_permutation(__first1, __last1, __first2, __last2,
1501 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred)
1504 (__first1, __last1, __first2, __last2, __pred,
1515 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
1519 return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>());
1979 transform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
1982 for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result)
1983 *__result = __binary_op(*__first1, *__first2);
3917 … typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp)
3923 unique_ptr<value_type, __destruct_n&> __h(__first2, __d);
3924 value_type* __last2 = __first2;
3935 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2)
4400 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4404 if (__first2 == __last2)
4406 if (__comp(*__first2, *__first1))
4408 *__result = *__first2;
4409 ++__first2;
4417 return _VSTD::copy(__first2, __last2, __result);
4424 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4427 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
4434 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
4438 return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>());
4446 _InputIterator2 __first2, _InputIterator2 __last2,
4451 if (__first2 == __last2)
4457 if (__comp(*__first2, *__first1))
4459 *__result = _VSTD::move(*__first2);
4460 ++__first2;
4468 // __first2 through __last2 are already in the right spot.
4621 _InputIterator2 __first2, _InputIterator2 __last2,
4631 … for (; __first2 != __last2; ++__first2, ++__result, (void)__d.template __incr<value_type>())
4632 ::new (__result) value_type(_VSTD::move(*__first2));
4636 if (__first2 == __last2)
4643 if (__comp(*__first2, *__first1))
4645 ::new (__result) value_type(_VSTD::move(*__first2));
4647 ++__first2;
4661 _InputIterator2 __first2, _InputIterator2 __last2,
4666 if (__first2 == __last2)
4672 if (__comp(*__first2, *__first1))
4674 *__result = _VSTD::move(*__first2);
4675 ++__first2;
4683 for (; __first2 != __last2; ++__first2, (void) ++__result)
4684 *__result = _VSTD::move(*__first2);
4697 typename iterator_traits<_RandomAccessIterator>::value_type* __first2)
4705 ::new(__first2) value_type(_VSTD::move(*__first1));
4709 unique_ptr<value_type, __destruct_n&> __h2(__first2, __d);
4712 ::new(__first2) value_type(_VSTD::move(*__last1));
4714 ++__first2;
4715 ::new(__first2) value_type(_VSTD::move(*__first1));
4719 ::new(__first2) value_type(_VSTD::move(*__first1));
4721 ++__first2;
4722 ::new(__first2) value_type(_VSTD::move(*__last1));
4729 _VSTD::__insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp);
4734 _VSTD::__stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2);
4735 … _VSTD::__stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
4736 _VSTD::__merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp);
5366 __includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputItera…
5369 for (; __first2 != __last2; ++__first1)
5371 if (__first1 == __last1 || __comp(*__first2, *__first1))
5373 if (!__comp(*__first1, *__first2))
5374 ++__first2;
5383 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato…
5387 return _VSTD::__includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5394 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato…
5396 return _VSTD::includes(__first1, __last1, __first2, __last2,
5406 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5410 if (__first2 == __last2)
5412 if (__comp(*__first2, *__first1))
5414 *__result = *__first2;
5415 ++__first2;
5419 if (!__comp(*__first1, *__first2))
5420 ++__first2;
5425 return _VSTD::copy(__first2, __last2, __result);
5432 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5435 return _VSTD::__set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5442 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
5444 return _VSTD::set_union(__first1, __last1, __first2, __last2, __result,
5454 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5456 while (__first1 != __last1 && __first2 != __last2)
5458 if (__comp(*__first1, *__first2))
5462 if (!__comp(*__first2, *__first1))
5468 ++__first2;
5478 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5481 …return _VSTD::__set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp…
5488 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
5490 return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result,
5500 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5504 if (__first2 == __last2)
5506 if (__comp(*__first1, *__first2))
5514 if (!__comp(*__first2, *__first1))
5516 ++__first2;
5526 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5529 … return _VSTD::__set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5536 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
5538 return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result,
5548 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5552 if (__first2 == __last2)
5554 if (__comp(*__first1, *__first2))
5562 if (__comp(*__first2, *__first1))
5564 *__result = *__first2;
5569 ++__first2;
5572 return _VSTD::copy(__first2, __last2, __result);
5579 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5582 …return _VSTD::__set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result…
5589 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result)
5591 return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result,
5601 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5603 for (; __first2 != __last2; ++__first1, (void) ++__first2)
5605 if (__first1 == __last1 || __comp(*__first1, *__first2))
5607 if (__comp(*__first2, *__first1))
5618 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5621 … return _VSTD::__lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5629 _InputIterator2 __first2, _InputIterator2 __last2)
5631 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2,