Struct fibertools_rs::basemods::BaseMods
source · pub struct BaseMods {
pub base_mods: Vec<BaseMod>,
}Fields§
§base_mods: Vec<BaseMod>Implementations§
source§impl BaseMods
impl BaseMods
pub fn new(record: &Record, min_ml_score: u8) -> BaseMods
pub fn my_mm_ml_parser(record: &Record, min_ml_score: u8) -> BaseMods
pub fn hashmap_to_basemods( map: HashMap<(i32, i32, i32), Vec<(i64, u8)>>, record: &Record ) -> BaseMods
Example MM tag: MM:Z:C+m,11,6,10;A+a,0,0,0; Example ML tag: ML:B:C,157,30,2,164,118,255
Trait Implementations§
source§impl PartialEq for BaseMods
impl PartialEq for BaseMods
impl Eq for BaseMods
impl StructuralPartialEq for BaseMods
Auto Trait Implementations§
impl RefUnwindSafe for BaseMods
impl Send for BaseMods
impl Sync for BaseMods
impl Unpin for BaseMods
impl UnwindSafe for BaseMods
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.