[#absl-c_partition] = xref:absl.adoc[absl]::c_partition :relfileprefix: ../ :mrdocs: Container‐based version of the <algorithm> `std::partition()` function to rearrange all elements in a container in such a way that all elements for which `pred` returns `true` precede all those for which it returns `false`, returning an iterator to the first element of the second group. == Synopsis Declared in `<absl/algorithm/container.h>` [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template< typename C, typename Pred> constexpr /* implementation-defined */ c_partition( C& c, Pred&& pred); ---- == Return Value An iterator to the first element of the second group. == Parameters [cols="1,4"] |=== | Name| Description | *c* | The container to partition. | *pred* | The predicate used to partition the elements. |=== [.small]#Created with https://www.mrdocs.com[MrDocs]#