Container-based version of the <algorithm> std::prev_permutation() function to rearrange a container's elements into the next lexicographically lesser permutation.
Declared in <absl/algorithm/container.h>
template<typename C>
constexpr
bool
c_prev_permutation(C& c);
true if a previous permutation exists, false if the range was reset to the last permutation.
| Name | Description |
|---|---|
| c | The container to rearrange. |