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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
#include "hashset.h"
#include <string.h>
#include "internal.h"
/*
* The HashSet contains an array +elems+ of the elements that have been added.
* It always has +size+ elements so +size+ ane +elems+ can be used to iterate
* over all alements in the HashSet. It also uses a Hash to keep track of
* which elements have been added and their index in the +elems+ array.
*/
static HashSet *hs_alloc(free_ft free_func)
{
HashSet *hs = ALLOC(HashSet);
hs->size = 0;
hs->first = hs->last = NULL;
hs->free_elem_i = free_func ? free_func : &dummy_free;
return hs;
}
HashSet *hs_new(hash_ft hash_func, eq_ft eq_func, free_ft free_func)
{
HashSet *hs = hs_alloc(free_func);
hs->ht = h_new(hash_func, eq_func, NULL, NULL);
return hs;
}
HashSet *hs_new_str(free_ft free_func)
{
HashSet *hs = hs_alloc(free_func);
hs->ht = h_new_str((free_ft) NULL, NULL);
return hs;
}
HashSet *hs_new_ptr(free_ft free_func)
{
HashSet *hs = hs_alloc(free_func);
hs->ht = h_new_ptr(NULL);
return hs;
}
static INLINE void clear(HashSet *hs, bool destroy)
{
HashSetEntry *curr, *next = hs->first;
free_ft do_free = destroy ? hs->free_elem_i : &dummy_free;
while (NULL != (curr = next)) {
next = curr->next;
do_free(curr->elem);
free(curr);
}
hs->first = hs->last = NULL;
hs->size = 0;
}
void hs_clear(HashSet *hs)
{
clear(hs, true);
h_clear(hs->ht);
}
void hs_free(HashSet *hs)
{
clear(hs, false);
h_destroy(hs->ht);
free(hs);
}
void hs_destroy(HashSet *hs)
{
clear(hs, true);
h_destroy(hs->ht);
free(hs);
}
static INLINE void append(HashSet *hs, void *elem)
{
HashSetEntry *entry = ALLOC(HashSetEntry);
entry->elem = elem;
entry->prev = hs->last;
entry->next = NULL;
if (!hs->first) {
hs->first = hs->last = entry;
}
else {
hs->last->next = entry;
hs->last = entry;
}
h_set(hs->ht, elem, entry);
hs->size++;
}
HashKeyStatus hs_add(HashSet *hs, void *elem)
{
HashKeyStatus has_elem = h_has_key(hs->ht, elem);
switch (has_elem)
{
/* We don't want to keep two of the same elem so free if necessary */
case HASH_KEY_EQUAL:
hs->free_elem_i(elem);
return has_elem;
/* No need to do anything */
case HASH_KEY_SAME:
return has_elem;
/* add the elem to the array, resizing if necessary */
case HASH_KEY_DOES_NOT_EXIST:
break;
}
append(hs, elem);
return has_elem;
}
int hs_add_safe(HashSet *hs, void *elem)
{
switch(h_has_key(hs->ht, elem))
{
/* element can't be added */
case HASH_KEY_EQUAL: return false;
/* the exact same element has already been added */
case HASH_KEY_SAME : return true;
/* add the elem to the array, resizing if necessary */
case HASH_KEY_DOES_NOT_EXIST : break;
}
append(hs, elem);
return true;
}
void *hs_rem(HashSet *hs, const void *elem)
{
void *return_elem;
HashSetEntry *entry = (HashSetEntry *)h_get(hs->ht, elem);
if (entry == NULL) return NULL;
if (hs->first == hs->last) {
hs->first = hs->last = NULL;
}
else if (hs->first == entry) {
hs->first = entry->next;
hs->first->prev = NULL;
}
else if (hs->last == entry) {
hs->last = entry->prev;
hs->last->next = NULL;
}
else {
entry->prev->next = entry->next;
entry->next->prev = entry->prev;
}
return_elem = entry->elem;
h_del(hs->ht, return_elem);
free(entry);
hs->size--;
return return_elem;
}
int hs_del(HashSet *hs, const void *elem)
{
void *tmp_elem = hs_rem(hs, elem);
if (tmp_elem != NULL) {
hs->free_elem_i(tmp_elem);
return 1;
}
return 0;
}
HashKeyStatus hs_exists(HashSet *hs, const void *elem)
{
return h_has_key(hs->ht, elem);
}
HashSet *hs_merge(HashSet *hs, HashSet * other)
{
HashSetEntry *entry = other->first;
for (; entry != NULL; entry = entry->next) {
hs_add(hs, entry->elem);
}
/* Now free the other hashset. It is no longer needed. No need, however,
* to delete the elements as they were either destroyed or added to the
* new hashset. */
hs_free(other);
return hs;
}
void *hs_orig(HashSet *hs, const void *elem)
{
HashSetEntry *entry = (HashSetEntry *)h_get(hs->ht, elem);
return entry ? entry->elem : NULL;
}
|
