|
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768 |
- /// \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 <utility>
-
- #include <range/v3/range_fwd.hpp>
-
- #include <range/v3/functional/identity.hpp>
- #include <range/v3/functional/invoke.hpp>
- #include <range/v3/iterator/concepts.hpp>
- #include <range/v3/iterator/traits.hpp>
- #include <range/v3/range/access.hpp>
- #include <range/v3/range/concepts.hpp>
- #include <range/v3/range/traits.hpp>
- #include <range/v3/utility/static_const.hpp>
-
- namespace ranges
- {
- /// \addtogroup group-algorithms
- /// @{
- RANGES_BEGIN_NIEBLOID(none_of)
-
- /// \brief function template \c none_of
- template<typename I, typename S, typename F, typename P = identity>
- auto RANGES_FUN_NIEBLOID(none_of)(I first, S last, F pred, P proj = P{}) //
- ->CPP_ret(bool)( //
- requires input_iterator<I> && sentinel_for<S, I> &&
- indirect_unary_predicate<F, projected<I, P>>)
- {
- for(; first != last; ++first)
- if(invoke(pred, invoke(proj, *first)))
- return false;
- return true;
- }
-
- /// \overload
- template<typename Rng, typename F, typename P = identity>
- auto RANGES_FUN_NIEBLOID(none_of)(Rng && rng, F pred, P proj = P{}) //
- ->CPP_ret(bool)( //
- requires input_range<Rng> &&
- indirect_unary_predicate<F, projected<iterator_t<Rng>, 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
|