Struct smoothed_online_convex_optimization::cost::Cost [−][src]
pub struct Cost<C, D> {
pub cost: N64,
pub output: ModelOutput<C, D>,
}
Expand description
Result of cost computation.
Fields
cost: N64
output: ModelOutput<C, D>
Implementations
Builds a new cost.
Trait Implementations
impl<'a, C, D> Deserialize<'a> for Cost<C, D> where
C: ModelOutputSuccess,
D: ModelOutputFailure,
impl<'a, C, D> Deserialize<'a> for Cost<C, D> where
C: ModelOutputSuccess,
D: ModelOutputFailure,
Deserialize this value from the given Serde deserializer. Read more
impl<C, D> IntoPy<Py<PyAny>> for Cost<C, D> where
C: ModelOutputSuccess,
D: ModelOutputFailure,
impl<C, D> IntoPy<Py<PyAny>> for Cost<C, D> where
C: ModelOutputSuccess,
D: ModelOutputFailure,
Auto Trait Implementations
impl<C, D> RefUnwindSafe for Cost<C, D> where
C: RefUnwindSafe,
D: RefUnwindSafe,
impl<C, D> UnwindSafe for Cost<C, D> where
C: UnwindSafe,
D: 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.