AlgorithmFind.h

// Copyright (c) Stefano Cristiano
// SPDX-License-Identifier: MIT
#pragma once
#include "../Foundation/Assert.h"
 
namespace SC
{
namespace Algorithms
{
 
 
template <typename ForwardIterator, typename UnaryPredicate>
constexpr ForwardIterator findIf(ForwardIterator first, ForwardIterator last, UnaryPredicate&& predicate,
                                 size_t* index = nullptr)
{
    SC_ASSERT_DEBUG(first <= last);
    for (auto it = first; it != last; ++it)
    {
        if (predicate(*it))
        {
            if (index)
            {
                *index = static_cast<size_t>(it - first);
            }
            return it;
        }
    }
    return last;
}
 
template <typename Container, typename T>
constexpr bool contains(Container container, const T& value, size_t* index = nullptr)
{
    return findIf(
               container.begin(), container.end(), [&](auto& item) { return item == value; }, index) != container.end();
}
 
 
} // namespace Algorithms
} // namespace SC