Struct smoothed_online_convex_optimization::algorithms::offline::CachedPath [−][src]
pub struct CachedPath<C> {
pub path: Path,
pub cache: C,
}Expand description
Resulting path alongside cache which can be used for subsequent iterations.
Fields
path: Pathcache: CTrait Implementations
Resulting schedule.
Auto Trait Implementations
impl<C> RefUnwindSafe for CachedPath<C> where
C: RefUnwindSafe,
impl<C> Send for CachedPath<C> where
C: Send,
impl<C> Sync for CachedPath<C> where
C: Sync,
impl<C> Unpin for CachedPath<C> where
C: Unpin,
impl<C> UnwindSafe for CachedPath<C> where
C: UnwindSafe,
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.
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.