hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats > Class Template Reference

This is a specialization of FastHashBase that turns it into a map. More...

#include <FastHash.h>

Inheritance diagram for hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats >:

List of all members.

Public Member Functions
	FastHashMap ()
	FastHashMap (size_t size_hint)
Value &	operator[] (const Key &k)
Value &	findOrDie (const Key &k)
const Value &	findOrDie (const Key &k) const
pair< typename super::iterator, bool >	insert (const Key &key, const Value &val)
pair< typename super::iterator, bool >	insert (const Key &key)

---

Detailed Description

template<typename Key, typename Value, class hasher = hashers::hash<Key>, bool NeedsDelete = true, bool collectStats = false>
class hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats >

This is a specialization of FastHashBase that turns it into a map.

---

Constructor & Destructor Documentation

template<typename Key, typename Value, class hasher = hashers::hash<Key>, bool NeedsDelete = true, bool collectStats = false> hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats >::FastHashMap (   )  [inline]

template<typename Key, typename Value, class hasher = hashers::hash<Key>, bool NeedsDelete = true, bool collectStats = false> hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats >::FastHashMap (  size_t  size_hint  )  [inline]

---

Member Function Documentation

template<typename Key, typename Value, class hasher = hashers::hash<Key>, bool NeedsDelete = true, bool collectStats = false> const Value& hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats >::findOrDie (  const Key &  k  )  const [inline]

template<typename Key, typename Value, class hasher = hashers::hash<Key>, bool NeedsDelete = true, bool collectStats = false> Value& hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats >::findOrDie (  const Key &  k  )  [inline]

template<typename Key, typename Value, class hasher = hashers::hash<Key>, bool NeedsDelete = true, bool collectStats = false> pair<typename super::iterator,bool> hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats >::insert (  const Key &  key  )  [inline]

insert() the key, with a default-constructed value. Useful for non-copyable values. Reimplemented from hudson::FastHashBase< Key, Value, hasher, NeedsDelete, collectStats >.

template<typename Key, typename Value, class hasher = hashers::hash<Key>, bool NeedsDelete = true, bool collectStats = false> pair<typename super::iterator,bool> hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats >::insert (  const Key &  key, const Value &  val )  [inline]

insert() the key and value.

template<typename Key, typename Value, class hasher = hashers::hash<Key>, bool NeedsDelete = true, bool collectStats = false> Value& hudson::FastHashMap< Key, Value, hasher, NeedsDelete, collectStats >::operator[] (  const Key &  k  )  [inline]

Find-or-insert k, and allow writing to the entry.

---

The documentation for this class was generated from the following file:

• utilities/FastHash.h

---