Find key from the front and load a raw reference into item.
Synopsis
Declared in <bdlcc_skiplist.h>
int
findRaw(
Pair** item,
KEY const& key) const;
Description
Find the element with the specified key searching from the front.
Load into the specified item a reference to the element in this list with the specified key found by searching the list from the front (in ascending order of key value). Return 0 on success, and a non‐zero value (with no effect on item) if no such element exists. If there are multiple elements in the list with the key, it is undefined which one is returned. The item reference must be released (using releaseReferenceRaw) when it is no longer needed.
Return Value
0 on success, and a non‐zero value if not found
Parameters
Name |
Description |
item |
receives or identifies a list item |
key |
key to search for |
Created with MrDocs