/// \file // Range v3 library // // Copyright Eric Niebler 2014-present // // Use, modification and distribution is subject to the // Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Project home: https://github.com/ericniebler/range-v3 // #ifndef RANGES_V3_ALGORITHM_COUNT_HPP #define RANGES_V3_ALGORITHM_COUNT_HPP #include #include #include #include #include #include #include #include #include #include namespace ranges { /// \addtogroup group-algorithms /// @{ RANGES_BEGIN_NIEBLOID(count) /// \brief function template \c count template auto RANGES_FUN_NIEBLOID(count)(I first, S last, V const & val, P proj = P{}) ->CPP_ret(iter_difference_t)( // requires input_iterator && sentinel_for && indirect_relation, V const *>) { iter_difference_t n = 0; for(; first != last; ++first) if(invoke(proj, *first) == val) ++n; return n; } /// \overload template auto RANGES_FUN_NIEBLOID(count)(Rng && rng, V const & val, P proj = P{}) ->CPP_ret(iter_difference_t>)( // requires input_range && indirect_relation, P>, V const *>) { return (*this)(begin(rng), end(rng), val, std::move(proj)); } RANGES_END_NIEBLOID(count) namespace cpp20 { using ranges::count; } /// @} } // namespace ranges #endif // include guard