Struct fibertools_rs::extract::FiberseqData
source · pub struct FiberseqData {
pub record: Record,
pub nuc: Vec<(i64, i64)>,
pub msp: Vec<(i64, i64)>,
pub ref_nuc: Vec<(i64, i64)>,
pub ref_msp: Vec<(i64, i64)>,
pub base_mods: BaseMods,
pub ec: f32,
}Fields
record: Recordnuc: Vec<(i64, i64)>msp: Vec<(i64, i64)>ref_nuc: Vec<(i64, i64)>ref_msp: Vec<(i64, i64)>base_mods: BaseModsec: f32Implementations
sourceimpl FiberseqData
impl FiberseqData
pub fn new(record: &Record, min_ml_score: u8) -> Self
pub fn from_records(records: &Vec<Record>, min_ml_score: u8) -> Vec<Self>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A>where
A: Allocator,
A: Allocator,
pub fn get_nuc(&self, reference: bool, get_starts: bool) -> Vec<i64>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A>where
A: Allocator,
A: Allocator,
pub fn get_msp(&self, reference: bool, get_starts: bool) -> Vec<i64>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A>where
A: Allocator,
A: Allocator,
pub fn write_msp(&self, reference: bool, head_view: &HeaderView) -> String
pub fn write_nuc(&self, reference: bool, head_view: &HeaderView) -> String
pub fn write_m6a(&self, reference: bool, head_view: &HeaderView) -> String
pub fn write_cpg(&self, reference: bool, head_view: &HeaderView) -> String
pub fn get_rq(&self) -> Option<f32>
pub fn all_header(simplify: bool, quality: bool) -> String
pub fn write_all(
&self,
head_view: &HeaderView,
simplify: bool,
quality: bool
) -> String
pub fn to_bed12(
&self,
reference: bool,
starts: &[i64],
lengths: &[i64],
head_view: &HeaderView
) -> String
Auto Trait Implementations
impl RefUnwindSafe for FiberseqData
impl Send for FiberseqData
impl Sync for FiberseqData
impl Unpin for FiberseqData
impl UnwindSafe for FiberseqData
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
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 morefn 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.