.TH "__gnu_pbds" 3cxx "Wed Jul 14 2021" "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
__gnu_pbds \- GNU extensions for policy-based data structures for public use\&.  

.SH SYNOPSIS
.br
.PP
.SS "Classes"

.in +1c
.ti -1c
.RI "struct \fBassociative_tag\fP"
.br
.RI "Basic associative-container\&. "
.ti -1c
.RI "class \fBbasic_branch\fP"
.br
.ti -1c
.RI "struct \fBbasic_branch_tag\fP"
.br
.RI "Basic branch structure\&. "
.ti -1c
.RI "class \fBbasic_hash_table\fP"
.br
.ti -1c
.RI "struct \fBbasic_hash_tag\fP"
.br
.RI "Basic hash structure\&. "
.ti -1c
.RI "struct \fBbasic_invalidation_guarantee\fP"
.br
.ti -1c
.RI "struct \fBbinary_heap_tag\fP"
.br
.RI "Binary-heap (array-based)\&. "
.ti -1c
.RI "struct \fBbinomial_heap_tag\fP"
.br
.RI "Binomial-heap\&. "
.ti -1c
.RI "class \fBcc_hash_max_collision_check_resize_trigger\fP"
.br
.RI "A resize trigger policy based on collision checks\&. It keeps the simulated load factor lower than some given load factor\&. "
.ti -1c
.RI "class \fBcc_hash_table\fP"
.br
.ti -1c
.RI "struct \fBcc_hash_tag\fP"
.br
.RI "Collision-chaining hash\&. "
.ti -1c
.RI "struct \fBcontainer_error\fP"
.br
.RI "Base class for exceptions\&. "
.ti -1c
.RI "struct \fBcontainer_tag\fP"
.br
.RI "Base data structure tag\&. "
.ti -1c
.RI "struct \fBcontainer_traits\fP"
.br
.RI "Container traits\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base\fP"
.br
.RI "Primary template, container traits base\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< binary_heap_tag >\fP"
.br
.RI "Specialization, binary heap\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< binomial_heap_tag >\fP"
.br
.RI "Specialization, binomial heap\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< cc_hash_tag >\fP"
.br
.RI "Specialization, cc hash\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< gp_hash_tag >\fP"
.br
.RI "Specialization, gp hash\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< list_update_tag >\fP"
.br
.RI "Specialization, list update\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< ov_tree_tag >\fP"
.br
.RI "Specialization, ov tree\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< pairing_heap_tag >\fP"
.br
.RI "Specialization, pairing heap\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< pat_trie_tag >\fP"
.br
.RI "Specialization, pat trie\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< rb_tree_tag >\fP"
.br
.RI "Specialization, rb tree\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< rc_binomial_heap_tag >\fP"
.br
.RI "Specialization, rc binomial heap\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< splay_tree_tag >\fP"
.br
.RI "Specialization, splay tree\&. "
.ti -1c
.RI "struct \fBcontainer_traits_base< thin_heap_tag >\fP"
.br
.RI "Specialization, thin heap\&. "
.ti -1c
.RI "class \fBdirect_mask_range_hashing\fP"
.br
.RI "A mask range-hashing class (uses a bitmask)\&. "
.ti -1c
.RI "class \fBdirect_mod_range_hashing\fP"
.br
.RI "A mod range-hashing class (uses the modulo function)\&. "
.ti -1c
.RI "class \fBgp_hash_table\fP"
.br
.ti -1c
.RI "struct \fBgp_hash_tag\fP"
.br
.RI "General-probing hash\&. "
.ti -1c
.RI "class \fBhash_exponential_size_policy\fP"
.br
.RI "A size policy whose sequence of sizes form an exponential sequence (typically powers of 2\&. "
.ti -1c
.RI "class \fBhash_load_check_resize_trigger\fP"
.br
.RI "A resize trigger policy based on a load check\&. It keeps the load factor between some load factors load_min and load_max\&. "
.ti -1c
.RI "class \fBhash_prime_size_policy\fP"
.br
.RI "A size policy whose sequence of sizes form a nearly-exponential sequence of primes\&. "
.ti -1c
.RI "class \fBhash_standard_resize_policy\fP"
.br
.RI "A resize policy which delegates operations to size and trigger policies\&. "
.ti -1c
.RI "struct \fBinsert_error\fP"
.br
.RI "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)\&. "
.ti -1c
.RI "struct \fBjoin_error\fP"
.br
.RI "A join cannot be performed logical reasons (i\&.e\&., the ranges of the two container objects being joined overlaps\&. "
.ti -1c
.RI "class \fBlinear_probe_fn\fP"
.br
.RI "A probe sequence policy using fixed increments\&. "
.ti -1c
.RI "class \fBlist_update\fP"
.br
.ti -1c
.RI "struct \fBlist_update_tag\fP"
.br
.RI "List-update\&. "
.ti -1c
.RI "class \fBlu_counter_policy\fP"
.br
.ti -1c
.RI "class \fBlu_move_to_front_policy\fP"
.br
.ti -1c
.RI "struct \fBnull_node_update\fP"
.br
.RI "A null node updator, indicating that no node updates are required\&. "
.ti -1c
.RI "struct \fBnull_type\fP"
.br
.RI "Represents no type, or absence of type, for template tricks\&. "
.ti -1c
.RI "struct \fBov_tree_tag\fP"
.br
.RI "Ordered-vector tree\&. "
.ti -1c
.RI "struct \fBpairing_heap_tag\fP"
.br
.RI "Pairing-heap\&. "
.ti -1c
.RI "struct \fBpat_trie_tag\fP"
.br
.RI "PATRICIA trie\&. "
.ti -1c
.RI "struct \fBpoint_invalidation_guarantee\fP"
.br
.ti -1c
.RI "class \fBpriority_queue\fP"
.br
.ti -1c
.RI "struct \fBpriority_queue_tag\fP"
.br
.RI "Basic priority-queue\&. "
.ti -1c
.RI "class \fBquadratic_probe_fn\fP"
.br
.RI "A probe sequence policy using square increments\&. "
.ti -1c
.RI "struct \fBrange_invalidation_guarantee\fP"
.br
.ti -1c
.RI "struct \fBrb_tree_tag\fP"
.br
.RI "Red-black tree\&. "
.ti -1c
.RI "struct \fBrc_binomial_heap_tag\fP"
.br
.RI "Redundant-counter binomial-heap\&. "
.ti -1c
.RI "struct \fBresize_error\fP"
.br
.RI "A container cannot be resized\&. "
.ti -1c
.RI "class \fBsample_probe_fn\fP"
.br
.RI "A sample probe policy\&. "
.ti -1c
.RI "class \fBsample_range_hashing\fP"
.br
.RI "A sample range-hashing functor\&. "
.ti -1c
.RI "class \fBsample_ranged_hash_fn\fP"
.br
.RI "A sample ranged-hash functor\&. "
.ti -1c
.RI "class \fBsample_ranged_probe_fn\fP"
.br
.RI "A sample ranged-probe functor\&. "
.ti -1c
.RI "class \fBsample_resize_policy\fP"
.br
.RI "A sample resize policy\&. "
.ti -1c
.RI "class \fBsample_resize_trigger\fP"
.br
.RI "A sample resize trigger policy\&. "
.ti -1c
.RI "class \fBsample_size_policy\fP"
.br
.RI "A sample size policy\&. "
.ti -1c
.RI "class \fBsample_tree_node_update\fP"
.br
.RI "A sample node updator\&. "
.ti -1c
.RI "struct \fBsample_trie_access_traits\fP"
.br
.RI "A sample trie element access traits\&. "
.ti -1c
.RI "class \fBsample_trie_node_update\fP"
.br
.RI "A sample node updator\&. "
.ti -1c
.RI "struct \fBsample_update_policy\fP"
.br
.RI "A sample list-update policy\&. "
.ti -1c
.RI "struct \fBsequence_tag\fP"
.br
.RI "Basic sequence\&. "
.ti -1c
.RI "struct \fBsplay_tree_tag\fP"
.br
.RI "Splay tree\&. "
.ti -1c
.RI "struct \fBstring_tag\fP"
.br
.RI "Basic string container, inclusive of strings, ropes, etc\&. "
.ti -1c
.RI "struct \fBthin_heap_tag\fP"
.br
.RI "Thin heap\&. "
.ti -1c
.RI "class \fBtree\fP"
.br
.ti -1c
.RI "class \fBtree_order_statistics_node_update\fP"
.br
.RI "Functor updating ranks of entrees\&. "
.ti -1c
.RI "struct \fBtree_tag\fP"
.br
.RI "Basic tree structure\&. "
.ti -1c
.RI "class \fBtrie\fP"
.br
.ti -1c
.RI "class \fBtrie_order_statistics_node_update\fP"
.br
.RI "Functor updating ranks of entrees\&. "
.ti -1c
.RI "class \fBtrie_prefix_search_node_update\fP"
.br
.RI "A node updator that allows tries to be searched for the range of values that match a certain prefix\&. "
.ti -1c
.RI "struct \fBtrie_string_access_traits\fP"
.br
.ti -1c
.RI "struct \fBtrie_tag\fP"
.br
.RI "Basic trie structure\&. "
.ti -1c
.RI "struct \fBtrivial_iterator_tag\fP"
.br
.RI "A trivial iterator tag\&. Signifies that the iterators has none of std::iterators's movement abilities\&. "
.in -1c
.SS "Typedefs"

.in +1c
.ti -1c
.RI "typedef void \fBtrivial_iterator_difference_type\fP"
.br
.RI "Prohibit moving trivial iterators\&. "
.in -1c
.SS "Functions"

.in +1c
.ti -1c
.RI "void \fB__throw_container_error\fP ()"
.br
.ti -1c
.RI "void \fB__throw_insert_error\fP ()"
.br
.ti -1c
.RI "void \fB__throw_join_error\fP ()"
.br
.ti -1c
.RI "void \fB__throw_resize_error\fP ()"
.br
.in -1c
.SH "Detailed Description"
.PP 
GNU extensions for policy-based data structures for public use\&. 
.SH "Author"
.PP 
Generated automatically by Doxygen for libstdc++ from the source code\&.