[oneDPL] Add lexicographical_compare parallel range algorithm

Author: dmitriy-sobolev

source/elements/oneDPL/source/parallel_api/parallel_range_api.rst

@@ -266,7 +266,7 @@ Sequence Search and Comparison
   namespace oneapi::dpl::ranges {
 
     // equal
-    template<typename ExecutionPolicy, std::ranges::random_access_range R1,
+    template <typename ExecutionPolicy, std::ranges::random_access_range R1,
              std::ranges::random_access_range R2, typename Pred = std::ranges::equal_to,
              typename Proj1 = std::identity, typename Proj2 = std::identity>
       requires oneapi::dpl::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> &&
@@ -277,7 +277,7 @@ Sequence Search and Comparison
                   Proj1 proj1 = {}, Proj2 proj2 = {});
 
     // mismatch
-    template<typename ExecutionPolicy, std::ranges::random_access_range R1,
+    template <typename ExecutionPolicy, std::ranges::random_access_range R1,
              std::ranges::random_access_range R2, typename Pred = std::ranges::equal_to,
              typename Proj1 = std::identity, typename Proj2 = std::identity>
       requires oneapi::dpl::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> &&
@@ -288,10 +288,9 @@ Sequence Search and Comparison
                                    std::ranges::borrowed_iterator_t<R2>>
         mismatch (ExecutionPolicy&& pol, R1&& r1, R2&& r2, Pred pred = {},
                   Proj1 proj1 = {}, Proj2 proj2 = {});
-                  
 
     // find_end
-    template<typename ExecutionPolicy, std::ranges::random_access_range R1,
+    template <typename ExecutionPolicy, std::ranges::random_access_range R1,
              std::ranges::random_access_range R2, typename Pred = std::ranges::equal_to,
              typename Proj1 = std::identity, typename Proj2 = std::identity>
       requires oneapi::dpl::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> &&
@@ -303,7 +302,7 @@ Sequence Search and Comparison
                   Proj1 proj1 = {}, Proj2 proj2 = {});
 
     // search
-    template<typename ExecutionPolicy, std::ranges::random_access_range R1,
+    template <typename ExecutionPolicy, std::ranges::random_access_range R1,
              std::ranges::random_access_range R2, typename Pred = std::ranges::equal_to,
              typename Proj1 = std::identity, typename Proj2 = std::identity>
       requires oneapi::dpl::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> &&
@@ -315,7 +314,7 @@ Sequence Search and Comparison
                 Proj1 proj1 = {}, Proj2 proj2 = {});
 
     // search_n
-    template<typename ExecutionPolicy, std::ranges::random_access_range R,
+    template <typename ExecutionPolicy, std::ranges::random_access_range R,
              typename Pred = std::ranges::equal_to, typename Proj = std::identity,
              typename T = /*projected-value-type*/<std::ranges::iterator_t<R>, Proj>>
       requires oneapi::dpl::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> &&
@@ -325,6 +324,19 @@ Sequence Search and Comparison
         search_n (ExecutionPolicy&& pol, R&& r, std::ranges::range_difference_t<R> count,
                   const T& value, Pred pred = {}, Proj proj = {});
 
+    // lexicographical_compare
+    template <typename ExecutionPolicy, std::ranges::random_access_range R1,
+              std::ranges::random_access_range R2, typename Proj1 = std::identity,
+              typename Proj2 = std::identity,
+              std::indirect_strict_weak_order< std::projected<std::ranges::iterator_t<R1>, Proj1>,
+                                               std::projected<std::ranges::iterator_t<R2>, Proj2> >
+                    Comp = std::ranges::less>
+      requires oneapi::dpl::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> &&
+               std::ranges::sized_range<R1> && std::ranges::sized_range<R2> &&
+               std::indirectly_comparable< std::ranges::iterator_t<R1>, std::ranges::iterator_t<R2>,
+                                           Comp, Proj1, Proj2 >
+      bool lexicographical_compare (ExecutionPolicy&& pol, R1&& r1, R2&& r2, Comp comp = {},
+                                   Proj1 proj1 = {}, Proj2 proj2 = {});
   }
 
 Sorting and Merge