Struct consprob_trained::FoldSums
pub struct FoldSums<T>where
T: Hash,{
pub sums_external: Vec<Vec<f32, Global>, Global>,
pub sums_rightmost_basepairs_external: Vec<Vec<f32, Global>, Global>,
pub sums_rightmost_basepairs_multibranch: Vec<Vec<f32, Global>, Global>,
pub sums_close: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub sums_accessible: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub sums_multibranch: Vec<Vec<f32, Global>, Global>,
pub sums_1ormore_basepairs: Vec<Vec<f32, Global>, Global>,
}
Fields§
§sums_external: Vec<Vec<f32, Global>, Global>
§sums_rightmost_basepairs_external: Vec<Vec<f32, Global>, Global>
§sums_rightmost_basepairs_multibranch: Vec<Vec<f32, Global>, Global>
§sums_close: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>
§sums_accessible: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>
§sums_multibranch: Vec<Vec<f32, Global>, Global>
§sums_1ormore_basepairs: Vec<Vec<f32, Global>, Global>
Implementations§
Auto Trait Implementations§
impl<T> RefUnwindSafe for FoldSums<T>where T: RefUnwindSafe,
impl<T> Send for FoldSums<T>where T: Send,
impl<T> Sync for FoldSums<T>where T: Sync,
impl<T> Unpin for FoldSums<T>where T: Unpin,
impl<T> UnwindSafe for FoldSums<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.