any_of.hpp 1.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546
  1. //---------------------------------------------------------------------------//
  2. // Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
  3. //
  4. // Distributed under the Boost Software License, Version 1.0
  5. // See accompanying file LICENSE_1_0.txt or copy at
  6. // http://www.boost.org/LICENSE_1_0.txt
  7. //
  8. // See http://boostorg.github.com/compute for more information.
  9. //---------------------------------------------------------------------------//
  10. #ifndef BOOST_COMPUTE_ALGORITHM_ANY_OF_HPP
  11. #define BOOST_COMPUTE_ALGORITHM_ANY_OF_HPP
  12. #include <boost/static_assert.hpp>
  13. #include <boost/compute/system.hpp>
  14. #include <boost/compute/algorithm/find_if.hpp>
  15. #include <boost/compute/type_traits/is_device_iterator.hpp>
  16. namespace boost {
  17. namespace compute {
  18. /// Returns \c true if \p predicate returns \c true for any of the elements in
  19. /// the range [\p first, \p last).
  20. ///
  21. /// For example, to test if a vector contains any negative values:
  22. ///
  23. /// \snippet test/test_any_all_none_of.cpp any_of
  24. ///
  25. /// Space complexity: \Omega(1)
  26. ///
  27. /// \see all_of(), none_of()
  28. template<class InputIterator, class UnaryPredicate>
  29. inline bool any_of(InputIterator first,
  30. InputIterator last,
  31. UnaryPredicate predicate,
  32. command_queue &queue = system::default_queue())
  33. {
  34. BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
  35. return ::boost::compute::find_if(first, last, predicate, queue) != last;
  36. }
  37. } // end compute namespace
  38. } // end boost namespace
  39. #endif // BOOST_COMPUTE_ALGORITHM_ANY_OF_HPP