Class BoundedQueue

crates/hiroz/src/queue.rs:16–24

A bounded queue that drops the OLDEST element when full (ROS depth QoS behavior). Unlike channels that block or drop the newest element when full, this queue maintains the most recent N elements, where N is the capacity.

/// Unlike channels that block or drop the newest element when full, this queue
/// maintains the most recent N elements, where N is the capacity.
pub struct BoundedQueue<T> {
    data: Mutex<VecDeque<T>>,
    /// Condvar for blocking recv operations
    not_empty: Condvar,
    /// Runtime-agnostic async notification
    event: Event,
    /// Maximum capacity (usize::MAX = unlimited for KeepAll)
    capacity: usize,
}

impl<T> BoundedQueue<T> {
    /// Create a new bounded queue with the specified capacity.