[#absl-c_adjacent_find-01]
= xref:absl.adoc[absl]::c&lowbar;adjacent&lowbar;find
:relfileprefix: ../
:mrdocs:

`c&lowbar;adjacent&lowbar;find` overloads

== Synopses

Declared in `&lt;absl&sol;algorithm&sol;container&period;h&gt;`

Container&hyphen;based version of the &lt;algorithm&gt; `std&colon;&colon;adjacent&lowbar;find()` function to find equal adjacent elements within a container&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;typename Sequence&gt;
constexpr
&sol;&ast; implementation-defined &ast;&sol;
xref:absl/c_adjacent_find-04.adoc[c&lowbar;adjacent&lowbar;find](Sequence& sequence);
----

[.small]#xref:absl/c_adjacent_find-04.adoc[_» more&period;&period;&period;_]#

Overload of `c&lowbar;adjacent&lowbar;find()` for using a predicate evaluation other than `&equals;&equals;` as the function&apos;s test condition&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    typename Sequence,
    typename BinaryPredicate&gt;
constexpr
&sol;&ast; implementation-defined &ast;&sol;
xref:absl/c_adjacent_find-05.adoc[c&lowbar;adjacent&lowbar;find](
    Sequence& sequence,
    BinaryPredicate&& pred);
----

[.small]#xref:absl/c_adjacent_find-05.adoc[_» more&period;&period;&period;_]#

== Return Value

* An iterator to the first of the first pair of equal adjacent elements, or the end iterator if none is found&period;
* An iterator to the first of the first matching adjacent pair, or the end iterator if none is found&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *sequence*
| The container to search&period;
| *pred*
| The binary predicate used to compare adjacent elements&period;
|===


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