C__atomic0::atomic_address | 29.4.2, address types |
C__atomic0::atomic_bool | Atomic_bool |
C__atomic0::atomic_flag | Atomic_flag |
C__atomic2::atomic_address | 29.4.2, address types |
C__atomic2::atomic_bool | Atomic_bool |
C__atomic2::atomic_flag | Atomic_flag |
C__cxxabiv1::__forced_unwind | Thrown as part of forced unwinding.A magic placeholder class that can be caught by reference to recognize forced unwinding |
C__gnu_cxx::__common_pool_policy< _PoolTp, _Thread > | Policy for shared __pool objects |
C__gnu_cxx::__detail::__mini_vector< _Tp > | __mini_vector<> is a stripped down version of the full-fledged std::vector<> |
C__gnu_cxx::__detail::_Bitmap_counter< _Tp > | 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__gnu_cxx::__mt_alloc_base< _Tp > | Base class for _Tp dependent member functions |
C__gnu_cxx::__mt_alloc< _Tp, _Poolp > | 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__gnu_cxx::__per_type_pool_policy< _Tp, _PoolTp, _Thread > | Policy for individual __pool objects |
C__gnu_cxx::__pool< _Thread > | Data describing the underlying memory pool, parameterized on threading support |
►C__gnu_cxx::__pool_alloc_base | Base class for __pool_alloc |
C__gnu_cxx::__pool_alloc< _Tp > | Allocator using a memory pool with a single lock |
►C__gnu_cxx::__pool_base | Base class for pool object |
C__gnu_cxx::__pool< false > | Specialization for single thread |
C__gnu_cxx::__pool< true > | Specialization for thread enabled, via gthreads.h |
C__gnu_cxx::__rc_string_base< _CharT, _Traits, _Alloc > | |
C__gnu_cxx::__scoped_lock | Scoped lock idiom |
C__gnu_cxx::__versa_string< _CharT, _Traits, _Alloc, _Base > | Managing sequences of characters and character-like objects |
C__gnu_cxx::_Caster< _ToType > | |
C__gnu_cxx::_Char_types< _CharT > | Mapping from character type to associated types |
C__gnu_cxx::_ExtPtr_allocator< _Tp > | 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__gnu_cxx::_Invalid_type | |
C__gnu_cxx::_Pointer_adapter< _Storage_policy > | |
C__gnu_cxx::_Relative_pointer_impl< _Tp > | 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__gnu_cxx::_Relative_pointer_impl< const _Tp > | |
C__gnu_cxx::_Std_pointer_impl< _Tp > | A storage policy for use with _Pointer_adapter<> which yields a standard pointer |
C__gnu_cxx::_Unqualified_type< _Tp > | |
►C__gnu_cxx::array_allocator_base< _Tp > | Base class |
C__gnu_cxx::array_allocator< _Tp, _Array > | An allocator that uses previously allocated memory. This memory can be externally, globally, or otherwise allocated |
►C__gnu_cxx::char_traits< _CharT > | Base class used to implement std::char_traits |
►Cstd::char_traits< _CharT > | Basis for explicit traits specializations |
C__gnu_cxx::encoding_char_traits< _CharT > | Encoding_char_traits |
C__gnu_cxx::character< V, I, S > | A POD class that serves as a character abstraction class |
C__gnu_cxx::debug_allocator< _Alloc > | A meta-allocator with debugging bits, as per [20.4].This is precisely the allocator defined in the C++ Standard |
C__gnu_cxx::enc_filebuf< _CharT > | Class enc_filebuf |
C__gnu_cxx::encoding_state | Extension to use iconv for dealing with character encodings |
C__gnu_cxx::forced_exception_error | Thown by throw_allocator |
►C__gnu_cxx::free_list | The free list class for managing chunks of memory to be given to and returned by the bitmap_allocator |
C__gnu_cxx::bitmap_allocator< _Tp > | Bitmap Allocator, primary template |
C__gnu_cxx::malloc_allocator< _Tp > | An allocator that uses malloc.This is precisely the allocator defined in the C++ Standard |
C__gnu_cxx::new_allocator< _Tp > | An allocator that uses global new, as per [20.4].This is precisely the allocator defined in the C++ Standard |
C__gnu_cxx::stdio_filebuf< _CharT, _Traits > | Provides a layer of compatibility for C/POSIX |
C__gnu_cxx::stdio_sync_filebuf< _CharT, _Traits > | Class stdio_sync_filebuf |
►C__gnu_cxx::throw_allocator_base | Base class |
C__gnu_cxx::throw_allocator< T > | Allocator class with logging and exception control |
C__gnu_debug::__is_same< _Type1, _Type2 > | |
C__gnu_debug::_After_nth_from< _Iterator > | |
C__gnu_debug::_Not_equal_to< _Type > | |
►C__gnu_debug::_Safe_iterator_base | Basic functionality for a "safe" iterator |
C__gnu_debug::_Safe_iterator< _Iterator, _Sequence > | Safe iterator wrapper |
►C__gnu_debug::_Safe_sequence_base | Base class that supports tracking of iterators that reference a sequence |
C__gnu_debug::_Safe_sequence< _Sequence > | Base class for constructing a "safe" sequence type that tracks iterators that reference it |
C__gnu_debug::_Safe_sequence< map< _Key, _Tp, _Compare, _Allocator > > | |
C__gnu_debug::_Safe_sequence< multimap< _Key, _Tp, _Compare, _Allocator > > | |
C__gnu_debug::_Safe_sequence< multiset< _Key, _Compare, _Allocator > > | |
C__gnu_debug::_Safe_sequence< set< _Key, _Compare, _Allocator > > | |
C__gnu_parallel::_Settings | Class _Settings Run-time settings for the parallel mode, including all tunable parameters |
C__gnu_parallel::accumulate_binop_reduct< BinOp > | General reduction, using a binary operator |
C__gnu_parallel::DRandomShufflingGlobalData< RandomAccessIterator > | Data known to every thread participating in __gnu_parallel::parallel_random_shuffle() |
C__gnu_parallel::DRSSorterPU< RandomAccessIterator, RandomNumberGenerator > | Local data for a thread participating in __gnu_parallel::parallel_random_shuffle() |
C__gnu_parallel::dummy_reduct | Reduction function doing nothing |
►C__gnu_parallel::find_tag | Base class for for std::find() variants |
C__gnu_parallel::constant_size_blocks_tag | Selects the constant block size variant for std::find() |
C__gnu_parallel::equal_split_tag | Selects the equal splitting variant for std::find() |
C__gnu_parallel::growing_blocks_tag | Selects the growing block size variant for std::find() |
►C__gnu_parallel::generic_find_selector | Base class of all __gnu_parallel::find_template selectors |
C__gnu_parallel::adjacent_find_selector | Test predicate on two adjacent elements |
C__gnu_parallel::find_first_of_selector< ForwardIterator > | Test predicate on several elements |
C__gnu_parallel::find_if_selector | Test predicate on a single element, used for std::find() and std::find_if () |
C__gnu_parallel::mismatch_selector | Test inverted predicate on a single element |
►C__gnu_parallel::generic_for_each_selector< It > | Generic selector for embarrassingly parallel functions |
C__gnu_parallel::accumulate_selector< It > | Std::accumulate() selector |
C__gnu_parallel::adjacent_difference_selector< It > | Selector that returns the difference between two adjacent elements |
C__gnu_parallel::count_if_selector< It, Diff > | Std::count_if () selector |
C__gnu_parallel::count_selector< It, Diff > | Std::count() selector |
C__gnu_parallel::fill_selector< It > | Std::fill() selector |
C__gnu_parallel::for_each_selector< It > | Std::for_each() selector |
C__gnu_parallel::generate_selector< It > | Std::generate() selector |
C__gnu_parallel::identity_selector< It > | Selector that just returns the passed iterator |
C__gnu_parallel::inner_product_selector< It, It2, T > | Std::inner_product() selector |
C__gnu_parallel::replace_if_selector< It, Op, T > | Std::replace() selector |
C__gnu_parallel::replace_selector< It, T > | Std::replace() selector |
C__gnu_parallel::transform1_selector< It > | Std::transform() selector, one input sequence variant |
C__gnu_parallel::transform2_selector< It > | Std::transform() selector, two input sequences variant |
C__gnu_parallel::guarded_iterator< RandomAccessIterator, Comparator > | Iterator wrapper supporting an implicit supremum at the end of the sequence, dominating all comparisons |
C__gnu_parallel::iterator_triple< Iterator1, Iterator2, Iterator3, IteratorCategory > | A triple of iterators. The usual iterator operations are applied to all three child iterators |
C__gnu_parallel::Job< _DifferenceTp > | One job for a certain thread |
C__gnu_parallel::loser_tree_traits< T > | Traits for determining whether the loser tree should use pointers or copies |
►C__gnu_parallel::LoserTreeBase< T, Comparator > | Guarded loser/tournament tree |
C__gnu_parallel::LoserTree< stable, T, Comparator > | Stable LoserTree variant |
C__gnu_parallel::LoserTree< false, T, Comparator > | Unstable LoserTree variant |
C__gnu_parallel::LoserTreeBase< T, Comparator >::Loser | Internal representation of a LoserTree element |
►C__gnu_parallel::LoserTreePointerBase< T, Comparator > | Base class of Loser Tree implementation using pointers |
C__gnu_parallel::LoserTreePointer< stable, T, Comparator > | Stable LoserTree implementation |
C__gnu_parallel::LoserTreePointer< false, T, Comparator > | Unstable LoserTree implementation |
C__gnu_parallel::LoserTreePointerBase< T, Comparator >::Loser | Internal representation of LoserTree elements |
►C__gnu_parallel::LoserTreePointerUnguardedBase< T, Comparator > | Unguarded loser tree, keeping only pointers to the elements in the tree structure |
C__gnu_parallel::LoserTreePointerUnguarded< stable, T, Comparator > | Stable unguarded LoserTree variant storing pointers |
C__gnu_parallel::LoserTreePointerUnguarded< false, T, Comparator > | Unstable unguarded LoserTree variant storing pointers |
►C__gnu_parallel::LoserTreeUnguardedBase< T, Comparator > | Base class for unguarded LoserTree implementation |
C__gnu_parallel::LoserTreeUnguarded< stable, T, Comparator > | Stable implementation of unguarded LoserTree |
C__gnu_parallel::LoserTreeUnguarded< false, T, Comparator > | Non-Stable implementation of unguarded LoserTree |
C__gnu_parallel::max_element_reduct< Comp, It > | Reduction for finding the maximum element, using a comparator |
C__gnu_parallel::min_element_reduct< Comp, It > | Reduction for finding the maximum element, using a comparator |
C__gnu_parallel::multiway_merge_3_variant_sentinel_switch< sentinels, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for 3-way merging with sentinels turned off |
C__gnu_parallel::multiway_merge_3_variant_sentinel_switch< true, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for 3-way merging with sentinels turned on |
C__gnu_parallel::multiway_merge_4_variant_sentinel_switch< sentinels, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for 4-way merging with sentinels turned off |
C__gnu_parallel::multiway_merge_4_variant_sentinel_switch< true, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for 4-way merging with sentinels turned on |
C__gnu_parallel::multiway_merge_k_variant_sentinel_switch< sentinels, stable, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for k-way merging with sentinels turned on |
C__gnu_parallel::multiway_merge_k_variant_sentinel_switch< false, stable, RandomAccessIteratorIterator, RandomAccessIterator3, _DifferenceTp, Comparator > | Switch for k-way merging with sentinels turned off |
C__gnu_parallel::nothing | Functor doing nothing |
►C__gnu_parallel::parallel_tag | Recommends parallel execution at compile time, optionally using a user-specified number of threads |
C__gnu_parallel::balanced_quicksort_tag | Forces parallel sorting using balanced quicksort at compile time |
C__gnu_parallel::balanced_tag | Recommends parallel execution using dynamic load-balancing at compile time |
C__gnu_parallel::default_parallel_tag | Recommends parallel execution using the default parallel algorithm |
C__gnu_parallel::exact_tag | Forces parallel merging with exact splitting, at compile time |
C__gnu_parallel::multiway_mergesort_exact_tag | Forces parallel sorting using multiway mergesort with exact splitting at compile time |
C__gnu_parallel::multiway_mergesort_sampling_tag | Forces parallel sorting using multiway mergesort with splitting by sampling at compile time |
C__gnu_parallel::multiway_mergesort_tag | Forces parallel sorting using multiway mergesort at compile time |
C__gnu_parallel::omp_loop_static_tag | Recommends parallel execution using OpenMP static load-balancing at compile time |
C__gnu_parallel::omp_loop_tag | Recommends parallel execution using OpenMP dynamic load-balancing at compile time |
C__gnu_parallel::quicksort_tag | Forces parallel sorting using unbalanced quicksort at compile time |
C__gnu_parallel::sampling_tag | Forces parallel merging with exact splitting, at compile time |
C__gnu_parallel::unbalanced_tag | Recommends parallel execution using static load-balancing at compile time |
C__gnu_parallel::Piece< _DifferenceTp > | Subsequence description |
C__gnu_parallel::PMWMSSortingData< RandomAccessIterator > | Data accessed by all threads |
C__gnu_parallel::pseudo_sequence< T, _DifferenceTp > | Sequence that conceptually consists of multiple copies of the same element. The copies are not stored explicitly, of course |
C__gnu_parallel::pseudo_sequence_iterator< T, _DifferenceTp > | Iterator associated with __gnu_parallel::pseudo_sequence. If features the usual random-access iterator functionality |
C__gnu_parallel::QSBThreadLocal< RandomAccessIterator > | Information local to one thread in the parallel quicksort run |
C__gnu_parallel::random_number | Random number generator, based on the Mersenne twister |
C__gnu_parallel::RestrictedBoundedConcurrentQueue< T > | 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__gnu_parallel::sampling_sorter< stable, RandomAccessIterator, StrictWeakOrdering > | Stable sorting functor |
C__gnu_parallel::sampling_sorter< false, RandomAccessIterator, StrictWeakOrdering > | Non-stable sorting functor |
C__gnu_parallel::sequential_tag | Forces sequential execution at compile time |
C__gnu_parallel::split_consistently< exact, RandomAccessIterator, Comparator, SortingPlacesIterator > | Split consistently |
C__gnu_parallel::split_consistently< false, RandomAccessIterator, Comparator, SortingPlacesIterator > | Split by sampling |
C__gnu_parallel::split_consistently< true, RandomAccessIterator, Comparator, SortingPlacesIterator > | Split by exact splitting |
C__gnu_parallel::void_functor< _ValueTp > | Functor that does nothing |
►C__gnu_pbds::container_tag | Base data structure tag |
►C__gnu_pbds::associative_container_tag | Basic associative-container |
►C__gnu_pbds::basic_hash_tag | Basic hash |
C__gnu_pbds::cc_hash_tag | Collision-chaining hash |
C__gnu_pbds::gp_hash_tag | General-probing hash |
►C__gnu_pbds::basic_tree_tag | Basic tree |
►C__gnu_pbds::tree_tag | Tree |
C__gnu_pbds::ov_tree_tag | Ordered-vector tree |
C__gnu_pbds::rb_tree_tag | Red-black tree |
C__gnu_pbds::splay_tree_tag | Splay tree |
►C__gnu_pbds::trie_tag | Trie |
C__gnu_pbds::pat_trie_tag | PATRICIA trie |
C__gnu_pbds::list_update_tag | List-update |
►C__gnu_pbds::priority_queue_tag | Basic priority-queue |
C__gnu_pbds::binary_heap_tag | Binary-heap (array-based) |
C__gnu_pbds::binomial_heap_tag | Binomial-heap |
C__gnu_pbds::pairing_heap_tag | Pairing-heap |
C__gnu_pbds::rc_binomial_heap_tag | Redundant-counter binomial-heap |
C__gnu_pbds::thin_heap_tag | Thin heap |
C__gnu_pbds::sequence_tag | Basic sequence |
C__gnu_pbds::string_tag | Basic string container, inclusive of strings, ropes, etc |
C__gnu_pbds::container_traits_base< Tag > | Base traits type for containers |
C__gnu_pbds::detail::value_type_base< Key, Mapped, Allocator, false > | |
C__gnu_pbds::detail::value_type_base< Key, Mapped, Allocator, true > | |
C__gnu_pbds::detail::value_type_base< Key, null_mapped_type, Allocator, false > | |
C__gnu_pbds::detail::value_type_base< Key, null_mapped_type, Allocator, true > | |
C__gnu_pbds::null_mapped_type | A mapped-policy indicating that an associative container is a set |
C__gnu_cxx::__detail::_Bitmap_counter< _Alloc_block * > | |
Cstd::_Deque_iterator< _Tp, _Tp &, _Tp * > | |
Cstd::_Fwd_list_node_base< _Tp_alloc_type > | |
►Cstd::_Vector_base< __gnu_parallel::Piece< difference_type >, std::allocator< __gnu_parallel::Piece< difference_type > > > | |
Cstd::vector< __gnu_parallel::Piece< difference_type > > | |
►Cstd::_Vector_base< _Node *, _Nodeptr_Alloc > | |
Cstd::vector< _Node *, _Nodeptr_Alloc > | |
Cstd::basic_string< char > | |
►Cstd::binary_function< _Predicate::first_argument_type, _Predicate::second_argument_type, bool > | |
Cstd::binary_negate< _Predicate > | One of the negation functors |
►Cstd::binary_function< _Tp *, _Arg, _Ret > | |
Cstd::mem_fun1_t< _Ret, _Tp, _Arg > | One of the adaptors for member pointers |
►Cstd::binary_function< _Tp, _Arg, _Ret > | |
Cstd::const_mem_fun1_ref_t< _Ret, _Tp, _Arg > | One of the adaptors for member pointers |
Cstd::mem_fun1_ref_t< _Ret, _Tp, _Arg > | One of the adaptors for member pointers |
►Cstd::binary_function< _Tp, _Tp, _Tp > | |
Cstd::divides< _Tp > | One of the math functors |
Cstd::minus< _Tp > | One of the math functors |
Cstd::modulus< _Tp > | One of the math functors |
Cstd::multiplies< _Tp > | One of the math functors |
Cstd::plus< _Tp > | One of the math functors |
►Cstd::binary_function< _Tp, _Tp, bool > | |
Cstd::equal_to< _Tp > | One of the comparison functors |
Cstd::greater< _Tp > | One of the comparison functors |
Cstd::greater_equal< _Tp > | One of the comparison functors |
Cstd::less< _Tp > | One of the comparison functors |
Cstd::less_equal< _Tp > | One of the comparison functors |
Cstd::logical_and< _Tp > | One of the Boolean operations functors |
Cstd::logical_or< _Tp > | One of the Boolean operations functors |
Cstd::not_equal_to< _Tp > | One of the comparison functors |
►Cstd::binary_function< _Tp1, _Tp2, _Tp1 > | |
C__gnu_parallel::multiplies< _Tp1, _Tp2 > | Similar to std::multiplies, but allows two different types |
C__gnu_parallel::plus< _Tp1, _Tp2 > | Similar to std::plus, but allows two different types |
►Cstd::binary_function< const _Tp *, _Arg, _Ret > | |
Cstd::const_mem_fun1_t< _Ret, _Tp, _Arg > | One of the adaptors for member pointers |
►Cstd::binary_function< std::pair< T1, T2 >, std::pair< T1, T2 >, bool > | |
C__gnu_parallel::lexicographic< T1, T2, Comparator > | Compare a pair of types lexicographically, ascending |
►Cstd::binary_function< T1, T2, bool > | |
C__gnu_parallel::equal_from_less< Comparator, T1, T2 > | Constructs predicate for equality from strict weak ordering predicate |
C__gnu_parallel::equal_to< T1, T2 > | Similar to std::equal_to, but allows two different types |
C__gnu_parallel::less< T1, T2 > | Similar to std::less, but allows two different types |
C__gnu_parallel::lexicographic_reverse< T1, T2, Comparator > | Compare a pair of types lexicographically, descending |
Cstd::binary_function< value_type, value_type, bool > | |
►C__gnu_pbds::container_traits_base< Cntnr::container_category > | |
C__gnu_pbds::container_traits< Cntnr > | Container_traits |
►Cstd::iterator< input_iterator_tag, _CharT, _Traits::off_type, _CharT *, _CharT & > | |
Cstd::istreambuf_iterator< _CharT, _Traits > | Provides input iterator semantics for streambufs |
►Cstd::iterator< input_iterator_tag, _Tp, _Dist, const _Tp *, const _Tp & > | |
Cstd::istream_iterator< _Tp, _CharT, _Traits, _Dist > | Provides input iterator semantics for streams |
►Cstd::iterator< iterator_traits< _Iterator >::iterator_category, iterator_traits< _Iterator >::value_type, iterator_traits< _Iterator >::difference_type, iterator_traits< _Iterator >::pointer, iterator_traits< _Iterator >::reference > | |
Cstd::reverse_iterator< _Iterator > | |
►Cstd::iterator< output_iterator_tag, void, void, void, void > | |
Cstd::back_insert_iterator< _Container > | Turns assignment into insertion |
Cstd::front_insert_iterator< _Container > | Turns assignment into insertion |
Cstd::insert_iterator< _Container > | Turns assignment into insertion |
Cstd::ostream_iterator< _Tp, _CharT, _Traits > | Provides output iterator semantics for streams |
Cstd::ostreambuf_iterator< _CharT, _Traits > | Provides output iterator semantics for streambufs |
Cstd::raw_storage_iterator< _OutputIterator, _Tp > | |
Cstd::iterator< std::random_access_iterator_tag, bool > | |
Cstd::iterator_traits< _Tp > | |
►Cstd::pair< Iterator1, Iterator2 > | |
C__gnu_parallel::iterator_pair< Iterator1, Iterator2, IteratorCategory > | A pair of iterators. The usual iterator operations are applied to both child iterators |
Cstd::pair< RandomAccessIterator, RandomAccessIterator > | |
C__gnu_parallel::RestrictedBoundedConcurrentQueue< pair< RandomAccessIterator, RandomAccessIterator > > | |
Cstd::__parallel::c_rand_number< must_be_int > | Functor wrapper for std::rand() |
►Cstd::_Deque_base< _Tp, _Alloc > | |
Cstd::deque< _Tp, _Alloc > | A standard container using fixed-size memory allocation and constant-time manipulation of elements at either end |
Cstd::_Deque_iterator< _Tp, _Ref, _Ptr > | A deque::iterator |
Cstd::_Fnv_hash< size_t > | Dummy generic implementation (for sizeof(size_t) != 4, 8) |
►Cstd::_Fwd_list_base< _Tp, _Alloc > | Base class for forward_list |
Cstd::forward_list< _Tp, _Alloc > | A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence |
Cstd::_Fwd_list_const_iterator< _Tp, _Alloc > | A forward_list::const_iterator |
Cstd::_Fwd_list_iterator< _Tp, _Alloc > | A forward_list::iterator |
►Cstd::_Fwd_list_node_base< _Alloc > | 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 |
Cstd::_Fwd_list_node< _Tp, _Alloc > | 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 |
►Cstd::_List_base< _Tp, _Alloc > | See bits/stl_deque.h's _Deque_base for an explanation |
Cstd::list< _Tp, _Alloc > | A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence |
Cstd::_List_const_iterator< _Tp > | A list::const_iterator |
Cstd::_List_iterator< _Tp > | A list::iterator |
►Cstd::_List_node_base | Common part of a node in the list |
Cstd::_List_node< _Tp > | An actual node in the list |
Cstd::_Temporary_buffer< _ForwardIterator, _Tp > | |
►Cstd::_Vector_base< _Tp, _Alloc > | See bits/stl_deque.h's _Deque_base for an explanation |
Cstd::vector< _Tp, _Alloc > | A standard container which offers fixed time access to individual elements in any order |
Cstd::allocator< _Tp > | The "standard" allocator, as per [20.4].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt04ch11.html |
Cstd::allocator< void > | Allocator<void> specialization |
Cstd::auto_ptr< _Tp > | A simple smart pointer providing strict ownership semantics |
Cstd::auto_ptr_ref< _Tp1 > | |
Cstd::basic_string< _CharT, _Traits, _Alloc > | Managing sequences of characters and character-like objects |
►Cstd::binary_function< _Arg1, _Arg2, _Result > | |
Cstd::pointer_to_binary_function< _Arg1, _Arg2, _Result > | One of the adaptors for function pointers |
Cstd::char_traits< __gnu_cxx::character< V, I, S > > | Char_traits<__gnu_cxx::character> specialization |
Cstd::char_traits< char > | 21.1.3.1 char_traits specializations |
Cstd::char_traits< wchar_t > | 21.1.3.2 char_traits specializations |
►Cstd::codecvt_base | Empty base class for codecvt facet [22.2.1.5] |
►Cstd::__codecvt_abstract_base< _InternT, _ExternT, encoding_state > | |
Cstd::codecvt< _InternT, _ExternT, encoding_state > | Codecvt<InternT, _ExternT, encoding_state> specialization |
►Cstd::__codecvt_abstract_base< char, char, mbstate_t > | |
Cstd::codecvt< char, char, mbstate_t > | Class codecvt<char, char, mbstate_t> specialization |
►Cstd::__codecvt_abstract_base< wchar_t, char, mbstate_t > | |
Cstd::codecvt< wchar_t, char, mbstate_t > | Class codecvt<wchar_t, char, mbstate_t> specialization |
►Cstd::__codecvt_abstract_base< _InternT, _ExternT, _StateT > | Common base for codecvt functions |
►Cstd::codecvt< _InternT, _ExternT, _StateT > | Class codecvt [22.2.1.5]. NB: Generic, mostly useless implementation |
Cstd::codecvt_byname< _InternT, _ExternT, _StateT > | Class codecvt_byname [22.2.1.6] |
►Cstd::ctype_base | Base class for ctype |
►Cstd::__ctype_abstract_base< wchar_t > | |
Cstd::ctype< wchar_t > | The ctype<wchar_t> specialization |
►Cstd::__ctype_abstract_base< _CharT > | Common base for ctype facet |
►Cstd::ctype< _CharT > | Template ctype facet |
Cstd::ctype_byname< _CharT > | Class ctype_byname [22.2.1.2] |
►Cstd::ctype< char > | The ctype<char> specialization |
Cstd::ctype_byname< char > | 22.2.1.4 Class ctype_byname specializations |
Cstd::default_delete< _Tp > | Primary template, default_delete |
Cstd::default_delete< _Tp[]> | Specialization, default_delete |
Cstd::fpos< _StateT > | Class representing stream positions |
Cstd::gslice | Class defining multi-dimensional subset of an array |
Cstd::gslice_array< _Tp > | Reference to multi-dimensional subset of an array |
Cstd::indirect_array< _Tp > | Reference to arbitrary subset of an array |
►Cstd::input_iterator_tag | Marking input iterators |
►Cstd::forward_iterator_tag | Forward iterators support a superset of input iterator operations |
►Cstd::bidirectional_iterator_tag | Bidirectional iterators support a superset of forward iterator operations |
Cstd::random_access_iterator_tag | Random-access iterators support a superset of bidirectional iterator operations |
►Cstd::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) |
Cstd::basic_ios< _CharT, _Traits > | 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 |
Cstd::ios_base::failure | These are thrown to indicate problems with io.27.4.2.1.1 Class ios_base::failure |
Cstd::iterator< _Category, _Tp, _Distance, _Pointer, _Reference > | Common iterator class |
Cstd::iterator_traits< _Iterator > | |
Cstd::locale | Container class for localization functionality |
►Cstd::locale::facet | Localization functionality base class |
Cstd::__codecvt_abstract_base< _InternT, _ExternT, encoding_state > | |
Cstd::__codecvt_abstract_base< char, char, mbstate_t > | |
Cstd::__codecvt_abstract_base< wchar_t, char, mbstate_t > | |
Cstd::__ctype_abstract_base< wchar_t > | |
Cstd::__codecvt_abstract_base< _InternT, _ExternT, _StateT > | Common base for codecvt functions |
Cstd::__ctype_abstract_base< _CharT > | Common base for ctype facet |
►Cstd::collate< _CharT > | Facet for localized string comparison |
Cstd::collate_byname< _CharT > | Class collate_byname [22.2.4.2] |
Cstd::ctype< char > | The ctype<char> specialization |
►Cstd::messages< _CharT > | Facet for handling message catalogs |
Cstd::messages_byname< _CharT > | Class messages_byname [22.2.7.2] |
Cstd::money_get< _CharT, _InIter > | Facet for parsing monetary amounts |
Cstd::money_put< _CharT, _OutIter > | Facet for outputting monetary amounts |
►Cstd::moneypunct< _CharT, _Intl > | Facet for formatting data for money amounts |
Cstd::moneypunct_byname< _CharT, _Intl > | Class moneypunct_byname [22.2.6.4] |
Cstd::num_get< _CharT, _InIter > | Facet for parsing number strings |
Cstd::num_put< _CharT, _OutIter > | Facet for converting numbers to strings |
►Cstd::numpunct< _CharT > | Numpunct facet |
Cstd::numpunct_byname< _CharT > | Class numpunct_byname [22.2.3.2] |
►Cstd::time_get< _CharT, _InIter > | Facet for parsing dates and times |
Cstd::time_get_byname< _CharT, _InIter > | Class time_get_byname [22.2.5.2] |
►Cstd::time_put< _CharT, _OutIter > | Facet for outputting dates and times |
Cstd::time_put_byname< _CharT, _OutIter > | Class time_put_byname [22.2.5.4] |
Cstd::locale::id | Facet ID class |
Cstd::map< _Key, _Tp, _Compare, _Alloc > | A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time |
Cstd::mask_array< _Tp > | Reference to selected subset of an array |
►Cstd::messages_base | Messages facet base class providing catalog typedef |
Cstd::messages< _CharT > | Facet for handling message catalogs |
►Cstd::money_base | Money format ordering data |
Cstd::moneypunct< _CharT, _Intl > | Facet for formatting data for money amounts |
Cstd::move_iterator< _Iterator > | |
Cstd::multimap< _Key, _Tp, _Compare, _Alloc > | A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time |
Cstd::multiset< _Key, _Compare, _Alloc > | A standard container made up of elements, which can be retrieved in logarithmic time |
Cstd::output_iterator_tag | Marking output iterators |
Cstd::pair< _T1, _T2 > | Pair holds two objects of arbitrary type |
Cstd::priority_queue< _Tp, _Sequence, _Compare > | A standard container automatically sorting its contents |
Cstd::queue< _Tp, _Sequence > | A standard container giving FIFO behavior |
Cstd::reference_wrapper< _Tp > | A convenience wrapper for creating a pair from two objects |
Cstd::set< _Key, _Compare, _Alloc > | A standard container made up of unique keys, which can be retrieved in logarithmic time |
Cstd::slice | Class defining one-dimensional subset of an array |
Cstd::slice_array< _Tp > | Reference to one-dimensional subset of an array |
Cstd::stack< _Tp, _Sequence > | A standard container giving FILO behavior |
►Cstd::time_base | Time format ordering data |
Cstd::time_get< _CharT, _InIter > | Facet for parsing dates and times |
Cstd::tr1::__detail::__floating_point_constant< _Tp > | A class to encapsulate type dependent floating point constants. Not everything will be able to be expressed as type logic |
Cstd::tr1::__detail::__numeric_constants< _Tp > | A structure for numeric constants |
►Cstd::unary_function< _Arg, _Result > | |
Cstd::pointer_to_unary_function< _Arg, _Result > | One of the adaptors for function pointers |
Cstd::unique_ptr< _Tp, _Tp_Deleter > | 20.7.12.2 unique_ptr for single objects |
Cstd::unique_ptr< _Tp[], _Tp_Deleter > | 20.7.12.3 unique_ptr for array objects with a runtime length |
Cstd::vector< bool, _Alloc > | A specialization of vector for booleans which offers fixed time access to individual elements in any order |
Cstd::unary_function< _Functor::argument_type, _Functor::result_type > | |
►Cstd::unary_function< _Operation::first_argument_type, _Operation::result_type > | |
Cstd::binder2nd< _Operation > | One of the binder functors |
►Cstd::unary_function< _Operation::second_argument_type, _Operation::result_type > | |
Cstd::binder1st< _Operation > | One of the binder functors |
Cstd::unary_function< _Pair, _Pair::first_type > | |
Cstd::unary_function< _Pair, _Pair::second_type > | |
►Cstd::unary_function< _Predicate::argument_type, bool > | |
Cstd::unary_negate< _Predicate > | One of the negation functors |
►Cstd::unary_function< _Tp *, _Ret > | |
Cstd::mem_fun_t< _Ret, _Tp > | One of the adaptors for member pointers |
►Cstd::unary_function< _Tp *, size_t > | |
Cstd::hash< _Tp * > | Partial specializations for pointer types |
►Cstd::unary_function< _Tp, _Ret > | |
Cstd::const_mem_fun_ref_t< _Ret, _Tp > | One of the adaptors for member pointers |
Cstd::mem_fun_ref_t< _Ret, _Tp > | One of the adaptors for member pointers |
►Cstd::unary_function< _Tp, _Tp > | |
Cstd::negate< _Tp > | One of the math functors |
►Cstd::unary_function< _Tp, bool > | |
Cstd::logical_not< _Tp > | One of the Boolean operations functors |
►Cstd::unary_function< _Tp, size_t > | |
Cstd::hash< _Tp > | Class template hash |
►Cstd::unary_function< argument_type, bool > | |
C__gnu_parallel::unary_negate< _Predicate, argument_type > | Similar to std::binder1st, but giving the argument types explicitly |
►Cstd::unary_function< const _Tp *, _Ret > | |
Cstd::const_mem_fun_t< _Ret, _Tp > | One of the adaptors for member pointers |
►Cstd::unary_function< first_argument_type, result_type > | |
C__gnu_parallel::binder2nd< _Operation, first_argument_type, second_argument_type, result_type > | Similar to std::binder2nd, but giving the argument types explicitly |
►Cstd::unary_function< second_argument_type, result_type > | |
C__gnu_parallel::binder1st< _Operation, first_argument_type, second_argument_type, result_type > | Similar to std::binder1st, but giving the argument types explicitly |
►Cstd::unary_function< std::pair< _Tp, _Tp >, bool > | |
C__gnu_cxx::__detail::_Ffit_finder< _Tp > | The class which acts as a predicate for applying the first-fit memory allocation policy for the bitmap allocator |