pub struct LoopSums {
pub sum_seqalign: Sum,
pub sum_seqalign_multibranch: Sum,
pub sum_multibranch: Sum,
pub sum_1st_pairmatches: Sum,
pub sum_1ormore_pairmatches: Sum,
pub sum_0ormore_pairmatches: Sum,
}
Fields§
§sum_seqalign: Sum
§sum_seqalign_multibranch: Sum
§sum_multibranch: Sum
§sum_1st_pairmatches: Sum
§sum_1ormore_pairmatches: Sum
§sum_0ormore_pairmatches: Sum
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl RefUnwindSafe for LoopSums
impl Send for LoopSums
impl Sync for LoopSums
impl Unpin for LoopSums
impl UnwindSafe for LoopSums
Blanket Implementations§
§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.