Skip to content
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.

Commit 4df2059

Browse files
committedJul 4, 2024
chore: remove repeat words
Signed-off-by: cuishuang <imcusg@gmail.com>
1 parent 13d5a42 commit 4df2059

File tree

2 files changed

+2
-2
lines changed

2 files changed

+2
-2
lines changed
 

‎core/src/hint.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -189,7 +189,7 @@ pub const unsafe fn unreachable_unchecked() -> ! {
189189
/// ```
190190
///
191191
/// This example is quite unlike anything that would be used in the real world: it is redundant
192-
/// to put an an assertion right next to code that checks the same thing, and dereferencing a
192+
/// to put an assertion right next to code that checks the same thing, and dereferencing a
193193
/// pointer already has the builtin assumption that it is nonnull. However, it illustrates the
194194
/// kind of changes the optimizer can make even when the behavior is less obviously related.
195195
#[track_caller]

‎core/src/slice/sort/stable/drift.rs

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

0 commit comments

Comments
 (0)
Failed to load comments.