[#BloombergLP-bslalg-RbTreeUtil-findUniqueInsertLocation-0f]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslalg.adoc[bslalg]::xref:BloombergLP/bslalg/RbTreeUtil.adoc[RbTreeUtil]::findUniqueInsertLocation
:relfileprefix: ../../../
:mrdocs:

`findUniqueInsertLocation` overloads

== Synopses

Declared in `&lt;bslalg&lowbar;rbtreeutil&period;h&gt;`

Return the unique&hyphen;insert parent or matching node for `value`&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    class NODE&lowbar;VALUE&lowbar;COMPARATOR,
    class VALUE&gt;
static
xref:BloombergLP/bslalg/RbTreeNode.adoc[RbTreeNode]*
xref:BloombergLP/bslalg/RbTreeUtil/findUniqueInsertLocation-05.adoc[findUniqueInsertLocation](
    int* comparisonResult,
    xref:BloombergLP/bslalg/RbTreeAnchor.adoc[RbTreeAnchor]* tree,
    NODE&lowbar;VALUE&lowbar;COMPARATOR& comparator,
    VALUE const& value);
----

[.small]#xref:BloombergLP/bslalg/RbTreeUtil/findUniqueInsertLocation-05.adoc[_» more&period;&period;&period;_]#

Return the unique&hyphen;insert location for `value`, using `hint`&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    class NODE&lowbar;VALUE&lowbar;COMPARATOR,
    class VALUE&gt;
static
xref:BloombergLP/bslalg/RbTreeNode.adoc[RbTreeNode]*
xref:BloombergLP/bslalg/RbTreeUtil/findUniqueInsertLocation-0a.adoc[findUniqueInsertLocation](
    int* comparisonResult,
    xref:BloombergLP/bslalg/RbTreeAnchor.adoc[RbTreeAnchor]* tree,
    NODE&lowbar;VALUE&lowbar;COMPARATOR& comparator,
    VALUE const& value,
    xref:BloombergLP/bslalg/RbTreeNode.adoc[RbTreeNode]* hint);
----

[.small]#xref:BloombergLP/bslalg/RbTreeUtil/findUniqueInsertLocation-0a.adoc[_» more&period;&period;&period;_]#

== Return Value

address of the matching node, or the parent for inserting `value`

== Parameters

[cols="1,4"]
|===
| Name| Description
| *comparisonResult*
| set to 0 on match, else left&sol;right child sign
| *tree*
| tree in which to locate `value` or its insert parent
| *comparator*
| functor used to order nodes against `value`
| *value*
| value whose unique insert location is returned
| *hint*
| possible immediate successor of `value` in `tree`
|===


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