41 lines
1.4 KiB
Plaintext
41 lines
1.4 KiB
Plaintext
//---------------------------------------------------------------------------//
|
|
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
|
|
//
|
|
// Distributed under 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
|
|
//
|
|
// See http://boostorg.github.com/compute for more information.
|
|
//---------------------------------------------------------------------------//
|
|
|
|
#ifndef BOOST_COMPUTE_ALGORITHM_ANY_OF_HPP
|
|
#define BOOST_COMPUTE_ALGORITHM_ANY_OF_HPP
|
|
|
|
#include <boost/compute/system.hpp>
|
|
#include <boost/compute/algorithm/find_if.hpp>
|
|
|
|
namespace boost {
|
|
namespace compute {
|
|
|
|
/// Returns \c true if \p predicate returns \c true for any of the elements in
|
|
/// the range [\p first, \p last).
|
|
///
|
|
/// For example, to test if a vector contains any negative values:
|
|
///
|
|
/// \snippet test/test_any_all_none_of.cpp any_of
|
|
///
|
|
/// \see all_of(), none_of()
|
|
template<class InputIterator, class UnaryPredicate>
|
|
inline bool any_of(InputIterator first,
|
|
InputIterator last,
|
|
UnaryPredicate predicate,
|
|
command_queue &queue = system::default_queue())
|
|
{
|
|
return ::boost::compute::find_if(first, last, predicate, queue) != last;
|
|
}
|
|
|
|
} // end compute namespace
|
|
} // end boost namespace
|
|
|
|
#endif // BOOST_COMPUTE_ALGORITHM_ANY_OF_HPP
|