// Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT // file at the top-level directory of this distribution and at // http://rust-lang.org/COPYRIGHT. // // Licensed under the Apache License, Version 2.0 or the MIT license // , at your // option. This file may not be copied, modified, or distributed // except according to those terms. // ignore-android: FIXME(#10393) // ignore-pretty very bad with line comments // multi tasking k-nucleotide #![feature(box_syntax)] use std::ascii::{AsciiExt, OwnedAsciiExt}; use std::cmp::Ordering::{self, Less, Greater, Equal}; use std::collections::HashMap; use std::mem::replace; use std::num::Float; use std::option; use std::os; use std::sync::mpsc::{channel, Sender, Receiver}; use std::thread::Thread; fn f64_cmp(x: f64, y: f64) -> Ordering { // arbitrarily decide that NaNs are larger than everything. if y.is_nan() { Less } else if x.is_nan() { Greater } else if x < y { Less } else if x == y { Equal } else { Greater } } // given a map, print a sorted version of it fn sort_and_fmt(mm: &HashMap , uint>, total: uint) -> String { fn pct(xx: uint, yy: uint) -> f64 { return (xx as f64) * 100.0 / (yy as f64); } // sort by key, then by value fn sortKV(mut orig: Vec<(Vec ,f64)> ) -> Vec<(Vec ,f64)> { orig.sort_by(|&(ref a, _), &(ref b, _)| a.cmp(b)); orig.sort_by(|&(_, a), &(_, b)| f64_cmp(b, a)); orig } let mut pairs = Vec::new(); // map -> [(k,%)] for (key, &val) in mm.iter() { pairs.push(((*key).clone(), pct(val, total))); } let pairs_sorted = sortKV(pairs); let mut buffer = String::new(); for &(ref k, v) in pairs_sorted.iter() { buffer.push_str(format!("{:?} {:0.3}\n", k.to_ascii_uppercase(), v).as_slice()); } return buffer } // given a map, search for the frequency of a pattern fn find(mm: &HashMap , uint>, key: String) -> uint { let key = key.into_ascii_lowercase(); match mm.get(key.as_bytes()) { option::Option::None => { return 0u; } option::Option::Some(&num) => { return num; } } } // given a map, increment the counter for a key fn update_freq(mm: &mut HashMap , uint>, key: &[u8]) { let key = key.to_vec(); let newval = match mm.remove(&key) { Some(v) => v + 1, None => 1 }; mm.insert(key, newval); } // given a Vec, for each window call a function // i.e., for "hello" and windows of size four, // run it("hell") and it("ello"), then return "llo" fn windows_with_carry(bb: &[u8], nn: uint, mut it: F) -> Vec where F: FnMut(&[u8]), { let mut ii = 0u; let len = bb.len(); while ii < len - (nn - 1u) { it(&bb[ii..ii+nn]); ii += 1u; } return bb[len - (nn - 1u)..len].to_vec(); } fn make_sequence_processor(sz: uint, from_parent: &Receiver>, to_parent: &Sender) { let mut freqs: HashMap, uint> = HashMap::new(); let mut carry = Vec::new(); let mut total: uint = 0u; let mut line: Vec; loop { line = from_parent.recv().unwrap(); if line == Vec::new() { break; } carry.push_all(line.as_slice()); carry = windows_with_carry(carry.as_slice(), sz, |window| { update_freq(&mut freqs, window); total += 1u; }); } let buffer = match sz { 1u => { sort_and_fmt(&freqs, total) } 2u => { sort_and_fmt(&freqs, total) } 3u => { format!("{}\t{}", find(&freqs, "GGT".to_string()), "GGT") } 4u => { format!("{}\t{}", find(&freqs, "GGTA".to_string()), "GGTA") } 6u => { format!("{}\t{}", find(&freqs, "GGTATT".to_string()), "GGTATT") } 12u => { format!("{}\t{}", find(&freqs, "GGTATTTTAATT".to_string()), "GGTATTTTAATT") } 18u => { format!("{}\t{}", find(&freqs, "GGTATTTTAATTTATAGT".to_string()), "GGTATTTTAATTTATAGT") } _ => { "".to_string() } }; to_parent.send(buffer).unwrap(); } // given a FASTA file on stdin, process sequence THREE fn main() { use std::io::{stdio, MemReader, BufferedReader}; let rdr = if os::getenv("RUST_BENCH").is_some() { let foo = include_bytes!("shootout-k-nucleotide.data"); box MemReader::new(foo.to_vec()) as Box } else { box stdio::stdin() as Box }; let mut rdr = BufferedReader::new(rdr); // initialize each sequence sorter let sizes = vec!(1u,2,3,4,6,12,18); let mut streams = range(0, sizes.len()).map(|_| { Some(channel::()) }).collect::>(); let mut from_child = Vec::new(); let to_child = sizes.iter().zip(streams.iter_mut()).map(|(sz, stream_ref)| { let sz = *sz; let stream = replace(stream_ref, None); let (to_parent_, from_child_) = stream.unwrap(); from_child.push(from_child_); let (to_child, from_parent) = channel(); Thread::spawn(move|| { make_sequence_processor(sz, &from_parent, &to_parent_); }); to_child }).collect:: >> >(); // latch stores true after we've started // reading the sequence of interest let mut proc_mode = false; for line in rdr.lines() { let line = line.unwrap().as_slice().trim().to_string(); if line.len() == 0u { continue; } match (line.as_bytes()[0] as char, proc_mode) { // start processing if this is the one ('>', false) => { match line.as_slice().slice_from(1).find_str("THREE") { Some(_) => { proc_mode = true; } None => { } } } // break our processing ('>', true) => { break; } // process the sequence for k-mers (_, true) => { let line_bytes = line.as_bytes(); for (ii, _sz) in sizes.iter().enumerate() { let lb = line_bytes.to_vec(); to_child[ii].send(lb).unwrap(); } } // whatever _ => { } } } // finish... for (ii, _sz) in sizes.iter().enumerate() { to_child[ii].send(Vec::new()).unwrap(); } // now fetch and print result messages for (ii, _sz) in sizes.iter().enumerate() { println!("{:?}", from_child[ii].recv().unwrap()); } }