Range-v3
Range algorithms, views, and actions for the Standard Library
ranges::span< T, N > Struct Template Reference
+ Inheritance diagram for ranges::span< T, N >:

Public Types

using difference_type = index_type
 
using element_type = T
 
using index_type = detail::span_index_t
 
using iterator = T *
 
using pointer = T *
 
using reference = T &
 
using reverse_iterator = ranges::reverse_iterator< iterator >
 
using value_type = meta::_t< std::remove_cv< T > >
 

Public Member Functions

constexpr iterator begin () const noexcept
 
constexpr pointer data () const noexcept
 
constexpr bool empty () const noexcept
 
constexpr iterator end () const noexcept
 
template<index_type Count>
constexpr span< T, Count > first () const noexcept
 
constexpr span< T > first (index_type cnt) const noexcept
 
template<index_type Count>
constexpr span< T, Count > last () const noexcept
 
constexpr span< T > last (index_type cnt) const noexcept
 
template<typename U , index_type M>
requires equality_comparable_with< T, U > bool operator!= (span< U, M > const &that) const
 
template<typename U , index_type M>
requires totally_ordered_with< T, U > bool operator< (span< U, M > const &that) const
 
template<typename U , index_type M>
requires totally_ordered_with< T, U > bool operator<= (span< U, M > const &that) const
 
template<typename U , index_type M>
requires equality_comparable_with< T, U > bool operator== (span< U, M > const &that) const
 
template<typename U , index_type M>
requires totally_ordered_with< T, U > bool operator> (span< U, M > const &that) const
 
template<typename U , index_type M>
requires totally_ordered_with< T, U > bool operator>= (span< U, M > const &that) const
 
constexpr reference operator[] (index_type idx) const noexcept
 
constexpr reverse_iterator rbegin () const noexcept
 
constexpr reverse_iterator rend () const noexcept
 
template<typename Rng >
 requires (!same_as< span, uncvref_t< Rng >>) &&span_compatible_range< Rng
 
template<typename Rng >
 requires (!same_as< span, uncvref_t< Rng >>) &&span_compatible_range< Rng
 
constexpr index_type size_bytes () const noexcept
 
template<typename = void>
constexpr span (pointer first, pointer last) noexcept
 
constexpr span (pointer ptr, index_type cnt) noexcept
 
T &&constexpr span_static_conversion< Rng, N > span (Rng &&rng) noexcept(noexcept(ranges::data(rng)))
 
T &&constexpr span_dynamic_conversion< Rng, N > span (Rng &&rng) noexcept(noexcept(ranges::data(rng), ranges::size(rng)))
 
template<index_type Offset, index_type Count>
constexpr span< T, detail::subspan_extent(N, Offset, Count)> subspan () const noexcept
 
template<index_type Offset>
constexpr span< T,(N >=Offset ? N - Offset :dynamic_extent)> subspan () const noexcept
 
constexpr span< T, dynamic_extent > subspan (index_type offset) const noexcept
 
constexpr span< T, dynamic_extent > subspan (index_type offset, index_type cnt) const noexcept
 
- Public Member Functions inherited from ranges::view_interface< span< T, dynamic_extent >,(dynamic_extent==dynamic_extent ? finite :static_cast< cardinality >(dynamic_extent))>
constexpr auto empty () const noexcept -> bool requires `(detail::has_fixed_size_< Cardinality >) `
 Test whether a range can be empty:
 
view_interfaceoperator= (view_interface &&)=default
 
view_interfaceoperator= (view_interface const &)=default
 
 view_interface (view_interface &&)=default
 
 view_interface (view_interface const &)=default
 

Static Public Attributes

static constexpr index_type extent = N
 

Additional Inherited Members

- Public Attributes inherited from ranges::view_interface< span< T, dynamic_extent >,(dynamic_extent==dynamic_extent ? finite :static_cast< cardinality >(dynamic_extent))>
requires True &&Cardinality< 0) &&(Cardinality !=infinite) &&(!forward_range< D< True >>) &&sized_range< D< True > >` constexpr bool empty() noexcept(noexcept(bool(ranges::size(std::declval< D< True > & >))==0))) { return ranges::size(derived())==0;} template< bool True=true > requires ` True &&(Cardinality< 0) &&(Cardinality !=infinite) &&(!forward_range< D< True > const >) &&sized_range< D< True > const >` constexpr bool empty() const noexcept(noexcept(bool(ranges::size(std::declval< D< True > const & >))==0))) { return ranges::size(derived())==0;} template< bool True=true > requires ` True &&(!detail::has_fixed_size_< Cardinality >) &&forward_range< D< True > >` constexpr bool empty() noexcept(noexcept(bool(ranges::begin(std::declval< D< True > & >))==ranges::end(std::declval< D< True > & >))))) { return bool(ranges::begin(derived())==ranges::end(derived()));} template< bool True=true > requires ` True &&(!detail::has_fixed_size_< Cardinality >) &&forward_range< D< True > const >` constexpr bool empty() const noexcept(noexcept(bool(ranges::begin(std::declval< D< True > const & >))==ranges::end(std::declval< D< True > const & >))))) { return bool(ranges::begin(derived())==ranges::end(derived()));} template< bool True=true > requires ` True &&detail::can_empty_< D< True > >` constexpr explicit operator bool() noexcept(noexcept(ranges::empty(std::declval< D< True > & >)))) { return !ranges::empty(derived());} template< bool True=true > requires ` True &&detail::can_empty_< D< True > const >` constexpr explicit operator bool() const noexcept(noexcept(ranges::empty(std::declval< D< True > const & >)))) { return !ranges::empty(derived());} template< bool True=true, int=42 > requires ` True &&(Cardinality >=0)` static constexpr std::size_t size() noexcept { return static_cast< std::size_t >Cardinality);} template< bool True=true > requires ` True &&(Cardinality< 0) &&sized_sentinel_for< sentinel_t< D< True > >, iterator_t< D< True > > > &&forward_range< D< True > >` constexpr detail::iter_size_t< iterator_t< D< True > > > size() { using size_type=detail::iter_size_t< iterator_t< D< True > > >;return static_cast< size_type >derived().end() - derived().begin());} template< bool True=true > requires ` True &&(Cardinality< 0) &&sized_sentinel_for< sentinel_t< D< True > const >, iterator_t< D< True > const > > &&forward_range< D< True > const >` constexpr detail::iter_size_t< iterator_t< D< True > > > size() const { using size_type=detail::iter_size_t< iterator_t< D< True > > >;return static_cast< size_type >derived().end() - derived().begin());} template< bool True=true > requires ` True &&forward_range< D< True > >` constexpr range_reference_t< D< True > > front() { return *derived().begin();} template< bool True=true > requires ` True &&forward_range< D< True > const >` constexpr range_reference_t< D< True > const > front() const { return *derived().begin();} template< bool True=true > requires ` True &&common_range< D< True > > &&bidirectional_range< D< True > >` constexpr range_reference_t< D< True > > back() { return *prev(derived().end());} template< bool True=true > requires ` True &&common_range< D< True > const > &&bidirectional_range< D< True > const >` constexpr range_reference_t< D< True > const > back() const { return *prev(derived().end());} template< bool True=true > requires ` True &&random_access_range< D< True > >` constexpr range_reference_t< D< True > > operator[](range_difference_t< D< True >> n) { return derived().begin()[n];} template< bool True=true > requires ` True &&random_access_range< D< True > const >` constexpr range_reference_t< D< True > const > operator[](range_difference_t< D< True >> n) const { return derived().begin()[n];} template< bool True=true > requires ` True &&contiguous_iterator< iterator_t< D< True > > >` constexpr std::add_pointer_t< range_reference_t< D< True > > > data() { return std::addressof(*ranges::begin(derived()));} template< bool True=true > requires ` True &&contiguous_iterator< iterator_t< D< True > const > >` constexpr std::add_pointer_t< range_reference_t< D< True > const > > data() const { return std::addressof(*ranges::begin(derived()));} template< bool True=true > requires ` True &&random_access_range< D< True > > &&sized_range< D< True > >` constexpr range_reference_t< D< True > > at(range_difference_t< D< True >> n) { using size_type=range_size_t< span< T, dynamic_extent > >;if(n< 0||size_type(n) >=ranges::size(derived())) { throw std::out_of_range("view_interface::at");} return derived().begin()[n];} template< bool True=true > requires ` True &&random_access_range< D< True > const > &&sized_range< D< True > const >` constexpr range_reference_t< D< True > const > at(range_difference_t< D< True >> n) const { using size_type=range_size_t< span< T, dynamic_extent > const >;if(n< 0||size_type(n) >=ranges::size(derived())) { throw std::out_of_range("view_interface::at");} return derived().begin()[n];} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&input_range< D< True > & >` constexpr auto operator[](detail::slice_bounds< range_difference_t< D< True >>> offs) &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&input_range< D< True > const & >` constexpr auto operator[](detail::slice_bounds< range_difference_t< D< True >>> offs) const &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&input_range< D< True > >` constexpr auto operator[](detail::slice_bounds< range_difference_t< D< True >>> offs) &&{ return Slice{}(detail::move(derived()), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&input_range< D< True > & > &&sized_range< D< True > & >` constexpr auto operator[](detail::slice_bounds< range_difference_t< D< True >>, detail::from_end_of_t< D< True >>> offs) &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&input_range< D< True > const & > &&sized_range< D< True > const & >` constexpr auto operator[](detail::slice_bounds< range_difference_t< D< True >>, detail::from_end_of_t< D< True >>> offs) const &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&input_range< D< True > > &&sized_range< D< True > >` constexpr auto operator[](detail::slice_bounds< range_difference_t< D< True >>, detail::from_end_of_t< D< True >>> offs) &&{ return Slice{}(detail::move(derived()), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&(forward_range< D< True > & >||(input_range< D< True > & > &&sized_range< D< True > & >))` constexpr auto operator[](detail::slice_bounds< detail::from_end_of_t< D< True >>, detail::from_end_of_t< D< True >>> offs) &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&(forward_range< D< True > const & >||(input_range< D< True > const & > &&sized_range< D< True > const & >))` constexpr auto operator[](detail::slice_bounds< detail::from_end_of_t< D< True >>, detail::from_end_of_t< D< True >>> offs) const &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&(forward_range< D< True >>||(input_range< D< True >> &&sized_range< D< True >>))` constexpr auto operator[](detail::slice_bounds< detail::from_end_of_t< D< True >>, detail::from_end_of_t< D< True >>> offs) &&{ return Slice{}(detail::move(derived()), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&input_range< D< True > & >` constexpr auto operator[](detail::slice_bounds< range_difference_t< D< True >>, end_fn > offs) &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&input_range< D< True > const & >` constexpr auto operator[](detail::slice_bounds< range_difference_t< D< True >>, end_fn > offs) const &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&input_range< D< True > >` constexpr auto operator[](detail::slice_bounds< range_difference_t< D< True >>, end_fn > offs) &&{ return Slice{}(detail::move(derived()), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&(forward_range< D< True > & >||(input_range< D< True > & > &&sized_range< D< True > & >))` constexpr auto operator[](detail::slice_bounds< detail::from_end_of_t< D< True >>, end_fn > offs) &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&(forward_range< D< True > const & >||(input_range< D< True > const & > &&sized_range< D< True > const & >))` constexpr auto operator[](detail::slice_bounds< detail::from_end_of_t< D< True >>, end_fn > offs) const &{ return Slice{}(derived(), offs.from, offs.to);} template< bool True=true, typename Slice=views::slice_fn > requires ` True &&(forward_range< D< True >>||(input_range< D< True >> &&sized_range< D< True >>))` constexpr auto operator[](detail::slice_bounds< detail::from_end_of_t< D< True >>, end_fn > offs) &&{ return Slice{}(detail::move(derived()), offs.from, offs.to);} private:template< bool True=true > friend auto operator<<(std::ostream &sout, span< T, dynamic_extent > const &rng) -> std::ostream &requires True && input_range< D< True > const >
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
 
- Protected Types inherited from ranges::view_interface< span< T, dynamic_extent >,(dynamic_extent==dynamic_extent ? finite :static_cast< cardinality >(dynamic_extent))>
using D = meta::invoke< detail::dependent_< B >, span< T, dynamic_extent > >
 
- Protected Member Functions inherited from ranges::view_interface< span< T, dynamic_extent >,(dynamic_extent==dynamic_extent ? finite :static_cast< cardinality >(dynamic_extent))>
constexpr span< T, dynamic_extent > const & derived () const noexcept
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
 
constexpr span< T, dynamic_extent > & derived () noexcept