1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
use std;
fn check_sort(vec[mutable int] v1, vec[mutable int] v2) {
auto len = std::_vec::len[int](v1);
fn ltequal(&int a, &int b) -> bool {
ret a <= b;
}
auto f = ltequal;
std::sort::quick_sort[int](f, v1);
auto i = 0u;
while (i < len) {
log v2.(i);
assert (v2.(i) == v1.(i));
i += 1u;
}
}
fn main() {
{
auto v1 = vec(mutable 3,7,4,5,2,9,5,8);
auto v2 = vec(mutable 2,3,4,5,5,7,8,9);
check_sort(v1, v2);
}
{
auto v1 = vec(mutable 1,1,1);
auto v2 = vec(mutable 1,1,1);
check_sort(v1, v2);
}
{
let vec[mutable int] v1 = vec(mutable);
let vec[mutable int] v2 = vec(mutable);
check_sort(v1, v2);
}
{
auto v1 = vec(mutable 9);
auto v2 = vec(mutable 9);
check_sort(v1, v2);
}
{
auto v1 = vec(mutable 9,3,3,3,9);
auto v2 = vec(mutable 3,3,3,9,9);
check_sort(v1, v2);
}
}
// Local Variables:
// mode: rust;
// fill-column: 78;
// indent-tabs-mode: nil
// c-basic-offset: 4
// buffer-file-coding-system: utf-8-unix
// compile-command: "make -k -C .. 2>&1 | sed -e 's/\\/x\\//x:\\//g'";
// End:
|