[#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 `<bslalg_rbtreeutil.h>` Return the unique‐insert parent or matching node for `value`. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template< class NODE_VALUE_COMPARATOR, class VALUE> 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_VALUE_COMPARATOR& comparator, VALUE const& value); ---- [.small]#xref:BloombergLP/bslalg/RbTreeUtil/findUniqueInsertLocation-05.adoc[_» more..._]# Return the unique‐insert location for `value`, using `hint`. [source,cpp,subs="verbatim,replacements,macros,-callouts"] ---- template< class NODE_VALUE_COMPARATOR, class VALUE> 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_VALUE_COMPARATOR& comparator, VALUE const& value, xref:BloombergLP/bslalg/RbTreeNode.adoc[RbTreeNode]* hint); ---- [.small]#xref:BloombergLP/bslalg/RbTreeUtil/findUniqueInsertLocation-0a.adoc[_» more..._]# == 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/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]#