diff options
| author | r00ster91 <r00ster91@protonmail.com> | 2021-10-27 17:43:14 +0200 |
|---|---|---|
| committer | r00ster91 <r00ster91@protonmail.com> | 2021-10-27 17:43:14 +0200 |
| commit | b1b4c6cb004fca11d90102ea2d79dee3ad8597b9 (patch) | |
| tree | 05b4d004beb9be12c03260e398113c698a3d3f2f | |
| parent | 00d5e42e776da900049fe19087bc9b0057ec70cd (diff) | |
| download | rust-b1b4c6cb004fca11d90102ea2d79dee3ad8597b9.tar.gz rust-b1b4c6cb004fca11d90102ea2d79dee3ad8597b9.zip | |
Remove big O notation
| -rw-r--r-- | library/alloc/src/collections/btree/map.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/library/alloc/src/collections/btree/map.rs b/library/alloc/src/collections/btree/map.rs index 07920a6dba6..e1d5ec97678 100644 --- a/library/alloc/src/collections/btree/map.rs +++ b/library/alloc/src/collections/btree/map.rs @@ -55,7 +55,7 @@ pub(super) const MIN_LEN: usize = node::MIN_LEN_AFTER_SPLIT; /// performance on *small* nodes of elements which are cheap to compare. However in the future we /// would like to further explore choosing the optimal search strategy based on the choice of B, /// and possibly other factors. Using linear search, searching for a random element is expected -/// to take O(B * log(n)) comparisons, which is generally worse than a BST. In practice, +/// to take B * log(n) comparisons, which is generally worse than a BST. In practice, /// however, performance is excellent. /// /// It is a logic error for a key to be modified in such a way that the key's ordering relative to |