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_BINARY_SEARCH_HPP
12 #define BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP
13
14 #include <boost/static_assert.hpp>
15
16 #include <boost/compute/system.hpp>
17 #include <boost/compute/command_queue.hpp>
18 #include <boost/compute/algorithm/lower_bound.hpp>
19 #include <boost/compute/type_traits/is_device_iterator.hpp>
20
21 namespace boost {
22 namespace compute {
23
24 /// Returns \c true if \p value is in the sorted range [\p first,
25 /// \p last).
26 ///
27 /// Space complexity: \Omega(1)
28 template<class InputIterator, class T>
binary_search(InputIterator first,InputIterator last,const T & value,command_queue & queue=system::default_queue ())29 inline bool binary_search(InputIterator first,
30 InputIterator last,
31 const T &value,
32 command_queue &queue = system::default_queue())
33 {
34 BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
35 InputIterator position = lower_bound(first, last, value, queue);
36
37 return position != last && position.read(queue) == value;
38 }
39
40 } // end compute namespace
41 } // end boost namespace
42
43 #endif // BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP
44