lowerBound overloads

Synopses

Declared in <bslalg_rbtreeutil.h>

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

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

» more...

Return the first node not ordered before value, or the sentinel.

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

» more...

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