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

Yields the longest suffix in common between both input strings. Pointer‐wise, the returned result is a subset of input "a".

== Synopsis

Declared in `<absl/strings/match.h>`

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

== Return Value

The longest common suffix, as a view into `a`.

== Parameters

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


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