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

`c_prev_permutation` overloads

== Synopses

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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<typename C>
constexpr
bool
xref:absl/c_prev_permutation-00.adoc[c_prev_permutation](C& c);
----

[.small]#xref:absl/c_prev_permutation-00.adoc[_» more..._]#

Overload of `c_prev_permutation()` for performing a lexicographical comparison using a `comp` operator instead of `operator<`.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    typename C,
    typename LessThan>
constexpr
bool
xref:absl/c_prev_permutation-0b.adoc[c_prev_permutation](
    C& c,
    LessThan&& comp);
----

[.small]#xref:absl/c_prev_permutation-0b.adoc[_» more..._]#

== 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.
| *comp*
| The comparison used to order the elements.
|===


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