ext_sort/ext_sort_ut.cpp at master · antonovvk/ext_sort · GitHub

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
#include "gtest/gtest.h"
#include "sorter.h"

using namespace std;

TEST(Basic, ArithmeticInMem) {
    vector<int> canon;
    ext_sort::Sorter<int, ext_sort::ArithmeticTraits<int>> sorter(1024, "./ut");

    for (size_t i = 0; i < 100; ++i) {
        canon.push_back(i % 13);
        sorter.Add(i % 13);
    }

    size_t idx = 0;
    sort(canon.begin(), canon.end());
    for (auto val: sorter) {
        //~ cerr << val << endl;
        EXPECT_EQ(val, canon[idx]);
        ++idx;
    }

    EXPECT_EQ(idx, canon.size());
}

TEST(Basic, ArithmeticOffMem) {
    vector<int> canon;
    ext_sort::Sorter<int, ext_sort::ArithmeticTraits<int>> sorter(1024, "./ut");

    for (size_t i = 0; i < 100000; ++i) {
        canon.push_back(i % 13);
        sorter.Add(i % 13);
    }
    sort(canon.begin(), canon.end());

    size_t idx = 0;
    for (auto val: sorter) {
        //~ cerr << val << endl;
        EXPECT_EQ(val, canon[idx]);
        ++idx;
    }

    EXPECT_EQ(idx, canon.size());
}

TEST(Basic, RestartOffMem) {
    vector<int> canon;
    ext_sort::Sorter<int, ext_sort::ArithmeticTraits<int>> sorter(1024, "./ut");

    for (size_t i = 0; i < 100000; ++i) {
        canon.push_back(i % 13);
        sorter.Add(i % 13);
    }
    sort(canon.begin(), canon.end());

    size_t idx = 0;
    for (auto val: sorter) {
        //~ cerr << val << endl;
        EXPECT_EQ(val, canon[idx]);
        ++idx;
    }

    EXPECT_EQ(idx, canon.size());

    idx = 0;
    for (auto val: sorter) {
        //~ cerr << val << endl;
        EXPECT_EQ(val, canon[idx]);
        ++idx;
    }

    EXPECT_EQ(idx, canon.size());
}