sux 0.12.3

A pure Rust implementation of succinct and compressed data structures
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

#define BOOST_TEST_MODULE uniform_partitioned_sequence

#include "test_generic_sequence.hpp"

#include "uniform_partitioned_sequence.hpp"
#include "strict_sequence.hpp"
#include <vector>
#include <cstdlib>

BOOST_AUTO_TEST_CASE(uniform_partitioned_sequence)
{
    ds2i::global_parameters params;
    using ds2i::indexed_sequence;
    using ds2i::strict_sequence;

    // test singleton sequences
    std::vector<uint64_t> short_seq;
    short_seq.push_back(0);
    test_sequence(ds2i::uniform_partitioned_sequence<indexed_sequence>(),
                  params, 1, short_seq);
    test_sequence(ds2i::uniform_partitioned_sequence<strict_sequence>(),
                  params, 1, short_seq);
    short_seq[0] = 1;
    test_sequence(ds2i::uniform_partitioned_sequence<indexed_sequence>(),
                  params, 2, short_seq);
    test_sequence(ds2i::uniform_partitioned_sequence<strict_sequence>(),
                  params, 2, short_seq);

    std::vector<double> avg_gaps = { 1.1, 1.9, 2.5, 3, 4, 5, 10 };
    for (auto avg_gap: avg_gaps) {
        uint64_t n = 10000;
        uint64_t universe = uint64_t(n * avg_gap);
        auto seq = random_sequence(universe, n, true);

        test_sequence(ds2i::uniform_partitioned_sequence<indexed_sequence>(),
                      params, universe, seq);
        test_sequence(ds2i::uniform_partitioned_sequence<strict_sequence>(),
                      params, universe, seq);
    }
}