Add a unique key/data pair and return a raw reference to it.

Synopsis

Declared in <bdlcc_skiplist.h>

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

Description

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. Return 0 on success, and a non‐zero value (with no effect on the list) if key is already in the list.

Return Value

0 on success, and a non‐zero value if key already exists

Parameters

Name

Description

result

receives a reference to the inserted pair

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