Find the first entry whose key is not ordered before the given value.
Synopsis
Declared in <indirectmap.h>
iterator
lower_bound(K const& key);Return Value
An iterator to the first such entry, or end() if none.
Parameters
Name |
Description |
key |
The value whose address is used as the lookup key. |
Created with MrDocs