@@ -1162,7 +1162,7 @@ impl<T> [T] {
1162
1162
///
1163
1163
/// # Current implementation
1164
1164
///
1165
- /// The current algorithm is based on Orson Peters' [pdqsort][ pattern-defeating quicksort],
1165
+ /// The current algorithm is based on Orson Peters' [pattern-defeating quicksort][pdqsort ],
1166
1166
/// which is a quicksort variant designed to be very fast on certain kinds of patterns,
1167
1167
/// sometimes achieving linear time. It is randomized but deterministic, and falls back to
1168
1168
/// heapsort on degenerate inputs.
@@ -1199,7 +1199,7 @@ impl<T> [T] {
1199
1199
///
1200
1200
/// # Current implementation
1201
1201
///
1202
- /// The current algorithm is based on Orson Peters' [pdqsort][ pattern-defeating quicksort],
1202
+ /// The current algorithm is based on Orson Peters' [pattern-defeating quicksort][pdqsort ],
1203
1203
/// which is a quicksort variant designed to be very fast on certain kinds of patterns,
1204
1204
/// sometimes achieving linear time. It is randomized but deterministic, and falls back to
1205
1205
/// heapsort on degenerate inputs.
@@ -1239,7 +1239,7 @@ impl<T> [T] {
1239
1239
///
1240
1240
/// # Current implementation
1241
1241
///
1242
- /// The current algorithm is based on Orson Peters' [pdqsort][ pattern-defeating quicksort],
1242
+ /// The current algorithm is based on Orson Peters' [pattern-defeating quicksort][pdqsort ],
1243
1243
/// which is a quicksort variant designed to be very fast on certain kinds of patterns,
1244
1244
/// sometimes achieving linear time. It is randomized but deterministic, and falls back to
1245
1245
/// heapsort on degenerate inputs.
0 commit comments