| /llvm-project-15.0.7/libcxx/include/__ranges/ |
| H A D | filter_view.h | 49 _LIBCPP_NO_UNIQUE_ADDRESS __copyable_box<_Pred> __pred_; variable
66 : __base_(std::move(__base)), __pred_(in_place, std::move(__pred)) in filter_view()
76 constexpr _Pred const& pred() const { return *__pred_; } in pred()
80 …_LIBCPP_ASSERT(__pred_.__has_value(), "Trying to call begin() on a filter_view that does not have … in begin()
83 __cached_begin_.__emplace(ranges::find_if(__base_, std::ref(*__pred_))); in begin()
87 return {*this, ranges::find_if(__base_, std::ref(*__pred_))}; in begin()
157 std::ref(*__parent_->__pred_));
173 } while (!std::invoke(*__parent_->__pred_, *__current_));
|
| /llvm-project-15.0.7/libcxx/include/__functional/ |
| H A D | unary_negate.h | 28 _Predicate __pred_; variable
32 : __pred_(__pred) {} in unary_negate()
35 {return !__pred_(__x);} in operator()
|
| H A D | binary_negate.h | 30 _Predicate __pred_; variable
33 binary_negate(const _Predicate& __pred) : __pred_(__pred) {} in binary_negate()
38 {return !__pred_(__x, __y);} in operator()
|
| H A D | boyer_moore_searcher.h | 122 __pred_(__pred), in __first_()
124 __skip_table_(std::make_shared<__skip_table_type>(__pattern_length_, -1, __hash, __pred_)), in __first_()
133 __build_suffix_table(__first_, __last_, __pred_); in __first_()
155 _BinaryPredicate __pred_; variable
169 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
249 __pred_(__pred), in __first_()
251 …able_(std::make_shared<__skip_table_type>(__pattern_length_, __pattern_length_, __hash, __pred_)) { in __first_()
283 _BinaryPredicate __pred_; variable
296 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
|
| H A D | default_searcher.h | 35 : __first_(__f), __last_(__l), __pred_(__p) {} in __first_()
43 return std::__search_impl(__f, __l, __first_, __last_, __pred_, __proj, __proj); in operator()
49 _BinaryPredicate __pred_; variable
|
| /llvm-project-15.0.7/libcxx/include/experimental/ |
| H A D | functional | 101 : __first_(__f), __last_(__l), __pred_(__p) {}
109 return std::__search_impl(__f, __l, __first_, __last_, __pred_, __proj, __proj);
115 _BinaryPredicate __pred_;
206 : __first_(__f), __last_(__l), __pred_(__pred),
208 __skip_{make_shared<skip_table_type>(__pattern_length_, -1, __hf, __pred_)},
215 this->__build_suffix_table ( __first_, __last_, __pred_ );
240 _BinaryPredicate __pred_;
259 while (__pred_(__first_ [__j-1], __cur [__j-1])) {
355 : __first_(__f), __last_(__l), __pred_(__pred),
390 _BinaryPredicate __pred_;
[all …]
|
| /llvm-project-15.0.7/libcxx/src/ |
| H A D | legacy_debug_handler.cpp | 25 const char* __pred_; member
32 msg += __pred_; in what()
|
| /llvm-project-15.0.7/libcxx/include/ext/ |
| H A D | hash_map | 293 _Pred __pred_;
295 _LIBCPP_INLINE_VISIBILITY __hash_map_equal() : __pred_() {}
296 _LIBCPP_INLINE_VISIBILITY __hash_map_equal(const _Pred& __p) : __pred_(__p) {}
297 _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return __pred_;}
300 {return __pred_(__x.first, __y.first);}
303 {return __pred_(__x, __y.first);}
306 {return __pred_(__x.first, __y);}
310 {return __pred_(__x, __y);}
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | unordered_map | 697 _Pred __pred_;
702 : __pred_() {}
706 : __pred_(__p) {}
708 const _Pred& key_eq() const _NOEXCEPT {return __pred_;}
714 {return __pred_(__x.__get_value().first, __y);}
717 {return __pred_(__x, __y.__get_value().first);}
722 {return __pred_(__x.__get_value().first, __y);}
726 {return __pred_(__x, __y.__get_value().first);}
730 {return __pred_(__x, __y);}
734 {return __pred_(__x, __y);}
[all …]
|