Rollup merge of #132060 - joshtriplett:innermost-outermost, r=jieyouxu · qinheping/verify-rust-std@ded2a0a (original) (raw)

4 files changed

lines changed

Original file line number Diff line number Diff line change
@@ -79,7 +79,7 @@ impl<K, V> Root<K, V> {
79 79 }
80 80 open_node.push(key, value, right_tree);
81 81
82 -// Go down to the right-most leaf again.
82 +// Go down to the rightmost leaf again.
83 83 cur_node = open_node.forget_type().last_leaf_edge().into_node();
84 84 }
85 85
Original file line number Diff line number Diff line change
@@ -102,7 +102,7 @@ impl<K, V> Root<K, V> {
102 102 pub fn fix_right_border_of_plentiful(&mut self) {
103 103 let mut cur_node = self.borrow_mut();
104 104 while let Internal(internal) = cur_node.force() {
105 -// Check if right-most child is underfull.
105 +// Check if rightmost child is underfull.
106 106 let mut last_kv = internal.last_kv().consider_for_balancing();
107 107 debug_assert!(last_kv.left_child_len() >= MIN_LEN * 2);
108 108 let right_child_len = last_kv.right_child_len();
Original file line number Diff line number Diff line change
@@ -1521,7 +1521,7 @@ impl<'a, K: 'a, V: 'a> BalancingContext<'a, K, V> {
1521 1521 right_node.val_area_mut(..count - 1),
1522 1522 );
1523 1523
1524 -// Move the left-most stolen pair to the parent.
1524 +// Move the leftmost stolen pair to the parent.
1525 1525 let k = left_node.key_area_mut(new_left_len).assume_init_read();
1526 1526 let v = left_node.val_area_mut(new_left_len).assume_init_read();
1527 1527 let (k, v) = self.parent.replace_kv(k, v);
@@ -1570,7 +1570,7 @@ impl<'a, K: 'a, V: 'a> BalancingContext<'a, K, V> {
1570 1570
1571 1571 // Move leaf data.
1572 1572 {
1573 -// Move the right-most stolen pair to the parent.
1573 +// Move the rightmost stolen pair to the parent.
1574 1574 let k = right_node.key_area_mut(count - 1).assume_init_read();
1575 1575 let v = right_node.val_area_mut(count - 1).assume_init_read();
1576 1576 let (k, v) = self.parent.replace_kv(k, v);
Original file line number Diff line number Diff line change
@@ -71,7 +71,7 @@ pub use self::{
71 71 /// this can be useful for specializing [`FromIterator`] implementations or recovering the
72 72 /// remaining elements after an iterator has been partially exhausted.
73 73 ///
74 -/// Note that implementations do not necessarily have to provide access to the inner-most
74 +/// Note that implementations do not necessarily have to provide access to the innermost
75 75 /// source of a pipeline. A stateful intermediate adapter might eagerly evaluate a part
76 76 /// of the pipeline and expose its internal storage as source.
77 77 ///