/openbsd-current/gnu/llvm/libcxx/include/__algorithm/ |
H A D | mismatch.h | 27 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { argument 28 for (; __first1 != __last1; ++__first1, (void)++__first2) 29 if (!__pred(*__first1, *__first2)) 31 return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 37 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { argument 38 return std::mismatch(__first1, __last1, __first2, __equal_to()); 45 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, argument 47 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) 48 if (!__pred(*__first1, *__first2)) 56 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) argument [all...] |
H A D | equal.h | 26 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { argument 27 for (; __first1 != __last1; ++__first1, (void)++__first2) 28 if (!__pred(*__first1, *__first2)) 35 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { argument 36 return std::equal(__first1, __last1, __first2, __equal_to()); 42 __equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, argument 44 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) 45 if (!__pred(*__first1, *__first2)) 47 return __first1 == __last1 && __first2 52 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, random_access_iterator_tag, random_access_iterator_tag) argument 63 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred) argument 72 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) argument [all...] |
H A D | lexicographical_compare.h | 26 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 28 for (; __first2 != __last2; ++__first1, (void) ++__first2) 30 if (__first1 == __last1 || __comp(*__first1, *__first2)) 32 if (__comp(*__first2, *__first1)) 43 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 45 return _VSTD::__lexicographical_compare<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __comp); 53 _InputIterator2 __first2, _InputIterator2 __last2) 55 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 25 __lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) argument 42 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) argument 52 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) argument
|
H A D | swap_ranges.h | 27 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _Sentinel2 __last2) { argument 28 while (__first1 != __last1 && __first2 != __last2) { 29 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); 31 ++__first2; 34 return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2)); 41 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2) { argument 43 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); 45 ++__first2; 48 return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2)); 53 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) { argument [all...] |
H A D | merge.h | 28 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 32 if (__first2 == __last2) 34 if (__comp(*__first2, *__first1)) 36 *__result = *__first2; 37 ++__first2; 45 return _VSTD::copy(__first2, __last2, __result); 52 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54 return _VSTD::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __comp); 61 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 65 return _VSTD::merge(__first1, __last1, __first2, __last 27 __merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 51 merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 60 merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument [all...] |
H A D | find_first_of.h | 27 _ForwardIterator2 __first2, 31 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 39 find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, argument 41 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 46 _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) { 47 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to()); 25 __find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate&& __pred) argument 45 find_first_of( _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) argument
|
H A D | is_permutation.h | 59 __is_permutation_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, argument 74 for (auto __j = __first2; __j != __last2; ++__j) { 98 __is_permutation(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, argument 101 for (; __first1 != __last1; ++__first1, (void)++__first2) { 102 if (!__pred(*__first1, *__first2)) 109 // __first1 != __last1 && *__first1 != *__first2 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, argument 130 while (__first1 != __last1 && __first2 ! 160 __is_permutation(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2, true_type) argument 176 __is_permutation(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2) argument 189 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _BinaryPredicate __pred) argument 201 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) argument 209 is_permutation( _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) argument 224 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) argument [all...] |
H A D | set_difference.h | 33 _InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result, _Comp&& __comp) { 34 while (__first1 != __last1 && __first2 != __last2) { 35 if (__comp(*__first1, *__first2)) { 39 } else if (__comp(*__first2, *__first1)) { 40 ++__first2; 43 ++__first2; 53 _InputIterator2 __first2, 58 __first1, __last1, __first2, __last2, __result, __comp) 66 _InputIterator2 __first2, 72 __first2, 32 __set_difference( _InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result, _Comp&& __comp) argument 50 set_difference( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 63 set_difference( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument [all...] |
H A D | includes.h | 29 __includes(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, argument 31 for (; __first2 != __last2; ++__first1) { 33 __comp, std::__invoke(__proj2, *__first2), std::__invoke(__proj1, *__first1))) 35 if (!std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) 36 ++__first2; 45 _InputIterator2 __first2, 48 static_assert(__is_callable<_Compare, decltype(*__first1), decltype(*__first2)>::value, 54 std::move(__first2), 63 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { argument 67 std::move(__first2), 42 includes( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) argument [all...] |
H A D | stable_sort.h | 36 _InputIterator2 __first2, _InputIterator2 __last2, 48 for (; __first2 != __last2; ++__first2, (void) ++__result, __d.template __incr<value_type>()) 49 ::new ((void*)__result) value_type(_Ops::__iter_move(__first2)); 53 if (__first2 == __last2) 60 if (__comp(*__first2, *__first1)) 62 ::new ((void*)__result) value_type(_Ops::__iter_move(__first2)); 64 ++__first2; 78 _InputIterator2 __first2, _InputIterator2 __last2, 85 if (__first2 35 __merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) argument 77 __merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 114 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, typename iterator_traits<_RandomAccessIterator>::difference_type __len, typename iterator_traits<_RandomAccessIterator>::value_type* __first2) argument [all...] |
H A D | set_union.h | 41 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { 43 if (__first2 == __last2) { 46 std::move(__ret1.first), std::move(__first2), std::move((__ret1.second))); 48 if (__comp(*__first2, *__first1)) { 49 *__result = *__first2; 50 ++__first2; 52 if (!__comp(*__first1, *__first2)) { 53 ++__first2; 59 auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)); 68 _InputIterator2 __first2, 40 __set_union( _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) argument 65 set_union( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 83 set_union( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument [all...] |
H A D | transform.h | 33 transform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, argument 36 for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 37 *__result = __binary_op(*__first1, *__first2);
|
H A D | set_symmetric_difference.h | 42 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { 44 if (__first2 == __last2) { 47 std::move(__ret1.first), std::move(__first2), std::move((__ret1.second))); 49 if (__comp(*__first1, *__first2)) { 54 if (__comp(*__first2, *__first1)) { 55 *__result = *__first2; 60 ++__first2; 63 auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)); 72 _InputIterator2 __first2, 79 std::move(__first2), 41 __set_symmetric_difference( _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) argument 69 set_symmetric_difference( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 87 set_symmetric_difference( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument [all...] |
H A D | find_end.h | 43 _Iter2 __first2, 53 if (__first2 == __last2) 59 if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) 63 // *__first1 matches *__first2, now match elements after here 65 _Iter2 __m2 = __first2; 97 _Iter2 __first2, 105 auto __last2 = _IterOps::next(__first2, __sent2); 107 if (__first2 == __last2) 115 if (__first1 == __l1) // return __last1 if no element matches *__first2 124 if (__m2 == __first2) // I 40 __find_end_impl( _Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2, forward_iterator_tag, forward_iterator_tag) argument 94 __find_end( _Iter1 __first1, _Sent1 __sent1, _Iter2 __first2, _Sent2 __sent2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2, bidirectional_iterator_tag, bidirectional_iterator_tag) argument 147 __find_end( _Iter1 __first1, _Sent1 __sent1, _Iter2 __first2, _Sent2 __sent2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2, random_access_iterator_tag, random_access_iterator_tag) argument 193 __find_end_classic(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate& __pred) argument 212 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) argument 220 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) argument [all...] |
H A D | search.h | 38 _Iter2 __first2, _Sent2 __last2, 42 if (__first2 == __last2) 45 // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 47 if (__first1 == __last1) { // return __last1 if no element matches *__first2 51 if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) 55 // *__first1 matches *__first2, now match elements after here 57 _Iter2 __m2 = __first2; 85 _Iter2 __first2, _Sent2 __last2, 99 if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) 105 _Iter2 __m2 = __first2; 37 __search_forward_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) argument 84 __search_random_access_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2, _DiffT1 __size1, _DiffT2 __size2) argument 124 __search_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2, __enable_if_t<__is_cpp17_random_access_iterator<_Iter1>::value && __is_cpp17_random_access_iterator<_Iter2>::value>* = nullptr) argument 156 __search_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2, __enable_if_t<__is_cpp17_forward_iterator<_Iter1>::value && __is_cpp17_forward_iterator<_Iter2>::value && !(__is_cpp17_random_access_iterator<_Iter1>::value && __is_cpp17_random_access_iterator<_Iter2>::value)>* = nullptr) argument 174 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) argument 185 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) argument [all...] |
H A D | ranges_lexicographical_compare.h | 37 _Iter2 __first2, _Sent2 __last2, 41 while (__first2 != __last2) { 43 || std::invoke(__comp, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) 45 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) 48 ++__first2; 60 _Iter2 __first2, _Sent2 __last2, 65 std::move(__first2), std::move(__last2), 36 __lexicographical_compare_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Comp& __comp, _Proj1& __proj1, _Proj2& __proj2) argument 59 operator ()(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const argument
|
H A D | set_intersection.h | 41 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { 42 while (__first1 != __last1 && __first2 != __last2) { 43 if (__comp(*__first1, *__first2)) 46 if (!__comp(*__first2, *__first1)) { 51 ++__first2; 57 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), 65 _InputIterator2 __first2, 72 std::move(__first2), 83 _InputIterator2 __first2, 89 std::move(__first2), 40 __set_intersection( _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) argument 62 set_intersection( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 80 set_intersection( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument [all...] |
H A D | ranges_equal.h | 42 _Iter2 __first2, _Sent2 __last2, 46 while (__first1 != __last1 && __first2 != __last2) { 47 if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) 50 ++__first2; 52 return __first1 == __last1 && __first2 == __last2; 65 _Iter2 __first2, _Sent2 __last2, 70 if (__last1 - __first1 != __last2 - __first2) 74 std::move(__first2), std::move(__last2), 41 __equal_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) argument 64 operator ()(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const argument
|
H A D | ranges_merge.h | 54 _InIter2&& __first2, 60 for (; __first1 != __last1 && __first2 != __last2; ++__result) { 61 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) { 62 *__result = *__first2; 63 ++__first2; 70 auto __ret2 = ranges::copy(std::move(__first2), std::move(__last2), std::move(__ret1.out)); 88 _InIter2 __first2, 94 return __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __proj2); 51 __merge_impl( _InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result, _Comp&& __comp, _Proj1&& __proj1, _Proj2&& __proj2) argument 85 operator ()( _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const argument
|
H A D | ranges_mismatch.h | 43 __go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, argument 45 while (__first1 != __last1 && __first2 != __last2) { 46 if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) 49 ++__first2; 51 return {std::move(__first1), std::move(__first2)}; 59 mismatch_result<_I1, _I2> operator()(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, argument 61 return __go(std::move(__first1), __last1, std::move(__first2), __last2, __pred, __proj1, __proj2);
|
/openbsd-current/gnu/llvm/libcxx/include/__numeric/ |
H A D | inner_product.h | 25 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) argument 27 for (; __first1 != __last1; ++__first1, (void) ++__first2) 29 __init = _VSTD::move(__init) + *__first1 * *__first2; 31 __init = __init + *__first1 * *__first2; 39 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, argument 42 for (; __first1 != __last1; ++__first1, (void) ++__first2) 44 __init = __binary_op1(_VSTD::move(__init), __binary_op2(*__first1, *__first2)); 46 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
|
H A D | transform_reduce.h | 36 _InputIterator2 __first2, _Tp __init, 38 for (; __first1 != __last1; ++__first1, (void)++__first2) 39 __init = __b1(__init, __b2(*__first1, *__first2)); 46 _InputIterator2 __first2, _Tp __init) { 47 return _VSTD::transform_reduce(__first1, __last1, __first2, _VSTD::move(__init), _VSTD::plus<>(), 34 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init, _BinaryOp1 __b1, _BinaryOp2 __b2) argument 44 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) argument
|
/openbsd-current/gnu/lib/libstdc++/libstdc++/include/bits/ |
H A D | stl_algobase.h | 609 _InputIter2 __first2) 619 while (__first1 != __last1 && *__first1 == *__first2) { 621 ++__first2; 623 return pair<_InputIter1, _InputIter2>(__first1, __first2); 643 _InputIter2 __first2, 650 while (__first1 != __last1 && __binary_pred(*__first1, *__first2)) { 652 ++__first2; 654 return pair<_InputIter1, _InputIter2>(__first1, __first2); 671 _InputIter2 __first2) 680 for ( ; __first1 != __last1; ++__first1, ++__first2) 608 mismatch(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2) argument 642 mismatch(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _BinaryPredicate __binary_pred) argument 670 equal(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2) argument 701 equal(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _BinaryPredicate __binary_pred) argument 734 lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2) argument 769 lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp) argument 788 lexicographical_compare(const unsigned char* __first1, const unsigned char* __last1, const unsigned char* __first2, const unsigned char* __last2) argument 798 lexicographical_compare(const char* __first1, const char* __last1, const char* __first2, const char* __last2) argument [all...] |
H A D | stl_numeric.h | 95 _InputIterator2 __first2, _Tp __init) 101 for ( ; __first1 != __last1; ++__first1, ++__first2) 102 __init = __init + (*__first1 * *__first2); 110 _InputIterator2 __first2, _Tp __init, 118 for ( ; __first1 != __last1; ++__first1, ++__first2) 119 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2)); 94 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) argument 109 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2) argument
|
/openbsd-current/gnu/gcc/libstdc++-v3/include/bits/ |
H A D | stl_algo.h | 488 _ForwardIterator2 __first2, _ForwardIterator2 __last2) 497 __glibcxx_requires_valid_range(__first2, __last2); 499 if (__first1 == __last1 || __first2 == __last2) 503 _ForwardIterator2 __tmp(__first2); 506 return std::find(__first1, __last1, *__first2); 510 __p1 = __first2; ++__p1; 515 __first1 = std::find(__first1, __last1, *__first2); 560 _ForwardIterator2 __first2, _ForwardIterator2 __last2, 570 __glibcxx_requires_valid_range(__first2, __last2); 573 if (__first1 == __last1 || __first2 487 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) argument 559 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate) argument 886 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) argument 960 transform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _OutputIterator __result, _BinaryOperation __binary_op) argument 3230 merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument 3291 merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 3467 __merge_backward(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result) argument 3506 __merge_backward(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result, _Compare __comp) argument 4299 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) argument 4348 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) argument 4397 set_union(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument 4463 set_union(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 4529 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument 4585 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 4642 set_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument 4702 set_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 4759 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) argument 4824 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) argument 5221 find_first_of(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2) argument 5258 find_first_of(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, _BinaryPredicate __comp) argument 5287 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag) argument 5315 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag, _BinaryPredicate __comp) argument 5344 __find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag) argument 5377 __find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag, _BinaryPredicate __comp) argument 5437 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) argument 5483 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __comp) argument [all...] |