Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12345]
| ▼N__cxxabiv1 | |
| C__forced_unwind | Thrown as part of forced unwinding.A magic placeholder class that can be caught by reference to recognize forced unwinding |
| ▼N__gnu_cxx | GNU extensions for public use |
| ▼N__detail | Implementation details not part of the namespace __gnu_cxx interface |
| C__mini_vector | __mini_vector<> is a stripped down version of the full-fledged std::vector<> |
| C_Bitmap_counter | The bitmap counter which acts as the bitmap manipulator, and manages the bit-manipulation functions and the searching and identification functions on the bit-map |
| C_Ffit_finder | The class which acts as a predicate for applying the first-fit memory allocation policy for the bitmap allocator |
| C__alloc_traits | Uniform interface to C++98 and C++0x allocators |
| C__common_pool_policy | Policy for shared __pool objects |
| C__mt_alloc | This is a fixed size (power of 2) allocator which - when compiled with thread support - will maintain one freelist per size per thread plus a global one. Steps are taken to limit the per thread freelist sizes (by returning excess back to the global list).Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt12ch32.html |
| C__mt_alloc_base | Base class for _Tp dependent member functions |
| C__per_type_pool_policy | Policy for individual __pool objects |
| C__pool | Data describing the underlying memory pool, parameterized on threading support |
| C__pool< false > | Specialization for single thread |
| C__pool< true > | Specialization for thread enabled, via gthreads.h |
| C__pool_alloc | Allocator using a memory pool with a single lock |
| C__pool_alloc_base | Base class for __pool_alloc |
| C__pool_base | Base class for pool object |
| C__rc_string_base | |
| C__scoped_lock | Scoped lock idiom |
| C__versa_string | Template class __versa_string.Data structure managing sequences of characters and character-like objects |
| C_Caster | |
| C_Char_types | Mapping from character type to associated types |
| C_ExtPtr_allocator | An example allocator which uses a non-standard pointer type.This allocator specifies that containers use a 'relative pointer' as it's pointer type. (See ext/pointer.h) Memory allocation in this example is still performed using std::allocator |
| C_Invalid_type | |
| C_Pointer_adapter | |
| C_Relative_pointer_impl | A storage policy for use with _Pointer_adapter<> which stores the pointer's address as an offset value which is relative to its own address |
| C_Relative_pointer_impl< const _Tp > | |
| C_Std_pointer_impl | A storage policy for use with _Pointer_adapter<> which yields a standard pointer |
| C_Unqualified_type | |
| Cannotate_base | Base class for checking address and label information about allocations. Create a std::map between the allocated address (void*) and a datum for annotations, which are a pair of numbers corresponding to label and allocated size |
| Carray_allocator | An allocator that uses previously allocated memory. This memory can be externally, globally, or otherwise allocated |
| Carray_allocator_base | Base class |
| Cbitmap_allocator | Bitmap Allocator, primary template |
| Cchar_traits | Base class used to implement std::char_traits |
| Ccharacter | A POD class that serves as a character abstraction class |
| Ccondition_base | Base struct for condition policy |
| Cdebug_allocator | A meta-allocator with debugging bits.This is precisely the allocator defined in the C++03 Standard |
| Cenc_filebuf | Class enc_filebuf |
| Cencoding_char_traits | Encoding_char_traits |
| Cencoding_state | Extension to use iconv for dealing with character encodings |
| Cforced_error | Thown by exception safety machinery |
| Cfree_list | The free list class for managing chunks of memory to be given to and returned by the bitmap_allocator |
| ▼Climit_condition | Base class for incremental control and throw |
| Calways_adjustor | Always enter the condition |
| Climit_adjustor | Enter the nth condition |
| Cnever_adjustor | Never enter the condition |
| Cmalloc_allocator | An allocator that uses malloc.This is precisely the allocator defined in the C++ Standard |
| Cnew_allocator | An allocator that uses global new, as per [20.4].This is precisely the allocator defined in the C++ Standard |
| ▼Crandom_condition | Base class for random probability control and throw |
| Calways_adjustor | Always enter the condition |
| Cgroup_adjustor | Group condition |
| Cnever_adjustor | Never enter the condition |
| Crecursive_init_error | Exception thrown by __cxa_guard_acquire.6.7[stmt.dcl]/4: If control re-enters the declaration (recursively) while the object is being initialized, the behavior is undefined |
| Cstdio_filebuf | Provides a layer of compatibility for C/POSIX.This GNU extension provides extensions for working with standard C FILE*'s and POSIX file descriptors. It must be instantiated by the user with the type of character used in the file stream, e.g., stdio_filebuf<char> |
| Cstdio_sync_filebuf | Provides a layer of compatibility for C.This GNU extension provides extensions for working with standard C FILE*'s. It must be instantiated by the user with the type of character used in the file stream, e.g., stdio_filebuf<char> |
| Cthrow_allocator_base | Allocator class with logging and exception generation control. Intended to be used as an allocator_type in templatized code.Note: Deallocate not allowed to throw |
| Cthrow_allocator_limit | Allocator throwing via limit condition |
| Cthrow_allocator_random | Allocator throwing via random condition |
| Cthrow_value_base | Class with exception generation control. Intended to be used as a value_type in templatized code |
| Cthrow_value_limit | Type throwing via limit condition |
| Cthrow_value_random | Type throwing via random condition |
| ▼N__gnu_debug | GNU debug classes for public use |
| C_After_nth_from | |
| C_BeforeBeginHelper | |
| C_Equal_to | |
| C_Not_equal_to | |
| C_Safe_iterator | Safe iterator wrapper |
| C_Safe_iterator_base | Basic functionality for a safe iterator |
| C_Safe_local_iterator | Safe iterator wrapper |
| C_Safe_local_iterator_base | Basic functionality for a safe iterator |
| 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 |
| ▼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__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__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__replace_if_selector | Std::replace() selector |
| C__replace_selector | Std::replace() selector |
| 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_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. The usual iterator operations are applied to both child iterators |
| C_IteratorTriple | A triple of iterators. The usual iterator operations are applied to all three child iterators |
| C_Job | One __job for a certain thread |
| C_Less | Similar to std::less, but allows two different types |
| 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_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_Multiplies | Similar to std::multiplies, but allows two different types |
| C_Nothing | Functor doing nothing |
| C_Piece | Subsequence description |
| C_Plus | Similar to std::plus, but allows two different types |
| C_PMWMSSortingData | Data accessed by all threads |
| C_PseudoSequence | Sequence that conceptually consists of multiple copies of the same element. The copies are not stored explicitly, of course |
| C_PseudoSequenceIterator | _Iterator associated with __gnu_parallel::_PseudoSequence. If features the usual random-access iterator functionality |
| 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. push_front() and pop_front() must not be called concurrently to each other, while pop_back() can be called concurrently at all times. empty(), size(), and top() are intentionally not provided. Calling them would not make sense in a concurrent setting |
| 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 |
| 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 | |
| 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 | |
| Cbinary_heap_const_iterator_ | Const point-type iterator |
| Cbinary_heap_point_const_iterator_ | Const point-type iterator |
| Cbinomial_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 |
| Ccc_ht_map | |
| Ccond_dealtor | Conditional deallocate constructor argument |
| 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 | 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 |
| Centry_pred< _VTp, Pred, _Alloc, true > | Specialization, true |
| Ceq_by_less | Equivalence function |
| Cgp_ht_map | |
| 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, true > | Specializations |
| 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_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 | List-based (with updates) associative container. Skip to the lu, my darling |
| 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_map | Ordered-vector tree associative-container |
| Ccond_dtor | Conditional destructor |
| Cov_tree_node_const_it_ | Const node reference |
| Cov_tree_node_it_ | Node reference |
| Cpairing_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 |
| Cpat_trie_map | PATRICIA trie.This implementation loosely borrows ideas from: 1) Fast Mergeable Integer Maps, Okasaki, Gill 1998 2) Ptset: Sets of integers implemented as Patricia trees, Jean-Christophe Filliatr, 2000 |
| Cprobe_fn_base | Probe functor base |
| Cranged_hash_fn | Primary template |
| Cranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, false > | |
| Cranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, true > | |
| Cranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, false > | |
| Cranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, true > | |
| Cranged_probe_fn | Primary template |
| Cranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, false > | |
| Cranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, true > | |
| Cranged_probe_fn< Key, null_type, _Alloc, Comb_Probe_Fn, null_type, false > | |
| Crb_tree_map | Red-Black tree.This implementation uses an idea from the SGI STL (using a header node which is needed for efficient iteration) |
| Crb_tree_node_ | Node for Red-Black trees |
| Crc | Redundant binary counter |
| Crc_binomial_heap | |
| Cresize_policy | Resize policy for binary heap |
| Csplay_tree_map | Splay tree |
| Csplay_tree_node_ | Node for splay tree |
| Cstored_data | Primary template for representation of stored data. Two types of data can be stored: value and hash |
| 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 | |
| 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 > | |
| Ctype_base< Key, Mapped, _Alloc, true > | |
| Ctype_base< Key, null_type, _Alloc, false > | |
| Ctype_base< Key, null_type, _Alloc, true > | |
| Ctype_dispatch | Type base dispatch |
| Ctypes_traits | Traits for abstract types |
| Cassociative_tag | Basic associative-container |
| Cbasic_branch | |
| Cbasic_branch_tag | Basic branch structure |
| Cbasic_hash_table | |
| Cbasic_hash_tag | Basic hash structure |
| Cbasic_invalidation_guarantee | |
| 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. It keeps the simulated load factor lower than some given load factor |
| Ccc_hash_table | |
| 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 | |
| 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. It keeps the load factor between some load factors load_min and load_max |
| 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 | |
| Clist_update_tag | List-update |
| Clu_counter_policy | |
| Clu_move_to_front_policy | |
| 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 | |
| Cpriority_queue | |
| Cpriority_queue_tag | Basic priority-queue |
| Cquadratic_probe_fn | A probe sequence policy using square increments |
| Crange_invalidation_guarantee | |
| 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 | |
| Ctree_order_statistics_node_update | Functor updating ranks of entrees |
| Ctree_tag | Basic tree structure |
| Ctrie | |
| 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 | |
| Ctrie_tag | Basic trie structure |
| Ctrivial_iterator_tag | A trivial iterator tag. Signifies that the iterators has none of std::iterators's movement abilities |
| ▼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__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__list2vector_info | A list-to-vector instrumentation line in the object table |
| 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__stack_info_base | Base class for a line in the stack table |
| 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_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__warning_data | Representation of a warning |
| ▼Nstd | ISO C++ entities toplevel namespace is std |
| ▼N__debug | GNU debug code, replaces standard behavior with debug behavior |
| Cmap | Class std::map with safety/checking/debug instrumentation |
| Cmultimap | Class std::multimap with safety/checking/debug instrumentation |
| Cmultiset | Class std::multiset with safety/checking/debug instrumentation |
| Cset | Class std::set with safety/checking/debug instrumentation |
| ▼N__detail | Implementation details not part of the namespace std interface |
| C_BracketMatcher | Matches a character range (bracket expression) |
| C_Compiler | Builds an NFA from an input iterator interval |
| C_Default_ranged_hash | Default ranged hash function H. In principle it should be a function object composed from objects of type H1 and H2 such that h(k, N) = h2(h1(k), N), but that would mean making extra copies of h1 and h2. So instead we'll just use a tag to tell class template hashtable to do that composition |
| C_Equal_helper | |
| C_Equal_helper< _Key, _Value, _ExtractKey, _Equal, _HashCodeType, false > | Specialization |
| C_Equal_helper< _Key, _Value, _ExtractKey, _Equal, _HashCodeType, true > | Specialization |
| C_Equality | |
| C_Equality< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, false > | Specialization |
| C_Equality< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true > | Specialization |
| C_Equality_base | |
| C_Executor | Takes a regex and an input string in and do the matching |
| C_Hash_code_base | |
| C_Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Default_ranged_hash, false > | Specialization: hash function and range-hashing function, no caching of hash codes. Provides typedef and accessor required by C++ 11 |
| C_Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Default_ranged_hash, true > | Specialization: hash function and range-hashing function, caching hash codes. H is provided but ignored. Provides typedef and accessor required by C++ 11 |
| C_Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, false > | Specialization: ranged hash function, no caching hash codes. H1 and H2 are provided but ignored. We define a dummy hash code type |
| C_Hash_node | |
| C_Hash_node< _Value, false > | |
| C_Hash_node< _Value, true > | |
| C_Hash_node_base | |
| C_Hash_node_value_base | |
| C_Hashtable_alloc | |
| C_Hashtable_base | |
| C_Hashtable_ebo_helper | |
| C_Hashtable_ebo_helper< _Nm, _Tp, false > | Specialization not using EBO |
| C_Hashtable_ebo_helper< _Nm, _Tp, true > | Specialization using EBO |
| C_Hashtable_traits | |
| C_Insert | |
| C_Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, false, _Unique_keys > | Specialization |
| C_Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true, false > | Specialization |
| C_Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true, true > | Specialization |
| C_Insert_base | |
| C_List_node_base | Common part of a node in the list |
| C_Local_const_iterator | Local const_iterators |
| C_Local_iterator | Local iterators |
| C_Local_iterator_base | |
| C_Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, true > | Partial specialization used when nodes contain a cached hash code |
| C_Map_base | |
| C_Map_base< _Key, _Pair, _Alloc, _Select1st, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, false > | Partial specialization, __unique_keys set to false |
| C_Map_base< _Key, _Pair, _Alloc, _Select1st, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true > | Partial specialization, __unique_keys set to true |
| C_Mod_range_hashing | Default range hashing function: use division to fold a large number into the range [0, N) |
| C_Node_const_iterator | Node const_iterators, used to iterate through all the hashtable |
| C_Node_iterator | Node iterators, used to iterate through all the hashtable |
| C_Node_iterator_base | Base class for node iterators |
| C_Prime_rehash_policy | Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load factor small enough |
| C_Rehash_base | |
| C_Rehash_base< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _Prime_rehash_policy, _Traits > | Specialization |
| C_Scanner | Scans an input range for regex tokens |
| C_StateSeq | Describes a sequence of one or more _State, its current start and end(s). This structure contains fragments of an NFA during construction |
| ▼N__exception_ptr | |
| Cexception_ptr | An opaque pointer to an arbitrary exception |
| ▼N__parallel | GNU parallel code, replaces standard behavior with parallel behavior |
| C_CRandNumber | Functor wrapper for std::rand() |
| ▼N__profile | GNU profile code, replaces standard behavior with profile behavior |
| Cmap | Class std::map wrapper with performance instrumentation |
| Cmultimap | Class std::multimap wrapper with performance instrumentation |
| Cmultiset | Class std::multiset wrapper with performance instrumentation |
| Cset | Class std::set wrapper with performance instrumentation |
| ▼Ntr1 | ISO C++ TR1 entities toplevel namespace is std::tr1 |
| ▼Ntr2 | ISO C++ TR2 entities toplevel namespace is std::tr2 |
| C__atomic_base | Base class for atomic integrals |
| C__atomic_base< _PTp * > | Partial specialization for pointer types |
| C__atomic_flag_base | Base type for atomic_flag |
| C__codecvt_abstract_base | Common base for codecvt functions |
| C__ctype_abstract_base | Common base for ctype facet |
| C__has_iterator_category_helper | Traits class for iterators |
| C_Deque_base | |
| C_Deque_iterator | A deque::iterator |
| C_Enable_copy_move | A mixin helper to conditionally enable or disable the copy/move special members |
| C_Enable_default_constructor | A mixin helper to conditionally enable or disable the default constructor |
| C_Enable_destructor | A mixin helper to conditionally enable or disable the default destructor |
| C_Enable_special_members | A mixin helper to conditionally enable or disable the special members |
| C_Fwd_list_base | Base class for forward_list |
| C_Fwd_list_const_iterator | A forward_list::const_iterator |
| C_Fwd_list_iterator | A forward_list::iterator |
| C_Fwd_list_node | A helper node class for forward_list. This is just a linked list with uninitialized storage for a data value in each node. There is a sorting utility method |
| C_Fwd_list_node_base | A helper basic node class for forward_list. This is just a linked list with nothing inside it. There are purely list shuffling utility methods here |
| C_Hashtable | |
| C_List_base | See bits/stl_deque.h's _Deque_base for an explanation |
| C_List_const_iterator | A list::const_iterator |
| C_List_iterator | A list::iterator |
| C_List_node | An actual node in the list |
| C_Sp_ebo_helper< _Nm, _Tp, false > | Specialization not using EBO |
| C_Sp_ebo_helper< _Nm, _Tp, true > | Specialization using EBO |
| C_Temporary_buffer | |
| C_Vector_base | See bits/stl_deque.h's _Deque_base for an explanation |
| Callocator | The standard allocator, as per [20.4] |
| Callocator< void > | Allocator<void> specialization |
| Callocator_arg_t | [allocator.tag] |
| Callocator_traits | Uniform interface to all allocator types |
| Catomic_flag | Atomic_flag |
| Cauto_ptr | A simple smart pointer providing strict ownership semantics |
| Cauto_ptr_ref | |
| Cback_insert_iterator | Turns assignment into insertion |
| Cbad_weak_ptr | Exception possibly thrown by shared_ptr |
| Cbasic_ios | Template class basic_ios, virtual base class for all stream classes |
| Cbasic_regex | |
| Cbasic_string | Managing sequences of characters and character-like objects |
| ▼Cbernoulli_distribution | A Bernoulli random number distribution |
| Cparam_type | |
| Cbidirectional_iterator_tag | Bidirectional iterators support a superset of forward iterator operations |
| Cbinary_function | |
| Cbinary_negate | One of the negation functors |
| Cbinder1st | One of the binder functors |
| Cbinder2nd | One of the binder functors |
| Cbinomial_distribution | A discrete binomial random number distribution |
| Ccauchy_distribution | A cauchy_distribution random number distribution |
| Cchar_traits | Basis for explicit traits specializations |
| Cchar_traits< __gnu_cxx::character | Char_traits<__gnu_cxx::character> specialization |
| Cchar_traits< char > | 21.1.3.1 char_traits specializations |
| Cchar_traits< wchar_t > | 21.1.3.2 char_traits specializations |
| Cchi_squared_distribution | A chi_squared_distribution random number distribution |
| Ccodecvt | Primary class template codecvt.NB: Generic, mostly useless implementation |
| Ccodecvt< _InternT, _ExternT, encoding_state > | Codecvt<InternT, _ExternT, encoding_state> specialization |
| Ccodecvt< char, char, mbstate_t > | Class codecvt<char, char, mbstate_t> specialization |
| Ccodecvt< wchar_t, char, mbstate_t > | Class codecvt<wchar_t, char, mbstate_t> specialization |
| Ccodecvt_base | Empty base class for codecvt facet [22.2.1.5] |
| Ccodecvt_byname | Class codecvt_byname [22.2.1.6] |
| Ccollate | Facet for localized string comparison |
| Ccollate_byname | Class collate_byname [22.2.4.2] |
| Cconst_mem_fun1_ref_t | One of the adaptors for member pointers |
| Cconst_mem_fun1_t | One of the adaptors for member pointers |
| Cconst_mem_fun_ref_t | One of the adaptors for member pointers |
| Cconst_mem_fun_t | One of the adaptors for member pointers |
| Cctype | Primary class template ctype facet.This template class defines classification and conversion functions for character sets. It wraps cctype functionality. Ctype gets used by streams for many I/O operations |
| Cctype< char > | The ctype<char> specialization.This class defines classification and conversion functions for the char type. It gets used by char streams for many I/O operations. The char specialization provides a number of optimizations as well |
| Cctype< wchar_t > | The ctype<wchar_t> specialization.This class defines classification and conversion functions for the wchar_t type. It gets used by wchar_t streams for many I/O operations. The wchar_t specialization provides a number of optimizations as well |
| Cctype_base | Base class for ctype |
| Cctype_byname | Class ctype_byname [22.2.1.2] |
| Cctype_byname< char > | 22.2.1.4 Class ctype_byname specializations |
| Cdefault_delete | Primary template of default_delete, used by unique_ptr |
| Cdefault_delete< _Tp[]> | Specialization for arrays, default_delete |
| Cdeque | A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end |
| Cdiscard_block_engine | |
| Cdiscrete_distribution | A discrete_distribution random number distribution |
| Cdivides | One of the math functors |
| Cenable_shared_from_this | Base class allowing use of member function shared_from_this |
| Cequal_to | One of the comparison functors |
| Cexponential_distribution | An exponential continuous distribution for random numbers |
| Cextreme_value_distribution | A extreme_value_distribution random number distribution |
| Cfisher_f_distribution | A fisher_f_distribution random number distribution |
| Cforward_iterator_tag | Forward iterators support a superset of input iterator operations |
| Cforward_list | A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence |
| Cfpos | Class representing stream positions |
| Cfront_insert_iterator | Turns assignment into insertion |
| Cgamma_distribution | A gamma continuous distribution for random numbers |
| Cgeometric_distribution | A discrete geometric random number distribution |
| Cgreater | One of the comparison functors |
| Cgreater_equal | One of the comparison functors |
| Cgslice | Class defining multi-dimensional subset of an array |
| Cgslice_array | Reference to multi-dimensional subset of an array |
| Chash | Primary class template hash |
| Chash< __gnu_cxx::__u16vstring > | Std::hash specialization for __u16vstring |
| Chash< __gnu_cxx::__u32vstring > | Std::hash specialization for __u32vstring |
| Chash< __gnu_cxx::__vstring > | Std::hash specialization for __vstring |
| Chash< __gnu_cxx::__wvstring > | Std::hash specialization for __wvstring |
| Chash< __gnu_cxx::throw_value_limit > | Explicit specialization of std::hash for __gnu_cxx::throw_value_limit |
| Chash< __gnu_cxx::throw_value_random > | Explicit specialization of std::hash for __gnu_cxx::throw_value_random |
| Chash< __shared_ptr< _Tp, _Lp > > | Std::hash specialization for __shared_ptr |
| Chash< _Tp * > | Partial specializations for pointer types |
| Chash< bool > | Explicit specialization for bool |
| Chash< char > | Explicit specialization for char |
| Chash< char16_t > | Explicit specialization for char16_t |
| Chash< char32_t > | Explicit specialization for char32_t |
| Chash< double > | Specialization for double |
| Chash< float > | Specialization for float |
| Chash< int > | Explicit specialization for int |
| Chash< long > | Explicit specialization for long |
| Chash< long double > | Specialization for long double |
| Chash< long long > | Explicit specialization for long long |
| Chash< shared_ptr< _Tp > > | Std::hash specialization for shared_ptr |
| Chash< short > | Explicit specialization for short |
| Chash< signed char > | Explicit specialization for signed char |
| Chash< string > | Std::hash specialization for string |
| Chash< u16string > | Std::hash specialization for u16string |
| Chash< u32string > | Std::hash specialization for u32string |
| Chash< unique_ptr< _Tp, _Dp > > | Std::hash specialization for unique_ptr |
| Chash< unsigned char > | Explicit specialization for unsigned char |
| Chash< unsigned int > | Explicit specialization for unsigned int |
| Chash< unsigned long > | Explicit specialization for unsigned long |
| Chash< unsigned long long > | Explicit specialization for unsigned long long |
| Chash< unsigned short > | Explicit specialization for unsigned short |
| Chash< wchar_t > | Explicit specialization for wchar_t |
| Chash< wstring > | Std::hash specialization for wstring |
| Chash<::vector | Std::hash specialization for vector<bool> |
| Cindependent_bits_engine | |
| Cindirect_array | Reference to arbitrary subset of an array |
| Cinput_iterator_tag | Marking input iterators |
| Cinsert_iterator | Turns assignment into insertion |
| ▼Cios_base | The base of the I/O class hierarchy.This class defines everything that can be defined about I/O that does not depend on the type of characters being input or output. Most people will only see ios_base when they need to specify the full name of the various I/O flags (e.g., the openmodes) |
| Cfailure | These are thrown to indicate problems with io.27.4.2.1.1 Class ios_base::failure |
| Cistream_iterator | Provides input iterator semantics for streams |
| Cistreambuf_iterator | Provides input iterator semantics for streambufs |
| Citerator | Common iterator class |
| Citerator_traits< _Tp * > | Partial specialization for pointer types |
| Citerator_traits< const _Tp * > | Partial specialization for const pointer types |
| Cless | One of the comparison functors |
| Cless_equal | One of the comparison functors |
| Clinear_congruential_engine | A model of a linear congruential random number generator |
| Clist | A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence |
| ▼Clocale | Container class for localization functionality.The locale class is first a class wrapper for C library locales. It is also an extensible container for user-defined localization. A locale is a collection of facets that implement various localization features such as money, time, and number printing |
| Cfacet | Localization functionality base class.The facet class is the base class for a localization feature, such as money, time, and number printing. It provides common support for facets and reference management |
| Cid | Facet ID class.The ID class provides facets with an index used to identify them. Every facet class must define a public static member locale::id, or be derived from a facet that provides this member, otherwise the facet cannot be used in a locale. The locale::id ensures that each class type gets a unique identifier |
| Clogical_and | One of the Boolean operations functors |
| Clogical_not | One of the Boolean operations functors |
| Clogical_or | One of the Boolean operations functors |
| Clognormal_distribution | A lognormal_distribution random number distribution |
| Cmap | A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time |
| Cmask_array | Reference to selected subset of an array |
| Cmatch_results | The results of a match or search operation |
| Cmem_fun1_ref_t | One of the adaptors for member pointers |
| Cmem_fun1_t | One of the adaptors for member pointers |
| Cmem_fun_ref_t | One of the adaptors for member pointers |
| Cmem_fun_t | One of the adaptors for member pointers |
| Cmersenne_twister_engine | |
| Cmessages | Primary class template messages.This facet encapsulates the code to retrieve messages from message catalogs. The only thing defined by the standard for this facet is the interface. All underlying functionality is implementation-defined |
| Cmessages_base | Messages facet base class providing catalog typedef |
| Cmessages_byname | Class messages_byname [22.2.7.2] |
| Cminus | One of the math functors |
| Cmodulus | One of the math functors |
| Cmoney_base | Money format ordering data.This class contains an ordered array of 4 fields to represent the pattern for formatting a money amount. Each field may contain one entry from the part enum. symbol, sign, and value must be present and the remaining field must contain either none or space |
| Cmoney_get | Primary class template money_get.This facet encapsulates the code to parse and return a monetary amount from a string |
| Cmoney_put | Primary class template money_put.This facet encapsulates the code to format and output a monetary amount |
| Cmoneypunct | Primary class template moneypunct.This facet encapsulates the punctuation, grouping and other formatting features of money amount string representations |
| Cmoneypunct_byname | Class moneypunct_byname [22.2.6.4] |
| Cmove_iterator | |
| Cmultimap | A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time |
| Cmultiplies | One of the math functors |
| Cmultiset | A standard container made up of elements, which can be retrieved in logarithmic time |
| Cnegate | One of the math functors |
| Cnegative_binomial_distribution | A negative_binomial_distribution random number distribution |
| Cnested_exception | Exception class with exception_ptr data member |
| Cnormal_distribution | A normal continuous distribution for random numbers |
| Cnot_equal_to | One of the comparison functors |
| Cnum_get | Primary class template num_get.This facet encapsulates the code to parse and return a number from a string. It is used by the istream numeric extraction operators |
| Cnum_put | Primary class template num_put.This facet encapsulates the code to convert a number to a string. It is used by the ostream numeric insertion operators |
| Cnumpunct | Primary class template numpunct.This facet stores several pieces of information related to printing and scanning numbers, such as the decimal point character. It takes a template parameter specifying the char type. The numpunct facet is used by streams for many I/O operations involving numbers |
| Cnumpunct_byname | Class numpunct_byname [22.2.3.2] |
| Costream_iterator | Provides output iterator semantics for streams |
| Costreambuf_iterator | Provides output iterator semantics for streambufs |
| Coutput_iterator_tag | Marking output iterators |
| Cowner_less | Primary template owner_less |
| Cowner_less< shared_ptr< _Tp > > | Partial specialization of owner_less for shared_ptr |
| Cowner_less< weak_ptr< _Tp > > | Partial specialization of owner_less for weak_ptr |
| Cpair | Struct holding two objects of arbitrary type |
| Cpiecewise_constant_distribution | A piecewise_constant_distribution random number distribution |
| Cpiecewise_construct_t | Piecewise_construct_t |
| Cpiecewise_linear_distribution | A piecewise_linear_distribution random number distribution |
| Cplus | One of the math functors |
| Cpointer_to_binary_function | One of the adaptors for function pointers |
| Cpointer_to_unary_function | One of the adaptors for function pointers |
| Cpointer_traits | Uniform interface to all pointer-like types |
| Cpointer_traits< _Tp * > | Partial specialization for built-in pointers |
| Cpoisson_distribution | A discrete Poisson random number distribution |
| Cpriority_queue | A standard container automatically sorting its contents |
| Cqueue | A standard container giving FIFO behavior |
| Crandom_access_iterator_tag | Random-access iterators support a superset of bidirectional iterator operations |
| Crandom_device | |
| Craw_storage_iterator | |
| Cregex_error | A regular expression exception class.The regular expression library throws objects of this class on error |
| Cregex_iterator | |
| Cregex_token_iterator | |
| Cregex_traits | Describes aspects of a regular expression |
| Creverse_iterator | |
| Cseed_seq | Generates sequences of seeds for random number generators |
| Cset | A standard container made up of unique keys, which can be retrieved in logarithmic time |
| Cshared_ptr | A smart pointer with reference-counted copy semantics |
| Cshuffle_order_engine | Produces random numbers by combining random numbers from some base engine to produce random numbers with a specifies number of bits __w |
| Cslice | Class defining one-dimensional subset of an array |
| Cslice_array | Reference to one-dimensional subset of an array |
| Cstack | A standard container giving FILO behavior |
| Cstudent_t_distribution | A student_t_distribution random number distribution |
| Csub_match | |
| Ctime_base | Time format ordering data.This class provides an enum representing different orderings of time: day, month, and year |
| Ctime_get | Primary class template time_get.This facet encapsulates the code to parse and return a date or time from a string. It is used by the istream numeric extraction operators |
| Ctime_get_byname | Class time_get_byname [22.2.5.2] |
| Ctime_put | Primary class template time_put.This facet encapsulates the code to format and output dates and times according to formats used by strftime() |
| Ctime_put_byname | Class time_put_byname [22.2.5.4] |
| Cunary_function | |
| Cunary_negate | One of the negation functors |
| Cuniform_int_distribution | Uniform discrete distribution for random numbers. A discrete random distribution on the range ![$[min, max]$](form_5.png) with equal probability throughout the range |
| Cuniform_real_distribution | Uniform continuous distribution for random numbers |
| Cunique_ptr | 20.7.1.2 unique_ptr for single objects |
| Cunique_ptr< _Tp[], _Dp > | 20.7.1.3 unique_ptr for array objects with a runtime length |
| Cunordered_map | A standard container composed of unique keys (containing at most one of each key value) that associates values of another type with the keys |
| Cunordered_multimap | A standard container composed of equivalent keys (possibly containing multiple of each key value) that associates values of another type with the keys |
| Cunordered_multiset | A standard container composed of equivalent keys (possibly containing multiple of each key value) in which the elements' keys are the elements themselves |
| Cunordered_set | A standard container composed of unique keys (containing at most one of each key value) in which the elements' keys are the elements themselves |
| Cuses_allocator | Declare uses_allocator so it can be specialized in <queue> etc |
| Cvector | A standard container which offers fixed time access to individual elements in any order |
| Cvector< bool, _Alloc > | A specialization of vector for booleans which offers fixed time access to individual elements in any order |
| Cweak_ptr | A smart pointer with weak semantics |
| Cweibull_distribution | A weibull_distribution random number distribution |
| Cconst_iterator_ | Const range-type iterator |
| Citerator_ | Range-type iterator |
| Cpoint_const_iterator_ | Const point-type iterator |
| Cpoint_iterator_ | Find type iterator |
