Struct soco::algorithms::online::uni_dimensional::lazy_capacity_provisioning::Memory
source · [−]pub struct Memory<T> {
pub bounds: Vec<BoundsMemory<T>>,
}
Fields
bounds: Vec<BoundsMemory<T>>
Lower and upper bounds from times $t$ (in order).
Trait Implementations
sourceimpl<'de, T> Deserialize<'de> for Memory<T> where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for Memory<T> where
T: Deserialize<'de>,
sourcefn 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<T> RefUnwindSafe for Memory<T> where
T: RefUnwindSafe,
impl<T> Send for Memory<T> where
T: Send,
impl<T> Sync for Memory<T> where
T: Sync,
impl<T> Unpin for Memory<T> where
T: Unpin,
impl<T> UnwindSafe for Memory<T> where
T: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T, P, C, D, U> DefaultGivenOnlineProblem<T, P, C, D> for U where
P: Problem<T, C, D>,
C: ModelOutputSuccess,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenOnlineProblem<T, P, C, D> for U where
P: Problem<T, C, D>,
C: ModelOutputSuccess,
D: ModelOutputFailure,
U: Default,
sourceimpl<T, P, C, D, U> DefaultGivenProblem<T, P, C, D> for U where
P: Problem<T, C, D>,
C: ModelOutputSuccess,
D: ModelOutputFailure,
U: Default,
impl<T, P, C, D, U> DefaultGivenProblem<T, P, C, D> for U where
P: Problem<T, C, D>,
C: ModelOutputSuccess,
D: ModelOutputFailure,
U: Default,
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
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.
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
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.
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more