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
|
//===- llvm/unittest/ADT/DenseMapMap.cpp - DenseMap unit tests --*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include "gtest/gtest.h"
#include "llvm/ADT/DenseMap.h"
using namespace llvm;
namespace {
// Test fixture
class DenseMapTest : public testing::Test {
protected:
DenseMap<uint32_t, uint32_t> uintMap;
DenseMap<uint32_t *, uint32_t *> uintPtrMap;
uint32_t dummyInt;
};
// Empty map tests
TEST_F(DenseMapTest, EmptyIntMapTest) {
// Size tests
EXPECT_EQ(0u, uintMap.size());
EXPECT_TRUE(uintMap.empty());
// Iterator tests
EXPECT_TRUE(uintMap.begin() == uintMap.end());
// Lookup tests
EXPECT_FALSE(uintMap.count(0u));
EXPECT_TRUE(uintMap.find(0u) == uintMap.end());
EXPECT_EQ(0u, uintMap.lookup(0u));
}
// Empty map tests for pointer map
TEST_F(DenseMapTest, EmptyPtrMapTest) {
// Size tests
EXPECT_EQ(0u, uintPtrMap.size());
EXPECT_TRUE(uintPtrMap.empty());
// Iterator tests
EXPECT_TRUE(uintPtrMap.begin() == uintPtrMap.end());
// Lookup tests
EXPECT_FALSE(uintPtrMap.count(&dummyInt));
EXPECT_TRUE(uintPtrMap.find(&dummyInt) == uintPtrMap.begin());
EXPECT_EQ(0, uintPtrMap.lookup(&dummyInt));
}
// Constant map tests
TEST_F(DenseMapTest, ConstEmptyMapTest) {
const DenseMap<uint32_t, uint32_t> & constUintMap = uintMap;
const DenseMap<uint32_t *, uint32_t *> & constUintPtrMap = uintPtrMap;
EXPECT_EQ(0u, constUintMap.size());
EXPECT_EQ(0u, constUintPtrMap.size());
EXPECT_TRUE(constUintMap.empty());
EXPECT_TRUE(constUintPtrMap.empty());
EXPECT_TRUE(constUintMap.begin() == constUintMap.end());
EXPECT_TRUE(constUintPtrMap.begin() == constUintPtrMap.end());
}
// A map with a single entry
TEST_F(DenseMapTest, SingleEntryMapTest) {
uintMap[0] = 1;
// Size tests
EXPECT_EQ(1u, uintMap.size());
EXPECT_FALSE(uintMap.begin() == uintMap.end());
EXPECT_FALSE(uintMap.empty());
// Iterator tests
DenseMap<uint32_t, uint32_t>::iterator it = uintMap.begin();
EXPECT_EQ(0u, it->first);
EXPECT_EQ(1u, it->second);
++it;
EXPECT_TRUE(it == uintMap.end());
// Lookup tests
EXPECT_TRUE(uintMap.count(0u));
EXPECT_TRUE(uintMap.find(0u) == uintMap.begin());
EXPECT_EQ(1u, uintMap.lookup(0u));
EXPECT_EQ(1u, uintMap[0]);
}
// Test clear() method
TEST_F(DenseMapTest, ClearTest) {
uintMap[0] = 1;
uintMap.clear();
EXPECT_EQ(0u, uintMap.size());
EXPECT_TRUE(uintMap.empty());
EXPECT_TRUE(uintMap.begin() == uintMap.end());
}
// Test erase(iterator) method
TEST_F(DenseMapTest, EraseTest) {
uintMap[0] = 1;
uintMap.erase(uintMap.begin());
EXPECT_EQ(0u, uintMap.size());
EXPECT_TRUE(uintMap.empty());
EXPECT_TRUE(uintMap.begin() == uintMap.end());
}
// Test erase(value) method
TEST_F(DenseMapTest, EraseTest2) {
uintMap[0] = 1;
uintMap.erase(0);
EXPECT_EQ(0u, uintMap.size());
EXPECT_TRUE(uintMap.empty());
EXPECT_TRUE(uintMap.begin() == uintMap.end());
}
// Test insert() method
TEST_F(DenseMapTest, InsertTest) {
uintMap.insert(std::make_pair(0u, 1u));
EXPECT_EQ(1u, uintMap.size());
EXPECT_EQ(1u, uintMap[0]);
}
// Test copy constructor method
TEST_F(DenseMapTest, CopyConstructorTest) {
uintMap[0] = 1;
DenseMap<uint32_t, uint32_t> copyMap(uintMap);
EXPECT_EQ(1u, copyMap.size());
EXPECT_EQ(1u, copyMap[0]);
}
// Test assignment operator method
TEST_F(DenseMapTest, AssignmentTest) {
uintMap[0] = 1;
DenseMap<uint32_t, uint32_t> copyMap = uintMap;
EXPECT_EQ(1u, copyMap.size());
EXPECT_EQ(1u, copyMap[0]);
}
// A more complex iteration test
TEST_F(DenseMapTest, IterationTest) {
bool visited[100];
// Insert 100 numbers into the map
for (int i = 0; i < 100; ++i) {
visited[i] = false;
uintMap[i] = 3;
}
// Iterate over all numbers and mark each one found.
for (DenseMap<uint32_t, uint32_t>::iterator it = uintMap.begin();
it != uintMap.end(); ++it) {
visited[it->first] = true;
}
// Ensure every number was visited.
for (int i = 0; i < 100; ++i) {
ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
}
}
}
|
