-
Notifications
You must be signed in to change notification settings - Fork 0
/
autocomplete.c
91 lines (84 loc) · 2.45 KB
/
autocomplete.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
//Main file
#include "autocomplete.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int cmp1(const void *term_1, const void *term_2){
return strcmp(((term*)term_1)->term, ((term*)term_2)->term);
}
int cmp2(const void *term_1, const void *term_2){
if((((term*)term_2)->weight - ((term*)term_1)->weight) > 0){
return 1;
}
else if((((term*)term_2)->weight - ((term*)term_1)->weight) < 0){
return -1;
}
else{
return 0;
}
}
void read_in_terms(term **terms, int *pnterms, char *filename){
*pnterms = 0; int n; char src[399];
FILE *fp = fopen(filename, "r");
fgets(src, 399, fp);
n = atoi(src);
*terms = (term *)malloc(n * sizeof(term));
while (*pnterms < n){
fgets(src, 399, fp);
char *holder_1 = strtok(src, "\t");
(*terms)[*pnterms].weight = atof(holder_1);
char *holder_2 = strtok('\0', "\n");
strcpy((*terms)[(*pnterms)++].term, holder_2);
}
fclose(fp);
qsort(*terms, n, sizeof(term), cmp1);
}
int lowest_match(term *terms, int nterms, char *substr){
int bot = 0; int top = nterms - 1; int res = -69; int mid;
while (bot < top + 1){
mid = (bot + top)/2;
if (strncmp(terms[mid].term, substr, strlen(substr)) == 0){
res = mid;
top = mid - 1;
}
else if (strncmp(terms[mid].term, substr, strlen(substr)) > 0){
top = mid - 1;
}
else{
bot = mid + 1;
}
}
return res;
}
int highest_match(struct term *terms, int nterms, char *substr){
int bot = 0; int top = nterms - 1; int res = -69; int mid;
while (bot < top + 1){
mid = (bot + top)/2;
if (strncmp(terms[mid].term, substr, strlen(substr)) == 0){
res = mid;
bot = mid + 1;
}
else if (strncmp(terms[mid].term, substr, strlen(substr)) > 0){
top = mid - 1;
}
else{
bot = mid + 1;
}
}
return res;
}
void autocomplete(term **answer, int *n_answer, term *terms, int nterms, char *substr){
int l = lowest_match(terms, nterms, substr);
int h = highest_match(terms, nterms, substr);
if(l == -69 && h == -69){
*n_answer = 0;
}
else{
*n_answer = h - l + 1;
}
*answer = (term *)malloc(*n_answer * sizeof(term));
for ( int i = 0; i < *n_answer; i++){
(*answer)[i] = terms[l + i];
}
qsort(*answer, *n_answer, sizeof(term), cmp2);
}