Return a const iterator to the first element with key not less than key.
Declared in <bslstl_multimap.h>
template<class LOOKUP_KEY>
const_iterator
lower_bound(LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
LOOKUP_KEY>::value;Return an iterator providing non-modifiable access to the first (i.e., ordered least) value_type object in this multimap whose key is greater-than or equal-to the specified key, and the past-the-end iterator if this multimap does not contain a value_type object whose key is greater-than or equal-to key. Note that this function returns the first position before which a value_type object having an equivalent key could be inserted into the ordered sequence maintained by this multimap, while preserving its ordering.
Note: implemented inline due to Sun CC compilation error.
const iterator to the lower bound, or end()
| Name | Description |
|---|---|
| key | key value to look up |