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

Return a const iterator to the first element not less than `key`.

== Synopsis

Declared in `<bslstl_set.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<class LOOKUP_KEY>
xref:bsl/set-0d/const_iterator.adoc[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 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.

Note: implemented inline due to Sun CC compilation error.

== Return Value

const iterator to the lower bound, or `end()`

== Parameters

[cols="1,4"]
|===
| Name| Description
| *key*
| key value to look up
|===


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