-
Notifications
You must be signed in to change notification settings - Fork 0
/
dictionary.c
239 lines (177 loc) · 4.19 KB
/
dictionary.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
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
/**
* Implements a dictionary's functionality.
*/
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <ctype.h>
#include "dictionary.h"
typedef struct NODE
{
bool isword;
struct NODE* arrayofpointers[27];
}
NODE;
NODE *r;
int twords;
/**
* Char -> Boolean
* Converts a letter/apostrophe into a number between 0 and 26
*/
short uplow(char x)
{
short xx = (short)x;
if (xx >= 97)
{
xx = xx - 96;
}
else if (xx >= 65)
{
xx = xx - 64;
}
else
{
xx = 0;
}
return xx;
}
/**
* Array of characters -> Boolean
* Returns true if word is in dictionary else false.
*/
bool check(const char *word)
{
NODE *nextnode = malloc(sizeof(NODE));
*nextnode= *r;
int lettercount = 0;
int actual = 0;
for(int i = 0; word[i] != '\0'; i++)
{
actual++;
}
for(int i = 0; word[i] != '\0'; i++)
{
if (nextnode->arrayofpointers[uplow(word[i])] != NULL)
{
nextnode = nextnode->arrayofpointers[uplow(word[i])];
}
else
{
break;
}
lettercount++;
}
if (nextnode->isword == true & actual == lettercount)
{
return true;
}
else
{
return false;
}
}
/**
* Textfile -> Trie
* Loads dictionary into memory. Returns true if successful else false.
* (check-expect load()
*/
bool load(const char *dictionary)
{
// TODO
FILE *inptr = fopen(dictionary, "r");
int index = 0, words = 0;
//NODE root;33
r = malloc(sizeof(NODE));
r->isword = false;
NODE *curnode = r;
NODE *nxtnode;
char word[LENGTH+1];
if (ferror(inptr))
{
fclose(inptr);
printf("Error reading %s.\n", dictionary);
return false;
}
// spell-check each word in text
for (int c = fgetc(inptr); c != EOF; c = fgetc(inptr))
{
// allow only alphabetical characters and apostrophes
if (isalpha(c) || (c == '\'' && index > 0))
{
nxtnode = curnode->arrayofpointers[uplow(c)];
if (nxtnode == NULL)
{
NODE *node = malloc(sizeof(NODE));
curnode->arrayofpointers[uplow(c)] = node;
nxtnode = node;
}
curnode = nxtnode;
word[index] = c;
index++;
// ignore alphabetical strings too long to be words
if (index > LENGTH)
{
// consume remainder of alphabetical string
while ((c = fgetc(inptr)) != EOF && isalpha(c));
// prepare for new word
index = 0;
}
}
// ignore words with numbers (like MS Word can)
else if (isdigit(c))
{
// consume remainder of alphanumeric string
while ((c = fgetc(inptr)) != EOF && isalnum(c));
// prepare for new word
index = 0;
}
// we must have found a whole word
else if (index > 0)
{
// terminate current word
word[index] = '\0';
// update counter
words++;
// prepare for next word
index = 0;
curnode->isword = true;
//printf("%d \n", curnode->isword);
curnode = r;
twords++;
//free(r);
}
}
fclose(inptr);
return true;
}
/**
* Returns number of words in dictionary if loaded else 0 if not yet loaded.
*/
unsigned int size(void)
{
return twords;
}
/**
* Unloads dictionary from memory. Returns true if successful else false.
*/
void unloadHelper(NODE* root)
{
for (int x = 0; x < 26; x++)
{
NODE* curr;
curr = root->arrayofpointers[x];
if(curr != NULL)
{
unloadHelper(curr);
}
}
free(root);
}
bool unload(void)
{
unloadHelper(r);
//return false;
free(r);
return true;
}