Struct ratelimit_meter::example_algorithms::Allower

pub struct Allower {}

The most naive implementation of a rate-limiter ever: Always allows every cell through.

Example

use ratelimit_meter::{Decider};
use ratelimit_meter::example_algorithms::Allower;
let mut allower = Allower::new();
assert!(allower.check().is_ok());

Implementations

impl Allower

pub fn new() -> Allower

Trait Implementations

impl Clone for Allower

fn clone(&self) -> Allower

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Decider for Allower

fn check(&mut self) -> Result<(), NonConformance>

Tests if a single cell can be accommodated at Instant::now(). If it can be, check updates the Decider to account for the conforming cell and returns Ok(()).

fn check_at(&mut self, at: Instant) -> Result<(), NonConformance>

Tests whether a single cell can be accommodated at the given time stamp. See check.

impl Default for Allower

fn default() -> Allower

Returns the “default value” for a type.

impl MultiDecider for Allower

fn check_n_at(&mut self, n: u32, at: Instant) -> Result<(), NegativeMultiDecision>

Tests if n cells can be accommodated at the given time stamp. If (and only if) all cells in the batch can be accomodated, the MultiDecider updates the internal state to account for all cells and returns Ok(()).

fn check_n(&mut self, n: u32) -> Result<(), NegativeMultiDecision>

Tests if n cells can be accommodated at the current time (Instant::now()), using check_n_at

impl Copy for Allower