bsl::multiset::lower_bound

Synopsis

Declared in <bslstl_multiset.h>

template<class LOOKUP_KEY>
const_iterator
lower_bound(LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
                                                   LOOKUP_KEY>::value;

Description

Return an iterator providing non-modifiable access to the first (i.e., ordered least) value_type object in this multiset greater-than or equal-to the specified key, and the past-the-end iterator if this multiset does not contain a value_type greater-than or equal-to key. Note that this function returns the first position before which a value_type object equivalent to key could be inserted into the ordered sequence maintained by this multiset, while preserving its ordering.

Note: implemented inline due to Sun CC compilation error.

Return Value

const iterator to the lower bound, or end()

Parameters

Name	Description
key	transparent key value to look up