roto 0.12.0

a statically-typed, compiled, embedded scripting language
Documentation 
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
63

// This benchmark is adapted from https://github.com/khvzak/script-bench-rs.
//
// Any changes to this benchmark should be upstreamed into the
// `script-bench-rs` repository.

const CHARSET: String = "012345678abcdef";

fn generate_string(len: u64) -> String {
    let result = [];
    let i = 0;
    while i < len {
        result.push(CHARSET.get(rand(CHARSET.len())));
        i = i + 1;
    }

    result.join("")
}

fn get_or_empty(arr: List[RustData], idx: u64) -> RustData {
    match arr.get(idx) {
        Some(s) => s,
        None => RustData.new(""),
    }
}

fn partition(arr: List[RustData], lo: u64, hi: u64) -> u64 {
    let pivot_idx = (lo + hi) / 2;
    let pivot = get_or_empty(arr, pivot_idx);
    arr.swap(pivot_idx, hi);
    let j = lo;
    while lo < hi {
        if get_or_empty(arr, lo).lt(pivot) {
            arr.swap(lo, j);
            j = j + 1;
        }
        lo = lo + 1;
    }
    arr.swap(j, hi);
    return j;
}

fn quicksort(arr: List[RustData], lo: u64, hi: u64) {
    while lo < hi {
        let p = partition(arr, lo, hi);
        if p > 0 {
            quicksort(arr, lo, p - 1);
        }
        // Tail recursion
        lo = p + 1;
    }
}

fn main() -> List[RustData] {
    let list = [];
    let i = 0;
    while i < 10000 {
        list.push(RustData.new(generate_string(8 + rand(16))));
        i = i + 1;
    }
    quicksort(list, 0, list.len() - 1);

    list
}