Struct consprob::AlignfoldProbMats
source · pub struct AlignfoldProbMats<T> {
pub basepair_probs_pair: SparseProbMatPair<T>,
pub context_profs_pair: ContextProfSetPair,
pub pairmatch_probs: ProbMat4d<T>,
pub loopmatch_probs: SparseProbMat<T>,
pub match_probs: SparseProbMat<T>,
}
Fields§
§basepair_probs_pair: SparseProbMatPair<T>
§context_profs_pair: ContextProfSetPair
§pairmatch_probs: ProbMat4d<T>
§loopmatch_probs: SparseProbMat<T>
§match_probs: SparseProbMat<T>
Implementations§
source§impl<T: HashIndex> AlignfoldProbMats<T>
impl<T: HashIndex> AlignfoldProbMats<T>
pub fn origin() -> AlignfoldProbMats<T>
pub fn new(seq_len_pair: &(usize, usize)) -> AlignfoldProbMats<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for AlignfoldProbMats<T>where T: RefUnwindSafe,
impl<T> Send for AlignfoldProbMats<T>where T: Send,
impl<T> Sync for AlignfoldProbMats<T>where T: Sync,
impl<T> Unpin for AlignfoldProbMats<T>where T: Unpin,
impl<T> UnwindSafe for AlignfoldProbMats<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.