Turn bare links into automatic links · model-checking/verify-rust-std@1bf7a30 (original) (raw)
2 files changed
lines changed
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -14,10 +14,10 @@ pub(crate) mod quicksort; | ||
14 | 14 | |
15 | 15 | /// Stable sort called driftsort by Orson Peters and Lukas Bergdoll. |
16 | 16 | /// Design document: |
17 | -/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/driftsort\_introduction/text.md | |
17 | +/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/driftsort\_introduction/text.md\ | |
18 | 18 | /// |
19 | 19 | /// Upholds all safety properties outlined here: |
20 | -/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/sort\_safety/text.md | |
20 | +/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/sort\_safety/text.md\ | |
21 | 21 | #[inline(always)] |
22 | 22 | pub fn sort<T, F: FnMut(&T, &T) -> bool, BufT: BufGuard<T>>(v: &mut [T], is_less: &mut F) { |
23 | 23 | // Arrays of zero-sized types are always all-equal, and thus sorted. |
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -11,10 +11,10 @@ pub(crate) mod quicksort; | ||
11 | 11 | |
12 | 12 | /// Unstable sort called ipnsort by Lukas Bergdoll. |
13 | 13 | /// Design document: |
14 | -/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/ipnsort\_introduction/text.md | |
14 | +/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/ipnsort\_introduction/text.md\ | |
15 | 15 | /// |
16 | 16 | /// Upholds all safety properties outlined here: |
17 | -/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/sort\_safety/text.md | |
17 | +/// https://github.com/Voultapher/sort-research-rs/blob/main/writeup/sort\_safety/text.md\ | |
18 | 18 | #[inline(always)] |
19 | 19 | pub fn sort<T, F: FnMut(&T, &T) -> bool>(v: &mut [T], is_less: &mut F) { |
20 | 20 | // Arrays of zero-sized types are always all-equal, and thus sorted. |