|
template<typename D = Derived, requires = (Same<D, Derived>())> |
detail::facade_iterator_t< D > | begin () |
|
template<typename D = Derived, requires = (Same<D, Derived>())> |
detail::facade_iterator_t< D const > | begin () const |
|
template<typename D = Derived, requires = (Same<D, Derived>())> |
detail::facade_sentinel_t< D > | end () |
|
template<typename D = Derived, requires = (Same<D, Derived>())> |
detail::facade_sentinel_t< D const > | end () const |
|
template<typename D = Derived, requires = (Same<D, Derived>() && BoundedView<D>() && BidirectionalView<D>())> |
range_reference_t< D > | back () |
| Access the last element in a range:
|
|
template<typename D = Derived, requires = (Same<D, Derived>() && BoundedView<D const>() && BidirectionalView<D const>())> |
range_reference_t< D const > | back () const |
|
constexpr bool | empty () const |
|
template<typename D = Derived, requires = (Same<D, Derived>())> |
range_reference_t< D > | front () |
| Access the first element in a range:
|
|
template<typename D = Derived, requires = (Same<D, Derived>())> |
range_reference_t< D const > | front () const |
|
constexpr | operator bool () const |
|
template<typename Container , typename D = Derived, typename Alloc = typename Container::allocator_type, requires = (detail::ConvertibleToContainer<D, Container>())> |
| operator Container () |
| Implicit conversion to something that looks like a container.
|
|
template<typename Container , typename D = Derived, typename Alloc = typename Container::allocator_type, requires = (detail::ConvertibleToContainer<D const, Container>())> |
| operator Container () const |
|
constexpr bool | operator! () const |
|
view_interface & | operator= (view_interface &&)=default |
|
view_interface & | operator= (view_interface const &)=default |
|
template<typename D = Derived, requires = (Same<D, Derived>() && RandomAccessView<D>())> |
auto | operator[] (range_difference_t< D > n) -> decltype(std::declval< D & >().begin()[n]) |
| Simple indexing:
|
|
template<typename D = Derived, requires = (Same<D, Derived>() && RandomAccessView<D const>())> |
auto | operator[] (range_difference_t< D > n) const -> decltype(std::declval< D const & >().begin()[n]) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
auto | operator[] (detail::slice_bounds< range_difference_t< D >> offs) -> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
| Python-ic slicing:
|
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
auto | operator[] (detail::slice_bounds< range_difference_t< D >> offs) const -> decltype(std::declval< Slice >()(std::declval< D const & >(), offs.from, offs.to)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
auto | operator[] (detail::slice_bounds< range_difference_t< D >, end_fn > offs) -> decltype(std::declval< Slice >()(std::declval< D & >(), offs.from, offs.to)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, requires = (Same<D, Derived>() && Cardinality >= 0)> |
constexpr range_size_t< D > | size () const |
| Access the size of the range, if it can be determined:
|
|
template<typename D = Derived, requires = (Same<D, Derived>() && Cardinality < 0 && SizedSentinel<range_sentinel_t<const D>, range_iterator_t<const D>>())> |
constexpr range_size_t< D > | size () const |
|
| view_interface (view_interface &&)=default |
|
| view_interface (view_interface const &)=default |
|