rust-lang/rust
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

then be -> be based on feedback from @ibraheemdev

Browse Source
This commit is contained in:
Michael Sloan
2025-01-18 14:52:16 -07:00
parent 217e10a70c
commit 0257cfb974
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
library/core/src/slice/mod.rs
View File

@@ -3070,7 +3070,7 @@ impl<T> [T] {
} }
/// Reorders the slice such that the element at `index` is at a sort-order position. All /// Reorders the slice such that the element at `index` is at a sort-order position. All
/// elements before `index` will then be `<=` this value, and all elements after will be `>=`. /// elements before `index` will be `<=` this value, and all elements after will be `>=`.
/// ///
/// This reordering is unstable (i.e. any element that compares equal to the nth element may end /// This reordering is unstable (i.e. any element that compares equal to the nth element may end
/// up at that position), in-place (i.e. does not allocate), and runs in *O*(*n*) time. This /// up at that position), in-place (i.e. does not allocate), and runs in *O*(*n*) time. This
@@ -3129,8 +3129,8 @@ impl<T> [T] {
} }
/// Reorders the slice with a comparator function such that the element at `index` is at a /// Reorders the slice with a comparator function such that the element at `index` is at a
/// sort-order position. All elements before `index` will then be `<=` this value, and all /// sort-order position. All elements before `index` will be `<=` this value, and all elements
/// elements after will be `>=` according to the comparator function. /// after will be `>=` according to the comparator function.
/// ///
/// This reordering is unstable (i.e. any element that compares equal to the nth element may end /// This reordering is unstable (i.e. any element that compares equal to the nth element may end
/// up at that position), in-place (i.e. does not allocate), and runs in *O*(*n*) time. This /// up at that position), in-place (i.e. does not allocate), and runs in *O*(*n*) time. This