/openbsd-current/gnu/llvm/libcxx/include/__algorithm/ |
H A D | find_first_of.h | 28 _ForwardIterator2 __last2, 31 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 40 _ForwardIterator2 __last2, _BinaryPredicate __pred) { 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 39 find_first_of(_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 | lexicographical_compare.h | 26 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 28 for (; __first2 != __last2; ++__first1, (void) ++__first2) 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 | merge.h | 28 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 32 if (__first2 == __last2) 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, __last2, __result, __less<__v1, __v2>()); 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
|
H A D | equal.h | 42 __equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, argument 44 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) 47 return __first1 == __last1 && __first2 == __last2; 53 _RandomAccessIterator2 __last2, _BinaryPredicate __pred, random_access_iterator_tag, 55 if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 63 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, argument 66 __first1, __last1, __first2, __last2, __pred, typename iterator_traits<_InputIterator1>::iterator_category(), 72 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { argument 77 __last2, 52 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, random_access_iterator_tag, random_access_iterator_tag) argument
|
H A D | find_end.h | 44 _Sent2 __last2, 53 if (__first2 == __last2) 67 if (++__m2 == __last2) { // Pattern exhaused, record answer and search for another one 105 auto __last2 = _IterOps::next(__first2, __sent2); local 107 if (__first2 == __last2) 110 _Iter2 __l2 = __last2; 113 // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 159 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __sent2); local 161 auto __len2 = __last2 - __first2; 169 _Iter2 __l2 = __last2; 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 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 | is_permutation.h | 59 __is_permutation_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, argument 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, argument 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), 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 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 | search.h | 38 _Iter2 __first2, _Sent2 __last2, 42 if (__first2 == __last2) 59 if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 85 _Iter2 __first2, _Sent2 __last2, 107 if (++__m2 == __last2) 125 _Iter2 __first2, _Sent2 __last2, 132 auto __size2 = __last2 - __first2; 142 __first2, __last2, 157 _Iter2 __first2, _Sent2 __last2, 166 __first2, __last2, 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 | set_difference.h | 33 _InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result, _Comp&& __comp) { 34 while (__first1 != __last1 && __first2 != __last2) { 54 _InputIterator2 __last2, 58 __first1, __last1, __first2, __last2, __result, __comp) 67 _InputIterator2 __last2, 73 __last2, 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
|
H A D | includes.h | 29 __includes(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, argument 31 for (; __first2 != __last2; ++__first1) { 46 _InputIterator2 __last2, 55 std::move(__last2), 63 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { argument 68 std::move(__last2), 42 includes( _InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) argument
|
H A D | mismatch.h | 45 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, argument 47 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) 56 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { argument 57 return std::mismatch(__first1, __last1, __first2, __last2, __equal_to());
|
H A D | set_symmetric_difference.h | 42 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { 44 if (__first2 == __last2) { 63 auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)); 73 _InputIterator2 __last2, 80 std::move(__last2), 91 _InputIterator2 __last2, 97 std::move(__last2), 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
|
H A D | set_union.h | 41 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { 43 if (__first2 == __last2) { 59 auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)); 69 _InputIterator2 __last2, 76 std::move(__last2), 87 _InputIterator2 __last2, 93 std::move(__last2), 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
|
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) { 57 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), 66 _InputIterator2 __last2, 73 std::move(__last2), 84 _InputIterator2 __last2, 90 std::move(__last2), 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
|
H A D | ranges_equal.h | 42 _Iter2 __first2, _Sent2 __last2, 46 while (__first1 != __last1 && __first2 != __last2) { 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_search.h | 43 _Sent2 __last2, 48 auto __size2 = ranges::distance(__first2, __last2); 61 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); 68 std::__search_forward_impl<_RangeAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2); 80 _Iter2 __first2, _Sent2 __last2, 84 return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2); 39 __ranges_search_impl( _Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) argument 79 operator ()(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const argument
|
H A D | ranges_find_first_of.h | 38 _Iter2 __first2, _Sent2 __last2, 43 for (auto __j = __first2; __j != __last2; ++__j) { 59 _Iter2 __first2, _Sent2 __last2, 64 std::move(__first2), std::move(__last2), 37 __find_first_of_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) argument 58 operator ()(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const argument
|
H A D | ranges_is_permutation.h | 39 bool __is_permutation_func_impl(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, argument 42 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), 53 bool operator()(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, argument 56 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2),
|
H A D | ranges_lexicographical_compare.h | 37 _Iter2 __first2, _Sent2 __last2, 41 while (__first2 != __last2) { 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 | ranges_merge.h | 55 _Sent2&& __last2, 60 for (; __first1 != __last1 && __first2 != __last2; ++__result) { 70 auto __ret2 = ranges::copy(std::move(__first2), std::move(__last2), std::move(__ret1.out)); 89 _Sent2 __last2, 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) { 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);
|
H A D | swap_ranges.h | 27 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _Sentinel2 __last2) { argument 28 while (__first1 != __last1 && __first2 != __last2) {
|
H A D | ranges_swap_ranges.h | 42 operator()(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2) const { 44 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2));
|
H A D | stable_sort.h | 36 _InputIterator2 __first2, _InputIterator2 __last2, 48 for (; __first2 != __last2; ++__first2, (void) ++__result, __d.template __incr<value_type>()) 53 if (__first2 == __last2) 78 _InputIterator2 __first2, _InputIterator2 __last2, 85 if (__first2 == __last2) 102 for (; __first2 != __last2; ++__first2, (void) ++__result) 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
|
/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) 505 if (__tmp == __last2) 526 if (++__p == __last2) 560 _ForwardIterator2 __first2, _ForwardIterator2 __last2, 570 __glibcxx_requires_valid_range(__first2, __last2); 573 if (__first1 == __last1 || __first2 == __last2) 579 if (__tmp == __last2) 611 if (++__p == __last2) 487 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) argument 559 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate) 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...] |
/openbsd-current/gnu/lib/libstdc++/libstdc++/include/bits/ |
H A D | stl_algo.h | 453 _ForwardIter2 __first2, _ForwardIter2 __last2) 463 if (__first1 == __last1 || __first2 == __last2) 469 if (__tmp == __last2) 491 if (++__p == __last2) 525 _ForwardIter2 __first2, _ForwardIter2 __last2, 536 if (__first1 == __last1 || __first2 == __last2) 542 if (__tmp == __last2) { 572 if (++__p == __last2) 3120 _InputIter2 __first2, _InputIter2 __last2, 3134 while (__first1 != __last1 && __first2 != __last2) { 452 search(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2) argument 524 search(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, _BinaryPred __predicate) argument 3119 merge(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 3171 merge(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 3331 __merge_backward(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result) argument 3365 __merge_backward(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, _BidirectionalIter3 __result, _Compare __comp) argument 3601 includes(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2) argument 3626 includes(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _Compare __comp) argument 3652 set_union(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 3689 set_union(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 3726 set_intersection(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 3758 set_intersection(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 3790 set_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 3823 set_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 3856 set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result) argument 3892 set_symmetric_difference(_InputIter1 __first1, _InputIter1 __last1, _InputIter2 __first2, _InputIter2 __last2, _OutputIter __result, _Compare __comp) argument 4156 find_first_of(_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2) argument 4175 find_first_of(_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2, _BinaryPredicate __comp) argument 4205 __find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, forward_iterator_tag, forward_iterator_tag) argument 4230 __find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, forward_iterator_tag, forward_iterator_tag, _BinaryPredicate __comp) argument 4256 __find_end(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag) argument 4284 __find_end(_BidirectionalIter1 __first1, _BidirectionalIter1 __last1, _BidirectionalIter2 __first2, _BidirectionalIter2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag, _BinaryPredicate __comp) argument 4315 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2) argument 4333 find_end(_ForwardIter1 __first1, _ForwardIter1 __last1, _ForwardIter2 __first2, _ForwardIter2 __last2, _BinaryPredicate __comp) argument [all...] |