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_UPPER_BOUND_HPP
12 #define BOOST_COMPUTE_ALGORITHM_UPPER_BOUND_HPP
13
14 #include <boost/static_assert.hpp>
15
16 #include <boost/compute/lambda.hpp>
17 #include <boost/compute/system.hpp>
18 #include <boost/compute/command_queue.hpp>
19 #include <boost/compute/algorithm/detail/binary_find.hpp>
20 #include <boost/compute/type_traits/is_device_iterator.hpp>
21
22 namespace boost {
23 namespace compute {
24
25 /// Returns an iterator pointing to the first element in the sorted
26 /// range [\p first, \p last) that is not less than or equal to
27 /// \p value.
28 ///
29 /// Space complexity: \Omega(1)
30 template<class InputIterator, class T>
31 inline InputIterator
upper_bound(InputIterator first,InputIterator last,const T & value,command_queue & queue=system::default_queue ())32 upper_bound(InputIterator first,
33 InputIterator last,
34 const T &value,
35 command_queue &queue = system::default_queue())
36 {
37 BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
38 using ::boost::compute::_1;
39
40 InputIterator position =
41 detail::binary_find(first, last, _1 > value, queue);
42
43 return position;
44 }
45
46 } // end compute namespace
47 } // end boost namespace
48
49 #endif // BOOST_COMPUTE_ALGORITHM_UPPER_BOUND_HPP
50