|
struct | associative_tag |
| Basic associative-container. More...
|
|
class | basic_branch |
| A branched, tree-like (tree, trie) container abstraction. More...
|
|
struct | basic_branch_tag |
| Basic branch structure. More...
|
|
class | basic_hash_table |
| A hashed container abstraction. More...
|
|
struct | basic_hash_tag |
| Basic hash structure. More...
|
|
struct | basic_invalidation_guarantee |
| Signifies a basic invalidation guarantee that any iterator, pointer, or reference to a container object's mapped value type is valid as long as the container is not modified. More...
|
|
struct | binary_heap_tag |
| Binary-heap (array-based). More...
|
|
struct | binomial_heap_tag |
| Binomial-heap. More...
|
|
class | cc_hash_max_collision_check_resize_trigger |
| A resize trigger policy based on collision checks. More...
|
|
class | cc_hash_table |
| A collision-chaining hash-based associative container. More...
|
|
struct | cc_hash_tag |
| Collision-chaining hash. More...
|
|
struct | container_error |
| Base class for exceptions. More...
|
|
struct | container_tag |
| Base data structure tag. More...
|
|
struct | container_traits |
| Container traits. More...
|
|
struct | container_traits_base |
| Primary template, container traits base. More...
|
|
struct | container_traits_base< binary_heap_tag > |
| Specialization, binary heap. More...
|
|
struct | container_traits_base< binomial_heap_tag > |
| Specialization, binomial heap. More...
|
|
struct | container_traits_base< cc_hash_tag > |
| Specialization, cc hash. More...
|
|
struct | container_traits_base< gp_hash_tag > |
| Specialization, gp hash. More...
|
|
struct | container_traits_base< list_update_tag > |
| Specialization, list update. More...
|
|
struct | container_traits_base< ov_tree_tag > |
| Specialization, ov tree. More...
|
|
struct | container_traits_base< pairing_heap_tag > |
| Specialization, pairing heap. More...
|
|
struct | container_traits_base< pat_trie_tag > |
| Specialization, pat trie. More...
|
|
struct | container_traits_base< rb_tree_tag > |
| Specialization, rb tree. More...
|
|
struct | container_traits_base< rc_binomial_heap_tag > |
| Specialization, rc binomial heap. More...
|
|
struct | container_traits_base< splay_tree_tag > |
| Specialization, splay tree. More...
|
|
struct | container_traits_base< thin_heap_tag > |
| Specialization, thin heap. More...
|
|
class | direct_mask_range_hashing |
| A mask range-hashing class (uses a bitmask). More...
|
|
class | direct_mod_range_hashing |
| A mod range-hashing class (uses the modulo function). More...
|
|
class | gp_hash_table |
| A general-probing hash-based associative container. More...
|
|
struct | gp_hash_tag |
| General-probing hash. More...
|
|
class | hash_exponential_size_policy |
| A size policy whose sequence of sizes form an exponential sequence (typically powers of 2. More...
|
|
class | hash_load_check_resize_trigger |
| A resize trigger policy based on a load check. More...
|
|
class | hash_prime_size_policy |
| A size policy whose sequence of sizes form a nearly-exponential sequence of primes. More...
|
|
class | hash_standard_resize_policy |
| A resize policy which delegates operations to size and trigger policies. More...
|
|
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). More...
|
|
struct | join_error |
| A join cannot be performed logical reasons (i.e., the ranges of the two container objects being joined overlaps. More...
|
|
class | linear_probe_fn |
| A probe sequence policy using fixed increments. More...
|
|
class | list_update |
| A list-update based associative container. More...
|
|
struct | list_update_tag |
| List-update. More...
|
|
class | lu_counter_policy |
| A list-update policy that moves elements to the front of the list based on the counter algorithm. More...
|
|
class | lu_move_to_front_policy |
| A list-update policy that unconditionally moves elements to the front of the list. More...
|
|
struct | null_node_update |
| A null node updator, indicating that no node updates are required. More...
|
|
struct | null_type |
| Represents no type, or absence of type, for template tricks. More...
|
|
struct | ov_tree_tag |
| Ordered-vector tree. More...
|
|
struct | pairing_heap_tag |
| Pairing-heap. More...
|
|
struct | pat_trie_tag |
| PATRICIA trie. More...
|
|
struct | point_invalidation_guarantee |
| Signifies an invalidation guarantee that includes all those of its base, and additionally, that any point-type iterator, pointer, or reference to a container object's mapped value type is valid as long as its corresponding entry has not be erased, regardless of modifications to the container object. More...
|
|
class | priority_queue |
| A priority queue composed of one specific heap policy. More...
|
|
struct | priority_queue_tag |
| Basic priority-queue. More...
|
|
class | quadratic_probe_fn |
| A probe sequence policy using square increments. More...
|
|
struct | range_invalidation_guarantee |
| Signifies an invalidation guarantee that includes all those of its base, and additionally, that any range-type iterator (including the returns of begin() and end()) is in the correct relative positions to other range-type iterators as long as its corresponding entry has not be erased, regardless of modifications to the container object. More...
|
|
struct | rb_tree_tag |
| Red-black tree. More...
|
|
struct | rc_binomial_heap_tag |
| Redundant-counter binomial-heap. More...
|
|
struct | resize_error |
| A container cannot be resized. More...
|
|
class | sample_probe_fn |
| A sample probe policy. More...
|
|
class | sample_range_hashing |
| A sample range-hashing functor. More...
|
|
class | sample_ranged_hash_fn |
| A sample ranged-hash functor. More...
|
|
class | sample_ranged_probe_fn |
| A sample ranged-probe functor. More...
|
|
class | sample_resize_policy |
| A sample resize policy. More...
|
|
class | sample_resize_trigger |
| A sample resize trigger policy. More...
|
|
class | sample_size_policy |
| A sample size policy. More...
|
|
class | sample_tree_node_update |
| A sample node updator. More...
|
|
struct | sample_trie_access_traits |
| A sample trie element access traits. More...
|
|
class | sample_trie_node_update |
| A sample node updator. More...
|
|
struct | sample_update_policy |
| A sample list-update policy. More...
|
|
struct | sequence_tag |
| Basic sequence. More...
|
|
struct | splay_tree_tag |
| Splay tree. More...
|
|
struct | string_tag |
| Basic string container, inclusive of strings, ropes, etc. More...
|
|
struct | thin_heap_tag |
| Thin heap. More...
|
|
class | tree |
| A tree-based container. More...
|
|
class | tree_order_statistics_node_update |
| Functor updating ranks of entrees. More...
|
|
struct | tree_tag |
| Basic tree structure. More...
|
|
class | trie |
| A trie-based container. More...
|
|
class | trie_order_statistics_node_update |
| Functor updating ranks of entrees. More...
|
|
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. More...
|
|
struct | trie_string_access_traits |
| Element access traits for string types. More...
|
|
struct | trie_tag |
| Basic trie structure. More...
|
|
struct | trivial_iterator_tag |
| A trivial iterator tag. More...
|
|
GNU extensions for policy-based data structures for public use.