std::flat_multiset::count(3)

🌸 NAME 🌸

Okay so bestie, this is the std::flat_multiset::count(3) page from the C++ Standard Libary manual. The name is literally std::flat_multiset::count — like, the page and the member function said “same name, same energy” and honestly? Iconic. 💅

---

✨ Synopsis ✨

Here are the signatures, copied exactly, no cap:

size_type count( const Key& key ) const; (1) (since C++23)
template< class K >                      (2) (since C++23)
size_type count( const K& x ) const;

Returns the number of elements with key that compares equivalent to the specified argument.

1. Returns the number of elements with key key.
2. Returns the number of elements with key that compares equivalent 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 of the elements to count.
• x — alternative value to compare to the keys.

---

💖 Return value 💖

Number of elements with key that compares equivalent to key or x. That's the whole answer, bestie — it's giving “counted and served.” 🫶

---

🔥 Complexity 🔥

Logarithmic in the size of the container plus linear in the number of elements found. Highkey important, lowkey cute. ✨

---

😭 Example 😭

This section is incomplete.

Reason: no example.

Not me reading “no example” and feeling personally attacked 😭 but okay, that's what the page says, fr fr.

---

🦋 See also 🦋

• find — finds element with specific key (public member function).
• equal_range — returns range of elements matching a specific key (public member function).

---

👑 Category 👑

• Todo no example

---

mwah 💋 — source/version: http://cppreference.com, date: 2024.06.10, page: std::flat_multiset::count(3). That's the whole vibe, bestie, no cap 🫶