update boost on linux
This commit is contained in:
@@ -13,16 +13,21 @@
|
||||
|
||||
#include <utility>
|
||||
|
||||
#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/algorithm/upper_bound.hpp>
|
||||
#include <boost/compute/type_traits/is_device_iterator.hpp>
|
||||
|
||||
namespace boost {
|
||||
namespace compute {
|
||||
|
||||
/// Returns a pair of iterators containing the range of values equal
|
||||
/// to \p value in the sorted range [\p first, \p last).
|
||||
///
|
||||
/// Space complexity: \Omega(1)
|
||||
template<class InputIterator, class T>
|
||||
inline std::pair<InputIterator, InputIterator>
|
||||
equal_range(InputIterator first,
|
||||
@@ -30,6 +35,7 @@ equal_range(InputIterator first,
|
||||
const T &value,
|
||||
command_queue &queue = system::default_queue())
|
||||
{
|
||||
BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
|
||||
return std::make_pair(
|
||||
::boost::compute::lower_bound(first, last, value, queue),
|
||||
::boost::compute::upper_bound(first, last, value, queue)
|
||||
|
||||
Reference in New Issue
Block a user