Same as the preceding lowerBound overload, returning a modifiable node.
Declared in <bslalg_rbtreeutil.h>
template<
class NODE_VALUE_COMPARATOR,
class VALUE>
static
RbTreeNode*
lowerBound(
RbTreeAnchor& tree,
NODE_VALUE_COMPARATOR& comparator,
VALUE const& value);
address of the first node not ordered before value, or the sentinel
| Name | Description |
|---|---|
| tree | tree to search |
| comparator | functor used to order nodes against value |
| value | value whose lower bound is returned |