Struct consprob::AlignfoldScores
source · pub struct AlignfoldScores<T> {
pub loopmatch_scores: SparseScoreMat<T>,
pub pairmatch_scores: ScoreMat4d<T>,
pub range_insert_scores: ScoreMat,
pub range_insert_scores2: ScoreMat,
}
Fields§
§loopmatch_scores: SparseScoreMat<T>
§pairmatch_scores: ScoreMat4d<T>
§range_insert_scores: ScoreMat
§range_insert_scores2: ScoreMat
Implementations§
source§impl<T: HashIndex> AlignfoldScores<T>
impl<T: HashIndex> AlignfoldScores<T>
pub fn origin() -> AlignfoldScores<T>
pub fn new( seq_pair: &SeqPair<'_>, pos_quads: &PosQuadMat<T>, match_probs: &SparseProbMat<T>, align_scores: &AlignScores ) -> AlignfoldScores<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for AlignfoldScores<T>where T: RefUnwindSafe,
impl<T> Send for AlignfoldScores<T>where T: Send,
impl<T> Sync for AlignfoldScores<T>where T: Sync,
impl<T> Unpin for AlignfoldScores<T>where T: Unpin,
impl<T> UnwindSafe for AlignfoldScores<T>where T: UnwindSafe,
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.