Add a key/data pair at level, searching from the back.

Synopsis

Declared in <bdlcc_skiplist.h>

void
addAtLevelRawR(
    Pair** result,
    int level,
    KEY const& key,
    DATA const& data,
    bool* newFrontFlag = 0);

Description

Insert key/`data` at the specified level, searching from the back.

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.

Parameters

Name

Description

result

receives a reference to the inserted pair

level

skip‐list level at which to insert

key

key of the pair

data

data associated with key

newFrontFlag

if non‐null, set to whether the pair is at the front

Created with MrDocs