pub mod parse;
pub mod reconstruct;
pub mod serialize;
pub use parse::{expected_ml_len, parse};
pub use reconstruct::reconstruct;
pub use serialize::serialize;
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum ModCode {
Char(u8),
Chebi(u32),
}
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct MmGroup {
pub base: u8,
pub strand: u8,
pub codes: Vec<ModCode>,
pub status: Option<u8>,
pub deltas: Vec<usize>,
pub ml: Vec<u8>,
}
#[derive(Debug, Clone, PartialEq, Eq, Default)]
pub struct Mods {
pub groups: Vec<MmGroup>,
}
pub fn counting_base(base: u8) -> u8 {
match base.to_ascii_uppercase() {
b'U' => b'T',
b => b,
}
}
pub fn counts(seq_base: u8, cbase: u8) -> bool {
cbase == b'N' || seq_base.to_ascii_uppercase() == cbase
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn minus_strand_counts_the_literal_base() {
assert_eq!(counting_base(b'G'), b'G');
assert_eq!(counting_base(b'C'), b'C');
}
#[test]
fn uracil_folds_to_thymine() {
assert_eq!(counting_base(b'U'), b'T');
assert_eq!(counting_base(b'u'), b'T');
}
#[test]
fn n_counts_every_base() {
for b in *b"ACGTN" {
assert!(counts(b, b'N'), "N must count {}", b as char);
}
assert!(counts(b'C', b'C'));
assert!(!counts(b'G', b'C'));
assert!(counts(b'c', b'C'));
}
}