bitmagic-sys 0.2.4+bitmagic.7.7.7

Low-level bindings for the bitmagic.
Documentation
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
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
/*
Copyright(c) 2002-2020 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.

For more information please visit:  http://bitmagic.io
*/

/** \example inv_list.cpp
  Utility to compress test sets of inverted lists (Gov2 corpus)
  and study compression characteristics and different comression levels
*/

/*! \file inv_list.cpp
    \brief Utility to compress test sets of inverted lists
*/

#include <iostream>
#include <chrono>
#include <thread>
#include <time.h>
#include <stdio.h>
#include <cstdlib>


#ifdef _MSC_VER
#pragma warning( push )
#pragma warning( disable : 4996)
#endif

#include <vector>
#include <chrono>
#include <map>

#include "bm.h"
#include "bmalgo.h"
#include "bmserial.h"
#include "bmsparsevec.h"
#include "bmsparsevec_compr.h"
#include "bmsparsevec_algo.h"
#include "bmsparsevec_serial.h"
#include "bmalgo_similarity.h"


#include "bmdbg.h"
#include "bmtimer.h"
#include "bmundef.h" /* clear the pre-proc defines from BM */

using namespace std;

static
void show_help()
{
    std::cout
        << "BitMagic Inverted List Compression Test (c) 2019" << std::endl
        << "-u32in u32-input-file       -- raw 32-bit unsigned int file" << std::endl
        << "-bvout bvect-output-file    -- bit-vector compressed out file" << std::endl
        << "-svout svect-output-file    -- bit-transposed sparse vectors out file" << std::endl
        << "-bvin bvect-input-file      -- bit-vector compressed in file" << std::endl
        << std::endl
        << "-level N                    -- compression level to use (up to 5)"     << std::endl
        << "-silent (-s)                -- no progress print or messages"          << std::endl
        << "-verify                     -- verify compressed version "             << std::endl
        << "-decode                     -- run decode test (in-memory)"            << std::endl
        << "-diag (-d)                  -- print statistics/diagnostics info"      << std::endl
        << "-timing (-t)                -- evaluate timing/duration of operations" << std::endl
      ;
}




// Arguments
//
std::string  bv_in_file;
std::string  bv_out_file;

std::string  sv_in_file;
std::string  sv_out_file;
std::string  u32_in_file;
std::string  u32_out_file;

bool         is_diag = false;
bool         is_timing = false;
bool         is_verify = false;
bool         is_silent = false;
bool         is_decode = false;

unsigned     c_level = bm::set_compression_default;


static
int parse_args(int argc, char *argv[])
{
    for (int i = 1; i < argc; ++i)
    {
        std::string arg = argv[i];
        if ((arg == "-h") || (arg == "--help"))
        {
            show_help();
            return 0;
        }
        
        if (arg == "-v" || arg == "-verify")
        {
            if (i + 1 < argc)
            {
                is_verify = true;
            }
            continue;
        }
        if (arg == "-decode")
        {
            if (i + 1 < argc)
            {
                is_decode = true;
            }
            continue;
        }
        if (arg == "-l" || arg == "-level")
        {
            if (i + 1 < argc)
            {
                const char* lvl = argv[++i];
                char *end;
                c_level = (unsigned) std::strtoul(lvl, &end, 10);
                if (errno == ERANGE)
                {
                    std::cerr << "Error parsing -level: range error for "
                              << lvl<< std::endl;
                    return 1;
                }
            }
            else
            {
                std::cerr << "Error: -level requires compression level number" << std::endl;
                return 1;
            }
            continue;
        }

        if (arg == "-bvout" || arg == "--bvout")
        {
            if (i + 1 < argc)
            {
                bv_out_file = argv[++i];
            }
            else
            {
                std::cerr << "Error: -bvout requires file name" << std::endl;
                return 1;
            }
            continue;
        }
        if (arg == "-bvin" || arg == "--bvin")
        {
            if (i + 1 < argc)
            {
                bv_in_file = argv[++i];
            }
            else
            {
                std::cerr << "Error: -bvin requires file name" << std::endl;
                return 1;
            }
            continue;
        }

        if (arg == "-svin" || arg == "--svin")
        {
            if (i + 1 < argc)
            {
                sv_in_file = argv[++i];
            }
            else
            {
                std::cerr << "Error: -svin requires file name" << std::endl;
                return 1;
            }
            continue;
        }

        if (arg == "-u32in" || arg == "--u32in")
        {
            if (i + 1 < argc)
            {
                u32_in_file = argv[++i];
            }
            else
            {
                std::cerr << "Error: -u32in requires file name" << std::endl;
                return 1;
            }
            continue;
        }
        
        if (arg == "-svout" || arg == "--svout")
        {
            if (i + 1 < argc)
            {
                sv_out_file = argv[++i];
            }
            else
            {
                std::cerr << "Error: -svout requires file name" << std::endl;
                return 1;
            }
            continue;
        }


        if (arg == "-silent" || arg == "--silent" || arg == "-s" || arg == "--s")
            is_silent = true;
        if (arg == "-diag" || arg == "--diag" || arg == "-d" || arg == "--d")
            is_diag = true;
        if (arg == "-timing" || arg == "--timing" || arg == "-t" || arg == "--t")
            is_timing = true;
        
        
    } // for i
    return 0;
}


// Globals
//

typedef bm::sparse_vector<unsigned, bm::bvector<> > sparse_vector_u32;
typedef bm::rsc_sparse_vector<unsigned, sparse_vector_u32> rsc_sparse_vector_u32;


bm::chrono_taker::duration_map_type  timing_map;


/// Read 32-bit vector size-prefix format (length:0, 1, 2, 3, ....)
///
template<class VT>
int io_read_u32_coll(std::ifstream& fin, VT& vec)
{
    typedef typename VT::value_type  value_type;
    vec.resize(0);
    if (!fin.good())
        return -1;
    value_type len;
    fin.read((char*) &len, std::streamsize(sizeof(len)));
    if (!fin.good())
        return -1;
    if (!len)
        return -2; // 0-len detected (broken file)
    
    vec.resize(len);
    fin.read((char*) &vec[0], std::streamsize(len*sizeof(value_type)));
    if (!fin.good())
        return -1;

    return 0;
}

/// Check if input vector is monotonously sorted (true inverted list)
/// along the way in computes a minimal delta between values
///
template<typename VT>
int validate_inp_vec(const VT& vec,
                     typename VT::value_type& min_delta,
                     typename VT::value_type& min_delta_cnt
                     )
{
    typename VT::value_type md_cnt = min_delta_cnt = 0;
    auto sz = vec.size();
    if (!sz)
        return -1;
    auto i_prev = vec[0];
    typename VT::value_type md = ~(typename VT::value_type(0)); // max possible uint
    for (typename VT::size_type i = 1; i < sz; ++i)
    {
        auto val = vec[i];
        if (val <= i_prev)
            return -2;
        typename VT::value_type d1 = val - i_prev;
        if (d1 < md)
        {
            md_cnt = 0; md = d1;
        }
        md_cnt += (d1 == md);
        i_prev = val;
    }
    min_delta = md;
    min_delta_cnt = md_cnt;
    return 0;
}

/// Verification check if integer vector is equivalent to a bit-vector
///
template<typename VT, typename BV>
int compare_vect(const VT& vec, const BV& bv)
{
    if (vec.size() != bv.count())
    {
        return -1;
    }
    typename BV::enumerator en = bv.first();
    typename VT::const_iterator it = vec.begin();
    for (; en.valid(); ++en, ++it)
    {
        if (*en != *it)
            return -1;
    }
    return 0;
}

/// Debug utility to detect super sparse bit-vectors
/// which probably get bad compression rate
///
template<typename BV>
bool is_super_sparse(const BV& bv)
{
    typename BV::statistics st;
    bv.calc_stat(&st);
    auto bc = bv.count();
    auto blocks_count = st.gap_blocks + st.bit_blocks;
    if (bc <= blocks_count)
        return true;
    auto bc_parity = blocks_count * 6;
    return (bc <= bc_parity);
}


///  convert vector into bit-vector and append to the file
///
/// @return true if vector was detected as very low cardinality
///
template<typename VT>
bool write_as_bvector(std::ofstream& bv_file,
                     const VT& vec,
                     bm::serializer<bm::bvector<> >& bvs,
                     bm::serializer<bm::bvector<> >::buffer& sbuf)
{
    BM_DECLARE_TEMP_BLOCK(tb)
    bm::bvector<> bv;
    bv.set(&vec[0], bm::bvector<>::size_type(vec.size()), bm::BM_SORTED);

    bv.optimize(tb);
    bvs.serialize(bv, sbuf);

    unsigned bv_size = (unsigned)sbuf.size();
    bv_file.write((char*)&bv_size, sizeof(bv_size));
    bv_file.write((char*)sbuf.data(), (std::streamsize)sbuf.size());
    if (!bv_file.good())
        throw std::runtime_error("Error write to bvect out file");
    return false;
}

///  convert vector into delta coded bit-transposed vector and append to the file
///
template<typename VT>
void write_as_svector(std::ofstream& sv_file,
                     const VT& vec,
                     unsigned min_delta,
                     bm::sparse_vector_serial_layout<sparse_vector_u32>& sv_lay)
{

    sparse_vector_u32 sv;
    bm::id_t prev = vec[0];

    {
        sparse_vector_u32::back_insert_iterator sv_bi = sv.get_back_inserter();
        sv_bi.add(min_delta);
        sv_bi.add(prev);

        for (unsigned k = 1; k < vec.size(); ++k)
        {
            bm::id_t curr = vec[k];
            bm::id_t delta = curr - prev;
            if (delta < min_delta)
                throw std::runtime_error("Input vector validation delta error");
            delta -= min_delta;
            sv_bi.add(delta);
            prev = curr;
        } // for i
        sv_bi.flush();
    }

    BM_DECLARE_TEMP_BLOCK(tb)
    sv.optimize(tb);
    bm::sparse_vector_serialize(sv, sv_lay, tb);

    unsigned sv_size = (unsigned)sv_lay.size();
    sv_file.write((char*)&sv_size, sizeof(sv_size));
    sv_file.write((char*)sv_lay.data(), (std::streamsize)sv_lay.size());
    if (!sv_file.good())
        throw std::runtime_error("Error write to bvect out file");

}


///  convert vector into delta coded bit-transposed vector and append to the file
///
template<typename VT>
void write_as_rsc_svector(std::ofstream& sv_file,
                          const VT& vec,
                          unsigned min_delta,
                          bm::sparse_vector_serial_layout<rsc_sparse_vector_u32>& sv_lay)
{

    sparse_vector_u32 sv(bm::use_null);
    bm::id_t prev = vec[0];

    {
        sparse_vector_u32::back_insert_iterator sv_bi = sv.get_back_inserter();
        sv_bi.add(min_delta);
        sv_bi.add(prev);

        for (unsigned k = 1; k < vec.size(); ++k)
        {
            bm::id_t curr = vec[k];
            bm::id_t delta = curr - prev;
            if (delta < min_delta)
                throw std::runtime_error("Input vector validation delta error");
            delta -= min_delta;
            if (delta)
                sv_bi.add(delta);
            else
                sv_bi.add_null();
            prev = curr;
        } // for i
        sv_bi.flush();
    }

    BM_DECLARE_TEMP_BLOCK(tb)
 
    rsc_sparse_vector_u32 csv; // compressed sparse vector
    csv.load_from(sv); // load rank-select-compacted (rsc) sparse vector
    csv.optimize(tb);

    bm::sparse_vector_serialize(csv, sv_lay, tb);

    unsigned sv_size = (unsigned)sv_lay.size();
    sv_file.write((char*)&sv_size, sizeof(sv_size));
    sv_file.write((char*)sv_lay.data(), (std::streamsize)sv_lay.size());
    if (!sv_file.good())
        throw std::runtime_error("Error write to bvect out file");

}



/// read the input collection sequence, write using various compression schemes
///
static
void compress_inv_dump_file(const std::string& fname,
                            const std::string& bv_out_fname,
                            const std::string& sv_out_fname)
{
    bm::id64_t total_ints = 0;
    bm::id64_t total_low_card = 0;
    bm::id64_t total_low_card_size = 0;
    bm::id64_t min_delta_ints = 0;
    bm::id64_t sv_size = 0;
    bm::id64_t rsc_diff_size = 0;
    bm::id64_t sv_cnt = 0;

    cout << "Reading input collection: " << fname << endl;
    if (!bv_out_fname.empty())
        cout << "Writing to BV collection: " << bv_out_fname << endl;
    else
        cout << "NO BV collection specified" << endl;
    if (!sv_out_fname.empty())
        cout << "Writing to SV collection: " << sv_out_fname << endl;
    else
        cout << "NO SV collection specified" << endl;

    
    cout << "Compression level: " << c_level << endl;

    bm::chrono_taker tt1("1. Convert collection", 1, &timing_map);

    vector<unsigned> vec;
    std::ifstream fin(fname.c_str(), std::ios::in | std::ios::binary);
    if (!fin.good())
    {
        throw std::runtime_error("Cannot open input file");
    }
    
    std::ofstream bv_file;
    if (!bv_out_fname.empty())
    {
        bv_file.open(bv_out_fname, std::ios::out | std::ios::binary);
        if (!bv_file.good())
            throw std::runtime_error("Cannot open bvect out file");
    }
    std::ofstream sv_file;
    if (!sv_out_fname.empty())
    {
        sv_file.open(sv_out_fname, std::ios::out | std::ios::binary);
        if (!sv_file.good())
            throw std::runtime_error("Cannot open svect out file");
    }

    
    fin.seekg(0, std::ios::end);
    std::streamsize fsize = fin.tellg();

    fin.seekg(0, std::ios::beg);
    
    // initialize serializer
    //
    bm::serializer<bm::bvector<> > bvs;
    bvs.byte_order_serialization(false);
    bvs.gap_length_serialization(false);
    bvs.set_compression_level(c_level);
    
    // serialization target for sparse vector
    bm::sparse_vector_serial_layout<sparse_vector_u32> sv_lay;
    bm::sparse_vector_serial_layout<rsc_sparse_vector_u32> csv_lay;
    
    bm::serializer<bm::bvector<> >::buffer sbuf; // resizable memory buffer

    // main loop to read sample vectors
    //
    bm::id64_t i;
    for (i = 0; true; ++i)
    {
        int ret = io_read_u32_coll(fin, vec);
        if (ret != 0)
            throw std::runtime_error("Error reading input file");
        unsigned min_delta, min_delta_cnt;

        {
            ret = validate_inp_vec(vec, min_delta, min_delta_cnt); // check if we have sorted unique set
            if (ret != 0)
                throw std::runtime_error("Input vector validation failed");
            if (!min_delta || !min_delta_cnt)
                throw std::runtime_error("Input vector validation delta error");
            
            min_delta_ints += min_delta_cnt;
        }
        total_ints += vec.size(); // remember the total size of the collection
        
        // serialize and save as a bit-vector size0:<BLOB0>, size1:<BLOB1>...N
        //
        bool is_low_card = false;
        if (!bv_out_fname.empty())
        {
            is_low_card = write_as_bvector(bv_file, vec, bvs, sbuf);
            if (is_low_card)
            {
                total_low_card_size += sbuf.size();
                ++total_low_card;
            }
        }
        
        // commented out experimental (and very slow code) to evaluate rank-select compression
        #if 0
        if (!sv_out_fname.empty())
        {
            //write_as_svector(sv_file, vec, min_delta, sv_lay);
            write_as_rsc_svector(sv_file, vec, min_delta, csv_lay);
            sv_size += sv_lay.size();

                /*
                rsc_sparse_vector_u32 csv; // compressed sparse vector
                csv.load_from(sv); // load rank-select-compacted (rsc) sparse vector
                
                BM_DECLARE_TEMP_BLOCK(tb)
                csv.optimize(tb);
                bm::sparse_vector_serial_layout<rsc_sparse_vector_u32> sv_lay;
                bm::sparse_vector_serialize(csv, sv_lay, tb);
                if (sv_lay.size() < sbuf.size())
                {
                    rsc_diff = sbuf.size() - sv_lay.size();
                    rsc_diff_size += rsc_diff;
                    sv_size += sv_lay.size();
                    sv_cnt++;
                }
                */
        }
        #endif
        
        
        std::streamsize fpos_curr = fin.tellg();
        if (fpos_curr == fsize)
            break;
        
        if (!is_silent)
        {
            cout << "\r" << i << "   " << fpos_curr << " / " << fsize
                 << " ( size=" << vec.size() << " ) " << (is_low_card ? " * " : "    ")
                 << " sv=" << sv_cnt << " rsc_diff=" << rsc_diff_size
                 << flush;
        }

    } // for i
    
    // print statistics about test set
    
    cout << endl;
    cout << "Total vectors=" << i << endl;
    cout << "  lo-card=" << total_low_card << endl;
    cout << "  lo-card size = " << total_low_card_size << endl;
    cout << "  SV cnt = " << sv_cnt << endl;
    cout << "  SV size = " << sv_size << endl;
    cout << "  RSC diff = " << rsc_diff_size << endl;
    cout << "Total ints=" << total_ints << endl;
    cout << "  min-deltas = " << min_delta_ints << endl;
    {
        double min_delta_ratio = double(min_delta_ints) / double(total_ints);
        cout << "  min delta ratio = " << std::setprecision(3) << min_delta_ratio << endl;
    }
    if (!bv_out_fname.empty())
    {
        bm::id64_t bv_size = (bm::id64_t)bv_file.tellp();
        cout << "BV size = " << bv_size << endl;
        // calculate bits per int compression ratio corrected not to account
        // for size/length words prefixing the vectors
        double bv_bits_per_int = double(bv_size * 8ull - (i*sizeof(unsigned))) / double(total_ints);
        cout << "BV Bits per/int = " << std::setprecision(3) << bv_bits_per_int << endl;
        
        bv_file.close();
    }
    
    if (!sv_out_fname.empty())
    {
        sv_size = (bm::id64_t)sv_file.tellp();
        cout << "SV size = " << sv_size << endl;
        // calculate bits per int compression ratio corrected not to account
        // for size/length words prefixing the vectors
        double sv_bits_per_int = double(sv_size * 8ull - (i*sizeof(unsigned))) / double(total_ints);
        cout << "SV Bits per/int = " << std::setprecision(3) << sv_bits_per_int << endl;
        
        sv_file.close();
    }

}

// ------------------------------------------------------------------------

/// read and desrialize bit-bector from the dump file
///
static
int read_bvector(std::ifstream& bv_file,
                  bm::bvector<>& bv,
                  bm::serializer<bm::bvector<> >::buffer& sbuf)
{
    if (!bv_file.good())
        return -1;
    unsigned len;
    bv_file.read((char*) &len, std::streamsize(sizeof(len)));
    if (!bv_file.good())
        return -1;
    if (!len)
        return -2; // 0-len detected (broken file)
    
    sbuf.resize(len, false); // resize without content preservation
    bv_file.read((char*) sbuf.data(), std::streamsize(len));
    if (!bv_file.good())
        return -1;
    
    bm::deserialize(bv, sbuf.data());

    return 0;
}


/// read the input collection sequence and dump file, verify correctness
///
static
void verify_inv_dump_file(const std::string& fname,
                          const std::string& bv_in_fname)
{
    bm::id64_t total_ints = 0;


    bm::chrono_taker tt1("2. Verify collection", 1, &timing_map);


    cout << "Reading input collection: " << fname << endl;
    if (!bv_in_fname.empty())
        cout << "Reading BV collection: " << bv_in_fname << endl;
    else
        cout << "NO BV collection specified" << endl;


    vector<unsigned> vec;
    std::ifstream fin(fname.c_str(), std::ios::in | std::ios::binary);
    if (!fin.good())
    {
        throw std::runtime_error("Cannot open input file");
    }
    
    std::ifstream bv_file;
    std::streamsize fsize;
    if (!bv_in_fname.empty())
    {
        bv_file.open(bv_in_fname, std::ios::in | std::ios::binary);
        if (!bv_file.good())
            throw std::runtime_error("Cannot open bvect dump file");
        fin.seekg(0, std::ios::end);
        fsize = fin.tellg();
        fin.seekg(0, std::ios::beg);
    }
    
    
    // initialize serializer
    //
    
    bm::serializer<bm::bvector<> >::buffer sbuf; // resizable memory buffer

    // main loop to read sample vectors
    //
    bm::id64_t i;
    for (i = 0; true; ++i)
    {
        int ret = io_read_u32_coll(fin, vec);
        if (ret != 0)
            throw std::runtime_error("Error reading input file");

        total_ints += vec.size(); // remember the total size of the collection
        
        // serialize and save as a bit-vector size0:<BLOB0>, size1:<BLOB1>...N
        //
        if (!bv_in_fname.empty())
        {
            bm::bvector<> bv;
            read_bvector(bv_file, bv, sbuf);
            int cmp = compare_vect(vec, bv);
            if (cmp != 0)
            {
                throw std::runtime_error("Vector comparison failed");
            }
        }
        
        std::streamsize fpos_curr = fin.tellg();
        if (fpos_curr == fsize)
            break;
        
        if (!is_silent)
        {
            cout << "\r" << fpos_curr << "/" << fsize
                 << " ( size=" << vec.size() << " )              "
                 << flush;
        }
    } // for i
    
    cout << endl;
    cout << "Verification complete." << endl;
    cout << "Total vectors=" << i << endl;
    cout << "Total ints=" << total_ints << endl;
}

/// read and decode the compressed dump file
///
static
void decode_test_dump_file(const std::string& bv_in_fname)
{
    bm::chrono_taker tt1("3. Decode collection", 1, &timing_map);

    std::ifstream bv_file;
    std::streamsize fsize;
    if (!bv_in_fname.empty())
    {
        bv_file.open(bv_in_fname, std::ios::in | std::ios::binary);
        if (!bv_file.good())
            throw std::runtime_error("Cannot open bvect dump file");
        bv_file.seekg(0, std::ios::end);
        fsize = bv_file.tellg();
        bv_file.seekg(0, std::ios::beg);
    }
    else
    {
        throw std::runtime_error("Cannot open bvect dump file");
    }
        

    bm::serializer<bm::bvector<> >::buffer sbuf; // resizable memory buffer

    // main loop to read sample vectors
    //
    bm::id64_t i;
    for (i = 0; true; ++i)
    {
        // serialize and save as a bit-vector size0:<BLOB0>, size1:<BLOB1>...N
        //
        if (!bv_in_fname.empty())
        {
            bm::bvector<> bv;
            read_bvector(bv_file, bv, sbuf);
        }

        std::streamsize fpos_curr = bv_file.tellg();
        if (fpos_curr == fsize)
            break;

        if (!is_silent)
        {
            cout << "\r" << fpos_curr << "/" << fsize
                 << flush;
        }
    } // for i

    cout << endl;
    cout << "Decode complete." << endl;
    cout << "Total vectors=" << i << endl;
}



int main(int argc, char *argv[])
{
    if (argc < 3)
    {
        show_help();
        return 1;
    }
    
    try
    {
        auto ret = parse_args(argc, argv);
        if (ret != 0)
            return ret;
        
        if (!u32_in_file.empty())
        {
            if (!is_verify)
            {
                cout << "Compression" << endl;
                compress_inv_dump_file(u32_in_file, bv_out_file, sv_out_file);
            }
            else
            {
                if (is_verify)
                {
                    cout << "Verification." << endl;
                    verify_inv_dump_file(u32_in_file, bv_in_file);
                }
            }
        }
        if (is_decode)
        {
            cout << "Decode test." << endl;
            decode_test_dump_file(bv_in_file);
        }

                
        if (is_timing)  // print all collected timings
        {
            std::cout << std::endl << "Timings (ms):" << std::endl;
            bm::chrono_taker::print_duration_map(timing_map);
        }
    }
    catch (std::exception& ex)
    {
        std::cerr << "Error:" << ex.what() << std::endl;
        return 1;
    }

    return 0;
}


#ifdef _MSC_VER
#pragma warning( pop )
#endif