Use Vec in the quicksort test.

This commit is contained in:
Ms2ger 2014-05-07 12:26:20 +02:00
parent aa2866a22c
commit c4faad7116

View file

@ -89,10 +89,10 @@ pub mod test {
let mut rng = rand::task_rng();
for _ in range(0, 50000) {
let len: uint = rng.gen();
let mut v: ~[int] = rng.gen_vec((len % 32) + 1).iter().map(|&x| x).collect();
sort::quicksort(v);
let mut v: Vec<int> = rng.gen_vec((len % 32) + 1).iter().map(|&x| x).collect();
sort::quicksort(v.as_mut_slice());
for i in range(0, v.len() - 1) {
assert!(v[i] <= v[i + 1])
assert!(v.get(i) <= v.get(i + 1))
}
}
}