Return the first node ordered after value, or the sentinel.
Declared in <bslalg_rbtreeutil.h>
template<
class NODE_VALUE_COMPARATOR,
class VALUE>
static
RbTreeNode*
upperBound(
RbTreeAnchor& tree,
NODE_VALUE_COMPARATOR& comparator,
VALUE const& value);
Return the address of the leftmost node holding the smallest value greater-than value in the specified tree.
address of the first node ordered after value, or the sentinel
| Name | Description |
|---|---|
| tree | tree to search |
| comparator | functor used to order nodes against value |
| value | value whose upper bound is returned |