pub struct EdgeMap { /* private fields */ }Expand description
mapped transcript/gene/chromosome IDs for each of the 8 possible edges indices: 0: T right 1: G right 2: C right 3: A right 4: T left 5: G left 6: C left 7: A left
Implementations§
Source§impl EdgeMap
impl EdgeMap
Sourcepub fn new(edge_maps: [Box<[ID]>; 8]) -> EdgeMap
pub fn new(edge_maps: [Box<[ID]>; 8]) -> EdgeMap
create a new EdgeMap by supplying the underlying mapped IDs.
Sourcepub fn mem_heap(&self) -> usize
pub fn mem_heap(&self) -> usize
returns the heap memory used by the EdgeMap - the stack memory size
is always 128 bytes (8 edges * (8 byte pointer + 8 byte length))
Sourcepub fn from_single_dirs(
left: &Option<SingleDirEdgeMap>,
right: &Option<SingleDirEdgeMap>,
) -> Option<EdgeMap>
pub fn from_single_dirs( left: &Option<SingleDirEdgeMap>, right: &Option<SingleDirEdgeMap>, ) -> Option<EdgeMap>
create an EdgeMap from two SingleDirEdgeMaps
Sourcepub fn single_dir(&self, dir: Dir) -> SingleDirEdgeMap
pub fn single_dir(&self, dir: Dir) -> SingleDirEdgeMap
get the SingleDirEdgeMap in the specified Dir
Sourcepub fn clean_edges(&mut self, exts: Exts)
pub fn clean_edges(&mut self, exts: Exts)
clean the edge maps by removing IDs mapped to edges that led to filtered kmers,
based on a correct Exts
Trait Implementations§
Source§impl<'de> Deserialize<'de> for EdgeMap
impl<'de> Deserialize<'de> for EdgeMap
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl Ord for EdgeMap
impl Ord for EdgeMap
Source§impl PartialOrd for EdgeMap
impl PartialOrd for EdgeMap
impl Eq for EdgeMap
impl StructuralPartialEq for EdgeMap
Auto Trait Implementations§
impl Freeze for EdgeMap
impl RefUnwindSafe for EdgeMap
impl Send for EdgeMap
impl Sync for EdgeMap
impl Unpin for EdgeMap
impl UnsafeUnpin for EdgeMap
impl UnwindSafe for EdgeMap
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§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<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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. 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.