Home
last modified time | relevance | path

Searched refs:__first2 (Results 1 – 22 of 22) sorted by relevance

/freebsd-13.1/contrib/llvm-project/libcxx/include/__algorithm/
H A Dis_permutation.h33 for (; __first1 != __last1; ++__first1, (void)++__first2) in is_permutation()
34 if (!__pred(*__first1, *__first2)) in is_permutation()
44 _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); in is_permutation()
56 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in is_permutation()
87 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __is_permutation()
88 if (!__pred(*__first1, *__first2)) in __is_permutation()
91 return __first2 == __last2; in __is_permutation()
92 else if (__first2 == __last2) in __is_permutation()
99 _D2 __l2 = _VSTD::distance(__first2, __last2); in __is_permutation()
114 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __is_permutation()
[all …]
H A Dstable_sort.h44 … for (; __first2 != __last2; ++__first2, ++__result, (void)__d.template __incr<value_type>()) in __merge_move_construct()
49 if (__first2 == __last2) in __merge_move_construct()
56 if (__comp(*__first2, *__first1)) in __merge_move_construct()
60 ++__first2; in __merge_move_construct()
79 if (__first2 == __last2) in __merge_move_assign()
85 if (__comp(*__first2, *__first1)) in __merge_move_assign()
88 ++__first2; in __merge_move_assign()
96 for (; __first2 != __last2; ++__first2, (void) ++__result) in __merge_move_assign()
97 *__result = _VSTD::move(*__first2); in __merge_move_assign()
127 ++__first2; in __stable_sort_move()
[all …]
H A Dequal.h29 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate… in equal() argument
30 for (; __first1 != __last1; ++__first1, (void)++__first2) in equal()
31 if (!__pred(*__first1, *__first2)) in equal()
38 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in equal() argument
41 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); in equal()
49 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
50 if (!__pred(*__first1, *__first2)) in __equal()
52 return __first1 == __last1 && __first2 == __last2; in __equal()
57 …l(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, in __equal() argument
60 if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) in __equal()
[all …]
H A Dmismatch.h30 …mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredi… in mismatch() argument
31 for (; __first1 != __last1; ++__first1, (void)++__first2) in mismatch()
32 if (!__pred(*__first1, *__first2)) in mismatch()
34 return pair<_InputIterator1, _InputIterator2>(__first1, __first2); in mismatch()
40 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in mismatch() argument
43 return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); in mismatch()
50 …mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterat… in mismatch() argument
52 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in mismatch()
53 if (!__pred(*__first1, *__first2)) in mismatch()
55 return pair<_InputIterator1, _InputIterator2>(__first1, __first2); in mismatch()
[all …]
H A Dset_union.h30 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_union() argument
34 if (__first2 == __last2) in __set_union()
36 if (__comp(*__first2, *__first1)) in __set_union()
38 *__result = *__first2; in __set_union()
39 ++__first2; in __set_union()
43 if (!__comp(*__first1, *__first2)) in __set_union()
44 ++__first2; in __set_union()
49 return _VSTD::copy(__first2, __last2, __result); in __set_union()
59 return _VSTD::__set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); in set_union()
66 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) in set_union() argument
[all …]
H A Dset_symmetric_difference.h30 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_symmetric_difference() argument
34 if (__first2 == __last2) in __set_symmetric_difference()
36 if (__comp(*__first1, *__first2)) in __set_symmetric_difference()
44 if (__comp(*__first2, *__first1)) in __set_symmetric_difference()
46 *__result = *__first2; in __set_symmetric_difference()
51 ++__first2; in __set_symmetric_difference()
54 return _VSTD::copy(__first2, __last2, __result); in __set_symmetric_difference()
61 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in set_symmetric_difference() argument
64 …return _VSTD::__set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result… in set_symmetric_difference()
71 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) in set_symmetric_difference() argument
[all …]
H A Dfind_end.h29 … _ForwardIterator2 __first2, _ForwardIterator2 __last2, in __find_end() argument
34 if (__first2 == __last2) in __find_end()
40 if (__pred(*__first1, *__first2)) in __find_end()
46 _ForwardIterator2 __m2 = __first2; in __find_end()
66 …BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, in __find_end() argument
69 if (__first2 == __last2) in __find_end()
86 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) in __find_end()
100 … _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, in __find_end() argument
103 typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; in __find_end()
123 if (__m2 == __first2) in __find_end()
[all …]
H A Dmerge.h31 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __merge() argument
35 if (__first2 == __last2) in __merge()
37 if (__comp(*__first2, *__first1)) in __merge()
39 *__result = *__first2; in __merge()
40 ++__first2; in __merge()
48 return _VSTD::copy(__first2, __last2, __result); in __merge()
55 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in merge() argument
58 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); in merge()
65 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) in merge() argument
69 return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); in merge()
H A Dlexicographical_compare.h29 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in __lexicographical_compare() argument
31 for (; __first2 != __last2; ++__first1, (void) ++__first2) in __lexicographical_compare()
33 if (__first1 == __last1 || __comp(*__first1, *__first2)) in __lexicographical_compare()
35 if (__comp(*__first2, *__first1)) in __lexicographical_compare()
46 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in lexicographical_compare() argument
49 … return _VSTD::__lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); in lexicographical_compare()
57 _InputIterator2 __first2, _InputIterator2 __last2) in lexicographical_compare() argument
59 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, in lexicographical_compare()
H A Dincludes.h28 __includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputItera… in __includes() argument
31 for (; __first2 != __last2; ++__first1) in __includes()
33 if (__first1 == __last1 || __comp(*__first2, *__first1)) in __includes()
35 if (!__comp(*__first1, *__first2)) in __includes()
36 ++__first2; in __includes()
45 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato… in includes() argument
49 return _VSTD::__includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); in includes()
56 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato… in includes() argument
58 return _VSTD::includes(__first1, __last1, __first2, __last2, in includes()
H A Dset_intersection.h29 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_intersection() argument
31 while (__first1 != __last1 && __first2 != __last2) in __set_intersection()
33 if (__comp(*__first1, *__first2)) in __set_intersection()
37 if (!__comp(*__first2, *__first1)) in __set_intersection()
43 ++__first2; in __set_intersection()
53 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in set_intersection() argument
56 …return _VSTD::__set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp… in set_intersection()
63 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) in set_intersection() argument
65 return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, in set_intersection()
H A Dsearch.h31 _ForwardIterator2 __first2, _ForwardIterator2 __last2, in __search() argument
33 if (__first2 == __last2) in __search()
40 if (__pred(*__first1, *__first2)) in __search()
46 _ForwardIterator2 __m2 = __first2; in __search()
63 …h(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, in __search() argument
69 const _D2 __len2 = __last2 - __first2; in __search()
81 if (__pred(*__first1, *__first2)) in __search()
87 _RandomAccessIterator2 __m2 = __first2; in __search()
102 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardI… in search() argument
105 __first1, __last1, __first2, __last2, __pred, in search()
[all …]
H A Dset_difference.h30 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_difference() argument
34 if (__first2 == __last2) in __set_difference()
36 if (__comp(*__first1, *__first2)) in __set_difference()
44 if (!__comp(*__first2, *__first1)) in __set_difference()
46 ++__first2; in __set_difference()
56 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in set_difference() argument
59 … return _VSTD::__set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); in set_difference()
66 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) in set_difference() argument
68 return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, in set_difference()
H A Dfind_first_of.h29 _ForwardIterator2 __first2, in __find_first_of_ce() argument
32 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce()
40 find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, in find_first_of() argument
42 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); in find_first_of()
47 …_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterato… in find_first_of() argument
50 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); in find_first_of()
H A Dswap_ranges.h27 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) { in swap_ranges() argument
28 for (; __first1 != __last1; ++__first1, (void)++__first2) in swap_ranges()
29 swap(*__first1, *__first2); in swap_ranges()
30 return __first2; in swap_ranges()
H A Dtransform.h36 transform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, in transform() argument
39 for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) in transform()
40 *__result = __binary_op(*__first1, *__first2); in transform()
H A Dinplace_merge.h56 _InputIterator2 __first2, _InputIterator2 __last2, in __half_inplace_merge() argument
61 if (__first2 == __last2) in __half_inplace_merge()
67 if (__comp(*__first2, *__first1)) in __half_inplace_merge()
69 *__result = _VSTD::move(*__first2); in __half_inplace_merge()
70 ++__first2; in __half_inplace_merge()
H A Dsort.h238 … typename iterator_traits<_BidirectionalIterator>::value_type* __first2, _Compare __comp) in __insertion_sort_move() argument
244 unique_ptr<value_type, __destruct_n&> __h(__first2, __d); in __insertion_sort_move()
245 value_type* __last2 = __first2; in __insertion_sort_move()
256 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) in __insertion_sort_move()
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A D__bit_reference980 if ((*__first2.__seg_ & __m) != (__b << (__first2.__ctz_ - __first1.__ctz_)))
985 if ((*__first2.__seg_ & __m) != (__b >> (__first1.__ctz_ - __first2.__ctz_)))
988 __first2.__seg_ += (__ddn + __first2.__ctz_) / __bits_per_word;
989 __first2.__ctz_ = static_cast<unsigned>((__ddn + __first2.__ctz_) % __bits_per_word);
1008 if ((*__first2.__seg_ & __m) != (__b << __first2.__ctz_))
1010 ++__first2.__seg_;
1021 if ((*__first2.__seg_ & __m) != (__b << __first2.__ctz_))
1023 __first2.__seg_ += (__dn + __first2.__ctz_) / __bits_per_word;
1024 __first2.__ctz_ = static_cast<unsigned>((__dn + __first2.__ctz_) % __bits_per_word);
1058 ++__first2.__seg_;
[all …]
H A Dnumeric226 for (; __first1 != __last1; ++__first1, (void) ++__first2)
228 __init = _VSTD::move(__init) + *__first1 * *__first2;
230 __init = __init + *__first1 * *__first2;
241 for (; __first1 != __last1; ++__first1, (void) ++__first2)
243 __init = __binary_op1(_VSTD::move(__init), __binary_op2(*__first1, *__first2));
245 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
267 _InputIterator2 __first2, _Tp __init, _BinaryOp1 __b1, _BinaryOp2 __b2)
269 for (; __first1 != __last1; ++__first1, (void) ++__first2)
270 __init = __b1(__init, __b2(*__first1, *__first2));
278 _InputIterator2 __first2, _Tp __init)
[all …]
H A D__string922 const _CharT *__first2, const _CharT *__last2) _NOEXCEPT {
925 const ptrdiff_t __len2 = __last2 - __first2;
933 // First element of __first2 is loop invariant.
934 _CharT __f2 = *__first2;
947 // already know that it matches the first byte of __first2: this is because
948 // __first2 is most likely aligned, as it is user's "pattern" string, and
951 if (_Traits::compare(__first1, __first2, __len2) == 0)
H A Dcharconv316 __inner_product(_It1 __first1, _It1 __last1, _It2 __first2, _Up __init)
318 for (; __first1 < __last1; ++__first1, ++__first2)
319 __init = __init + *__first1 * *__first2;