diff options
| author | Stjepan Glavina <stjepang@gmail.com> | 2017-01-17 01:11:06 +0100 |
|---|---|---|
| committer | Steve Klabnik <steve@steveklabnik.com> | 2017-01-25 13:57:35 -0500 |
| commit | 11ede684ee2e3eee4b3586174b2d5008b58a86cf (patch) | |
| tree | a200745d635b15d6c70718491d98dfab6c20813b | |
| parent | c2b153b133d244015e4d174d893e75a733db12df (diff) | |
| download | rust-11ede684ee2e3eee4b3586174b2d5008b58a86cf.tar.gz rust-11ede684ee2e3eee4b3586174b2d5008b58a86cf.zip | |
Fix: insertion_len -> max_insertion
| -rw-r--r-- | src/libcollections/slice.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libcollections/slice.rs b/src/libcollections/slice.rs index 211394180e8..18e4a23fa8d 100644 --- a/src/libcollections/slice.rs +++ b/src/libcollections/slice.rs @@ -1560,7 +1560,7 @@ fn merge_sort<T, F>(v: &mut [T], mut compare: F) // FIXME #12092: These numbers are platform-specific and need more extensive testing/tuning. // - // If `v` has length up to `insertion_len`, simply switch to insertion sort because it is going + // If `v` has length up to `max_insertion`, simply switch to insertion sort because it is going // to perform better than merge sort. For bigger types `T`, the threshold is smaller. // // Short runs are extended using insertion sort to span at least `min_run` elements, in order |