Struct Online

Source
pub struct Online<P> {
    pub p: P,
    pub w: i32,
}
Expand description

Online instance of a problem.

Fields§

§p: P

Problem.

§w: i32

Finite, non-negative prediction window.

This prediction window is included in the time bound of the problem instance, i.e. at time $t$ $t_end$ should be set to $t + w$.

Implementations§

Source§

impl<'a, P> Online<P>

Source

pub fn into_i(self) -> Online<P::Output>

Discretize online problem.

Source§

impl<'a, P> Online<P>

Source

pub fn into_f(self) -> Online<P::Output>

Relax online problem.

Source§

impl<'a, T> Online<SmoothedLoadOptimization<T>>
where T: Value<'a>,

Source§

impl<'a, T> Online<SmoothedBalancedLoadOptimization<'a, T>>
where T: Value<'a>,

Source§

impl<'a, T, C, D> Online<SimplifiedSmoothedConvexOptimization<'a, T, C, D>>
where T: Value<'a>, C: ModelOutputSuccess + 'a, D: ModelOutputFailure + 'a,

Source

pub fn into_sco(self) -> Online<SmoothedConvexOptimization<'a, T, C, D>>

Source§

impl<'a, P> Online<P>

Source

pub fn stream<T, M, O, C, D>( &mut self, alg: &impl OnlineAlgorithm<'a, T, P, M, O, C, D>, update: impl Fn(&mut Online<P>, &Schedule<T>) -> bool, options: O, ) -> Result<(Schedule<T>, Option<M>)>
where T: Value<'a>, P: Problem<T, C, D> + 'a, M: Memory<'a, T, P, C, D>, O: Options<T, P, C, D>, C: ModelOutputSuccess, D: ModelOutputFailure,

Utility to stream an online algorithm from $T = 1$.

Returns resulting schedule, final memory of the algorithm.

  • alg - Online algorithm to stream.
  • update - Callback that in each iteration updates the problem instance. Return true to continue stream, false to end stream.
  • options - Algorithm options.
Source

pub fn stream_from<T, M, O, C, D>( &mut self, alg: &impl OnlineAlgorithm<'a, T, P, M, O, C, D>, update: impl Fn(&mut Online<P>, &Schedule<T>) -> bool, options: O, xs: &mut Schedule<T>, prev_m: Option<M>, ) -> Result<Option<M>>
where T: Value<'a>, P: Problem<T, C, D> + 'a, M: Memory<'a, T, P, C, D>, O: Options<T, P, C, D>, C: ModelOutputSuccess, D: ModelOutputFailure,

Stream an online algorithm from an arbitrary initial time, given the previous schedule and memory.

Returns final memory of the algorithm.

  • alg - Online algorithm to stream.
  • update - Callback that in each iteration updates the problem instance. Return true to continue stream, false to end stream.
  • options - Algorithm options.
  • xs - Schedule.
  • prev_m - Memory of last iteration.
Source

pub fn next<T, M, O, C, D>( &self, alg: &impl OnlineAlgorithm<'a, T, P, M, O, C, D>, options: O, xs: &mut Schedule<T>, prev_m: Option<M>, ) -> Result<(Config<T>, Option<M>)>
where T: Value<'a>, P: Problem<T, C, D> + 'a, M: Memory<'a, T, P, C, D>, O: Options<T, P, C, D>, C: ModelOutputSuccess, D: ModelOutputFailure,

Executes one step of an online algorithm.

  • alg - Online algorithm to stream.
  • options - Algorithm options.
  • xs - Schedule.
  • prev_m - Memory of last iteration.
Source

pub fn offline_stream<T, M, O, C, D>( &mut self, alg: &impl OnlineAlgorithm<'a, T, P, M, O, C, D>, t_end: i32, options: O, ) -> Result<(Schedule<T>, Option<M>)>
where T: Value<'a>, P: Problem<T, C, D> + 'a, M: Memory<'a, T, P, C, D>, O: Options<T, P, C, D>, C: ModelOutputSuccess, D: ModelOutputFailure,

Utility to stream an online algorithm with a constant cost function from $T = 1$.

Returns resulting schedule, final memory of the algorithm.

  • alg - Online algorithm to stream.
  • t_end - Finite time horizon. $t_end \geq 1$.
Source

pub fn offline_stream_from<T, M, O, C, D>( &'a mut self, alg: &impl OnlineAlgorithm<'a, T, P, M, O, C, D>, t_end: i32, options: O, xs: &mut Schedule<T>, prev_m: Option<M>, ) -> Result<Option<M>>
where T: Value<'a>, P: Problem<T, C, D>, M: Memory<'a, T, P, C, D>, O: Options<T, P, C, D>, C: ModelOutputSuccess, D: ModelOutputFailure,

Utility to stream an online algorithm with a constant cost function from an arbitrary initial time, given the previous schedule and memory.

Returns final memory of the algorithm.

  • alg - Online algorithm to stream.
  • t_end - Finite time horizon. Must be greater or equals to the current time slot.
  • xs - Schedule.
  • prev_m - Memory of last iteration.
Source§

impl<'a, P> Online<P>

Source

pub fn verify(&self) -> Result<()>

Trait Implementations§

Source§

impl<P: Clone> Clone for Online<P>

Source§

fn clone(&self) -> Online<P>

Returns a copy of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<P: Debug> Debug for Online<P>

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<P> Freeze for Online<P>
where P: Freeze,

§

impl<P> RefUnwindSafe for Online<P>
where P: RefUnwindSafe,

§

impl<P> Send for Online<P>
where P: Send,

§

impl<P> Sync for Online<P>
where P: Sync,

§

impl<P> Unpin for Online<P>
where P: Unpin,

§

impl<P> UnwindSafe for Online<P>
where P: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dst: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V