Struct ArrivalCurvePrefix 

pub struct ArrivalCurvePrefix { /* private fields */ }

An alternate representation of an arbitrary arrival curve intended primarily for input purposes.

Whereas the Curve arrival bound is based on a delta-min representation, this variant expresses the underlying arrival curve by means of a finite sequence of steps and a horizon. This makes this representation easier to use in cases where an arrival curve is not already given in delta-min representation.

Up to the horizon, this representation produces exact results. Beyond the horizon, it uses a quick, but potentially quite pessimistic extrapolation. For better extrapolation, convert the ArrivalCurvePrefix to a Curve (via std::convert::From) and use its extrapolation facilities (or simply wrap it as an ExtrapolatingCurve).

Implementations

impl ArrivalCurvePrefix

pub fn new( horizon: Duration, steps: Vec<(Duration, usize)>, ) -> ArrivalCurvePrefix

Construct a new ArrivalCurvePrefix from a given horizon and a sequence of steps.

The given sequence of steps is a list of tuples of the form (delta, n), with the meaning that the arrival curve first assumes the value n for the interval length delta.

The given sequence of steps must be contained in the horizon and strictly monotonic in n.

pub fn from_arrival_bound_until<T: ArrivalBound>( ab: &T, horizon: Duration, ) -> ArrivalCurvePrefix

Obtain an arrival-curve prefix by recording all steps of a given arbitrary arrival process T until a given horizon.

The steps vector covers all arrivals until the given horizon.

Trait Implementations

impl ArrivalBound for ArrivalCurvePrefix

fn number_arrivals(&self, delta: Duration) -> usize

Bound the number of jobs released in any interval of length delta.

fn clone_with_jitter(&self, jitter: Duration) -> Box<dyn ArrivalBound>

Clone the arrival model while accounting for added release jitter. Returns a boxed dyn object because the underlying type may change.

fn steps_iter<'a>(&'a self) -> Box<dyn Iterator<Item = Duration> + 'a>

Yield the sequence of interval lengths (i.e., values of delta in ArrivalBound::number_arrivals) for which the arrival bound “steps”, i.e., where it shows an increase in the number of released jobs.

fn brute_force_steps_iter<'a>( &'a self, ) -> Box<dyn Iterator<Item = Duration> + 'a>

Same semantics as ArrivalBound::steps_iter, but provided by a default implementation in the most naive way possible. Avoid if performance is at all important.

impl Clone for ArrivalCurvePrefix

fn clone(&self) -> ArrivalCurvePrefix

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ArrivalCurvePrefix

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

Formats the value using the given formatter.

impl From<&ArrivalCurvePrefix> for Curve

fn from(ac: &ArrivalCurvePrefix) -> Self

Converts to this type from the input type.

impl From<ArrivalCurvePrefix> for Curve

fn from(ac: ArrivalCurvePrefix) -> Self

Converts to this type from the input type.