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 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. The item reference must be released (using releaseReferenceRaw) when it is no longer needed.
Declared in <bdlcc_skiplist.h>
int
findLowerBoundRaw(
Pair** item,
long long const& key) const;