diff options
| author | Stjepan Glavina <stjepang@gmail.com> | 2017-01-20 09:11:11 +0100 |
|---|---|---|
| committer | Steve Klabnik <steve@steveklabnik.com> | 2017-01-25 13:57:36 -0500 |
| commit | e02f923e37402273a4971e2c015842ecc4c5f0d9 (patch) | |
| tree | 534f041c51e1b8187ffc002489eefefa0c005da7 | |
| parent | 11ede684ee2e3eee4b3586174b2d5008b58a86cf (diff) | |
| download | rust-e02f923e37402273a4971e2c015842ecc4c5f0d9.tar.gz rust-e02f923e37402273a4971e2c015842ecc4c5f0d9.zip | |
Remove trailing whitespace
| -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 18e4a23fa8d..fc49c9f5643 100644 --- a/src/libcollections/slice.rs +++ b/src/libcollections/slice.rs @@ -1067,7 +1067,7 @@ impl<T> [T] { /// This sort is stable (i.e. does not reorder equal elements) and `O(n log n)` worst-case. /// /// # Current implementation - /// + /// /// The current algorithm is an adaptive, iterative merge sort inspired by /// [timsort](https://en.wikipedia.org/wiki/Timsort). /// It is designed to be very fast in cases where the slice is nearly sorted, or consists of |