}
};
- let seed = ~[1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+ let seed = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
{
- let rng = rand::seeded_rng(&seed);
+ let rng = rand::seeded_rng(seed);
let mut results = empty_results();
old_int_benchmarks(rng, num_keys, &mut results);
old_str_benchmarks(rng, num_keys, &mut results);
}
{
- let rng = rand::seeded_rng(&seed);
+ let rng = rand::seeded_rng(seed);
let mut results = empty_results();
linear_int_benchmarks(rng, num_keys, &mut results);
linear_str_benchmarks(rng, num_keys, &mut results);
}
{
- let rng = rand::seeded_rng(&seed);
+ let rng = rand::seeded_rng(seed);
let mut results = empty_results();
tree_int_benchmarks(rng, num_keys, &mut results);
tree_str_benchmarks(rng, num_keys, &mut results);
}
};
- let seed = ~[1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+ let seed = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
let max = 200000;
{
- let rng = rand::seeded_rng(&seed);
+ let rng = rand::seeded_rng(seed);
let mut results = empty_results();
results.bench_int(rng, num_keys, max, || LinearSet::new::<uint>());
results.bench_str(rng, num_keys, || LinearSet::new::<~str>());
}
{
- let rng = rand::seeded_rng(&seed);
+ let rng = rand::seeded_rng(seed);
let mut results = empty_results();
results.bench_int(rng, num_keys, max, || TreeSet::new::<uint>());
results.bench_str(rng, num_keys, || TreeSet::new::<~str>());
}
{
- let rng = rand::seeded_rng(&seed);
+ let rng = rand::seeded_rng(seed);
let mut results = empty_results();
results.bench_int(rng, num_keys, max, || BitvSet::new());
write_results("std::bitv::BitvSet", &results);