Struct Windowed 

pub struct Windowed<L, S> { /* private fields */ }

A wrapper around a LimitAlgorithm which aggregates samples within a window, periodically updating the limit.

The window duration is dynamic, based on latencies seen in the previous window.

Various aggregators are available to aggregate samples.

Implementations

impl<L: LimitAlgorithm, S: Aggregator> Windowed<L, S>

pub fn new(inner: L, sampler: S) -> Self

pub fn with_min_samples(self, samples: usize) -> Self

At least this many samples need to be aggregated before updating the limit.

pub fn with_min_window(self, min: Duration) -> Self

Minimum time to wait before attempting to update the limit.

pub fn with_max_window(self, max: Duration) -> Self

Maximum time to wait before attempting to update the limit.

Will wait for longer if not enough samples have been aggregated. See with_min_samples().

Trait Implementations

impl<L: Debug, S: Debug> Debug for Windowed<L, S>

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

Formats the value using the given formatter.

impl<L, S> LimitAlgorithm for Windowed<L, S>

where L: LimitAlgorithm + Send + Sync, S: Aggregator + Send + Sync,

fn limit(&self) -> usize

The current limit.

fn update<'life0, 'async_trait>( &'life0 self, sample: Sample, ) -> Pin<Box<dyn Future<Output = usize> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Update the concurrency limit in response to a new job completion.