|
12 | 12 |
|
13 | 13 | #include "llvm/ADT/SmallSet.h"
|
14 | 14 | #include "llvm/ADT/STLExtras.h"
|
| 15 | +#include "gmock/gmock.h" |
15 | 16 | #include "gtest/gtest.h"
|
16 | 17 | #include <string>
|
17 | 18 |
|
18 | 19 | using namespace llvm;
|
19 | 20 |
|
20 | 21 | TEST(SmallSetTest, ConstructorIteratorPair) {
|
21 |
| - auto L = {1, 2, 3, 4, 5}; |
| 22 | + std::initializer_list<int> L = {1, 2, 3, 4, 5}; |
22 | 23 | SmallSet<int, 4> S(std::begin(L), std::end(L));
|
23 |
| - for (int Value : L) |
24 |
| - EXPECT_TRUE(S.contains(Value)); |
| 24 | + EXPECT_THAT(S, testing::UnorderedElementsAreArray(L)); |
25 | 25 | }
|
26 | 26 |
|
27 | 27 | TEST(SmallSet, ConstructorRange) {
|
28 |
| - auto L = {1, 2, 3, 4, 5}; |
| 28 | + std::initializer_list<int> L = {1, 2, 3, 4, 5}; |
29 | 29 |
|
30 | 30 | SmallSet<int, 4> S(llvm::make_range(std::begin(L), std::end(L)));
|
31 |
| - for (int Value : L) |
32 |
| - EXPECT_TRUE(S.contains(Value)); |
| 31 | + EXPECT_THAT(S, testing::UnorderedElementsAreArray(L)); |
33 | 32 | }
|
34 | 33 |
|
35 | 34 | TEST(SmallSet, ConstructorInitializerList) {
|
36 |
| - auto L = {1, 2, 3, 4, 5}; |
| 35 | + std::initializer_list<int> L = {1, 2, 3, 4, 5}; |
37 | 36 | SmallSet<int, 4> S = {1, 2, 3, 4, 5};
|
38 |
| - for (int Value : L) |
39 |
| - EXPECT_TRUE(S.contains(Value)); |
| 37 | + EXPECT_THAT(S, testing::UnorderedElementsAreArray(L)); |
40 | 38 | }
|
41 | 39 |
|
42 | 40 | TEST(SmallSet, CopyConstructor) {
|
43 | 41 | SmallSet<int, 4> S = {1, 2, 3};
|
44 | 42 | SmallSet<int, 4> T = S;
|
45 | 43 |
|
46 |
| - EXPECT_EQ(S, T); |
| 44 | + EXPECT_THAT(S, testing::ContainerEq(T)); |
47 | 45 | }
|
48 | 46 |
|
49 | 47 | TEST(SmallSet, MoveConstructor) {
|
50 |
| - auto L = {1, 2, 3}; |
| 48 | + std::initializer_list<int> L = {1, 2, 3}; |
51 | 49 | SmallSet<int, 4> S = L;
|
52 | 50 | SmallSet<int, 4> T = std::move(S);
|
53 | 51 |
|
54 |
| - EXPECT_TRUE(T.size() == L.size()); |
55 |
| - for (int Value : L) { |
56 |
| - EXPECT_TRUE(T.contains(Value)); |
57 |
| - } |
| 52 | + EXPECT_THAT(T, testing::UnorderedElementsAreArray(L)); |
58 | 53 | }
|
59 | 54 |
|
60 | 55 | TEST(SmallSet, CopyAssignment) {
|
61 | 56 | SmallSet<int, 4> S = {1, 2, 3};
|
62 | 57 | SmallSet<int, 4> T;
|
63 | 58 | T = S;
|
64 | 59 |
|
65 |
| - EXPECT_EQ(S, T); |
| 60 | + EXPECT_THAT(S, testing::ContainerEq(T)); |
66 | 61 | }
|
67 | 62 |
|
68 | 63 | TEST(SmallSet, MoveAssignment) {
|
69 |
| - auto L = {1, 2, 3}; |
| 64 | + std::initializer_list<int> L = {1, 2, 3}; |
70 | 65 | SmallSet<int, 4> S = L;
|
71 | 66 | SmallSet<int, 4> T;
|
72 | 67 | T = std::move(S);
|
73 | 68 |
|
74 |
| - EXPECT_TRUE(T.size() == L.size()); |
75 |
| - for (int Value : L) { |
76 |
| - EXPECT_TRUE(T.contains(Value)); |
77 |
| - } |
| 69 | + EXPECT_THAT(T, testing::UnorderedElementsAreArray(L)); |
78 | 70 | }
|
79 | 71 |
|
80 | 72 | TEST(SmallSetTest, Insert) {
|
|
0 commit comments