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

Synopses

Declared in <indirectmap.h>

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

iterator
lower_bound(K const& key);

» more...

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

const_iterator
lower_bound(K const& key) const;

» more...

Return Value

  • An iterator to the first such entry, or end() if none.

  • A const 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