Home
last modified time | relevance | path

Searched refs:__parent_ (Results 1 – 8 of 8) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dlazy_split_view.h152 _Parent* __parent_ = nullptr;
161 return *__parent_->__current_;
169 return *__parent_->__current_;
175 …_LIBCPP_HIDE_FROM_ABI constexpr auto& __parent_base() const noexcept { return __parent_->__base_; }
198 : __parent_(std::addressof(__parent)) {}
202 : __parent_(std::addressof(__parent)), __current_(std::move(__current)) {}
206 : __parent_(__i.__parent_), __current_(std::move(__i.__current_)) {}
211 const auto __end = ranges::end(__parent_->__base_);
217 const auto [__pbegin, __pend] = ranges::subrange{__parent_->__pattern_};
267 …_LIBCPP_ASSERT_NON_NULL(__x.__parent_ != nullptr, "Cannot call comparison on a default-constructed…
[all …]
H A Djoin_view.h208 _Parent* __parent_ = nullptr;
211 for (; __get_outer() != ranges::end(__parent_->__base_); ++__get_outer()) {
216 return __parent_->__inner_.__emplace_from([&]() -> decltype(auto) { return *__get_outer(); });
231 return *__parent_->__outer_;
239 return *__parent_->__outer_;
245 : __outer_(std::move(__outer)), __parent_(std::addressof(__parent)) {
251 : __parent_(std::addressof(__parent)) {
257 : __outer_(std::move(__outer)), __inner_(std::move(__inner)), __parent_(__parent) {}
276 : __outer_(std::move(__i.__outer_)), __inner_(std::move(__i.__inner_)), __parent_(__i.__parent_) {}
[all...]
H A Distream_view.h70 : __parent_(std::addressof(__parent)) {} in __iterator()
79 *__parent_->__stream_ >> __parent_->__value_;
85 _LIBCPP_HIDE_FROM_ABI _Val& operator*() const { return __parent_->__value_; }
92 basic_istream_view<_Val, _CharT, _Traits>* __parent_;
95 return __parent_->__stream_; in __get_parent_stream()
H A Dtransform_view.h181 _Parent* __parent_ = nullptr;
201 : __parent_(std::addressof(__parent)), __current_(std::move(__current)) {}
208 : __parent_(__i.__parent_), __current_(std::move(__i.__current_)) {}
215 noexcept(noexcept(std::invoke(*__parent_->__func_, *__current_))) {
216 return std::invoke(*__parent_->__func_, *__current_);
264 noexcept(noexcept(std::invoke(*__parent_->__func_, __current_[__n])))
267 return std::invoke(*__parent_->__func_, __current_[__n]);
309 return __iterator{*__i.__parent_, __i.__current_ + __n};
315 return __iterator{*__i.__parent_, __i.__current_ + __n};
321 return __iterator{*__i.__parent_, __i.__current_ - __n};
H A Dsplit_view.h126 split_view* __parent_ = nullptr;
143 … : __parent_(std::addressof(__parent)), __cur_(std::move(__current)), __next_(std::move(__next)) {}
151 if (__cur_ != ranges::end(__parent_->__base_)) {
153 if (__cur_ == ranges::end(__parent_->__base_)) {
157 __next_ = __parent_->__find_next(__cur_);
H A Dfilter_view.h132 _LIBCPP_NO_UNIQUE_ADDRESS filter_view* __parent_ = nullptr;
149 : __current_(std::move(__current)), __parent_(std::addressof(__parent)) {}
163 ranges::find_if(std::move(++__current_), ranges::end(__parent_->__base_), std::ref(*__parent_->__pred_));
180 } while (!std::invoke(*__parent_->__pred_, *__current_));
H A Dchunk_by_view.h142 chunk_by_view* __parent_ = nullptr; variable
148 : __parent_(std::addressof(__parent)), __current_(__current), __next_(__next) {} in __iterator()
169 __next_ = __parent_->__find_next(__current_);
183 __current_ = __parent_->__find_prev(__next_);
/freebsd/contrib/llvm-project/libcxx/include/
H A D__tree93 Each algorithm herein assumes that __root->__parent_ points to a non-null
95 member is read or written to at __root->__parent_.
97 __root->__parent_ will be referred to below (in comments only) as end_node.
102 __root, have a non-null __parent_ field.
110 return __x == __x->__parent_->__left_;
122 if (__x->__left_ != nullptr && __x->__left_->__parent_ != __x)
125 if (__x->__right_ != nullptr && __x->__right_->__parent_ != __x)
152 // check __x->__parent_ consistency
153 if (__root->__parent_ == nullptr)
200 return static_cast<_EndNodePtr>(__x->__parent_);
[all …]