]> git.proxmox.com Git - ceph.git/blob - ceph/src/boost/libs/compute/include/boost/compute/algorithm/is_partitioned.hpp
add subtree-ish sources for 12.0.3
[ceph.git] / ceph / src / boost / libs / compute / include / boost / compute / algorithm / is_partitioned.hpp
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/compute/system.hpp>
15 #include <boost/compute/command_queue.hpp>
16 #include <boost/compute/algorithm/find_if.hpp>
17 #include <boost/compute/algorithm/find_if_not.hpp>
18
19 namespace boost {
20 namespace compute {
21
22 /// Returns \c true if the values in the range [\p first, \p last)
23 /// are partitioned according to \p predicate.
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 return ::boost::compute::find_if(
31 ::boost::compute::find_if_not(first,
32 last,
33 predicate,
34 queue),
35 last,
36 predicate,
37 queue) == last;
38 }
39
40 } // end compute namespace
41 } // end boost namespace
42
43 #endif // BOOST_COMPUTE_ALGORITHM_PARTITION_HPP