Struct Waiters 

pub struct Waiters { /* private fields */ }

Every parked client, oldest first.

The order is the order they blocked in and it is the order they are served in, which is what makes a queue with several workers on it fair: two clients blocked on the same key take the two elements a RPUSH q first second adds in the order they arrived. A Vec is the right structure for that while the list is short, and it is short, because a waiter is a client doing nothing.

Implementations

impl Waiters

pub fn is_empty(&self) -> bool

Whether anybody is waiting.

pub fn len(&self) -> usize

How many clients are parked, which is what INFO clients calls blocked_clients.

pub fn at(&self, at: usize) -> Parked

Where the waiter at at has to be answered.

Panics

If at is past the end, which only a caller that ignored Waiters::len can manage.

pub fn db_of(&self, at: usize) -> usize

The database the waiter at at blocked on.

Panics

As Waiters::at.

Trait Implementations

impl Default for Waiters

fn default() -> Waiters

Returns the “default value” for a type.