std::flat_m...:upper_bound(3)

💅 std::flat_m...:upper_bound(3) 💅

okay bestie, welcome to the C++ Standard Libary page for std::flat_multimap::upper_bound — yes, that spelling is in the header, and we are keeping it 💀. This one is short, cute, and extremely “where does the first bigger-than-this element live?” energy. 🦋

---

🌸 NAME 🌸

std::flat_multimap::upper_bound — std::flat_multimap::upper_bound

like… the name is the name, and honestly? iconic. 👑

---

📜 Synopsis 📜

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

So here’s the vibe check, overload by overload:

1. Overloads 1,2 return an iterator pointing to the first element that is greater than key.
2. Overloads 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. 🫶

no cap, that transparent-comparator bit is the little VIP pass that lets you search without making a Key first. ✨

---

🎀 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 greater than key. If no such element is found, past-the-end (see end()) iterator is returned. 🫡

like, if there’s no bigger one, you get the “end of the line” iterator, and that is very much its whole thing.

---

🔥 Complexity 🔥

Logarithmic in the size of the container. periodt. 🌈

---

😭 Example 😭

This section is incomplete.

Reason: no example.

not me staring at an empty example section… the audacity, honestly 💀

---

🦋 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

---

kisses bestie, this page is from http://cppreference.com, version 2024.06.10 — go find your first greater-than element and slay 💅✨🎀