Template Class DLeftHashTable

Defined in File UniversalHashing.h

Nested Relationships

Nested Types

Class DLeftHashTable::const_iterator

Class Documentation

template<class K, class V, class H = std::hash<K>> class DLeftHashTable

a DICTIONARY on d tables of lists, a key in the shortest of its d lists

Public Types

using Key = K : the type of the keys

using Value = V : the type of the values

using value_type = std::pair<const K&, const V&>

using size_type = std::size_t

using difference_type = std::ptrdiff_t

using reference = value_type 

using const_reference = value_type 

using iterator = const_iterator 

Public Functions

DLeftHashTable(std::size_t m, int d, std::uint64_t seed = 1, H h = H())

d tables of w lists each, w = max( 1 , m / d )

Pre:: m >= 1 and d >= 1

std::optional<V> lookup(const K &k) const

void insert(const K &k, const V &v)

Post:: k has the value v

void remove(const K &k)

Post:: k is not there

bool contains(const K &k) const

std::size_t size(void) const

std::size_t maxLoad(void) const: the length of the longest list

int tables(void) const: the number of tables

inline const_iterator begin(void) const

inline const_iterator end(void) const

inline const_iterator cbegin(void) const

inline const_iterator cend(void) const

class const_iterator

Public Types

using reference = std::pair<const K&, const V&>

using value_type = reference 

using difference_type = std::ptrdiff_t

using iterator_concept = std::forward_iterator_tag

using iterator_category = std::input_iterator_tag

Public Functions

const_iterator(void) = default

inline const_iterator(const std::vector<Bucket> *T, std::size_t b)

inline reference operator*(void) const

inline const_iterator &operator++(void)

inline const_iterator operator++(int)

inline bool operator==(const const_iterator &o) const