Replace dpstd usage with oneDPL names (oneapi-src#653)

* Add include of oneDPL numeric header to ensure std::transform_reduce and std::reduce are available.

Signed-off-by: timmie.smith <[email protected]>

* Include of oneDPL numeric header to make std::transform_reduce and std::reduce available.

Signed-off-by: timmie.smith <[email protected]>

* Replace usage of outdated dpstd with oneDPL name and namespace.

Author: timmiesmith

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/lab/binary_search.cpp

@@ -50,7 +50,7 @@ int main() {
 
     //function object to be passed to sort function  
 
-    //Calling the dpstd binary search algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
+    //Calling the oneDPL binary search algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
     // Default comparator is the operator < used here. 
     const auto i =  oneapi::dpl::binary_search(policy,keys_begin,keys_end,vals_begin,vals_end,result_begin);
 

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/lab/lower_bound.cpp

@@ -44,7 +44,7 @@ int main() {
     // use policy for algorithms execution
     auto policy = make_device_policy(q);  
 
-    //Calling the dpstd upper_bound algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
+    //Calling the oneDPL upper_bound algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
     // Default comparator is the operator < used here.
 
     oneapi::dpl::lower_bound(policy,keys_begin,keys_end,vals_begin,vals_end,result_begin);   

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/lab/maximum_function.cpp

@@ -24,15 +24,15 @@ int main() {
         buffer<int,1> buf(v.data(), range<1>(N));
         buffer<int,1> buf_res(result.data(), range<1>(N));
 
-        //dpstd buffer iterators for both the input and the result vectors
+        //oneDPL buffer iterators for both the input and the result vectors
         auto start_v = oneapi::dpl::begin(buf);
         auto end_v = oneapi::dpl::end(buf);
         auto start_res = oneapi::dpl::begin(buf_res);
         auto end_res = oneapi::dpl::end(buf_res);
 
         //use std::fill to initialize the result vector
         std::fill(oneapi::dpl::execution::dpcpp_default,start_res, end_res, 0);  
-        //usage of dpstd::maximum<> function call within the std::exclusive_scan function
+        //usage of dpl::maximum<> function call within the std::exclusive_scan function
         std::exclusive_scan(oneapi::dpl::execution::dpcpp_default, start_v, end_v, start_res, int(0), oneapi::dpl::maximum<int>() );        
     }
 

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/lab/minimum_function.cpp

@@ -24,7 +24,7 @@ int main() {
         buffer buf(v);
         buffer buf_res(result);
 
-        //dpstd buffer iterators for both the input and the result vectors
+        //oneDPL buffer iterators for both the input and the result vectors
         auto start_v = oneapi::dpl::begin(buf);
         auto end_v = oneapi::dpl::end(buf);
         auto start_res = oneapi::dpl::begin(buf_res);

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/lab/reduce_segment.cpp

@@ -49,9 +49,9 @@ int main() {
     auto policy = make_device_policy(q);
     //auto pair_iters = make_pair <std::vector::iterator, std::vector::iterator>
 
-    //Calling the dpstd reduce by search algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
+    //Calling the oneDPL reduce by search algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
     // Default comparator is the operator < used here.
-    // dpstd::reduce_by_segment returns a pair of iterators to the result_key_begin and result_vals_begin respectively
+    // dpl::reduce_by_segment returns a pair of iterators to the result_key_begin and result_vals_begin respectively
     int count_keys,count_vals = 0;    
 
     auto pair_iters = oneapi::dpl::reduce_by_segment(make_device_policy(q), keys_begin, keys_end, vals_begin, result_key_begin, result_vals_begin);

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/lab/upper_bound.cpp

@@ -46,7 +46,7 @@ int main() {
     // use policy for algorithms execution
     auto policy = make_device_policy(q);  
 
-    //Calling the dpstd upper_bound algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
+    //Calling the oneDPL upper_bound algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
     // Default comparator is the operator < used here.
 
     oneapi::dpl::upper_bound(make_device_policy(q),keys_begin,keys_end,vals_begin,vals_end,result_begin);    

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/src/binary_search.cpp

@@ -50,7 +50,7 @@ int main() {
 
     //function object to be passed to sort function  
 
-    //Calling the dpstd binary search algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
+    //Calling the oneDPL binary search algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
     // Default comparator is the operator < used here. 
     const auto i =  oneapi::dpl::binary_search(policy,keys_begin,keys_end,vals_begin,vals_end,result_begin);
 

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/src/maximum_function.cpp

@@ -22,15 +22,15 @@ int main() {
         buffer<int,1> buf(v.data(), range<1>(N));
         buffer<int,1> buf_res(result.data(), range<1>(N));
 
-        //dpstd buffer iterators for both the input and the result vectors
+        //oneDPL buffer iterators for both the input and the result vectors
         auto start_v = oneapi::dpl::begin(buf);
         auto end_v = oneapi::dpl::end(buf);
         auto start_res = oneapi::dpl::begin(buf_res);
         auto end_res = oneapi::dpl::end(buf_res);
 
         //use std::fill to initialize the result vector
         std::fill(oneapi::dpl::execution::dpcpp_default,start_res, end_res, 0);  
-        //usage of dpstd::maximum<> function call within the std::exclusive_scan function
+        //usage of dpl::maximum<> function call within the std::exclusive_scan function
         std::exclusive_scan(oneapi::dpl::execution::dpcpp_default, start_v, end_v, start_res, int(0), oneapi::dpl::maximum<int>() );        
     }
 

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/src/minimum_function.cpp

@@ -22,7 +22,7 @@ int main() {
         buffer buf(v);
         buffer buf_res(result);
 
-        //dpstd buffer iterators for both the input and the result vectors
+        //oneDPL buffer iterators for both the input and the result vectors
         auto start_v = oneapi::dpl::begin(buf);
         auto end_v = oneapi::dpl::end(buf);
         auto start_res = oneapi::dpl::begin(buf_res);

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/src/reduce_segment.cpp

@@ -50,9 +50,9 @@ int main() {
     auto policy = make_device_policy(q);
     //auto pair_iters = make_pair <std::vector::iterator, std::vector::iterator>
 
-    //Calling the dpstd reduce by search algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
+    //Calling the oneDPL reduce by search algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
     // Default comparator is the operator < used here.
-    // dpstd::reduce_by_segment returns a pair of iterators to the result_key_begin and result_vals_begin respectively
+    // dpl::reduce_by_segment returns a pair of iterators to the result_key_begin and result_vals_begin respectively
     int count_keys,count_vals = 0;    
 
     auto pair_iters = oneapi::dpl::reduce_by_segment(make_device_policy(q), keys_begin, keys_end, vals_begin, result_key_begin, result_vals_begin);

DirectProgramming/DPC++/Jupyter/oneapi-essentials-training/07_DPCPP_Library/src/upper_bound.cpp

@@ -46,7 +46,7 @@ int main() {
     // use policy for algorithms execution
     auto policy = make_device_policy(q);  
 
-    //Calling the dpstd upper_bound algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
+    //Calling the oneDPL upper_bound algorithm. We pass in the policy, the buffer iterators for the input vectors and the output. 
     // Default comparator is the operator < used here.
 
     oneapi::dpl::upper_bound(make_device_policy(q),keys_begin,keys_end,vals_begin,vals_end,result_begin);