Struct WaitQueue 

pub struct WaitQueue<I: Copy + Eq + Hash> { /* private fields */ }

Waiters for one limit’s permits: highest level first, then the levels’ fairness keys in turn (weighted round-robin), then arrival order within a key. Deterministic, so a replicated server can apply it as a state machine. A queue of default-priority waiters only saves as the plain arrival-order list queues always saved as; any other as its levels.

Implementations

impl<I: Copy + Eq + Hash> WaitQueue<I>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn contains(&self, id: &I) -> bool

pub fn push(&mut self, id: I, p: &Priority) -> bool

Queues id behind the waiters of its key and level. A waiter that is already queued keeps its place and priority; returns whether it was added.

pub fn next(&self) -> Option<I>

The waiter served next.

pub fn pop_next(&mut self) -> Option<I>

Removes the waiter served next and moves the turn on: its key keeps the turn until it has taken its weight’s worth of permits.

pub fn remove(&mut self, id: &I) -> bool

Withdraws a waiter; returns whether it was queued.

pub fn retain(&mut self, keep: impl FnMut(&I) -> bool)

Withdraws every waiter keep refuses.

pub fn reindex(&mut self) -> Result<(), String>

Rebuilds the index from the levels (after deserializing); fails on a waiter queued twice or a malformed level.

Trait Implementations

impl<I: Clone + Copy + Eq + Hash> Clone for WaitQueue<I>

fn clone(&self) -> WaitQueue<I>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug + Copy + Eq + Hash> Debug for WaitQueue<I>

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

Formats the value using the given formatter.

impl<I: Copy + Eq + Hash> Default for WaitQueue<I>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, I> Deserialize<'de> for WaitQueue<I>

where I: Copy + Eq + Hash + Deserialize<'de>,

fn deserialize<D: Deserializer<'de>>(d: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl<I: Copy + Eq + Hash> PartialEq for WaitQueue<I>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I: Copy + Eq + Hash + Serialize> Serialize for WaitQueue<I>

fn serialize<S: Serializer>(&self, s: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.