📦 gcc-toolset-16-libstdc++-docs

894 pages · page 2 of 5

# (continued)

__gnu_pbds::detail::bin_search_tree_it_(3)Iterator.✨
__gnu_pbds::detail::bin_search_tree_node_it_(3)Node iterator.✨
__gnu_pbds::detail::bin_search_tree_traits(3)Binary search tree traits, primary template.✨
__gnu_pbds::detail::binary_heap(3)✨
__gnu_pbds::detail::binary_heap_const_iterator_(3)Const point-type iterator.✨
__gnu_pbds::detail::binary_heap_point_const_iterator_(3)Const point-type iterator.✨
__gnu_pbds::detail::binomial_heap(3)✨
__gnu_pbds::detail::binomial_heap_base(3)Base class for binomial heap.✨
__gnu_pbds::detail::branch_policy(3)Primary template, base class for branch structure policies.✨
__gnu_pbds::detail::cc_ht_map(3)✨
__gnu_pbds::detail::cond_dealtor(3)Conditional deallocate constructor argument.✨
__gnu_pbds::detail::container_base_dispatch(3)Dispatch mechanism, primary template for associative types.✨
__gnu_pbds::detail::default_comb_hash_fn(3)Primary template, default_comb_hash_fn.✨
__gnu_pbds::detail::default_eq_fn(3)Primary template, default_eq_fn.✨
__gnu_pbds::detail::default_hash_fn(3)Primary template, default_hash_fn.✨
__gnu_pbds::detail::default_probe_fn(3)Primary template, default_probe_fn.✨
__gnu_pbds::detail::default_resize_policy(3)Primary template, default_resize_policy.✨
__gnu_pbds::detail::default_trie_access_traits(3)Primary template, default_trie_access_traits.✨
__gnu_pbds::detail::default_update_policy(3)Default update policy.✨
__gnu_pbds::detail::dumnode_const_iterator(3)Constant node iterator.✨
__gnu_pbds::detail::entry_cmp(3)Entry compare, primary template.✨
__gnu_pbds::detail::entry_pred(3)Entry predicate primary class template.✨
__gnu_pbds::detail::eq_by_less(3)Equivalence function.✨
__gnu_pbds::detail::gp_ht_map(3)✨
__gnu_pbds::detail::hash_eq_fn(3)Primary template.✨
__gnu_pbds::detail::hash_load_check_resize_trigger_size_base(3)Primary template.✨
__gnu_pbds::detail::left_child_next_sibling_heap(3)Base class for a basic heap.✨
__gnu_pbds::detail::left_child_next_sibling_heap_const_iterator_(3)Const point-type iterator.✨
__gnu_pbds::detail::left_child_next_sibling_heap_node_(3)Node.✨
__gnu_pbds::detail::left_child_next_sibling_heap_node_point_const_iterator_(3)Const point-type iterator.✨
__gnu_pbds::detail::lu_counter_metadata(3)A list-update metadata type that moves elements to the front of the list based on the counter algorithm.✨
__gnu_pbds::detail::lu_counter_policy_base(3)Base class for list-update counter policy.✨
__gnu_pbds::detail::lu_map(3)list-based (with updates) associative container. Skip to the lu, my darling.✨
__gnu_pbds::detail::mask_based_range_hashing(3)Range hashing policy.✨
__gnu_pbds::detail::maybe_null_type(3)Base class for conditionally defining a static data member.✨
__gnu_pbds::detail::mod_based_range_hashing(3)Mod based range hashing.✨
__gnu_pbds::detail::no_throw_copies(3)Primary template.✨
__gnu_pbds::detail::ov_tree_map(3)Ordered-vector tree associative- container.✨
__gnu_pbds::detail::ov_tree_map_cond_dtor(3)Conditional destructor.✨
__gnu_pbds::detail::ov_tree_node_const_it_(3)Const node reference.✨
__gnu_pbds::detail::ov_tree_node_it_(3)Node reference.✨
__gnu_pbds::detail::pairing_heap(3)✨
__gnu_pbds::detail::pat_trie_base(3)Base type for PATRICIA trees.✨
__gnu_pbds::detail::pat_trie_base__CIter(3)Const iterator.✨
__gnu_pbds::detail::pat_trie_base__Head(3)Head node for PATRICIA tree.✨
__gnu_pbds::detail::pat_trie_base__Inode(3)Internal node type, PATRICIA tree.✨
__gnu_pbds::detail::pat_trie_base__Inode_const_iterator(3)Constant child iterator.✨
__gnu_pbds::detail::pat_trie_base__Inode_iterator(3)Child iterator.✨
__gnu_pbds::detail::pat_trie_base__Iter(3)Iterator.✨
__gnu_pbds::detail::pat_trie_base__Leaf(3)Leaf node for PATRICIA tree.✨
__gnu_pbds::detail::pat_trie_base__Metadata(3)Metadata base primary template.✨
__gnu_pbds::detail::pat_trie_base__Node_base(3)Node base.✨
__gnu_pbds::detail::pat_trie_base__Node_citer(3)Node const iterator.✨
__gnu_pbds::detail::pat_trie_base__Node_iter(3)Node iterator.✨
__gnu_pbds::detail::pat_trie_map(3)PATRICIA trie.✨
__gnu_pbds::detail::probe_fn_base(3)Probe functor base.✨
__gnu_pbds::detail::ranged_hash_fn(3)Primary template.✨
__gnu_pbds::detail::ranged_probe_fn(3)Primary template.✨
__gnu_pbds::detail::rb_tree_map(3)Red-Black tree.✨
__gnu_pbds::detail::rb_tree_node_(3)Node for Red-Black trees.✨
__gnu_pbds::detail::rc(3)Redundant binary counter.✨
__gnu_pbds::detail::rc_binomial_heap(3)✨
__gnu_pbds::detail::rebind_traits(3)Consistent API for accessing allocator-related types.✨
__gnu_pbds::detail::resize_policy(3)Resize policy for binary heap.✨
__gnu_pbds::detail::select_value_type(3)Choose value_type to be a key/value pair or just a key.✨
__gnu_pbds::detail::splay_tree_map(3)Splay tree.✨
__gnu_pbds::detail::splay_tree_node_(3)Node for splay tree.✨
__gnu_pbds::detail::stored_data(3)Primary template for representation of stored data. Two types of data can be stored: value and hash.✨
__gnu_pbds::detail::stored_hash(3)Stored hash.✨
__gnu_pbds::detail::stored_value(3)Stored value.✨
__gnu_pbds::detail::synth_access_traits(3)Synthetic element access traits.✨
__gnu_pbds::detail::thin_heap(3)✨
__gnu_pbds::detail::tree_metadata_helper(3)Tree metadata helper.✨
__gnu_pbds::detail::tree_node_metadata_dispatch(3)Tree node metadata dispatch.✨
__gnu_pbds::detail::tree_traits(3)Tree traits class, primary template.✨
__gnu_pbds::detail::trie_metadata_helper(3)Trie metadata helper.✨
__gnu_pbds::detail::trie_node_metadata_dispatch(3)Trie node metadata dispatch.✨
__gnu_pbds::detail::trie_policy_base(3)Base class for trie policies.✨
__gnu_pbds::detail::trie_traits(3)Trie traits class, primary template.✨
__gnu_pbds::detail::types_traits(3)Traits for abstract types.✨
__gnu_pbds::direct_mask_range_hashing(3)A mask range- hashing class (uses a bitmask).✨
__gnu_pbds::direct_mod_range_hashing(3)A mod range-hashing class (uses the modulo function).✨
__gnu_pbds::gp_hash_table(3)✨
__gnu_pbds::gp_hash_tag(3)General-probing hash.✨
__gnu_pbds::hash_exponential_size_policy(3)A size policy whose sequence of sizes form an exponential sequence (typically powers of 2.✨
__gnu_pbds::hash_load_check_resize_trigger(3)A resize trigger policy based on a load check. It keeps the load factor between some load factors load_min and load_max.✨
__gnu_pbds::hash_prime_size_policy(3)A size policy whose sequence of sizes form a nearly-exponential sequence of primes.✨
__gnu_pbds::hash_standard_resize_policy(3)A resize policy which delegates operations to size and trigger policies.✨
__gnu_pbds::insert_error(3)An entry cannot be inserted into a container object for logical reasons (not, e.g., if memory is unabvailable, in which case the allocator_type's exception will be thrown).✨
__gnu_pbds::join_error(3)A join cannot be performed logical reasons (i.e., the ranges of the two container objects being joined overlaps.✨
__gnu_pbds::linear_probe_fn(3)A probe sequence policy using fixed increments.✨
__gnu_pbds::list_update(3)✨
__gnu_pbds::list_update_tag(3)List-update.✨
__gnu_pbds::lu_counter_policy(3)✨
__gnu_pbds::lu_move_to_front_policy(3)✨
__gnu_pbds::null_node_update(3)A null node updator, indicating that no node updates are required.✨
__gnu_pbds::null_type(3)Represents no type, or absence of type, for template tricks.✨
__gnu_pbds::ov_tree_tag(3)Ordered-vector tree.✨
__gnu_pbds::pairing_heap_tag(3)Pairing-heap.✨
__gnu_pbds::pat_trie_tag(3)PATRICIA trie.✨
__gnu_pbds::point_invalidation_guarantee(3)✨
__gnu_pbds::priority_queue(3)✨
__gnu_pbds::priority_queue_tag(3)Basic priority-queue.✨
__gnu_pbds::quadratic_probe_fn(3)A probe sequence policy using square increments.✨
__gnu_pbds::range_invalidation_guarantee(3)✨
__gnu_pbds::rb_tree_tag(3)Red-black tree.✨
__gnu_pbds::rc_binomial_heap_tag(3)Redundant-counter binomial-heap.✨
__gnu_pbds::resize_error(3)A container cannot be resized.✨
__gnu_pbds::sample_probe_fn(3)A sample probe policy.✨
__gnu_pbds::sample_range_hashing(3)A sample range-hashing functor.✨
__gnu_pbds::sample_ranged_hash_fn(3)A sample ranged-hash functor.✨
__gnu_pbds::sample_ranged_probe_fn(3)A sample ranged-probe functor.✨
__gnu_pbds::sample_resize_policy(3)A sample resize policy.✨
__gnu_pbds::sample_resize_trigger(3)A sample resize trigger policy.✨
__gnu_pbds::sample_size_policy(3)A sample size policy.✨
__gnu_pbds::sample_tree_node_update(3)A sample node updator.✨
__gnu_pbds::sample_trie_access_traits(3)A sample trie element access traits.✨
__gnu_pbds::sample_trie_node_update(3)A sample node updator.✨
__gnu_pbds::sample_update_policy(3)A sample list-update policy.✨
__gnu_pbds::sequence_tag(3)Basic sequence.✨
__gnu_pbds::splay_tree_tag(3)Splay tree.✨
__gnu_pbds::string_tag(3)Basic string container, inclusive of strings, ropes, etc.✨
__gnu_pbds::thin_heap_tag(3)Thin heap.✨
__gnu_pbds::tree(3)✨
__gnu_pbds::tree_order_statistics_node_update(3)Functor updating ranks of entrees.✨
__gnu_pbds::tree_tag(3)Basic tree structure.✨
__gnu_pbds::trie(3)✨
__gnu_pbds::trie_order_statistics_node_update(3)Functor updating ranks of entrees.✨
__gnu_pbds::trie_prefix_search_node_update(3)A node updator that allows tries to be searched for the range of values that match a certain prefix.✨
__gnu_pbds::trie_string_access_traits(3)✨
__gnu_pbds::trie_tag(3)Basic trie structure.✨
__gnu_pbds::trivial_iterator_tag(3)A trivial iterator tag. Signifies that the iterators has none of std::iterators's movement abilities.✨
__gnu_sequential(3)GNU sequential classes for public use.✨
_Bind(3)Type of the function object returned from bind().✨
_Bind_result(3)Type of the function object returned from bind<R>().✨
_Not_fn(3)Generalized negator.✨

A

abi::__forced_unwind(3)Thrown as part of forced unwinding.✨

C

C++Intro(3)Introduction to the GNU libstdc++ man pages✨

S

SGIextensions(3)SGI✨
std::__basic_future(3)Common implementation for future and shared_future.✨
std::__codecvt_abstract_base(3)Common base for codecvt functions.✨
std::__ctype_abstract_base(3)Common base for ctype facet.✨
std::__cxx11_collate(3)Facet for localized string comparison.✨
std::__cxx11_collate_byname(3)class collate_byname [22.2.4.2].✨
std::__debug(3)GNU debug code, replaces standard behavior with debug behavior.✨
std::__debug::bitset(3)Class std::bitset with additional safety/checking/debug instrumentation.✨
std::__debug::deque(3)Class std::deque with safety/checking/debug instrumentation.✨
std::__debug::forward_list(3)Class std::forward_list with safety/checking/debug instrumentation.✨
std::__debug::list(3)Class std::list with safety/checking/debug instrumentation.✨
std::__debug::map(3)Class std::map with safety/checking/debug instrumentation.✨
std::__debug::multimap(3)Class std::multimap with safety/checking/debug instrumentation.✨
std::__debug::multiset(3)Class std::multiset with safety/checking/debug instrumentation.✨
std::__debug::set(3)Class std::set with safety/checking/debug instrumentation.✨
std::__debug::unordered_map(3)Class std::unordered_map with safety/checking/debug instrumentation.✨
std::__debug::unordered_multimap(3)Class std::unordered_multimap with safety/checking/debug instrumentation.✨
std::__debug::unordered_multiset(3)Class std::unordered_multiset with safety/checking/debug instrumentation.✨
std::__debug::unordered_set(3)Class std::unordered_set with safety/checking/debug instrumentation.✨
std::__debug::vector(3)Class std::vector with safety/checking/debug instrumentation.✨
std::__detail(3)Implementation details not part of the namespace std interface.✨
std::__detail::_BracketMatcher(3)Matches a character range (bracket expression).✨
std::__detail::_Compiler(3)Builds an NFA from an input iterator range.✨
std::__detail::_Executor(3)Takes a regex and an input string and does the matching.✨
std::__detail::_List_node_base(3)Common part of a node in the list.✨
std::__detail::_List_node_header(3)The list node header.✨
std::__detail::_Quoted_string(3)Struct for delimited strings.✨
std::__detail::_Scanner(3)Scans an input range for regex tokens.✨
std::__detail::_StateSeq(3)Describes a sequence of one or more _State, its current start and end(s). This structure contains fragments of an NFA during construction.✨
std::__fwdlist__Iterator(3)A forward_list iterator when the allocator uses fancy pointers.✨
std::__fwdlist__Node(3)A helper node class for forward_list.✨
std::__fwdlist__Node_base(3)The node-base type for allocators that use fancy pointers.✨
std::__is_fast_hash(3)✨
std::__is_location_invariant(3)✨
std::__new_allocator(3)An allocator that uses global new, as per C++03 [20.4.1].✨
std::__numeric_limits_base(3)Part of std::numeric_limits.✨
std::__parallel(3)GNU parallel code, replaces standard behavior with parallel behavior.✨
std::__parallel::_CRandNumber(3)Functor wrapper for std::rand().✨
std::_Base_bitset(3)✨
std::_Bind(3)Type of the function object returned from bind().✨
std::_Bind_result(3)Type of the function object returned from bind<R>().✨
std::_Deque_base(3)✨
std::_Deque_iterator(3)A deque::iterator.✨
std::_Function_base(3)Base class of all polymorphic function object wrappers.✨
std::_Fwd_list_base(3)Base class for forward_list.✨
std::_Fwd_list_const_iterator(3)A forward_list::const_iterator.✨
std::_Fwd_list_iterator(3)A forward_list::iterator.✨
std::_Fwd_list_node(3)A helper node class for forward_list. This is just a linked list with uninitialized storage for a data value in each node. There is a sorting utility method.✨
std::_Fwd_list_node_base(3)A helper basic node class for forward_list.✨
std::_List_base(3)See bits/stl_deque.h's _Deque_base for an explanation.✨
std::_List_const_iterator(3)A list::const_iterator.✨
std::_List_iterator(3)A list::iterator.✨
std::_List_node(3)An actual node in the list.✨
std::_Node_handle(3)Node handle type for maps.✨
std::_Node_handle_common(3)Base class for node handle types of maps and sets.✨
std::_Node_insert_return(3)Return type of insert(node_handle&&) on unique maps/sets.✨
std::_Not_fn(3)Generalized negator.✨
std::_Placeholder(3)The type of placeholder objects defined by libstdc++.✨
std::_Temporary_buffer(3)✨
std::_Vector_base(3)See bits/stl_deque.h's _Deque_base for an explanation.✨
std::add_const(3)add_const✨
std::add_cv(3)add_cv✨