mirror of
https://github.com/rust-lang/rust
synced 2024-10-19 15:03:55 +00:00
core: Remove some redundant {}s from the sorting code
This commit is contained in:
parent
7cc28c128b
commit
cde240c1e8
|
@ -773,7 +773,7 @@ fn recurse<'a, T, F>(mut v: &'a mut [T], is_less: &mut F, mut pred: Option<&'a T
|
|||
let mid = partition_equal(v, pivot, is_less);
|
||||
|
||||
// Continue sorting elements greater than the pivot.
|
||||
v = &mut { v }[mid..];
|
||||
v = &mut v[mid..];
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
@ -784,7 +784,7 @@ fn recurse<'a, T, F>(mut v: &'a mut [T], is_less: &mut F, mut pred: Option<&'a T
|
|||
was_partitioned = was_p;
|
||||
|
||||
// Split the slice into `left`, `pivot`, and `right`.
|
||||
let (left, right) = { v }.split_at_mut(mid);
|
||||
let (left, right) = v.split_at_mut(mid);
|
||||
let (pivot, right) = right.split_at_mut(1);
|
||||
let pivot = &pivot[0];
|
||||
|
||||
|
@ -860,7 +860,7 @@ fn partition_at_index_loop<'a, T, F>(
|
|||
let (mid, _) = partition(v, pivot, is_less);
|
||||
|
||||
// Split the slice into `left`, `pivot`, and `right`.
|
||||
let (left, right) = { v }.split_at_mut(mid);
|
||||
let (left, right) = v.split_at_mut(mid);
|
||||
let (pivot, right) = right.split_at_mut(1);
|
||||
let pivot = &pivot[0];
|
||||
|
||||
|
|
Loading…
Reference in a new issue