std::flat_set::lower_bound(3)

🎀 std::flat_set::lower_bound(3) — C++ Standard Libary manual page 🎀

okay bestie, welcome to the C++ Standard Libary page for std::flat_set::lower_bound. This is the one where we find the first element that is not less than a key. It’s giving C++23 energy, and yes, all four overloads below are (since C++23). 💅

🌸 NAME 🌸

std::flat_set::lower_bound - std::flat_set::lower_bound

📜 Synopsis 📜

iterator lower_bound( const Key& key );             (1) (since C++23)
const_iterator lower_bound( const Key& key ) const; (2) (since C++23)
template< class K >                                 (3) (since C++23)
iterator lower_bound( const K& x );
template< class K >                                 (4) (since C++23)
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. 😭 that past-the-end case is the little heartbreak, but at least it’s documented.

⏱️ Complexity ⏱️

Logarithmic in the size of the container. ⚡

🙈 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/version: http://cppreference.com · date: 2024.06.10 — that’s the whole std::flat_set::lower_bound(3) page, bestie; go forth and lower_bound slay ✨