forked from graphitemaster/neothyne
-
Notifications
You must be signed in to change notification settings - Fork 0
/
u_set.h
162 lines (129 loc) · 3.32 KB
/
u_set.h
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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
#ifndef U_SET_HDR
#define U_SET_HDR
#include "u_hash.h"
#include "u_buffer.h"
#include "u_pair.h"
namespace u {
template <typename K>
struct set {
set();
set(const set &other);
set(set &&other);
~set();
set &operator=(const set &other);
set &operator=(set &&other);
typedef hash_iterator<const hash_elem<K, void>> const_iterator;
typedef const_iterator iterator;
iterator begin() const;
iterator end() const;
void clear();
bool empty() const;
size_t size() const;
iterator find(const K &key) const;
pair<iterator, bool> insert(const K &key);
void erase(iterator where);
size_t erase(const K &key);
void swap(set &other);
private:
detail::hash_base<hash_elem<K, void>> m_base;
};
template <typename K>
set<K>::set()
: m_base(9)
{
}
template <typename K>
set<K>::set(const set<K> &other)
: m_base(other.m_base)
{
}
template <typename K>
set<K>::set(set<K> &&other)
: m_base(u::move(other.m_base))
{
}
template <typename K>
set<K>::~set() {
detail::hash_free(m_base);
}
template <typename K>
set<K> &set<K>::operator=(const set<K> &other) {
set<K>(other).swap(*this);
return *this;
}
template <typename K>
set<K> &set<K>::operator=(set<K> &&other) {
using base = detail::hash_base<hash_elem<K, void>>;
if (this == &other) assert(0);
detail::hash_free(m_base);
m_base.~base();
new (&m_base) base(u::move(other));
return *this;
}
template <typename K>
inline typename set<K>::iterator set<K>::begin() const {
iterator it;
it.node = *m_base.buckets.first;
return it;
}
template <typename K>
inline typename set<K>::iterator set<K>::end() const {
iterator it;
it.node = nullptr;
return it;
}
template <typename K>
inline bool set<K>::empty() const {
return m_base.size == 0;
}
template <typename K>
inline size_t set<K>::size() const {
return m_base.size;
}
template <typename K>
inline void set<K>::clear() {
using base = detail::hash_base<hash_elem<K, void>>;
m_base.~base();
new (&m_base) base(9);
}
template <typename K>
inline typename set<K>::iterator set<K>::find(const K &key) const {
iterator result;
result.node = detail::hash_find(m_base, key);
return result;
}
template <typename K>
inline pair<typename set<K>::iterator, bool> set<K>::insert(const K &key) {
auto result = make_pair(find(key), false);
if (result.first().node != 0)
return result;
size_t nbuckets = (m_base.buckets.last - m_base.buckets.first);
if ((m_base.size + 1) / nbuckets > 0.75f) {
detail::hash_rehash(m_base, 8 * nbuckets);
nbuckets = (m_base.buckets.last - m_base.buckets.first);
}
size_t hh = hash(key) & (nbuckets - 2);
typename set<K>::iterator &it = result.first();
it.node = detail::hash_insert_new(m_base, hh);
it.node->first.~hash_elem<K, void>();
new ((void *)&it.node->first) hash_elem<K, void>(key);
result.second() = true;
return result;
}
template <typename K>
inline void set<K>::erase(iterator where) {
detail::hash_erase(m_base, where.node);
}
template <typename K>
inline size_t set<K>::erase(const K &key) {
const_iterator it = find(key);
if (!it.node) return 0;
erase(it);
return 1;
}
template <typename K>
void set<K>::swap(set &other) {
detail::hash_swap(m_base, other.m_base);
}
}
#endif