1 //---------------------------------------------------------------------------//
2 // Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
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
8 // See http://boostorg.github.com/compute for more information.
9 //---------------------------------------------------------------------------//
11 #ifndef BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP
12 #define BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP
14 #include <boost/compute/system.hpp>
15 #include <boost/compute/command_queue.hpp>
16 #include <boost/compute/algorithm/lower_bound.hpp>
21 /// Returns \c true if \p value is in the sorted range [\p first,
24 /// Space complexity: \Omega(1)
25 template<class InputIterator, class T>
26 inline bool binary_search(InputIterator first,
29 command_queue &queue = system::default_queue())
31 InputIterator position = lower_bound(first, last, value, queue);
33 return position != last && position.read(queue) == value;
36 } // end compute namespace
37 } // end boost namespace
39 #endif // BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP