Struct bed_utils::bed::tree::SparseCoverage
source · pub struct SparseCoverage<'a, B, N> {
pub consumed_tags: f64,
/* private fields */
}Fields§
Implementations§
source§impl<'a, N: Num + NumCast + NumAssignOps + Copy, B: BEDLike> SparseCoverage<'a, B, N>
impl<'a, N: Num + NumCast + NumAssignOps + Copy, B: BEDLike> SparseCoverage<'a, B, N>
pub fn new(genome_regions: &'a GenomeRegions<B>) -> Self
pub fn reset(&mut self)
pub fn get_index<D>(&self, tag: &D) -> impl Iterator<Item = usize> + '_where
D: BEDLike,
pub fn insert<D>(&mut self, tag: &D, count: N)where
D: BEDLike,
pub fn insert_at_index<D>(&mut self, index: usize, count: N)
pub fn get_regions(&'a self) -> impl Iterator<Item = &B> + 'a
pub fn get_coverage(&self) -> &BTreeMap<usize, N>
pub fn get_coverage_as_vec(&self) -> Vec<N>
Trait Implementations§
Auto Trait Implementations§
impl<'a, B, N> RefUnwindSafe for SparseCoverage<'a, B, N>where
B: RefUnwindSafe,
N: RefUnwindSafe,
impl<'a, B, N> Send for SparseCoverage<'a, B, N>
impl<'a, B, N> Sync for SparseCoverage<'a, B, N>
impl<'a, B, N> Unpin for SparseCoverage<'a, B, N>
impl<'a, B, N> UnwindSafe for SparseCoverage<'a, B, N>where
B: RefUnwindSafe,
N: RefUnwindSafe,
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<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.