Clarify that ordering is unspecified
This commit is contained in:
parent
b9f008b1ee
commit
06b17a2181
1 changed files with 2 additions and 0 deletions
|
@ -373,6 +373,8 @@ impl<T> [T] {
|
||||||
///
|
///
|
||||||
/// During sorting, the key function is called at most once per element, by using
|
/// During sorting, the key function is called at most once per element, by using
|
||||||
/// temporary storage to remember the results of key evaluation.
|
/// 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*))
|
/// 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*).
|
/// worst-case, where the key function is *O*(*m*).
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue