|
STLdoc
STLdocumentation
|
|
STLdoc
STLdocumentation
|
  __cxxabiv1 | |
 __gnu_cxx | |
  typelist | |
| __gnu_debug | GNU debug classes for public use |
 _Safe_iterator | Safe iterator wrapper |
| _Safe_local_iterator | Safe iterator wrapper |
| _Safe_sequence | Base class for constructing a safe sequence type that tracks iterators that reference it |
| _Error_formatter | |
| _Is_iterator | |
| _Is_sequence | |
| _Parameter | |
| _BeforeBeginHelper< std::__debug::forward_list< _Tp, _Alloc > > | |
| __is_safe_random_iterator | |
| __is_safe_random_iterator< _Safe_iterator< _Iterator, _Sequence > > | |
| _Siter_base | |
| _Safe_iterator_base | Basic functionality for a safe iterator |
| _Safe_sequence_base | Base class that supports tracking of iterators that reference a sequence |
| _BeforeBeginHelper | |
| _Not_equal_to | |
| _Equal_to | |
| _After_nth_from | |
| _Safe_local_iterator_base | Basic functionality for a safe iterator |
| _Safe_unordered_container_base | Base class that supports tracking of local iterators that reference an unordered container |
| _Safe_unordered_container | Base class for constructing a safe unordered container type that tracks iterators that reference it |
| basic_string | Class std::basic_string with safety/checking/debug instrumentation |
| __gnu_parallel | GNU parallel code for public use |
| _QSBThreadLocal | Information local to one thread in the parallel quicksort run |
| _EqualFromLess | Constructs predicate for equality from strict weak ordering predicate |
| __unary_negate | Similar to std::unary_negate, but giving the argument types explicitly |
| __binder1st | Similar to std::binder1st, but giving the argument types explicitly |
| __binder2nd | Similar to std::binder2nd, but giving the argument types explicitly |
| _EqualTo | Similar to std::equal_to, but allows two different types |
| _Less | Similar to std::less, but allows two different types |
| _Less< _Tp, _Tp > | |
| _Plus | Similar to std::plus, but allows two different types |
| _Plus< _Tp, _Tp, _Tp > | |
| _Multiplies | Similar to std::multiplies, but allows two different types |
| _Multiplies< _Tp, _Tp, _Tp > | |
| _PseudoSequenceIterator | _Iterator associated with __gnu_parallel::_PseudoSequence. If features the usual random-access iterator functionality |
| _PseudoSequence | Sequence that conceptually consists of multiple copies of the same element. The copies are not stored explicitly, of course |
| __generic_find_selector | Base class of all __gnu_parallel::__find_template selectors |
| __find_if_selector | Test predicate on a single element, used for std::find() and std::find_if () |
| __adjacent_find_selector | Test predicate on two adjacent elements |
| __mismatch_selector | Test inverted predicate on a single element |
| __find_first_of_selector | Test predicate on several elements |
| __generic_for_each_selector | Generic __selector for embarrassingly parallel functions |
| __for_each_selector | Std::for_each() selector |
| __generate_selector | Std::generate() selector |
| __fill_selector | Std::fill() selector |
| __transform1_selector | Std::transform() __selector, one input sequence variant |
| __transform2_selector | Std::transform() __selector, two input sequences variant |
| __replace_selector | Std::replace() selector |
| __replace_if_selector | Std::replace() selector |
| __count_selector | Std::count() selector |
| __count_if_selector | Std::count_if () selector |
| __accumulate_selector | Std::accumulate() selector |
| __inner_product_selector | Std::inner_product() selector |
| __identity_selector | Selector that just returns the passed iterator |
| __adjacent_difference_selector | Selector that returns the difference between two adjacent __elements |
| _Nothing | Functor doing nothing |
| _DummyReduct | Reduction function doing nothing |
| __min_element_reduct | Reduction for finding the maximum element, using a comparator |
| __max_element_reduct | Reduction for finding the maximum element, using a comparator |
| __accumulate_binop_reduct | General reduction, using a binary operator |
| _IteratorPair | A pair of iterators. The usual iterator operations are applied to both child iterators |
| _IteratorTriple | A triple of iterators. The usual iterator operations are applied to all three child iterators |
| _LoserTreeBase | Guarded loser/tournament tree |
| _Loser | Internal representation of a _LoserTree element |
| _LoserTree | Stable _LoserTree variant |
| _LoserTree< false, _Tp, _Compare > | Unstable _LoserTree variant |
| _LoserTreePointerBase | Base class of _Loser Tree implementation using pointers |
| _Loser | Internal representation of _LoserTree __elements |
| _LoserTreePointer | Stable _LoserTree implementation |
| _LoserTreePointer< false, _Tp, _Compare > | Unstable _LoserTree implementation |
| _LoserTreeUnguardedBase | Base class for unguarded _LoserTree implementation |
| _Loser | |
| _LoserTreeUnguarded | Stable implementation of unguarded _LoserTree |
| _LoserTreeUnguarded< false, _Tp, _Compare > | Non-Stable implementation of unguarded _LoserTree |
| _LoserTreePointerUnguardedBase | Unguarded loser tree, keeping only pointers to the elements in the tree structure |
| _Loser | |
| _LoserTreePointerUnguarded | Stable unguarded _LoserTree variant storing pointers |
| _LoserTreePointerUnguarded< false, _Tp, _Compare > | Unstable unguarded _LoserTree variant storing pointers |
| _Lexicographic | Compare __a pair of types lexicographically, ascending |
| _LexicographicReverse | Compare __a pair of types lexicographically, descending |
| _GuardedIterator | _Iterator wrapper supporting an implicit supremum at the end of the sequence, dominating all comparisons |
| _UnguardedIterator | |
| _LoserTreeTraits | Traits for determining whether the loser tree should use pointers or copies |
| __multiway_merge_3_variant_sentinel_switch | Switch for 3-way merging with __sentinels turned off |
| __multiway_merge_3_variant_sentinel_switch< true, _RAIterIterator, _RAIter3, _DifferenceTp, _Compare > | 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, _RAIterIterator, _RAIter3, _DifferenceTp, _Compare > | 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, _RAIterIterator, _RAIter3, _DifferenceTp, _Compare > | Switch for k-way merging with __sentinels turned off |
| _SamplingSorter | Stable sorting functor |
| _SamplingSorter< false, _RAIter, _StrictWeakOrdering > | Non-__stable sorting functor |
| _Piece | Subsequence description |
| _PMWMSSortingData | Data accessed by all threads |
| _SplitConsistently | Split consistently |
| _SplitConsistently< true, _RAIter, _Compare, _SortingPlacesIterator > | Split by exact splitting |
| _SplitConsistently< false, _RAIter, _Compare, _SortingPlacesIterator > | Split by sampling |
| __possibly_stable_sort | |
| __possibly_stable_sort< true, _RAIter, _Compare > | |
| __possibly_stable_sort< false, _RAIter, _Compare > | |
| __possibly_stable_multiway_merge | |
| __possibly_stable_multiway_merge< true, Seq_RAIter, _RAIter, _Compare, _DiffType > | |
| __possibly_stable_multiway_merge< false, Seq_RAIter, _RAIter, _Compare, _DiffType > | |
| _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 |
| _RandomNumber | Random number generator, based on the Mersenne twister |
| _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() |
| __symmetric_difference_func | |
| __difference_func | |
| __intersection_func | |
| __union_func | |
| _Settings | |
| sequential_tag | Forces sequential execution at compile time |
| parallel_tag | Recommends parallel execution at compile time, optionally using a user-specified number of threads |
| default_parallel_tag | Recommends parallel execution using the default parallel algorithm |
| balanced_tag | Recommends parallel execution using dynamic load-balancing at compile time |
| unbalanced_tag | Recommends parallel execution using static load-balancing at compile time |
| omp_loop_tag | Recommends parallel execution using OpenMP dynamic load-balancing at compile time |
| omp_loop_static_tag | Recommends parallel execution using OpenMP static load-balancing at compile time |
| find_tag | Base class for for std::find() variants |
| exact_tag | Forces parallel merging with exact splitting, at compile time |
| sampling_tag | Forces parallel merging with exact splitting, at compile time |
| multiway_mergesort_tag | Forces parallel sorting using multiway mergesort at compile time |
| 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 |
| quicksort_tag | Forces parallel sorting using unbalanced quicksort at compile time |
| balanced_quicksort_tag | Forces parallel sorting using balanced quicksort at compile time |
| growing_blocks_tag | Selects the growing block size variant for std::find() |
| constant_size_blocks_tag | Selects the constant block size variant for std::find() |
| equal_split_tag | Selects the equal splitting variant for std::find() |
| _Job | One __job for a certain thread |
| __gnu_pbds | GNU extensions for policy-based data structures for public use |
| detail | |
| PB_DS_BIN_TREE_NAME | |
| bin_search_tree_const_node_it_ | Const node iterator |
| bin_search_tree_node_it_ | Node iterator |
| bin_search_tree_const_it_ | Const iterator |
| bin_search_tree_it_ | Iterator |
| bin_search_tree_traits | |
| bin_search_tree_traits< Key, null_type, Cmp_Fn, Node_Update, Node, _Alloc > | |
| binary_heap | |
| binary_heap_const_iterator_ | Const point-type iterator |
| entry_cmp | Entry compare, primary template |
| entry_cmp< _VTp, Cmp_Fn, _Alloc, true > | Specialization, true |
| entry_cmp< _VTp, Cmp_Fn, _Alloc, false > | Specialization, false |
| type | Compare plus entry |
| entry_pred | Entry predicate primary class template |
| entry_pred< _VTp, Pred, _Alloc, true > | Specialization, true |
| entry_pred< _VTp, Pred, _Alloc, false > | Specialization, false |
| type | |
| binary_heap_point_const_iterator_ | Const point-type iterator |
| resize_policy | Resize policy for binary heap |
| binomial_heap | |
| binomial_heap_base | Base class for binomial heap |
| branch_policy | Primary template, base class for branch structure policies |
| branch_policy< Node_CItr, Node_CItr, _Alloc > | Specialization for const iterators |
| dumnode_const_iterator | Constant node iterator |
| tree_traits | Tree traits class, primary template |
| trie_traits | Trie traits class, primary template |
| PB_DS_CC_HASH_NAME | |
| entry | |
| cond_dealtor | Conditional dey destructor, cc_hash |
| container_base_dispatch< Key, Mapped, _Alloc, list_update_tag, Policy_Tl > | Specialization for list-update map |
| container_base_dispatch< Key, null_type, _Alloc, list_update_tag, Policy_Tl > | Specialization for list-update set |
| container_base_dispatch< Key, Mapped, _Alloc, pat_trie_tag, Policy_Tl > | Specialization for PATRICIA trie map |
| container_base_dispatch< Key, null_type, _Alloc, pat_trie_tag, Policy_Tl > | Specialization for PATRICIA trie set |
| container_base_dispatch< Key, Mapped, _Alloc, rb_tree_tag, Policy_Tl > | Specialization for R-B tree map |
| container_base_dispatch< Key, null_type, _Alloc, rb_tree_tag, Policy_Tl > | Specialization for R-B tree set |
| container_base_dispatch< Key, Mapped, _Alloc, splay_tree_tag, Policy_Tl > | Specialization splay tree map |
| container_base_dispatch< Key, null_type, _Alloc, splay_tree_tag, Policy_Tl > | Specialization splay tree set |
| container_base_dispatch< Key, Mapped, _Alloc, ov_tree_tag, Policy_Tl > | Specialization ordered-vector tree map |
| container_base_dispatch< Key, null_type, _Alloc, ov_tree_tag, Policy_Tl > | Specialization ordered-vector tree set |
| container_base_dispatch< Key, Mapped, _Alloc, cc_hash_tag, Policy_Tl > | Specialization colision-chaining hash map |
| container_base_dispatch< Key, null_type, _Alloc, cc_hash_tag, Policy_Tl > | Specialization colision-chaining hash set |
| container_base_dispatch< Key, Mapped, _Alloc, gp_hash_tag, Policy_Tl > | Specialization general-probe hash map |
| container_base_dispatch< Key, null_type, _Alloc, gp_hash_tag, Policy_Tl > | Specialization general-probe hash set |
| eq_by_less | Equivalence function |
| hash_eq_fn | Primary template |
| hash_eq_fn< Key, Eq_Fn, _Alloc, false > | Specialization 1 - The client requests that hash values not be stored |
| hash_eq_fn< Key, Eq_Fn, _Alloc, true > | Specialization 2 - The client requests that hash values be stored |
| PB_DS_GP_HASH_NAME | |
| entry | |
| mask_based_range_hashing | Range hashing policy |
| mod_based_range_hashing | Mod based range hashing |
| probe_fn_base | Probe functor base |
| ranged_hash_fn | Primary template |
| ranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, false > | |
| ranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, true > | |
| ranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, false > | |
| ranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, true > | |
| ranged_probe_fn | Primary template |
| ranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, false > | |
| ranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, true > | |
| ranged_probe_fn< Key, null_type, _Alloc, Comb_Probe_Fn, null_type, false > | |
| left_child_next_sibling_heap_const_iterator_ | Const point-type iterator |
| left_child_next_sibling_heap | Base class for a basic heap |
| left_child_next_sibling_heap_node_ | Node |
| left_child_next_sibling_heap_node_< _Value, null_type, _Alloc > | |
| left_child_next_sibling_heap_node_point_const_iterator_ | Const point-type iterator |
| lu_map_entry_metadata_base | |
| lu_map_entry_metadata_base< null_type > | |
| PB_DS_LU_NAME | |
| entry | |
| lu_counter_policy_base | Base class for list-update counter policy |
| lu_counter_metadata | |
| ov_tree_node_const_it_ | Const node reference |
| ov_tree_node_it_ | Node reference |
| PB_DS_OV_TREE_NAME | Ordered-vector tree associative-container |
| cond_dtor | Conditional destructor |
| tree_traits< Key, Mapped, Cmp_Fn, Node_Update, ov_tree_tag, _Alloc > | |
| tree_traits< Key, null_type, Cmp_Fn, Node_Update, ov_tree_tag, _Alloc > | |
| pairing_heap | |
| PB_DS_PAT_TRIE_NAME | PATRICIA trie.This implementation loosely borrows ideas from: 1) Fast Mergeable Integer Maps, Okasaki, Gill 1998 2) Ptset: Sets of integers implemented as Patricia trees, Jean-Christophe Filliatr, 2000 |
| branch_bag | Branch bag, for split-join |
| cond_dealtor | Conditional deallocator |
| pat_trie_base | Base type for PATRICIA trees |
| _CIter | Const iterator |
| _Head | Head node for PATRICIA tree |
| _Inode | Internal node type, PATRICIA tree |
| const_iterator | Constant child iterator |
| iterator | Child iterator |
| _Iter | Iterator |
| _Leaf | Leaf node for PATRICIA tree |
| _Metadata | Metadata base primary template |
| _Metadata< null_type, _Alloc > | Specialization for null metadata |
| _Node_base | Node base |
| _Node_citer | Node const iterator |
| _Node_iter | Node iterator |
| synth_access_traits | Synthetic element access traits |
| trie_traits< Key, Mapped, _ATraits, Node_Update, pat_trie_tag, _Alloc > | |
| trie_traits< Key, null_type, _ATraits, Node_Update, pat_trie_tag, _Alloc > | |
| container_base_dispatch< _VTp, Cmp_Fn, _Alloc, pairing_heap_tag, null_type > | Specialization for pairing_heap |
| container_base_dispatch< _VTp, Cmp_Fn, _Alloc, binomial_heap_tag, null_type > | Specialization for binomial_heap |
| container_base_dispatch< _VTp, Cmp_Fn, _Alloc, rc_binomial_heap_tag, null_type > | Specialization for rc_binary_heap |
| container_base_dispatch< _VTp, Cmp_Fn, _Alloc, binary_heap_tag, null_type > | Specialization for binary_heap |
| container_base_dispatch< _VTp, Cmp_Fn, _Alloc, thin_heap_tag, null_type > | Specialization for thin_heap |
| rb_tree_node_ | Node for Red-Black trees |
| rb_tree_node_< Value_Type, null_type, _Alloc > | |
| PB_DS_RB_TREE_NAME | Red-Black tree.This implementation uses an idea from the SGI STL (using a header node which is needed for efficient iteration) |
| tree_traits< Key, Mapped, Cmp_Fn, Node_Update, rb_tree_tag, _Alloc > | |
| tree_traits< Key, null_type, Cmp_Fn, Node_Update, rb_tree_tag, _Alloc > | |
| rc | Redundant binary counter |
| rc_binomial_heap | |
| hash_load_check_resize_trigger_size_base | Primary template |
| hash_load_check_resize_trigger_size_base< Size_Type, true > | Specializations |
| hash_load_check_resize_trigger_size_base< Size_Type, false > | |
| splay_tree_node_ | Node for splay tree |
| splay_tree_node_< Value_Type, null_type, _Alloc > | |
| PB_DS_S_TREE_NAME | Splay tree |
| tree_traits< Key, Mapped, Cmp_Fn, Node_Update, splay_tree_tag, _Alloc > | |
| tree_traits< Key, null_type, Cmp_Fn, Node_Update, splay_tree_tag, _Alloc > | |
| default_hash_fn | Primary template, default_hash_fn |
| default_eq_fn | Primary template, default_eq_fn |
| default_comb_hash_fn | Primary template, default_comb_hash_fn |
| default_resize_policy | Primary template, default_resize_policy |
| default_update_policy | Default update policy |
| default_probe_fn | Primary template, default_probe_fn |
| default_trie_access_traits | Primary template, default_trie_access_traits |
| default_trie_access_traits< __dtrie_string > | Partial specialization, default_trie_access_traits |
| thin_heap | |
| tree_metadata_helper | Tree metadata helper |
| tree_metadata_helper< Node_Update, false > | Specialization, false |
| tree_metadata_helper< Node_Update, true > | Specialization, true |
| tree_node_metadata_dispatch | Tree node metadata dispatch |
| trie_metadata_helper | Trie metadata helper |
| trie_metadata_helper< Node_Update, false > | Specialization, false |
| trie_metadata_helper< Node_Update, true > | Specialization, true |
| trie_node_metadata_dispatch | Trie node metadata dispatch |
| trie_policy_base | Base class for trie policies |
| is_const_pointer | |
| is_const_reference | |
| is_simple | |
| is_pair | |
| is_pair_imp | |
| is_pair_imp< std::pair< U, V > > | |
| __static_assert | |
| __static_assert< true > | |
| __static_assert_dumclass | |
| type_to_type | |
| no_throw_copies | Primary template |
| no_throw_copies< Key, null_type > | Specialization |
| stored_value | Stored value |
| stored_hash | Stored hash |
| stored_data | |
| stored_data< _Tv, null_type > | Specialization for representation of stored data of just value type |
| type_base | Primary template |
| type_base< Key, Mapped, _Alloc, false > | |
| type_base< Key, Mapped, _Alloc, true > | |
| type_base< Key, null_type, _Alloc, false > | |
| type_base< Key, null_type, _Alloc, true > | |
| type_dispatch | Type base dispatch |
| types_traits | Traits for abstract types |
| container_base_dispatch | Dispatch mechanism, primary template for associative types |
| basic_hash_table | |
| cc_hash_table | |
| gp_hash_table | |
| basic_branch | |
| tree | |
| trie | |
| list_update | |
| sample_probe_fn | A sample probe policy |
| sample_range_hashing | A sample range-hashing functor |
| sample_ranged_hash_fn | A sample ranged-hash functor |
| sample_ranged_probe_fn | A sample ranged-probe functor |
| sample_update_policy | A sample list-update policy |
| sample_resize_policy | A sample resize policy |
| sample_resize_trigger | A sample resize trigger policy |
| sample_size_policy | A sample size policy |
| sample_tree_node_update | A sample node updator |
| sample_trie_access_traits | A sample trie element access traits |
| sample_trie_node_update | A sample node updator |
| container_error | Base class for exceptions |
| insert_error | |
| join_error | |
| resize_error | A container cannot be resized |
| linear_probe_fn | A probe sequence policy using fixed increments |
| quadratic_probe_fn | A probe sequence policy using square increments |
| direct_mask_range_hashing | A mask range-hashing class (uses a bitmask) |
| direct_mod_range_hashing | A mod range-hashing class (uses the modulo function) |
| hash_load_check_resize_trigger | |
| cc_hash_max_collision_check_resize_trigger | |
| hash_exponential_size_policy | |
| hash_prime_size_policy | |
| hash_standard_resize_policy | A resize policy which delegates operations to size and trigger policies |
| lu_move_to_front_policy | |
| lu_counter_policy | |
| priority_queue | |
| trivial_iterator_tag | |
| basic_invalidation_guarantee | |
| point_invalidation_guarantee | |
| range_invalidation_guarantee | |
| container_tag | Base data structure tag |
| sequence_tag | Basic sequence |
| string_tag | Basic string container, inclusive of strings, ropes, etc |
| associative_tag | Basic associative-container |
| basic_hash_tag | Basic hash structure |
| cc_hash_tag | Collision-chaining hash |
| gp_hash_tag | General-probing hash |
| basic_branch_tag | Basic branch structure |
| tree_tag | Basic tree structure |
| rb_tree_tag | Red-black tree |
| splay_tree_tag | Splay tree |
| ov_tree_tag | Ordered-vector tree |
| trie_tag | Basic trie structure |
| pat_trie_tag | PATRICIA trie |
| list_update_tag | List-update |
| priority_queue_tag | Basic priority-queue |
| pairing_heap_tag | Pairing-heap |
| binomial_heap_tag | Binomial-heap |
| rc_binomial_heap_tag | Redundant-counter binomial-heap |
| binary_heap_tag | Binary-heap (array-based) |
| thin_heap_tag | Thin heap |
| null_type | Represents no type, or absence of type, for template tricks |
| null_node_update | A null node updator, indicating that no node updates are required |
| container_traits_base | Primary template, container traits base |
| container_traits_base< cc_hash_tag > | Specialization, cc hash |
| container_traits_base< gp_hash_tag > | Specialization, gp hash |
| container_traits_base< rb_tree_tag > | Specialization, rb tree |
| container_traits_base< splay_tree_tag > | Specialization, splay tree |
| container_traits_base< ov_tree_tag > | Specialization, ov tree |
| container_traits_base< pat_trie_tag > | Specialization, pat trie |
| container_traits_base< list_update_tag > | Specialization, list update |
| container_traits_base< pairing_heap_tag > | Specialization, pairing heap |
| container_traits_base< thin_heap_tag > | Specialization, thin heap |
| container_traits_base< binomial_heap_tag > | Specialization, binomial heap |
| container_traits_base< rc_binomial_heap_tag > | Specialization, rc binomial heap |
| container_traits_base< binary_heap_tag > | Specialization, binary heap |
| container_traits | Container traits |
| tree_order_statistics_node_update | Functor updating ranks of entrees |
| trie_string_access_traits | |
| trie_prefix_search_node_update | |
| trie_order_statistics_node_update | Functor updating ranks of entrees |
| __gnu_profile | GNU profile code for public use |
| __reentrance_guard | Reentrance guard |
| __container_size_info | A container size instrumentation line in the object table |
| __container_size_stack_info | A container size instrumentation line in the stack table |
| __trace_container_size | Container size instrumentation trace producer |
| __hashfunc_info | A hash performance instrumentation line in the object table |
| __hashfunc_stack_info | A hash performance instrumentation line in the stack table |
| __trace_hash_func | Hash performance instrumentation producer |
| __trace_hashtable_size | Hashtable size instrumentation trace producer |
| __list2slist_info | |
| __list2slist_stack_info | |
| __trace_list_to_slist | |
| __list2vector_info | A list-to-vector instrumentation line in the object table |
| __list2vector_stack_info | |
| __trace_list_to_vector | |
| __map2umap_info | A map-to-unordered_map instrumentation line in the object table |
| __map2umap_stack_info | A map-to-unordered_map instrumentation line in the stack table |
| __trace_map2umap | Map-to-unordered_map instrumentation producer |
| __stack_hash | Hash function for summary trace using call stack as index |
| __object_info_base | Base class for a line in the object table |
| __stack_info_base | Base class for a line in the stack table |
| __warning_data | Representation of a warning |
| __cost_factor | |
| __trace_base | Base class for all trace producers |
| __warn | |
| __cost_factor_writer | |
| __cost_factor_setter | |
| __trace_vector_size | Hashtable size instrumentation trace producer |
| __vector2list_info | A vector-to-list instrumentation line in the object table |
| __vector2list_stack_info | A vector-to-list instrumentation line in the stack table |
| __trace_vector_to_list | Vector-to-list instrumentation producer |
| __gnu_sequential | GNU sequential classes for public use |
| detail | |
| java | |
| awt | |
| std | STL namespace |
| __debug | GNU debug code, replaces standard behavior with debug behavior |
| __exception_ptr | |
| exception_ptr | An opaque pointer to an arbitrary exception |
| __parallel | GNU parallel code, replaces standard behavior with parallel behavior |
| __profile | GNU profile code, replaces standard behavior with profile behavior |
| decimal | |
| regex_constants | |
| rel_ops | |
| tr1 | |
| placeholders | |
| nothrow_t | |
| type_info | Part of RTTI |
| sun | |
 awt | |
 CausedFocusEvent | |
| __mini_vector | |
| __versa_string | |
| _Bitmap_counter | |
| _Ffit_finder | |
| _Unwind_Exception | |
| basic_string | |
| const_iterator_ | Const range-type iterator |
| free_list | |
| iterator_ | Range-type iterator |
| mbstate_t | |
| NXConstantString | |
| objc_condition | |
| objc_method_description | |
| objc_mutex | |
| objc_object | |
| objc_struct_layout | |
| objc_super | |
| Object | |
| omp_lock_t | |
| omp_nest_lock_t | |
| point_const_iterator_ | Const point-type iterator |
| point_iterator_ | Find type iterator |
| Protocol |
1.8.6
