pub struct TrainDatum<T> {Show 16 fields
pub seq_pair: (Vec<usize>, Vec<usize>),
pub seq_pair_gapped: (Vec<usize>, Vec<usize>),
pub alignfold_counts_observed: AlignfoldScores,
pub alignfold_counts_expected: AlignfoldScores,
pub basepair_probs_pair: (HashMap<(T, T), f32>, HashMap<(T, T), f32>),
pub max_basepair_span_pair: (T, T),
pub global_sum: f32,
pub forward_pos_pairs: HashMap<(T, T), HashSet<(T, T)>>,
pub backward_pos_pairs: HashMap<(T, T), HashSet<(T, T)>>,
pub pos_quads_hashed_lens: HashMap<(T, T), HashSet<(T, T)>>,
pub matchable_poss: HashMap<T, HashSet<T>>,
pub matchable_poss2: HashMap<T, HashSet<T>>,
pub fold_scores_pair: (FoldScoresTrained<T>, FoldScoresTrained<T>),
pub match_probs: HashMap<(T, T), f32>,
pub alignfold: PairAlignfold<T>,
pub accuracy: f32,
}Fields§
§seq_pair: (Vec<usize>, Vec<usize>)§seq_pair_gapped: (Vec<usize>, Vec<usize>)§alignfold_counts_observed: AlignfoldScores§alignfold_counts_expected: AlignfoldScores§basepair_probs_pair: (HashMap<(T, T), f32>, HashMap<(T, T), f32>)§max_basepair_span_pair: (T, T)§global_sum: f32§forward_pos_pairs: HashMap<(T, T), HashSet<(T, T)>>§backward_pos_pairs: HashMap<(T, T), HashSet<(T, T)>>§pos_quads_hashed_lens: HashMap<(T, T), HashSet<(T, T)>>§matchable_poss: HashMap<T, HashSet<T>>§matchable_poss2: HashMap<T, HashSet<T>>§fold_scores_pair: (FoldScoresTrained<T>, FoldScoresTrained<T>)§match_probs: HashMap<(T, T), f32>§alignfold: PairAlignfold<T>§accuracy: f32Implementations§
Source§impl<T> TrainDatum<T>where
T: HashIndex,
impl<T> TrainDatum<T>where
T: HashIndex,
pub fn origin() -> TrainDatum<T>
pub fn new( input_file_path: &Path, min_basepair_prob: f32, min_match_prob: f32, align_scores: &AlignScores, ) -> TrainDatum<T>
pub fn obs2counts(&mut self, consensus_fold: &[u8])
pub fn set_curr_scores(&mut self, alignfold_scores: &AlignfoldScores)
Trait Implementations§
Source§impl<T> Clone for TrainDatum<T>where
T: Clone,
impl<T> Clone for TrainDatum<T>where
T: Clone,
Source§fn clone(&self) -> TrainDatum<T>
fn clone(&self) -> TrainDatum<T>
Returns a duplicate 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> Freeze for TrainDatum<T>where
T: Freeze,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.