std::multiset::lower_bound

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::multiset
Member functions multiset::multiset multiset::~multiset multiset::operator= multiset::get_allocator Iterators multiset::begin multiset::cbegin (C++11) multiset::end multiset::cend (C++11) multiset::rbegin multiset::crbegin (C++11) multiset::rend multiset::crend (C++11) Capacity multiset::empty multiset::size multiset::max_size Modifiers multiset::clear multiset::insert multiset::emplace (C++11) multiset::emplace_hint (C++11) multiset::erase multiset::swap Lookup multiset::count multiset::find multiset::equal_range multiset::lower_bound multiset::upper_bound Observers multiset::key_comp multiset::value_comp

iterator lower_bound( const Key& key );
const_iterator lower_bound( const Key& key ) const;

Returns an iterator pointing to the first element that is not less than key.

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

key

-

key value to compare the elements to

[edit] Return value

iterator pointing to the first element that is not less than key. If no such element is found, past-the-end (see end()) iterator is returned.

[edit] Complexity

This section is incomplete

[edit] See also

equal_range	returns range of elements matching a specific key (public member function)
upper_bound	returns an iterator to the first element greater than a certain value (public member function)