[range.join.iterator] (original) (raw)

25 Ranges library [ranges]

25.7 Range adaptors [range.adaptors]

25.7.14 Join view [range.join]

25.7.14.3 Class template join_view​::​iterator [range.join.iterator]

namespace std::ranges { template<input_range V> requires view<V> && input_range<range_reference_t<V>> template<bool Const> struct join_view<V>::iterator { private: using Parent = maybe-const<Const, join_view>; using Base = maybe-const<Const, V>; using OuterIter = iterator_t<_Base_>; using InnerIter = iterator_t<range_reference_t<_Base_>>; static constexpr bool ref-is-glvalue = is_reference_v<range_reference_t<_Base_>>;OuterIter outer_ = OuterIter(); optional<_InnerIter_> inner_; Parent* parent_ = nullptr; constexpr void satisfy(); constexpr OuterIter& outer(); constexpr const OuterIter& outer() const; constexpr iterator(Parent& parent, OuterIter outer) requires forward_range<_Base_>; constexpr explicit iterator(Parent& parent) requires (forward\_range<_Base_>); public: using iterator_concept = see below;using iterator_category = see below; using value_type = range_value_t<range_reference_t<_Base_>>;using difference_type = see below;iterator() = default;constexpr iterator(iterator<!Const> i) requires Const && convertible_to<iterator_t<V>, _OuterIter_> && convertible_to<iterator_t<_InnerRng_>, _InnerIter_>;constexpr decltype(auto) operator*() const { return **inner_; } constexpr InnerIter operator->() const requires has-arrow<_InnerIter_> && copyable<_InnerIter_>;constexpr iterator& operator++();constexpr void operator++(int);constexpr iterator operator++(int) requires ref-is-glvalue && forward_range<_Base_> && forward_range<range_reference_t<_Base_>>;constexpr iterator& operator--() requires ref-is-glvalue && bidirectional_range<_Base_> && bidirectional_range<range_reference_t<_Base_>> && common_range<range_reference_t<_Base_>>;constexpr iterator operator--(int) requires ref-is-glvalue && bidirectional_range<_Base_> && bidirectional_range<range_reference_t<_Base_>> && common_range<range_reference_t<_Base_>>;friend constexpr bool operator==(const iterator& x, const iterator& y) requires ref-is-glvalue && forward_range<_Base_> && equality_comparable<iterator_t<range_reference_t<_Base_>>>;friend constexpr decltype(auto) iter_move(const iterator& i) noexcept(noexcept(ranges::iter_move(*i.inner_))) { return ranges::iter_move(*i.inner_);} friend constexpr void iter_swap(const iterator& x, const iterator& y) noexcept(noexcept(ranges::iter_swap(*x.inner_, *y.inner_))) requires indirectly_swappable<_InnerIter_>;};}

_iterator_​::​iterator_concept is defined as follows:

The member typedef-name iterator_category is defined if and only if ref-is-glvalue is true,Base models forward_range, andrange_reference_t<_Base_> models forward_range.

In that case,_iterator_​::​iterator_category is defined as follows:

_iterator_​::​difference_type denotes the type:common_type_t< range_difference_t<_Base_>, range_difference_t<range_reference_t<_Base_>>>

join_view iterators use the satisfy function to skip over empty inner ranges.

constexpr _OuterIter_& _outer_();constexpr const _OuterIter_& _outer_() const;

Returns: outer_ if Base models forward_range; otherwise, *_parent__->outer_.

constexpr void _satisfy_();

Effects: Equivalent to:auto update_inner = [this](const iterator_t<_Base_>& x) -> auto&& { if constexpr (ref-is-glvalue) return *x;else return _parent__->inner_.emplace-deref(x);};for (; outer() != ranges::end(_parent__->base_); ++outer()) { auto&& inner = update_inner(outer());inner_ = ranges::begin(inner);if (*inner_ != ranges::end(inner)) return;} if constexpr (ref-is-glvalue) inner_.reset();

constexpr _iterator_(_Parent_& parent, _OuterIter_ outer) requires [forward_range](range.refinements#concept:forward%5Frange "25.4.5 Other range refinements [range.refinements]")<_Base_>;

Effects: Initializes outer_ with std​::​move(outer) and_parent__ with addressof(parent); then calls satisfy().

constexpr explicit _iterator_(_Parent_& parent) requires (![forward_range](range.refinements#concept:forward%5Frange "25.4.5 Other range refinements [range.refinements]")<_Base_>);

Effects: Initializes parent_ with addressof(parent); then calls satisfy().

constexpr _iterator_(_iterator_<!Const> i) requires Const && [convertible_to](concept.convertible#concept:convertible%5Fto "18.4.4 Concept convertible_­to [concept.convertible]")<iterator_t<V>, _OuterIter_> && [convertible_to](concept.convertible#concept:convertible%5Fto "18.4.4 Concept convertible_­to [concept.convertible]")<iterator_t<_InnerRng_>, _InnerIter_>;

Effects: Initializes outer_ with std​::​move(i.outer_),inner_ with std​::​move(i.inner_), and_parent__ with i.parent_.

[Note 1:

Const can only be truewhen Base models forward_range.

— _end note_]

constexpr _InnerIter_ operator->() const requires [_has-arrow_](range.utility.helpers#concept:has-arrow "25.5.2 Helper concepts [range.utility.helpers]")<_InnerIter_> && [copyable](concepts.object#concept:copyable "18.6 Object concepts [concepts.object]")<_InnerIter_>;

Effects: Equivalent to: return *inner_;

constexpr _iterator_& operator++();

Let inner-range be:

Effects: Equivalent to:if (++*inner_ == ranges::end(as-lvalue(inner-range))) { ++outer();satisfy();} return *this;

constexpr void operator++(int);

Effects: Equivalent to: ++*this.

Effects: Equivalent to:auto tmp = *this;++*this;return tmp;

Effects: Equivalent to:if (outer_ == ranges::end(_parent__->base_)) inner_ = ranges::end(as-lvalue(*--outer_));while (*inner_ == ranges::begin(as-lvalue(*outer_))) *inner_ = ranges::end(as-lvalue(*--outer_));--*inner_;return *this;

Effects: Equivalent to:auto tmp = *this;--*this;return tmp;

friend constexpr bool operator==(const _iterator_& x, const _iterator_& y) requires _ref-is-glvalue_ && [forward_range](range.refinements#concept:forward%5Frange "25.4.5 Other range refinements [range.refinements]")<_Base_> && [equality_comparable](concept.equalitycomparable#concept:equality%5Fcomparable "18.5.4 Concept equality_­comparable [concept.equalitycomparable]")<iterator_t<range_reference_t<_Base_>>>;

Effects: Equivalent to:return x.outer_ == y.outer_ && x.inner_ == y.inner_;

friend constexpr void iter_swap(const _iterator_& x, const _iterator_& y) noexcept(noexcept(ranges::iter_swap(*x._inner_, *y._inner_))) requires [indirectly_swappable](alg.req.ind.swap#concept:indirectly%5Fswappable "24.3.7.4 Concept indirectly_­swappable [alg.req.ind.swap]")<_InnerIter_>;

Effects: Equivalent to: return ranges​::​iter_swap(*x.inner_, *y.inner_);