Eager, mutating, composable algorithms.
More...
|
template<typename Cont , typename T > |
using | ranges::push_back_t = decltype(static_cast< void >(unwrap_reference(std::declval< Cont & >()).push_back(std::declval< T >()))) |
|
template<typename Cont , typename Rng > |
using | ranges::insert_t = decltype(static_cast< void >(ranges::insert(std::declval< Cont & >(), std::declval< sentinel_t< Cont > >(), std::declval< Rng >()))) |
|
template<typename Cont , typename T > |
using | ranges::push_front_t = decltype(static_cast< void >(unwrap_reference(std::declval< Cont & >()).push_front(std::declval< T >()))) |
|
|
| ranges::template (typename ActionFn, typename Rng)(concept(invocable_action_closure_)(ActionFn |
|
| ranges::template (typename Cont, typename T)(AND(!range< T >) AND const ructible_from< range_value_t< Cont > |
|
T push_back_t< Cont, T > | ranges::push_back (Cont &&cont, T &&t) |
|
| ranges::template (typename Cont, typename Rng)(AND range< Rng >) insert_t< Cont |
|
Rng | ranges::push_back (Cont &&cont, Rng &&rng) |
|
T push_front_t< Cont, T > | ranges::push_front (Cont &&cont, T &&t) |
|
Rng | ranges::push_front (Cont &&cont, Rng &&rng) |
|
Eager, mutating, composable algorithms.
◆ invocable_action_closure
template<typename ActionFn , typename Rng >
Initial value:=
The invocable_action_closure_ concept.