MCPcopy Create free account
hub / github.com/boostorg/compute / lower_bound

Function lower_bound

include/boost/compute/algorithm/lower_bound.hpp:27–39  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

25/// \see upper_bound()
26template<class InputIterator, class T>
27inline InputIterator
28lower_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

Callers 6

BOOST_AUTO_TEST_CASEFunction · 0.85
ParallelMergeRangeMethod · 0.85
lower_boundMethod · 0.85
lower_boundMethod · 0.85
equal_rangeFunction · 0.85
binary_searchFunction · 0.85

Calls 1

binary_findFunction · 0.85

Tested by 1

BOOST_AUTO_TEST_CASEFunction · 0.68