beenull/ladybird
1
0
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2024-11-25 00:50:22 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 7

HashTable: Rename finders with a more accurate and self-descripting name

Browse source
This commit is contained in:
ngc6302h 2021-07-12 23:23:08 +02:00 committed by Andreas Kling
parent de7831153f
commit 213e2af281
Notes: sideshowbarker 2024-07-18 09:08:21 +09:00 
Author: https://github.com/ngc6302h
Commit: https://github.com/SerenityOS/serenity/commit/213e2af281b
Pull-request: https://github.com/SerenityOS/serenity/pull/8701
1 changed files with 9 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
AK/HashTable.h
View file

@ -281,10 +281,10 @@ public:
return HashSetResult::InsertedNewEntry;
}
template<typename Finder>
Iterator find(unsigned hash, Finder finder)
template<typename TUnaryPredicate>
Iterator find(unsigned hash, TUnaryPredicate predicate)
{
return Iterator(lookup_with_hash(hash, move(finder)));
return Iterator(lookup_with_hash(hash, move(predicate)));
}
Iterator find(const T& value)
@ -292,10 +292,10 @@ public:
return find(TraitsForT::hash(value), [&](auto& other) { return TraitsForT::equals(value, other); });
}
template<typename Finder>
ConstIterator find(unsigned hash, Finder finder) const
template<typename TUnaryPredicate>
ConstIterator find(unsigned hash, TUnaryPredicate predicate) const
{
return ConstIterator(lookup_with_hash(hash, move(finder)));
return ConstIterator(lookup_with_hash(hash, move(predicate)));
}
ConstIterator find(const T& value) const
@ -405,8 +405,8 @@ private:
kfree_sized(old_buckets, size_in_bytes(old_capacity));
}
template<typename Finder>
BucketType* lookup_with_hash(unsigned hash, Finder finder) const
template<typename TUnaryPredicate>
BucketType* lookup_with_hash(unsigned hash, TUnaryPredicate predicate) const
{
if (is_empty())
return nullptr;
@ -414,7 +414,7 @@ private:
for (;;) {
auto& bucket = m_buckets[hash % m_capacity];
if (bucket.used && finder(*bucket.slot()))
if (bucket.used && predicate(*bucket.slot()))
return &bucket;
if (!bucket.used && !bucket.deleted)