lower_bound overloads
Synopses
Declared in <bslstl_set.h>
Return an iterator providing modifiable access to the first (i.e., ordered least) value_type object in this set greater‐than or equal‐to the specified key, and the past‐the‐end iterator if this set does not contain a value_type object 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 set, while preserving its ordering.
iterator
lower_bound(key_type const& key);Return an iterator providing non‐modifiable access to the first (i.e., ordered least) value_type object in this set greater‐than or equal‐to the specified key, and the past‐the‐end iterator if this set 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 set, while preserving its ordering.
const_iterator
lower_bound(key_type const& key) const;Return an iterator providing modifiable access to the first (i.e., ordered least) value_type object in this set greater‐than or equal‐to the specified key, and the past‐the‐end iterator if this set does not contain a value_type object 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 set, while preserving its ordering.
template<class LOOKUP_KEY>
iterator
lower_bound(LOOKUP_KEY const& key)
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 set greater‐than or equal‐to the specified key, and the past‐the‐end iterator if this set 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 set, while preserving its ordering.
template<class LOOKUP_KEY>
const_iterator
lower_bound(LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
LOOKUP_KEY>::value;Created with MrDocs