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
|
#include "hashtable.h"
#include "set.h"
int main()
{
int i;
struct hashtable ht;
char *msg = malloc(100);
memcpy(msg, "Hallo dies ist meine Message\n", 20);
char *key = malloc(20);
ht_init_sha1(&ht);
key[1] = '\n';
for(i=0;i<156;i++) {
key[0] = i;
msg[0] = i;
ht_add(&ht, msg, strlen(msg), key, strlen(key));
}
ht_delete(&ht, key, strlen(key));
char *ret = ht_get(&ht, key, strlen(key));
if(ret != NULL)
printf("uuh das sollte eigtl nicht mehr da sein\n");
key[0] = 'a' + 3;
ret = ht_get(&ht, key, strlen(key));
if(ret == NULL)
printf("did not found data\n");
printf("message is: %s\n", msg);
printf("got data from ht: %s\n", ret);
set_t t;
set_init(&t);
set_insert(&t, msg, strlen(msg));
if(set_is_in_set(&t, msg, strlen(msg)) == 1)
printf("im set, alles gut\n");
set_delete(&t, msg, strlen(msg));
if(set_is_in_set(&t, msg, strlen(msg)) == 0)
printf("nicht merg im set, alles gut\n");
}
|
