Home
last modified time | relevance | path

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

123

/freebsd/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, iterator_t<_View>>
49 class _LIBCPP_ABI_LLVM18_NO_UNIQUE_ADDRESS take_while_view : public view_interface<take_while_view<_View, _Pred>> {
54 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_;
58 requires default_initializable<_View> && default_initializable<_Pred>
61 _LIBCPP_HIDE_FROM_ABI constexpr _LIBCPP_EXPLICIT_SINCE_CXX23 take_while_view(_View __base, _Pred __pred)
72 _LIBCPP_HIDE_FROM_ABI constexpr const _Pred& pred() const { return *__pred_; }
81 requires range<const _View> && indirect_unary_predicate<const _Pred, iterator_t<const _View>> in pred()
93 requires range<const _View> && indirect_unary_predicate<const _Pred, iterator_ in begin()
[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, iterator_t<_View>>
51 class _LIBCPP_ABI_LLVM18_NO_UNIQUE_ADDRESS drop_while_view : public view_interface<drop_while_view<_View, _Pred>> {
54 requires default_initializable<_View> && default_initializable<_Pred> in drop_while_view()
57 _LIBCPP_HIDE_FROM_ABI constexpr _LIBCPP_EXPLICIT_SINCE_CXX23 drop_while_view(_View __base, _Pred __pred) in base()
68 _LIBCPP_HIDE_FROM_ABI constexpr const _Pred& pred() const { return *__pred_; } in begin()
90 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_;
97 template <class _View, class _Pred>
98 inline constexpr bool enable_borrowed_range<drop_while_view<_View, _Pred>>
[all...]
H A Dfilter_view.h55 template <input_range _View, indirect_unary_predicate<iterator_t<_View>> _Pred>
56 requires view<_View> && is_object_v<_Pred>
57 class _LIBCPP_ABI_LLVM18_NO_UNIQUE_ADDRESS filter_view : public view_interface<filter_view<_View, _Pred>> {
59 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_;
72 requires default_initializable<_View> && default_initializable<_Pred> in filter_view()
75 _LIBCPP_HIDE_FROM_ABI constexpr _LIBCPP_EXPLICIT_SINCE_CXX23 filter_view(_View __base, _Pred __pred)
86 _LIBCPP_HIDE_FROM_ABI constexpr _Pred const& pred() const { return *__pred_; } in begin()
110 template <class _Range, class _Pred>
111 filter_view(_Range&&, _Pred) -> filter_view<views::all_t<_Range>, _Pred>;
[all...]
H A Dchunk_by_view.h55 …mplate <forward_range _View, indirect_binary_predicate<iterator_t<_View>, iterator_t<_View>> _Pred>
56 requires view<_View> && is_object_v<_Pred>
57 …P_ABI_LLVM18_NO_UNIQUE_ADDRESS chunk_by_view : public view_interface<chunk_by_view<_View, _Pred>> {
59 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_;
97 requires default_initializable<_View> && default_initializable<_Pred>
100 _LIBCPP_HIDE_FROM_ABI constexpr explicit chunk_by_view(_View __base, _Pred __pred) in chunk_by_view()
111 _LIBCPP_HIDE_FROM_ABI constexpr const _Pred& pred() const { return *__pred_; } in pred()
134 template <class _Range, class _Pred>
135 chunk_by_view(_Range&&, _Pred) -> chunk_by_view<views::all_t<_Range>, _Pred>;
137 …mplate <forward_range _View, indirect_binary_predicate<iterator_t<_View>, iterator_t<_View>> _Pred>
[all …]
/freebsd/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,
59 …__enable_if_t<!(!is_member_pointer<__decay_t<_Pred> >::value && __is_identity<__decay_t<_Proj> >::…
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,
[all …]
H A Dranges_find_last.h39 template <class _Iter, class _Sent, class _Pred, class _Proj>
41 __find_last_impl(_Iter __first, _Sent __last, _Pred __pred, _Proj& __proj) { in __find_last_impl()
104 template <class _Pred>
106 _Pred& __pred;
116 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
118 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) { in operator()
119 …return ranges::__find_last_impl(std::move(__first), std::move(__last), __op<_Pred>{__pred}, __proj…
124 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
126 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) { in operator()
127 …return ranges::__find_last_impl(ranges::begin(__range), ranges::end(__range), __op<_Pred>{__pred},…
[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_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_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_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_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_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_mismatch.h44 template <class _I1, class _S1, class _I2, class _S2, class _Pred, class _Proj1, class _Proj2>
46 …__go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2&… in __go()
64 class _Pred = ranges::equal_to,
67 requires indirectly_comparable<_I1, _I2, _Pred, _Proj1, _Proj2>
69 …_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Pro… in operator()
76 class _Pred = ranges::equal_to,
79 requires indirectly_comparable<iterator_t<_R1>, iterator_t<_R2>, _Pred, _Proj1, _Proj2>
82 …operator()(_R1&& __r1, _R2&& __r2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) co… 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> in __partition_fn_impl()
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 {
67 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred> in operator()
70 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
H A Dranges_stable_partition.h48 template <class _Iter, class _Sent, class _Proj, class _Pred> in __stable_partition_fn_impl()
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 __proj = {}) const {
71 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred> in operator()
74 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
H A Dranges_partition_point.h42 template <class _Iter, class _Sent, class _Proj, class _Pred> in __partition_point_fn_impl()
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 __proj = {}) const {
73 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
75 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
H A Dmismatch.h39 template <class _Iter1, class _Sent1, class _Iter2, class _Pred, class _Proj1, class _Proj2>
41 __mismatch_loop(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _… in __mismatch_loop()
51 template <class _Iter1, class _Sent1, class _Iter2, class _Pred, class _Proj1, class _Proj2>
53 __mismatch(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2… in __mismatch()
121 class _Pred,
124 __enable_if_t<is_integral<_Tp>::value && __desugars_to_v<__equal_tag, _Pred, _Tp, _Tp> &&
128 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred&, _Proj1&, _Proj2&) { in __mismatch() argument
133 class _Pred,
136 __enable_if_t<!is_integral<_Tp>::value && __desugars_to_v<__equal_tag, _Pred, _Tp, _Tp> &&
141 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred& __pred, _Proj1& __proj1, _Proj2& __pr… in __mismatch()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set217 class _Pred = std::equal_to<_Value>,
225 typedef _Pred key_equal;
313 template <class _Value, class _Hash, class _Pred, class _Alloc>
314 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(size_type __n, const hasher& __hf, const key_equal…
319 template <class _Value, class _Hash, class _Pred, class _Alloc>
320 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
326 template <class _Value, class _Hash, class _Pred, class _Alloc>
328 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(_InputIterator __first, _InputIterator __last) {
332 template <class _Value, class _Hash, class _Pred, class _Alloc>
334 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
[all …]
H A Dhash_map248 template <class _Tp, class _Pred, bool = std::is_empty<_Pred>::value && !std::__libcpp_is_final<_Pr…
249 class __hash_map_equal : private _Pred {
251 _LIBCPP_HIDE_FROM_ABI __hash_map_equal() : _Pred() {}
252 _LIBCPP_HIDE_FROM_ABI __hash_map_equal(const _Pred& __p) : _Pred(__p) {}
253 _LIBCPP_HIDE_FROM_ABI const _Pred& key_eq() const { return *this; }
255 return static_cast<const _Pred&>(*this)(__x.first, __y.first);
258 return static_cast<const _Pred&>(*this)(__x, __y.first);
261 return static_cast<const _Pred&>(*this)(__x.first, __y);
265 return static_cast<const _Pred&>(*this)(__x, __y);
269 template <class _Tp, class _Pred>
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__type_traits/
H A Dconjunction.h27 template <class... _Pred>
28 __expand_to_true<__enable_if_t<_Pred::value>...> __and_helper(int);
38 template <class... _Pred>
39 using _And _LIBCPP_NODEBUG = decltype(std::__and_helper<_Pred...>(0));
44 template <bool... _Pred>
45 struct __all : _IsSame<__all_dummy<_Pred...>, __all_dummy<((void)_Pred, true)...> > {};
/freebsd/contrib/llvm-project/libcxx/include/
H A Dunordered_set577 template <class _Value, class _Hash, class _Pred, class _Alloc>
580 template <class _Value, class _Hash = hash<_Value>, class _Pred = equal_to<_Value>, class _Alloc = …
587 typedef __type_identity_t<_Pred> key_equal;
717 …static_assert(sizeof(std::__diagnose_unordered_container_requirements<_Value, _Hash, _Pred>(0)), "…
905 class _Pred = equal_to<__iter_value_type<_InputIterator>>,
910 class = enable_if_t<!__is_allocator<_Pred>::value>,
916 _Pred = _Pred(),
917 …ator = _Allocator()) -> unordered_set<__iter_value_type<_InputIterator>, _Hash, _Pred, _Allocator>;
922 class _Pred = equal_to<ranges::range_value_t<_Range>>,
926 class = enable_if_t<!__is_allocator<_Pred>::value>,
[all …]
H A Dunordered_map635 class _Pred,
659 template <class _Key, class _Cp, class _Hash, class _Pred>
660 class __unordered_map_hasher<_Key, _Cp, _Hash, _Pred, false> {
683 template <class _Key, class _Cp, class _Hash, class _Pred, bool __b>
685 swap(__unordered_map_hasher<_Key, _Cp, _Hash, _Pred, __b>& __x,
686 … __unordered_map_hasher<_Key, _Cp, _Hash, _Pred, __b>& __y) _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) {
692 class _Pred,
694 bool = is_empty<_Pred>::value && !__libcpp_is_final<_Pred>::value>
695 class __unordered_map_equal : private _Pred {
697 …ABI __unordered_map_equal() _NOEXCEPT_(is_nothrow_default_constructible<_Pred>::value) : _Pred() {}
[all …]

123