5 #include <unordered_set>
12 void merge_count(void* userdata,
13 const uint8_t *key, size_t len_key,
14 const uint8_t *val0, size_t len_val0,
15 const uint8_t *val1, size_t len_val1,
16 uint8_t **merged_val, size_t *len_merged_val)
19 c0.ParseFromArray(val0, len_val0);
20 c1.ParseFromArray(val1, len_val1);
24 c.set_white(c0.white() + c1.white());
25 c.set_draw(c0.draw() + c1.draw());
26 c.set_black(c0.black() + c1.black());
27 c.set_sum_white_elo(c0.sum_white_elo() + c1.sum_white_elo());
28 c.set_sum_black_elo(c0.sum_black_elo() + c1.sum_black_elo());
29 c.set_num_elo(c0.num_elo() + c1.num_elo());
30 if (c0.first_timestamp() <= c1.first_timestamp()) {
31 c.set_opening_num(c0.opening_num());
32 if (c0.has_first_timestamp()) {
33 c.set_first_timestamp(c0.first_timestamp());
36 c.set_opening_num(c1.opening_num());
37 if (c1.has_first_timestamp()) {
38 c.set_first_timestamp(c1.first_timestamp());
42 // Merge the moves, with deduplication.
43 unordered_set<string> moves;
44 for (int i = 0; i < c0.move_size(); ++i) {
45 moves.insert(c0.move(i));
46 c.add_move(c0.move(i));
48 for (int i = 0; i < c1.move_size(); ++i) {
49 if (!moves.count(c1.move(i))) {
50 c.add_move(c1.move(i));
54 static string buf; // Keep allocated.
55 c.SerializeToString(&buf);
57 *merged_val = reinterpret_cast<uint8_t *>(malloc(buf.size()));
58 *len_merged_val = buf.size();
59 memcpy(*merged_val, buf.data(), buf.size());
62 int main(int argc, char **argv)
64 mtbl_merger_options* mopt = mtbl_merger_options_init();
65 mtbl_merger_options_set_merge_func(mopt, merge_count, NULL);
66 mtbl_merger* merger = mtbl_merger_init(mopt);
68 for (int i = 1; i < argc - 1; ++i) {
69 mtbl_reader* mtbl = mtbl_reader_init(argv[i], NULL);
70 mtbl_merger_add_source(merger, mtbl_reader_source(mtbl));
73 mtbl_writer_options* wopt = mtbl_writer_options_init();
74 mtbl_writer_options_set_block_size(wopt, 65536);
75 mtbl_writer* writer = mtbl_writer_init(argv[argc - 1], wopt);
76 mtbl_source_write(mtbl_merger_source(merger), writer);
77 mtbl_writer_destroy(&writer);