Add a unique pair from the back and load a handle into result.

Synopsis

Declared in <bdlcc_skiplist.h>

int
addUniqueR(
    PairHandle* 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). 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