performance measurements

Each table row shows performance measurements for this Rust program with a particular command-line input value N.

 N  CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
120.040.04?730  0% 0% 0% 100%
160.780.7831,184730  1% 0% 3% 100%
2017.2717.29228,788730  1% 1% 1% 100%

Read the ↓ make, command line, and program output logs to see how this program was run.

Read binary-trees benchmark to see what this program should do.

 notes

rustc 1.0.0-alpha (44a287e6e 2015-01-08 17:03:40 -0800)

 binary-trees Rust program source code

// The Computer Language Benchmarks Game
// http://benchmarksgame.alioth.debian.org/
//
// contributed by the Rust Project Developers
// contributed by TeXitoi

extern crate arena;

use std::iter::range_step;
use std::thread::Thread;
use arena::TypedArena;

enum Tree<'a> {
    Nil,
    Node(&'a Tree<'a>, &'a Tree<'a>, i32)
}

fn item_check(t: &Tree) -> i32 {
    match *t {
        Tree::Nil => 0,
        Tree::Node(l, r, i) => i + item_check(l) - item_check(r)
    }
}

fn bottom_up_tree<'r>(arena: &'r TypedArena<Tree<'r>>, item: i32, depth: i32)
                  -> &'r Tree<'r> {
    if depth > 0 {
        arena.alloc(Tree::Node(bottom_up_tree(arena, 2 * item - 1, depth - 1),
                               bottom_up_tree(arena, 2 * item, depth - 1),
                               item))
    } else {
        arena.alloc(Tree::Nil)
    }
}

fn main() {
    let n = std::os::args().get(1).and_then(|n| n.parse()).unwrap_or(10);
    let min_depth = 4;
    let max_depth = if min_depth + 2 > n {min_depth + 2} else {n};

    {
        let arena = TypedArena::new();
        let depth = max_depth + 1;
        let tree = bottom_up_tree(&arena, 0, depth);

        println!("stretch tree of depth {}\t check: {}",
                 depth, item_check(tree));
    }

    let long_lived_arena = TypedArena::new();
    let long_lived_tree = bottom_up_tree(&long_lived_arena, 0, max_depth);

    let messages = range_step(min_depth, max_depth + 1, 2).map(|depth| {
            use std::num::Int;
            let iterations = 2.pow((max_depth - depth + min_depth) as usize);
            Thread::scoped(move|| {
                let mut chk = 0;
                for i in 1 .. iterations + 1 {
                    let arena = TypedArena::new();
                    let a = bottom_up_tree(&arena, i, depth);
                    let b = bottom_up_tree(&arena, -i, depth);
                    chk += item_check(a) + item_check(b);
                }
                format!("{}\t trees of depth {}\t check: {}",
                        iterations * 2, depth, chk)
            })
        }).collect::<Vec<_>>();

    for message in messages.into_iter() {
        println!("{}", message.join().ok().unwrap());
    }

    println!("long lived tree of depth {}\t check: {}",
             max_depth, item_check(long_lived_tree));
}

 make, command-line, and program output logs

Sat, 10 Jan 2015 20:28:21 GMT

MAKE:
/usr/local/src/rust/bin/rustc -C opt-level=3 -C target-cpu=core2 -C lto binarytrees.rs -o binarytrees.rust_run
binarytrees.rs:7:1: 7:20 warning: use of unstable item
binarytrees.rs:7 extern crate arena;
                 ^~~~~~~~~~~~~~~~~~~
note: this feature may not be used in the beta release channel
binarytrees.rs:28:15: 30:38 warning: use of unstable item
binarytrees.rs:28         arena.alloc(Tree::Node(bottom_up_tree(arena, 2 * item - 1, depth - 1),
binarytrees.rs:29                                bottom_up_tree(arena, 2 * item, depth - 1),
binarytrees.rs:30                                item))
note: this feature may not be used in the beta release channel
binarytrees.rs:32:15: 32:31 warning: use of unstable item
binarytrees.rs:32         arena.alloc(Tree::Nil)
                                ^~~~~~~~~~~~~~~~
note: this feature may not be used in the beta release channel
binarytrees.rs:37:13: 37:26 warning: use of unstable item
binarytrees.rs:37     let n = std::os::args().get(1).and_then(|n| n.parse()).unwrap_or(10);
                              ^~~~~~~~~~~~~
note: this feature may not be used in the beta release channel
binarytrees.rs:37:51: 37:58 warning: use of unstable item: this method was just created
binarytrees.rs:37     let n = std::os::args().get(1).and_then(|n| n.parse()).unwrap_or(10);
                                                                    ^~~~~~~
note: this feature may not be used in the beta release channel
binarytrees.rs:42:21: 42:36 warning: use of unstable item
binarytrees.rs:42         let arena = TypedArena::new();
                                      ^~~~~~~~~~~~~~~
note: this feature may not be used in the beta release channel
binarytrees.rs:50:28: 50:43 warning: use of unstable item
binarytrees.rs:50     let long_lived_arena = TypedArena::new();
                                             ^~~~~~~~~~~~~~~
note: this feature may not be used in the beta release channel
binarytrees.rs:53:20: 53:30 warning: use of unstable item: likely to be replaced by range notation and adapters
binarytrees.rs:53     let messages = range_step(min_depth, max_depth + 1, 2).map(|depth| {
                                     ^~~~~~~~~~
note: this feature may not be used in the beta release channel
binarytrees.rs:55:32: 55:77 warning: use of unstable item: pending integer conventions
binarytrees.rs:55             let iterations = 2.pow((max_depth - depth + min_depth) as usize);
                                                 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
note: this feature may not be used in the beta release channel
binarytrees.rs:59:33: 59:48 warning: use of unstable item
binarytrees.rs:59                     let arena = TypedArena::new();
                                                  ^~~~~~~~~~~~~~~
note: this feature may not be used in the beta release channel
binarytrees.rs:56:13: 56:27 warning: use of unstable item: may change with specifics of new Send semantics
binarytrees.rs:56             Thread::scoped(move|| {
                              ^~~~~~~~~~~~~~
note: this feature may not be used in the beta release channel
rm binarytrees.rs
7.69s to complete and log all make actions

COMMAND LINE:
./binarytrees.rust_run 20

PROGRAM OUTPUT:
stretch tree of depth 21	 check: -1
2097152	 trees of depth 4	 check: -2097152
524288	 trees of depth 6	 check: -524288
131072	 trees of depth 8	 check: -131072
32768	 trees of depth 10	 check: -32768
8192	 trees of depth 12	 check: -8192
2048	 trees of depth 14	 check: -2048
512	 trees of depth 16	 check: -512
128	 trees of depth 18	 check: -128
32	 trees of depth 20	 check: -32
long lived tree of depth 20	 check: -1

Revised BSD license

  Home   Conclusions   License   Play