AK: Use a SinglyLinkedList<T> as HashTable's bucket chain storage.

We were using a DoublyLinkedList<T> simply because it supported remove().
This patch consolidates the SinglyLinkedList iterators and adds remove().

1 files changed, 8 insertions, 0 deletions

diff --git a/AK/Tests/TestHashMap.cpp b/AK/Tests/TestHashMap.cpp
index f3ec4cd9de..0820cd9c42 100644
--- a/AK/Tests/TestHashMap.cpp
+++ b/AK/Tests/TestHashMap.cpp
@@ -23,6 +23,14 @@ int main()
         ++loop_counter;
     }
 
+    number_to_string.remove(1);
+    EXPECT_EQ(number_to_string.size(), 2);
+    EXPECT(number_to_string.find(1) == number_to_string.end());
+
+    number_to_string.remove(3);
+    EXPECT_EQ(number_to_string.size(), 1);
+    EXPECT(number_to_string.find(3) == number_to_string.end());
+
     EXPECT_EQ(loop_counter, 3);
     return 0;
 }