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
|
#ifndef __SET_H__
#define __SET_H__
#include <stdlib.h>
#include "hashtable.h"
/**
* implementation of a set based on a hashtable implementation
*
**/
typedef struct hashtable set_t;
void set_init(set_t *set)
{
ht_init_sha1(set);
}
void set_insert(set_t *set, void *data, unsigned int data_length)
{
ht_add(set, data, data_length, data, data_length);
}
unsigned int set_is_in_set(set_t *set, void *data, unsigned int data_length)
{
if(ht_get(set, data, data_length) == NULL)
return 0;
else
return 1;
}
void set_delete(set_t *set, void *data, unsigned int data_length)
{
ht_delete(set, data, data_length);
}
#define SET_FOR_EACH
#endif
|
