Struct rna_algos::utils::FoldScoreSets

source · 
pub struct FoldScoreSets {
Show 24 fields
    pub hairpin_scores_len: HairpinScoresLen,
    pub bulge_scores_len: BulgeScoresLen,
    pub interior_scores_len: InteriorScoresLen,
    pub interior_scores_symmetric: InteriorScoresSymmetric,
    pub interior_scores_asymmetric: InteriorScoresAsymmetric,
    pub stack_scores: StackScores,
    pub terminal_mismatch_scores: TerminalMismatchScores,
    pub dangling_scores_left: DanglingScores,
    pub dangling_scores_right: DanglingScores,
    pub helix_close_scores: HelixCloseScores,
    pub basepair_scores: BasepairScores,
    pub interior_scores_explicit: InteriorScoresExplicit,
    pub bulge_scores_0x1: BulgeScores0x1,
    pub interior_scores_1x1: InteriorScores1x1Contra,
    pub multibranch_score_base: Score,
    pub multibranch_score_basepair: Score,
    pub multibranch_score_unpair: Score,
    pub external_score_basepair: Score,
    pub external_score_unpair: Score,
    pub hairpin_scores_len_cumulative: HairpinScoresLen,
    pub bulge_scores_len_cumulative: BulgeScoresLen,
    pub interior_scores_len_cumulative: InteriorScoresLen,
    pub interior_scores_symmetric_cumulative: InteriorScoresSymmetric,
    pub interior_scores_asymmetric_cumulative: InteriorScoresAsymmetric,

}

Fields§

§hairpin_scores_len: HairpinScoresLen§bulge_scores_len: BulgeScoresLen§interior_scores_len: InteriorScoresLen§interior_scores_symmetric: InteriorScoresSymmetric§interior_scores_asymmetric: InteriorScoresAsymmetric§stack_scores: StackScores§terminal_mismatch_scores: TerminalMismatchScores§dangling_scores_left: DanglingScores§dangling_scores_right: DanglingScores§helix_close_scores: HelixCloseScores§basepair_scores: BasepairScores§interior_scores_explicit: InteriorScoresExplicit§bulge_scores_0x1: BulgeScores0x1§interior_scores_1x1: InteriorScores1x1Contra§multibranch_score_base: Score§multibranch_score_basepair: Score§multibranch_score_unpair: Score§external_score_basepair: Score§external_score_unpair: Score§hairpin_scores_len_cumulative: HairpinScoresLen§bulge_scores_len_cumulative: BulgeScoresLen§interior_scores_len_cumulative: InteriorScoresLen§interior_scores_symmetric_cumulative: InteriorScoresSymmetric§interior_scores_asymmetric_cumulative: InteriorScoresAsymmetric

Implementations§

source§

impl FoldScoreSets

source

pub fn new(init_val: Score) -> FoldScoreSets

source

pub fn accumulate(&mut self)

source

pub fn transfer(&mut self)

Trait Implementations§

source§

impl Clone for FoldScoreSets

source§

fn clone(&self) -> FoldScoreSets

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for FoldScoreSets

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V