bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

Rollup merge of #104641 - tshepang:grammar, r=Mark-Simulacrum

Browse source 
replace unusual grammar
This commit is contained in:
Matthias Krüger 2022-11-20 23:50:29 +01:00 • committed by GitHub
commit 9a9569698b
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

4
library/alloc/src/collections/btree/map.rs
View file

@ -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 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 /// 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 /// 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 /// are both notably expensive things to do in practice, we are forced to, at the very least,
/// the BST strategy. /// reconsider the BST strategy.
/// ///
/// A B-Tree instead makes each node contain B-1 to 2B-1 elements in a contiguous array. By doing /// 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 /// this, we reduce the number of allocations by a factor of B, and improve cache efficiency in