abs acos acosh addressof adjacent_difference adjacent_difference adjacent_difference adjacent_difference advance all_of all_of any_of any_of arg asin asinh atan atanh bidirectional_host_iterator_tag binary_search binary_search binary_search binary_search binary_search binary_search binary_search binary_search conj copy copy copy_if copy_if copy_if copy_if copy_n copy_n cos cosh count count count_if count_if device device_delete device_free device_malloc device_new device_new device_new device_pointer_cast device_pointer_cast distance equal equal equal equal equal_range equal_range equal_range equal_range exclusive_scan exclusive_scan exclusive_scan exclusive_scan exclusive_scan exclusive_scan exclusive_scan_by_key exclusive_scan_by_key exclusive_scan_by_key exclusive_scan_by_key exclusive_scan_by_key exclusive_scan_by_key exclusive_scan_by_key exclusive_scan_by_key exp fill fill fill_n fill_n find find find_if find_if find_if_not find_if_not for_each for_each for_each_n for_each_n forward_host_iterator_tag free gather gather gather_if gather_if gather_if gather_if generate generate generate_n generate_n get get get_temporary_buffer host inclusive_scan inclusive_scan inclusive_scan inclusive_scan inclusive_scan_by_key inclusive_scan_by_key inclusive_scan_by_key inclusive_scan_by_key inclusive_scan_by_key inclusive_scan_by_key inner_product inner_product inner_product inner_product input_host_iterator_tag is_partitioned is_partitioned is_sorted is_sorted is_sorted is_sorted is_sorted_until is_sorted_until is_sorted_until is_sorted_until log log10 lower_bound lower_bound lower_bound lower_bound lower_bound lower_bound lower_bound lower_bound make_constant_iterator make_constant_iterator make_counting_iterator make_discard_iterator make_pair make_permutation_iterator make_reverse_iterator make_transform_iterator make_transform_output_iterator make_tuple make_tuple make_zip_iterator malloc malloc max_element max_element max_element max_element merge merge merge merge merge_by_key merge_by_key merge_by_key merge_by_key min_element min_element min_element min_element minmax_element minmax_element minmax_element minmax_element mismatch mismatch mismatch mismatch none_of none_of norm not1 not2 operator!= operator!= operator!= operator!= operator!= operator!= operator* operator* operator* operator+ operator+ operator+ operator+ operator- operator- operator- operator- operator/ operator/ operator/ operator< operator<< operator<= operator== operator== operator== operator== operator== operator== operator> operator>= operator>> output_host_iterator_tag partition partition partition partition partition_copy partition_copy partition_copy partition_copy partition_point partition_point polar pow pow pow proj random_access_host_iterator_tag raw_pointer_cast raw_reference_cast raw_reference_cast reduce reduce reduce reduce reduce reduce reduce_by_key reduce_by_key reduce_by_key reduce_by_key reduce_by_key reduce_by_key remove remove remove_copy remove_copy remove_copy_if remove_copy_if remove_copy_if remove_copy_if remove_if remove_if remove_if remove_if replace replace replace_copy replace_copy replace_copy_if replace_copy_if replace_copy_if replace_copy_if replace_if replace_if replace_if replace_if return_temporary_buffer reverse reverse reverse_copy reverse_copy scatter scatter scatter_if scatter_if scatter_if scatter_if sequence sequence sequence sequence sequence sequence set_difference set_difference set_difference set_difference set_difference_by_key set_difference_by_key set_difference_by_key set_difference_by_key set_intersection set_intersection set_intersection set_intersection set_intersection_by_key set_intersection_by_key set_intersection_by_key set_intersection_by_key set_symmetric_difference set_symmetric_difference set_symmetric_difference set_symmetric_difference set_symmetric_difference_by_key set_symmetric_difference_by_key set_symmetric_difference_by_key set_symmetric_difference_by_key set_union set_union set_union set_union set_union_by_key set_union_by_key set_union_by_key set_union_by_key sin sinh sort sort sort sort sort_by_key sort_by_key sort_by_key sort_by_key sqrt stable_partition stable_partition stable_partition stable_partition stable_partition_copy stable_partition_copy stable_partition_copy stable_partition_copy stable_sort stable_sort stable_sort stable_sort stable_sort_by_key stable_sort_by_key stable_sort_by_key stable_sort_by_key swap swap swap swap swap swap swap_ranges swap_ranges tabulate tabulate tan tanh THRUST_PREVENT_MACRO_SUBSTITUTION THRUST_PREVENT_MACRO_SUBSTITUTION THRUST_PREVENT_MACRO_SUBSTITUTION THRUST_PREVENT_MACRO_SUBSTITUTION tie tie transform transform transform transform transform_exclusive_scan transform_exclusive_scan transform_if transform_if transform_if transform_if transform_if transform_if transform_inclusive_scan transform_inclusive_scan transform_reduce transform_reduce uninitialized_copy uninitialized_copy uninitialized_copy_n uninitialized_copy_n uninitialized_fill uninitialized_fill uninitialized_fill_n uninitialized_fill_n unique unique unique unique unique_by_key unique_by_key unique_by_key unique_by_key unique_by_key_copy unique_by_key_copy unique_by_key_copy unique_by_key_copy unique_copy unique_copy unique_copy unique_copy upper_bound upper_bound upper_bound upper_bound upper_bound upper_bound upper_bound upper_bound

lower_bound() [4/8] template<class ForwardIterator , class T , class StrictWeakOrdering > ForwardIterator thrust::lower_bound ( ForwardIterator  first, ForwardIterator  last, const T &  value, StrictWeakOrdering  comp  ) lower_bound is a version of binary search: it attempts to find the element value in an ordered range [first, last). Specifically, it returns the first position where value could be inserted without violating the ordering. This version of lower_bound uses function object comp for comparison and returns the furthermost iterator i in [first, last) such that, for every iterator j in [first, i), comp(*j, value) is true. Parameters first The beginning of the ordered sequence. last The end of the ordered sequence. value The value to be searched. comp The comparison operator. Returns The furthermost iterator i, such that comp(*i, value) is true. Template Parameters ForwardIterator is a model of Forward Iterator. T is comparable to ForwardIterator's value_type. StrictWeakOrdering is a model of Strict Weak Ordering. The following code snippet demonstrates how to use lower_bound to search for values in a ordered range. #include <thrust/binary_search.h> #include <thrust/device_vector.h> #include <thrust/functional.h> ... thrust::device_vector<int> input(5); input[0] = 0; input[1] = 2; input[2] = 5; input[3] = 7; input[4] = 8; thrust::lower_bound(input.begin(), input.end(), 0, thrust::less<int>()); // returns input.begin() thrust::lower_bound(input.begin(), input.end(), 1, thrust::less<int>()); // returns input.begin() + 1 thrust::lower_bound(input.begin(), input.end(), 2, thrust::less<int>()); // returns input.begin() + 1 thrust::lower_bound(input.begin(), input.end(), 3, thrust::less<int>()); // returns input.begin() + 2 thrust::lower_bound(input.begin(), input.end(), 8, thrust::less<int>()); // returns input.begin() + 4 thrust::lower_bound(input.begin(), input.end(), 9, thrust::less<int>()); // returns input.end() See also http://www.sgi.com/tech/stl/lower_bound.html upper_bound equal_range binary_search