Eager, mutating, composable algorithms.  
More...
|  | 
| 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_back_t = decltype(static_cast< void >(unwrap_reference(std::declval< Cont & >()).push_back(std::declval< T >()))) | 
|  | 
| template<typename Cont , typename T > | 
| using | ranges::push_front_t = decltype(static_cast< void >(unwrap_reference(std::declval< Cont & >()).push_front(std::declval< T >()))) | 
|  | 
|  | 
| template<typename Cont , typename Rng > requires lvalue_container_like<Cont> && range<Rng>
 | 
| insert_t< Cont, Rng > | ranges::push_back (Cont &&cont, Rng &&rng) | 
|  | 
| template<typename Cont , typename T > requires lvalue_container_like<Cont> && (!range<T>) && constructible_from<range_value_t<Cont>, T>
 | 
| push_back_t< Cont, T > | ranges::push_back (Cont &&cont, T &&t) | 
|  | 
| template<typename Cont , typename Rng > requires lvalue_container_like<Cont> && range<Rng>
 | 
| insert_t< Cont, Rng > | ranges::push_front (Cont &&cont, Rng &&rng) | 
|  | 
| template<typename Cont , typename T > requires lvalue_container_like<Cont> && (!range<T>) && constructible_from<range_value_t<Cont>, T>
 | 
| push_front_t< Cont, T > | ranges::push_front (Cont &&cont, T &&t) | 
|  | 
Eager, mutating, composable algorithms. 
◆ make_action_closure