Apply some formatting suggestions

Author: akukanov

include/oneapi/dpl/pstl/algorithm_fwd.h

@@ -438,12 +438,12 @@ _OutputIterator __brick_copy_if(_RandomAccessIterator, _RandomAccessIterator, _O
 
 template <class _RandomAccessIterator, class _DifferenceType, class _IterPredicate>
 std::pair<_DifferenceType, _DifferenceType>
-__brick_compute_mask(_RandomAccessIterator, _DifferenceType, _IterPredicate, bool*, 
+__brick_compute_mask(_RandomAccessIterator, _DifferenceType, _IterPredicate, bool*,
                      /*vector=*/std::false_type) noexcept;
 
 template <class _RandomAccessIterator, class _DifferenceType, class _IterPredicate>
 std::pair<_DifferenceType, _DifferenceType>
-__brick_compute_mask(_RandomAccessIterator, _DifferenceType, _IterPredicate, bool*, 
+__brick_compute_mask(_RandomAccessIterator, _DifferenceType, _IterPredicate, bool*,
                      /*vector=*/std::true_type) noexcept;
 
 template <class _ForwardIterator, class _OutputIterator>

include/oneapi/dpl/pstl/algorithm_impl.h

@@ -1346,9 +1346,9 @@ __pattern_copy_if(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _R
     const _DifferenceType __n = __last - __first;
     if (_DifferenceType(1) < __n)
     {
-        return __parallel_selective_copy(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
-                   [&__pred](_RandomAccessIterator1 __it, _DifferenceType __idx){ return __pred(__it[__idx]); }
-               );
+        return __parallel_selective_copy(
+            __tag, std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
+            [&__pred](_RandomAccessIterator1 __it, _DifferenceType __idx){ return __pred(__it[__idx]); });
     }
     // trivial sequence - use serial algorithm
     return __internal::__brick_copy_if(__first, __last, __result, __pred, _IsVector{});
@@ -1586,10 +1586,11 @@ __pattern_unique_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec
     {
         *__result++ = *__first++; // Always copy the first element
         --__n;
-        return __parallel_selective_copy(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
-                  [&__pred](_RandomAccessIterator1 __it, _DifferenceType __idx){
-                      return !__pred(__it[__idx], __it[__idx - 1]);
-                  });
+        return __parallel_selective_copy(
+            __tag, std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
+            [&__pred](_RandomAccessIterator1 __it, _DifferenceType __idx){
+                return !__pred(__it[__idx], __it[__idx - 1]);
+            });
     }
     // trivial sequence - use serial algorithm
     return __internal::__brick_unique_copy(__first, __last, __result, __pred, _IsVector{});
@@ -2325,7 +2326,8 @@ __pattern_partition_copy(__parallel_tag<_IsVector>, _ExecutionPolicy&& __exec, _
                 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n,
                 std::make_pair(_DifferenceType(0), _DifferenceType(0)),
                 [=, &__pred](_DifferenceType __i, _DifferenceType __len) { // Reduce
-                    return __internal::__brick_compute_mask(__first + __i, __len,
+                    return __internal::__brick_compute_mask(
+                        __first + __i, __len,
                         [&__pred](_RandomAccessIterator1 __it, _DifferenceType __idx){ return __pred(__it[__idx]);},
                         __mask + __i, _IsVector{});
                 },