Struct consprob_trained::TrainDatum
source · pub struct TrainDatum<T> {Show 16 fields
pub seq_pair: RealSeqPair,
pub seq_pair_gapped: RealSeqPair,
pub alignfold_counts_observed: AlignfoldScores,
pub alignfold_counts_expected: AlignfoldScores,
pub basepair_probs_pair: SparseProbMatPair<T>,
pub max_basepair_span_pair: (T, T),
pub global_sum: Prob,
pub forward_pos_pairs: PosPairMatSet<T>,
pub backward_pos_pairs: PosPairMatSet<T>,
pub pos_quads_hashed_lens: PosQuadsHashedLens<T>,
pub matchable_poss: SparsePosSets<T>,
pub matchable_poss2: SparsePosSets<T>,
pub fold_scores_pair: FoldScoresPairTrained<T>,
pub match_probs: SparseProbMat<T>,
pub alignfold: PairAlignfold<T>,
pub accuracy: Score,
}Fields§
§seq_pair: RealSeqPair§seq_pair_gapped: RealSeqPair§alignfold_counts_observed: AlignfoldScores§alignfold_counts_expected: AlignfoldScores§basepair_probs_pair: SparseProbMatPair<T>§max_basepair_span_pair: (T, T)§global_sum: Prob§forward_pos_pairs: PosPairMatSet<T>§backward_pos_pairs: PosPairMatSet<T>§pos_quads_hashed_lens: PosQuadsHashedLens<T>§matchable_poss: SparsePosSets<T>§matchable_poss2: SparsePosSets<T>§fold_scores_pair: FoldScoresPairTrained<T>§match_probs: SparseProbMat<T>§alignfold: PairAlignfold<T>§accuracy: ScoreImplementations§
source§impl<T: HashIndex> TrainDatum<T>
impl<T: HashIndex> TrainDatum<T>
pub fn origin() -> TrainDatum<T>
pub fn new( input_file_path: &Path, min_basepair_prob: Prob, min_match_prob: Prob, align_scores: &AlignScores ) -> TrainDatum<T>
pub fn obs2counts(&mut self, consensus_fold: TextSlice<'_>)
pub fn set_curr_scores(&mut self, alignfold_scores: &AlignfoldScores)
Trait Implementations§
source§impl<T: Clone> Clone for TrainDatum<T>
impl<T: Clone> Clone for TrainDatum<T>
source§fn clone(&self) -> TrainDatum<T>
fn clone(&self) -> TrainDatum<T>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl<T> RefUnwindSafe for TrainDatum<T>where T: RefUnwindSafe,
impl<T> Send for TrainDatum<T>where T: Send,
impl<T> Sync for TrainDatum<T>where T: Sync,
impl<T> Unpin for TrainDatum<T>where T: Unpin,
impl<T> UnwindSafe for TrainDatum<T>where T: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§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.