-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathset.h
334 lines (318 loc) · 13.8 KB
/
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
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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
/*
Suhas Kashyap 01FB14ECS255
Varun Bharadwaj 01FB14ECS278
Varun M 01FB14ECS280
*/
#ifndef set_h
#define set_h
#include <stdlib.h>
#include <string.h>
#define Set_declare(type) \
\
/* structure for each value/node */ \
typedef struct set_node_##type \
{ \
type value; \
struct set_node_##type* next; \
} set_node_##type; \
\
/* set structure holding references to required functions and the Pair array/hashset */ \
typedef struct set_##type \
{ \
Setnode(type)* parray; /* Pair(type1,type2) array */ \
long size; \
long num_elements; \
void (*dslib_insert)(struct set_##type* ,type); \
int (*dslib_search)(struct set_##type* , type); \
int (*dslib_remove)(struct set_##type* , type); \
void (*dslib_free_ds)(struct set_##type*); \
type* (*get_value_arr)(struct set_##type*); \
struct set_##type* (*set_union)(struct set_##type*,struct set_##type*); \
struct set_##type* (*set_intersection)(struct set_##type*, struct set_##type*); \
struct set_##type* (*set_duplicate)(struct set_##type*); \
} set_##type; \
\
/* Function Prototype */ \
Set(type) Set_create_##type(long); \
\
/* fn is a comparator function , insert_value function inserts a value in a linked list */ \
void insert_value_##type( Set(type) d, Setnode(type) node, type value, int (*fn)(type,type) ) \
{ \
if(node->next == NULL) \
{ \
Setnode(type) p = (Setnode(type)) malloc( sizeof(set_node_##type) ); \
p->next = NULL; \
p->value = value; \
node->next = p; \
d->num_elements = d->num_elements + 1; \
} \
else \
{ \
Setnode(type) ref = node->next; \
while( fn(ref->value,value)!=0 && ref->next != NULL) \
{ \
ref = ref->next; \
} \
\
if(fn(ref->value,value)!=0) \
{ \
Setnode(type) pair = (Setnode(type)) malloc( sizeof(set_node_##type) ) ; \
pair -> value = value; \
pair -> next = NULL; \
ref->next = pair; /* new value added */ \
d->num_elements = d->num_elements + 1; \
} \
} \
} \
/* delete value , returns 1 if successful , 0 otherwise */ \
int remove_value_##type( Set(type) d, Setnode(type) node, type value, int (*fn)(type,type) ) \
{ \
if(node->next == NULL) \
{ \
return 0; \
} \
else \
{ \
Setnode(type) p = node->next; \
Setnode(type) q = node; \
while( p != NULL && fn(p->value,value)!=0 ) \
{ \
q = p; \
p = p->next; \
} \
\
if(p == NULL) \
{ \
return 0; \
} \
else \
{ \
q->next = p->next; \
free(p); \
d->num_elements = d->num_elements - 1; \
return 1; \
} \
} \
} \
\
\
\
/* returns 1 if value is found , 0 otherwise */ \
int set_search_##type( Set(type) set, type value) \
{ \
long hash_value = Hash(type,value,set->size); \
Setnode(type) p = (set->parray)[hash_value]; \
int (*fn)(type,type) = getcmp(type); \
\
if(p->next != NULL) \
{ \
p = p->next; \
while( p != NULL && fn(p->value,value)!=0) \
{ \
p = p->next; \
} \
if(p == NULL) \
return 0; \
else \
return 1; \
} \
else \
return 0; \
} \
\
/*insert value*/ \
void set_insert_##type( Set(type) set, type value) \
{ \
long hash_value = Hash(type,value,set->size); \
Setnode(type)* parray = set->parray; \
\
insert_value_##type(set,parray[hash_value],value,getcmp(type)); \
} \
\
/*deletes the value*/ \
int remove_##type( Set(type) set, type value) \
{ \
long hash_value = Hash(type,value,set->size); \
Setnode(type)* parray = set->parray; \
\
return remove_value_##type(set,parray[hash_value],value,getcmp(type)); \
} \
\
/* free allocated memory */ \
void set_destroy_##type(Set(type) d) \
{ \
Setnode(type)* x = d->parray; \
Setnode(type) p; \
Setnode(type) q; \
\
long i; \
for(i=0;i<d->size;i++) \
{ \
p = x[i]; \
while(p != NULL) \
{ \
q = p->next; \
free(p); \
p = q; \
} \
} \
free(x); \
} \
\
\
\
type* get_value_arr_##type(Set(type) set) \
{ \
type* arr = (type*) malloc((set->num_elements) * sizeof(type)); \
Setnode(type)* x = set->parray; \
Setnode(type) p; \
long i,j=0; \
for(i=0;i<set->size;i++) \
{ \
p = x[i]->next; \
while(p != NULL) \
{ \
arr[j++] = p->value; \
p = p->next; \
} \
} \
return arr; \
} \
\
Set(type) intersection_##type(Set(type) s1, Set(type) s2) \
{ \
long newsize = s1->size; \
if (s2->size < newsize) \
newsize = s2->size; \
Set(type) res = new_Set(type,newsize); \
\
Setnode(type)* x = s1->parray; \
Setnode(type) p; \
long i,j=0; \
for(i=0;i<s1->size;i++) \
{ \
p = x[i]->next; \
while(p != NULL) \
{ \
if(find(s2,p->value)) \
add(res,p->value); \
p = p->next; \
} \
} \
\
x = s2->parray; \
j=0; \
for(i=0;i<s2->size;i++) \
{ \
p = x[i]->next; \
while(p != NULL) \
{ \
if(find(s1,p->value)) \
add(res,p->value); \
p = p->next; \
} \
} \
\
return res; \
} \
\
Set(type) union_##type(Set(type) s1, Set(type) s2) \
{ \
long newsize = s1->size; \
if (s2->size > newsize) \
newsize = s2->size; \
Set(type) res = new_Set(type,newsize); \
\
Setnode(type)* x = s1->parray; \
Setnode(type) p; \
long i,j=0; \
for(i=0;i<s1->size;i++) \
{ \
p = x[i]->next; \
while(p != NULL) \
{ \
add(res,p->value); \
p = p->next; \
} \
} \
\
x = s2->parray; \
j=0; \
for(i=0;i<s2->size;i++) \
{ \
p = x[i]->next; \
while(p != NULL) \
{ \
add(res,p->value); \
p = p->next; \
} \
} \
\
return res; \
} \
\
Set(type) duplicate_##type(Set(type) s) \
{ \
Set(type) res = new_Set(type,s->size); \
Setnode(type)* x = s->parray; \
Setnode(type) p; \
Setnode(type) q; \
\
long i; \
for(i=0;i<s->size;i++) \
{ \
p = x[i]->next; \
while(p != NULL) \
{ \
add(res,p->value); \
p = p->next; \
} \
} \
return res; \
} \
\
/* creates and returns array/hashset of size 'size' */ \
Set(type) Set_create_##type(long size) \
{ \
Setnode(type)* val_array = (Setnode(type)*) malloc(size * sizeof(Setnode(type))); \
/* create pair header node for each element of dict */ \
long i; \
for(i=0;i<size;i++) \
{ \
val_array[i] = (Setnode(type)) malloc( sizeof(set_node_##type) ); \
(val_array[i]) -> next = NULL; \
} \
\
Set(type) set = (Set(type)) malloc( sizeof(set_##type) ); \
set->parray = val_array; \
set->size = size; \
set->num_elements = 0; \
set->dslib_insert = set_insert_##type; \
set->dslib_search = set_search_##type; \
set->dslib_remove = remove_##type; \
set->dslib_free_ds = set_destroy_##type; \
set->get_value_arr = get_value_arr_##type; \
set->set_union = union_##type; \
set->set_intersection = intersection_##type; \
set->set_duplicate = duplicate_##type; \
return set; \
} \
// get correct comparator function
#define getcmp(type) \
cmp_##type
/* call the correct function pointed to by the function pointer in the set structure */
#define union(set1,set2) \
(set1->set_union)(set1,set2)
#define intersection(set1,set2) \
(set1->set_intersection)(set1,set2)
#define duplicate(set) \
(set->set_duplicate)(set)
#define getSetValues(set) \
(set->get_value_arr)(set)
#define new_Set(type,size) \
Set_create_##type(size)
#define Setnode(type) \
set_node_##type*
#define Set(type) \
set_##type*
#endif