/// \file // Range v3 library // // Copyright Andrew Sutton 2014 // Copyright Gonzalo Brito Gadeschi 2014 // // 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_NONE_OF_HPP #define RANGES_V3_ALGORITHM_NONE_OF_HPP #include #include #include #include #include #include #include #include #include #include namespace ranges { /// \addtogroup group-algorithms /// @{ RANGES_BEGIN_NIEBLOID(none_of) /// \brief function template \c none_of template auto RANGES_FUN_NIEBLOID(none_of)(I first, S last, F pred, P proj = P{}) // ->CPP_ret(bool)( // requires input_iterator && sentinel_for && indirect_unary_predicate>) { for(; first != last; ++first) if(invoke(pred, invoke(proj, *first))) return false; return true; } /// \overload template auto RANGES_FUN_NIEBLOID(none_of)(Rng && rng, F pred, P proj = P{}) // ->CPP_ret(bool)( // requires input_range && indirect_unary_predicate, P>>) { return (*this)(begin(rng), end(rng), std::move(pred), std::move(proj)); } RANGES_END_NIEBLOID(none_of) namespace cpp20 { using ranges::none_of; } /// @} } // namespace ranges #endif // include guard