|
base_range_t & | base () |
|
base_range_t const & | base () const |
|
view_adaptor & | operator= (view_adaptor &&)=default |
|
view_adaptor & | operator= (view_adaptor const &)=default |
|
| view_adaptor (view_adaptor &&)=default |
|
| view_adaptor (view_adaptor const &)=default |
|
constexpr | view_adaptor (BaseRng &&rng) |
|
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>() && BoundedRange<D>() && BidirectionalRange<D>())> |
range_reference_t< D > | back () |
| Access the last element in a range:
|
|
template<typename D = Derived, requires = (Same<D, Derived>() && BoundedRange<D const>() && BidirectionalRange<D const>())> |
range_reference_t< D const > | back () const |
|
constexpr bool | empty () const |
|
template<class D = Derived, requires = (Same<D, Derived>() && Cardinality < 0 && ForwardRange<D const>())> |
constexpr bool | empty () const |
|
template<typename D = Derived, requires = (Same<D, Derived>() && ForwardRange<D>())> |
range_reference_t< D > | front () |
| Access the first element in a range:
|
|
template<typename D = Derived, requires = (Same<D, Derived>() && ForwardRange<D const>())> |
range_reference_t< D const > | front () const |
|
template<class D = Derived, requires = (Same<D, Derived>() && (Cardinality >= 0 || ForwardRange<D const>()))> |
constexpr | operator bool () const |
|
template<typename Container , typename D = Derived, typename = 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 = typename Container::allocator_type, requires = (detail::ConvertibleToContainer<D const, Container>())> |
| operator Container () const |
|
template<class D = Derived, requires = (Same<D, Derived>() && (Cardinality >= 0 || ForwardRange<D 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>() && RandomAccessRange<D>())> |
auto | operator[] (range_difference_type_t< D > n) -> decltype(std::declval< D &>().begin()[n]) |
| Simple indexing:
|
|
template<typename D = Derived, requires = (Same<D, Derived>() && RandomAccessRange<D const>())> |
auto | operator[] (range_difference_type_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_type_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_type_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_type_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_type_t< D >, detail::from_end_< range_difference_type_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_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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
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)) |
|
template<typename D = Derived, typename Slice = view::slice_fn, requires = (Same<D, Derived>())> |
auto | operator[] (detail::slice_bounds< range_difference_type_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_type_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< range_difference_type_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_type_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_type_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_type_t< D >>, end_fn > offs) &&-> decltype(std::declval< Slice >()(std::declval< D >(), offs.from, offs.to)) |
|
template<typename D = Derived, requires = (Same<D, Derived>() && Cardinality >= 0)> |
constexpr range_size_type_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<sentinel_t<D const>, iterator_t<D const>>() && ForwardRange<D const>())> |
constexpr range_size_type_t< D > | size () const |
|
| view_interface (view_interface &&)=default |
|
| view_interface (view_interface const &)=default |
|