RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.cppreference.com/w/cpp/language/../algorithm/../ranges/concat_view/iterator.html below:

std::ranges::concat_view<Views...>::iterator - cppreference.com

template< bool Const > class /*iterator*/

(1) (exposition only*)

Helper concepts

template< bool Const, class... Rs > concept /*concat-is-random-access*/ = /* see description */;

(2) (exposition only*)

template< bool Const, class... Rs > concept /*concat-is-bidirectional*/ = /* see description */;

(3) (exposition only*)

2) Let Fs be the pack that consists of all elements of Rs except the last element. Equivalent to

3) Let Fs be the pack that consists of all elements of Rs except the last element. Equivalent to

[edit] Template parameters Const - whether the iterator is a constant iterator [edit] Nested types [edit] Determining the iterator concept

iterator_concept is defined as follows:

If concat-is-random-access <Const, Views...> is modeled, iterator_concept denotes std::random_access_iterator_tag.
Otherwise, if concat-is-bidirectional <Const, Views...> is modeled, iterator_concept denotes std::bidirectional_iterator_tag.
Otherwise, if all-forward <Const, Views...> is modeled, iterator_concept denotes std::forward_iterator_tag.
Otherwise, iterator_concept denotes std::input_iterator_tag.

[edit] Determining the iterator category

iterator_category is defined if and only if all-forward <Const, Views...> is modeled. In this case, it is defined as follows:

If std::is_reference_v<concat-reference-t <maybe-const <Const, Views>...>> is false, iterator_category denotes std::input_iterator_tag.
Otherwise, let Cs denote the pack of types std::iterator_traits<ranges::iterator_t<maybe-const <Const, Views>>>::iterator_category...:
- If (std::derived_from<Cs, std::random_access_iterator_tag> && ...) && concat-is-random-access <Const, Views...> is true, iterator_category denotes std::random_access_iterator_tag.
- Otherwise, if (std::derived_from<Cs, std::bidirectional_iterator_tag> && ...) && concat-is-bidirectional <Const, Views...> is true, iterator_category denotes std::bidirectional_iterator_tag.
- Otherwise, if (std::derived_from<Cs, std::forward_iterator_tag> && ...) is true, iterator_category denotes std::forward_iterator_tag.
- Otherwise, iterator_category denotes std::input_iterator_tag.

[edit] Data members Member Definition maybe-const <Const, ranges::concat_view>* parent_ a pointer to the parent concat_view
(exposition-only member object*) base-iter it_ an iterator into the current view
(exposition-only member object*) [edit] Member functions constructs an iterator
(public member function) accesses the element
(public member function) accesses an element by index
(public member function) advances or decrements the underlying iterator
(public member function) [edit] Exposition-only function templates replaces it_ with the beginning of the next view, if it_ is the end of current view
(exposition-only member function*) decrements it_ such that it points to the previous position
(exposition-only member function*) advances the current position on given offset
(exposition-only member function*) decrements the current position on given value
(exposition-only member function*) [edit] Non-member functions [edit] Example

The preliminary version can be checked out on Compiler Explorer.

Output:

1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8

[edit] References

C++26 standard (ISO/IEC 14882:2026):

26.7.18.3 Class template concat_view::iterator [range.concat.iterator]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4