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

#include "lix/libutil/linear-map.hh"

#include <gtest/gtest.h>

namespace nix {
    TEST(LinearMap, Insert) {
        LinearMap<size_t, int> map;
        ASSERT_EQ(map.insert_or_assign(1, 1).second, false);
        ASSERT_EQ(map.insert_or_assign(3, 5).second, false);
        ASSERT_EQ(map.insert_or_assign(2, 2).second, false);
        ASSERT_EQ(map.insert_or_assign(3, 3).second, true);
        ASSERT_EQ(map.insert_or_assign(4, 4).second, false);

        ASSERT_EQ(map.size(), 4);
        ASSERT_EQ(map.begin()[0], std::pair((size_t) 1, 1));
        ASSERT_EQ(map.begin()[1], std::pair((size_t) 2, 2));
        ASSERT_EQ(map.begin()[2], std::pair((size_t) 3, 3));
        ASSERT_EQ(map.begin()[3], std::pair((size_t) 4, 4));
    }

    TEST(LinearMap, InsertRangeSorted) {
        LinearMap<size_t, int> map;
        std::map<int, int> items = {
            {3, 3},
            {2, 2},
            {1, 1},
            {4, 4},
        };
        map.insert_range_sorted(std::begin(items), std::end(items));

        ASSERT_EQ(map.size(), 4);
        ASSERT_EQ(map.begin()[0], std::pair((size_t) 1, 1));
        ASSERT_EQ(map.begin()[1], std::pair((size_t) 2, 2));
        ASSERT_EQ(map.begin()[2], std::pair((size_t) 3, 3));
        ASSERT_EQ(map.begin()[3], std::pair((size_t) 4, 4));
    }

    TEST(LinearMap, InsertRangeUnsorted) {
        LinearMap<size_t, int> map;
        std::vector<std::pair<int, int>> items = {
            {3, 3},
            {2, 2},
            {1, 1},
            {4, 4},
        };
        map.insert_range(std::begin(items), std::end(items));

        ASSERT_EQ(map.size(), 4);
        ASSERT_EQ(map.begin()[0], std::pair((size_t) 1, 1));
        ASSERT_EQ(map.begin()[1], std::pair((size_t) 2, 2));
        ASSERT_EQ(map.begin()[2], std::pair((size_t) 3, 3));
        ASSERT_EQ(map.begin()[3], std::pair((size_t) 4, 4));
    }

    TEST(LinearMap, InsertRangeDuplicates) {
        LinearMap<size_t, int> map;
        map.insert_or_assign(2, 5);
        std::vector<std::pair<int, int>> items = {
            {3, 3},
            {2, 2},
            {1, 1},
            {4, 4},
        };
        map.insert_range(std::begin(items), std::end(items));

        ASSERT_EQ(map.size(), 4);
        ASSERT_EQ(map.begin()[0], std::pair((size_t) 1, 1));
        ASSERT_EQ(map.begin()[1], std::pair((size_t) 2, 2));
        ASSERT_EQ(map.begin()[2], std::pair((size_t) 3, 3));
        ASSERT_EQ(map.begin()[3], std::pair((size_t) 4, 4));
    }
}