44 lines
1.6 KiB
Plaintext
44 lines
1.6 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_IS_PARTITIONED_HPP
|
||
|
|
#define BOOST_COMPUTE_ALGORITHM_IS_PARTITIONED_HPP
|
||
|
|
|
||
|
|
#include <boost/compute/system.hpp>
|
||
|
|
#include <boost/compute/command_queue.hpp>
|
||
|
|
#include <boost/compute/algorithm/find_if.hpp>
|
||
|
|
#include <boost/compute/algorithm/find_if_not.hpp>
|
||
|
|
|
||
|
|
namespace boost {
|
||
|
|
namespace compute {
|
||
|
|
|
||
|
|
/// Returns \c true if the values in the range [\p first, \p last)
|
||
|
|
/// are partitioned according to \p predicate.
|
||
|
|
template<class InputIterator, class UnaryPredicate>
|
||
|
|
inline bool is_partitioned(InputIterator first,
|
||
|
|
InputIterator last,
|
||
|
|
UnaryPredicate predicate,
|
||
|
|
command_queue &queue = system::default_queue())
|
||
|
|
{
|
||
|
|
return ::boost::compute::find_if(
|
||
|
|
::boost::compute::find_if_not(first,
|
||
|
|
last,
|
||
|
|
predicate,
|
||
|
|
queue),
|
||
|
|
last,
|
||
|
|
predicate,
|
||
|
|
queue) == last;
|
||
|
|
}
|
||
|
|
|
||
|
|
} // end compute namespace
|
||
|
|
} // end boost namespace
|
||
|
|
|
||
|
|
#endif // BOOST_COMPUTE_ALGORITHM_PARTITION_HPP
|