Struct smoothed_online_convex_optimization::algorithms::online::uni_dimensional::randomized::Memory [−][src]
pub struct Memory<M> {
pub y: FractionalConfig,
pub relaxation_m: Option<M>,
}
Expand description
Memory.
Fields
y: FractionalConfig
Fractional number of servers determined by fractional relaxation.
relaxation_m: Option<M>
Memory of relaxation.
Trait Implementations
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations
impl<M> RefUnwindSafe for Memory<M> where
M: RefUnwindSafe,
impl<M> UnwindSafe for Memory<M> where
M: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T, P, C, D, U> DefaultGivenOnlineProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenOnlineProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenProblem<T, P, C, D> for U where
C: ModelOutputSuccess,
P: Problem<T, C, D>,
D: ModelOutputFailure,
U: Default,
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.