Add the specified key / data pair to this list at the specified level, 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. The behavior is undefined if level is greater than the implementation-defined maximum level of this class, or if level is negative. Note that this method is provided for testing purposes.
Declared in <bdlcc_skiplist.h>
void
addAtLevelRawR(
Pair** result,
int level,
long long const& key,
RecurringEventData const& data,
bool* newFrontFlag = 0);