about summary refs log tree commit diff
path: root/src/libstd
diff options
context:
space:
mode:
authorDaniel Micay <danielmicay@gmail.com>2013-01-25 10:51:10 -0500
committerDaniel Micay <danielmicay@gmail.com>2013-01-25 10:55:18 -0500
commitaff3db26aa6e427b68fea577548a270cacdd0153 (patch)
tree7fb5cf1ebab88101e36ea0a41997026822779316 /src/libstd
parente447521c1ca2dbead5b485ddc43060b282840817 (diff)
downloadrust-aff3db26aa6e427b68fea577548a270cacdd0153.tar.gz
rust-aff3db26aa6e427b68fea577548a270cacdd0153.zip
use mutable function argument syntax in treemap
Diffstat (limited to 'src/libstd')
-rw-r--r--src/libstd/treemap.rs17
1 files changed, 6 insertions, 11 deletions
diff --git a/src/libstd/treemap.rs b/src/libstd/treemap.rs
index 36d919494f1..ff8a054700f 100644
--- a/src/libstd/treemap.rs
+++ b/src/libstd/treemap.rs
@@ -526,9 +526,8 @@ pure fn each_reverse<K: Ord, V>(node: &Option<~TreeNode<K, V>>,
 }
 
 // Remove left horizontal link by rotating right
-fn skew<K: Ord, V>(node: ~TreeNode<K, V>) -> ~TreeNode<K, V> {
+fn skew<K: Ord, V>(mut node: ~TreeNode<K, V>) -> ~TreeNode<K, V> {
     if node.left.map_default(false, |x| x.level == node.level) {
-        let mut node = node;
         let mut save = node.left.swap_unwrap();
         node.left <-> save.right; // save.right now None
         save.right = Some(node);
@@ -540,10 +539,9 @@ fn skew<K: Ord, V>(node: ~TreeNode<K, V>) -> ~TreeNode<K, V> {
 
 // Remove dual horizontal link by rotating left and increasing level of
 // the parent
-fn split<K: Ord, V>(node: ~TreeNode<K, V>) -> ~TreeNode<K, V> {
+fn split<K: Ord, V>(mut node: ~TreeNode<K, V>) -> ~TreeNode<K, V> {
     if node.right.map_default(false,
       |x| x.right.map_default(false, |y| y.level == node.level)) {
-        let mut node = node;
         let mut save = node.right.swap_unwrap();
         node.right <-> save.left; // save.left now None
         save.left = Some(node);
@@ -582,8 +580,7 @@ fn remove<K: Ord, V>(node: &mut Option<~TreeNode<K, V>>, key: &K) -> bool {
     fn heir_swap<K: Ord, V>(node: &mut TreeNode<K, V>,
                             child: &mut Option<~TreeNode<K, V>>) {
         // *could* be done without recursion, but it won't borrow check
-        do child.mutate |child| {
-            let mut child = child;
+        do child.mutate |mut child| {
             if child.right.is_some() {
                 heir_swap(&mut *node, &mut child.right);
             } else {
@@ -636,15 +633,13 @@ fn remove<K: Ord, V>(node: &mut Option<~TreeNode<K, V>>, key: &K) -> bool {
             save.level -= 1;
 
             if right_level > save.level {
-                do save.right.mutate |x| {
-                    let mut x = x; x.level = save.level; x
-                }
+                do save.right.mutate |mut x| { x.level = save.level; x }
             }
 
             save = skew(save);
 
-            do save.right.mutate |right| {
-                let mut right = skew(right);
+            do save.right.mutate |mut right| {
+                right = skew(right);
                 right.right.mutate(skew);
                 right
             }