Kristof Umann | 8ed38f2 | 2018-08-13 17:32:48 +0000 | [diff] [blame] | 1 | //===--------- ImmutableListTest.cpp - ImmutableList unit tests --*- C++ -*-==// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. Lee LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | #include "llvm/ADT/ImmutableList.h" |
| 11 | #include "gtest/gtest.h" |
| 12 | |
| 13 | using namespace llvm; |
| 14 | |
| 15 | namespace { |
| 16 | |
| 17 | template <typename Fundamental> struct Wrapper : llvm::FoldingSetNode { |
| 18 | Fundamental F; |
| 19 | |
| 20 | Wrapper(Fundamental F) : F(F) {} |
| 21 | |
| 22 | operator Fundamental() const { return F; } |
| 23 | |
| 24 | void Profile(FoldingSetNodeID &ID) const { ID.AddInteger(F); } |
| 25 | }; |
| 26 | |
| 27 | class ImmutableListTest : public testing::Test {}; |
| 28 | |
| 29 | void concat(const ImmutableList<Wrapper<char>> &L, char *Buffer) { |
| 30 | int Index = 0; |
| 31 | for (ImmutableList<Wrapper<char>>::iterator It = L.begin(), End = L.end(); |
| 32 | It != End; ++It) { |
| 33 | Buffer[Index++] = *It; |
| 34 | } |
| 35 | Buffer[Index] = '\0'; |
| 36 | } |
| 37 | |
| 38 | TEST_F(ImmutableListTest, EmptyIntListTest) { |
| 39 | ImmutableList<Wrapper<int>>::Factory f; |
| 40 | |
| 41 | EXPECT_TRUE(f.getEmptyList() == f.getEmptyList()); |
| 42 | EXPECT_TRUE(f.getEmptyList().isEqual(f.getEmptyList())); |
| 43 | EXPECT_TRUE(f.getEmptyList().isEmpty()); |
| 44 | |
| 45 | ImmutableList<Wrapper<int>> L = f.getEmptyList(); |
| 46 | EXPECT_EQ(nullptr, L.getTail().getInternalPointer()); |
| 47 | EXPECT_TRUE(L.getTail().isEmpty()); |
| 48 | EXPECT_TRUE(L.begin() == L.end()); |
| 49 | } |
| 50 | |
| 51 | TEST_F(ImmutableListTest, OneElemIntListTest) { |
| 52 | ImmutableList<Wrapper<int>>::Factory f; |
| 53 | ImmutableList<Wrapper<int>> L = f.getEmptyList(); |
| 54 | |
| 55 | ImmutableList<Wrapper<int>> L2 = f.add(3, L); |
| 56 | EXPECT_TRUE(L.isEmpty()); |
| 57 | EXPECT_FALSE(L2.isEmpty()); |
| 58 | EXPECT_TRUE(L2.getTail().isEmpty()); |
| 59 | |
| 60 | EXPECT_FALSE(L == L2); |
| 61 | EXPECT_TRUE(L == L2.getTail()); |
| 62 | EXPECT_FALSE(L.isEqual(L2)); |
| 63 | EXPECT_TRUE(L.isEqual(L2.getTail())); |
| 64 | EXPECT_FALSE(L2.begin() == L2.end()); |
| 65 | EXPECT_TRUE(L2.begin() != L2.end()); |
| 66 | |
| 67 | EXPECT_FALSE(L.contains(3)); |
| 68 | EXPECT_EQ(3, L2.getHead()); |
| 69 | EXPECT_TRUE(L2.contains(3)); |
| 70 | |
| 71 | ImmutableList<Wrapper<int>> L3 = f.add(2, L); |
| 72 | EXPECT_TRUE(L.isEmpty()); |
| 73 | EXPECT_FALSE(L3.isEmpty()); |
| 74 | EXPECT_FALSE(L == L3); |
| 75 | EXPECT_FALSE(L.contains(2)); |
| 76 | EXPECT_TRUE(L3.contains(2)); |
| 77 | EXPECT_EQ(2, L3.getHead()); |
| 78 | |
| 79 | EXPECT_FALSE(L2 == L3); |
| 80 | EXPECT_FALSE(L2.contains(2)); |
| 81 | } |
| 82 | |
| 83 | TEST_F(ImmutableListTest, CreatingIntListTest) { |
| 84 | ImmutableList<Wrapper<int>>::Factory f; |
| 85 | |
| 86 | ImmutableList<Wrapper<int>> L = f.getEmptyList(); |
| 87 | ImmutableList<Wrapper<int>> L2 = f.create(3); |
| 88 | |
| 89 | EXPECT_FALSE(L2.isEmpty()); |
| 90 | EXPECT_TRUE(L2.getTail().isEmpty()); |
| 91 | EXPECT_EQ(3, L2.getHead()); |
| 92 | EXPECT_TRUE(L.isEqual(L2.getTail())); |
| 93 | EXPECT_TRUE(L2.getTail().isEqual(L)); |
| 94 | } |
| 95 | |
| 96 | TEST_F(ImmutableListTest, MultiElemIntListTest) { |
| 97 | ImmutableList<Wrapper<int>>::Factory f; |
| 98 | |
| 99 | ImmutableList<Wrapper<int>> L = f.getEmptyList(); |
| 100 | ImmutableList<Wrapper<int>> L2 = f.add(5, f.add(4, f.add(3, L))); |
| 101 | ImmutableList<Wrapper<int>> L3 = f.add(43, f.add(20, f.add(9, L2))); |
| 102 | ImmutableList<Wrapper<int>> L4 = f.add(9, L2); |
| 103 | ImmutableList<Wrapper<int>> L5 = f.add(9, L2); |
| 104 | |
| 105 | EXPECT_TRUE(L.isEmpty()); |
| 106 | EXPECT_FALSE(L2.isEmpty()); |
| 107 | EXPECT_FALSE(L3.isEmpty()); |
| 108 | EXPECT_FALSE(L4.isEmpty()); |
| 109 | |
| 110 | EXPECT_FALSE(L.contains(3)); |
| 111 | EXPECT_FALSE(L.contains(9)); |
| 112 | |
| 113 | EXPECT_TRUE(L2.contains(3)); |
| 114 | EXPECT_TRUE(L2.contains(4)); |
| 115 | EXPECT_TRUE(L2.contains(5)); |
| 116 | EXPECT_FALSE(L2.contains(9)); |
| 117 | EXPECT_FALSE(L2.contains(0)); |
| 118 | |
| 119 | EXPECT_EQ(5, L2.getHead()); |
| 120 | EXPECT_EQ(4, L2.getTail().getHead()); |
| 121 | EXPECT_EQ(3, L2.getTail().getTail().getHead()); |
| 122 | |
| 123 | EXPECT_TRUE(L3.contains(43)); |
| 124 | EXPECT_TRUE(L3.contains(20)); |
| 125 | EXPECT_TRUE(L3.contains(9)); |
| 126 | EXPECT_TRUE(L3.contains(3)); |
| 127 | EXPECT_TRUE(L3.contains(4)); |
| 128 | EXPECT_TRUE(L3.contains(5)); |
| 129 | EXPECT_FALSE(L3.contains(0)); |
| 130 | |
| 131 | EXPECT_EQ(43, L3.getHead()); |
| 132 | EXPECT_EQ(20, L3.getTail().getHead()); |
| 133 | EXPECT_EQ(9, L3.getTail().getTail().getHead()); |
| 134 | |
| 135 | EXPECT_TRUE(L3.getTail().getTail().getTail() == L2); |
| 136 | EXPECT_TRUE(L2 == L3.getTail().getTail().getTail()); |
| 137 | EXPECT_TRUE(L3.getTail().getTail().getTail().isEqual(L2)); |
| 138 | EXPECT_TRUE(L2.isEqual(L3.getTail().getTail().getTail())); |
| 139 | |
| 140 | EXPECT_TRUE(L4.contains(9)); |
| 141 | EXPECT_TRUE(L4.contains(3)); |
| 142 | EXPECT_TRUE(L4.contains(4)); |
| 143 | EXPECT_TRUE(L4.contains(5)); |
| 144 | EXPECT_FALSE(L4.contains(20)); |
| 145 | EXPECT_FALSE(L4.contains(43)); |
| 146 | EXPECT_TRUE(L4.isEqual(L4)); |
| 147 | EXPECT_TRUE(L4.isEqual(L5)); |
| 148 | |
| 149 | EXPECT_TRUE(L5.isEqual(L4)); |
| 150 | EXPECT_TRUE(L5.isEqual(L5)); |
| 151 | } |
| 152 | |
Kristof Umann | d020239 | 2018-08-28 14:17:51 +0000 | [diff] [blame^] | 153 | template <typename Fundamental> |
| 154 | struct ExplicitCtorWrapper : public Wrapper<Fundamental> { |
| 155 | explicit ExplicitCtorWrapper(Fundamental F) : Wrapper<Fundamental>(F) {} |
| 156 | ExplicitCtorWrapper(const ExplicitCtorWrapper &) = delete; |
| 157 | ExplicitCtorWrapper(ExplicitCtorWrapper &&) = default; |
| 158 | ExplicitCtorWrapper &operator=(const ExplicitCtorWrapper &) = delete; |
| 159 | ExplicitCtorWrapper &operator=(ExplicitCtorWrapper &&) = default; |
| 160 | }; |
| 161 | |
| 162 | TEST_F(ImmutableListTest, EmplaceIntListTest) { |
| 163 | ImmutableList<ExplicitCtorWrapper<int>>::Factory f; |
| 164 | |
| 165 | ImmutableList<ExplicitCtorWrapper<int>> L = f.getEmptyList(); |
| 166 | ImmutableList<ExplicitCtorWrapper<int>> L2 = f.emplace(L, 3); |
| 167 | |
| 168 | ImmutableList<ExplicitCtorWrapper<int>> L3 = |
| 169 | f.add(ExplicitCtorWrapper<int>(2), L2); |
| 170 | |
| 171 | ImmutableList<ExplicitCtorWrapper<int>> L4 = |
| 172 | f.emplace(L3, ExplicitCtorWrapper<int>(1)); |
| 173 | |
| 174 | ImmutableList<ExplicitCtorWrapper<int>> L5 = |
| 175 | f.add(ExplicitCtorWrapper<int>(1), L3); |
| 176 | |
| 177 | EXPECT_FALSE(L2.isEmpty()); |
| 178 | EXPECT_TRUE(L2.getTail().isEmpty()); |
| 179 | EXPECT_EQ(3, L2.getHead()); |
| 180 | EXPECT_TRUE(L.isEqual(L2.getTail())); |
| 181 | EXPECT_TRUE(L2.getTail().isEqual(L)); |
| 182 | |
| 183 | EXPECT_FALSE(L3.isEmpty()); |
| 184 | EXPECT_FALSE(L2 == L3); |
| 185 | EXPECT_EQ(2, L3.getHead()); |
| 186 | EXPECT_TRUE(L2 == L3.getTail()); |
| 187 | |
| 188 | EXPECT_FALSE(L4.isEmpty()); |
| 189 | EXPECT_EQ(1, L4.getHead()); |
| 190 | EXPECT_TRUE(L3 == L4.getTail()); |
| 191 | |
| 192 | EXPECT_TRUE(L4 == L5); |
| 193 | EXPECT_TRUE(L3 == L5.getTail()); |
| 194 | } |
| 195 | |
Kristof Umann | 8ed38f2 | 2018-08-13 17:32:48 +0000 | [diff] [blame] | 196 | TEST_F(ImmutableListTest, CharListOrderingTest) { |
| 197 | ImmutableList<Wrapper<char>>::Factory f; |
| 198 | ImmutableList<Wrapper<char>> L = f.getEmptyList(); |
| 199 | |
| 200 | ImmutableList<Wrapper<char>> L2 = f.add('i', f.add('e', f.add('a', L))); |
| 201 | ImmutableList<Wrapper<char>> L3 = f.add('u', f.add('o', L2)); |
| 202 | |
| 203 | char Buffer[10]; |
| 204 | concat(L3, Buffer); |
| 205 | |
| 206 | ASSERT_STREQ("uoiea", Buffer); |
| 207 | } |
| 208 | |
| 209 | TEST_F(ImmutableListTest, LongListOrderingTest) { |
| 210 | ImmutableList<Wrapper<long>>::Factory f; |
| 211 | ImmutableList<Wrapper<long>> L = f.getEmptyList(); |
| 212 | |
| 213 | ImmutableList<Wrapper<long>> L2 = f.add(3, f.add(4, f.add(5, L))); |
| 214 | ImmutableList<Wrapper<long>> L3 = f.add(0, f.add(1, f.add(2, L2))); |
| 215 | |
| 216 | int i = 0; |
| 217 | for (ImmutableList<Wrapper<long>>::iterator I = L.begin(), E = L.end(); |
| 218 | I != E; ++I) { |
| 219 | ASSERT_EQ(i, *I); |
| 220 | i++; |
| 221 | } |
| 222 | ASSERT_EQ(0, i); |
| 223 | |
| 224 | i = 3; |
| 225 | for (ImmutableList<Wrapper<long>>::iterator I = L2.begin(), E = L2.end(); |
| 226 | I != E; ++I) { |
| 227 | ASSERT_EQ(i, *I); |
| 228 | i++; |
| 229 | } |
| 230 | ASSERT_EQ(6, i); |
| 231 | |
| 232 | i = 0; |
| 233 | for (ImmutableList<Wrapper<long>>::iterator I = L3.begin(), E = L3.end(); |
| 234 | I != E; ++I) { |
| 235 | ASSERT_EQ(i, *I); |
| 236 | i++; |
| 237 | } |
| 238 | ASSERT_EQ(6, i); |
| 239 | } |
| 240 | |
| 241 | } // namespace |