compute/algorithm/binary_search.hpp

0001 //---------------------------------------------------------------------------//
0002 // Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
0003 //
0004 // Distributed under the Boost Software License, Version 1.0
0005 // See accompanying file LICENSE_1_0.txt or copy at
0006 // http://www.boost.org/LICENSE_1_0.txt
0007 //
0008 // See http://boostorg.github.com/compute for more information.
0009 //---------------------------------------------------------------------------//
0010
0011 #ifndef BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP
0012 #define BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP
0013
0014 #include <boost/static_assert.hpp>
0015
0016 #include <boost/compute/system.hpp>
0017 #include <boost/compute/command_queue.hpp>
0018 #include <boost/compute/algorithm/lower_bound.hpp>
0019 #include <boost/compute/type_traits/is_device_iterator.hpp>
0020
0021 namespace boost {
0022 namespace compute {
0023
0024 /// Returns \c true if \p value is in the sorted range [\p first,
0025 /// \p last).
0026 ///
0027 /// Space complexity: \Omega(1)
0028 template<class InputIterator, class T>
0029 inline bool binary_search(InputIterator first,
0030                           InputIterator last,
0031                           const T &value,
0032                           command_queue &queue = system::default_queue())
0033 {
0034     BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
0035     InputIterator position = lower_bound(first, last, value, queue);
0036
0037     return position != last && position.read(queue) == value;
0038 }
0039
0040 } // end compute namespace
0041 } // end boost namespace
0042
0043 #endif // BOOST_COMPUTE_ALGORITHM_BINARY_SEARCH_HPP