File: sorted_stack_support_test.cpp

package info (click to toggle)
libsdsl 2.1.1%2Bdfsg-6
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 4,020 kB
  • sloc: cpp: 42,286; makefile: 1,171; ansic: 318; sh: 201; python: 27
file content (160 lines) | stat: -rw-r--r-- 4,518 bytes parent folder | download | duplicates (16)
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
#include "sdsl/sorted_stack_support.hpp"
#include "sdsl/util.hpp"
#include "gtest/gtest.h"
#include <string>
#include <random>

namespace
{

std::string temp_dir;

// The fixture for testing class sorted_stack_support.
class sorted_stack_support_test : public ::testing::Test
{
    protected:

        sorted_stack_support_test() {}

        virtual ~sorted_stack_support_test() {}

        virtual void SetUp() {}

        virtual void TearDown() {}
};

void compare_stacks(std::stack<uint64_t>& exp, sdsl::sorted_stack_support& sss)
{
    ASSERT_EQ(exp.size(), sss.size());
    std::stack<uint64_t> tmp;
    while (!exp.empty()) {
        ASSERT_EQ(exp.top(), sss.top());
        tmp.push(exp.top());
        exp.pop();
        sss.pop();
    }
    ASSERT_EQ(exp.size(), sss.size());
    // Restore stacks
    while (!tmp.empty()) {
        exp.push(tmp.top());
        sss.push(tmp.top());
        tmp.pop();
    }
}

//! Test Constructors
TEST_F(sorted_stack_support_test, constructors)
{
    static_assert(std::is_copy_constructible<sdsl::sorted_stack_support>::value, "Type is not copy constructible");
    static_assert(std::is_move_constructible<sdsl::sorted_stack_support>::value, "Type is not move constructible");
    static_assert(std::is_copy_assignable<sdsl::sorted_stack_support>::value, "Type is not copy assignable");
    static_assert(std::is_move_assignable<sdsl::sorted_stack_support>::value, "Type is not move assignable");
    std::stack<uint64_t> exp;
    sdsl::sorted_stack_support sss1(100000+10);
    {
        std::mt19937_64 rng;
        std::uniform_int_distribution<uint64_t> distribution(0, 10);
        auto dice = bind(distribution, rng);
        for (uint64_t k=0; k<100000; ++k) {
            uint64_t value = k+dice();
            if (exp.empty() or exp.top() < value) {
                exp.push(value);
                sss1.push(value);
            }
        }
    }

    // Copy-constructor
    sdsl::sorted_stack_support sss2(sss1);
    compare_stacks(exp, sss2);

    // Move-constructor
    sdsl::sorted_stack_support sss3(std::move(sss2));
    compare_stacks(exp, sss3);
    // ASSERT_EQ((uint64_t)0, sss2.size());

    // Copy-Assign
    sdsl::sorted_stack_support sss4(0);
    sss4 = sss3;
    compare_stacks(exp, sss4);

    // Move-Assign
    sdsl::sorted_stack_support sss5(0);
    sss5 = std::move(sss4);
    compare_stacks(exp, sss5);
    // ASSERT_EQ((uint64_t)0, sss4.size());
}

//! Test Operations push, top and pop
TEST_F(sorted_stack_support_test, push_top_and_pop)
{
    for (uint64_t i=0; i<20; ++i) {
        std::mt19937_64 rng(i);
        std::uniform_int_distribution<uint64_t> distribution(0, i*i);
        auto dice = bind(distribution, rng);
        std::stack<uint64_t> exp;
        sdsl::sorted_stack_support sss(1000000+i*i);
        ASSERT_TRUE(sss.empty());
        for (uint64_t k=0; k<1000000; ++k) {
            ASSERT_EQ(exp.size(), sss.size());
            uint64_t value = k+dice();
            if (exp.empty()) {
                exp.push(value);
                sss.push(value);
            } else {
                ASSERT_EQ(exp.top(), sss.top());
                if (exp.top() >= value) {
                    exp.pop();
                    sss.pop();
                } else {
                    exp.push(value);
                    sss.push(value);
                }
            }
        }
    }
}

//! Test Serialize and Load
TEST_F(sorted_stack_support_test, serialize_and_load)
{
    std::string file_name = temp_dir+"/sorted_stack_support";
    std::stack<uint64_t> exp;
    {
        std::mt19937_64 rng;
        std::uniform_int_distribution<uint64_t> distribution(0, 10);
        auto dice = bind(distribution, rng);
        sdsl::sorted_stack_support sss(1000000+10);
        for (uint64_t k=0; k<1000000; ++k) {
            uint64_t value = k+dice();
            if (exp.empty() or exp.top() < value) {
                exp.push(value);
                sss.push(value);
            }
        }
        sdsl::store_to_file(sss, file_name);
    }
    {
        sdsl::sorted_stack_support sss(0);
        sdsl::load_from_file(sss, file_name);
        compare_stacks(exp, sss);
    }
    sdsl::remove(file_name);
}



}  // namespace

int main(int argc, char** argv)
{
    ::testing::InitGoogleTest(&argc, argv);
    if (argc < 2) {
        // LCOV_EXCL_START
        std::cout << "Usage: " << argv[0] << " tmp_dir" << std::endl;
        return 1;
        // LCOV_EXCL_STOP
    }
    temp_dir = argv[1];
    return RUN_ALL_TESTS();
}