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
|
/*
* Ouroboros - Copyright (C) 2016 - 2017
*
* Test of the hash table
*
* Dimitri Staessens <dimitri.staessens@ugent.be>
* Sander Vrijders <sander.vrijders@ugent.be>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "hashtable.c"
#include <stdio.h>
#define HASHTABLE_SIZE 256
#define INT_TEST 4
int hashtable_test(int argc, char ** argv)
{
struct htable * table;
int i;
int * j;
(void) argc;
(void) argv;
table = htable_create(HASHTABLE_SIZE, true);
if (table == NULL) {
printf("Failed to create.\n");
return -1;
}
if (htable_destroy(table)) {
printf("Failed to destroy.\n");
return -1;
}
table = htable_create(HASHTABLE_SIZE, false);
if (table == NULL) {
printf("Failed to create.\n");
return -1;
}
for (i = 0; i < HASHTABLE_SIZE + INT_TEST + 2; i++) {
j = malloc(sizeof(*j));
if (j == NULL) {
printf("Failed to malloc.\n");
htable_destroy(table);
return -1;
}
*j = i;
if (htable_insert(table, i, (void *) j)) {
printf("Failed to insert.\n");
htable_destroy(table);
return -1;
}
}
j = (int *) htable_lookup(table, INT_TEST);
if (j == NULL) {
printf("Failed to lookup.\n");
htable_destroy(table);
return -1;
}
if (*j != INT_TEST) {
printf("Lookup returned wrong value (%d != %d).\n",
INT_TEST, *j);
htable_destroy(table);
return -1;
}
j = (int *) htable_lookup(table, HASHTABLE_SIZE + INT_TEST);
if (j == NULL) {
printf("Failed to lookup.\n");
htable_destroy(table);
return -1;
}
if (*j != HASHTABLE_SIZE + INT_TEST) {
printf("Lookup returned wrong value (%d != %d).\n",
INT_TEST, *j);
htable_destroy(table);
return -1;
}
if (htable_delete(table, INT_TEST)) {
printf("Failed to delete.\n");
htable_destroy(table);
return -1;
}
j = (int *) htable_lookup(table, INT_TEST);
if (j != NULL) {
printf("Failed to delete properly.\n");
htable_destroy(table);
return -1;
}
j = (int *) htable_lookup(table, HASHTABLE_SIZE + INT_TEST);
if (j == NULL) {
printf("Failed to lookup after deletion.\n");
htable_destroy(table);
return -1;
}
if (*j != HASHTABLE_SIZE + INT_TEST) {
printf("Lookup returned wrong value (%d != %d).\n",
INT_TEST, *j);
htable_destroy(table);
return -1;
}
if (htable_destroy(table)) {
printf("Failed to destroy.\n");
return -1;
}
return 0;
}
|
