__GNU_PBDS::LU_COUNTER_POLICY(3)

💖 NAME 💖

__gnu_pbds::lu_counter_policy< Max_Count, _Alloc > — okay so bestie, this is a list-update policy, and it lives in the Library Functions Manual. Its whole thing? It counts how many times an element gets accessed, and once that count hits the magic number, the element gets moved to the front of the list. It's giving main character energy for your data structures ✨

---

🦋 SYNOPSIS 🦋

#include <list_update_policy.hpp>

Inherits __gnu_pbds::detail::lu_counter_policy_base< Size_Type >. Yes she has a base class, we love a nepo baby 💅

✨ Public Types ✨

• enum { max_count }
• typedef _Alloc allocator_type
• typedef detail::rebind_traits< _Alloc, metadata_type >::reference metadata_reference — a reference to the metadata that this functor operates on 🎀
• typedef detail::lu_counter_metadata< size_type > metadata_type — the actual metadata type this functor operates on, no cap
• typedef allocator_type::size_type size_type

💅 Public Member Functions 💅

• metadata_type operator() () const — creates a metadata object 🫶
• bool operator() (metadata_reference r_data) const — decides whether a metadata object should be moved to the front of the list 👑

🙈 Private Member Functions 🙈

• template<typename Metadata_Reference> bool operator() (Metadata_Reference r_data, size_type m_max_count) const
• lu_counter_metadata< size_type > operator() (size_type max_size) const

---

🌈 Detailed Description 🌈

template<std::size_t Max_Count = 5, typename _Alloc = std::allocator<char>>
class __gnu_pbds::lu_counter_policy< Max_Count, _Alloc >

"A list-update policy that moves elements to the front of the list based on the counter algorithm." Literally that's the whole vibe. She counts, she promotes, she slays 💅

---

🎀 Member Typedef Documentation 🎀

template<std::size_t Max_Count = 5, typename _Alloc = std::allocator<char>>
typedef detail::rebind_traits<_Alloc,metadata_type>::reference
__gnu_pbds::lu_counter_policy< Max_Count, _Alloc >::metadata_reference

Reference to metadata on which this functor operates. That's it, that's the girl 💖

template<std::size_t Max_Count = 5, typename _Alloc = std::allocator<char>>
typedef detail::lu_counter_metadata<size_type>
__gnu_pbds::lu_counter_policy< Max_Count, _Alloc >::metadata_type

Metadata on which this functor operates. She's the type bestie, the whole personality 🌸

---

⭐ Member Enumeration Documentation ⭐

template<std::size_t Max_Count = 5, typename _Alloc = std::allocator<char>>
anonymous enum

Enumerator time, and there's exactly one 👇

• max_count — when some element is accessed this number of times, it will be moved to the front of the list. So it's literally a hype meter: hit the threshold, get promoted to the front. Iconic behaviour fr fr 🔥

---

👑 Member Function Documentation 👑

template<std::size_t Max_Count = 5, typename _Alloc = std::allocator<char>>
metadata_type __gnu_pbds::lu_counter_policy< Max_Count, _Alloc
>::operator() () const [inline]

Creates a metadata object. Simple, clean, does exactly what it says on the tin ✨

References max_count.

template<std::size_t Max_Count = 5, typename _Alloc = std::allocator<char>>
bool __gnu_pbds::lu_counter_policy< Max_Count, _Alloc >::operator()
(metadata_reference r_data) const [inline]

Decides whether a metadata object should be moved to the front of the list. It's the vibe check for your elements — pass it and you get bumped to the front 🫶

References max_count.

---

💜 Author 💜

Generated automatically by Doxygen for libstdc++ from the source code. Not me, not you, a robot did all the typing 😭

---

okay bestie that's the whole page 🎀 the footer is just libstdc++ tagging itself as the source (no date on this one, she's mysterious like that 💅), so shoutout to libstdc++ and to Doxygen for auto-generating this straight from the source code. periodt. 💖✨