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().unwrap().is_compliant());

Methods

impl Allower

fn new() -> Allower

Trait Implementations

impl Copy for Allower

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 DeciderImpl for Allower

type T = ()

Allower never returns a negative answer, so negative answers don't carry information.

fn test_and_update(&mut self, _t0: Instant) -> Result<Decision<()>>

Allows the cell through unconditionally.

impl Decider for Allower

fn check(&mut self) -> Result<Decision<Self::T>>

Tests if a single cell can be accomodated at Instant::now(). See check_at.

fn check_at(&mut self, at: Instant) -> Result<Decision<Self::T>>

Tests is a single cell can be accomodated at the given time stamp.