summaryrefslogtreecommitdiff
path: root/AK/Tests
diff options
context:
space:
mode:
authorBrian Gianforcaro <b.gianfo@gmail.com>2021-04-19 22:47:06 -0700
committerLinus Groh <mail@linusgroh.de>2021-04-21 19:31:49 +0200
commit0e63a7255e046d5ad7f9ecd8ca0a01126fcf108a (patch)
tree8b5e7fc492ba7d59351349040729152223304dde /AK/Tests
parent3f02742504500b84fcfcbdd11383225d381d404f (diff)
downloadserenity-0e63a7255e046d5ad7f9ecd8ca0a01126fcf108a.zip
AK: Add some initial unit tests for AK::IntrusiveList
Diffstat (limited to 'AK/Tests')
-rw-r--r--AK/Tests/CMakeLists.txt1
-rw-r--r--AK/Tests/TestIntrusiveList.cpp76
2 files changed, 77 insertions, 0 deletions
diff --git a/AK/Tests/CMakeLists.txt b/AK/Tests/CMakeLists.txt
index e6a583fef5..ef4ceac2f7 100644
--- a/AK/Tests/CMakeLists.txt
+++ b/AK/Tests/CMakeLists.txt
@@ -27,6 +27,7 @@ set(AK_TEST_SOURCES
TestHex.cpp
TestIPv4Address.cpp
TestIndexSequence.cpp
+ TestIntrusiveList.cpp
TestIntrusiveRedBlackTree.cpp
TestJSON.cpp
TestLexicalPath.cpp
diff --git a/AK/Tests/TestIntrusiveList.cpp b/AK/Tests/TestIntrusiveList.cpp
new file mode 100644
index 0000000000..1c8f9ba687
--- /dev/null
+++ b/AK/Tests/TestIntrusiveList.cpp
@@ -0,0 +1,76 @@
+/*
+ * Copyright (c) 2021, Brian Gianforcaro <b.gianfo@gmail.com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice, this
+ * list of conditions and the following disclaimer.
+ *
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ * this list of conditions and the following disclaimer in the documentation
+ * and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <AK/TestSuite.h>
+
+#include <AK/IntrusiveList.h>
+#include <AK/NonnullOwnPtrVector.h>
+#include <AK/Random.h>
+
+class IntrusiveTestItem {
+public:
+ IntrusiveTestItem() = default;
+
+ IntrusiveListNode<IntrusiveTestItem> m_list_node;
+};
+
+using IntrusiveTestList = IntrusiveList<IntrusiveTestItem, RawPtr<IntrusiveTestItem>, &IntrusiveTestItem::m_list_node>;
+
+TEST_CASE(construct)
+{
+ IntrusiveTestList empty;
+ EXPECT(empty.is_empty());
+}
+
+TEST_CASE(insert)
+{
+ IntrusiveTestList list;
+ list.append(*new IntrusiveTestItem());
+
+ EXPECT(!list.is_empty());
+
+ delete list.take_last();
+}
+
+TEST_CASE(enumeration)
+{
+ constexpr size_t expected_size = 10;
+ IntrusiveTestList list;
+ for (size_t i = 0; i < expected_size; i++) {
+ list.append(*new IntrusiveTestItem());
+ }
+
+ size_t actual_size = 0;
+ for (auto& elem : list) {
+ actual_size++;
+ }
+ EXPECT_EQ(expected_size, actual_size);
+ while (auto elem = list.take_first()) {
+ delete elem;
+ }
+}
+
+TEST_MAIN(IntrusiveList)