Struct consprob_trained::AlignSums
pub struct AlignSums {
pub forward_sums_match: Vec<Vec<f32, Global>, Global>,
pub forward_sums_insert: Vec<Vec<f32, Global>, Global>,
pub forward_sums_del: Vec<Vec<f32, Global>, Global>,
pub backward_sums_match: Vec<Vec<f32, Global>, Global>,
pub backward_sums_insert: Vec<Vec<f32, Global>, Global>,
pub backward_sums_del: Vec<Vec<f32, Global>, Global>,
}
Fields§
§forward_sums_match: Vec<Vec<f32, Global>, Global>
§forward_sums_insert: Vec<Vec<f32, Global>, Global>
§forward_sums_del: Vec<Vec<f32, Global>, Global>
§backward_sums_match: Vec<Vec<f32, Global>, Global>
§backward_sums_insert: Vec<Vec<f32, Global>, Global>
§backward_sums_del: Vec<Vec<f32, Global>, Global>
Implementations§
Auto Trait Implementations§
impl RefUnwindSafe for AlignSums
impl Send for AlignSums
impl Sync for AlignSums
impl Unpin for AlignSums
impl UnwindSafe for AlignSums
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.