-
Notifications
You must be signed in to change notification settings - Fork 1
/
invlist_and.c
199 lines (153 loc) · 4.03 KB
/
invlist_and.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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define BUFFLEN 1024000
int
main (int argc, char *argv[])
{
if (argc < 2) {
fprintf(stderr, "Input query.\n");
exit(1);
}
char *buff = malloc(sizeof(char) * BUFFLEN);
if (buff == NULL) {
fprintf(stderr, "Failed to allocate memory.\n");
exit(1);
}
int query_num = argc - 1;
char *query_list[ query_num ];
int df[ query_num ];
int *invlist[ query_num ];
int i;
for (i = 0; i < argc - 1; i++) {
query_list[ i ] = malloc(sizeof(char) * (strlen(argv[i + 1] + 1)) );
if (query_list[ i ] == NULL) {
fprintf(stderr, "Failed to allocate memory.\n");
exit(1);
}
strcpy(query_list[ i ], argv[i + 1]);
char *filename = argv[i + 1];
FILE *fp = fopen(filename, "r");
if (fp == NULL) {
fprintf(stderr, "Failed to open %s\n", filename);
exit(1);
}
if (fgets(buff, BUFFLEN, fp) != NULL) {
char *token = strtok(buff, " ");
df[ i ] = atoi(token);
invlist[ i ] = malloc(sizeof(int) * df[ i ]);
if (invlist[ i ] == NULL) {
fprintf(stderr, "Failed to allocate memroy for invlist.\n");
exit(1);
}
int count = 0;
while ((token = strtok(NULL, " ")) != NULL && count < df[ i ] ) {
invlist[ i ][ count ] = atoi( token );
count++;
}
} else {
fprintf(stderr, "Failed to read line.\n");
}
}
// Print inverted list
printf("inverted lists for input query ===\n");
for (i = 0; i < query_num; i++) {
int j;
printf("%s -> ", query_list[ i ]);
printf("%d: ", df[ i ]);
for (j = 0; j < df[ i ]; j++) {
printf("%d ", invlist[ i ][ j ]);
}
printf("\n");
}
printf("\n");
/* Intersection */
// Create order list by bubble sort
int length_order_list[ query_num ];
for (i = 0; i < query_num; i++) {
length_order_list[ i ] = i;
}
for (i = 0; i < query_num; i++) {
int j;
for (j = 1; j < query_num - i; j++) {
if (df[ length_order_list[j] ] <
df[ length_order_list[j - 1] ]) {
// swap i and j
int swap = length_order_list[ j ];
length_order_list[ j ] = length_order_list[ j - 1 ];
length_order_list[ j - 1 ] = swap;
}
}
}
// Print ordered list
printf("ordered list===\n");
for (i = 0; i < query_num; i++) {
int idx = length_order_list[ i ];
int j;
printf("%s -> ", query_list[ idx ]);
printf("%d: ", df[ idx ]);
for (j = 0; j < df[ idx ]; j++) {
printf("%d ", invlist[ idx ][ j ]);
}
printf("\n");
}
printf("\n");
// Intersection by linear merge
int result_num = 0;
if (query_num == 1) {
result_num = df[ 0 ];
}
for (i = 1; i < query_num; i++) {
int idx1 = length_order_list[ i - 1 ];
int idx2 = length_order_list[ i ];
// Get intersection between invlist[ idx1 ] and invlist[ idx2 ]
// and store result into invlist[ idx1 ]
// DEBUG PRINT
if (i == 1) {
printf("Intersection of %s and %s: ", query_list[ idx1 ], query_list[ idx2 ]);
} else {
printf("Intersection of last result and %s: ", query_list[ idx2 ]);
}
int i1 = 0; // pointer for invlist[ idx1 ]
int i2 = 0; // pointer for invlist[ idx2 ]
int r = 0; // pointer for result (invlist[ idx2 ])
while (i1 < df[ idx1 ] &&
i2 < df[ idx2 ]) {
if (invlist[ idx1 ][ i1 ] <
invlist[ idx2 ][ i2 ]) {
i1++;
} else if (invlist[ idx1 ][ i1 ] >
invlist[ idx2 ][ i2 ]) {
i2++;
} else {
// Hit
invlist[ idx2 ][ r ] = invlist[ idx2 ][ i2 ];
r++;
i1++;
i2++;
}
}
result_num = r;
df[ idx2 ] = result_num;
// DEBUG PRINT
int j;
for (j = 0; j < result_num; j++) {
printf("%d ", invlist[ idx2 ][ j ]);
}
printf("\n");
}
printf("\n");
// Print result
printf("search result ===\n");
printf("result num: %d\n", result_num);
for (i = 0; i < result_num; i++) {
printf("%d ", invlist[ length_order_list[query_num - 1] ][ i ]);
}
printf("\n");
for (i = 0; i < query_num; i++) {
free(query_list[ i ]);
free(invlist[ i ]);
}
free(buff);
return 0;
}