|
iterator | begin () const noexcept |
|
constexpr pointer | data () const noexcept |
|
constexpr bool | empty () const noexcept |
|
iterator | end () const noexcept |
|
template<std::ptrdiff_t Count, requires = (N == dynamic_extent || Count <= N)> |
constexpr span< T, Count > | first () const noexcept |
|
constexpr span< T > | first (index_type count) const noexcept |
|
template<std::ptrdiff_t Count, requires = (N == dynamic_extent || Count <= N)> |
constexpr span< T, Count > | last () const noexcept |
|
constexpr span< T > | last (index_type count) const noexcept |
|
constexpr index_type | length () const noexcept |
|
constexpr index_type | length_bytes () const noexcept |
|
constexpr reference | operator() (index_type idx) const noexcept |
|
constexpr reference | operator[] (index_type idx) const noexcept |
|
reverse_iterator | rbegin () const noexcept |
|
reverse_iterator | rend () const noexcept |
|
constexpr index_type | size () const noexcept |
|
constexpr index_type | size_bytes () const noexcept |
|
constexpr | span (std::nullptr_t) noexcept |
|
constexpr | span (pointer ptr, index_type count) noexcept |
|
constexpr | span (pointer first, pointer last) noexcept |
|
template<typename Int , requires = (SignedIntegral<Int>())> |
constexpr | span (pointer first, Int count) noexcept |
|
template<typename Rng , requires = (ConversionConstraint<Rng>())> |
constexpr | span (Rng &&rng) |
|
template<std::ptrdiff_t Offset, std::ptrdiff_t Count = dynamic_extent, requires = (Count == dynamic_extent || (0 <= Count && (N == dynamic_extent || Offset + Count <= N)))> |
constexpr span< T, Count > | subspan () const noexcept |
|
constexpr span< T > | subspan (index_type offset, index_type count=dynamic_extent) const noexcept |
|
range_reference_t< D > | back () |
| Access the last element in a range:
|
|
range_reference_t< D const > | back () const |
|
constexpr bool | empty () const |
|
constexpr bool | empty () const |
|
range_reference_t< D > | front () |
| Access the first element in a range:
|
|
range_reference_t< D const > | front () const |
|
constexpr | operator bool () const |
|
| operator Container () |
| Implicit conversion to something that looks like a container.
|
|
| operator Container () const |
|
constexpr bool | operator! () const |
|
view_interface & | operator= (view_interface &&)=default |
|
view_interface & | operator= (view_interface const &)=default |
|
auto | operator[] (range_difference_type_t< D > n) -> decltype(std::declval< D & >().begin()[n]) |
| Simple indexing:
|
|
auto | operator[] (range_difference_type_t< D > n) const -> decltype(std::declval< D const & >().begin()[n]) |
|
auto | operator[] (detail::slice_bounds< range_difference_type_t< D >> offs) &-> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
| Python-ic slicing:
|
|
auto | operator[] (detail::slice_bounds< range_difference_type_t< D >> offs) const &-> decltype(std::declval< Slice >()(std::declval< D const & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_type_t< D >> offs) &&-> decltype(std::declval< Slice >()(std::declval< D >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_type_t< D >, detail::from_end_< range_difference_type_t< D >>> offs) &-> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_type_t< D >, detail::from_end_< range_difference_type_t< D >>> offs) const &-> decltype(std::declval< Slice >()(std::declval< D const & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_type_t< D >, detail::from_end_< range_difference_type_t< D >>> offs) &&-> decltype(std::declval< Slice >()(std::declval< D >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< detail::from_end_< range_difference_type_t< D >>, detail::from_end_< range_difference_type_t< D >>> offs) &-> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< detail::from_end_< range_difference_type_t< D >>, detail::from_end_< range_difference_type_t< D >>> offs) const &-> decltype(std::declval< Slice >()(std::declval< D const & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< detail::from_end_< range_difference_type_t< D >>, detail::from_end_< range_difference_type_t< D >>> offs) &&-> decltype(std::declval< Slice >()(std::declval< D >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_type_t< D >, end_fn > offs) &-> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_type_t< D >, end_fn > offs) const &-> decltype(std::declval< Slice >()(std::declval< D const & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_type_t< D >, end_fn > offs) &&-> decltype(std::declval< Slice >()(std::declval< D >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< detail::from_end_< range_difference_type_t< D >>, end_fn > offs) &-> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< detail::from_end_< range_difference_type_t< D >>, end_fn > offs) const &-> decltype(std::declval< Slice >()(std::declval< D const & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< detail::from_end_< range_difference_type_t< D >>, end_fn > offs) &&-> decltype(std::declval< Slice >()(std::declval< D >(), offs.from, offs.to)) |
|
constexpr range_size_type_t< D > | size () const |
| Access the size of the range, if it can be determined:
|
|
constexpr range_size_type_t< D > | size () const |
|
| view_interface (view_interface &&)=default |
|
| view_interface (view_interface const &)=default |
|