Find the upper bound for key, searching from the front.
Declared in <bdlcc_skiplist.h>
int
findUpperBound(
PairHandle* item,
KEY const& key) const;Find the upper bound for key searching from the front.
Load into the specified item a reference to the first element in this list whose key value is greater than the specified key found by searching the list from the front (in ascending order of key value). Return 0 on success, and a non-zero value (with no effect on item) if no such element exists.
0 on success, and a non-zero value if not found
| Name | Description |
|---|---|
| item | receives or identifies a list item |
| key | key value to bound |