.TH "__gnu_pbds" 3cxx "Sun Jan 6 2013" "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
__gnu_pbds \- 
.SH SYNOPSIS
.br
.PP
.SS "Classes"

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

.in +1c
.ti -1c
.RI "typedef void \fBtrivial_iterator_difference_type\fP"
.br
.in -1c
.SS "Functions"

.in +1c
.ti -1c
.RI "void \fB__throw_container_error\fP (void)"
.br
.ti -1c
.RI "void \fB__throw_insert_error\fP (void)"
.br
.ti -1c
.RI "void \fB__throw_join_error\fP (void)"
.br
.ti -1c
.RI "void \fB__throw_resize_error\fP (void)"
.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\&.