Load into the specified item a reference to the element in this list with 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. If there are multiple elements in the list with the key, it is undefined which one is returned. The item reference must be released (using releaseReferenceRaw) when it is no longer needed.

Synopsis

Declared in <bdlcc_skiplist.h>

int
findRRaw(
    Pair** item,
    long long const& key) const;

Created with MrDocs