xeos
/
wasmi
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fmt and return an original header

This commit is contained in:
Sergey Pepyakin 2018-06-19 13:16:08 +03:00
parent c31498b8cc
commit 7130295bb1
2 changed files with 20 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
benches/wasm-kernel/src/regex_redux.rs
View File

@ -4,9 +4,8 @@
//! [1]: https://benchmarksgame-team.pages.debian.net/benchmarksgame/program/regexredux-rust-2.html //! [1]: https://benchmarksgame-team.pages.debian.net/benchmarksgame/program/regexredux-rust-2.html
lazy_static! { lazy_static! {
static ref REGEX: ::regex::bytes::Regex = { static ref REGEX: ::regex::bytes::Regex =
::regex::bytes::Regex::new("agggtaa[cgt]|[acg]ttaccct").unwrap() { ::regex::bytes::Regex::new("agggtaa[cgt]|[acg]ttaccct").unwrap() };
};
} }
pub fn prepare() { pub fn prepare() {

27
benches/wasm-kernel/src/rev_complement.rs
View File

@ -1,12 +1,19 @@
//! Adapted version from benchmarks game. In particular // Adapted version from benchmarks game. In particular
//! rayon is removed. // rayon is removed.
//! //
// https://benchmarksgame-team.pages.debian.net/benchmarksgame/program/revcomp-rust-3.html // https://benchmarksgame-team.pages.debian.net/benchmarksgame/program/revcomp-rust-3.html
// The Computer Language Benchmarks Game
// https://salsa.debian.org/benchmarksgame-team/benchmarksgame/
//
// contributed by the Rust Project Developers
// contributed by Cristi Cobzarenco
// contributed by TeXitoi
// contributed by Matt Brubeck
use std::io::BufRead; use std::io::BufRead;
use std::{cmp, io};
use std::mem::replace; use std::mem::replace;
use std::{cmp, io};
/// Lookup table to find the complement of a single FASTA code. /// Lookup table to find the complement of a single FASTA code.
fn build_table() -> [u8; 256] { fn build_table() -> [u8; 256] {
@ -75,13 +82,15 @@ fn reverse_chunks(left: &mut [u8], right: &mut [u8], table: &[u8; 256]) {
/// `left` must start at the beginning of a line. If there are an odd number of /// `left` must start at the beginning of a line. If there are an odd number of
/// bytes, `right` will initially be 1 byte longer than `left`; otherwise they /// bytes, `right` will initially be 1 byte longer than `left`; otherwise they
/// will have equal lengths. /// will have equal lengths.
fn reverse_complement_left_right(mut left: &mut [u8], fn reverse_complement_left_right(
mut right: &mut [u8], mut left: &mut [u8],
trailing_len: usize, mut right: &mut [u8],
table: &[u8; 256]) { trailing_len: usize,
table: &[u8; 256],
) {
// Each iteration swaps one line from the start of the sequence with one // Each iteration swaps one line from the start of the sequence with one
// from the end. // from the end.
while left.len() > 0 || right.len() > 0 { while left.len() > 0 || right.len() > 0 {
// Get the chunk up to the newline in `right`. // Get the chunk up to the newline in `right`.
let mut a = left.split_off_left(trailing_len); let mut a = left.split_off_left(trailing_len);
let mut b = right.split_off_right(trailing_len); let mut b = right.split_off_right(trailing_len);