forked from mpetri/recursive_graph_bisection
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathutil.hpp
320 lines (299 loc) · 8.37 KB
/
util.hpp
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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
#pragma once
#include <chrono>
#include <cstdarg>
#include <cstring>
#include <iostream>
#include <memory>
#include <mutex>
#include <vector>
using namespace std::chrono;
using postings_list = std::vector<uint32_t>;
struct inverted_index {
uint32_t num_docs;
std::vector<postings_list> docids;
std::vector<postings_list> freqs;
std::vector<uint32_t> doc_lengths;
std::vector<uint32_t> doc_id_mapping;
void resize(size_t new_size)
{
docids.resize(new_size);
freqs.resize(new_size);
}
size_t size() const { return docids.size(); }
void clear()
{
docids.resize(0);
freqs.resize(0);
doc_lengths.resize(0);
doc_id_mapping.resize(0);
}
};
int tsfprintff(FILE* f, const char* format, ...)
{
static std::mutex pmutex;
std::lock_guard<std::mutex> lock(pmutex);
va_list args;
va_start(args, format);
int ret = vfprintf(f, format, args);
va_end(args);
fflush(f);
return ret;
}
struct timer {
high_resolution_clock::time_point start;
std::string name;
timer(const std::string& _n)
: name(_n)
{
tsfprintff(stdout, "START(%s)\n", name.c_str());
start = high_resolution_clock::now();
}
~timer()
{
auto stop = high_resolution_clock::now();
tsfprintff(stdout, "STOP(%s) - %f sec\n", name.c_str(),
duration_cast<milliseconds>(stop - start).count() / 1000.0f);
}
};
struct progress_bar {
high_resolution_clock::time_point start;
size_t total;
size_t current;
size_t cur_percent;
progress_bar(std::string str, size_t t)
: total(t)
, current(0)
, cur_percent(0)
{
std::cout << str << ":" << std::endl;
tsfprintff(stdout, "[ 0/100] |");
for (size_t i = 0; i < 50; i++)
tsfprintff(stdout, " ");
tsfprintff(stdout, "|\r");
}
progress_bar& operator++()
{
current++;
float fcp = float(current) / float(total) * 100;
size_t cp = fcp;
if (cp != cur_percent) {
cur_percent = cp;
tsfprintff(stdout, "[%3d/100] |", (int)cur_percent);
size_t print_percent = cur_percent / 2;
for (size_t i = 0; i < print_percent; i++)
tsfprintff(stdout, "=");
tsfprintff(stdout, ">");
for (size_t i = print_percent; i < 50; i++)
tsfprintff(stdout, " ");
tsfprintff(stdout, "|\r");
}
return *this;
}
void done(size_t num)
{
static std::mutex pmutex;
std::lock_guard<std::mutex> lock(pmutex);
current += num;
float fcp = float(current) / float(total) * 100;
size_t cp = fcp;
if (cp != cur_percent) {
cur_percent = cp;
tsfprintff(stdout, "[%3d/100] |", (int)cur_percent);
size_t print_percent = cur_percent / 2;
for (size_t i = 0; i < print_percent; i++)
tsfprintff(stdout, "=");
tsfprintff(stdout, ">");
for (size_t i = print_percent; i < 50; i++)
tsfprintff(stdout, " ");
tsfprintff(stdout, "|\r");
}
}
~progress_bar()
{
tsfprintff(stdout, "[100/100] |");
for (size_t i = 0; i < 50; i++)
tsfprintff(stdout, "=");
tsfprintff(stdout, ">|\n");
}
};
int fprintff(FILE* f, const char* format, ...)
{
va_list args;
va_start(args, format);
int ret = vfprintf(f, format, args);
va_end(args);
fflush(f);
return ret;
}
void quit(const char* format, ...)
{
va_list args;
va_start(args, format);
fprintf(stderr, "error: ");
vfprintf(stderr, format, args);
va_end(args);
if (errno != 0) {
fprintf(stderr, ": %s\n", strerror(errno));
} else {
fprintf(stderr, "\n");
}
fflush(stderr);
exit(EXIT_FAILURE);
}
FILE* fopen_or_fail(std::string file_name, const char* mode)
{
FILE* out_file = fopen(file_name.c_str(), mode);
if (!out_file) {
quit("opening output file %s failed", file_name.c_str());
}
return out_file;
}
void fclose_or_fail(FILE* f)
{
int ret = fclose(f);
if (ret != 0) {
quit("closing file failed");
}
}
uint32_t read_u32(FILE* f)
{
uint32_t x;
int ret = fread(&x, sizeof(uint32_t), 1, f);
if (feof(f)) {
return 0;
}
if (ret != 1) {
quit("read u32 from file failed: %d != %d", ret, 1);
}
return x;
}
void read_u32s(FILE* f, void* ptr, size_t n)
{
size_t ret = fread(ptr, sizeof(uint32_t), n, f);
if (ret != n) {
quit("read u32s from file failed: %d != %d", ret, n);
}
}
std::vector<uint32_t> read_uint32_list(FILE* f)
{
uint32_t list_len = read_u32(f);
if (list_len == 0)
return std::vector<uint32_t>();
std::vector<uint32_t> list(list_len);
read_u32s(f, list.data(), list_len);
return list;
}
size_t write_u32(FILE* f, uint32_t x)
{
size_t ret = fwrite(&x, sizeof(uint32_t), 1u, f);
if (ret != 1u) {
quit("writing byte to file: %u != %u", ret, 1u);
}
return sizeof(uint32_t);
}
size_t write_u32s(FILE* f, uint32_t* buf, size_t n)
{
size_t ret = fwrite(buf, sizeof(uint32_t), n, f);
if (ret != n) {
quit("writing byte to file: %u != %u", ret, n);
}
return n * sizeof(uint32_t);
}
size_t write_uint32_list(FILE* f, std::vector<uint32_t>& list)
{
size_t written_bytes = write_u32(f, list.size());
written_bytes += write_u32s(f, list.data(), list.size());
return written_bytes;
}
inverted_index read_ds2i_files(std::string ds2i_prefix)
{
inverted_index idx;
std::string docs_file = ds2i_prefix + ".docs";
timer t("read input list from " + docs_file);
auto df = fopen_or_fail(docs_file, "rb");
size_t num_docs = 0;
size_t num_postings = 0;
size_t num_lists = 0;
uint32_t max_doc_id = 0;
{
// (1) skip the numdocs list
read_uint32_list(df);
// (2) keep reading lists
while (!feof(df)) {
const auto& list = read_uint32_list(df);
size_t n = list.size();
if (n == 0) {
break;
}
max_doc_id = std::max(max_doc_id, list.back());
num_lists++;
num_postings += n;
idx.docids.emplace_back(std::move(list));
}
num_docs = max_doc_id + 1;
}
fclose_or_fail(df);
std::string freqs_file = ds2i_prefix + ".freqs";
auto ff = fopen_or_fail(freqs_file, "rb");
{
while (!feof(ff)) {
const auto& list = read_uint32_list(ff);
size_t n = list.size();
if (n == 0) {
break;
}
idx.freqs.emplace_back(std::move(list));
}
}
fclose_or_fail(ff);
std::string sizes_file = ds2i_prefix + ".sizes";
auto sf = fopen_or_fail(sizes_file, "rb");
{
idx.doc_lengths = read_uint32_list(sf);
}
fclose_or_fail(sf);
idx.num_docs = num_docs;
std::cout << "num_docs = " << num_docs << std::endl;
std::cout << "num_lists = " << num_lists << std::endl;
std::cout << "num_postings = " << num_postings << std::endl;
return idx;
}
void write_ds2i_files(inverted_index& idx, std::string ds2i_out_prefix)
{
std::string docs_file = ds2i_out_prefix + ".docs";
std::string freqs_file = ds2i_out_prefix + ".freqs";
std::string lens_file = ds2i_out_prefix + ".sizes";
std::string mapping_file = ds2i_out_prefix + ".mapping";
{
auto df = fopen_or_fail(docs_file, "wb");
{
// ds2i: 1st list contains num docs
std::vector<uint32_t> tmp(1);
tmp[0] = idx.num_docs;
write_uint32_list(df, tmp);
}
for (size_t i = 0; i < idx.docids.size(); i++) {
write_uint32_list(df, idx.docids[i]);
}
fclose_or_fail(df);
}
{
auto ff = fopen_or_fail(freqs_file, "wb");
for (size_t i = 0; i < idx.freqs.size(); i++) {
write_uint32_list(ff, idx.freqs[i]);
}
fclose_or_fail(ff);
}
{
auto sf = fopen_or_fail(lens_file, "wb");
write_uint32_list(sf, idx.doc_lengths);
fclose_or_fail(sf);
}
{
auto mf = fopen_or_fail(mapping_file, "w");
for (size_t i = 0; i < idx.doc_id_mapping.size(); ++i) {
fprintff(mf, "%zu %zu\n", idx.doc_id_mapping[i], i);
}
fclose_or_fail(mf);
}
}