Skip to content

doc: guarantee call order for sort_by_cached_key #89621

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Jan 19, 2022
Merged

doc: guarantee call order for sort_by_cached_key #89621

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
3eb87db
doc: guarantee call order for sort_by_cached_key
digama0 Oct 7, 2021
b9f008b
Update wording
digama0 Jan 4, 2022
06b17a2
Clarify that ordering is unspecified
digama0 Jan 5, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Clarify that ordering is unspecified
  • Loading branch information
@digama0
digama0 authored Jan 5, 2022
commit 06b17a21813c2869ee50cbc4c8a92a04e40d2959
2 changes: 2 additions & 0 deletions library/alloc/src/slice.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -373,6 +373,8 @@ impl<T> [T] {
///
/// 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*).
Expand Down