#include <hash.h>
◆ iterator
template<class TKey , class TValue >
◆ key_t
template<class TKey , class TValue >
◆ value_t
template<class TKey , class TValue >
◆ Hash() [1/2]
template<class TKey , class TValue >
◆ Hash() [2/2]
template<class TKey , class TValue >
◆ begin()
template<class TKey , class TValue >
◆ capacity()
template<class TKey , class TValue >
size_t ug::Hash< TKey, TValue >::capacity |
returns the capacity of the container in which key-value-pairs are stored.
Use reserve to adjust this capacity. If the capacity would be too small to insert a new element, it will be automatically increased on element insertion.
- See also
- reserve
◆ clear()
template<class TKey , class TValue >
◆ empty()
template<class TKey , class TValue >
◆ end()
template<class TKey , class TValue >
◆ erase()
template<class TKey , class TValue >
◆ find_entry()
template<class TKey , class TValue >
size_t ug::Hash< TKey, TValue >::find_entry |
( |
const key_t & |
key | ) |
const |
|
private |
◆ get_entry() [1/3]
template<class TKey , class TValue >
TValue & ug::Hash< TKey, TValue >::get_entry |
( |
const key_t & |
key | ) |
|
◆ get_entry() [2/3]
template<class TKey , class TValue >
const TValue & ug::Hash< TKey, TValue >::get_entry |
( |
const key_t & |
key | ) |
const |
◆ get_entry() [3/3]
template<class TKey , class TValue >
◆ has_entry()
template<class TKey , class TValue >
bool ug::Hash< TKey, TValue >::has_entry |
( |
const key_t & |
key | ) |
const |
◆ hash_index()
template<class TKey , class TValue >
size_t ug::Hash< TKey, TValue >::hash_index |
( |
const key_t & |
key | ) |
const |
|
private |
◆ hash_size()
template<class TKey , class TValue >
size_t ug::Hash< TKey, TValue >::hash_size |
◆ insert()
template<class TKey , class TValue >
◆ invalid_index()
template<class TKey , class TValue >
size_t ug::Hash< TKey, TValue >::invalid_index |
( |
| ) |
const |
|
inlineprivate |
◆ reserve()
template<class TKey , class TValue >
void ug::Hash< TKey, TValue >::reserve |
( |
size_t |
size | ) |
|
◆ resize_hash()
template<class TKey , class TValue >
void ug::Hash< TKey, TValue >::resize_hash |
( |
size_t |
size | ) |
|
◆ size()
template<class TKey , class TValue >
size_t ug::Hash< TKey, TValue >::size |
( |
| ) |
const |
returns the number of key-value-pairs currently stored in the hash
◆ m_entries
template<class TKey , class TValue >
◆ m_firstUnusedEntry
template<class TKey , class TValue >
size_t ug::Hash< TKey, TValue >::m_firstUnusedEntry |
|
private |
◆ m_hashList
template<class TKey , class TValue >
std::vector<std::pair<size_t, size_t> > ug::Hash< TKey, TValue >::m_hashList |
|
private |
each entry holds a pair of indices pointing to the first and the last entry for the given hash-key.
◆ m_numEntries
template<class TKey , class TValue >
size_t ug::Hash< TKey, TValue >::m_numEntries |
|
private |
The documentation for this class was generated from the following files: