Skip to content

Commit dd11f45

Browse files
committed
Auto merge of rust-lang#79988 - ssomers:btree_cleanup_5, r=Mark-Simulacrum
BTreeMap: capture a recurring use pattern as replace_kv r? `@Mark-Simulacrum`
2 parents f61e5ca + 0ae4c95 commit dd11f45

File tree

2 files changed

+10
-8
lines changed

2 files changed

+10
-8
lines changed

library/alloc/src/collections/btree/node.rs

+8-4
Original file line numberDiff line numberDiff line change
@@ -1159,6 +1159,12 @@ impl<'a, K: 'a, V: 'a, NodeType> Handle<NodeRef<marker::Mut<'a>, K, V, NodeType>
11591159
(key, val)
11601160
}
11611161
}
1162+
1163+
/// Replace the key and value that the KV handle refers to.
1164+
pub fn replace_kv(&mut self, k: K, v: V) -> (K, V) {
1165+
let (key, val) = self.kv_mut();
1166+
(mem::replace(key, k), mem::replace(val, v))
1167+
}
11621168
}
11631169

11641170
impl<'a, K: 'a, V: 'a, NodeType> Handle<NodeRef<marker::Mut<'a>, K, V, NodeType>, marker::KV> {
@@ -1432,8 +1438,7 @@ impl<'a, K: 'a, V: 'a> BalancingContext<'a, K, V> {
14321438
unsafe {
14331439
let (k, v, edge) = self.left_child.pop();
14341440

1435-
let k = mem::replace(self.parent.kv_mut().0, k);
1436-
let v = mem::replace(self.parent.kv_mut().1, v);
1441+
let (k, v) = self.parent.replace_kv(k, v);
14371442

14381443
match self.right_child.reborrow_mut().force() {
14391444
ForceResult::Leaf(mut leaf) => leaf.push_front(k, v),
@@ -1455,8 +1460,7 @@ impl<'a, K: 'a, V: 'a> BalancingContext<'a, K, V> {
14551460
unsafe {
14561461
let (k, v, edge) = self.right_child.pop_front();
14571462

1458-
let k = mem::replace(self.parent.kv_mut().0, k);
1459-
let v = mem::replace(self.parent.kv_mut().1, v);
1463+
let (k, v) = self.parent.replace_kv(k, v);
14601464

14611465
match self.left_child.reborrow_mut().force() {
14621466
ForceResult::Leaf(mut leaf) => leaf.push(k, v),

library/alloc/src/collections/btree/remove.rs

+2-4
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
use super::map::MIN_LEN;
22
use super::node::{marker, ForceResult::*, Handle, LeftOrRight::*, NodeRef};
33
use super::unwrap_unchecked;
4-
use core::mem;
54

65
impl<'a, K: 'a, V: 'a> Handle<NodeRef<marker::Mut<'a>, K, V, marker::LeafOrInternal>, marker::KV> {
76
/// Removes a key-value pair from the tree, and returns that pair, as well as
@@ -84,10 +83,9 @@ impl<'a, K: 'a, V: 'a> Handle<NodeRef<marker::Mut<'a>, K, V, marker::Internal>,
8483
// The internal node may have been stolen from or merged. Go back right
8584
// to find where the original KV ended up.
8685
let mut internal = unsafe { unwrap_unchecked(left_hole.next_kv().ok()) };
87-
let old_key = mem::replace(internal.kv_mut().0, left_kv.0);
88-
let old_val = mem::replace(internal.kv_mut().1, left_kv.1);
86+
let old_kv = internal.replace_kv(left_kv.0, left_kv.1);
8987
let pos = internal.next_leaf_edge();
90-
((old_key, old_val), pos)
88+
(old_kv, pos)
9189
}
9290
}
9391

0 commit comments

Comments
 (0)