From c6f62b637422783fc44de92e4011344e46f17498 Mon Sep 17 00:00:00 2001
From: Brian Anderson <banderson@mozilla.com>
Date: Sat, 14 Jan 2012 17:02:49 -0800
Subject: [PATCH] bench: Update shootout-binarytrees to use unique boxes

Shared boxes have a huge performance overhead due to #1493
---
 src/test/bench/shootout-binarytrees.rs | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/test/bench/shootout-binarytrees.rs b/src/test/bench/shootout-binarytrees.rs
index 0454eaaf8692..a65377c14425 100644
--- a/src/test/bench/shootout-binarytrees.rs
+++ b/src/test/bench/shootout-binarytrees.rs
@@ -1,9 +1,9 @@
 use std;
 import int;
 
-tag tree { nil; node(@tree, @tree, int); }
+tag tree { nil; node(~tree, ~tree, int); }
 
-fn item_check(t: @tree) -> int {
+fn item_check(t: ~tree) -> int {
     alt *t {
       nil. { ret 0; }
       node(left, right, item) {
@@ -12,11 +12,11 @@ fn item_check(t: @tree) -> int {
     }
 }
 
-fn bottom_up_tree(item: int, depth: int) -> @tree {
+fn bottom_up_tree(item: int, depth: int) -> ~tree {
     if depth > 0 {
-        ret @node(bottom_up_tree(2 * item - 1, depth - 1),
+        ret ~node(bottom_up_tree(2 * item - 1, depth - 1),
                   bottom_up_tree(2 * item, depth - 1), item);
-    } else { ret @nil; }
+    } else { ret ~nil; }
 }
 
 fn main() {