#include "./types.h"
#include <span>
Go to the source code of this file.
|
template<typename IteratorLh , typename IteratorRh > |
constexpr bool | emlabcpp::operator== (view< IteratorLh > const &lh, view< IteratorRh > const &rh) |
|
template<typename IteratorLh , typename IteratorRh > |
constexpr bool | emlabcpp::operator!= (view< IteratorLh > const &lh, view< IteratorRh > const &rh) |
|
template<range_container Container> |
| emlabcpp::view (Container &cont) -> view< iterator_of_t< Container > > |
| The container deduction guide uses iterator_of_t. More...
|
|
template<typename Iter > |
constexpr view< Iter > | emlabcpp::view_n (Iter begin, std::size_t const n) |
| Creates view over 'n' items of dataset starting at 'begin' This does not check validity of the range! More...
|
|
template<data_container Container> |
constexpr auto | emlabcpp::data_view (Container &cont) |
|
template<range_container Container> |
constexpr view< iterator_of_t< Container > > | emlabcpp::trim_view (Container &cont, float const r) |
| Creates the view over over Container, where we ignore first r*size/2 items and last r*size/2 items. More...
|
|
constexpr auto | emlabcpp::reversed (referenceable_container auto &container) -> view< decltype(std::rbegin(container)) > |
| Returns view to the Container in reverse order. More...
|
|
template<typename Iterator , typename EndIterator > |
void | emlabcpp::string_serialize_view (auto &&w, view< Iterator, EndIterator > const &output) |
|