Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 12345]

►N__gnu_cxx
►N__ops
C_Iter_comp_iter
C_Iter_comp_to_iter
C_Iter_comp_to_val
C_Iter_comp_val
C_Iter_equal_to_iter
C_Iter_equal_to_val
C_Iter_equals_iter
C_Iter_equals_val
C_Iter_less_iter
C_Iter_less_val
C_Iter_negate
C_Iter_pred
C_Val_comp_iter
C_Val_less_iter
C__aligned_buffer
►C__aligned_membuf
C_Tp2
►N__gnu_debug	GNU debug classes for public use
C__is_safe_random_iterator
C__is_safe_random_iterator< _Safe_iterator< _Iterator, _Sequence > >
C_After_nth_from	A function object that returns true when the given random access iterator is at least n steps away from the given iterator
C_BeforeBeginHelper	Helper struct to deal with sequence offering a before_begin iterator
C_Equal_to	A simple function object that returns true if the passed-in value is equal to the stored value
►C_Error_formatter
C_Is_iterator
C_Is_sequence
C_Parameter
C_Insert_range_from_self_is_safe
C_Is_contiguous_sequence
C_Not_equal_to	A simple function object that returns true if the passed-in value is not equal to the stored value
C_Safe_container	Safe class dealing with some allocator dependent operations
►C_Safe_iterator	Safe iterator wrapper
C_Attach_single
C_Safe_iterator_base	Basic functionality for a safe iterator
►C_Safe_local_iterator	Safe iterator wrapper
C_Attach_single
C_Safe_local_iterator_base	Basic functionality for a safe iterator
C_Safe_node_sequence	Like _Safe_sequence but with a special _M_invalidate_all implementation not invalidating past-the-end iterators
C_Safe_sequence	Base class for constructing a safe sequence type that tracks iterators that reference it
C_Safe_sequence_base	Base class that supports tracking of iterators that reference a sequence
C_Safe_unordered_container	Base class for constructing a safe unordered container type that tracks iterators that reference it
C_Safe_unordered_container_base	Base class that supports tracking of local iterators that reference an unordered container
C_Siter_base
►N__gnu_parallel	GNU parallel code for public use
C__accumulate_binop_reduct	General reduction, using a binary operator
C__accumulate_selector	Std::accumulate() selector
C__adjacent_difference_selector	Selector that returns the difference between two adjacent __elements
C__adjacent_find_selector	Test predicate on two adjacent elements
C__binder1st	Similar to std::binder1st, but giving the argument types explicitly
C__binder2nd	Similar to std::binder2nd, but giving the argument types explicitly
C__count_if_selector	Std::count_if () selector
C__count_selector	Std::count() selector
C__difference_func
C__fill_selector	Std::fill() selector
C__find_first_of_selector	Test predicate on several elements
C__find_if_selector	Test predicate on a single element, used for std::find() and std::find_if ()
C__for_each_selector	Std::for_each() selector
C__generate_selector	Std::generate() selector
C__generic_find_selector	Base class of all __gnu_parallel::__find_template selectors
C__generic_for_each_selector	Generic __selector for embarrassingly parallel functions
C__identity_selector	Selector that just returns the passed iterator
C__inner_product_selector	Std::inner_product() selector
C__intersection_func
C__max_element_reduct	Reduction for finding the maximum element, using a comparator
C__min_element_reduct	Reduction for finding the maximum element, using a comparator
C__mismatch_selector	Test inverted predicate on a single element
C__multiway_merge_3_variant_sentinel_switch	Switch for 3-way merging with __sentinels turned off
C__multiway_merge_3_variant_sentinel_switch< true, _RAIterIterator, _RAIter3, _DifferenceTp, _Compare >	Switch for 3-way merging with __sentinels turned on
C__multiway_merge_4_variant_sentinel_switch	Switch for 4-way merging with __sentinels turned off
C__multiway_merge_4_variant_sentinel_switch< true, _RAIterIterator, _RAIter3, _DifferenceTp, _Compare >	Switch for 4-way merging with __sentinels turned on
C__multiway_merge_k_variant_sentinel_switch	Switch for k-way merging with __sentinels turned on
C__multiway_merge_k_variant_sentinel_switch< false, __stable, _RAIterIterator, _RAIter3, _DifferenceTp, _Compare >	Switch for k-way merging with __sentinels turned off
C__possibly_stable_multiway_merge
C__possibly_stable_multiway_merge< false, Seq_RAIter, _RAIter, _Compare, _DiffType >
C__possibly_stable_multiway_merge< true, Seq_RAIter, _RAIter, _Compare, _DiffType >
C__possibly_stable_sort
C__possibly_stable_sort< false, _RAIter, _Compare >
C__possibly_stable_sort< true, _RAIter, _Compare >
C__replace_if_selector	Std::replace() selector
C__replace_selector	Std::replace() selector
C__symmetric_difference_func
C__transform1_selector	Std::transform() __selector, one input sequence variant
C__transform2_selector	Std::transform() __selector, two input sequences variant
C__unary_negate	Similar to std::unary_negate, but giving the argument types explicitly
C__union_func
C_DRandomShufflingGlobalData	Data known to every thread participating in __gnu_parallel::__parallel_random_shuffle()
C_DRSSorterPU	Local data for a thread participating in __gnu_parallel::__parallel_random_shuffle()
C_DummyReduct	Reduction function doing nothing
C_EqualFromLess	Constructs predicate for equality from strict weak ordering predicate
C_EqualTo	Similar to std::equal_to, but allows two different types
C_GuardedIterator	_Iterator wrapper supporting an implicit supremum at the end of the sequence, dominating all comparisons
C_IteratorPair	A pair of iterators
C_IteratorTriple	A triple of iterators
C_Job	One __job for a certain thread
C_Less	Similar to std::less, but allows two different types
C_Less< _Tp, _Tp >
C_Lexicographic	Compare __a pair of types lexicographically, ascending
C_LexicographicReverse	Compare __a pair of types lexicographically, descending
C_LoserTree	Stable _LoserTree variant
C_LoserTree< false, _Tp, _Compare >	Unstable _LoserTree variant
►C_LoserTreeBase	Guarded loser/tournament tree
C_Loser	Internal representation of a _LoserTree element
C_LoserTreePointer	Stable _LoserTree implementation
C_LoserTreePointer< false, _Tp, _Compare >	Unstable _LoserTree implementation
►C_LoserTreePointerBase	Base class of _Loser Tree implementation using pointers
C_Loser	Internal representation of _LoserTree __elements
C_LoserTreePointerUnguarded	Stable unguarded _LoserTree variant storing pointers
C_LoserTreePointerUnguarded< false, _Tp, _Compare >	Unstable unguarded _LoserTree variant storing pointers
►C_LoserTreePointerUnguardedBase	Unguarded loser tree, keeping only pointers to the elements in the tree structure
C_Loser
C_LoserTreeTraits	Traits for determining whether the loser tree should use pointers or copies
C_LoserTreeUnguarded	Stable implementation of unguarded _LoserTree
C_LoserTreeUnguarded< false, _Tp, _Compare >	Non-Stable implementation of unguarded _LoserTree
►C_LoserTreeUnguardedBase	Base class for unguarded _LoserTree implementation
C_Loser
C_Multiplies	Similar to std::multiplies, but allows two different types
C_Multiplies< _Tp, _Tp, _Tp >
C_Nothing	Functor doing nothing
C_Piece	Subsequence description
C_Plus	Similar to std::plus, but allows two different types
C_Plus< _Tp, _Tp, _Tp >
C_PMWMSSortingData	Data accessed by all threads
C_PseudoSequence	Sequence that conceptually consists of multiple copies of the same element
C_PseudoSequenceIterator	_Iterator associated with __gnu_parallel::_PseudoSequence
C_QSBThreadLocal	Information local to one thread in the parallel quicksort run
C_RandomNumber	Random number generator, based on the Mersenne twister
C_RestrictedBoundedConcurrentQueue	Double-ended queue of bounded size, allowing lock-free atomic access
C_SamplingSorter	Stable sorting functor
C_SamplingSorter< false, _RAIter, _StrictWeakOrdering >	Non-__stable sorting functor
C_Settings	Class _Settings Run-time settings for the parallel mode including all tunable parameters
C_SplitConsistently	Split consistently
C_SplitConsistently< false, _RAIter, _Compare, _SortingPlacesIterator >	Split by sampling
C_SplitConsistently< true, _RAIter, _Compare, _SortingPlacesIterator >	Split by exact splitting
C_UnguardedIterator
Cbalanced_quicksort_tag	Forces parallel sorting using balanced quicksort at compile time
Cbalanced_tag	Recommends parallel execution using dynamic load-balancing at compile time
Cconstant_size_blocks_tag	Selects the constant block size variant for std::find()
Cdefault_parallel_tag	Recommends parallel execution using the default parallel algorithm
Cequal_split_tag	Selects the equal splitting variant for std::find()
Cexact_tag	Forces parallel merging with exact splitting, at compile time
Cfind_tag	Base class for for std::find() variants
Cgrowing_blocks_tag	Selects the growing block size variant for std::find()
Cmultiway_mergesort_exact_tag	Forces parallel sorting using multiway mergesort with exact splitting at compile time
Cmultiway_mergesort_sampling_tag	Forces parallel sorting using multiway mergesort with splitting by sampling at compile time
Cmultiway_mergesort_tag	Forces parallel sorting using multiway mergesort at compile time
Comp_loop_static_tag	Recommends parallel execution using OpenMP static load-balancing at compile time
Comp_loop_tag	Recommends parallel execution using OpenMP dynamic load-balancing at compile time
Cparallel_tag	Recommends parallel execution at compile time, optionally using a user-specified number of threads
Cquicksort_tag	Forces parallel sorting using unbalanced quicksort at compile time
Csampling_tag	Forces parallel merging with exact splitting, at compile time
Csequential_tag	Forces sequential execution at compile time
Cunbalanced_tag	Recommends parallel execution using static load-balancing at compile time
►N__gnu_pbds	GNU extensions for policy-based data structures for public use
►Ndetail
C__static_assert
C__static_assert< true >
C__static_assert_dumclass
Cbin_search_tree_const_it_	Const iterator
Cbin_search_tree_const_node_it_	Const node iterator
Cbin_search_tree_it_	Iterator
Cbin_search_tree_node_it_	Node iterator
Cbin_search_tree_traits	Binary search tree traits, primary template
Cbin_search_tree_traits< Key, null_type, Cmp_Fn, Node_Update, Node, _Alloc >	Specialization
Cbinary_heap	Binary heaps composed of resize and compare policies
Cbinary_heap_const_iterator_	Const point-type iterator
Cbinary_heap_point_const_iterator_	Const point-type iterator
Cbinomial_heap	Binomial heap
Cbinomial_heap_base	Base class for binomial heap
Cbranch_policy	Primary template, base class for branch structure policies
Cbranch_policy< Node_CItr, Node_CItr, _Alloc >	Specialization for const iterators
Ccond_dealtor	Conditional dey destructor, cc_hash
Ccontainer_base_dispatch	Dispatch mechanism, primary template for associative types
Ccontainer_base_dispatch< _VTp, Cmp_Fn, _Alloc, binary_heap_tag, null_type >	Specialization for binary_heap
Ccontainer_base_dispatch< _VTp, Cmp_Fn, _Alloc, binomial_heap_tag, null_type >	Specialization for binomial_heap
Ccontainer_base_dispatch< _VTp, Cmp_Fn, _Alloc, pairing_heap_tag, null_type >	Specialization for pairing_heap
Ccontainer_base_dispatch< _VTp, Cmp_Fn, _Alloc, rc_binomial_heap_tag, null_type >	Specialization for rc_binary_heap
Ccontainer_base_dispatch< _VTp, Cmp_Fn, _Alloc, thin_heap_tag, null_type >	Specialization for thin_heap
Ccontainer_base_dispatch< Key, Mapped, _Alloc, cc_hash_tag, Policy_Tl >	Specialization colision-chaining hash map
Ccontainer_base_dispatch< Key, Mapped, _Alloc, gp_hash_tag, Policy_Tl >	Specialization general-probe hash map
Ccontainer_base_dispatch< Key, Mapped, _Alloc, list_update_tag, Policy_Tl >	Specialization for list-update map
Ccontainer_base_dispatch< Key, Mapped, _Alloc, ov_tree_tag, Policy_Tl >	Specialization ordered-vector tree map
Ccontainer_base_dispatch< Key, Mapped, _Alloc, pat_trie_tag, Policy_Tl >	Specialization for PATRICIA trie map
Ccontainer_base_dispatch< Key, Mapped, _Alloc, rb_tree_tag, Policy_Tl >	Specialization for R-B tree map
Ccontainer_base_dispatch< Key, Mapped, _Alloc, splay_tree_tag, Policy_Tl >	Specialization splay tree map
Ccontainer_base_dispatch< Key, null_type, _Alloc, cc_hash_tag, Policy_Tl >	Specialization colision-chaining hash set
Ccontainer_base_dispatch< Key, null_type, _Alloc, gp_hash_tag, Policy_Tl >	Specialization general-probe hash set
Ccontainer_base_dispatch< Key, null_type, _Alloc, list_update_tag, Policy_Tl >	Specialization for list-update set
Ccontainer_base_dispatch< Key, null_type, _Alloc, ov_tree_tag, Policy_Tl >	Specialization ordered-vector tree set
Ccontainer_base_dispatch< Key, null_type, _Alloc, pat_trie_tag, Policy_Tl >	Specialization for PATRICIA trie set
Ccontainer_base_dispatch< Key, null_type, _Alloc, rb_tree_tag, Policy_Tl >	Specialization for R-B tree set
Ccontainer_base_dispatch< Key, null_type, _Alloc, splay_tree_tag, Policy_Tl >	Specialization splay tree set
Cdefault_comb_hash_fn	Primary template, default_comb_hash_fn
Cdefault_eq_fn	Primary template, default_eq_fn
Cdefault_hash_fn	Primary template, default_hash_fn
Cdefault_probe_fn	Primary template, default_probe_fn
Cdefault_resize_policy	Primary template, default_resize_policy
Cdefault_trie_access_traits	Primary template, default_trie_access_traits
Cdefault_trie_access_traits< std::basic_string< Char, Char_Traits, std::allocator< char > > >	Partial specialization, default_trie_access_traits
Cdefault_update_policy	Default update policy
Cdumnode_const_iterator	Constant node iterator
Centry_cmp	Entry compare, primary template
►Centry_cmp< _VTp, Cmp_Fn, _Alloc, false >	Specialization, false
Ctype	Compare plus entry
Centry_cmp< _VTp, Cmp_Fn, _Alloc, true >	Specialization, true
Centry_pred	Entry predicate primary class template
►Centry_pred< _VTp, Pred, _Alloc, false >	Specialization, false
Ctype
Centry_pred< _VTp, Pred, _Alloc, true >	Specialization, true
Ceq_by_less	Equivalence function
Chash_eq_fn	Primary template
Chash_eq_fn< Key, Eq_Fn, _Alloc, false >	Specialization 1 - The client requests that hash values not be stored
Chash_eq_fn< Key, Eq_Fn, _Alloc, true >	Specialization 2 - The client requests that hash values be stored
Chash_load_check_resize_trigger_size_base	Primary template
Chash_load_check_resize_trigger_size_base< Size_Type, false >
Chash_load_check_resize_trigger_size_base< Size_Type, true >	Specializations
Cis_const_pointer
Cis_const_reference
►Cis_pair
Cis_pair_imp
Cis_pair_imp< std::pair< U, V > >
Cis_simple
Cleft_child_next_sibling_heap	Base class for a basic heap
Cleft_child_next_sibling_heap_const_iterator_	Const point-type iterator
Cleft_child_next_sibling_heap_node_	Node
Cleft_child_next_sibling_heap_node_< _Value, null_type, _Alloc >
Cleft_child_next_sibling_heap_node_point_const_iterator_	Const point-type iterator
Clu_counter_metadata	A list-update metadata type that moves elements to the front of the list based on the counter algorithm
Clu_counter_policy_base	Base class for list-update counter policy
Clu_map_entry_metadata_base
Clu_map_entry_metadata_base< null_type >
Cmask_based_range_hashing	Range hashing policy
Cmod_based_range_hashing	Mod based range hashing
Cno_throw_copies	Primary template
Cno_throw_copies< Key, null_type >	Specialization
Cov_tree_node_const_it_	Const node reference
Cov_tree_node_it_	Node reference
Cpairing_heap	Pairing heap
►Cpat_trie_base	Base type for PATRICIA trees
C_CIter	Const iterator
C_Head	Head node for PATRICIA tree
►C_Inode	Internal node type, PATRICIA tree
Cconst_iterator	Constant child iterator
Citerator	Child iterator
C_Iter	Iterator
C_Leaf	Leaf node for PATRICIA tree
C_Metadata	Metadata base primary template
C_Metadata< null_type, _Alloc >	Specialization for null metadata
C_Node_base	Node base
C_Node_citer	Node const iterator
C_Node_iter	Node iterator
CPB_DS_BIN_TREE_NAME
►CPB_DS_CC_HASH_NAME	A collision-chaining hash-based container
Centry
►CPB_DS_GP_HASH_NAME	A general-probing hash-based container
Centry
►CPB_DS_LU_NAME	List-based (with updates) associative container
Centry
►CPB_DS_OV_TREE_NAME	Ordered-vector tree associative-container
Ccond_dtor	Conditional destructor
►CPB_DS_PAT_TRIE_NAME	PATRICIA trie
Cbranch_bag	Branch bag, for split-join
Ccond_dealtor	Conditional deallocator
CPB_DS_RB_TREE_NAME	Red-Black tree
CPB_DS_S_TREE_NAME	Splay tree
Cprobe_fn_base	Probe functor base
Cranged_hash_fn	Primary template
Cranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, false >	Specialization 1 The client supplies a hash function and a ranged hash function, and requests that hash values not be stored
Cranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, true >	Specialization 2 The client supplies a hash function and a ranged hash function, and requests that hash values be stored
Cranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, false >	Specialization 3 The client does not supply a hash function (by specifying null_type as the Hash_Fn parameter), and requests that hash values not be stored
Cranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, true >	Specialization 4 The client does not supply a hash function (by specifying null_type as the Hash_Fn parameter), and requests that hash values be stored
Cranged_probe_fn	Primary template
Cranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, false >	Specialization 1 The client supplies a probe function and a ranged probe function, and requests that hash values not be stored
Cranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, true >	Specialization 2- The client supplies a probe function and a ranged probe function, and requests that hash values not be stored
Cranged_probe_fn< Key, null_type, _Alloc, Comb_Probe_Fn, null_type, false >	Specialization 3 and 4 The client does not supply a hash function or probe function, and requests that hash values not be stored
Crb_tree_node_	Node for Red-Black trees
Crb_tree_node_< Value_Type, null_type, _Alloc >
Crc	Redundant binary counter
Crc_binomial_heap	Redundant-counter binomial heap
Cresize_policy	Resize policy for binary heap
Csplay_tree_node_	Node for splay tree
Csplay_tree_node_< Value_Type, null_type, _Alloc >
Cstored_data	Primary template for representation of stored data
Cstored_data< _Tv, null_type >	Specialization for representation of stored data of just value type
Cstored_hash	Stored hash
Cstored_value	Stored value
Csynth_access_traits	Synthetic element access traits
Cthin_heap	Thin heap
Ctree_metadata_helper	Tree metadata helper
Ctree_metadata_helper< Node_Update, false >	Specialization, false
Ctree_metadata_helper< Node_Update, true >	Specialization, true
Ctree_node_metadata_dispatch	Tree node metadata dispatch
Ctree_traits	Tree traits class, primary template
Ctree_traits< Key, Mapped, Cmp_Fn, Node_Update, ov_tree_tag, _Alloc >	Tree traits
Ctree_traits< Key, Mapped, Cmp_Fn, Node_Update, rb_tree_tag, _Alloc >	Specialization
Ctree_traits< Key, Mapped, Cmp_Fn, Node_Update, splay_tree_tag, _Alloc >	Specialization
Ctree_traits< Key, null_type, Cmp_Fn, Node_Update, ov_tree_tag, _Alloc >	Specialization
Ctree_traits< Key, null_type, Cmp_Fn, Node_Update, rb_tree_tag, _Alloc >	Specialization
Ctree_traits< Key, null_type, Cmp_Fn, Node_Update, splay_tree_tag, _Alloc >	Specialization
Ctrie_metadata_helper	Trie metadata helper
Ctrie_metadata_helper< Node_Update, false >	Specialization, false
Ctrie_metadata_helper< Node_Update, true >	Specialization, true
Ctrie_node_metadata_dispatch	Trie node metadata dispatch
Ctrie_policy_base	Base class for trie policies
Ctrie_traits	Trie traits class, primary template
Ctrie_traits< Key, Mapped, _ATraits, Node_Update, pat_trie_tag, _Alloc >	Specialization
Ctrie_traits< Key, null_type, _ATraits, Node_Update, pat_trie_tag, _Alloc >	Specialization
Ctype_base	Primary template
Ctype_base< Key, Mapped, _Alloc, false >	Specialization of type_base for the case where the hash value is not stored alongside each value
Ctype_base< Key, Mapped, _Alloc, true >	Specialization of type_base for the case where the hash value is stored alongside each value
Ctype_base< Key, null_type, _Alloc, false >	Specialization of type_base for the case where the hash value is not stored alongside each value
Ctype_base< Key, null_type, _Alloc, true >	Specialization of type_base for the case where the hash value is stored alongside each value
Ctype_dispatch	Type base dispatch
Ctype_to_type
Ctypes_traits	Traits for abstract types
Cassociative_tag	Basic associative-container
Cbasic_branch	A branched, tree-like (tree, trie) container abstraction
Cbasic_branch_tag	Basic branch structure
Cbasic_hash_table	A hashed container abstraction
Cbasic_hash_tag	Basic hash structure
Cbasic_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
Cbinary_heap_tag	Binary-heap (array-based)
Cbinomial_heap_tag	Binomial-heap
Ccc_hash_max_collision_check_resize_trigger	A resize trigger policy based on collision checks
Ccc_hash_table	A collision-chaining hash-based associative container
Ccc_hash_tag	Collision-chaining hash
Ccontainer_error	Base class for exceptions
Ccontainer_tag	Base data structure tag
Ccontainer_traits	Container traits
Ccontainer_traits_base	Primary template, container traits base
Ccontainer_traits_base< binary_heap_tag >	Specialization, binary heap
Ccontainer_traits_base< binomial_heap_tag >	Specialization, binomial heap
Ccontainer_traits_base< cc_hash_tag >	Specialization, cc hash
Ccontainer_traits_base< gp_hash_tag >	Specialization, gp hash
Ccontainer_traits_base< list_update_tag >	Specialization, list update
Ccontainer_traits_base< ov_tree_tag >	Specialization, ov tree
Ccontainer_traits_base< pairing_heap_tag >	Specialization, pairing heap
Ccontainer_traits_base< pat_trie_tag >	Specialization, pat trie
Ccontainer_traits_base< rb_tree_tag >	Specialization, rb tree
Ccontainer_traits_base< rc_binomial_heap_tag >	Specialization, rc binomial heap
Ccontainer_traits_base< splay_tree_tag >	Specialization, splay tree
Ccontainer_traits_base< thin_heap_tag >	Specialization, thin heap
Cdirect_mask_range_hashing	A mask range-hashing class (uses a bitmask)
Cdirect_mod_range_hashing	A mod range-hashing class (uses the modulo function)
Cgp_hash_table	A general-probing hash-based associative container
Cgp_hash_tag	General-probing hash
Chash_exponential_size_policy	A size policy whose sequence of sizes form an exponential sequence (typically powers of 2
Chash_load_check_resize_trigger	A resize trigger policy based on a load check
Chash_prime_size_policy	A size policy whose sequence of sizes form a nearly-exponential sequence of primes
Chash_standard_resize_policy	A resize policy which delegates operations to size and trigger policies
Cinsert_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)
Cjoin_error	A join cannot be performed logical reasons (i.e., the ranges of the two container objects being joined overlaps
Clinear_probe_fn	A probe sequence policy using fixed increments
Clist_update	A list-update based associative container
Clist_update_tag	List-update
Clu_counter_policy	A list-update policy that moves elements to the front of the list based on the counter algorithm
Clu_move_to_front_policy	A list-update policy that unconditionally moves elements to the front of the list
Cnull_node_update	A null node updator, indicating that no node updates are required
Cnull_type	Represents no type, or absence of type, for template tricks
Cov_tree_tag	Ordered-vector tree
Cpairing_heap_tag	Pairing-heap
Cpat_trie_tag	PATRICIA trie
Cpoint_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
Cpriority_queue	A priority queue composed of one specific heap policy
Cpriority_queue_tag	Basic priority-queue
Cquadratic_probe_fn	A probe sequence policy using square increments
Crange_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
Crb_tree_tag	Red-black tree
Crc_binomial_heap_tag	Redundant-counter binomial-heap
Cresize_error	A container cannot be resized
Csample_probe_fn	A sample probe policy
Csample_range_hashing	A sample range-hashing functor
Csample_ranged_hash_fn	A sample ranged-hash functor
Csample_ranged_probe_fn	A sample ranged-probe functor
Csample_resize_policy	A sample resize policy
Csample_resize_trigger	A sample resize trigger policy
Csample_size_policy	A sample size policy
Csample_tree_node_update	A sample node updator
Csample_trie_access_traits	A sample trie element access traits
Csample_trie_node_update	A sample node updator
Csample_update_policy	A sample list-update policy
Csequence_tag	Basic sequence
Csplay_tree_tag	Splay tree
Cstring_tag	Basic string container, inclusive of strings, ropes, etc
Cthin_heap_tag	Thin heap
Ctree	A tree-based container
Ctree_order_statistics_node_update	Functor updating ranks of entrees
Ctree_tag	Basic tree structure
Ctrie	A trie-based container
Ctrie_order_statistics_node_update	Functor updating ranks of entrees
Ctrie_prefix_search_node_update	A node updator that allows tries to be searched for the range of values that match a certain prefix
Ctrie_string_access_traits	Element access traits for string types
Ctrie_tag	Basic trie structure
Ctrivial_iterator_tag	A trivial iterator tag
►N__gnu_profile	GNU profile code for public use
C__container_size_info	A container size instrumentation line in the object table
C__container_size_stack_info	A container size instrumentation line in the stack table
C__cost_factor
C__cost_factor_setter
C__cost_factor_writer
C__hashfunc_info	A hash performance instrumentation line in the object table
C__hashfunc_stack_info	A hash performance instrumentation line in the stack table
C__list2slist_info
C__list2slist_stack_info
C__list2vector_info	A list-to-vector instrumentation line in the object table
C__list2vector_stack_info
C__map2umap_info	A map-to-unordered_map instrumentation line in the object table
C__map2umap_stack_info	A map-to-unordered_map instrumentation line in the stack table
C__object_info_base	Base class for a line in the object table
C__reentrance_guard	Reentrance guard
C__stack_hash	Hash function for summary trace using call stack as index
C__trace_base	Base class for all trace producers
C__trace_container_size	Container size instrumentation trace producer
C__trace_hash_func	Hash performance instrumentation producer
C__trace_hashtable_size	Hashtable size instrumentation trace producer
C__trace_list_to_slist
C__trace_list_to_vector
C__trace_map2umap	Map-to-unordered_map instrumentation producer
C__trace_vector_size	Hashtable size instrumentation trace producer
C__trace_vector_to_list	Vector-to-list instrumentation producer
C__vector2list_info	A vector-to-list instrumentation line in the object table
C__vector2list_stack_info	A vector-to-list instrumentation line in the stack table
C__warn
C__warning_data	Representation of a warning
►Njava
►Nstd	STL namespace
►N__exception_ptr
Cexception_ptr	An opaque pointer to an arbitrary exception
►Nsun
►Nawt
CCausedFocusEvent
C__mini_vector
C__versa_string
C_Bitmap_counter
C_Ffit_finder
C_SafeBase
Cbasic_string
CComb_Hash_Fn
CComb_Probe_Fn
Cconst_iterator_	Const range-type iterator
CEq_Fn
Cfree_list
CHash_Fn
Citerator_	Range-type iterator
CFocusEvent
CPB_DS_RB_TREE_BASE_NAME
CPB_DS_S_TREE_BASE_NAME
Cpoint_const_iterator_	Const point-type iterator
Cpoint_iterator_	Find type iterator
CPred
CProbe_Fn
CResize_Policy
CSize_Policy
CTrigger_Policy