#include <algorithm>
#include <cstddef>
#include <ranges>
#include <string_view>
#include <utility>
Go to the source code of this file.
|
#define | FWD(x) std::forward<decltype(x)>(x) |
|
|
template<auto x> |
using | constant = std::integral_constant<decltype(x), x> |
|
|
auto | front (std::tuple<>) -> types<> |
|
auto | pop_front (std::tuple<>) -> types<> |
|
template<typename T , typename ... Ts> |
auto | front (std::tuple< T, Ts... >) -> T |
|
template<typename T , typename ... Ts> |
auto | pop_front (std::tuple< T, Ts... >) -> types< Ts... > |
|
template<std::size_t N> |
| fixed_string (const char(&)[N]) -> fixed_string< N - 1 > |
|
template<std::size_t N0, std::size_t N1> |
constexpr auto | operator+ (fixed_string< N0 > s0, fixed_string< N1 > s1) |
|
constexpr auto | slice (std::string_view s, std::size_t b, std::size_t e) |
|
◆ FWD
#define FWD |
( |
| x | ) |
std::forward<decltype(x)>(x) |
◆ constant
template<auto x>
using constant = std::integral_constant<decltype(x), x> |
◆ fixed_string()
template<std::size_t N>
fixed_string |
( |
const | char(&)[N] | ) |
-> fixed_string< N - 1 > |
◆ front() [1/2]
template<typename
T , typename ... Ts>
auto front |
( |
std::tuple< T, Ts... > | | ) |
-> T |
◆ front() [2/2]
auto front |
( |
std::tuple<> | | ) |
-> types<> |
◆ operator+()
template<std::size_t N0, std::size_t N1>
◆ pop_front() [1/2]
template<typename
T , typename ... Ts>
auto pop_front |
( |
std::tuple< T, Ts... > | | ) |
-> types< Ts... > |
◆ pop_front() [2/2]
auto pop_front |
( |
std::tuple<> | | ) |
-> types<> |
◆ slice()
auto slice |
( |
std::string_view | s, |
|
|
std::size_t | b, |
|
|
std::size_t | e ) |
|
constexpr |