[#bsl-set-0d-lower_bound-0b]
= xref:bsl.adoc[bsl]::xref:bsl/set-0d.adoc[set]::lower_bound
:relfileprefix: ../../
:mrdocs:

`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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/set-0d/iterator.adoc[iterator]
xref:bsl/set-0d/lower_bound-02.adoc[lower_bound](xref:bsl/set-0d/key_type.adoc[key_type] const& key);
----

[.small]#xref:bsl/set-0d/lower_bound-02.adoc[_» more..._]#

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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
xref:bsl/set-0d/const_iterator.adoc[const_iterator]
xref:bsl/set-0d/lower_bound-05.adoc[lower_bound](xref:bsl/set-0d/key_type.adoc[key_type] const& key) const;
----

[.small]#xref:bsl/set-0d/lower_bound-05.adoc[_» more..._]#

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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:bsl/set-0d/iterator.adoc[iterator]
xref:bsl/set-0d/lower_bound-01.adoc[lower_bound](LOOKUP_KEY const& key)
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
                                                   LOOKUP_KEY>::value;
----

[.small]#xref:bsl/set-0d/lower_bound-01.adoc[_» more..._]#

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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:bsl/set-0d/const_iterator.adoc[const_iterator]
xref:bsl/set-0d/lower_bound-06.adoc[lower_bound](LOOKUP_KEY const& key) const
requires BloombergLP::bslmf::IsTransparentPredicate<COMPARATOR,
                                                   LOOKUP_KEY>::value;
----

[.small]#xref:bsl/set-0d/lower_bound-06.adoc[_» more..._]#


[.small]#Created with https://www.mrdocs.com[MrDocs]#