[#BloombergLP-ball-CategoryManager_RadixTree-findLongestCommonPrefix-0a]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/ball.adoc[ball]::xref:BloombergLP/ball/CategoryManager_RadixTree.adoc[CategoryManager_RadixTree]::findLongestCommonPrefix
:relfileprefix: ../../../
:mrdocs:

Return the longest matching key prefix with an associated value.

== Synopses

Declared in `<ball_categorymanager_radixtree.h>`

Return the longest matching key prefix with an associated value.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
std::string_view
xref:BloombergLP/ball/CategoryManager_RadixTree/findLongestCommonPrefix-09.adoc[findLongestCommonPrefix](
    xref:BloombergLP/ball/CategoryManager_RadixTree/OptValueCRef.adoc[OptValueCRef]* value,
    std::string_view const& key) const;
----

[.small]#xref:BloombergLP/ball/CategoryManager_RadixTree/findLongestCommonPrefix-09.adoc[_» more..._]#

Return the longest matching key prefix with an associated value.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
std::string_view
xref:BloombergLP/ball/CategoryManager_RadixTree/findLongestCommonPrefix-03.adoc[findLongestCommonPrefix](
    xref:BloombergLP/ball/CategoryManager_RadixTree/OptValueRef.adoc[OptValueRef]* value,
    std::string_view const& key);
----

[.small]#xref:BloombergLP/ball/CategoryManager_RadixTree/findLongestCommonPrefix-03.adoc[_» more..._]#

== Return Value

longest matching prefix, or an empty string view if none

== Parameters

[cols="1,4"]
|===
| Name| Description
| *value*
| optional out‐parameter for the matched value
| *key*
| key whose longest matching prefix is sought
|===


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