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

Yields the longest suffix in common between both input strings&period; Pointer&hyphen;wise, the returned result is a subset of input &quot;a&quot;&period;

== Synopsis

Declared in `&lt;absl&sol;strings&sol;match&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
std::string&lowbar;view
FindLongestCommonSuffix(
    std::string&lowbar;view a,
    std::string&lowbar;view b);
----

== Return Value

The longest common suffix, as a view into `a`&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *a*
| The first string to compare&period;
| *b*
| The second string to compare&period;
|===


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