mirror of
https://github.com/SerenityOS/serenity
synced 2024-07-21 10:05:32 +00:00
73fc2b3748
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.
39 lines
1.1 KiB
C++
39 lines
1.1 KiB
C++
/*
|
|
* Copyright (c) 2021, the SerenityOS developers.
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Concepts.h>
|
|
#include <AK/Traits.h>
|
|
#include <AK/Types.h>
|
|
|
|
namespace AK {
|
|
|
|
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)) {
|
|
return first;
|
|
}
|
|
}
|
|
return last;
|
|
}
|
|
|
|
template<typename TEndIterator, IteratorPairWith<TEndIterator> TIterator, typename T>
|
|
constexpr TIterator find(TIterator first, TEndIterator last, T const& value)
|
|
{
|
|
return find_if(first, last, [&](auto const& v) { return Traits<T>::equals(value, v); });
|
|
}
|
|
|
|
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, [&](auto const& v) { return Traits<T>::equals(value, v); }).index();
|
|
}
|
|
|
|
}
|