mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

chore: remove repeat words

Browse Source 
Signed-off-by: cuishuang <imcusg@gmail.com>
This commit is contained in:
cuishuang 2024-07-04 14:56:08 +08:00
parent f6fa358a18
commit b50e915578
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
library/core/src/hint.rs
View File

@ -189,7 +189,7 @@
/// ``` /// ```
/// ///
/// This example is quite unlike anything that would be used in the real world: it is redundant /// This example is quite unlike anything that would be used in the real world: it is redundant
/// to put an an assertion right next to code that checks the same thing, and dereferencing a /// to put an assertion right next to code that checks the same thing, and dereferencing a
/// pointer already has the builtin assumption that it is nonnull. However, it illustrates the /// pointer already has the builtin assumption that it is nonnull. However, it illustrates the
/// kind of changes the optimizer can make even when the behavior is less obviously related. /// kind of changes the optimizer can make even when the behavior is less obviously related.
#[track_caller] #[track_caller]

2
library/core/src/slice/sort/stable/drift.rs
View File

@ -200,7 +200,7 @@ fn logical_merge<T, F: FnMut(&T, &T) -> bool>(
// If one or both of the runs are sorted do a physical merge, using // If one or both of the runs are sorted do a physical merge, using
// quicksort to sort the unsorted run if present. We also *need* to // quicksort to sort the unsorted run if present. We also *need* to
// physically merge if the combined runs would not fit in the scratch space // physically merge if the combined runs would not fit in the scratch space
// anymore (as this would mean we are no longer able to to quicksort them). // anymore (as this would mean we are no longer able to quicksort them).
let len = v.len(); let len = v.len();
let can_fit_in_scratch = len <= scratch.len(); let can_fit_in_scratch = len <= scratch.len();
if !can_fit_in_scratch || left.sorted() || right.sorted() { if !can_fit_in_scratch || left.sorted() || right.sorted() {