[#BloombergLP-bdlcc-SkipList-0a-addUniqueR-09]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlcc.adoc[bdlcc]::xref:BloombergLP/bdlcc/SkipList-0a.adoc[SkipList]::addUniqueR
:relfileprefix: ../../../
:mrdocs:

`addUniqueR` overloads

== Synopses

Declared in `<bdlcc_skiplist.h>`

Add the specified `key` / `data` pair to this list. 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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
xref:BloombergLP/bdlcc/SkipList-0a/addUniqueR-0b.adoc[addUniqueR](
    KEY const& key,
    DATA const& data,
    bool* newFrontFlag = 0);
----

[.small]#xref:BloombergLP/bdlcc/SkipList-0a/addUniqueR-0b.adoc[_» more..._]#

Add the specified `key` / `data` pair to this list, 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). 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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
xref:BloombergLP/bdlcc/SkipList-0a/addUniqueR-05.adoc[addUniqueR](
    xref:BloombergLP/bdlcc/SkipList-0a/PairHandle.adoc[PairHandle]* result,
    KEY const& key,
    DATA const& data,
    bool* newFrontFlag = 0);
----

[.small]#xref:BloombergLP/bdlcc/SkipList-0a/addUniqueR-05.adoc[_» more..._]#


[.small]#Created with https://www.mrdocs.com[MrDocs]#