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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
// xfail-stage0
// xfail-stage1
// xfail-stage2
/* -*- mode: rust; indent-tabs-mode: nil -*-
* Implementation of 'fasta' benchmark from
* Computer Language Benchmarks Game
* http://shootout.alioth.debian.org/
*/
use std;
import std::_vec;
import std::_str;
import std::_uint;
import std::_int;
fn LINE_LENGTH() -> uint {
ret 60u;
}
obj myrandom(mutable u32 last) {
fn next(u32 mx) -> u32 {
last = (last * 3877u32 + 29573u32) % 139968u32;
auto ans = (mx*last) / 139968u32;
ret ans;
}
}
type aminoacids = tup(char, u32);
fn make_cumulative(vec[aminoacids] aa) -> vec[aminoacids] {
let u32 cp = 0u32;
let vec[aminoacids] ans = vec();
for (aminoacids a in aa) {
cp += a._1;
ans += vec(tup(a._0, cp));
}
ret ans;
}
fn select_random(u32 r, vec[aminoacids] genelist) -> char {
if (r < genelist.(0)._1) {
ret genelist.(0)._0;
}
fn bisect(vec[aminoacids] v, uint lo, uint hi, u32 target) -> char {
if (hi > (lo + 1u)) {
let uint mid = lo + (hi - lo) / 2u;
if (target < v.(mid)._1) {
be bisect(v, lo, mid, target);
}
else {
be bisect(v, mid, hi, target);
}
}
else {
ret v.(hi)._0;
}
}
ret bisect(genelist, 0u, _vec::len[aminoacids](genelist) - 1u, r);
}
fn make_random_fasta(str id, str desc, vec[aminoacids] genelist, int n) {
log(">" + id + " " + desc);
auto rng = myrandom(std::rand::mk_rng().next());
let str op = "";
for each (uint i in _uint::range(0u, n as uint)) {
_str::push_byte(op, select_random(rng.next(100u32), genelist) as u8);
if (_str::byte_len(op) >= LINE_LENGTH()) {
log(op);
op = "";
}
}
if (_str::byte_len(op) > 0u) {
log(op);
}
}
fn make_repeat_fasta(str id, str desc, str s, int n) {
log(">" + id + " " + desc);
let str op = "";
let uint sl = _str::byte_len(s);
for each (uint i in _uint::range(0u, n as uint)) {
_str::push_byte(op, s.(i % sl));
if (_str::byte_len(op) >= LINE_LENGTH()) {
log(op);
op = "";
}
}
if (_str::byte_len(op) > 0u) {
log(op);
}
}
fn main(vec[str] args) {
let vec[aminoacids] iub = make_cumulative(vec(tup( 'a', 27u32 ),
tup( 'c', 12u32 ),
tup( 'g', 12u32 ),
tup( 't', 27u32 ),
tup( 'B', 2u32 ),
tup( 'D', 2u32 ),
tup( 'H', 2u32 ),
tup( 'K', 2u32 ),
tup( 'M', 2u32 ),
tup( 'N', 2u32 ),
tup( 'R', 2u32 ),
tup( 'S', 2u32 ),
tup( 'V', 2u32 ),
tup( 'W', 2u32 ),
tup( 'Y', 2u32 )));
let vec[aminoacids] homosapiens = make_cumulative(vec(tup( 'a', 30u32 ),
tup( 'c', 20u32 ),
tup( 'g', 20u32 ),
tup( 't', 30u32 )));
let str alu =
"GGCCGGGCGCGGTGGCTCACGCCTGTAATCCCAGCACTTTGG" +
"GAGGCCGAGGCGGGCGGATCACCTGAGGTCAGGAGTTCGAGA" +
"CCAGCCTGGCCAACATGGTGAAACCCCGTCTCTACTAAAAAT" +
"ACAAAAATTAGCCGGGCGTGGTGGCGCGCGCCTGTAATCCCA" +
"GCTACTCGGGAGGCTGAGGCAGGAGAATCGCTTGAACCCGGG" +
"AGGCGGAGGTTGCAGTGAGCCGAGATCGCGCCACTGCACTCC" +
"AGCCTGGGCGACAGAGCGAGACTCCGTCTCAAAAA";
let int n = 512;
make_repeat_fasta ("ONE", "Homo sapiens alu", alu, n*2);
make_random_fasta("TWO", "IUB ambiguity codes", iub, n*3);
make_random_fasta ("THREE", "Homo sapiens frequency", homosapiens, n*5);
}
|