Thrust
|
◆ binary_search() [3/8]
template<typename DerivedPolicy , typename ForwardIterator , typename T , typename StrictWeakOrdering >
The algorithm's execution is parallelized as determined by
The following code snippet demonstrates how to use #include <thrust/binary_search.h> #include <thrust/device_vector.h> #include <thrust/functional.h> #include <thrust/execution_policy.h> ... thrust::device_vector<int> input(5); input[0] = 0; input[1] = 2; input[2] = 5; input[3] = 7; input[4] = 8; thrust::binary_search(thrust::device, input.begin(), input.end(), 0, thrust::less<int>()); // returns true thrust::binary_search(thrust::device, input.begin(), input.end(), 1, thrust::less<int>()); // returns false thrust::binary_search(thrust::device, input.begin(), input.end(), 2, thrust::less<int>()); // returns true thrust::binary_search(thrust::device, input.begin(), input.end(), 3, thrust::less<int>()); // returns false thrust::binary_search(thrust::device, input.begin(), input.end(), 8, thrust::less<int>()); // returns true thrust::binary_search(thrust::device, input.begin(), input.end(), 9, thrust::less<int>()); // returns false |