is_partitioned.hpp 1.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849
  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_IS_PARTITIONED_HPP
  11. #define BOOST_COMPUTE_ALGORITHM_IS_PARTITIONED_HPP
  12. #include <boost/static_assert.hpp>
  13. #include <boost/compute/system.hpp>
  14. #include <boost/compute/command_queue.hpp>
  15. #include <boost/compute/algorithm/find_if.hpp>
  16. #include <boost/compute/algorithm/find_if_not.hpp>
  17. #include <boost/compute/type_traits/is_device_iterator.hpp>
  18. namespace boost {
  19. namespace compute {
  20. /// Returns \c true if the values in the range [\p first, \p last)
  21. /// are partitioned according to \p predicate.
  22. ///
  23. /// Space complexity: \Omega(1)
  24. template<class InputIterator, class UnaryPredicate>
  25. inline bool is_partitioned(InputIterator first,
  26. InputIterator last,
  27. UnaryPredicate predicate,
  28. command_queue &queue = system::default_queue())
  29. {
  30. BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
  31. return ::boost::compute::find_if(
  32. ::boost::compute::find_if_not(first,
  33. last,
  34. predicate,
  35. queue),
  36. last,
  37. predicate,
  38. queue) == last;
  39. }
  40. } // end compute namespace
  41. } // end boost namespace
  42. #endif // BOOST_COMPUTE_ALGORITHM_PARTITION_HPP