0ct0pu5/ladybird
1
0
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2024-12-12 01:10:42 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 7

AK: Add HashMap::remove_all_matching(predicate)

Browse source 
This removes all matching entries from a hash map in a single pass.
This commit is contained in:
Andreas Kling 2022-01-05 16:53:24 +01:00
parent e08d325124
commit 376e5ef912
Notes: sideshowbarker 2024-07-17 21:35:21 +09:00 
Author: https://github.com/awesomekling
Commit: https://github.com/SerenityOS/serenity/commit/376e5ef9125
2 changed files with 37 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
AK/HashMap.h
View file

@ -74,6 +74,17 @@ public:
return false;
}
template<typename TUnaryPredicate>
void remove_all_matching(TUnaryPredicate predicate)
{
for (auto it = begin(); it != end();) {
if (predicate(it->key, it->value))
it = remove(it);
else
++it;
}
}
using HashTableType = HashTable<Entry, EntryTraits, IsOrdered>;
using IteratorType = typename HashTableType::Iterator;
using ConstIteratorType = typename HashTableType::ConstIterator;
@ -180,9 +191,9 @@ public:
return find(value) != end();
}
void remove(IteratorType it)
IteratorType remove(IteratorType it)
{
m_table.remove(it);
return m_table.remove(it);
}
V& ensure(const K& key)

24
Tests/AK/TestHashMap.cpp
View file

@ -71,6 +71,30 @@ TEST_CASE(map_remove)
EXPECT(number_to_string.find(2) != number_to_string.end());
}
TEST_CASE(remove_all_matching)
{
HashMap<int, String> map;
map.set(1, "One");
map.set(2, "Two");
map.set(3, "Three");
map.set(4, "Four");
EXPECT_EQ(map.size(), 4u);
map.remove_all_matching([&](int key, String const& value) {
return key == 1 || value == "Two";
});
EXPECT_EQ(map.size(), 2u);
EXPECT(map.contains(3));
EXPECT(map.contains(4));
map.remove_all_matching([&](int, String const&) { return true; });
EXPECT(map.is_empty());
}
TEST_CASE(case_insensitive)
{
HashMap<String, int, CaseInsensitiveStringTraits> casemap;