 __atomic0 | |
  atomic_address | 29.4.2, address types |
  atomic_bool | Atomic_bool |
  atomic_flag | Atomic_flag |
 __atomic2 | |
  atomic_address | 29.4.2, address types |
  atomic_bool | Atomic_bool |
  atomic_flag | Atomic_flag |
 __cxxabiv1 | |
  __forced_unwind | Thrown as part of forced unwinding.A magic placeholder class that can be caught by reference to recognize forced unwinding |
 __gnu_cxx | GNU extensions for public use |
  __detail | Implementation details not part of the namespace __gnu_cxx interface |
   __mini_vector | __mini_vector<> is a stripped down version of the full-fledged std::vector<> |
   _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 |
   _Ffit_finder | The class which acts as a predicate for applying the first-fit memory allocation policy for the bitmap allocator |
  typelist | GNU typelist extensions for public compile-time use |
  __common_pool_policy | Policy for shared __pool objects |
  __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 |
  __mt_alloc_base | Base class for _Tp dependent member functions |
  __per_type_pool_policy | Policy for individual __pool objects |
  __pool< false > | Specialization for single thread |
  __pool< true > | Specialization for thread enabled, via gthreads.h |
  __pool_alloc | Allocator using a memory pool with a single lock |
  __pool_alloc_base | Base class for __pool_alloc |
  __pool_base | Base class for pool object |
  __rc_string_base | |
  __scoped_lock | Scoped lock idiom |
  __versa_string | Managing sequences of characters and character-like objects |
  _Caster | |
  _Char_types | Mapping from character type to associated types |
  _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 |
  _Invalid_type | |
  _Pointer_adapter | |
  _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 |
  _Relative_pointer_impl< const _Tp > | |
  _Std_pointer_impl | A storage policy for use with _Pointer_adapter<> which yields a standard pointer |
  _Unqualified_type | |
  array_allocator | An allocator that uses previously allocated memory. This memory can be externally, globally, or otherwise allocated |
  array_allocator_base | Base class |
  binary_compose | An SGI extension |
  bitmap_allocator | Bitmap Allocator, primary template |
  char_traits | Base class used to implement std::char_traits |
  character | A POD class that serves as a character abstraction class |
  constant_binary_fun | An SGI extension |
  constant_unary_fun | An SGI extension |
  constant_void_fun | An SGI extension |
  debug_allocator | A meta-allocator with debugging bits, as per [20.4].This is precisely the allocator defined in the C++ Standard |
  enc_filebuf | Class enc_filebuf |
  encoding_char_traits | Encoding_char_traits |
  encoding_state | Extension to use iconv for dealing with character encodings |
  forced_exception_error | Thown by throw_allocator |
  free_list | The free list class for managing chunks of memory to be given to and returned by the bitmap_allocator |
  hash_map | |
  hash_multimap | |
  hash_multiset | |
  hash_set | |
  malloc_allocator | An allocator that uses malloc.This is precisely the allocator defined in the C++ Standard |
  new_allocator | An allocator that uses global new, as per [20.4].This is precisely the allocator defined in the C++ Standard |
  project1st | An SGI extension |
  project2nd | An SGI extension |
  rb_tree | |
  rope | |
  select1st | An SGI extension |
  select2nd | An SGI extension |
  slist | |
  stdio_filebuf | Provides a layer of compatibility for C/POSIX |
  stdio_sync_filebuf | Class stdio_sync_filebuf |
  subtractive_rng | |
  temporary_buffer | |
  throw_allocator | Allocator class with logging and exception control |
  throw_allocator_base | Base class |
  unary_compose | An SGI extension |
 __gnu_debug | GNU debug classes for public use |
  __is_same | |
  _After_nth_from | |
  _Not_equal_to | |
  _Safe_iterator | Safe iterator wrapper |
  _Safe_iterator_base | Basic functionality for a "safe" iterator |
  _Safe_sequence | Base class for constructing a "safe" sequence type that tracks iterators that reference it |
  _Safe_sequence_base | Base class that supports tracking of iterators that reference a sequence |
 __gnu_internal | GNU implemenation details, not for public use or export. Used only when anonymous namespaces cannot be substituted |
 __gnu_parallel | GNU parallel code for public use |
  _Settings | Class _Settings Run-time settings for the parallel mode, including all tunable parameters |
  accumulate_binop_reduct | General reduction, using a binary operator |
  accumulate_selector | Std::accumulate() selector |
  adjacent_difference_selector | Selector that returns the difference between two adjacent elements |
  adjacent_find_selector | Test predicate on two adjacent elements |
  balanced_quicksort_tag | Forces parallel sorting using balanced quicksort at compile time |
  balanced_tag | Recommends parallel execution using dynamic load-balancing at compile time |
  binder1st | Similar to std::binder1st, but giving the argument types explicitly |
  binder2nd | Similar to std::binder2nd, but giving the argument types explicitly |
  constant_size_blocks_tag | Selects the constant block size variant for std::find() |
  count_if_selector | Std::count_if () selector |
  count_selector | Std::count() selector |
  default_parallel_tag | Recommends parallel execution using the default parallel algorithm |
  DRandomShufflingGlobalData | Data known to every thread participating in __gnu_parallel::parallel_random_shuffle() |
  DRSSorterPU | Local data for a thread participating in __gnu_parallel::parallel_random_shuffle() |
  dummy_reduct | Reduction function doing nothing |
  equal_from_less | Constructs predicate for equality from strict weak ordering predicate |
  equal_split_tag | Selects the equal splitting variant for std::find() |
  equal_to | Similar to std::equal_to, but allows two different types |
  exact_tag | Forces parallel merging with exact splitting, at compile time |
  fill_selector | Std::fill() selector |
  find_first_of_selector | Test predicate on several elements |
  find_if_selector | Test predicate on a single element, used for std::find() and std::find_if () |
  find_tag | Base class for for std::find() variants |
  for_each_selector | Std::for_each() selector |
  generate_selector | Std::generate() selector |
  generic_find_selector | Base class of all __gnu_parallel::find_template selectors |
  generic_for_each_selector | Generic selector for embarrassingly parallel functions |
  growing_blocks_tag | Selects the growing block size variant for std::find() |
  guarded_iterator | Iterator wrapper supporting an implicit supremum at the end of the sequence, dominating all comparisons |
  identity_selector | Selector that just returns the passed iterator |
  inner_product_selector | Std::inner_product() selector |
  iterator_pair | A pair of iterators. The usual iterator operations are applied to both child iterators |
  iterator_triple | A triple of iterators. The usual iterator operations are applied to all three child iterators |
  Job | One job for a certain thread |
  less | Similar to std::less, but allows two different types |
  lexicographic | Compare a pair of types lexicographically, ascending |
  lexicographic_reverse | Compare a pair of types lexicographically, descending |
  loser_tree_traits | Traits for determining whether the loser tree should use pointers or copies |
  LoserTree | Stable LoserTree variant |
  LoserTree< false, T, Comparator > | Unstable LoserTree variant |
  LoserTreeBase | Guarded loser/tournament tree |
   Loser | Internal representation of a LoserTree element |
  LoserTreePointer | Stable LoserTree implementation |
  LoserTreePointer< false, T, Comparator > | Unstable LoserTree implementation |
  LoserTreePointerBase | Base class of Loser Tree implementation using pointers |
   Loser | Internal representation of LoserTree elements |
  LoserTreePointerUnguarded | Stable unguarded LoserTree variant storing pointers |
  LoserTreePointerUnguarded< false, T, Comparator > | Unstable unguarded LoserTree variant storing pointers |
  LoserTreePointerUnguardedBase | Unguarded loser tree, keeping only pointers to the elements in the tree structure |
  LoserTreeUnguarded | Stable implementation of unguarded LoserTree |
  LoserTreeUnguarded< false, T, Comparator > | Non-Stable implementation of unguarded LoserTree |
  LoserTreeUnguardedBase | Base class for unguarded LoserTree implementation |
  max_element_reduct | Reduction for finding the maximum element, using a comparator |
  min_element_reduct | Reduction for finding the maximum element, using a comparator |
  mismatch_selector | Test inverted predicate on a single element |
  multiplies | Similar to std::multiplies, but allows two different types |
  multiway_merge_3_variant_sentinel_switch | Switch for 3-way merging with sentinels turned off |
  multiway_merge_3_variant_sentinel_switch< true, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for 3-way merging with sentinels turned on |
  multiway_merge_4_variant_sentinel_switch | Switch for 4-way merging with sentinels turned off |
  multiway_merge_4_variant_sentinel_switch< true, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for 4-way merging with sentinels turned on |
  multiway_merge_k_variant_sentinel_switch | Switch for k-way merging with sentinels turned on |
  multiway_merge_k_variant_sentinel_switch< false, stable, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for k-way merging with sentinels turned off |
  multiway_mergesort_exact_tag | Forces parallel sorting using multiway mergesort with exact splitting at compile time |
  multiway_mergesort_sampling_tag | Forces parallel sorting using multiway mergesort with splitting by sampling at compile time |
  multiway_mergesort_tag | Forces parallel sorting using multiway mergesort at compile time |
  nothing | Functor doing nothing |
  omp_loop_static_tag | Recommends parallel execution using OpenMP static load-balancing at compile time |
  omp_loop_tag | Recommends parallel execution using OpenMP dynamic load-balancing at compile time |
  parallel_tag | Recommends parallel execution at compile time, optionally using a user-specified number of threads |
  Piece | Subsequence description |
  plus | Similar to std::plus, but allows two different types |
  PMWMSSortingData | Data accessed by all threads |
  pseudo_sequence | Sequence that conceptually consists of multiple copies of the same element. The copies are not stored explicitly, of course |
  pseudo_sequence_iterator | Iterator associated with __gnu_parallel::pseudo_sequence. If features the usual random-access iterator functionality |
  QSBThreadLocal | Information local to one thread in the parallel quicksort run |
  quicksort_tag | Forces parallel sorting using unbalanced quicksort at compile time |
  random_number | Random number generator, based on the Mersenne twister |
  replace_if_selector | Std::replace() selector |
  replace_selector | Std::replace() selector |
  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 |
  sampling_sorter | Stable sorting functor |
  sampling_sorter< false, RandomAccessIterator, StrictWeakOrdering > | Non-stable sorting functor |
  sampling_tag | Forces parallel merging with exact splitting, at compile time |
  sequential_tag | Forces sequential execution at compile time |
  split_consistently | Split consistently |
  split_consistently< false, RandomAccessIterator, Comparator, SortingPlacesIterator > | Split by sampling |
  split_consistently< true, RandomAccessIterator, Comparator, SortingPlacesIterator > | Split by exact splitting |
  transform1_selector | Std::transform() selector, one input sequence variant |
  transform2_selector | Std::transform() selector, two input sequences variant |
  unary_negate | Similar to std::binder1st, but giving the argument types explicitly |
  unbalanced_tag | Recommends parallel execution using static load-balancing at compile time |
  void_functor | Functor that does nothing |
 __gnu_pbds | GNU extensions for policy-based data structures for public use |
  detail | |
   value_type_base< Key, Mapped, Allocator, false > | |
   value_type_base< Key, Mapped, Allocator, true > | |
   value_type_base< Key, null_mapped_type, Allocator, false > | |
   value_type_base< Key, null_mapped_type, Allocator, true > | |
  associative_container_tag | Basic associative-container |
  basic_hash_tag | Basic hash |
  basic_tree_tag | Basic tree |
  binary_heap_tag | Binary-heap (array-based) |
  binomial_heap_tag | Binomial-heap |
  cc_hash_tag | Collision-chaining hash |
  container_tag | Base data structure tag |
  container_traits | Container_traits |
  gp_hash_tag | General-probing hash |
  list_update_tag | List-update |
  null_mapped_type | A mapped-policy indicating that an associative container is a set |
  ov_tree_tag | Ordered-vector tree |
  pairing_heap_tag | Pairing-heap |
  pat_trie_tag | PATRICIA trie |
  priority_queue_tag | Basic priority-queue |
  rb_tree_tag | Red-black tree |
  rc_binomial_heap_tag | Redundant-counter binomial-heap |
  sequence_tag | Basic sequence |
  splay_tree_tag | Splay tree |
  string_tag | Basic string container, inclusive of strings, ropes, etc |
  thin_heap_tag | Thin heap |
  tree_tag | Tree |
  trie_tag | Trie |
 __gnu_sequential | GNU sequential classes for public use |
 abi | The cross-vendor C++ Application Binary Interface. A namespace alias to __cxxabiv1, but user programs should use the alias `abi' |
 std | ISO C++ entities toplevel namespace is std |
  __debug | GNU debug code, replaces standard behavior with debug behavior |
  __detail | Implementation details not part of the namespace std interface |
  __parallel | GNU parallel code, replaces standard behavior with parallel behavior |
   c_rand_number | Functor wrapper for std::rand() |
  chrono | ISO C++ 0x entities sub namespace for time and date |
   duration | Duration |
   duration_values | Duration_values |
   system_clock | System_clock |
   time_point | Time_point |
   treat_as_floating_point | Treat_as_floating_point |
  placeholders | ISO C++ 0x entities sub namespace for functional |
  regex_constants | ISO C++ 0x entities sub namespace for regex |
  rel_ops | The generated relational operators are sequestered here |
  this_thread | ISO C++ 0x entities sub namespace for thread. 30.2.2 Namespace this_thread |
  tr1 | ISO C++ TR1 entities toplevel namespace is std::tr1 |
   __detail | Implementation details not part of the namespace std::tr1 interface |
    __floating_point_constant | A class to encapsulate type dependent floating point constants. Not everything will be able to be expressed as type logic |
    __numeric_constants | A structure for numeric constants |
   _Tuple_impl< _Idx > | |
   _Tuple_impl< _Idx, _Head, _Tail...> | |
   tuple_element< 0, tuple< _Head, _Tail...> > | |
   tuple_element< __i, tuple< _Head, _Tail...> > | |
   tuple_size< tuple< _Elements...> > | Class tuple_size |
  __codecvt_abstract_base | Common base for codecvt functions |
  __ctype_abstract_base | Common base for ctype facet |
  __is_location_invariant | |
  __is_member_pointer_helper | Is_member_pointer |
  __numeric_limits_base | Part of std::numeric_limits |
  _Base_bitset | |
  _Base_bitset< 0 > | |
  _Base_bitset< 1 > | |
  _Deque_base | |
  _Deque_iterator | A deque::iterator |
  _Derives_from_binary_function | Determines if the type _Tp derives from binary_function |
  _Derives_from_unary_function | Determines if the type _Tp derives from unary_function |
  _Fnv_hash | Dummy generic implementation (for sizeof(size_t) != 4, 8) |
  _Function_base | Base class of all polymorphic function object wrappers |
  _Function_to_function_pointer | Turns a function type into a function pointer type |
  _Fwd_list_base | Base class for forward_list |
  _Fwd_list_const_iterator | A forward_list::const_iterator |
  _Fwd_list_iterator | A forward_list::iterator |
  _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 |
  _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 |
  _Has_result_type_helper | |
  _Index_tuple | |
  _List_base | See bits/stl_deque.h's _Deque_base for an explanation |
  _List_const_iterator | A list::const_iterator |
  _List_iterator | A list::iterator |
  _List_node | An actual node in the list |
  _List_node_base | Common part of a node in the list |
  _Maybe_get_result_type | If we have found a result_type, extract it |
  _Maybe_unary_or_binary_function | |
  _Maybe_unary_or_binary_function< _Res, _T1 > | Derives from unary_function , as appropriate |
  _Maybe_unary_or_binary_function< _Res, _T1, _T2 > | Derives from binary_function , as appropriate |
  _Maybe_wrap_member_pointer | |
  _Maybe_wrap_member_pointer< _Tp _Class::* > | |
  _Mem_fn< _Res(_Class::*)(_ArgTypes...) const > | Implementation of mem_fn for const member function pointers |
  _Mem_fn< _Res(_Class::*)(_ArgTypes...) const volatile > | Implementation of mem_fn for const volatile member function pointers |
  _Mem_fn< _Res(_Class::*)(_ArgTypes...) volatile > | Implementation of mem_fn for volatile member function pointers |
  _Mem_fn< _Res(_Class::*)(_ArgTypes...)> | Implementation of mem_fn for member function pointers |
  _Mu< _Arg, false, false > | |
  _Mu< _Arg, false, true > | |
  _Mu< _Arg, true, false > | |
  _Mu< reference_wrapper< _Tp >, false, false > | |
  _Placeholder | The type of placeholder objects defined by libstdc++ |
  _Reference_wrapper_base | |
  _Result_of_impl< false, _Functor()> | |
  _Result_of_impl< false, _Functor(_ArgTypes...)> | |
  _Result_of_impl< true, _Functor(_ArgTypes...)> | We already know the result type for Functor ; use it |
  _Safe_tuple_element | |
  _Safe_tuple_element_impl | |
  _Safe_tuple_element_impl< __i, _Tuple, false > | |
  _Temporary_buffer | |
  _Tuple_impl< _Idx > | |
  _Tuple_impl< _Idx, _Head, _Tail...> | |
  _Vector_base | See bits/stl_deque.h's _Deque_base for an explanation |
  _Weak_result_type | |
  _Weak_result_type_impl | |
  _Weak_result_type_impl< _Res(&)(_ArgTypes...)> | Retrieve the result type for a function reference |
  _Weak_result_type_impl< _Res(*)(_ArgTypes...)> | Retrieve the result type for a function pointer |
  _Weak_result_type_impl< _Res(_ArgTypes...)> | Retrieve the result type for a function type |
  _Weak_result_type_impl< _Res(_Class::*)(_ArgTypes...) const > | Retrieve result type for a const member function pointer |
  _Weak_result_type_impl< _Res(_Class::*)(_ArgTypes...) const volatile > | Retrieve result type for a const volatile member function pointer |
  _Weak_result_type_impl< _Res(_Class::*)(_ArgTypes...) volatile > | Retrieve result type for a volatile member function pointer |
  _Weak_result_type_impl< _Res(_Class::*)(_ArgTypes...)> | Retrieve result type for a member function pointer |
  add_const | Add_const |
  add_cv | Add_cv |
  add_lvalue_reference | Add_lvalue_reference |
  add_pointer | Add_pointer |
  add_rvalue_reference | Add_rvalue_reference |
  add_volatile | Add_volatile |
  adopt_lock_t | Assume the calling thread has already obtained mutex ownership and manage it |
  alignment_of | Alignment_of |
  allocator | The "standard" allocator, as per [20.4].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt04ch11.html |
  allocator< void > | Allocator<void> specialization |
  array | A standard container for storing a fixed size sequence of elements |
  atomic | Atomic 29.4.3, Generic atomic type, primary class template |
  atomic< _Tp * > | Partial specialization for pointer types |
  atomic< bool > | Explicit specialization for bool |
  atomic< char > | Explicit specialization for char |
  atomic< char16_t > | Explicit specialization for char16_t |
  atomic< char32_t > | Explicit specialization for char32_t |
  atomic< int > | Explicit specialization for int |
  atomic< long > | Explicit specialization for long |
  atomic< long long > | Explicit specialization for long long |
  atomic< short > | Explicit specialization for short |
  atomic< signed char > | Explicit specialization for signed char |
  atomic< unsigned char > | Explicit specialization for unsigned char |
  atomic< unsigned int > | Explicit specialization for unsigned int |
  atomic< unsigned long > | Explicit specialization for unsigned long |
  atomic< unsigned long long > | Explicit specialization for unsigned long long |
  atomic< unsigned short > | Explicit specialization for unsigned short |
  atomic< void * > | Explicit specialization for void* |
  atomic< wchar_t > | Explicit specialization for wchar_t |
  auto_ptr | A simple smart pointer providing strict ownership semantics |
  auto_ptr_ref | |
  back_insert_iterator | Turns assignment into insertion |
  bad_alloc | Exception possibly thrown by new .bad_alloc (or classes derived from it) is used to report allocation errors from the throwing forms of new |
  bad_cast | Thrown during incorrect typecasting.If you attempt an invalid dynamic_cast expression, an instance of this class (or something derived from this class) is thrown |
  bad_exception | |
  bad_function_call | Exception class thrown when class template function's operator() is called with an empty target |
  bad_typeid | Thrown when a NULL pointer in a typeid expression is used |
  basic_filebuf | The actual work of input and output (for files).This class associates both its input and output sequence with an external disk file, and maintains a joint file position for both sequences. Many of its semantics are described in terms of similar behavior in the Standard C Library's FILE streams |
  basic_fstream | Controlling input and output for files.This class supports reading from and writing to named files, using the inherited functions from std::basic_iostream. To control the associated sequence, an instance of std::basic_filebuf is used, which this page refers to as sb |
  basic_ifstream | Controlling input for files.This class supports reading from named files, using the inherited functions from std::basic_istream. To control the associated sequence, an instance of std::basic_filebuf is used, which this page refers to as sb |
  basic_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 |
  basic_iostream | Merging istream and ostream capabilities.This class multiply inherits from the input and output stream classes simply to provide a single interface |
  basic_istream | Controlling input.This is the base class for all input streams. It provides text formatting of all builtin types, and communicates with any class derived from basic_streambuf to do the actual input |
   sentry | Performs setup work for input streams |
  basic_istringstream | Controlling input for std::string.This class supports reading from objects of type std::basic_string, using the inherited functions from std::basic_istream. To control the associated sequence, an instance of std::basic_stringbuf is used, which this page refers to as sb |
  basic_ofstream | Controlling output for files.This class supports reading from named files, using the inherited functions from std::basic_ostream. To control the associated sequence, an instance of std::basic_filebuf is used, which this page refers to as sb |
  basic_ostream | Controlling output.This is the base class for all output streams. It provides text formatting of all builtin types, and communicates with any class derived from basic_streambuf to do the actual output |
   sentry | Performs setup work for output streams |
  basic_ostringstream | Controlling output for std::string.This class supports writing to objects of type std::basic_string, using the inherited functions from std::basic_ostream. To control the associated sequence, an instance of std::basic_stringbuf is used, which this page refers to as sb |
  basic_regex | |
  basic_streambuf | The actual work of input and output (interface) |
  basic_string | Managing sequences of characters and character-like objects |
  basic_stringbuf | The actual work of input and output (for std::string).This class associates either or both of its input and output sequences with a sequence of characters, which can be initialized from, or made available as, a std::basic_string . (Paraphrased from [27.7.1]/1.) |
  basic_stringstream | Controlling input and output for std::string.This class supports reading from and writing to objects of type std::basic_string, using the inherited functions from std::basic_iostream. To control the associated sequence, an instance of std::basic_stringbuf is used, which this page refers to as sb |
  bernoulli_distribution | A Bernoulli random number distribution |
  bidirectional_iterator_tag | Bidirectional iterators support a superset of forward iterator operations |
  binary_function | |
  binary_negate | One of the negation functors |
  binder1st | One of the binder functors |
  binder2nd | One of the binder functors |
  binomial_distribution | A discrete binomial random number distribution |
  bitset | The bitset class represents a fixed-size sequence of bits |
   reference | |
  char_traits | Basis for explicit traits specializations |
  char_traits< __gnu_cxx::character | Char_traits<__gnu_cxx::character> specialization |
  char_traits< char > | 21.1.3.1 char_traits specializations |
  char_traits< wchar_t > | 21.1.3.2 char_traits specializations |
  codecvt | Class codecvt [22.2.1.5]. NB: Generic, mostly useless implementation |
  codecvt< _InternT, _ExternT, encoding_state > | Codecvt<InternT, _ExternT, encoding_state> specialization |
  codecvt< char, char, mbstate_t > | Class codecvt<char, char, mbstate_t> specialization |
  codecvt< wchar_t, char, mbstate_t > | Class codecvt<wchar_t, char, mbstate_t> specialization |
  codecvt_base | Empty base class for codecvt facet [22.2.1.5] |
  codecvt_byname | Class codecvt_byname [22.2.1.6] |
  collate | Facet for localized string comparison |
  collate_byname | Class collate_byname [22.2.4.2] |
  complex | |
  condition_variable | Condition_variable |
  condition_variable_any | Condition_variable_any |
  const_mem_fun1_ref_t | One of the adaptors for member pointers |
  const_mem_fun1_t | One of the adaptors for member pointers |
  const_mem_fun_ref_t | One of the adaptors for member pointers |
  const_mem_fun_t | One of the adaptors for member pointers |
  ctype | Template ctype facet |
  ctype< char > | The ctype<char> specialization |
  ctype< wchar_t > | The ctype<wchar_t> specialization |
  ctype_base | Base class for ctype |
  ctype_byname | Class ctype_byname [22.2.1.2] |
  ctype_byname< char > | 22.2.1.4 Class ctype_byname specializations |
  default_delete | Primary template, default_delete |
  default_delete< _Tp[]> | Specialization, default_delete |
  defer_lock_t | Do not acquire ownership of the mutex |
  deque | A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end |
  discard_block | |
  divides | One of the math functors |
  domain_error | |
  equal_to | One of the comparison functors |
  error_category | Error_category |
  error_code | Error_code |
  error_condition | Error_condition |
  exception | Base class for all library exceptions |
  exponential_distribution | An exponential continuous distribution for random numbers |
  extent | Extent |
  forward_iterator_tag | Forward iterators support a superset of input iterator operations |
  forward_list | A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence |
  fpos | Class representing stream positions |
  front_insert_iterator | Turns assignment into insertion |
  function< _Res(_ArgTypes...)> | Class function |
  gamma_distribution | A gamma continuous distribution for random numbers |
  geometric_distribution | A discrete geometric random number distribution |
  greater | One of the comparison functors |
  greater_equal | One of the comparison functors |
  gslice | Class defining multi-dimensional subset of an array |
  gslice_array | Reference to multi-dimensional subset of an array |
  has_virtual_destructor | Has_virtual_destructor |
  hash | Class template hash |
  hash< _Tp * > | Partial specializations for pointer types |
  indirect_array | Reference to arbitrary subset of an array |
  initializer_list | Initializer_list |
  input_iterator_tag | Marking input iterators |
  insert_iterator | Turns assignment into insertion |
  integral_constant | Integral_constant |
  invalid_argument | |
  ios_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) |
   failure | These are thrown to indicate problems with io.27.4.2.1.1 Class ios_base::failure |
  is_abstract | Is_abstract |
  is_arithmetic | Is_arithmetic |
  is_array | Is_array |
  is_bind_expression | Determines if the given type _Tp is a function object should be treated as a subexpression when evaluating calls to function objects returned by bind(). [TR1 3.6.1] |
  is_bind_expression< _Bind< _Signature > > | Class template _Bind is always a bind expression |
  is_bind_expression< _Bind_result< _Result, _Signature > > | Class template _Bind_result is always a bind expression |
  is_class | Is_class |
  is_compound | Is_compound |
  is_const | Is_const |
  is_empty | Is_empty |
  is_enum | Is_enum |
  is_error_code_enum | Is_error_code_enum |
  is_error_condition_enum | Is_error_condition_enum |
  is_floating_point | Is_floating_point |
  is_function | Is_function |
  is_fundamental | Is_fundamental |
  is_integral | Is_integral |
  is_lvalue_reference | Is_lvalue_reference |
  is_member_function_pointer | Is_member_function_pointer |
  is_member_object_pointer | Is_member_object_pointer |
  is_object | Is_object |
  is_placeholder | Determines if the given type _Tp is a placeholder in a bind() expression and, if so, which placeholder it is. [TR1 3.6.2] |
  is_placeholder< _Placeholder< _Num > > | |
  is_pointer | Is_pointer |
  is_polymorphic | Is_polymorphic |
  is_reference | Is_reference |
  is_rvalue_reference | Is_rvalue_reference |
  is_same | Is_same |
  is_scalar | Is_scalar |
  is_union | Is_union |
  is_void | Is_void |
  is_volatile | Is_volatile |
  istream_iterator | Provides input iterator semantics for streams |
  istreambuf_iterator | Provides input iterator semantics for streambufs |
  iterator | Common iterator class |
  iterator_traits | |
  length_error | |
  less | One of the comparison functors |
  less_equal | One of the comparison functors |
  linear_congruential | A model of a linear congruential random number generator |
  list | A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence |
  locale | Container class for localization functionality |
   facet | Localization functionality base class |
   id | Facet ID class |
  lock_error | Thrown to indicate errors with lock operations |
  lock_guard | Scoped lock idiom |
  logic_error | One of two subclasses of exception |
  logical_and | One of the Boolean operations functors |
  logical_not | One of the Boolean operations functors |
  logical_or | One of the Boolean operations functors |
  map | A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time |
  mask_array | Reference to selected subset of an array |
  match_results | The results of a match or search operation |
  mem_fun1_ref_t | One of the adaptors for member pointers |
  mem_fun1_t | One of the adaptors for member pointers |
  mem_fun_ref_t | One of the adaptors for member pointers |
  mem_fun_t | One of the adaptors for member pointers |
  messages | Facet for handling message catalogs |
  messages_base | Messages facet base class providing catalog typedef |
  messages_byname | Class messages_byname [22.2.7.2] |
  minus | One of the math functors |
  modulus | One of the math functors |
  money_base | Money format ordering data |
  money_get | Facet for parsing monetary amounts |
  money_put | Facet for outputting monetary amounts |
  moneypunct | Facet for formatting data for money amounts |
  moneypunct_byname | Class moneypunct_byname [22.2.6.4] |
  move_iterator | |
  multimap | A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time |
  multiplies | One of the math functors |
  multiset | A standard container made up of elements, which can be retrieved in logarithmic time |
  mutex | Mutex |
  negate | One of the math functors |
  normal_distribution | A normal continuous distribution for random numbers |
  not_equal_to | One of the comparison functors |
  num_get | Facet for parsing number strings |
  num_put | Facet for converting numbers to strings |
  numeric_limits | Properties of fundamental types |
  numeric_limits< bool > | Numeric_limits<bool> specialization |
  numeric_limits< char > | Numeric_limits<char> specialization |
  numeric_limits< char16_t > | Numeric_limits<char16_t> specialization |
  numeric_limits< char32_t > | Numeric_limits<char32_t> specialization |
  numeric_limits< double > | Numeric_limits<double> specialization |
  numeric_limits< float > | Numeric_limits<float> specialization |
  numeric_limits< int > | Numeric_limits<int> specialization |
  numeric_limits< long > | Numeric_limits<long> specialization |
  numeric_limits< long double > | Numeric_limits<long double> specialization |
  numeric_limits< long long > | Numeric_limits<long long> specialization |
  numeric_limits< short > | Numeric_limits<short> specialization |
  numeric_limits< signed char > | Numeric_limits<signed char> specialization |
  numeric_limits< unsigned char > | Numeric_limits<unsigned char> specialization |
  numeric_limits< unsigned int > | Numeric_limits<unsigned int> specialization |
  numeric_limits< unsigned long > | Numeric_limits<unsigned long> specialization |
  numeric_limits< unsigned long long > | Numeric_limits<unsigned long long> specialization |
  numeric_limits< unsigned short > | Numeric_limits<unsigned short> specialization |
  numeric_limits< wchar_t > | Numeric_limits<wchar_t> specialization |
  numpunct | Numpunct facet |
  numpunct_byname | Class numpunct_byname [22.2.3.2] |
  once_flag | Once_flag |
  ostream_iterator | Provides output iterator semantics for streams |
  ostreambuf_iterator | Provides output iterator semantics for streambufs |
  out_of_range | |
  output_iterator_tag | Marking output iterators |
  overflow_error | |
  pair | Pair holds two objects of arbitrary type |
  plus | One of the math functors |
  pointer_to_binary_function | One of the adaptors for function pointers |
  pointer_to_unary_function | One of the adaptors for function pointers |
  poisson_distribution | A discrete Poisson random number distribution |
  priority_queue | A standard container automatically sorting its contents |
  queue | A standard container giving FIFO behavior |
  random_access_iterator_tag | Random-access iterators support a superset of bidirectional iterator operations |
  random_device | |
  range_error | |
  rank | Rank |
  ratio | Provides compile-time rational arithmetic |
  ratio_add | Ratio_add |
  ratio_divide | Ratio_divide |
  ratio_equal | Ratio_equal |
  ratio_greater | Ratio_greater |
  ratio_greater_equal | Ratio_greater_equal |
  ratio_less | Ratio_less |
  ratio_less_equal | Ratio_less_equal |
  ratio_multiply | Ratio_multiply |
  ratio_not_equal | Ratio_not_equal |
  ratio_subtract | Ratio_subtract |
  raw_storage_iterator | |
  recursive_mutex | Recursive_mutex |
  recursive_timed_mutex | Recursive_timed_mutex |
  reference_wrapper | Reference_wrapper |
  regex_error | A regular expression exception class.The regular expression library throws objects of this class on error |
  regex_iterator | |
  regex_token_iterator | |
  regex_traits | Describes aspects of a regular expression |
  remove_all_extents | Remove_all_extents |
  remove_const | Remove_const |
  remove_cv | Remove_cv |
  remove_extent | Remove_extent |
  remove_pointer | Remove_pointer |
  remove_reference | Remove_reference |
  remove_volatile | Remove_volatile |
  result_of< _Functor(_ArgTypes...)> | |
  reverse_iterator | |
  runtime_error | One of two subclasses of exception |
  set | A standard container made up of unique keys, which can be retrieved in logarithmic time |
  slice | Class defining one-dimensional subset of an array |
  slice_array | Reference to one-dimensional subset of an array |
  stack | A standard container giving FILO behavior |
  sub_match | |
  system_error | Thrown to indicate error code of underlying system |
  thread | Thread |
   id | Thread::id |
  time_base | Time format ordering data |
  time_get | Facet for parsing dates and times |
  time_get_byname | Class time_get_byname [22.2.5.2] |
  time_put | Facet for outputting dates and times |
  time_put_byname | Class time_put_byname [22.2.5.4] |
  timed_mutex | Timed_mutex |
  try_to_lock_t | Try to acquire ownership of the mutex without blocking |
  tuple | Tuple |
  tuple< _T1, _T2 > | Tuple (2-element), with construction and assignment from a pair |
  tuple_element< 0, tuple< _Head, _Tail...> > | |
  tuple_element< __i, tuple< _Head, _Tail...> > | |
  tuple_size< tuple< _Elements...> > | Class tuple_size |
  type_info | Part of RTTI |
  unary_function | |
  unary_negate | One of the negation functors |
  underflow_error | |
  uniform_int | Uniform discrete distribution for random numbers. A discrete random distribution on the range with equal probability throughout the range |
  uniform_real | Uniform continuous distribution for random numbers |
  unique_lock | Unique_lock |
  unique_ptr | 20.7.12.2 unique_ptr for single objects |
  unique_ptr< _Tp[], _Tp_Deleter > | 20.7.12.3 unique_ptr for array objects with a runtime length |
  unordered_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 |
  unordered_multimap | A standard container composed of equivalent keys (possibly containing multiple of each key value) that associates values of another type with the keys |
  unordered_multiset | A standard container composed of equivalent keys (possibly containing multiple of each key value) in which the elements' keys are the elements themselves |
  unordered_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 |
  valarray | Smart array designed to support numeric processing |
  variate_generator | |
  vector | A standard container which offers fixed time access to individual elements in any order |
  vector< bool, _Alloc > | A specialization of vector for booleans which offers fixed time access to individual elements in any order |
  xor_combine | |