mirror of
https://github.com/SerenityOS/serenity.git
synced 2025-01-24 18:32:28 -05:00
73fdbba59c
This was a workaround to be able to build on case-insensitive file systems where it might get confused about <string.h> vs <String.h>. Let's just not support building that way, so String.h can have an objectively nicer name. :^)
108 lines
2.6 KiB
C++
108 lines
2.6 KiB
C++
#include <AK/TestSuite.h>
|
|
|
|
#include <AK/String.h>
|
|
#include <AK/HashMap.h>
|
|
|
|
TEST_CASE(construct)
|
|
{
|
|
typedef HashMap<int, int> IntIntMap;
|
|
EXPECT(IntIntMap().is_empty());
|
|
EXPECT_EQ(IntIntMap().size(), 0);
|
|
}
|
|
|
|
TEST_CASE(populate)
|
|
{
|
|
HashMap<int, String> number_to_string;
|
|
number_to_string.set(1, "One");
|
|
number_to_string.set(2, "Two");
|
|
number_to_string.set(3, "Three");
|
|
|
|
EXPECT_EQ(number_to_string.is_empty(), false);
|
|
EXPECT_EQ(number_to_string.size(), 3);
|
|
}
|
|
|
|
TEST_CASE(range_loop)
|
|
{
|
|
HashMap<int, String> number_to_string;
|
|
number_to_string.set(1, "One");
|
|
number_to_string.set(2, "Two");
|
|
number_to_string.set(3, "Three");
|
|
|
|
int loop_counter = 0;
|
|
for (auto& it : number_to_string) {
|
|
EXPECT_EQ(it.value.is_null(), false);
|
|
++loop_counter;
|
|
}
|
|
EXPECT_EQ(loop_counter, 3);
|
|
}
|
|
|
|
TEST_CASE(map_remove)
|
|
{
|
|
HashMap<int, String> number_to_string;
|
|
number_to_string.set(1, "One");
|
|
number_to_string.set(2, "Two");
|
|
number_to_string.set(3, "Three");
|
|
|
|
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(number_to_string.find(2) != number_to_string.end());
|
|
}
|
|
|
|
TEST_CASE(case_insensitive)
|
|
{
|
|
HashMap<String, int, CaseInsensitiveStringTraits> casemap;
|
|
EXPECT_EQ(String("nickserv").to_lowercase(), String("NickServ").to_lowercase());
|
|
casemap.set("nickserv", 3);
|
|
casemap.set("NickServ", 3);
|
|
EXPECT_EQ(casemap.size(), 1);
|
|
}
|
|
|
|
TEST_CASE(assert_on_iteration_during_clear)
|
|
{
|
|
struct Object {
|
|
~Object()
|
|
{
|
|
m_map->begin();
|
|
}
|
|
HashMap<int, Object>* m_map;
|
|
};
|
|
HashMap<int, Object> map;
|
|
map.set(0, { &map });
|
|
map.clear();
|
|
}
|
|
|
|
TEST_CASE(hashmap_of_nonnullownptr_get)
|
|
{
|
|
struct Object {
|
|
Object(const String& s) : string(s) {}
|
|
String string;
|
|
};
|
|
|
|
HashMap<int, NonnullOwnPtr<Object>> objects;
|
|
objects.set(1, make<Object>("One"));
|
|
objects.set(2, make<Object>("Two"));
|
|
objects.set(3, make<Object>("Three"));
|
|
|
|
{
|
|
auto x = objects.get(2);
|
|
EXPECT_EQ(x.has_value(), true);
|
|
EXPECT_EQ(x.value()->string, "Two");
|
|
}
|
|
|
|
{
|
|
// Do it again to make sure that peeking into the map above didn't
|
|
// remove the value from the map.
|
|
auto x = objects.get(2);
|
|
EXPECT_EQ(x.has_value(), true);
|
|
EXPECT_EQ(x.value()->string, "Two");
|
|
}
|
|
|
|
EXPECT_EQ(objects.size(), 3);
|
|
}
|
|
|
|
TEST_MAIN(HashMap)
|