update boost on linux
This commit is contained in:
@@ -11,21 +11,27 @@
|
||||
#ifndef BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP
|
||||
#define BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP
|
||||
|
||||
#include <boost/static_assert.hpp>
|
||||
|
||||
#include <boost/compute/system.hpp>
|
||||
#include <boost/compute/command_queue.hpp>
|
||||
#include <boost/compute/algorithm/lower_bound.hpp>
|
||||
#include <boost/compute/type_traits/is_device_iterator.hpp>
|
||||
|
||||
namespace boost {
|
||||
namespace compute {
|
||||
|
||||
/// Returns \c true if \p value is in the sorted range [\p first,
|
||||
/// \p last).
|
||||
///
|
||||
/// Space complexity: \Omega(1)
|
||||
template<class InputIterator, class T>
|
||||
inline bool binary_search(InputIterator first,
|
||||
InputIterator last,
|
||||
const T &value,
|
||||
command_queue &queue = system::default_queue())
|
||||
{
|
||||
BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
|
||||
InputIterator position = lower_bound(first, last, value, queue);
|
||||
|
||||
return position != last && position.read(queue) == value;
|
||||
|
||||
Reference in New Issue
Block a user