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>
auto operator!= (span< U, M > const &that) const -> bool requires equality_comparable_with< T, U >
 
template<typename U , index_type M>
auto operator< (span< U, M > const &that) const -> bool requires totally_ordered_with< T, U >
 
template<typename U , index_type M>
auto operator<= (span< U, M > const &that) const -> bool requires totally_ordered_with< T, U >
 
template<typename U , index_type M>
auto operator== (span< U, M > const &that) const -> bool requires equality_comparable_with< T, U >
 
template<typename U , index_type M>
auto operator> (span< U, M > const &that) const -> bool requires totally_ordered_with< T, U >
 
template<typename U , index_type M>
auto operator>= (span< U, M > const &that) const -> bool requires totally_ordered_with< T, U >
 
constexpr reference operator[] (index_type idx) const noexcept
 
constexpr reverse_iterator rbegin () const noexcept
 
constexpr reverse_iterator rend () const noexcept
 
template<typename Rng >
 requires (!defer::same_as< span, uncvref_t< Rng >>) &&defer
 
template<typename Rng >
 requires (!defer::same_as< span, uncvref_t< Rng >>) &&defer
 
constexpr index_type size_bytes () const noexcept
 
constexpr span (pointer ptr, index_type cnt) noexcept
 
template<typename = void>
constexpr span (pointer first, pointer last) noexcept
 
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, N >,(N==dynamic_extent ? finite :static_cast< cardinality >(N))>
constexpr auto at (range_difference_t< D< True >> n) -> range_reference_t< D< True >> requires True &&random_access_range< D< True >> &&sized_range< D< True >>
 Returns a reference to the element at specified location pos, with bounds checking.
 
constexpr auto at (range_difference_t< D< True >> n) const -> range_reference_t< D< True > const > requires True &&random_access_range< D< True > const > &&sized_range< D< True > const >
 
constexpr auto back () -> range_reference_t< D< True >> requires True &&common_range< D< True >> &&bidirectional_range< D< True >>
 Access the last element in a range:
 
constexpr auto back () const -> range_reference_t< D< True > const > requires True &&common_range< D< True > const > &&bidirectional_range< D< True > const >
 
constexpr auto empty () const noexcept -> bool requires(detail::has_fixed_size_(Cardinality))
 
constexpr auto empty () noexcept(noexcept(bool(ranges::size(std::declval< D< True > & >())==0))) -> bool requires True &&(Cardinality< 0) &&(Cardinality !=infinite) &&(!forward_range< D< True >>)&&sized_range< D< True >>
 
constexpr auto empty () const noexcept(noexcept(bool(ranges::size(std::declval< D< True > const & >())==0))) -> bool requires True &&(Cardinality< 0) &&(Cardinality !=infinite) &&(!forward_range< D< True > const >)&&sized_range< D< True > const >
 
constexpr auto empty () noexcept(noexcept(bool(ranges::begin(std::declval< D< True > & >())==ranges::end(std::declval< D< True > & >())))) -> bool requires True &&(!detail::has_fixed_size_(Cardinality)) &&forward_range< D< True >>
 
constexpr auto empty () const noexcept(noexcept(bool(ranges::begin(std::declval< D< True > const & >())==ranges::end(std::declval< D< True > const & >())))) -> bool requires True &&(!detail::has_fixed_size_(Cardinality)) &&forward_range< D< True > const >
 
requires True && forward_range (input_range< D< True > & > &&sized_range< D< True > & >)) const expr auto operator[](detail
 
requires True && forward_range (input_range< D< True > const & > &&sized_range< D< True > const & >)) const expr auto operator[](detail
 
requires True && forward_range (input_range< D< True >> &&sized_range< D< True >>)) const expr auto operator[](detail
 
requires True && forward_range (input_range< D< True > & > &&sized_range< D< True > & >)) const expr auto operator[](detail
 
requires True && forward_range (input_range< D< True > const & > &&sized_range< D< True > const & >)) const expr auto operator[](detail
 
requires True && forward_range (input_range< D< True >> &&sized_range< D< True >>)) const expr auto operator[](detail
 
constexpr auto front () -> range_reference_t< D< True >> requires True &&forward_range< D< True >>
 Access the first element in a range:
 
constexpr auto front () const -> range_reference_t< D< True > const > requires True &&forward_range< D< True > const >
 
requires True &&detail::can_empty_< D< True > > constexpr operator bool () noexcept(noexcept(ranges::empty(std::declval< D< True > & >())))
 
requires True &&detail::can_empty_< D< True > const > constexpr operator bool () const noexcept(noexcept(ranges::empty(std::declval< D< True > const & >())))
 
view_interfaceoperator= (view_interface &&)=default
 
view_interfaceoperator= (view_interface const &)=default
 
constexpr auto operator[] (range_difference_t< D< True >> n) -> range_reference_t< D< True >> requires True &&random_access_range< D< True >>
 Simple indexing:
 
constexpr auto operator[] (range_difference_t< D< True >> n) const -> range_reference_t< D< True > const > requires True &&random_access_range< D< True > const >
 
requires True &&input_range< D< True > & > constexpr auto operator[] (detail::slice_bounds< range_difference_t< D< True >>> offs) &
 Python-ic slicing:
 
requires True &&input_range< D< True > const & > constexpr auto operator[] (detail::slice_bounds< range_difference_t< D< True >>> offs) const &
 
requires True &&input_range< D< True > > constexpr auto operator[] (detail::slice_bounds< range_difference_t< D< True >>> offs) &&
 
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) &
 
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 &
 
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) &&
 
requires True &&input_range< D< True > & > constexpr auto operator[] (detail::slice_bounds< range_difference_t< D< True >>, end_fn > offs) &
 
requires True &&input_range< D< True > const & > constexpr auto operator[] (detail::slice_bounds< range_difference_t< D< True >>, end_fn > offs) const &
 
requires True &&input_range< D< True > > constexpr auto operator[] (detail::slice_bounds< range_difference_t< D< True >>, end_fn > offs) &&
 
constexpr auto size () -> detail::iter_size_t< iterator_t< D< True >>> requires True &&(Cardinality< 0) &&sized_sentinel_for< sentinel_t< D< True >>, iterator_t< D< True >>> &&forward_range< D< True >>
 If sized_sentinel_for<sentinel_t<Derived>, iterator_t<Derived>> is satisfied, and if Derived is a forward_range, then return end - begin cast to an unsigned integer.
 
constexpr auto size () const -> detail::iter_size_t< iterator_t< D< True >>> requires True &&(Cardinality< 0) &&sized_sentinel_for< sentinel_t< D< True > const >, iterator_t< D< True > const >> &&forward_range< D< True > const >
 
 view_interface (view_interface &&)=default
 
 view_interface (view_interface const &)=default
 

Static Public Attributes

static constexpr index_type extent = N
 

Additional Inherited Members

- Static Public Member Functions inherited from ranges::view_interface< span< T, N >,(N==dynamic_extent ? finite :static_cast< cardinality >(N))>
static constexpr auto size () noexcept -> std::size_t requires True &&(Cardinality >=0)
 If the size of the range is known at compile-time and finite, return it.
 
- Protected Types inherited from ranges::view_interface< span< T, N >,(N==dynamic_extent ? finite :static_cast< cardinality >(N))>
using D = meta::invoke< detail::dependent_< B >, span< T, N > >
 
- Protected Member Functions inherited from ranges::view_interface< span< T, N >,(N==dynamic_extent ? finite :static_cast< cardinality >(N))>
constexpr span< T, N > & derived () noexcept
 
constexpr span< T, N > const & derived () const noexcept