Home
last modified time | relevance | path

Searched defs:__pred (Results 1 – 25 of 48) sorted by relevance

12

/llvm-project/libcxx/include/__algorithm/
H A Dpartition.h29 __partition_impl(_ForwardIterator __first,_Sentinel __last,_Predicate __pred,forward_iterator_tag) __partition_impl() argument
50 __partition_impl(_BidirectionalIterator __first,_Sentinel __sentinel,_Predicate __pred,bidirectional_iterator_tag) __partition_impl() argument
73 __partition(_ForwardIterator __first,_Sentinel __last,_Predicate && __pred,_IterCategory __iter_category) __partition() argument
80 partition(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred) partition() argument
[all...]
H A Dsearch_n.h35 __search_n_forward_impl(_Iter __first,_Sent __last,_SizeT __count,const _Type & __value,_Pred & __pred,_Proj & __proj) __search_n_forward_impl() argument
72 __search_n_random_access_impl(_Iter __first,_Sent __last,_SizeT __count,const _Type & __value,_Pred & __pred,_Proj & __proj,_DiffT __size1) __search_n_random_access_impl() argument
119 __search_n_impl(_Iter __first,_Sent __last,_DiffT __count,const _Type & __value,_Pred & __pred,_Proj & __proj) __search_n_impl() argument
134 __search_n_impl(_Iter1 __first,_Sent1 __last,_DiffT __count,const _Type & __value,_Pred & __pred,_Proj & __proj) __search_n_impl() argument
140 search_n(_ForwardIterator __first,_ForwardIterator __last,_Size __count,const _Tp & __value,_BinaryPredicate __pred) search_n() argument
[all...]
H A Dunique_copy.h44 _BinaryPredicate&& __pred, in __unique_copy()
66 _BinaryPredicate&& __pred, in __unique_copy()
88 _BinaryPredicate&& __pred, in __unique_copy()
102 …_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) { in unique_copy()
H A Dmake_projected.h32 _Pred& __pred; // Can be a unary or a binary predicate. global() member
60 __make_projected(_Pred & __pred,_Proj & __proj) __make_projected() argument
71 __make_projected(_Pred & __pred,_Proj &) __make_projected() argument
H A Dmismatch.h41 __mismatch_loop(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch_loop() argument
53 __mismatch(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch() argument
115 __equal_to __pred; __mismatch_vectorized() local
141 __mismatch(_Tp * __first1,_Tp * __last1,_Tp * __first2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch() argument
154 mismatch(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_BinaryPredicate __pred) mismatch() argument
170 __mismatch(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Sent2 __last2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch() argument
182 __mismatch(_Tp * __first1,_Tp * __last1,_Tp * __first2,_Tp * __last2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch() argument
193 mismatch(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_BinaryPredicate __pred) mismatch() argument
[all...]
H A Dstable_partition.h38 __stable_partition_impl(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred,_Distance __len,_Pair __p,forward_iterator_tag __fit) __stable_partition_impl() argument
119 __stable_partition_impl(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred,forward_iterator_tag) __stable_partition_impl() argument
152 __stable_partition_impl(_BidirectionalIterator __first,_BidirectionalIterator __last,_Predicate __pred,_Distance __len,_Pair __p,bidirectional_iterator_tag __bit) __stable_partition_impl() argument
252 __stable_partition_impl(_BidirectionalIterator __first,_BidirectionalIterator __last,_Predicate __pred,bidirectional_iterator_tag) __stable_partition_impl() argument
290 __stable_partition(_ForwardIterator __first,_ForwardIterator __last,_Predicate && __pred,_IterCategory __iter_category) __stable_partition() argument
297 stable_partition(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred) stable_partition() argument
[all...]
H A Dsearch.h40 _Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_forward_impl() argument
88 _Pred& __pred, in __search_random_access_impl() argument
131 _Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_impl() argument
158 _Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_impl() argument
168 search(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate __pred) search() argument
[all...]
H A Dunique.h33 __unique(_Iter __first,_Sent __last,_BinaryPredicate && __pred) __unique() argument
50 unique(_ForwardIterator __first,_ForwardIterator __last,_BinaryPredicate __pred) unique() argument
H A Dadjacent_find.h30 __adjacent_find(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __adjacent_find() argument
44 adjacent_find(_ForwardIterator __first,_ForwardIterator __last,_BinaryPredicate __pred) adjacent_find() argument
H A Dfind_end.h44 __find_end_impl(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Sent2 __last2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2,forward_iterator_tag,forward_iterator_tag) __find_end_impl() argument
96 __find_end(_Iter1 __first1,_Sent1 __sent1,_Iter2 __first2,_Sent2 __sent2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2,bidirectional_iterator_tag,bidirectional_iterator_tag) __find_end() 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) __find_end() argument
192 __find_end_classic(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate & __pred) __find_end_classic() argument
213 find_end(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate __pred) find_end() argument
H A Dfind_first_of.h43 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); in find_first_of() argument
29 __find_first_of_ce(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate && __pred) __find_first_of_ce() argument
H A Dpstl.h43 any_of(_ExecutionPolicy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { in any_of() argument
56 all_of(_ExecutionPolicy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred) { in all_of() argument
69 none_of(_ExecutionPolicy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred) { in none_of() argument
119 count_if(_ExecutionPolicy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { in count_if() argument
152 _Pred __pred) { in equal() argument
194 equal(_ExecutionPolicy && __policy,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_Pred __pred) equal() argument
263 find_if(_ExecutionPolicy && __policy,_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred) find_if() argument
276 find_if_not(_ExecutionPolicy && __policy,_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred) find_if_not() argument
356 is_partitioned(_ExecutionPolicy && __policy,_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred) is_partitioned() argument
447 replace_if(_ExecutionPolicy && __policy,_ForwardIterator __first,_ForwardIterator __last,_Pred __pred,const _Tp & __new_value) replace_if() argument
484 replace_copy_if(_ExecutionPolicy && __policy,_ForwardIterator __first,_ForwardIterator __last,_ForwardOutIterator __result,_Pred __pred,const _Tp & __new_value) replace_copy_if() argument
[all...]
H A Dequal.h39 __equal_iter_impl(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_BinaryPredicate & __pred) __equal_iter_impl() argument
59 equal(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_BinaryPredicate __pred) equal() argument
104 equal(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_BinaryPredicate __pred) equal() argument
H A Dfind_if.h23 find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) { in find_if() argument
H A Dis_partitioned.h22 is_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) { in is_partitioned() argument
H A Dnone_of.h23 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) { in none_of() argument
H A Dfind_if_not.h23 find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) { in find_if_not() argument
H A Dall_of.h23 all_of(_InputIterator __first,_InputIterator __last,_Predicate __pred) all_of() argument
H A Dany_of.h23 any_of(_InputIterator __first,_InputIterator __last,_Predicate __pred) any_of() argument
H A Dcount_if.h25 count_if(_InputIterator __first,_InputIterator __last,_Predicate __pred) count_if() argument
/llvm-project/libcxx/include/__functional/
H A Dunary_negate.h30 …_LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI explicit unary_negate(const _Predicate& __pred) in unary_negate()
40 not1(const _Predicate& __pred) { in not1()
H A Dbinary_negate.h32 …LIBCPP_HIDE_FROM_ABI explicit _LIBCPP_CONSTEXPR_SINCE_CXX14 binary_negate(const _Predicate& __pred) in binary_negate()
43 not2(const _Predicate& __pred) { in not2()
/llvm-project/pstl/include/pstl/internal/
H A Dalgorithm_impl.h40 __brick_any_of(const _ForwardIterator __first, const _ForwardIterator __last, _Pred __pred, in __brick_any_of()
48 …brick_any_of(const _RandomAccessIterator __first, const _RandomAccessIterator __last, _Pred __pred, in __brick_any_of()
56 …_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred) noexcept in __pattern_any_of()
64 _RandomAccessIterator __last, _Pred __pred) in __pattern_any_of()
520 __brick_find_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, in __brick_find_if()
528 __brick_find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, _Predicate __pred, in __brick_find_if()
540 _Predicate __pred) noexcept in __pattern_find_if()
548 _RandomAccessIterator __last, _Predicate __pred) in __pattern_find_if()
574 … _RandomAccessIterator2 __s_first, _RandomAccessIterator2 __s_last, _BinaryPredicate __pred, in __find_subrange()
630 … _Size __count, const _Tp& __value, _BinaryPredicate __pred, _IsVector __is_vector) noexcept in __find_subrange()
[all …]
H A Dunseq_backend_simd.h66 __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept in __simd_or()
166 __simd_first(_Index1 __first1, _DifferenceType __n, _Index2 __first2, _Pred __pred) noexcept in __simd_first()
220 __simd_count(_Index __index, _DifferenceType __n, _Pred __pred) noexcept in __simd_count()
234 _BinaryPredicate __pred) noexcept in __simd_unique_copy()
268 …utIterator __first, _DifferenceType __n, _OutputIterator __result, _UnaryPredicate __pred) noexcept in __simd_copy_if()
287 …mask_2(_InputIterator __first, _DifferenceType __n, bool* __mask, _BinaryPredicate __pred) noexcept in __simd_calc_mask_2()
302 …_mask_1(_InputIterator __first, _DifferenceType __n, bool* __mask, _UnaryPredicate __pred) noexcept in __simd_calc_mask_1()
382 __simd_adjacent_find(_Index __first, _Index __last, _BinaryPredicate __pred, bool __or_semantic) no… in __simd_adjacent_find()
760 _OutputIterator2 __out_false, _UnaryPredicate __pred) noexcept in __simd_partition_copy()
785 _ForwardIterator2 __s_last, _BinaryPredicate __pred) noexcept in __simd_find_first_of()
[all …]
/llvm-project/libcxx/include/__ranges/
H A Dtake_while_view.h61 _LIBCPP_HIDE_FROM_ABI constexpr _LIBCPP_EXPLICIT_SINCE_CXX23 take_while_view(_View __base, _Pred __pred) in take_while_view() argument
116 _LIBCPP_HIDE_FROM_ABI constexpr explicit __sentinel(sentinel_t<_Base> __end, const _Pred* __pred) in __sentinel() argument
[all...]

12