[#absl-c_prev_permutation-00]
= xref:absl.adoc[absl]::c_prev_permutation
:relfileprefix: ../
:mrdocs:

Container‐based version of the <algorithm> `std::prev_permutation()` function to rearrange a container's elements into the next lexicographically lesser permutation.

== Synopsis

Declared in `<absl/algorithm/container.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<typename C>
constexpr
bool
c_prev_permutation(C& c);
----

== Return Value

`true` if a previous permutation exists, `false` if the range was reset to the last permutation.

== Parameters

[cols="1,4"]
|===
| Name| Description
| *c*
| The container to rearrange.
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#