Struct cell_map::iterators::positioned::Positioned [−][src]
Expand description
Trait Implementations
impl<'a, L, T, S> Slicer<'a, L, T> for Positioned<'a, L, T, S> where
L: Layer,
S: Slicer<'a, L, T>,
impl<'a, L, T, S> Slicer<'a, L, T> for Positioned<'a, L, T, S> where
L: Layer,
S: Slicer<'a, L, T>,
Auto Trait Implementations
impl<'a, L, T, S> RefUnwindSafe for Positioned<'a, L, T, S> where
L: RefUnwindSafe,
S: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, L, T, S> Send for Positioned<'a, L, T, S> where
L: Send,
S: Send,
T: Sync,
impl<'a, L, T, S> Sync for Positioned<'a, L, T, S> where
L: Sync,
S: Sync,
T: Sync,
impl<'a, L, T, S> Unpin for Positioned<'a, L, T, S> where
L: Unpin,
S: Unpin,
impl<'a, L, T, S> UnwindSafe for Positioned<'a, L, T, S> where
L: UnwindSafe,
S: UnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.