stlab 2.3.0
Modern, modular C++ algorithms, data structures, and concurrency primitives
Loading...
Searching...
No Matches
tuple_algorithm

Detailed Description

Tuple algorithms and utilities (including for future combiners).

Classes

class  stlab::placeholder
struct  stlab::remove_placeholder< Tuple >

Typedefs

template<typename... Ts>
using stlab::tuple_cat_t
template<typename... Ts>
using stlab::voidless_tuple
template<typename... Ts>
using stlab::placeholder_tuple
template<typename... Ts>
using stlab::optional_placeholder_tuple

Functions

template<typename T, typename Op>
auto stlab::tuple_find (const T &t, Op op) -> std::size_t
template<typename T, typename Op>
void stlab::tuple_for_each (T &t, Op op)
template<typename T, typename F, typename D>
auto stlab::get_i (T &t, std::size_t index, F f, D &&default_v)
template<typename T, typename F>
auto stlab::void_i (T &t, std::size_t index, F &&f)
template<class F, class Tuple>
constexpr auto stlab::apply_ignore_placeholders (F &&f, Tuple &&t) -> decltype(auto)
template<class Seq, class F, class Tuple>
constexpr auto stlab::apply_indexed (F &&f, Tuple &&t) -> decltype(auto)