Struct bed_utils::bed::tree::GenomeRegions
source · pub struct GenomeRegions<B> {
pub regions: Vec<B>,
pub indices: BedTree<usize>,
}Fields§
§regions: Vec<B>§indices: BedTree<usize>Implementations§
source§impl<B: BEDLike> GenomeRegions<B>
impl<B: BEDLike> GenomeRegions<B>
Trait Implementations§
source§impl<B: BEDLike> FromIterator<B> for GenomeRegions<B>
impl<B: BEDLike> FromIterator<B> for GenomeRegions<B>
source§fn from_iter<I: IntoIterator<Item = B>>(iter: I) -> Self
fn from_iter<I: IntoIterator<Item = B>>(iter: I) -> Self
Creates a value from an iterator. Read more
Auto Trait Implementations§
impl<B> RefUnwindSafe for GenomeRegions<B>where
B: RefUnwindSafe,
impl<B> Send for GenomeRegions<B>where
B: Send,
impl<B> Sync for GenomeRegions<B>where
B: Sync,
impl<B> Unpin for GenomeRegions<B>where
B: Unpin,
impl<B> UnwindSafe for GenomeRegions<B>where
B: UnwindSafe,
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.