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

transform_if() [5/6] template<typename DerivedPolicy , typename InputIterator1 , typename InputIterator2 , typename InputIterator3 , typename ForwardIterator , typename BinaryFunction , typename Predicate > __host__ __device__ ForwardIterator thrust::transform_if ( const thrust::detail::execution_policy_base< DerivedPolicy > &  exec, InputIterator1  first1, InputIterator1  last1, InputIterator2  first2, InputIterator3  stencil, ForwardIterator  result, BinaryFunction  binary_op, Predicate  pred  ) This version of transform_if conditionally applies a binary function to each pair of elements from two input sequences and stores the result in the corresponding position in an output sequence if the corresponding position in a stencil sequence satifies a predicate. Otherwise, the corresponding position in the output sequence is not modified. Specifically, for each iterator i in the range [first1, last1) and j = first2 + (i - first1) in the range [first2, first2 + (last1 - first1) ), the predicate pred(*s) is evaluated, where s is the corresponding input iterator in the range [stencil, stencil + (last1 - first1) ). If this predicate evaluates to true, the result of binary_op(*i,*j) is assigned to *o, where o is the corresponding output iterator in the range [result, result + (last1 - first1) ). Otherwise, binary_op(*i,*j) is not evaluated and no assignment occurs. The input and output sequences may coincide, resulting in an in-place transformation. The algorithm's execution is parallelized as determined by exec. Parameters exec The execution policy to use for parallelization. first1 The beginning of the first input sequence. last1 The end of the first input sequence. first2 The beginning of the second input sequence. stencil The beginning of the stencil sequence. result The beginning of the output sequence. binary_op The transformation operation. pred The predicate operation. Returns The end of the output sequence. Template Parameters DerivedPolicy The name of the derived execution policy. InputIterator1 is a model of Input Iterator and InputIterator1's value_type is convertible to BinaryFunction's first_argument_type. InputIterator2 is a model of Input Iterator and InputIterator2's value_type is convertible to BinaryFunction's second_argument_type. ForwardIterator is a model of Forward Iterator. BinaryFunction is a model of Binary Function and BinaryFunction's result_type is convertible to OutputIterator's value_type. Predicate is a model of Predicate. Precondition first1 may equal result, but the range [first1, last1) shall not overlap the range [result, result + (last1 - first1)) otherwise. first2 may equal result, but the range [first2, first2 + (last1 - first1)) shall not overlap the range [result, result + (last1 - first1)) otherwise. stencil may equal result, but the range [stencil, stencil + (last1 - first1)) shall not overlap the range [result, result + (last1 - first1)) otherwise. The following code snippet demonstrates how to use transform_if using the thrust::host execution policy for parallelization: #include <thrust/transform.h> #include <thrust/functional.h> #include <thrust/execution_policy.h> ... int input1[6] = {-5, 0, 2, 3, 2, 4}; int input2[6] = { 3, 6, -2, 1, 2, 3}; int stencil[8] = { 1, 0, 1, 0, 1, 0}; int output[6]; thrust::plus<int> op; thrust::identity<int> identity; thrust::transform_if(thrust::host, input1, input1 + 6, input2, stencil, output, op, identity); // output is now {-2, 0, 0, 3, 4, 4}; See also thrust::transform