1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "hashtable.h"
#include "hash_fun.h"
#include "identity.h"
#include <initializer_list>
namespace vespalib {
template< typename K, typename H = vespalib::hash<K>, typename EQ = std::equal_to<>, typename M=hashtable_base::and_modulator>
class hash_set
{
private:
using HashTable = hashtable< K, K, H, EQ, Identity, M>;
HashTable _ht;
public:
using iterator = typename HashTable::iterator;
using const_iterator = typename HashTable::const_iterator;
using insert_result = typename HashTable::insert_result;
public:
hash_set(hash_set &&) noexcept = default;
hash_set & operator = (hash_set &&) noexcept = default;
hash_set(const hash_set &) = default;
hash_set & operator = (const hash_set &) = default;
hash_set();
explicit hash_set(size_t reserveSize);
hash_set(size_t reserveSize, const H & hasher, const EQ & equal);
template <typename InputIterator>
hash_set(InputIterator first, InputIterator last);
hash_set(std::initializer_list<K> input);
~hash_set();
iterator begin() { return _ht.begin(); }
iterator end() { return _ht.end(); }
const_iterator begin() const { return _ht.begin(); }
const_iterator end() const { return _ht.end(); }
size_t capacity() const { return _ht.capacity(); }
size_t size() const { return _ht.size(); }
bool empty() const { return _ht.empty(); }
insert_result insert(const K & value);
insert_result insert(K &&value);
template<typename InputIt>
void insert(InputIt first, InputIt last);
void erase(const K & key);
size_t count(const K & key) const { return _ht.find(key) != end() ? 1 : 0; }
bool contains(const K & key) const { return _ht.find(key) != end(); }
iterator find(const K & key) { return _ht.find(key); }
const_iterator find(const K & key) const { return _ht.find(key); }
/// This gives faster iteration than can be achieved by the iterators.
template <typename Func>
void for_each(Func func) const { _ht.for_each(func); }
template< typename AltKey >
const_iterator find(const AltKey & key) const { return _ht.template find<AltKey>(key); }
template< typename AltKey>
iterator find(const AltKey & key) { return _ht.template find<AltKey>(key); }
void clear();
void resize(size_t newSize);
void swap(hash_set & rhs);
bool operator==(const hash_set &rhs) const;
/**
* Get an approximate number of memory consumed by hash set. Not including
* any data K would store outside of sizeof(K) of course.
*/
size_t getMemoryConsumption() const;
};
template< typename K, typename H, typename EQ, typename M >
void swap(hash_set<K, H, EQ, M> & a, hash_set<K, H, EQ, M> & b)
{
a.swap(b);
}
}
|
