diff options
| author | Matthias Krüger <matthias.krueger@famsik.de> | 2022-11-20 23:50:29 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-11-20 23:50:29 +0100 |
| commit | 9a9569698bc42aa59a78bcb1a2a889b43e32acec (patch) | |
| tree | e859474798d0955abc55924a6b635a41c416d3b8 /library/alloc/src | |
| parent | b3d491696ba5a769d2300f274bee4fb998095ef6 (diff) | |
| parent | bebe5db5178a8444e4517e61f4ded9b612013fd3 (diff) | |
| download | rust-9a9569698bc42aa59a78bcb1a2a889b43e32acec.tar.gz rust-9a9569698bc42aa59a78bcb1a2a889b43e32acec.zip | |
Rollup merge of #104641 - tshepang:grammar, r=Mark-Simulacrum
replace unusual grammar
Diffstat (limited to 'library/alloc/src')
| -rw-r--r-- | library/alloc/src/collections/btree/map.rs | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/library/alloc/src/collections/btree/map.rs b/library/alloc/src/collections/btree/map.rs index 8a771934712..1d9c4460ec9 100644 --- a/library/alloc/src/collections/btree/map.rs +++ b/library/alloc/src/collections/btree/map.rs @@ -46,8 +46,8 @@ pub(super) const MIN_LEN: usize = node::MIN_LEN_AFTER_SPLIT; /// is done is *very* inefficient for modern computer architectures. In particular, every element /// is stored in its own individually heap-allocated node. This means that every single insertion /// triggers a heap-allocation, and every single comparison should be a cache-miss. Since these -/// are both notably expensive things to do in practice, we are forced to at very least reconsider -/// the BST strategy. +/// are both notably expensive things to do in practice, we are forced to, at the very least, +/// reconsider the BST strategy. /// /// A B-Tree instead makes each node contain B-1 to 2B-1 elements in a contiguous array. By doing /// this, we reduce the number of allocations by a factor of B, and improve cache efficiency in |