SG::unordered_multimap< Key, T, Hash, Pred, Alloc, cache_hash_code > Class Template Reference

Inheritance diagram for SG::unordered_multimap< Key, T, Hash, Pred, Alloc, cache_hash_code >:
SG::hashtable< Key, std::pair< const Key, T >, Alloc, Internal::extract1st< std::pair< const Key, T > >, Pred, Hash, Internal::mod_range_hashing, Internal::default_ranged_hash, Internal::prime_rehash_policy, cache_hash_code, false, false > rehash_base hash_code_base map_base

List of all members.

Public Types

typedef Base::size_type size_type
typedef Base::hasher hasher
typedef Base::key_equal key_equal
typedef Base::allocator_type allocator_type

Public Member Functions

 unordered_multimap (size_type n=10, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type())
template<typename InputIterator >
 unordered_multimap (InputIterator f, InputIterator l, typename Base::size_type n=0, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type())

template<class Key, class T, class Hash = hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<const Key, T> >, bool cache_hash_code = false>
class SG::unordered_multimap< Key, T, Hash, Pred, Alloc, cache_hash_code >


The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines

Generated on 1 Dec 2017 for RootCore Packages by  doxygen 1.6.1