| ►N__atomic0 | |
| Catomic_address | 29.4.2, address types |
| Catomic_bool | Atomic_bool |
| Catomic_flag | Atomic_flag |
| ►N__atomic2 | |
| Catomic_address | 29.4.2, address types |
| Catomic_bool | Atomic_bool |
| Catomic_flag | Atomic_flag |
| ►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__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 | 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 | |
| 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 |
| Cdebug_allocator | A meta-allocator with debugging bits, as per [20.4].This is precisely the allocator defined in the C++ Standard |
| Cenc_filebuf | Class enc_filebuf |
| Cencoding_char_traits | Encoding_char_traits |
| Cencoding_state | Extension to use iconv for dealing with character encodings |
| Cforced_exception_error | Thown by throw_allocator |
| Cfree_list | The free list class for managing chunks of memory to be given to and returned by the bitmap_allocator |
| 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 |
| Cstdio_filebuf | Provides a layer of compatibility for C/POSIX |
| Cstdio_sync_filebuf | Class stdio_sync_filebuf |
| Cthrow_allocator | Allocator class with logging and exception control |
| Cthrow_allocator_base | Base class |
| ►N__gnu_debug | GNU debug classes for public use |
| C__is_same | |
| C_After_nth_from | |
| C_Not_equal_to | |
| C_Safe_iterator | Safe iterator wrapper |
| C_Safe_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 |
| ►N__gnu_parallel | GNU parallel code for public use |
| C_Settings | Class _Settings Run-time settings for the parallel mode, including all tunable parameters |
| Caccumulate_binop_reduct | General reduction, using a binary operator |
| Caccumulate_selector | Std::accumulate() selector |
| Cadjacent_difference_selector | Selector that returns the difference between two adjacent elements |
| Cadjacent_find_selector | Test predicate on two adjacent elements |
| Cbalanced_quicksort_tag | Forces parallel sorting using balanced quicksort at compile time |
| Cbalanced_tag | Recommends parallel execution using dynamic load-balancing at compile time |
| Cbinder1st | Similar to std::binder1st, but giving the argument types explicitly |
| Cbinder2nd | Similar to std::binder2nd, but giving the argument types explicitly |
| Cconstant_size_blocks_tag | Selects the constant block size variant for std::find() |
| Ccount_if_selector | Std::count_if () selector |
| Ccount_selector | Std::count() selector |
| Cdefault_parallel_tag | Recommends parallel execution using the default parallel algorithm |
| CDRandomShufflingGlobalData | Data known to every thread participating in __gnu_parallel::parallel_random_shuffle() |
| CDRSSorterPU | Local data for a thread participating in __gnu_parallel::parallel_random_shuffle() |
| Cdummy_reduct | Reduction function doing nothing |
| Cequal_from_less | Constructs predicate for equality from strict weak ordering predicate |
| Cequal_split_tag | Selects the equal splitting variant for std::find() |
| Cequal_to | Similar to std::equal_to, but allows two different types |
| Cexact_tag | Forces parallel merging with exact splitting, at compile time |
| Cfill_selector | Std::fill() selector |
| Cfind_first_of_selector | Test predicate on several elements |
| Cfind_if_selector | Test predicate on a single element, used for std::find() and std::find_if () |
| Cfind_tag | Base class for for std::find() variants |
| Cfor_each_selector | Std::for_each() selector |
| Cgenerate_selector | Std::generate() selector |
| Cgeneric_find_selector | Base class of all __gnu_parallel::find_template selectors |
| Cgeneric_for_each_selector | Generic selector for embarrassingly parallel functions |
| Cgrowing_blocks_tag | Selects the growing block size variant for std::find() |
| Cguarded_iterator | Iterator wrapper supporting an implicit supremum at the end of the sequence, dominating all comparisons |
| Cidentity_selector | Selector that just returns the passed iterator |
| Cinner_product_selector | Std::inner_product() selector |
| Citerator_pair | A pair of iterators. The usual iterator operations are applied to both child iterators |
| Citerator_triple | A triple of iterators. The usual iterator operations are applied to all three child iterators |
| CJob | One job for a certain thread |
| Cless | Similar to std::less, but allows two different types |
| Clexicographic | Compare a pair of types lexicographically, ascending |
| Clexicographic_reverse | Compare a pair of types lexicographically, descending |
| Closer_tree_traits | Traits for determining whether the loser tree should use pointers or copies |
| CLoserTree | Stable LoserTree variant |
| CLoserTree< false, T, Comparator > | Unstable LoserTree variant |
| ►CLoserTreeBase | Guarded loser/tournament tree |
| CLoser | Internal representation of a LoserTree element |
| CLoserTreePointer | Stable LoserTree implementation |
| CLoserTreePointer< false, T, Comparator > | Unstable LoserTree implementation |
| ►CLoserTreePointerBase | Base class of Loser Tree implementation using pointers |
| CLoser | Internal representation of LoserTree elements |
| CLoserTreePointerUnguarded | Stable unguarded LoserTree variant storing pointers |
| CLoserTreePointerUnguarded< false, T, Comparator > | Unstable unguarded LoserTree variant storing pointers |
| CLoserTreePointerUnguardedBase | Unguarded loser tree, keeping only pointers to the elements in the tree structure |
| CLoserTreeUnguarded | Stable implementation of unguarded LoserTree |
| CLoserTreeUnguarded< false, T, Comparator > | Non-Stable implementation of unguarded LoserTree |
| CLoserTreeUnguardedBase | Base class for unguarded LoserTree implementation |
| Cmax_element_reduct | Reduction for finding the maximum element, using a comparator |
| Cmin_element_reduct | Reduction for finding the maximum element, using a comparator |
| Cmismatch_selector | Test inverted predicate on a single element |
| Cmultiplies | Similar to std::multiplies, but allows two different types |
| Cmultiway_merge_3_variant_sentinel_switch | Switch for 3-way merging with sentinels turned off |
| Cmultiway_merge_3_variant_sentinel_switch< true, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for 3-way merging with sentinels turned on |
| Cmultiway_merge_4_variant_sentinel_switch | Switch for 4-way merging with sentinels turned off |
| Cmultiway_merge_4_variant_sentinel_switch< true, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for 4-way merging with sentinels turned on |
| Cmultiway_merge_k_variant_sentinel_switch | Switch for k-way merging with sentinels turned on |
| Cmultiway_merge_k_variant_sentinel_switch< false, stable, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for k-way merging with sentinels turned off |
| 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 |
| Cnothing | Functor doing nothing |
| 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 |
| CPiece | Subsequence description |
| Cplus | Similar to std::plus, but allows two different types |
| CPMWMSSortingData | Data accessed by all threads |
| Cpseudo_sequence | Sequence that conceptually consists of multiple copies of the same element. The copies are not stored explicitly, of course |
| Cpseudo_sequence_iterator | Iterator associated with __gnu_parallel::pseudo_sequence. If features the usual random-access iterator functionality |
| CQSBThreadLocal | Information local to one thread in the parallel quicksort run |
| Cquicksort_tag | Forces parallel sorting using unbalanced quicksort at compile time |
| Crandom_number | Random number generator, based on the Mersenne twister |
| Creplace_if_selector | Std::replace() selector |
| Creplace_selector | Std::replace() selector |
| CRestrictedBoundedConcurrentQueue | 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 |
| Csampling_sorter | Stable sorting functor |
| Csampling_sorter< false, RandomAccessIterator, StrictWeakOrdering > | Non-stable sorting functor |
| Csampling_tag | Forces parallel merging with exact splitting, at compile time |
| Csequential_tag | Forces sequential execution at compile time |
| Csplit_consistently | Split consistently |
| Csplit_consistently< false, RandomAccessIterator, Comparator, SortingPlacesIterator > | Split by sampling |
| Csplit_consistently< true, RandomAccessIterator, Comparator, SortingPlacesIterator > | Split by exact splitting |
| Ctransform1_selector | Std::transform() selector, one input sequence variant |
| Ctransform2_selector | Std::transform() selector, two input sequences variant |
| Cunary_negate | Similar to std::binder1st, but giving the argument types explicitly |
| Cunbalanced_tag | Recommends parallel execution using static load-balancing at compile time |
| Cvoid_functor | Functor that does nothing |
| ►N__gnu_pbds | GNU extensions for policy-based data structures for public use |
| ►Ndetail | |
| Cvalue_type_base< Key, Mapped, Allocator, false > | |
| Cvalue_type_base< Key, Mapped, Allocator, true > | |
| Cvalue_type_base< Key, null_mapped_type, Allocator, false > | |
| Cvalue_type_base< Key, null_mapped_type, Allocator, true > | |
| Cassociative_container_tag | Basic associative-container |
| Cbasic_hash_tag | Basic hash |
| Cbasic_tree_tag | Basic tree |
| Cbinary_heap_tag | Binary-heap (array-based) |
| Cbinomial_heap_tag | Binomial-heap |
| Ccc_hash_tag | Collision-chaining hash |
| Ccontainer_tag | Base data structure tag |
| Ccontainer_traits | Container_traits |
| Ccontainer_traits_base | Base traits type for containers |
| Cgp_hash_tag | General-probing hash |
| Clist_update_tag | List-update |
| Cnull_mapped_type | A mapped-policy indicating that an associative container is a set |
| Cov_tree_tag | Ordered-vector tree |
| Cpairing_heap_tag | Pairing-heap |
| Cpat_trie_tag | PATRICIA trie |
| Cpriority_queue_tag | Basic priority-queue |
| Crb_tree_tag | Red-black tree |
| Crc_binomial_heap_tag | Redundant-counter binomial-heap |
| 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_tag | Tree |
| Ctrie_tag | Trie |
| ►Nstd | ISO C++ entities toplevel namespace is std |
| ►N__parallel | GNU parallel code, replaces standard behavior with parallel behavior |
| Cc_rand_number | Functor wrapper for std::rand() |
| ►Ntr1 | ISO C++ TR1 entities toplevel namespace is std::tr1 |
| ►N__detail | Implementation details not part of the namespace std::tr1 interface |
| C__floating_point_constant | A class to encapsulate type dependent floating point constants. Not everything will be able to be expressed as type logic |
| C__numeric_constants | A structure for numeric constants |
| C__codecvt_abstract_base | Common base for codecvt functions |
| C__ctype_abstract_base | Common base for ctype facet |
| C_Deque_base | |
| C_Deque_iterator | A deque::iterator |
| C_Fnv_hash | Dummy generic implementation (for sizeof(size_t) != 4, 8) |
| 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 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_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_List_node_base | Common part of a node in the list |
| 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].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt04ch11.html |
| Callocator< void > | Allocator<void> specialization |
| Cauto_ptr | A simple smart pointer providing strict ownership semantics |
| Cauto_ptr_ref | |
| Cback_insert_iterator | Turns assignment into insertion |
| Cbasic_ios | Virtual base class for all stream classes.Most of the member functions called dispatched on stream objects (e.g., std::cout.foo(bar);) are consolidated in this class |
| Cbasic_string | Managing sequences of characters and character-like objects |
| 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 |
| 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 |
| Ccodecvt | Class codecvt [22.2.1.5]. 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 | Template ctype facet |
| Cctype< char > | The ctype<char> specialization |
| Cctype< wchar_t > | The ctype<wchar_t> specialization |
| 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, default_delete |
| Cdefault_delete< _Tp[]> | Specialization, default_delete |
| Cdeque | A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end |
| Cdivides | One of the math functors |
| Cequal_to | One of the comparison functors |
| 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 |
| 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 | Class template hash |
| Chash< _Tp * > | Partial specializations for pointer types |
| 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 | |
| Cless | One of the comparison functors |
| Cless_equal | One of the comparison functors |
| 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 |
| Cfacet | Localization functionality base class |
| Cid | Facet ID class |
| Clogical_and | One of the Boolean operations functors |
| Clogical_not | One of the Boolean operations functors |
| Clogical_or | One of the Boolean operations functors |
| 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 |
| 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 |
| Cmessages | Facet for handling message catalogs |
| 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 |
| Cmoney_get | Facet for parsing monetary amounts |
| Cmoney_put | Facet for outputting monetary amounts |
| Cmoneypunct | Facet for formatting data for money amounts |
| 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 |
| Cnot_equal_to | One of the comparison functors |
| Cnum_get | Facet for parsing number strings |
| Cnum_put | Facet for converting numbers to strings |
| Cnumpunct | Numpunct facet |
| 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 |
| Cpair | Pair holds two objects of arbitrary type |
| 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 |
| 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 |
| Craw_storage_iterator | |
| Creference_wrapper | A convenience wrapper for creating a pair from two objects |
| Creverse_iterator | |
| Cset | A standard container made up of unique keys, which can be retrieved in logarithmic time |
| 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 |
| Ctime_base | Time format ordering data |
| Ctime_get | Facet for parsing dates and times |
| Ctime_get_byname | Class time_get_byname [22.2.5.2] |
| Ctime_put | Facet for outputting dates and times |
| Ctime_put_byname | Class time_put_byname [22.2.5.4] |
| Cunary_function | |
| Cunary_negate | One of the negation functors |
| Cunique_ptr | 20.7.12.2 unique_ptr for single objects |
| Cunique_ptr< _Tp[], _Tp_Deleter > | 20.7.12.3 unique_ptr for array objects with a runtime length |
| 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 |
1.8.9.1