std::ranges::views::counted

 

C++

Language

Standard Library Headers

Freestanding and hosted implementations

Named requirements

Language support library

Concepts library (C++20)

Diagnostics library

Utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

 

Ranges library

Range access
begincbegin endcend	rbegincrbegin rendcrend	size empty datacdata
Range primitives
iterator_tsentinel_t	range_difference_trange_value_t	range_reference_trange_rvalue_reference_t
Dangling iterator handling
dangling	borrowed_iterator_t	borrowed_subrange_t
Range concepts
range borrowed_range sized_range	common_range view viewable_range	input_range output_range forward_range	bidirectional_range random_access_range contiguous_range
Views
view_interface	subrange
Semiregular wrapper
Factories
empty_viewviews::empty	single_viewviews::single	iota_viewviews::iota	views::counted
Adaptors
all_viewviews::all join_viewviews::join take_viewviews::take basic_istream_viewistream_view	ref_view                                split_viewviews::split take_while_viewviews::take_while elements_viewviews::elements	common_viewviews::common transform_viewviews::transform drop_viewviews::drop keys_viewviews::keys	reverse_viewviews::reverse filter_viewviews::filter drop_while_viewviews::drop_while values_viewviews::values

 

namespace views {     inline constexpr /*unspecified*/ counted = /*unspecified*/; }		(since C++20)

A counted view presents a view of the elements of the counted range [i, n) for some iterator i and non-negative integer n.

A counted range [i, n) is the n elements starting with the element pointed to by i and up to but not including the element, if any, pointed to by the result of n applications of ++i.

If n == 0, the counted range is valid and empty. Otherwise, the counted range is only valid if n is positive, i is dereferenceable, and [++i, --n) is a valid counted range.

Formally, if E and F are expressions, and T is the type std::decay_t<decltype((E))>, then

if T models input_or_output_iterator and decltype((F)) models std::convertible_to<std::iter_difference_t<T>>,

if T models random_access_iterator, views::counted(E, F) is expression-equivalent to ranges::subrange{E, E + static_cast<std::iter_difference_t<T>>(F)}

otherwise views::counted(E, F) is expression-equivalent to ranges::subrange{std::counted_iterator{E, F}, std::default_sentinel}

otherwise, views::counted(E, F) is ill-formed.

Expression-equivalent

Expression e is expression-equivalent to expression f, if e and f have the same effects, either are both potentially-throwing or are both not potentially-throwing (i.e. noexcept(e) == noexcept(f)), and either are both constant subexpressions or are both not constant subexpressions.

Example

Run this code

#include <ranges>
#include <iostream>
 
int main()
{
    int a[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    for(int i : std::views::counted(a, 3))
        std::cout << i << ' ';
}

Output:

1 2 3

See also

subrange	combines an iterator-sentinel pair into a view (class template)
counted_iterator (C++20)	iterator adaptor that tracks the distance to the end of the range (class template)