Struct consalign::AlignfoldSums
pub struct AlignfoldSums<T> {
pub sums_close: HashMap<(T, T, T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub sums_accessible_external: HashMap<(T, T, T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub sums_accessible_multibranch: HashMap<(T, T, T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub forward_sums_external: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub backward_sums_external: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub forward_sums_external2: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub backward_sums_external2: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>,
pub forward_sums_hashed_poss: HashMap<(T, T), HashMap<(T, T), LoopSums, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>,
pub backward_sums_hashed_poss: HashMap<(T, T), HashMap<(T, T), LoopSums, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>,
pub forward_sums_hashed_poss2: HashMap<(T, T), HashMap<(T, T), LoopSums, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>,
pub backward_sums_hashed_poss2: HashMap<(T, T), HashMap<(T, T), LoopSums, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>,
}
Fields§
§sums_close: HashMap<(T, T, T, T), f32, BuildHasherDefault<AHasher>, Global>
§sums_accessible_external: HashMap<(T, T, T, T), f32, BuildHasherDefault<AHasher>, Global>
§sums_accessible_multibranch: HashMap<(T, T, T, T), f32, BuildHasherDefault<AHasher>, Global>
§forward_sums_external: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>
§backward_sums_external: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>
§forward_sums_external2: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>
§backward_sums_external2: HashMap<(T, T), f32, BuildHasherDefault<AHasher>, Global>
§forward_sums_hashed_poss: HashMap<(T, T), HashMap<(T, T), LoopSums, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>
§backward_sums_hashed_poss: HashMap<(T, T), HashMap<(T, T), LoopSums, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>
§forward_sums_hashed_poss2: HashMap<(T, T), HashMap<(T, T), LoopSums, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>
§backward_sums_hashed_poss2: HashMap<(T, T), HashMap<(T, T), LoopSums, BuildHasherDefault<AHasher>, Global>, BuildHasherDefault<AHasher>, Global>
Implementations§
§impl<T> AlignfoldSums<T>where
T: HashIndex,
impl<T> AlignfoldSums<T>where T: HashIndex,
pub fn new() -> AlignfoldSums<T>
Trait Implementations§
§impl<T> Clone for AlignfoldSums<T>where
T: Clone,
impl<T> Clone for AlignfoldSums<T>where T: Clone,
§fn clone(&self) -> AlignfoldSums<T>
fn clone(&self) -> AlignfoldSums<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 more§impl<T> Default for AlignfoldSums<T>where
T: HashIndex,
impl<T> Default for AlignfoldSums<T>where T: HashIndex,
§fn default() -> AlignfoldSums<T>
fn default() -> AlignfoldSums<T>
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl<T> RefUnwindSafe for AlignfoldSums<T>where T: RefUnwindSafe,
impl<T> Send for AlignfoldSums<T>where T: Send,
impl<T> Sync for AlignfoldSums<T>where T: Sync,
impl<T> Unpin for AlignfoldSums<T>where T: Unpin,
impl<T> UnwindSafe for AlignfoldSums<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.