|
template<typename Rng , typename C = less, typename P = identity> |
requires input_range< Rng > &&indirect_strict_weak_order< C, projected< iterator_t< Rng >, P > > &&constexpr indirectly_copyable_storable< iterator_t< Rng >, range_value_t< Rng > * > minmax_result< range_value_t< Rng > > | ranges::minmax (Rng &&rng, C pred=C{}, P proj=P{}) |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|
template<typename T , typename C = less, typename P = identity> |
requires copyable< T > &&constexpr indirect_strict_weak_order< C, projected< T const *, P > > minmax_result< T > | ranges::minmax (std::initializer_list< T > const &&rng, C pred=C{}, P proj=P{}) |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|
template<typename T , typename C = less, typename P = identity> |
requires constexpr indirect_strict_weak_order< C, projected< T const *, P > > minmax_result< T const & > | ranges::minmax (T const &a, T const &b, C pred=C{}, P proj=P{}) |
| function template minmax
|
|