thrust

◆ binary_search() [8/8]

template<class ForwardIterator , class InputIterator , class OutputIterator , class StrictWeakOrdering >
OutputIterator thrust::binary_search ( ForwardIterator  first,
ForwardIterator  last,
InputIterator  values_first,
InputIterator  values_last,
OutputIterator  result,
StrictWeakOrdering  comp 
)

binary_search is a vectorized version of binary search: for each iterator v in [values_first, values_last) it attempts to find the value *v in an ordered range [first, last). It returns true if an element that is equivalent to value is present in [first, last) and false if no such element exists. This version of binary_search uses function object comp for comparison.

Parameters
firstThe beginning of the ordered sequence.
lastThe end of the ordered sequence.
values_firstThe beginning of the search values sequence.
values_lastThe end of the search values sequence.
resultThe beginning of the output sequence.
compThe comparison operator.
Template Parameters
ForwardIteratoris a model of Forward Iterator.
InputIteratoris a model of Input Iterator. and InputIterator's value_type is LessThanComparable.
OutputIteratoris a model of Output Iterator. and bool is convertible to OutputIterator's value_type.
StrictWeakOrderingis a model of Strict Weak Ordering.
Precondition
The ranges [first,last) and [result, result + (last - first)) shall not overlap.

The following code snippet demonstrates how to use binary_search to search for multiple values in a ordered range.

...
thrust::device_vector<int> input(5);
input[0] = 0;
input[1] = 2;
input[2] = 5;
input[3] = 7;
input[4] = 8;
values[0] = 0;
values[1] = 1;
values[2] = 2;
values[3] = 3;
values[4] = 8;
values[5] = 9;
thrust::binary_search(input.begin(), input.end(),
values.begin(), values.end(),
output.begin(),
// output is now [true, false, true, false, true, false]
See also
http://www.sgi.com/tech/stl/binary_search.html
lower_bound
upper_bound
equal_range