Add a unique key/data pair at the specified level.
Declared in <bdlcc_skiplist.h>
int
addAtLevelUniqueRaw(
Pair** result,
int level,
KEY const& key,
DATA const& data,
bool* newFrontFlag = 0);The result reference must be released (using releaseReferenceRaw) when it is no longer needed. Load into the 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. Return 0 on success, and a non-zero value (with no effect on the list) if key is already in the list. Note that this method is provided for testing purposes.
0 on success, and a non-zero value if key already exists
| 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 |