Fix wrong big O star bracing in the doc comments · model-checking/verify-rust-std@0f6922d (original) (raw)

`@@ -2893,7 +2893,7 @@ impl [T] {

2893

`/// The current implementation is based on [ipnsort] by Lukas Bergdoll and Orson Peters, which

2894

`/// combines the fast average case of quicksort with the fast worst case of heapsort, achieving

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

`///

2898

`/// It is typically faster than stable sorting, except in a few special cases, e.g., when the

2899

`/// slice is partially sorted.

`@@ -2950,7 +2950,7 @@ impl [T] {

2950

`/// The current implementation is based on [ipnsort] by Lukas Bergdoll and Orson Peters, which

2951

`/// combines the fast average case of quicksort with the fast worst case of heapsort, achieving

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

`///

2955

`/// It is typically faster than stable sorting, except in a few special cases, e.g., when the

2956

`/// slice is partially sorted.

`@@ -2994,7 +2994,7 @@ impl [T] {

2994

`/// The current implementation is based on [ipnsort] by Lukas Bergdoll and Orson Peters, which

2995

`/// combines the fast average case of quicksort with the fast worst case of heapsort, achieving

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

`///

2999

`/// It is typically faster than stable sorting, except in a few special cases, e.g., when the

3000

`/// slice is partially sorted.