Fix linkchecker doc errors · model-checking/verify-rust-std@86878b9 (original) (raw)
`@@ -2893,7 +2893,7 @@ impl [T] {
`
2893
2893
`/// The current implementation is based on [ipnsort] by Lukas Bergdoll and Orson Peters, which
`
2894
2894
`/// combines the fast average case of quicksort with the fast worst case of heapsort, achieving
`
2895
2895
`/// linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the
`
2896
``
`-
/// expected time to sort the data is O(n log(k)).
`
``
2896
`+
/// expected time to sort the data is O(n * log(k)).
`
2897
2897
`///
`
2898
2898
`/// It is typically faster than stable sorting, except in a few special cases, e.g., when the
`
2899
2899
`/// slice is partially sorted.
`
`@@ -2950,7 +2950,7 @@ impl [T] {
`
2950
2950
`/// The current implementation is based on [ipnsort] by Lukas Bergdoll and Orson Peters, which
`
2951
2951
`/// combines the fast average case of quicksort with the fast worst case of heapsort, achieving
`
2952
2952
`/// linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the
`
2953
``
`-
/// expected time to sort the data is O(n log(k)).
`
``
2953
`+
/// expected time to sort the data is O(n * log(k)).
`
2954
2954
`///
`
2955
2955
`/// It is typically faster than stable sorting, except in a few special cases, e.g., when the
`
2956
2956
`/// slice is partially sorted.
`
`@@ -2994,7 +2994,7 @@ impl [T] {
`
2994
2994
`/// The current implementation is based on [ipnsort] by Lukas Bergdoll and Orson Peters, which
`
2995
2995
`/// combines the fast average case of quicksort with the fast worst case of heapsort, achieving
`
2996
2996
`/// linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the
`
2997
``
`-
/// expected time to sort the data is O(n log(k)).
`
``
2997
`+
/// expected time to sort the data is O(n * log(k)).
`
2998
2998
`///
`
2999
2999
`/// It is typically faster than stable sorting, except in a few special cases, e.g., when the
`
3000
3000
`/// slice is partially sorted.
`
`@@ -3042,8 +3042,8 @@ impl [T] {
`
3042
3042
`/// Median of Medians using Tukey's Ninther for pivot selection, which guarantees linear runtime
`
3043
3043
`/// for all inputs.
`
3044
3044
`///
`
3045
``
`-
/// It is typically faster than sorting, except in a few special cases, e.g., when the slice is
`
3046
``
`` -
/// nearly fully sorted, where [slice::sort
] may be faster.
``
``
3045
`+
/// It is typically faster than stable sorting, except in a few special cases, e.g., when the
`
``
3046
`` +
/// slice is nearly fully sorted, where slice::sort
may be faster.
``
3047
3047
`///
`
3048
3048
`` /// [sort_unstable
]: slice::sort_unstable
``
3049
3049
`///
`
`@@ -3103,8 +3103,8 @@ impl [T] {
`
3103
3103
`/// Median of Medians using Tukey's Ninther for pivot selection, which guarantees linear runtime
`
3104
3104
`/// for all inputs.
`
3105
3105
`///
`
3106
``
`-
/// It is typically faster than sorting, except in a few special cases, e.g., when the slice is
`
3107
``
`` -
/// nearly fully sorted, where [slice::sort
] may be faster.
``
``
3106
`+
/// It is typically faster than stable sorting, except in a few special cases, e.g., when the
`
``
3107
`` +
/// slice is nearly fully sorted, where slice::sort
may be faster.
``
3108
3108
`///
`
3109
3109
`` /// [sort_unstable
]: slice::sort_unstable
``
3110
3110
`///
`
`@@ -3168,8 +3168,8 @@ impl [T] {
`
3168
3168
`/// Median of Medians using Tukey's Ninther for pivot selection, which guarantees linear runtime
`
3169
3169
`/// for all inputs.
`
3170
3170
`///
`
3171
``
`-
/// It is typically faster than sorting, except in a few special cases, e.g., when the slice is
`
3172
``
`` -
/// nearly fully sorted, where [slice::sort
] may be faster.
``
``
3171
`+
/// It is typically faster than stable sorting, except in a few special cases, e.g., when the
`
``
3172
`` +
/// slice is nearly fully sorted, where slice::sort
may be faster.
``
3173
3173
`///
`
3174
3174
`` /// [sort_unstable
]: slice::sort_unstable
``
3175
3175
`///
`