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

Function lower_bound

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

Source from the content-addressed store, hash-verified

30/// \see upper_bound()
31template<class InputIterator, class T>
32inline InputIterator
33lower_bound(InputIterator first,
34 InputIterator last,
35 const T &value,
36 command_queue &queue = system::default_queue())
37{
38 BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
39 using ::boost::compute::_1;
40
41 InputIterator position =
42 detail::binary_find(first, last, _1 >= value, queue);
43
44 return position;
45}
46
47} // end compute namespace
48} // 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