Struct WaitList 

pub struct WaitList<L: Lock, I, O> {
    pub lock: L,
    /* private fields */
}

An intrusive linked list of futures.

Fields

lock: L

The lock used by the WaitList.

This is used for internal synchronization, but you can also protect arbitrary state useful to you in here.

Implementations

impl<L, I, O> WaitList<L, I, O>

where <Empty<L> as Iterator>::Item: Lock,

pub const fn new(lock: L) -> Self

Create a new empty WaitList.

pub fn lock_exclusive(&self) -> LockedExclusive<'_, L, I, O>

Take an exclusive lock on the contents of this list.

This function should not be called recursively as it may deadlock, panic or abort.

pub fn lock_shared(&self) -> LockedShared<'_, L, I, O>

Take a shared lock on the contents of this list.

If your chosen lock type only supports exclusive locks, this will take an exclusive lock instead.

Trait Implementations

impl<L: Lock + Debug, I, O> Debug for WaitList<L, I, O>

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

Formats the value using the given formatter.

impl<L: Lock + Default, I, O> Default for WaitList<L, I, O>

fn default() -> Self

Returns the “default value” for a type.

impl<L, I, O> Send for WaitList<L, I, O>

where L: Send + Lock, I: Send, O:,

impl<L, I, O> Sync for WaitList<L, I, O>

where L: Sync + Lock, I: Send + Sync, O: Send,