m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::entry_type Struct Reference

Collaboration diagram for m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::entry_type:

Data Fields
uint32_t	probe_length = 0
	Counts the length of the probe sequence.
value_type	value
	The value stored in this entry.

Detailed Description

template<typename Key, typename Value, typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>>
struct m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::entry_type

Definition at line 46 of file RefCountingHashMap.hpp.

Field Documentation

probe_length

template<typename Key , typename Value , typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>>

uint32_t m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::entry_type::probe_length = 0

Counts the length of the probe sequence.

Definition at line 49 of file RefCountingHashMap.hpp.

Referenced by m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::find(), m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::insert_with_duplicates(), and m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::insert_without_duplicates().

value

template<typename Key , typename Value , typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>>

value_type m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::entry_type::value

The value stored in this entry.

Definition at line 51 of file RefCountingHashMap.hpp.

Referenced by m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::find(), m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::insert_with_duplicates(), and m::RefCountingHashMap< Key, Value, Hash, KeyEqual >::insert_without_duplicates().

---

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

• src/util/container/RefCountingHashMap.hpp