Clarify that ordering is unspecified

diff --git a/library/alloc/src/slice.rs b/library/alloc/src/slice.rs
index 020dfcbaac684ab5f0f3646a0985262df66cde93..d03ae2d5c15197c85868ac09a6121e367471693d 100644 (file)
--- a/library/alloc/src/slice.rs
+++ b/library/alloc/src/slice.rs
@@ -373,6 +373,8 @@ pub fn sort_by_key<K, F>(&mut self, mut f: F)
     ///
     /// During sorting, the key function is called at most once per element, by using
     /// temporary storage to remember the results of key evaluation.
+    /// The order of calls to the key function is unspecified and may change in future versions
+    /// of the standard library.
     ///
     /// This sort is stable (i.e., does not reorder equal elements) and *O*(*m* \* *n* + *n* \* log(*n*))
     /// worst-case, where the key function is *O*(*m*).