65 lines
2.0 KiB
C++
65 lines
2.0 KiB
C++
/// \file
|
|
// Range v3 library
|
|
//
|
|
// Copyright Andrew Sutton 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_ALL_OF_HPP
|
|
#define RANGES_V3_ALGORITHM_ALL_OF_HPP
|
|
|
|
#include <utility>
|
|
#include <range/v3/range_fwd.hpp>
|
|
#include <range/v3/begin_end.hpp>
|
|
#include <range/v3/range_concepts.hpp>
|
|
#include <range/v3/range_traits.hpp>
|
|
#include <range/v3/utility/functional.hpp>
|
|
#include <range/v3/utility/iterator_concepts.hpp>
|
|
#include <range/v3/utility/iterator_traits.hpp>
|
|
#include <range/v3/utility/static_const.hpp>
|
|
|
|
namespace ranges
|
|
{
|
|
inline namespace v3
|
|
{
|
|
/// \addtogroup group-algorithms
|
|
/// @{
|
|
struct all_of_fn
|
|
{
|
|
template<typename I, typename S, typename F, typename P = ident,
|
|
CONCEPT_REQUIRES_(InputIterator<I>() && Sentinel<S, I>() &&
|
|
IndirectPredicate<F, projected<I, P> >())>
|
|
bool
|
|
operator()(I first, S last, F pred, P proj = P{}) const
|
|
{
|
|
for(; first != last; ++first)
|
|
if(!invoke(pred, invoke(proj, *first)))
|
|
break;
|
|
return first == last;
|
|
}
|
|
|
|
template<typename Rng, typename F, typename P = ident,
|
|
typename I = iterator_t<Rng>,
|
|
CONCEPT_REQUIRES_(InputRange<Rng>() && IndirectPredicate<F, projected<I, P> >())>
|
|
bool
|
|
operator()(Rng &&rng, F pred, P proj = P{}) const
|
|
{
|
|
return (*this)(begin(rng), end(rng), std::move(pred), std::move(proj));
|
|
}
|
|
};
|
|
|
|
/// \sa `all_of_fn`
|
|
/// \ingroup group-algorithms
|
|
RANGES_INLINE_VARIABLE(with_braced_init_args<all_of_fn>, all_of)
|
|
/// @}
|
|
|
|
} // inline namespace v3
|
|
} // namespace ranges
|
|
|
|
#endif // include guard
|