pub fn is_full(&self) -> bool {
        let head = self.head.load(Ordering::SeqCst);
        let tail = self.tail.load(Ordering::SeqCst);
        (tail + 1) % (self.capacity() + 1) == head
    }
/// Checks if the ring buffer is full.
Checks if the ring buffer is full.
Checks if the ring buffer is full .
pub fn is_full(&self) -> bool {
        let head = self.head.load(Ordering::SeqCst);
        let tail = self.tail.load(Ordering::SeqCst);
        (tail + 1) % (self.capacity() + 1) == head
    }
pub fn is_full ( & self ) -> bool { let head = self . head . load ( Ordering :: SeqCst ) ; let tail = self . tail . load ( Ordering :: SeqCst ) ; ( tail + 1 ) % ( self . capacity ( ) + 1 ) == head }
Checks if the ring buffer is full.
Checks if the ring buffer is full .
&self
&self