std::multiset::lower_bound(3)

💅 std::multiset::lower_bound(3) 💅

okay so this is the std::multiset::lower_bound(3) page from the C++ Standard Libary, bestie — manual name is literally C++ Standard Libary and the title is std::multiset::lower_bound(3). We’re talking about the std::multiset::lower_bound member function, and it’s giving “find the first element that is not less than your key” energy. Slay. ✨

🌸 NAME 🌸

std::multiset::lower_bound - std::multiset::lower_bound — yes bestie, the name is the name, and it’s literally the std::multiset::lower_bound member function. No cap. 🫶

✨ Synopsis ✨

iterator lower_bound( const Key& key );             (1)
const_iterator lower_bound( const Key& key ) const; (2)
template< class K >                                 (3) (since C++14)
iterator lower_bound( const K& x );
template< class K >                                 (4) (since C++14)
const_iterator lower_bound( const K& x ) const;

• 1,2) Returns an iterator pointing to the first element that is not less than (i.e. greater or equal to) key.
• 3,4) Returns an iterator pointing to the first element that compares not less (i.e. greater or equal) to the value x. This overload participates in overload resolution only if the qualified-id Compare::is_transparent is valid and denotes a type. It allows calling this function without constructing an instance of Key.

🎀 Parameters 🎀

• key — key value to compare the elements to
• x — alternative value that can be compared to Key

💖 Return value 💖

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

🔥 Complexity 🔥

Logarithmic in the size of the container. That’s it — no extra lore, bestie. 💅

👑 Notes 👑

Feature-test macro info, periodt:

• Feature-test macro: __cpp_lib_generic_associative_lookup
• Value: 201304L
• Std: (C++14)
• Feature: Heterogeneous comparison lookup in associative containers; overloads (3,4)

🌈 Example 🌈

This section is incomplete. Reason: no example. 😭

🦋 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 the given key (public member function)

🍓 Category 🍓

• Todo no example

💖 source: http://cppreference.com, version/date: 2024.06.10 — bye bestie, go find that lower bound and slay! 💖