pub struct Align<T> {
pub cols: Vec<Vec<usize, Global>, Global>,
pub pos_map_sets: Vec<Vec<T, Global>, Global>,
}
Fields§
§cols: Vec<Vec<usize, Global>, Global>
§pos_map_sets: Vec<Vec<T, Global>, Global>
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<T> RefUnwindSafe for Align<T>where T: RefUnwindSafe,
impl<T> Send for Align<T>where T: Send,
impl<T> Sync for Align<T>where T: Sync,
impl<T> Unpin for Align<T>where T: Unpin,
impl<T> UnwindSafe for Align<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.