|
template<typename I , typename S , typename C = less, typename P = identity> |
auto | ranges::sort (I first, S end_, C pred=C{}, P proj=P{}) -> I requires sortable< I, C, P > &&random_access_iterator< I > &&sentinel_for< S, I > |
| function template sort
|
|
template<typename Rng , typename C = less, typename P = identity> |
auto | ranges::sort (Rng &&rng, C pred=C{}, P proj=P{}) -> safe_iterator_t< Rng > requires sortable< iterator_t< Rng >, C, P > &&random_access_range< Rng > |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|