|
template<typename Val , requires = (Integral<Val>())> |
iota_view< Val > | operator() (Val value) const |
|
template<typename Val > |
meta::if_c< (bool) Integral< Val >), detail::take_exactly_view_< iota_view< Val >, true > > | operator() (Val from, Val to) const |
|
constexpr | iota_view (int from, To to) |
|
detail::facade_iterator_t< D > | begin () |
|
detail::facade_iterator_t< D const > | begin () const |
|
detail::facade_sentinel_t< D > | end () |
|
detail::facade_sentinel_t< D const > | end () const |
|
range_reference_t< D > | back () |
| Access the last element in a range:
|
|
range_reference_t< D const > | back () 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_t< D > n) -> decltype(std::declval< D & >().begin()[n]) |
| Simple indexing:
|
|
auto | operator[] (range_difference_t< D > n) const -> decltype(std::declval< D const & >().begin()[n]) |
|
auto | operator[] (detail::slice_bounds< range_difference_t< D >> offs) -> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
| Python-ic slicing:
|
|
auto | operator[] (detail::slice_bounds< range_difference_t< D >> offs) const -> decltype(std::declval< Slice >()(std::declval< D const & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_t< D >, detail::from_end_< range_difference_t< D >>> offs) -> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_t< D >, detail::from_end_< range_difference_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_t< D >>, detail::from_end_< range_difference_t< D >>> offs) -> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< detail::from_end_< range_difference_t< D >>, detail::from_end_< range_difference_t< D >>> offs) const -> decltype(std::declval< Slice >()(std::declval< D const & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_t< D >, end_fn > offs) -> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
|
auto | operator[] (detail::slice_bounds< range_difference_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_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_t< D >>, end_fn > offs) const -> decltype(std::declval< Slice >()(std::declval< D const & >(), offs.from, offs.to)) |
|
constexpr range_size_t< D > | size () const |
| Access the size of the range, if it can be determined:
|
|
constexpr range_size_t< D > | size () const |
|
| view_interface (view_interface &&)=default |
|
| view_interface (view_interface const &)=default |
|