-
Notifications
You must be signed in to change notification settings - Fork 0
/
countWord.c
157 lines (139 loc) · 3.33 KB
/
countWord.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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include "hashTable.h"
#include "getWord.h"
#include "crc64.h"
wordPair* array = NULL;
int pos =0;
int printFlag=-1;
void print(wordPair* array){
int nbrLine =0;
if(printFlag != -1)
nbrLine = printFlag;
else
nbrLine = pos;
for(int i = 0; i < nbrLine; i++){
if(nbrLine <= pos){
printf("%10d %s\n",*((int*)array[i].val), array[i].key);
}
else{
printf("Number of line resquested to print is greather than array size\n");
break;
}
}
}
void makeArray(char* k, void* v){
if(k != NULL && v != NULL){
array[pos].key = k;
array[pos].val = v;
pos++;
}
}
void freeWordPair(char* k, void* v){
free(k);
free(v);
}
int cmpfunc(const void* pair1, const void* pair2){
wordPair* arg1 = (wordPair*)pair1;
wordPair* arg2 = (wordPair*)pair2;
int x = *((int*)(arg1->val));
int y = *((int*)(arg2->val));
if(x < y) return 1;
else if(x > y) return -1;
else return 0;
}
void readWordPair(ht* hash_table, char* fname){
FILE* fp;
fp = fopen(fname, "r");
char* word;
char* prev;
char* curr;
char* pair;
int flag = 1;
int nbrWord =0; // this variable is to check if there is at least two word
while((word = getNextWord(fp))!= NULL){
if(flag == 1){
prev = (char*)malloc(sizeof(char)*(strlen(word)+1));
strcpy(prev, word);
flag++;
nbrWord++;
}
else if(flag != 1){
curr = (char*)malloc(sizeof(char)*(strlen(word)+1));
strcpy(curr, word);
pair = (char*)malloc(sizeof(char)*(strlen(prev) + strlen(curr) + 2));
strcpy(pair, prev);
strcat(pair, "-");
strcat(pair, curr);
int* val = NULL;
val =(int*) htSearch(hash_table, pair);
if(val != NULL){
(*val)++;
free(pair);
}
else if(val == NULL){
val = (int*)malloc(sizeof(int));
*val = 1;
htInsert(hash_table, pair, val);
}
free(prev);
prev = (char*)malloc(sizeof(char)*(strlen(curr)+1));
strcpy(prev, curr);
free(curr);
nbrWord++;
}
free(word);
}
free(prev);
fclose(fp);
if(nbrWord <= 1){
printf("No word pair found within the given file!!\n");
printf("-.-.-.-.-.-.-.-.-.--.-.-.-.-.-.-.-.-.-.-.-.-.\n");
}
return;
}
int main(int argc, char** argv){
ht* hash_table = htCreat(123);
if(argc >= 2){
char* str = argv[1];
if(strchr(str, '-')){
char* flag = (char*) malloc(sizeof(char) * strlen(str));
strcpy(flag,&str[1]);
printFlag = atoi(flag);
free(flag);
printf("Number of line to print: %d\n", printFlag);
if(argc == 2){
printf("!! No file path/name provided !!\n");
return 0;
}
for(int i=2; i<argc; i++){
readWordPair(hash_table, argv[i]);
}
}
else{
for(int i=1; i<argc; i++){
readWordPair(hash_table, argv[i]);
}
}
}
else{
printf("too few argument !!! ./run -(integer) filename filename ...\n");
}
array = (wordPair*) malloc(sizeof(wordPair) * hash_table->numberEntries);
for(int i=0; i<hash_table->numberEntries; i++){
array[i].key = NULL;
array[i].val = NULL;
array[i].next = NULL;
}
htApply(hash_table, makeArray);
printf("size: %d\n", hash_table->size);
printf("number of entries: %d\n", hash_table->numberEntries);
printf("---------------------------------------\n\n");
qsort(array, pos, sizeof(wordPair), cmpfunc);
print(array);
htDelete(hash_table, freeWordPair);
free(array);
return 0;
}