Home
last modified time | relevance | path

Searched refs:_Pred (Results 1 – 25 of 52) sorted by relevance

123

/freebsd-14.2/contrib/llvm-project/libcxx/include/__ranges/
H A Dtake_while_view.h47 template <view _View, class _Pred>
48 …requires input_range<_View> && is_object_v<_Pred> && indirect_unary_predicate<const _Pred, iterato…
99 template <class _Range, class _Pred>
100 take_while_view(_Range&&, _Pred) -> take_while_view<views::all_t<_Range>, _Pred>;
102 template <view _View, class _Pred>
103 …requires input_range<_View> && is_object_v<_Pred> && indirect_unary_predicate<const _Pred, iterato…
109 const _Pred* __pred_ = nullptr;
141 template <class _Range, class _Pred>
148 template <class _Pred>
149 requires constructible_from<decay_t<_Pred>, _Pred>
[all …]
H A Ddrop_while_view.h49 template <view _View, class _Pred>
50 …requires input_range<_View> && is_object_v<_Pred> && indirect_unary_predicate<const _Pred, iterato…
54 requires default_initializable<_View> && default_initializable<_Pred>
90 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_;
97 template <class _View, class _Pred>
100 template <class _Range, class _Pred>
101 drop_while_view(_Range&&, _Pred) -> drop_while_view<views::all_t<_Range>, _Pred>;
107 template <class _Range, class _Pred>
114 template <class _Pred>
115 requires constructible_from<decay_t<_Pred>, _Pred>
[all …]
H A Dfilter_view.h56 requires view<_View> && is_object_v<_Pred>
59 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_;
110 template <class _Range, class _Pred>
111 filter_view(_Range&&, _Pred) -> filter_view<views::all_t<_Range>, _Pred>;
128 requires view<_View> && is_object_v<_Pred>
212 requires view<_View> && is_object_v<_Pred>
213 class filter_view<_View, _Pred>::__sentinel {
231 template <class _Range, class _Pred>
238 template <class _Pred>
239 requires constructible_from<decay_t<_Pred>, _Pred>
[all …]
H A Dchunk_by_view.h56 requires view<_View> && is_object_v<_Pred>
59 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_;
97 requires default_initializable<_View> && default_initializable<_Pred>
134 template <class _Range, class _Pred>
135 chunk_by_view(_Range&&, _Pred) -> chunk_by_view<views::all_t<_Range>, _Pred>;
138 requires view<_View> && is_object_v<_Pred>
139 class chunk_by_view<_View, _Pred>::__iterator {
207 template <class _Range, class _Pred>
214 template <class _Pred>
215 requires constructible_from<decay_t<_Pred>, _Pred>
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/
H A Dmake_projected.h30 template <class _Pred, class _Proj>
32 _Pred& __pred; // Can be a unary or a binary predicate.
35 _LIBCPP_CONSTEXPR _LIBCPP_HIDE_FROM_ABI _ProjectedPred(_Pred& __pred_arg, _Proj& __proj_arg) in _ProjectedPred()
39 …typename __invoke_of<_Pred&, decltype(std::__invoke(std::declval<_Proj&>(), std::declval<_Tp>())) …
46 typename __invoke_of<_Pred&,
57 class _Pred,
60 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _ProjectedPred<_Pred, _Proj> __make_projected(_Pred& __pred… in __make_projected()
61 return _ProjectedPred<_Pred, _Proj>(__pred, __proj); in __make_projected()
68 class _Pred,
70 …__enable_if_t<!is_member_pointer<__decay_t<_Pred> >::value && __is_identity<__decay_t<_Proj> >::va…
[all …]
H A Dranges_find_first_of.h37 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class…
43 _Pred& __pred, in __find_first_of_impl()
59 class _Pred = ranges::equal_to,
62 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
68 _Pred __pred = {}, in operator()
77 class _Pred = ranges::equal_to,
80 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
82 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_ends_with.h41 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class…
47 _Pred& __pred, in __ends_with_fn_impl_bidirectional()
58 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class…
64 _Pred& __pred, in __ends_with_fn_impl()
95 class _Pred,
104 _Pred& __pred, in __ends_with_fn_impl_with_offset()
130 class _Pred = ranges::equal_to,
135 indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
141 _Pred __pred = {}, in operator()
150 class _Pred = ranges::equal_to,
[all …]
H A Dranges_mismatch.h42 template <class _I1, class _S1, class _I2, class _S2, class _Pred, class _Proj1, class _Proj2>
44 …__go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2&… in __go()
58 class _Pred = ranges::equal_to,
61 requires indirectly_comparable<_I1, _I2, _Pred, _Proj1, _Proj2>
63 …_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Pro… in operator()
70 class _Pred = ranges::equal_to,
73 requires indirectly_comparable<iterator_t<_R1>, iterator_t<_R2>, _Pred, _Proj1, _Proj2>
76 …operator()(_R1&& __r1, _R2&& __r2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) co… in operator()
H A Dpstl_any_all_none_of.h75 class _Pred,
79 __all_of(_ExecutionPolicy&& __policy, _ForwardIterator&& __first, _ForwardIterator&& __last, _Pred&… in __all_of()
82 [&](_ForwardIterator __g_first, _ForwardIterator __g_last, _Pred __g_pred) -> optional<bool> { in __all_of()
97 class _Pred,
101 all_of(_ExecutionPolicy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred… in all_of()
114 class _Pred,
118 __none_of(_ExecutionPolicy&& __policy, _ForwardIterator&& __first, _ForwardIterator&& __last, _Pred… in __none_of()
121 [&](_ForwardIterator __g_first, _ForwardIterator __g_last, _Pred __g_pred) -> optional<bool> { in __none_of()
134 class _Pred,
138 none_of(_ExecutionPolicy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred __pre… in none_of()
H A Dpstl_equal.h37 class _Pred,
45 _Pred&& __pred) noexcept { in __equal()
49 …dIterator1 __g_first1, _ForwardIterator1 __g_last1, _ForwardIterator2 __g_first2, _Pred __g_pred) { in __equal()
68 class _Pred,
76 _Pred __pred) { in equal()
95 class _Pred,
104 _Pred&& __pred) noexcept { in __equal()
111 _Pred __g_pred) -> optional<bool> { in __equal()
138 class _Pred,
147 _Pred __pred) { in equal()
H A Dranges_all_of.h35 template <class _Iter, class _Sent, class _Proj, class _Pred>
36 …_LIBCPP_HIDE_FROM_ABI constexpr static bool __all_of_impl(_Iter __first, _Sent __last, _Pred& __pr… in __all_of_impl()
47 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
49 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
55 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
57 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_any_of.h35 template <class _Iter, class _Sent, class _Proj, class _Pred>
36 …_LIBCPP_HIDE_FROM_ABI constexpr static bool __any_of_impl(_Iter __first, _Sent __last, _Pred& __pr… in __any_of_impl()
47 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
49 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
55 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
57 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_none_of.h35 template <class _Iter, class _Sent, class _Proj, class _Pred>
37 __none_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __none_of_impl()
48 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
50 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
56 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
58 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_search_n.h44 template <class _Iter1, class _Sent1, class _SizeT, class _Type, class _Pred, class _Proj>
46 …_Iter1 __first, _Sent1 __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj)… in __ranges_search_n_impl()
71 class _Pred = ranges::equal_to,
73 requires indirectly_comparable<_Iter, const _Type*, _Pred, _Proj>
79 _Pred __pred = {}, in operator()
84 …template <forward_range _Range, class _Type, class _Pred = ranges::equal_to, class _Proj = identit…
85 requires indirectly_comparable<iterator_t<_Range>, const _Type*, _Pred, _Proj>
87 …_Range&& __range, range_difference_t<_Range> __count, const _Type& __value, _Pred __pred = {}, _Pr… in operator()
H A Dranges_find_if.h36 template <class _Ip, class _Sp, class _Pred, class _Proj>
37 _LIBCPP_HIDE_FROM_ABI constexpr _Ip __find_if_impl(_Ip __first, _Sp __last, _Pred& __pred, _Proj& _… in __find_if_impl()
50 indirect_unary_predicate<projected<_Ip, _Proj>> _Pred>
52 operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const { in operator()
56 …nge _Rp, class _Proj = identity, indirect_unary_predicate<projected<iterator_t<_Rp>, _Proj>> _Pred>
58 operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_search.h38 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class…
44 _Pred& __pred, in __ranges_search_impl()
76 class _Pred = ranges::equal_to,
79 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
85 _Pred __pred = {}, in operator()
93 class _Pred = ranges::equal_to,
96 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
98 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_is_partitioned.h36 template <class _Iter, class _Sent, class _Proj, class _Pred>
38 __is_partitioned_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __is_partitioned_impl()
59 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
61 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
67 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
69 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_partition.h46 template <class _Iter, class _Sent, class _Proj, class _Pred>
48 __partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __partition_fn_impl()
59 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
61 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
67 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
70 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_partition_point.h42 template <class _Iter, class _Sent, class _Proj, class _Pred>
44 __partition_point_fn_impl(_Iter&& __first, _Sent&& __last, _Pred& __pred, _Proj& __proj) { in __partition_point_fn_impl()
66 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
67 …_LIBCPP_HIDE_FROM_ABI constexpr _Iter operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj … in operator()
73 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
75 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_stable_partition.h48 template <class _Iter, class _Sent, class _Proj, class _Pred>
50 __stable_partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __stable_partition_fn_impl()
63 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
65 …_LIBCPP_HIDE_FROM_ABI subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj … in operator()
71 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
74 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_adjacent_find.h37 template <class _Iter, class _Sent, class _Proj, class _Pred>
39 __adjacent_find_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __adjacent_find_impl()
55 …indirect_binary_predicate<projected<_Iter, _Proj>, projected<_Iter, _Proj>> _Pred = ranges::equal_…
57 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
64 _Pred = ranges::equal_to>
66 operator()(_Range&& __range, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
/freebsd-14.2/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set218 class _Pred = std::equal_to<_Value>,
226 typedef _Pred key_equal;
321 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
335 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
344 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
371 swap(hash_set<_Value, _Hash, _Pred, _Alloc>& __x, hash_set<_Value, _Hash, _Pred, _Alloc>& __y) {
377 operator==(const hash_set<_Value, _Hash, _Pred, _Alloc>& __x, const hash_set<_Value, _Hash, _Pred, …
391 operator!=(const hash_set<_Value, _Hash, _Pred, _Alloc>& __x, const hash_set<_Value, _Hash, _Pred, …
397 class _Pred = std::equal_to<_Value>,
405 typedef _Pred key_equal;
[all …]
H A Dhash_map249 template <class _Tp, class _Pred, bool = std::is_empty<_Pred>::value && !std::__libcpp_is_final<_Pr…
250 class __hash_map_equal : private _Pred {
253 _LIBCPP_HIDE_FROM_ABI __hash_map_equal(const _Pred& __p) : _Pred(__p) {}
270 template <class _Tp, class _Pred>
271 class __hash_map_equal<_Tp, _Pred, false> {
272 _Pred __pred_;
443 class _Pred = std::equal_to<_Key>,
452 typedef _Pred key_equal;
642 swap(hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y…
678 typedef _Pred key_equal;
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/
H A Dunordered_map636 class _Pred,
693 class _Pred,
695 bool = is_empty<_Pred>::value && !__libcpp_is_final<_Pred>::value>
700 : _Pred(__p) {}
731 swap(static_cast<_Pred&>(*this), static_cast<_Pred&>(__y));
737 _Pred __pred_;
1484 _Pred = _Pred(),
1501 _Pred = _Pred(),
1518 _Pred = _Pred(),
2222 _Pred = _Pred(),
[all …]
H A Dunordered_set588 typedef __type_identity_t<_Pred> key_equal;
926 _Pred = _Pred(),
942 _Pred = _Pred(),
949 class _Pred = equal_to<_Tp>,
958 _Pred = _Pred(),
1148 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x, unordered_set<_Value, _Hash, _Pred, _Alloc>&…
1530 _Pred = _Pred(),
1547 _Pred = _Pred(),
1553 class _Pred = equal_to<_Tp>,
1562 _Pred = _Pred(),
[all …]

123