]>
Commit | Line | Data |
---|---|---|
7c673cae FG |
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_LOWER_BOUND_HPP | |
12 | #define BOOST_COMPUTE_ALGORITHM_LOWER_BOUND_HPP | |
13 | ||
14 | #include <boost/compute/lambda.hpp> | |
15 | #include <boost/compute/system.hpp> | |
16 | #include <boost/compute/command_queue.hpp> | |
17 | #include <boost/compute/algorithm/detail/binary_find.hpp> | |
18 | ||
19 | namespace boost { | |
20 | namespace compute { | |
21 | ||
22 | /// Returns an iterator pointing to the first element in the sorted | |
23 | /// range [\p first, \p last) that is not less than \p value. | |
24 | /// | |
25 | /// \see upper_bound() | |
26 | template<class InputIterator, class T> | |
27 | inline InputIterator | |
28 | lower_bound(InputIterator first, | |
29 | InputIterator last, | |
30 | const T &value, | |
31 | command_queue &queue = system::default_queue()) | |
32 | { | |
33 | using ::boost::compute::_1; | |
34 | ||
35 | InputIterator position = | |
36 | detail::binary_find(first, last, _1 >= value, queue); | |
37 | ||
38 | return position; | |
39 | } | |
40 | ||
41 | } // end compute namespace | |
42 | } // end boost namespace | |
43 | ||
44 | #endif // BOOST_COMPUTE_ALGORITHM_LOWER_BOUND_HPP |