thrust

◆ binary_search() [2/8]

template<class ForwardIterator , class LessThanComparable >
bool thrust::binary_search ( ForwardIterator  first,
ForwardIterator  last,
const LessThanComparable &  value 
)

binary_search is a version of binary search: it attempts to find the element value 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. Specifically, this version returns true if and only if there exists an iterator i in [first, last) such that *i < value and value < *i are both false.

Parameters
firstThe beginning of the ordered sequence.
lastThe end of the ordered sequence.
valueThe value to be searched.
Returns
true if an equivalent element exists in [first, last), otherwise false.
Template Parameters
ForwardIteratoris a model of Forward Iterator.
LessThanComparableis a model of LessThanComparable.

The following code snippet demonstrates how to use binary_search to search for 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;
thrust::binary_search(input.begin(), input.end(), 0); // returns true
thrust::binary_search(input.begin(), input.end(), 1); // returns false
thrust::binary_search(input.begin(), input.end(), 2); // returns true
thrust::binary_search(input.begin(), input.end(), 3); // returns false
thrust::binary_search(input.begin(), input.end(), 8); // returns true
thrust::binary_search(input.begin(), input.end(), 9); // returns false
See also
http://www.sgi.com/tech/stl/binary_search.html
lower_bound
upper_bound
equal_range