std::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache_hash_code >

       Generated automatically by Doxygen for libstdc++ from the source code.

libstdc++                                        Tue Jul 1std::__detail::_Hash_c...sh,__cache_hash_code>(3cxx)

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
       hash function and using the combination of a hash function and a range-hashing function. In the former
       case we don't have such things as hash codes, so we have a dummy type as placeholder. (2) Whether or not
       we cache hash codes. Caching hash codes is meaningless if we have a ranged hash function.

       We also put the key extraction objects here, for convenience. Each specialization derives from one or
       more of the template parameters to benefit from Ebo. This is important as this type is inherited in some
       cases by the _Local_iterator_base type used to implement local_iterator and const_local_iterator. As with
       any iterator type we prefer to make it as small as possible.

       Primary template is unused except as a hook for specializations.

       Definition at line 1169 of file hashtable_policy.h.

       std::__detail::_Hash_code_base< _Key, _Value, _ExtractKey, _H1, _H2, _Hash, __cache_hash_code >

       Inherited by std::__detail::_Hashtable_base<_Value,hash<_Value>,allocator<_Value>,_Equal,_H1,_H2,_Hash,_Traits>.