pub struct OverRepresentedData {
pub sequences: HashMap<String, u64>,
pub count: u64,
pub count_at_unique_limit: u64,
}Expand description
Shared data between OverRepresentedSeqs and DuplicationLevel. In Java, DuplicationLevel directly accesses OverRepresentedSeqs’ fields.
Fields§
§sequences: HashMap<String, u64>Map of truncated sequence -> count
count: u64Total number of sequences processed
count_at_unique_limit: u64Total count at the point where we reached the unique sequence limit
Implementations§
Trait Implementations§
Source§impl Default for OverRepresentedData
impl Default for OverRepresentedData
Source§fn default() -> OverRepresentedData
fn default() -> OverRepresentedData
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for OverRepresentedData
impl RefUnwindSafe for OverRepresentedData
impl Send for OverRepresentedData
impl Sync for OverRepresentedData
impl Unpin for OverRepresentedData
impl UnsafeUnpin for OverRepresentedData
impl UnwindSafe for OverRepresentedData
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> 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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.