mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

bench: Update shootout-binarytrees for style

Browse Source
This commit is contained in:
Brian Anderson 2012-01-14 19:50:23 -08:00
parent c53d0a0af8
commit 9c21673e3f
1 changed files with 15 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
src/test/bench/shootout-binarytrees.rs
View File

@ -19,8 +19,12 @@ fn bottom_up_tree(item: int, depth: int) -> ~tree {
} else { ret ~nil; }
}
fn main() {
let n = 8;
fn main(args: [str]) {
let n = if vec::len(args) == 2u {
int::from_str(args[1])
} else {
15
};
let min_depth = 4;
let max_depth;
if min_depth + 2 > n {
@ -28,8 +32,9 @@ fn main() {
} else { max_depth = n; }
let stretch_depth = max_depth + 1;
let stretch_tree = bottom_up_tree(0, stretch_depth);
#debug("stretch tree of depth %d\t check: %d", stretch_depth,
item_check(stretch_tree));
std::io::println(#fmt("stretch tree of depth %d\t check: %d",
stretch_depth,
item_check(stretch_tree)));
let long_lived_tree = bottom_up_tree(0, max_depth);
let depth = min_depth;
while depth <= max_depth {
@ -43,10 +48,12 @@ fn main() {
chk += item_check(temp_tree);
i += 1;
}
#debug("%d\t trees of depth %d\t check: %d", iterations * 2, depth,
chk);
std::io::println(#fmt("%d\t trees of depth %d\t check: %d",
iterations * 2, depth,
chk));
depth += 2;
}
#debug("long lived trees of depth %d\t check: %d", max_depth,
item_check(long_lived_tree));
std::io::println(#fmt("long lived trees of depth %d\t check: %d",
max_depth,
item_check(long_lived_tree)));
}