RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-07-28 01:37:35 +00:00
Code Issues Activity Actions

AK: Rewrite {AnyOf,AllOf,Find}.h to use the IteratorPairWith concept

Browse source 
This makes it so these algorithms are usable with arbitrary iterators,
as opposed to just instances of AK::SimpleIterator.
This commit also makes the requirement of ::index() in find_index()
explicit, as previously it was accepting any iterator.
This commit is contained in:
Ali Mohammad Pur 2021-07-22 19:19:34 +04:30 • committed by Andreas Kling
parent 2dc31c503e
commit 73fc2b3748
3 changed files with 15 additions and 14 deletions
Download patch file Download diff file Expand all files Collapse all files

17
AK/Find.h
View file

@ -6,13 +6,14 @@
#pragma once
#include <AK/Concepts.h>
#include <AK/Traits.h>
#include <AK/Types.h>
namespace AK {
template<typename TIterator, typename TUnaryPredicate>
constexpr TIterator find_if(TIterator first, TIterator last, TUnaryPredicate&& pred)
template<typename TEndIterator, IteratorPairWith<TEndIterator> TIterator, typename TUnaryPredicate>
constexpr TIterator find_if(TIterator first, TEndIterator last, TUnaryPredicate&& pred)
{
for (; first != last; ++first) {
if (pred(*first)) {
@ -22,16 +23,16 @@ constexpr TIterator find_if(TIterator first, TIterator last, TUnaryPredicate&& p
return last;
}
template<typename TIterator, typename T>
constexpr TIterator find(TIterator first, TIterator last, const T& value)
template<typename TEndIterator, IteratorPairWith<TEndIterator> TIterator, typename T>
constexpr TIterator find(TIterator first, TEndIterator last, T const& value)
{
return find_if(first, last, [&](const auto& v) { return Traits<T>::equals(value, v); });
return find_if(first, last, [&](auto const& v) { return Traits<T>::equals(value, v); });
}
template<typename TIterator, typename T>
constexpr size_t find_index(TIterator first, TIterator last, const T& value)
template<typename TEndIterator, IteratorPairWith<TEndIterator> TIterator, typename T>
constexpr size_t find_index(TIterator first, TEndIterator last, T const& value) requires(requires(TIterator it) { it.index(); })
{
return find_if(first, last, [&](const auto& v) { return Traits<T>::equals(value, v); }).index();
return find_if(first, last, [&](auto const& v) { return Traits<T>::equals(value, v); }).index();
}
}