std::set::upper_bound(3)

💖 std::set::upper_bound(3) 💖

okay so bestie, welcome to the C++ Standard Libary page for std::set::upper_bound — it's giving “one very specific set member function” and we're gonna learn it together, no cap 🫶✨

---

🎀 NAME 🎀

std::set::upper_bound — std::set::upper_bound

not me just restating the name, but make it cute 💅

✨ Synopsis ✨

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

• (1,2) return an iterator pointing to the first element that is greater than key.
• (3,4) return an iterator pointing to the first element that compares greater 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 🌈

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

🔥 Complexity 🔥

Logarithmic in the size of the container. literally logarithmic, bestie 💅

🧚 Notes 🧚

feature-test macro tea ☕:

• __cpp_lib_generic_associative_lookup — value 201304L, standard (C++14), feature: Heterogeneous comparison lookup in associative containers, for 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)
• lower_bound — returns an iterator to the first element not less than the given key (public member function)

🏷️ Category 🏷️

• Todo no example

---

mwah 💋 that's the whole page — source: http://cppreference.com, version/date: 2024.06.10 🌈👑