Struct EventQueue 

pub struct EventQueue<const CAP: usize> { /* private fields */ }

Available on crate feature event only.

🎫 🗃️ A tiny, zero-alloc FIFO queue for Event.

---

^{📍 ui/event}

---

This structure is intended for small CAP values (typically 1–4), where linear operations are simpler and cheaper than managing head/tail indices.

Implementations

impl<const CAP: usize> EventQueue<CAP>

pub const fn new() -> Self

Creates an empty queue.

pub fn push(&mut self, ev: Event) -> bool

Attempts to push an event into the queue. (O(n))

Returns true on success, or false if the queue is full.

pub fn pop(&mut self) -> Option<Event>

Pops the oldest event (FIFO). (O(CAP))

pub const fn len(&self) -> usize

Returns the exact used capacity (O(n)).

pub const fn capacity(&self) -> usize

Returns the total capacity. (O(1))

pub const fn remaining_capacity(&self) -> usize

Returns the remaining capacity. (O(n))

pub const fn is_empty(&self) -> bool

Returns true if no events are waiting. (O(1))

pub const fn is_full(&self) -> bool

Returns true if there’s no remaining capacity. (O(1))

pub fn clear(&mut self)

Removes all events from the queue. (O(n))

Trait Implementations

impl<const CAP: usize> Clone for EventQueue<CAP>

fn clone(&self) -> EventQueue<CAP>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const CAP: usize> ConstInit for EventQueue<CAP>

const INIT: Self

Returns the compile-time “initial value” for a type.

impl<const CAP: usize> Debug for EventQueue<CAP>

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

Formats the value using the given formatter.

impl<const CAP: usize> Default for EventQueue<CAP>

fn default() -> Self

Returns the “default value” for a type.

impl<const CAP: usize> Eq for EventQueue<CAP>

impl<const CAP: usize> Hash for EventQueue<CAP>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<const CAP: usize> PartialEq for EventQueue<CAP>

fn eq(&self, other: &EventQueue<CAP>) -> 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<const CAP: usize> StructuralPartialEq for EventQueue<CAP>