/* * Copyright (c) 2018-2020, Andreas Kling * * SPDX-License-Identifier: BSD-2-Clause */ #include #include #include #include #include TEST_CASE(construct) { using IntIntMap = HashMap; EXPECT(IntIntMap().is_empty()); EXPECT_EQ(IntIntMap().size(), 0u); } TEST_CASE(construct_from_initializer_list) { HashMap number_to_string { { 1, "One" }, { 2, "Two" }, { 3, "Three" }, }; EXPECT_EQ(number_to_string.is_empty(), false); EXPECT_EQ(number_to_string.size(), 3u); } TEST_CASE(populate) { HashMap 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(), 3u); } TEST_CASE(range_loop) { HashMap number_to_string; EXPECT_EQ(number_to_string.set(1, "One"), AK::HashSetResult::InsertedNewEntry); EXPECT_EQ(number_to_string.set(2, "Two"), AK::HashSetResult::InsertedNewEntry); EXPECT_EQ(number_to_string.set(3, "Three"), AK::HashSetResult::InsertedNewEntry); 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 number_to_string; EXPECT_EQ(number_to_string.set(1, "One"), AK::HashSetResult::InsertedNewEntry); EXPECT_EQ(number_to_string.set(2, "Two"), AK::HashSetResult::InsertedNewEntry); EXPECT_EQ(number_to_string.set(3, "Three"), AK::HashSetResult::InsertedNewEntry); EXPECT_EQ(number_to_string.remove(1), true); EXPECT_EQ(number_to_string.size(), 2u); EXPECT(number_to_string.find(1) == number_to_string.end()); EXPECT_EQ(number_to_string.remove(3), true); EXPECT_EQ(number_to_string.size(), 1u); EXPECT(number_to_string.find(3) == number_to_string.end()); EXPECT(number_to_string.find(2) != number_to_string.end()); } TEST_CASE(remove_all_matching) { HashMap map; map.set(1, "One"); map.set(2, "Two"); map.set(3, "Three"); map.set(4, "Four"); EXPECT_EQ(map.size(), 4u); EXPECT_EQ(map.remove_all_matching([&](int key, DeprecatedString const& value) { return key == 1 || value == "Two"; }), true); EXPECT_EQ(map.size(), 2u); EXPECT_EQ(map.remove_all_matching([&](int, DeprecatedString const&) { return false; }), false); EXPECT_EQ(map.size(), 2u); EXPECT(map.contains(3)); EXPECT(map.contains(4)); EXPECT_EQ(map.remove_all_matching([&](int, DeprecatedString const&) { return true; }), true); EXPECT_EQ(map.remove_all_matching([&](int, DeprecatedString const&) { return false; }), false); EXPECT(map.is_empty()); EXPECT_EQ(map.remove_all_matching([&](int, DeprecatedString const&) { return true; }), false); } TEST_CASE(case_insensitive) { HashMap casemap; EXPECT_EQ(DeprecatedString("nickserv").to_lowercase(), DeprecatedString("NickServ").to_lowercase()); EXPECT_EQ(casemap.set("nickserv", 3), AK::HashSetResult::InsertedNewEntry); EXPECT_EQ(casemap.set("NickServ", 3), AK::HashSetResult::ReplacedExistingEntry); EXPECT_EQ(casemap.size(), 1u); } TEST_CASE(case_insensitive_stringview) { HashMap casemap; EXPECT_EQ(casemap.set("nickserv"sv, 3), AK::HashSetResult::InsertedNewEntry); EXPECT_EQ(casemap.set("NickServ"sv, 3), AK::HashSetResult::ReplacedExistingEntry); EXPECT_EQ(casemap.size(), 1u); } TEST_CASE(hashmap_of_nonnullownptr_get) { struct Object { Object(DeprecatedString const& s) : string(s) { } DeprecatedString string; }; HashMap> objects; objects.set(1, make("One")); objects.set(2, make("Two")); objects.set(3, make("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(), 3u); } TEST_CASE(many_strings) { HashMap strings; for (int i = 0; i < 999; ++i) { EXPECT_EQ(strings.set(DeprecatedString::number(i), i), AK::HashSetResult::InsertedNewEntry); } EXPECT_EQ(strings.size(), 999u); for (auto& it : strings) { EXPECT_EQ(it.key.to_int().value(), it.value); } for (int i = 0; i < 999; ++i) { EXPECT_EQ(strings.remove(DeprecatedString::number(i)), true); } EXPECT_EQ(strings.is_empty(), true); } TEST_CASE(basic_remove) { HashMap map; map.set(1, 10); map.set(2, 20); map.set(3, 30); EXPECT_EQ(map.remove(3), true); EXPECT_EQ(map.remove(3), false); EXPECT_EQ(map.size(), 2u); EXPECT_EQ(map.remove(1), true); EXPECT_EQ(map.remove(1), false); EXPECT_EQ(map.size(), 1u); EXPECT_EQ(map.remove(2), true); EXPECT_EQ(map.remove(2), false); EXPECT_EQ(map.size(), 0u); } TEST_CASE(basic_contains) { HashMap map; map.set(1, 10); map.set(2, 20); map.set(3, 30); EXPECT_EQ(map.contains(1), true); EXPECT_EQ(map.contains(2), true); EXPECT_EQ(map.contains(3), true); EXPECT_EQ(map.contains(4), false); EXPECT_EQ(map.remove(3), true); EXPECT_EQ(map.contains(3), false); EXPECT_EQ(map.contains(1), true); EXPECT_EQ(map.contains(2), true); EXPECT_EQ(map.remove(2), true); EXPECT_EQ(map.contains(2), false); EXPECT_EQ(map.contains(3), false); EXPECT_EQ(map.contains(1), true); EXPECT_EQ(map.remove(1), true); EXPECT_EQ(map.contains(1), false); } TEST_CASE(in_place_rehashing_ordered_loop_bug) { OrderedHashMap map; map.set("yt.innertube::nextId", ""); map.set("yt.innertube::requests", ""); map.remove("yt.innertube::nextId"); map.set("yt.innertube::nextId", ""); VERIFY(map.keys().size() == 2); } TEST_CASE(take) { HashMap map; EXPECT(!map.take("foo"sv).has_value()); EXPECT(!map.take("bar"sv).has_value()); EXPECT(!map.take("baz"_short_string).has_value()); map.set("foo"_short_string, 1); map.set("bar"_short_string, 2); map.set("baz"_short_string, 3); auto foo = map.take("foo"sv); EXPECT_EQ(foo, 1); foo = map.take("foo"sv); EXPECT(!foo.has_value()); auto bar = map.take("bar"sv); EXPECT_EQ(bar, 2); bar = map.take("bar"sv); EXPECT(!bar.has_value()); auto baz = map.take("baz"_short_string); EXPECT_EQ(baz, 3); baz = map.take("baz"_short_string); EXPECT(!baz.has_value()); }