then be -> be based on feedback from @ibraheemdev
This commit is contained in:
@@ -3070,7 +3070,7 @@ impl<T> [T] {
|
||||
}
|
||||
|
||||
/// 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
|
||||
/// 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
|
||||
/// sort-order position. All elements before `index` will then be `<=` this value, and all
|
||||
/// elements after will be `>=` according to the comparator function.
|
||||
/// sort-order position. All elements before `index` will be `<=` this value, and all elements
|
||||
/// 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
|
||||
/// up at that position), in-place (i.e. does not allocate), and runs in *O*(*n*) time. This
|
||||
|
||||
Reference in New Issue
Block a user