Struct rna_algos::mccaskill_algo::FoldScores
source · pub struct FoldScores<T: Hash> {
pub hairpin_scores: SparseScoreMat<T>,
pub twoloop_scores: ScoreMat4d<T>,
pub multibranch_close_scores: SparseScoreMat<T>,
pub accessible_scores: SparseScoreMat<T>,
}
Fields§
§hairpin_scores: SparseScoreMat<T>
§twoloop_scores: ScoreMat4d<T>
§multibranch_close_scores: SparseScoreMat<T>
§accessible_scores: SparseScoreMat<T>
Implementations§
source§impl<T: HashIndex> FoldScores<T>
impl<T: HashIndex> FoldScores<T>
pub fn new() -> FoldScores<T>
Trait Implementations§
Auto Trait Implementations§
impl<T> RefUnwindSafe for FoldScores<T>where T: RefUnwindSafe,
impl<T> Send for FoldScores<T>where T: Send,
impl<T> Sync for FoldScores<T>where T: Sync,
impl<T> Unpin for FoldScores<T>where T: Unpin,
impl<T> UnwindSafe for FoldScores<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.