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