indirectmap::lower_bound

Find the first entry whose key is not ordered before the given value.

Synopsis

Declared in <indirectmap.h>

const_iterator
lower_bound(K const& key) const;

Return Value

A const iterator to the first such entry, or end() if none.

Parameters

NameDescription
keyThe value whose address is used as the lookup key.