From 317f15304e6091a1f3cc58c52d36df037ef50db0 Mon Sep 17 00:00:00 2001 From: Scott McMurray Date: Sat, 2 Feb 2019 01:32:56 -0800 Subject: Revert "Remove mentions of unstable sort_by_cached key from stable documentation" This reverts commit 9c7b69e17909ceb090a1c4b8882a4e0924a2a755. --- src/liballoc/slice.rs | 4 ++++ 1 file changed, 4 insertions(+) (limited to 'src/liballoc') diff --git a/src/liballoc/slice.rs b/src/liballoc/slice.rs index 1f68efd019b..f4b2d463778 100644 --- a/src/liballoc/slice.rs +++ b/src/liballoc/slice.rs @@ -257,6 +257,10 @@ impl [T] { /// This sort is stable (i.e., does not reorder equal elements) and `O(m n log(m n))` /// worst-case, where the key function is `O(m)`. /// + /// For expensive key functions (e.g. functions that are not simple property accesses or + /// basic operations), [`sort_by_cached_key`](#method.sort_by_cached_key) is likely to be + /// significantly faster, as it does not recompute element keys. + /// /// When applicable, unstable sorting is preferred because it is generally faster than stable /// sorting and it doesn't allocate auxiliary memory. /// See [`sort_unstable_by_key`](#method.sort_unstable_by_key). -- cgit 1.4.1-3-g733a5