Home
last modified time | relevance | path

Searched refs:__pred_ (Results 1 – 16 of 16) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dtake_while_view.h54 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_; variable
62 : __base_(std::move(__base)), __pred_(std::in_place, std::move(__pred)) {} in take_while_view()
72 _LIBCPP_HIDE_FROM_ABI constexpr const _Pred& pred() const { return *__pred_; } in pred()
89 return __sentinel</*_Const=*/false>(ranges::end(__base_), std::addressof(*__pred_)); in end()
95 return __sentinel</*_Const=*/true>(ranges::end(__base_), std::addressof(*__pred_)); in end()
109 const _Pred* __pred_ = nullptr; variable
117 : __end_(std::move(__end)), __pred_(__pred) {} in __sentinel()
121 : __end_(std::move(__s.__end_)), __pred_(__s.__pred_) {} in __sentinel()
126 return __x == __y.__end_ || !std::invoke(*__y.__pred_, *__x);
133 return __x == __y.__end_ || !std::invoke(*__y.__pred_, *__x);
H A Ddrop_while_view.h58 : __base_(std::move(__base)), __pred_(std::in_place, std::move(__pred)) {} in drop_while_view()
68 _LIBCPP_HIDE_FROM_ABI constexpr const _Pred& pred() const { return *__pred_; } in pred()
73 __pred_.__has_value(), in begin()
78 __cached_begin_.__emplace(ranges::find_if_not(__base_, std::cref(*__pred_))); in begin()
82 return ranges::find_if_not(__base_, std::cref(*__pred_)); in begin()
90 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_; variable
H A Dchunk_by_view.h59 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_; variable
70 …__pred_.__has_value(), "Trying to call __find_next() on a chunk_by_view that does not have a valid… in __find_next()
72 return !std::invoke(*__pred_, std::forward<_Tp>(__x), std::forward<_Up>(__y)); in __find_next()
85 …__pred_.__has_value(), "Trying to call __find_prev() on a chunk_by_view that does not have a valid… in __find_prev()
90 return !std::invoke(*__pred_, std::forward<_Up>(__y), std::forward<_Tp>(__x)); in __find_prev()
101 : __base_(std::move(__base)), __pred_(in_place, std::move(__pred)) {} in chunk_by_view()
111 _LIBCPP_HIDE_FROM_ABI constexpr const _Pred& pred() const { return *__pred_; } in pred()
116 …__pred_.__has_value(), "Trying to call begin() on a chunk_by_view that does not have a valid predi… in begin()
H A Dfilter_view.h59 _LIBCPP_NO_UNIQUE_ADDRESS __movable_box<_Pred> __pred_; variable
76 : __base_(std::move(__base)), __pred_(in_place, std::move(__pred)) {} in filter_view()
86 _LIBCPP_HIDE_FROM_ABI constexpr _Pred const& pred() const { return *__pred_; } in pred()
91 …__pred_.__has_value(), "Trying to call begin() on a filter_view that does not have a valid predica… in begin()
94 __cached_begin_.__emplace(ranges::find_if(__base_, std::ref(*__pred_))); in begin()
98 return {*this, ranges::find_if(__base_, std::ref(*__pred_))}; in begin()
163 …::find_if(std::move(++__current_), ranges::end(__parent_->__base_), std::ref(*__parent_->__pred_));
180 } while (!std::invoke(*__parent_->__pred_, *__current_));
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dutils.h
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__functional/
H A Dunary_negate.h24 _Predicate __pred_; variable
27 _LIBCPP_HIDE_FROM_ABI explicit unary_negate(const _Predicate& __pred) : __pred_(__pred) {} in unary_negate()
28 …_ABI bool operator()(const typename _Predicate::argument_type& __x) const { return !__pred_(__x); } in operator()
H A Dbinary_negate.h27 _Predicate __pred_; variable
30 _LIBCPP_HIDE_FROM_ABI explicit binary_negate(const _Predicate& __pred) : __pred_(__pred) {} in binary_negate()
34 return !__pred_(__x, __y); in operator()
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h109 __pred_(__pred), in __first_()
111 __skip_table_(std::make_shared<__skip_table_type>(__pattern_length_, -1, __hash, __pred_)), in __first_()
120 __build_suffix_table(__first_, __last_, __pred_); in __first_()
142 _BinaryPredicate __pred_; variable
156 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
240 __pred_(__pred), in __first_()
242 …able_(std::make_shared<__skip_table_type>(__pattern_length_, __pattern_length_, __hash, __pred_)) { in __first_()
274 _BinaryPredicate __pred_; variable
287 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
H A Dunary_negate.h26 _Predicate __pred_; variable
30 : __pred_(__pred) {} in unary_negate()
33 return !__pred_(__x); in operator()
H A Dbinary_negate.h29 _Predicate __pred_; variable
33 : __pred_(__pred) {} in binary_negate()
37 return !__pred_(__x, __y); in operator()
H A Ddefault_searcher.h34 : __first_(__f), __last_(__l), __pred_(__p) {} in __first_()
40 return std::__search_impl(__f, __l, __first_, __last_, __pred_, __proj, __proj); in operator()
46 _BinaryPredicate __pred_; variable
/freebsd/contrib/llvm-project/libcxx/src/
H A Dlegacy_debug_handler.cpp
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/ext/
H A Dhash_map271 _Pred __pred_;
274 _LIBCPP_HIDE_FROM_ABI __hash_map_equal() : __pred_() {}
275 _LIBCPP_HIDE_FROM_ABI __hash_map_equal(const _Pred& __p) : __pred_(__p) {}
276 _LIBCPP_HIDE_FROM_ABI const _Pred& key_eq() const { return __pred_; }
277 …_LIBCPP_HIDE_FROM_ABI bool operator()(const _Tp& __x, const _Tp& __y) const { return __pred_(__x.f…
279 return __pred_(__x, __y.first);
282 return __pred_(__x.first, __y);
286 return __pred_(__x, __y);
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_map274 _Pred __pred_;
277 _LIBCPP_HIDE_FROM_ABI __hash_map_equal() : __pred_() {}
278 _LIBCPP_HIDE_FROM_ABI __hash_map_equal(const _Pred& __p) : __pred_(__p) {}
279 _LIBCPP_HIDE_FROM_ABI const _Pred& key_eq() const { return __pred_; }
280 …_LIBCPP_HIDE_FROM_ABI bool operator()(const _Tp& __x, const _Tp& __y) const { return __pred_(__x.f…
282 return __pred_(__x, __y.first);
285 return __pred_(__x.first, __y);
289 return __pred_(__x, __y);
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Dunordered_map685 _Pred __pred_;
688 _LIBCPP_HIDE_FROM_ABI __unordered_map_equal() : __pred_() {}
689 _LIBCPP_HIDE_FROM_ABI __unordered_map_equal(const _Pred& __p) : __pred_(__p) {}
690 _LIBCPP_HIDE_FROM_ABI const _Pred& key_eq() const _NOEXCEPT { return __pred_; }
692 return __pred_(__x.__get_value().first, __y.__get_value().first);
695 return __pred_(__x.__get_value().first, __y);
698 return __pred_(__x, __y.__get_value().first);
702 swap(__pred_, __y.__pred_);
/freebsd/contrib/llvm-project/libcxx/include/
H A Dunordered_map748 _Pred __pred_;
752 : __pred_() {}
754 : __pred_(__p) {}
755 _LIBCPP_HIDE_FROM_ABI const _Pred& key_eq() const _NOEXCEPT { return __pred_; }
756 …_LIBCPP_HIDE_FROM_ABI bool operator()(const _Cp& __x, const _Cp& __y) const { return __pred_(__x.f…
757 …_LIBCPP_HIDE_FROM_ABI bool operator()(const _Cp& __x, const _Key& __y) const { return __pred_(__x.…
758 …_LIBCPP_HIDE_FROM_ABI bool operator()(const _Key& __x, const _Cp& __y) const { return __pred_(__x,…
762 return __pred_(__x.first, __y);
766 return __pred_(__x, __y.first);
770 return __pred_(__x, __y);
[all …]