Linux Manuals session 3

std::__detail::_Prime_rehash_policy – Synopsis Public Types enum { _S_n_primes } typedef std::size_t _State Public Member Functions _Prime_rehash_policy (float __z=1.0) std::size_t _M_bkt_for_elements (std::size_t __n) const std::pair< bool, std::size_t > _M_need_rehash (std::size_t __n_bkt, std::size_t __n_elt, std::size_t __n_ins) const std::size_t _M_next_bkt (std::size_t __n) const void _M_reset (_State __state) _State _M_state () const float max_load_factor () const noexcept Public Attributes…

std::__detail::_PatternCursor – Synopsis Inherited by std::__detail::_SpecializedCursor< _FwdIterT >. Public Member Functions virtual bool _M_at_end () const =0 virtual void _M_next ()=0 Detailed Description ABC for pattern matching. Definition at line 44 of file regex_cursor.h. Author Generated automatically by Doxygen for libstdc++ from the source code.

std::__detail::_Node_iterator_base< _Value, _Cache_hash_code > – Synopsis Public Types using __node_type = _Hash_node< _Value, _Cache_hash_code > Public Member Functions _Node_iterator_base (__node_type *__p) void _M_incr () Public Attributes __node_type * _M_cur Detailed Description template<typename _Value, bool _Cache_hash_code>struct std::__detail::_Node_iterator_base< _Value, _Cache_hash_code > Base class for node iterators. Definition at line 203 of file hashtable_policy.h. Author Generated automatically by…

std::__detail::_Node_iterator< _Value, __constant_iterators, __cache > – Synopsis Inherits std::__detail::_Node_iterator_base< _Value, __cache >. Public Types typedef std::ptrdiff_t difference_type typedef std::forward_iterator_tag iterator_category using pointer = typename std::conditional< __constant_iterators, const _Value *, _Value * >::type using reference = typename std::conditional< __constant_iterators, const _Value &, _Value & >::type typedef _Value value_type Public Member Functions _Node_iterator (__node_type *__p) void _M_incr…

std::__detail::_Node_const_iterator< _Value, __constant_iterators, __cache > – Synopsis Inherits std::__detail::_Node_iterator_base< _Value, __cache >. Public Types typedef std::ptrdiff_t difference_type typedef std::forward_iterator_tag iterator_category typedef const _Value * pointer typedef const _Value & reference typedef _Value value_type Public Member Functions _Node_const_iterator (__node_type *__p) _Node_const_iterator (const _Node_iterator< _Value, __constant_iterators, __cache > &__x) void _M_incr () reference operator* () const _Node_const_iterator…

std::__detail::_Nfa – Synopsis Inherits std::__detail::_Automaton, and std::vector< _State >. Public Types typedef regex_constants::syntax_option_type _FlagT" typedef unsigned int _SizeT typedef _State _StateT typedef std::allocator< _State > allocator_type typedef __gnu_cxx::__normal_iterator < const_pointer, vector > const_iterator" typedef _Alloc_traits::const_pointer const_pointer" typedef _Alloc_traits::const_reference const_reference" typedef std::reverse_iterator < const_iterator > const_reverse_iterator" typedef ptrdiff_t difference_type typedef __gnu_cxx::__normal_iterator < pointer, vector > iterator"…

std::__detail::_Mod_range_hashing – Synopsis Public Types typedef std::size_t first_argument_type typedef std::size_t result_type typedef std::size_t second_argument_type Public Member Functions result_type operator() (first_argument_type __num, second_argument_type __den) const Detailed Description Default range hashing function: use division to fold a large number into the range [0, N). Definition at line 337 of file hashtable_policy.h. Author Generated automatically by Doxygen for…

std::__detail::_Map_base< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, _Unique_keys > – Synopsis Inherited by std::_Hashtable< _Key, _Tp, _Hash, _Pred, _Alloc >, and std::_Hashtable< _Value, _Hash, _Pred, _Alloc >. Detailed Description template<typename _Key, typename _Value, typename _Alloc, typename _ExtractKey, typename _Equal, typename _H1, typename _H2, typename _Hash, typename _RehashPolicy, typename _Traits, bool _Unique_keys…

std::__detail::_Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache_hash_code > – Synopsis Detailed Description template<typename _Key, typename _Value, typename _ExtractKey, typename _H1, typename _H2, typename _Hash, bool __cache_hash_code>struct std::__detail::_Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache_hash_code > Primary class template _Local_iterator_base. Base class for local iterators, used to iterate within a bucket but not between buckets….

std::__detail::_Local_iterator< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __constant_iterators, __cache > – Synopsis Inherits std::__detail::_Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache >. Public Types typedef std::ptrdiff_t difference_type typedef std::forward_iterator_tag iterator_category typedef std::conditional < __constant_iterators, const _Value *, _Value * >::type pointer" typedef std::conditional < __constant_iterators, const _Value &, _Value & >::type reference" typedef _Value value_type…

std::__detail::_Local_const_iterator< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __constant_iterators, __cache > – Synopsis Inherits std::__detail::_Local_iterator_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache >. Public Types typedef std::ptrdiff_t difference_type typedef std::forward_iterator_tag iterator_category typedef const _Value * pointer typedef const _Value & reference typedef _Value value_type Public Member Functions _Local_const_iterator (const __hash_code_base &__base, _Hash_node< _Value, __cache > *__p,…

std::__detail::_List_node_base – Synopsis Inherited by std::_List_node< _Tp >. Public Member Functions void _M_hook (_List_node_base *const __position) noexcept void _M_reverse () noexcept void _M_transfer (_List_node_base *const __first, _List_node_base *const __last) noexcept void _M_unhook () noexcept Static Public Member Functions static void swap (_List_node_base &__x, _List_node_base &__y) noexcept Public Attributes _List_node_base * _M_next _List_node_base * _M_prev Detailed…

std::__detail::_Insert_base< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits > – Synopsis Inherited by std::__detail::_Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, false, _Unique_keys >, std::__detail::_Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, true, false >, and std::__detail::_Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy,…

std::__detail::_Insert< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits, _Constant_iterators, _Unique_keys > – Synopsis Inherited by std::_Hashtable< _Key, _Tp, _Hash, _Pred, _Alloc >, and std::_Hashtable< _Value, _Hash, _Pred, _Alloc >. Detailed Description template<typename _Key, typename _Value, typename _Alloc, typename _ExtractKey, typename _Equal, typename _H1, typename _H2, typename _Hash, typename _RehashPolicy, typename _Traits, bool…

std::__detail::_Hashtable_traits< _Cache_hash_code, _Constant_iterators, _Unique_keys > – Synopsis Public Types template<bool _Cond> using __bool_constant = integral_constant< bool, _Cond > using __constant_iterators = __bool_constant< _Constant_iterators > using __hash_cached = __bool_constant< _Cache_hash_code > using __unique_keys = __bool_constant< _Unique_keys > Detailed Description template<bool _Cache_hash_code, bool _Constant_iterators, bool _Unique_keys>struct std::__detail::_Hashtable_traits< _Cache_hash_code, _Constant_iterators, _Unique_keys > struct _Hashtable_traits Important traits for hash…

std::__detail::_Hashtable_ebo_helper< _Nm, _Tp, __use_ebo > – Synopsis Detailed Description template<int _Nm, typename _Tp, bool __use_ebo = !__is_final(_Tp) && __is_empty(_Tp)>struct std::__detail::_Hashtable_ebo_helper< _Nm, _Tp, __use_ebo > Primary class template _Hashtable_ebo_helper. Helper class using EBO when it is not forbidden, type is not final, and when it worth it, type is empty. Definition at line 831 of file…

std::__detail::_Hashtable_base< _Key, _Value, _ExtractKey, _Equal, _H1, _H2, _Hash, _Traits > – Synopsis Inherits std::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, _Traits::__hash_cached::value >, and std::__detail::_Hashtable_ebo_helper< 0, _Equal >. Inherited by std::_Hashtable< _Key, _Tp, _Hash, _Pred, _Alloc >, std::_Hashtable< _Value, _Hash, _Pred, _Alloc >, and std::_Hashtable< _Key, _Value, _Alloc, _ExtractKey, _Equal, _H1, _H2, _Hash, _RehashPolicy, _Traits >….

std::__detail::_Hash_node_base – Synopsis Inherited by std::__detail::_Hash_node< _Value, false >, and std::__detail::_Hash_node< _Value, true >. Public Member Functions _Hash_node_base (_Hash_node_base *__next) Public Attributes _Hash_node_base * _M_nxt Detailed Description struct _Hash_node_base Nodes, used to wrap elements stored in the hash table. A policy template parameter of class template _Hashtable controls whether nodes also store a hash code….

std::__detail::_Hash_node< _Value, _Cache_hash_code > – Synopsis Detailed Description template<typename _Value, bool _Cache_hash_code>struct std::__detail::_Hash_node< _Value, _Cache_hash_code > Primary template struct _Hash_node. Definition at line 162 of file hashtable_policy.h. Author Generated automatically by Doxygen for libstdc++ from the source code.

std::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache_hash_code > – Synopsis Detailed Description template<typename _Key, typename _Value, typename _ExtractKey, typename _H1, typename _H2, typename _Hash, bool __cache_hash_code>struct std::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache_hash_code > Primary class template _Hash_code_base. Encapsulates two policy issues that aren’t quite orthogonal. (1) the difference between using a ranged…