1 // The Computer Language Benchmarks Game
2 // http://benchmarksgame.alioth.debian.org/
4 // contributed by the Rust Project Developers
6 // Copyright (c) 2014 The Rust Project Developers
8 // All rights reserved.
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions
14 // - Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
17 // - Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in
19 // the documentation and/or other materials provided with the
22 // - Neither the name of "The Computer Language Benchmarks Game" nor
23 // the name of "The Computer Language Shootout Benchmarks" nor the
24 // names of its contributors may be used to endorse or promote
25 // products derived from this software without specific prior
26 // written permission.
28 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
31 // FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
32 // COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
33 // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
34 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
35 // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
37 // STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
38 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
39 // OF THE POSSIBILITY OF SUCH DAMAGE.
41 // ignore-android see #10393 #13206
43 #![feature(slicing_syntax)]
45 use std::string::String;
47 use std::sync::{Arc, Future};
49 static TABLE: [u8, ..4] = [ 'A' as u8, 'C' as u8, 'G' as u8, 'T' as u8 ];
50 static TABLE_SIZE: uint = 2 << 16;
52 static OCCURRENCES: [&'static str, ..5] = [
60 // Code implementation
62 #[deriving(PartialEq, PartialOrd, Ord, Eq)]
66 fn hash(&self) -> u64 {
67 let Code(ret) = *self;
71 fn push_char(&self, c: u8) -> Code {
72 Code((self.hash() << 2) + (pack_symbol(c) as u64))
75 fn rotate(&self, c: u8, frame: uint) -> Code {
76 Code(self.push_char(c).hash() & ((1u64 << (2 * frame)) - 1))
79 fn pack(string: &str) -> Code {
80 string.bytes().fold(Code(0u64), |a, b| a.push_char(b))
83 fn unpack(&self, frame: uint) -> String {
84 let mut key = self.hash();
85 let mut result = Vec::new();
86 for _ in range(0, frame) {
87 result.push(unpack_symbol((key as u8) & 3));
92 String::from_utf8(result).unwrap()
96 // Hash table implementation
99 fn f(&self, entry: &mut Entry);
104 impl TableCallback for BumpCallback {
105 fn f(&self, entry: &mut Entry) {
110 struct PrintCallback(&'static str);
112 impl TableCallback for PrintCallback {
113 fn f(&self, entry: &mut Entry) {
114 let PrintCallback(s) = *self;
115 println!("{}\t{}", entry.count as int, s);
122 next: Option<Box<Entry>>,
126 items: Vec<Option<Box<Entry>>>
130 cur: Option<&'a Entry>,
131 items: slice::Items<'a, Option<Box<Entry>>>,
137 items: Vec::from_fn(TABLE_SIZE, |_| None),
141 fn search_remainder<C:TableCallback>(item: &mut Entry, key: Code, c: C) {
144 let mut entry = box Entry {
150 item.next = Some(entry);
152 Some(ref mut entry) => {
153 if entry.code == key {
158 Table::search_remainder(&mut **entry, key, c)
163 fn lookup<C:TableCallback>(&mut self, key: Code, c: C) {
164 let index = key.hash() % (TABLE_SIZE as u64);
167 if self.items[index as uint].is_none() {
168 let mut entry = box Entry {
174 self.items[index as uint] = Some(entry);
180 let entry = self.items[index as uint].as_mut().unwrap();
181 if entry.code == key {
186 Table::search_remainder(&mut **entry, key, c)
190 fn iter(&self) -> Items {
191 Items { cur: None, items: self.items.iter() }
195 impl<'a> Iterator<&'a Entry> for Items<'a> {
196 fn next(&mut self) -> Option<&'a Entry> {
197 let ret = match self.cur {
201 match self.items.next() {
204 Some(&Some(ref a)) => { i = &**a; break }
207 self.cur = Some(&*i);
213 None => { self.cur = None; }
214 Some(ref next) => { self.cur = Some(&**next); }
222 fn pack_symbol(c: u8) -> u8 {
228 _ => panic!("{}", c as char),
232 fn unpack_symbol(c: u8) -> u8 {
236 fn generate_frequencies(mut input: &[u8], frame: uint) -> Table {
237 let mut frequencies = Table::new();
238 if input.len() < frame { return frequencies; }
239 let mut code = Code(0);
242 for _ in range(0, frame) {
243 code = code.push_char(input[0]);
246 frequencies.lookup(code, BumpCallback);
248 while input.len() != 0 && input[0] != ('>' as u8) {
249 code = code.rotate(input[0], frame);
250 frequencies.lookup(code, BumpCallback);
256 fn print_frequencies(frequencies: &Table, frame: uint) {
257 let mut vector = Vec::new();
258 for entry in frequencies.iter() {
259 vector.push((entry.count, entry.code));
261 vector.as_mut_slice().sort();
263 let mut total_count = 0;
264 for &(count, _) in vector.iter() {
265 total_count += count;
268 for &(count, key) in vector.iter().rev() {
270 key.unpack(frame).as_slice(),
271 (count as f32 * 100.0) / (total_count as f32));
276 fn print_occurrences(frequencies: &mut Table, occurrence: &'static str) {
277 frequencies.lookup(Code::pack(occurrence), PrintCallback(occurrence))
280 fn get_sequence<R: Buffer>(r: &mut R, key: &str) -> Vec<u8> {
281 let mut res = Vec::new();
282 for l in r.lines().map(|l| l.ok().unwrap())
283 .skip_while(|l| key != l.as_slice().slice_to(key.len())).skip(1)
285 res.push_all(l.as_slice().trim().as_bytes());
287 for b in res.iter_mut() {
288 *b = b.to_ascii().to_uppercase().to_byte();
294 let input = if std::os::getenv("RUST_BENCH").is_some() {
295 let fd = std::io::File::open(&Path::new("shootout-k-nucleotide.data"));
296 get_sequence(&mut std::io::BufferedReader::new(fd), ">THREE")
298 get_sequence(&mut *std::io::stdin().lock(), ">THREE")
300 let input = Arc::new(input);
302 let nb_freqs: Vec<(uint, Future<Table>)> = range(1u, 3).map(|i| {
303 let input = input.clone();
304 (i, Future::spawn(proc() generate_frequencies(input.as_slice(), i)))
306 let occ_freqs: Vec<Future<Table>> = OCCURRENCES.iter().map(|&occ| {
307 let input = input.clone();
308 Future::spawn(proc() generate_frequencies(input.as_slice(), occ.len()))
311 for (i, freq) in nb_freqs.into_iter() {
312 print_frequencies(&freq.unwrap(), i);
314 for (&occ, freq) in OCCURRENCES.iter().zip(occ_freqs.into_iter()) {
315 print_occurrences(&mut freq.unwrap(), occ);