-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathhashset.c
207 lines (161 loc) · 4.32 KB
/
hashset.c
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
// hashset.c
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "hashset.h"
// Private Structures and types
struct HashSetNode;
struct HashSetNode {
char *String;
struct HashSetNode *Next;
};
typedef struct {
struct HashSetNode *HashSetStart;
struct HashSetNode *HashSetEnd;
} HashSetList;
typedef struct {
unsigned int Signature;
HashSetList *Set;
unsigned int NumEntries;
} HashSet_t;
#define SIGNATURE 0xFAF32000
#define MAX( a, b ) ( ( a ) > ( b ) ? a : b )
void *HashSetCreate( unsigned int NumEntries )
{
HashSet_t *HashSet;
if ( NumEntries != 0 )
{
HashSet = ( HashSet_t * )calloc( sizeof( HashSet_t ), 1 );
if ( HashSet != ( HashSet_t *) 0 )
{
HashSet->Signature = SIGNATURE;
HashSet->NumEntries = NumEntries;
HashSet->Set =
( HashSetList * ) calloc( sizeof( HashSetList ), NumEntries );
return ( void * ) HashSet;
}
}
return ( void * ) 0;
}
unsigned char CreateHash( const char *string )
{
unsigned char hash = 0;
for ( int i = 0 ; i < strlen( string ) ; i++ )
{
hash += string[ i ];
}
return hash;
}
struct HashSetNode *HashSetNodeCreate( const char *string )
{
struct HashSetNode *HashNode;
HashNode = ( struct HashSetNode * )calloc( sizeof( struct HashSetNode ), 1 );
HashNode->String = calloc( strlen( string ), 1 );
strncpy( HashNode->String, string, strlen( string ) );
HashNode->Next = ( struct HashSetNode * ) 0;
return HashNode;
}
void HashSetAdd( void *HashSet, const char *string )
{
if ( HashSet != ( void * ) 0 )
{
HashSet_t *set = ( HashSet_t * ) HashSet;
if ( set->Signature == SIGNATURE )
{
unsigned char hash = CreateHash( string ) % set->NumEntries;
if ( set->Set[ hash ].HashSetStart == ( struct HashSetNode * ) 0 )
{
// List is empty, create a list and node.
set->Set[ hash ].HashSetStart =
set->Set[ hash ].HashSetEnd = HashSetNodeCreate( string );
}
else
{
set->Set[ hash ].HashSetEnd->Next = HashSetNodeCreate( string );
set->Set[ hash ].HashSetEnd = set->Set[ hash ].HashSetEnd->Next;
}
}
}
return;
}
bool HashSetContains( void *HashSet, const char *string )
{
if ( HashSet != ( void * ) 0 )
{
HashSet_t *set = ( HashSet_t * ) HashSet;
if ( set->Signature == SIGNATURE )
{
unsigned char hash = CreateHash( string ) % set->NumEntries;
if ( set->Set[ hash ].HashSetStart == ( struct HashSetNode * ) 0 )
{
return false;
}
else
{
struct HashSetNode *Node = set->Set[ hash ].HashSetStart;
int source_length = strlen( string );
while ( Node != ( struct HashSetNode * ) 0 )
{
int length = MAX( source_length, strlen( Node->String ) );
if ( !strncmp( Node->String, string, length ) )
{
return true;
}
Node = Node->Next;
}
}
}
}
return false;
}
void HashSetPrint( void *HashSet )
{
if ( HashSet != ( void * ) 0 )
{
HashSet_t *set = ( HashSet_t * ) HashSet;
if ( set->Signature == SIGNATURE )
{
for ( int i = 0 ; i < set->NumEntries ; i++ )
{
printf("[ %3d ] ", i );
struct HashSetNode *Node = set->Set[ i ].HashSetStart;
while ( Node != ( struct HashSetNode * ) 0 )
{
printf( "%s ", Node->String );
Node = Node->Next;
}
printf( "\n" );
}
}
}
return;
}
void DestroyEntries( struct HashSetNode *HashNode )
{
struct HashSetNode *Node;
while ( HashNode )
{
free( HashNode->String );
Node = HashNode;
HashNode = HashNode->Next;
free( Node );
}
return;
}
void HashSetDestroy( void *HashSet )
{
if ( HashSet != ( void * ) 0 )
{
HashSet_t *set = ( HashSet_t * ) HashSet;
if ( set->Signature == SIGNATURE )
{
for ( int i = 0 ; i < set->NumEntries ; i++ )
{
DestroyEntries( set->Set[ i ].HashSetStart );
}
free( set->Set );
free( set );
}
}
return;
}