std::flat_set::upper_bound(3)

🦋 std::flat_set::upper_bound(3) — C++ Standard Libary ✨

🌸 NAME

std::flat_set::upper_bound — yep, the name is literally std::flat_set::upper_bound, bestie. That's the whole NAME vibe 💅

📜 Synopsis

Okay so here's the exact signature lineup, no cap:

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;

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

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. That's the whole return-value tea ☕💖

⭐ Complexity

Logarithmic in the size of the container. Slay, logarithmic queen 👑🔥

😭 Example

This section is incomplete. Reason: no example. Bestie, we're literally left on read by the example section 🫠💀

👀 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

Sign-off cuteness: from http://cppreference.com, dated 2024.06.10, page std::flat_set::upper_bound(3) — bye bestie, go slay your iterators 💖🎀🦋