Home
last modified time | relevance | path

Searched refs:__last2 (Results 1 – 25 of 36) sorted by relevance

12

/external/cronet/buildtools/third_party/libc++/trunk/include/__algorithm/
Dfind_end.h44 _Sent2 __last2, in __find_end_impl() argument
53 if (__first2 == __last2) in __find_end_impl()
67 if (++__m2 == __last2) { // Pattern exhaused, record answer and search for another one in __find_end_impl()
105 auto __last2 = _IterOps::next(__first2, __sent2); in __find_end() local
107 if (__first2 == __last2) in __find_end()
110 _Iter2 __l2 = __last2; in __find_end()
159 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __sent2); in __find_end() local
161 auto __len2 = __last2 - __first2; in __find_end()
169 _Iter2 __l2 = __last2; in __find_end()
194 _ForwardIterator2 __first2, _ForwardIterator2 __last2, in __find_end_classic() argument
[all …]
Dis_permutation.h59 __is_permutation_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
74 for (auto __j = __first2; __j != __last2; ++__j) {
114 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __l1);
117 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
126 __is_permutation(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
130 while (__first1 != __last1 && __first2 != __last2) {
138 return __first2 == __last2;
139 if (__first2 == __last2) // Second range is shorter
146 _D2 __l2 = _IterOps<_AlgPolicy>::distance(__first2, __last2);
151 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
[all …]
Dsearch.h39 _Iter2 __first2, _Sent2 __last2, in __search_forward_impl() argument
43 if (__first2 == __last2) in __search_forward_impl()
60 …if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element patter… in __search_forward_impl()
86 _Iter2 __first2, _Sent2 __last2, in __search_random_access_impl() argument
108 if (++__m2 == __last2) in __search_random_access_impl()
126 _Iter2 __first2, _Sent2 __last2,
133 auto __size2 = __last2 - __first2;
143 __first2, __last2,
158 _Iter2 __first2, _Sent2 __last2,
167 __first2, __last2,
[all …]
Dequal.h72 …nputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, in __equal() argument
74 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
77 return __first1 == __last1 && __first2 == __last2; in __equal()
82 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __comp, _Proj1& __proj1, … in __equal_impl() argument
83 while (__first1 != __last1 && __first2 != __last2) { in __equal_impl()
89 return __first1 == __last1 && __first2 == __last2; in __equal_impl()
109 _RandomAccessIterator2 __last2, _BinaryPredicate __pred, random_access_iterator_tag, in __equal() argument
111 if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) in __equal()
118 std::__unwrap_iter(__last2), in __equal()
126 …nputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, in equal() argument
[all …]
Dlexicographical_compare_three_way.h38 …__first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Cmp& __comp)
50 _Len2 __len2 = __last2 - __first2;
68 …__first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Cmp& __comp)
72 bool __exhausted2 = __first2 == __last2;
94 … __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Cmp __comp)
104 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __wrapped_comp_r…
108 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __wrapped_comp_r…
114 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { in lexicographical_compare_three_way() argument
116 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), std::compare_thr… in lexicographical_compare_three_way()
Dmerge.h28 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __merge() argument
32 if (__first2 == __last2) in __merge()
45 return _VSTD::copy(__first2, __last2, __result); in __merge()
52 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in merge() argument
54 …return _VSTD::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, … in merge()
61 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) in merge() argument
65 return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); in merge()
Dfind_first_of.h28 _ForwardIterator2 __last2, in __find_first_of_ce() argument
31 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce()
40 _ForwardIterator2 __last2, _BinaryPredicate __pred) { in find_first_of() argument
41 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); in find_first_of()
46 …ator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) { in find_first_of() argument
47 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to()); in find_first_of()
Dlexicographical_compare.h26 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in __lexicographical_compare() argument
28 for (; __first2 != __last2; ++__first1, (void) ++__first2) in __lexicographical_compare()
43 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in lexicographical_compare() argument
45 …_lexicographical_compare<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __comp); in lexicographical_compare()
53 _InputIterator2 __first2, _InputIterator2 __last2) in lexicographical_compare() argument
55 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, in lexicographical_compare()
Dset_intersection.h41 …_InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&… in __set_intersection() argument
42 while (__first1 != __last1 && __first2 != __last2) { in __set_intersection()
57 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), in __set_intersection()
66 _InputIterator2 __last2, in set_intersection() argument
73 std::move(__last2), in set_intersection()
84 _InputIterator2 __last2, in set_intersection() argument
90 std::move(__last2), in set_intersection()
Dset_difference.h33 …_InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result,… in __set_difference() argument
34 while (__first1 != __last1 && __first2 != __last2) { in __set_difference()
54 _InputIterator2 __last2, in set_difference() argument
58 __first1, __last1, __first2, __last2, __result, __comp) in set_difference()
67 _InputIterator2 __last2, in set_difference() argument
73 __last2, in set_difference()
Dincludes.h29 __includes(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, in __includes() argument
31 for (; __first2 != __last2; ++__first1) { in __includes()
46 _InputIterator2 __last2, in includes() argument
55 std::move(__last2), in includes()
63 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { in includes() argument
68 std::move(__last2), in includes()
Dset_symmetric_difference.h42 …_InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&… in __set_symmetric_difference() argument
44 if (__first2 == __last2) { in __set_symmetric_difference()
63 …auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)… in __set_symmetric_difference()
73 _InputIterator2 __last2, in set_symmetric_difference() argument
80 std::move(__last2), in set_symmetric_difference()
91 _InputIterator2 __last2, in set_symmetric_difference() argument
97 std::move(__last2), in set_symmetric_difference()
Dset_union.h41 …_InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&… in __set_union() argument
43 if (__first2 == __last2) { in __set_union()
59 …auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)… in __set_union()
69 _InputIterator2 __last2, in set_union() argument
76 std::move(__last2), in set_union()
87 _InputIterator2 __last2, in set_union() argument
93 std::move(__last2), in set_union()
Dstable_sort.h43 value_type* __last2 = __first2; in __insertion_sort_move() local
44 ::new ((void*)__last2) value_type(_Ops::__iter_move(__first1)); in __insertion_sort_move()
46 for (++__last2; ++__first1 != __last1; ++__last2) { in __insertion_sort_move()
47 value_type* __j2 = __last2; in __insertion_sort_move()
67 _InputIterator2 __first2, _InputIterator2 __last2, in __merge_move_construct() argument
79 … for (; __first2 != __last2; ++__first2, (void) ++__result, __d.template __incr<value_type>()) in __merge_move_construct()
84 if (__first2 == __last2) in __merge_move_construct()
109 _InputIterator2 __first2, _InputIterator2 __last2, in __merge_move_assign() argument
116 if (__first2 == __last2) in __merge_move_assign()
133 for (; __first2 != __last2; ++__first2, (void) ++__result) in __merge_move_assign()
Dranges_search.h43 _Sent2 __last2, in __ranges_search_impl()
48 auto __size2 = ranges::distance(__first2, __last2); in __ranges_search_impl()
61 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __ranges_search_impl()
68 …std::__search_forward_impl<_RangeAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1,… in __ranges_search_impl()
80 _Iter2 __first2, _Sent2 __last2, in operator()
84 return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
Dmismatch.h45 …nputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, in mismatch() argument
47 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in mismatch()
56 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { in mismatch() argument
57 return std::mismatch(__first1, __last1, __first2, __last2, __equal_to()); in mismatch()
Dranges_merge.h55 _Sent2&& __last2, in __merge_impl() argument
60 for (; __first1 != __last1 && __first2 != __last2; ++__result) { in __merge_impl()
70 auto __ret2 = ranges::copy(std::move(__first2), std::move(__last2), std::move(__ret1.out)); in __merge_impl()
89 _Sent2 __last2, in operator()
94 …return __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __pr…
Dranges_find_first_of.h38 _Iter2 __first2, _Sent2 __last2, in __find_first_of_impl()
43 for (auto __j = __first2; __j != __last2; ++__j) { in __find_first_of_impl()
59 _Iter2 __first2, _Sent2 __last2, in operator()
64 std::move(__first2), std::move(__last2),
Dranges_lexicographical_compare.h37 _Iter2 __first2, _Sent2 __last2, in __lexicographical_compare_impl()
41 while (__first2 != __last2) { in __lexicographical_compare_impl()
60 _Iter2 __first2, _Sent2 __last2, in operator()
65 std::move(__first2), std::move(__last2),
Dranges_is_permutation.h39 bool __is_permutation_func_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, in __is_permutation_func_impl()
42 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), in __is_permutation_func_impl()
53 bool operator()(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, in operator()
56 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
Dranges_mismatch.h43 __go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, in __go()
45 while (__first1 != __last1 && __first2 != __last2) { in __go()
59 mismatch_result<_I1, _I2> operator()(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, in operator()
61 … return __go(std::move(__first1), __last1, std::move(__first2), __last2, __pred, __proj1, __proj2);
Dranges_equal.h44 _Iter2 __first2, _Sent2 __last2, in operator()
49 if (__last1 - __first1 != __last2 - __first2)
53 auto __unwrapped2 = std::__unwrap_range(std::move(__first2), std::move(__last2));
Dranges_transform.h70 _InIter2 __first2, _Sent2 __last2, in __binary()
75 while (__first1 != __last1 && __first2 != __last2) { in __binary()
121 … _InIter2 __first2, _Sent2 __last2, in operator()
127 std::move(__first2), std::move(__last2),
Dranges_swap_ranges.h42 operator()(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2) const { in operator()
44 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2)); in operator()
/external/libcxx/include/
Dalgorithm927 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
932 if (__first2 == __last2)
949 if (++__m2 == __last2)
969 … _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred,
973 if (__first2 == __last2)
976 _BidirectionalIterator2 __l2 = __last2;
980 // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks
1008 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
1012 typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2;
1020 _RandomAccessIterator2 __l2 = __last2;
[all …]

12