Struct Slice 

pub struct Slice<'a, T> { /* private fields */ }

Analogously to Aggregate, a wrapper type for representing the total demand of individual demand sources. Whereas Aggregate wraps a vector, this type wraps a slice of an array.

Implementations

impl<'a, T> Slice<'a, T>

pub fn of(slice: &'a [T]) -> Self

Trait Implementations

impl<'a, T: RequestBound> AggregateRequestBound for Slice<'a, T>

fn service_needed_by_n_jobs_per_component( &self, delta: Duration, max_jobs: usize, ) -> Service

Bound the total amount of service needed in an interval of length delta, subject to the constraint that no individual source of demand contributes more than max_jobs worth of demand.

impl<'a, T: Clone> Clone for Slice<'a, T>

fn clone(&self) -> Slice<'a, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, T: Debug> Debug for Slice<'a, T>

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

Formats the value using the given formatter.

impl<'a, T: RequestBound> RequestBound for Slice<'a, T>

fn service_needed(&self, delta: Duration) -> Service

Bound the total amount of service needed in an interval of length delta.

fn least_wcet_in_interval(&self, delta: Duration) -> Service

Expose the smallest WCET of any job encountered in an interval of length delta.

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

Yield an iterator over the interval lengths (i.e., values of delta in RequestBound::service_needed) at which the cumulative demand changes.

fn job_cost_iter<'b>( &'b self, delta: Duration, ) -> Box<dyn Iterator<Item = Service> + 'b>

Expose an iterator over the individual costs that comprise the overall demand.

fn service_needed_by_n_jobs(&self, delta: Duration, max_jobs: usize) -> Service

Bound the total amount of service needed by up to max_jobs in an interval of length delta.