Same as the preceding lowerBound overload, returning a modifiable node.

Synopsis

Declared in <bslalg_rbtreeutil.h>

template<
    class NODE_VALUE_COMPARATOR,
    class VALUE>
static
RbTreeNode*
lowerBound(
    RbTreeAnchor& tree,
    NODE_VALUE_COMPARATOR& comparator,
    VALUE const& value);

Return Value

address of the first node not ordered before value, or the sentinel

Parameters

Name

Description

tree

tree to search

comparator

functor used to order nodes against value

value

value whose lower bound is returned

Created with MrDocs