pub fn maybe_exhausted(&self) -> bool
    where
        B: BoundedReadWords<Word, Queue>,
    {
        let mask_remaining_bits = !self.mask_next_to_read.wrapping_sub(&Word::one());
        self.current_word & mask_remaining_bits == Word::zero() && self.backend.is_exhausted()
    }
/// We don't keep track of the exact length of a queue, so we can only say with
/// certainty if we can detect that there's something left.
We don't keep track of the exact length of a queue, so we can only say with
certainty if we can detect that there's something left.
We don ' t keep track of the exact length of a queue so we can only say with certainty if we can detect that there ' s something left .
pub fn maybe_exhausted(&self) -> bool
    where
        B: BoundedReadWords<Word, Queue>,
    {
        let mask_remaining_bits = !self.mask_next_to_read.wrapping_sub(&Word::one());
        self.current_word & mask_remaining_bits == Word::zero() && self.backend.is_exhausted()
    }
pub fn maybe_exhausted ( & self ) -> bool where B : BoundedReadWords < Word , Queue > , { let mask_remaining_bits = ! self . mask_next_to_read . wrapping_sub ( & Word :: one ( ) ) ; self . current_word & mask_remaining_bits == Word :: zero ( ) && self . backend . is_exhausted ( ) }
We don't keep track of the exact length of a queue, so we can only say with
certainty if we can detect that there's something left.
We don ' t keep track of the exact length of a queue so we can only say with certainty if we can detect that there ' s something left .
&self
&self