__gnu_pbds(3cxx)

💖 NAME 💖

okay bestie, this is the manual page for __gnu_pbds in section 3cxx — the GNU extensions for policy-based data structures for public use. That’s the whole NAME vibe: __gnu_pbds is here to give you policy-based data structures, GNU-style, for public use. 💅✨

🌸 SYNOPSIS 🌸

This synopsis is giving “big library, lots of templates” energy. Here’s everything listed, no skipping. 🎀

✨ Classes ✨

• struct associative_tag — the basic associative-container tag.
• class basic_branch — no blurb in the original page, just the class name.
• struct basic_branch_tag — basic branch structure.
• class basic_hash_table — no blurb in the original page, just the class name.
• struct basic_hash_tag — basic hash structure.
• struct basic_invalidation_guarantee — no blurb in the original page, just the name.
• struct binary_heap_tag — binary-heap, array-based.
• struct binomial_heap_tag — binomial-heap.
• class cc_hash_max_collision_check_resize_trigger — a resize trigger policy based on collision checks; it keeps the simulated load factor lower than some given load factor.
• class cc_hash_table — no blurb in the original page, just the class name.
• struct cc_hash_tag — collision-chaining hash.
• struct container_error — base class for exceptions.
• struct container_tag — base data structure tag.
• struct container_traits — container traits.
• struct container_traits_base — primary template, the container traits base.
• struct container_traits_base< binary_heap_tag > — specialization, binary heap.
• struct container_traits_base< binomial_heap_tag > — specialization, binomial heap.
• struct container_traits_base< cc_hash_tag > — specialization, cc hash.
• struct container_traits_base< gp_hash_tag > — specialization, gp hash.
• struct container_traits_base< list_update_tag > — specialization, list update.
• struct container_traits_base< ov_tree_tag > — specialization, ov tree.
• struct container_traits_base< pairing_heap_tag > — specialization, pairing heap.
• struct container_traits_base< pat_trie_tag > — specialization, pat trie.
• struct container_traits_base< rb_tree_tag > — specialization, rb tree.
• struct container_traits_base< rc_binomial_heap_tag > — specialization, rc binomial heap.
• struct container_traits_base< splay_tree_tag > — specialization, splay tree.
• struct container_traits_base< thin_heap_tag > — specialization, thin heap.
• class direct_mask_range_hashing — a mask range-hashing class that uses a bitmask.
• class direct_mod_range_hashing — a mod range-hashing class that uses the modulo function.
• class gp_hash_table — no blurb in the original page, just the class name.
• struct gp_hash_tag — general-probing hash.
• class hash_exponential_size_policy — a size policy whose sequence of sizes forms an exponential sequence, typically powers of 2.
• class hash_load_check_resize_trigger — a resize trigger policy based on a load check; it keeps the load factor between some load factors load_min and load_max.
• class hash_prime_size_policy — a size policy whose sequence of sizes forms a nearly-exponential sequence of primes.
• class hash_standard_resize_policy — a resize policy that delegates operations to size and trigger policies.
• struct insert_error — an entry cannot be inserted into a container object for logical reasons (not, e.g., if memory is unabvailable, in which case the allocator_type's exception will be thrown).
• struct join_error — a join cannot be performed for logical reasons (i.e., the ranges of the two container objects being joined overlaps).
• class linear_probe_fn — a probe sequence policy using fixed increments.
• class list_update — no blurb in the original page, just the class name.
• struct list_update_tag — list-update.
• class lu_counter_policy — no blurb in the original page, just the class name.
• class lu_move_to_front_policy — no blurb in the original page, just the class name.
• struct null_node_update — a null node updator, meaning no node updates are required.
• struct null_type — represents no type, or absence of type, for template tricks.
• struct ov_tree_tag — ordered-vector tree.
• struct pairing_heap_tag — pairing-heap.
• struct pat_trie_tag — PATRICIA trie.
• struct point_invalidation_guarantee — no blurb in the original page, just the name.
• class priority_queue — no blurb in the original page, just the class name.
• struct priority_queue_tag — basic priority-queue.
• class quadratic_probe_fn — a probe sequence policy using square increments.
• struct range_invalidation_guarantee — no blurb in the original page, just the name.
• struct rb_tree_tag — red-black tree.
• struct rc_binomial_heap_tag — redundant-counter binomial-heap.
• struct resize_error — a container cannot be resized.
• class sample_probe_fn — a sample probe policy.
• class sample_range_hashing — a sample range-hashing functor.
• class sample_ranged_hash_fn — a sample ranged-hash functor.
• class sample_ranged_probe_fn — a sample ranged-probe functor.
• class sample_resize_policy — a sample resize policy.
• class sample_resize_trigger — a sample resize trigger policy.
• class sample_size_policy — a sample size policy.
• class sample_tree_node_update — a sample node updator.
• struct sample_trie_access_traits — a sample trie element access traits.
• class sample_trie_node_update — a sample node updator.
• struct sample_update_policy — a sample list-update policy.
• struct sequence_tag — basic sequence.
• struct splay_tree_tag — splay tree.
• struct string_tag — basic string container, inclusive of strings, ropes, etc.
• struct thin_heap_tag — thin heap.
• class tree — no blurb in the original page, just the class name.
• class tree_order_statistics_node_update — functor updating ranks of entrees.
• struct tree_tag — basic tree structure.
• class trie — no blurb in the original page, just the class name.
• class trie_order_statistics_node_update — functor updating ranks of entrees.
• class trie_prefix_search_node_update — a node updator that allows tries to be searched for the range of values that match a certain prefix.
• struct trie_string_access_traits — no blurb in the original page, just the name.
• struct trie_tag — basic trie structure.
• struct trivial_iterator_tag — a trivial iterator tag; it signifies that the iterators has none of std::iterators's movement abilities.

🎀 Typedefs 🎀

• typedef void trivial_iterator_difference_type — prohibit moving trivial iterators.

🌈 Functions 🌈

• void __throw_container_error () — listed exactly; no extra blurb in the manpage.
• void __throw_insert_error () — listed exactly; no extra blurb in the manpage.
• void __throw_join_error () — listed exactly; no extra blurb in the manpage.
• void __throw_resize_error () — listed exactly; no extra blurb in the manpage.

💬 Detailed Description 💬

okay so the detailed description is short and iconic: GNU extensions for policy-based data structures for public use. That’s it. Periodt. 💅

✍️ Author ✍️

This page was generated automatically by Doxygen for libstdc++ from the source code. So the “author” is Doxygen, bestie — not a human. 🤖💖

---

sign-off: this whole page is from libstdc++, with the __gnu_pbds(3cxx) tag at the bottom. The footer doesn’t give a date, so no fake date from me — just vibes and exact facts. 🫶💖✨