@@ -364,12 +364,14 @@ X86_SIMD_SORT_INLINE arrsize_t partition_unrolled(type_t *arr,
364364 type_t *biggest)
365365{
366366 if constexpr (num_unroll == 0 ) {
367- return partition<vtype, comparator>(arr, left, right, pivot, smallest, biggest);
367+ return partition<vtype, comparator>(
368+ arr, left, right, pivot, smallest, biggest);
368369 }
369370
370371 /* Use regular partition for smaller arrays */
371372 if (right - left < 3 * num_unroll * vtype::numlanes) {
372- return partition<vtype, comparator>(arr, left, right, pivot, smallest, biggest);
373+ return partition<vtype, comparator>(
374+ arr, left, right, pivot, smallest, biggest);
373375 }
374376
375377 /* make array length divisible by vtype::numlanes, shortening the array */
@@ -547,9 +549,10 @@ qsort_(type_t *arr, arrsize_t left, arrsize_t right, arrsize_t max_iters)
547549 type_t smallest = vtype::type_max ();
548550 type_t biggest = vtype::type_min ();
549551
550- arrsize_t pivot_index
551- = partition_unrolled<vtype, comparator, vtype::partition_unroll_factor>(
552- arr, left, right + 1 , pivot, &smallest, &biggest);
552+ arrsize_t pivot_index = partition_unrolled<vtype,
553+ comparator,
554+ vtype::partition_unroll_factor>(
555+ arr, left, right + 1 , pivot, &smallest, &biggest);
553556
554557 if (pivot_result.result == pivot_result_t ::Only2Values) { return ; }
555558
@@ -590,9 +593,10 @@ X86_SIMD_SORT_INLINE void qselect_(type_t *arr,
590593 type_t smallest = vtype::type_max ();
591594 type_t biggest = vtype::type_min ();
592595
593- arrsize_t pivot_index
594- = partition_unrolled<vtype, comparator, vtype::partition_unroll_factor>(
595- arr, left, right + 1 , pivot, &smallest, &biggest);
596+ arrsize_t pivot_index = partition_unrolled<vtype,
597+ comparator,
598+ vtype::partition_unroll_factor>(
599+ arr, left, right + 1 , pivot, &smallest, &biggest);
596600
597601 type_t leftmostValue = comparator::leftmost (smallest, biggest);
598602 type_t rightmostValue = comparator::rightmost (smallest, biggest);
0 commit comments