findUniqueInsertLocation overloads
Declared in <bslalg_rbtreeutil.h>
Return the unique-insert parent or matching node for value.
template<
class NODE_VALUE_COMPARATOR,
class VALUE>
static
RbTreeNode*
findUniqueInsertLocation(
int* comparisonResult,
RbTreeAnchor* tree,
NODE_VALUE_COMPARATOR& comparator,
VALUE const& value);
» more...
Return the unique-insert location for value, using hint.
template<
class NODE_VALUE_COMPARATOR,
class VALUE>
static
RbTreeNode*
findUniqueInsertLocation(
int* comparisonResult,
RbTreeAnchor* tree,
NODE_VALUE_COMPARATOR& comparator,
VALUE const& value,
RbTreeNode* hint);
» more...
address of the matching node, or the parent for inserting value
| 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 |