|
Range primitives | |||||||
|
Range concepts | |||||||||||||||||||
|
Range factories | |||||||||
|
Range adaptors | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
Helper items | |||||||||||||||||
|
Defined in header <ranges> | ||
template<ranges::view V> class take_view | (1) | (since C++20) |
namespace views{ inlineconstexpr/* unspecified */ take=/* unspecified */; | (2) | (since C++20) |
Call signature | ||
template<ranges::viewable_range R> requires/* see below */ | (since C++20) | |
template<class DifferenceType> constexpr/* range adaptor closure */ take( DifferenceType&& count); | (since C++20) | |
view
of the elements from an underlying sequence, starting at the beginning and ending at a given bound.views::take
is aRangeAdaptorObject. The expressionviews::take(e, f) results in a view that represents the firstf elements frome. The result is not necessarily atake_view
.views::take(e, f) isexpression-equivalent to (whereT
isstd::remove_cvref_t<decltype((e))> andD
isranges::range_difference_t<decltype((e))>):
decay-copy(e)), ifT
is aranges::empty_view, except that the evaluations ofe andf are indeterminately sequenced;T
is a specialization ofstd::span,std::basic_string_view, orranges::subrange that models bothrandom_access_range
andsized_range
, whereU
isT
is a specialization ofstd::span;T
, ifT
is a specialization ofstd::basic_string_view;T
is a specialization ofranges::subrange;T
is a specialization ofranges::iota_view that models bothrandom_access_range
andsized_range
;
| (since C++23) |
take_view
models the conceptscontiguous_range
,random_access_range
,bidirectional_range
,forward_range
,input_range
, andsized_range
when the underlying viewV
models respective concepts. It modelscommon_range
when the underlying viewV
models bothrandom_access_range
andsized_range
.
Contents |
Member | Description |
V base_ | the underlying view (exposition-only member object*) |
ranges::range_difference_t<V>count_ | the number of elements to take (exposition-only member object*) |
constructs atake_view (public member function)[edit] | |
returns a copy of the underlying (adapted) view (public member function)[edit] | |
returns an iterator to the beginning (public member function)[edit] | |
returns an iterator or a sentinel to the end (public member function)[edit] | |
returns the number of elements, provided only if the underlying (adapted) range satisfiessized_range (public member function)[edit] | |
(C++26) | returns the approximate size of the resultingapproximately_sized_range (public member function)[edit] |
Inherited fromstd::ranges::view_interface | |
returns whether the derived view is empty, provided only if it satisfiessized_range orforward_range (public member function of std::ranges::view_interface<D> )[edit] | |
(C++23) | returns a constant iterator to the beginning of the range (public member function of std::ranges::view_interface<D> )[edit] |
(C++23) | returns a sentinel for the constant iterator of the range (public member function of std::ranges::view_interface<D> )[edit] |
returns whether the derived view is not empty, provided only ifranges::empty is applicable to it (public member function of std::ranges::view_interface<D> )[edit] | |
gets the address of derived view's data, provided only if its iterator type satisfiescontiguous_iterator (public member function of std::ranges::view_interface<D> )[edit] | |
returns the first element in the derived view, provided if it satisfiesforward_range (public member function of std::ranges::view_interface<D> )[edit] | |
returns the last element in the derived view, provided only if it satisfiesbidirectional_range andcommon_range (public member function of std::ranges::view_interface<D> )[edit] | |
returns then th element in the derived view, provided only if it satisfiesrandom_access_range (public member function of std::ranges::view_interface<D> )[edit] |
(C++20) | the sentinel type (exposition-only member class template*) |
template<class T> constexprbool enable_borrowed_range<std::ranges::take_view<T>>= | (since C++20) | |
This specialization ofranges::enable_borrowed_range makestake_view
satisfyborrowed_range
when the underlying view satisfies it.
#include <algorithm>#include <iostream>#include <ranges> int main(){namespace views= std::views;auto print=[](char x){std::cout<< x;}; for(constchar nums[]{'1','2','3'};int n:views::iota(0,5)){std::cout<<"take("<< n<<"): ";// safely takes only upto min(n, nums.size()) elements: std::ranges::for_each(nums| views::take(n), print);std::cout<<'\n';}}
Output:
take(0): take(1): 1take(2): 12take(3): 123take(4): 123
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 3407 | C++20 | views::take sometimes failed toconstruct a sized random access range | the result type is adjusted so that construction is always valid |
LWG 3494 | C++20 | take_view was never aborrowed_range | it is aborrowed_range if its underlying view is |
(C++20) | creates a subrange from an iterator and a count (customization point object)[edit] |
aview consisting of the initial elements of anotherview , until the first element on which a predicate returnsfalse(class template)(range adaptor object)[edit] | |
(C++20) | copies a number of elements to a new location (algorithm function object)[edit] |