@@ -347,7 +347,7 @@ impl<K: Ord, V> BTreeMap<K, V> {
347
347
let result = stack. with ( move |pusher, node| {
348
348
// Same basic logic as found in `find`, but with PartialSearchStack mediating the
349
349
// actual nodes for us
350
- return match Node :: search ( node, & key) {
350
+ match Node :: search ( node, & key) {
351
351
Found ( mut handle) => {
352
352
// Perfect match, swap the values and return the old one
353
353
mem:: swap ( handle. val_mut ( ) , & mut value) ;
@@ -372,7 +372,7 @@ impl<K: Ord, V> BTreeMap<K, V> {
372
372
}
373
373
} ) ;
374
374
match result {
375
- Finished ( ret) => { return ret; } ,
375
+ Finished ( ret) => return ret,
376
376
Continue ( ( new_stack, renewed_key, renewed_val) ) => {
377
377
stack = new_stack;
378
378
key = renewed_key;
@@ -439,7 +439,7 @@ impl<K: Ord, V> BTreeMap<K, V> {
439
439
let mut stack = stack:: PartialSearchStack :: new ( self ) ;
440
440
loop {
441
441
let result = stack. with ( move |pusher, node| {
442
- return match Node :: search ( node, key) {
442
+ match Node :: search ( node, key) {
443
443
Found ( handle) => {
444
444
// Perfect match. Terminate the stack here, and remove the entry
445
445
Finished ( Some ( pusher. seal ( handle) . remove ( ) ) )
@@ -1560,7 +1560,7 @@ impl<K: Ord, V> BTreeMap<K, V> {
1560
1560
let mut stack = stack:: PartialSearchStack :: new ( self ) ;
1561
1561
loop {
1562
1562
let result = stack. with ( move |pusher, node| {
1563
- return match Node :: search ( node, & key) {
1563
+ match Node :: search ( node, & key) {
1564
1564
Found ( handle) => {
1565
1565
// Perfect match
1566
1566
Finished ( Occupied ( OccupiedEntry {
0 commit comments