Struct consalign::TrainDatum
source · pub struct TrainDatum<T> {Show 16 fields
pub seq_pair: (Vec<usize, Global>, Vec<usize, Global>),
pub seq_pair_gapped: (Vec<usize, Global>, Vec<usize, Global>),
pub alignfold_counts_observed: AlignfoldScores,
pub alignfold_counts_expected: AlignfoldScores,
pub basepair_probs_pair: (HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>, HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>),
pub max_basepair_span_pair: (T, T),
pub global_sum: f32,
pub forward_pos_pairs: HashMap<(T, T), HashSet<(T, T), BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>,
pub backward_pos_pairs: HashMap<(T, T), HashSet<(T, T), BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>,
pub pos_quads_hashed_lens: HashMap<(T, T), HashSet<(T, T), BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>,
pub matchable_poss: HashMap<T, HashSet<T, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>,
pub matchable_poss2: HashMap<T, HashSet<T, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>,
pub fold_scores_pair: (FoldScoresTrained<T>, FoldScoresTrained<T>),
pub match_probs: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub alignfold: PairAlignfold<T>,
pub accuracy: f32,
}Fields§
§seq_pair: (Vec<usize, Global>, Vec<usize, Global>)§seq_pair_gapped: (Vec<usize, Global>, Vec<usize, Global>)§alignfold_counts_observed: AlignfoldScores§alignfold_counts_expected: AlignfoldScores§basepair_probs_pair: (HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>, HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>)§max_basepair_span_pair: (T, T)§global_sum: f32§forward_pos_pairs: HashMap<(T, T), HashSet<(T, T), BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>§backward_pos_pairs: HashMap<(T, T), HashSet<(T, T), BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>§pos_quads_hashed_lens: HashMap<(T, T), HashSet<(T, T), BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>§matchable_poss: HashMap<T, HashSet<T, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>§matchable_poss2: HashMap<T, HashSet<T, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>§fold_scores_pair: (FoldScoresTrained<T>, FoldScoresTrained<T>)§match_probs: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>§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 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§
§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.