mirror of
https://github.com/rust-lang/rust.git
synced 2024-11-25 16:24:46 +00:00
fix document
https://users.rust-lang.org/t/is-the-document-in-sortedmap-in-rustc-data-structures-sorted-map-correct/84939 SortedMap have `O(n)` insertions and removal rather than `O(log(n))`
This commit is contained in:
parent
dd12cd6dc6
commit
11525e506e
@ -10,8 +10,8 @@ mod index_map;
|
||||
pub use index_map::SortedIndexMultiMap;
|
||||
|
||||
/// `SortedMap` is a data structure with similar characteristics as BTreeMap but
|
||||
/// slightly different trade-offs: lookup, insertion, and removal are *O*(log(*n*))
|
||||
/// and elements can be iterated in order cheaply.
|
||||
/// slightly different trade-offs: lookup is *O*(log(*n*)), insertion and removal
|
||||
/// are *O*(*n*) but elements can be iterated in order cheaply.
|
||||
///
|
||||
/// `SortedMap` can be faster than a `BTreeMap` for small sizes (<50) since it
|
||||
/// stores data in a more compact way. It also supports accessing contiguous
|
||||
|
Loading…
Reference in New Issue
Block a user