Find the lower bound for key, searching from the back.

Synopsis

Declared in <bdlcc_skiplist.h>

int
findLowerBoundR(
    PairHandle* item,
    KEY const& key) const;

Description

Find the lower bound for key searching from the back.

Load into the specified item a reference to the first element in this list whose key value is not less than the specified key found by searching the list from the back (in descending order of key value). Return 0 on success, and a non‐zero value (with no effect on item) if no such element exists.

Return Value

0 on success, and a non‐zero value if not found

Parameters

Name

Description

item

receives or identifies a list item

key

key value to bound

Created with MrDocs