Struct consprob_trained::AlignfoldProbMats
source · pub struct AlignfoldProbMats<T> {
pub basepair_probs_pair: (HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>, HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>),
pub context_profs_pair: (ArrayBase<OwnedRepr<f32>, Dim<[usize; 2]>>, ArrayBase<OwnedRepr<f32>, Dim<[usize; 2]>>),
pub pairmatch_probs: HashMap<(T, T, T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub loopmatch_probs: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub match_probs: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>,
}
Fields§
§basepair_probs_pair: (HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>, HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>)
§context_profs_pair: (ArrayBase<OwnedRepr<f32>, Dim<[usize; 2]>>, ArrayBase<OwnedRepr<f32>, Dim<[usize; 2]>>)
§pairmatch_probs: HashMap<(T, T, T, T), f32, BuildHasherDefault<AHasher>, Global>
§loopmatch_probs: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>
§match_probs: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>
Implementations§
source§impl<T> AlignfoldProbMats<T>where
T: HashIndex,
impl<T> AlignfoldProbMats<T>where T: HashIndex,
pub fn origin() -> AlignfoldProbMats<T>
pub fn new(seq_len_pair: &(usize, usize)) -> AlignfoldProbMats<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for AlignfoldProbMats<T>where T: RefUnwindSafe,
impl<T> Send for AlignfoldProbMats<T>where T: Send,
impl<T> Sync for AlignfoldProbMats<T>where T: Sync,
impl<T> Unpin for AlignfoldProbMats<T>where T: Unpin,
impl<T> UnwindSafe for AlignfoldProbMats<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.