Count.hpp

Go to the documentation of this file.

//
//  CeresEngine - A game development framework
//
//  Created by Rogiel Sulzbach.
//  Copyright (c) 2018-2022 Rogiel Sulzbach. All rights reserved.
//
 
#pragma once
 
#include "ValueCompareAlgorithm.hpp"
 
#include "CeresEngine/Foundation/Algorithm/CountIf.hpp"
#include "CeresEngine/Foundation/Algorithm/Partitioner.hpp"
#include "CeresEngine/Foundation/Traits/is_forward_iterator.hpp"
#include "CeresEngine/Foundation/Traits/is_indirectly_binary_invocable.hpp"
#include "CeresEngine/Foundation/Traits/iter_difference.hpp"
 
namespace CeresEngine {
 
    class CountAlgorithmFunctor : public ValueCompareAlgorithmFunctor<CountAlgorithmFunctor> {
        friend ValueCompareAlgorithmFunctor<CountAlgorithmFunctor>;
 
        template<class I, class S, class T>
        requires(
            // clang-format off
                    traits::is_input_iterator_v<I> &&
                    traits::is_sentinel_for_v<S, I> &&
                    traits::is_indirectly_binary_invocable_v<std::equal_to<>, T*, I>
            // clang-format on
            ) static constexpr traits::iter_difference_t<I> run(I first, S last, const T& v) {
            traits::iter_difference_t<I> ret = 0;
            for(; first != last; ++first) {
                if(*first == v) {
                    ret++;
                }
            }
            return ret;
        }
 
        template<class E, class P, class I, class S, class T>
        requires(
            // clang-format off
                    traits::is_executor_v<E> &&
                    traits::is_partitioner_v<P, I, S> &&
                    traits::is_input_iterator_v<I> &&
                    traits::is_sentinel_for_v<S, I> &&
                    traits::is_indirectly_binary_invocable_v<std::equal_to<>, T *, I>
            // clang-format on
            ) static Async<traits::iter_difference_t<I>> run(const E& executor, P p, I first, S last, const T& v) {
            if constexpr(traits::is_inline_executor_v<E>) {
                co_return run(first, last, v);
            } else {
                co_return co_await CountIfAlgorithmFunctor::Graph<E, I>(executor).launch(p, first, last, [&v](const auto& element) { return element == v; });
            }
        }
    };
 
    inline constexpr CountAlgorithmFunctor count;
 
} // namespace CeresEngine