c_prev_permutation overloads
Declared in <absl/algorithm/container.h>
Container-based version of the <algorithm> std::prev_permutation() function to rearrange a container's elements into the next lexicographically lesser permutation.
template<typename C>
constexpr
bool
c_prev_permutation(C& c);
» more...
Overload of c_prev_permutation() for performing a lexicographical comparison using a comp operator instead of operator<.
template<
typename C,
typename LessThan>
constexpr
bool
c_prev_permutation(
C& c,
LessThan&& comp);
» more...
true if a previous permutation exists, false if the range was reset to the last permutation.
| Name | Description |
|---|---|
| c | The container to rearrange. |
| comp | The comparison used to order the elements. |