/freebsd-current/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | is_partitioned.h | 22 is_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) { argument 24 if (!__pred(*__first)) 30 if (__pred(*__first))
|
H A D | all_of.h | 23 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) { argument 25 if (!__pred(*__first))
|
H A D | any_of.h | 23 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) { argument 25 if (__pred(*__first))
|
H A D | find_if_not.h | 23 find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) { argument 25 if (!__pred(*__first))
|
H A D | find_if.h | 23 find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) { argument 25 if (__pred(*__first))
|
H A D | none_of.h | 23 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) { argument 25 if (__pred(*__first))
|
H A D | remove_if.h | 27 remove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { argument 28 __first = std::find_if<_ForwardIterator, _Predicate&>(__first, __last, __pred); 32 if (!__pred(*__i)) {
|
H A D | remove_copy_if.h | 22 remove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) { argument 24 if (!__pred(*__first)) {
|
H A D | replace_if.h | 22 replace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) { argument 24 if (__pred(*__first))
|
H A D | copy_if.h | 22 copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) { argument 24 if (__pred(*__first)) {
|
H A D | partition.h | 29 __partition_impl(_ForwardIterator __first, _Sentinel __last, _Predicate __pred, forward_iterator_tag) { argument 33 if (!__pred(*__first)) 40 if (__pred(*__p)) { 50 __partition_impl(_BidirectionalIterator __first, _Sentinel __sentinel, _Predicate __pred, bidirectional_iterator_tag) { argument 58 if (!__pred(*__first)) 65 } while (!__pred(*__last)); 73 __partition(_ForwardIterator __first, _Sentinel __last, _Predicate&& __pred, _IterCategory __iter_category) { argument 75 std::move(__first), std::move(__last), __pred, __iter_category); 80 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { argument 82 auto __result = std::__partition<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __pred, _IterCategor [all...] |
H A D | ranges_is_partitioned.h | 38 __is_partitioned_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { argument 40 if (!std::invoke(__pred, std::invoke(__proj, *__first))) 49 if (std::invoke(__pred, std::invoke(__proj, *__first))) 61 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { argument 62 return __is_partitioned_impl(std::move(__first), std::move(__last), __pred, __proj); 69 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { argument 70 return __is_partitioned_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
H A D | find_segment_if.h | 22 // [__first, __last) has to be a segmented range. __pred is expected to take a range of local iterators and the __proj. 24 // no match. __proj may be anything that should be passed to __pred, but is expected to be a projection to support 29 __find_segment_if(_SegmentedIterator __first, _SegmentedIterator __last, _Pred __pred, _Proj& __proj) { argument 37 return _Traits::__compose(__sfirst, __pred(_Traits::__local(__first), _Traits::__local(__last), __proj)); 41 auto __liter = __pred(_Traits::__local(__first), __llast, __proj); 50 auto __liter = __pred(_Traits::__begin(__sfirst), _Traits::__end(__sfirst), __proj); 57 return _Traits::__compose(__sfirst, __pred(_Traits::__begin(__sfirst), _Traits::__local(__last), __proj));
|
H A D | ranges_none_of.h | 37 __none_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { argument 39 if (std::invoke(__pred, std::invoke(__proj, *__first))) 50 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { 51 return __none_of_impl(std::move(__first), std::move(__last), __pred, __proj); 58 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { argument 59 return __none_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
H A D | stable_partition.h | 38 _Predicate __pred, 50 if (__pred(*++__m)) { 68 if (__pred(*__i)) { 94 std::__stable_partition_impl<_AlgPolicy, _Predicate&>(__first, __m, __pred, __len2, __p, __fit); 101 while (__pred(*__m1)) { 108 __second_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>(__m1, __last, __pred, __len_half, __p, __fit); 119 __stable_partition_impl(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) { argument 128 if (!__pred(*__first)) 145 std::move(__first), std::move(__last), __pred, __len, __p, forward_iterator_tag()); 152 _Predicate __pred, 35 __stable_partition_impl( _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len, _Pair __p, forward_iterator_tag __fit) argument 149 __stable_partition_impl( _BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) argument 251 __stable_partition_impl( _BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, bidirectional_iterator_tag) argument 289 __stable_partition( _ForwardIterator __first, _ForwardIterator __last, _Predicate&& __pred, _IterCategory __iter_category) argument 297 stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) argument [all...] |
H A D | ranges_count_if.h | 38 __count_if_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { argument 41 if (std::invoke(__pred, std::invoke(__proj, *__first))) 54 operator()(_Iter __first, _Sent __last, _Predicate __pred, _Proj __proj = {}) const { argument 55 return ranges::__count_if_impl(std::move(__first), std::move(__last), __pred, __proj); 62 operator()(_Range&& __r, _Predicate __pred, _Proj __proj = {}) const { argument 63 return ranges::__count_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
|
H A D | ranges_find_if.h | 37 _LIBCPP_HIDE_FROM_ABI constexpr _Ip __find_if_impl(_Ip __first, _Sp __last, _Pred& __pred, _Proj& __proj) { argument 39 if (std::invoke(__pred, std::invoke(__proj, *__first))) 52 operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const { argument 53 return ranges::__find_if_impl(std::move(__first), std::move(__last), __pred, __proj); 58 operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const { argument 59 return ranges::__find_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
|
H A D | ranges_all_of.h | 36 _LIBCPP_HIDE_FROM_ABI constexpr static bool __all_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { argument 38 if (!std::invoke(__pred, std::invoke(__proj, *__first))) 49 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { argument 50 return __all_of_impl(std::move(__first), std::move(__last), __pred, __proj); 57 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { argument 58 return __all_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
H A D | ranges_any_of.h | 36 _LIBCPP_HIDE_FROM_ABI constexpr static bool __any_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { argument 38 if (std::invoke(__pred, std::invoke(__proj, *__first))) 49 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { 50 return __any_of_impl(std::move(__first), std::move(__last), __pred, __proj); 57 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { argument 58 return __any_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
H A D | replace_copy_if.h | 25 _Predicate __pred, 28 if (__pred(*__first)) 21 replace_copy_if( _InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred, const _Tp& __new_value) argument
|
H A D | count_if.h | 25 count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) { argument 28 if (__pred(*__first))
|
H A D | partition_copy.h | 28 _Predicate __pred) { 30 if (__pred(*__first)) { 23 partition_copy( _InputIterator __first, _InputIterator __last, _OutputIterator1 __out_true, _OutputIterator2 __out_false, _Predicate __pred) argument
|
/freebsd-current/contrib/llvm-project/libcxx/include/__functional/ |
H A D | unary_negate.h | 30 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI explicit unary_negate(const _Predicate& __pred) argument 31 : __pred_(__pred) {} 40 not1(const _Predicate& __pred) { argument 41 return unary_negate<_Predicate>(__pred);
|
H A D | binary_negate.h | 32 _LIBCPP_HIDE_FROM_ABI explicit _LIBCPP_CONSTEXPR_SINCE_CXX14 binary_negate(const _Predicate& __pred) argument 33 : __pred_(__pred) {} 43 not2(const _Predicate& __pred) { argument 44 return binary_negate<_Predicate>(__pred);
|
/freebsd-current/contrib/llvm-project/libcxx/include/__iterator/ |
H A D | erase_if_container.h | 25 _LIBCPP_HIDE_FROM_ABI typename _Container::size_type __libcpp_erase_if_container(_Container& __c, _Predicate& __pred) { argument 30 if (__pred(*__iter))
|