Add the specified key / data pair to this list, and load into the specified result a reference to the pair in the list. Search for the correct position for key from the back of the list (in descending order by key value). The result reference must be released (using releaseReferenceRaw) when it is no longer needed. Load into the optionally specified newFrontFlag a true value if the pair is at the front of the list, and a false value otherwise.
Declared in <bdlcc_skiplist.h>
void
addRawR(
Pair** result,
KEY const& key,
DATA const& data,
bool* newFrontFlag = 0);