find overloads

Synopses

Declared in <bslalg_rbtreeutil.h>

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

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

» more...

Return the address of the leftmost node holding the specified value in the specified tree (organized according to the specified comparator) if found, and return `tree.sentinel()' otherwise. `COMPARATOR shall be a functor providing two methods that can be called as if they had the following signatures: ` bool operator()(const RbTreeNode&, const VALUE&) const; bool operator()(const VALUE&, const RbTreeNode&) const; ` The behavior is undefined unless comparator provides a strict weak ordering on objects of type VALUE, and tree is well‐formed (see isWellFormed).

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

» more...

Created with MrDocs