-
Notifications
You must be signed in to change notification settings - Fork 0
/
Dictionary.c
75 lines (65 loc) · 1.85 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
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "Dictionary.h"
#define MAX_WORDS 100000
#define MAX_WORD_LENGTH 128
struct Dictionary
{
size_t size;
char * * words;
};
dictionary * read_in_dictionary(char * path){
FILE * dictionary_file = fopen(path, "r");
if(dictionary_file == NULL){
perror("dictionary");
exit(EXIT_FAILURE);
}
// finding out how long word array will be
size_t num_lines = 0;
while(!feof(dictionary_file))
{
char ch = fgetc(dictionary_file);
if(ch == '\n')
{
num_lines++;
}
}
rewind(dictionary_file);
size_t max_word_size = MAX_WORD_LENGTH * sizeof(char);
char * * words = calloc(num_lines, max_word_size);
for(int i = 0; i < num_lines; i++){
getline(&words[i], &max_word_size, dictionary_file);
words[i][strlen(words[i])-1] = '\0';
}
dictionary * dictionaryPtr = malloc(sizeof(dictionary));
dictionaryPtr -> size = num_lines;
dictionaryPtr -> words = words;
return(dictionaryPtr);
}
bool binarySearch(dictionary * dictionaryPtr, int l, int r, char * word){
if (r>=l){
int mid = l + (r-l)/2;
if (strcasecmp(dictionaryPtr -> words[mid], word) == 0){
return(true);
}
else if (strcasecmp(dictionaryPtr -> words[mid], word) > 0){
return binarySearch(dictionaryPtr, l, mid-1, word);
}
else{
return(binarySearch(dictionaryPtr, mid+1, r, word));
}
}
return false;
}
bool searchDictionary(dictionary * dictionaryPtr, char * word){
printf("checking dictionary\n");
int i = 0;
int k = dictionaryPtr -> size - 1;
return binarySearch(dictionaryPtr, i, k, word);
}
void freeDictionary(dictionary * dictionaryPtr){
free(dictionaryPtr->words);
free(dictionaryPtr);
return;
}