Method has_false

arrow-buffer/src/buffer/boolean.rs:660–687

Returns whether there is at least one `false` value in this buffer. This is more efficient than `len() > count_set_bits()` because it can short-circuit as soon as a `false` value is found, without counting all set bits. Returns `false` for empty buffer.

(&self)

    ///
    /// Returns `false` for empty buffer.
    pub fn has_false(&self) -> bool {
        let bit_chunks = self.unaligned_bit_chunks();
        // UnalignedBitChunk zeros padding bits; fill them with 1s so
        // they don't appear as false values.
        let lead_mask = !((1u64 << bit_chunks.lead_padding()) - 1);
        let trail_mask = if bit_chunks.trailing_padding() == 0 {
            u64::MAX
        } else {
            (1u64 << (64 - bit_chunks.trailing_padding())) - 1
        };
        let (prefix_fill, suffix_fill) = match (bit_chunks.prefix(), bit_chunks.suffix()) {
            (Some(_), Some(_)) => (!lead_mask, !trail_mask),
            (Some(_), None) => (!lead_mask | !trail_mask, 0),
            (None, Some(_)) => (0, !trail_mask),
            (None, None) => (0, 0),
        };
        let chunks = bit_chunks.chunks();
        let mut exact = chunks.chunks_exact(Self::CHUNK_FOLD_BLOCK_SIZE);
        let found = bit_chunks
            .prefix()
            .is_some_and(|v| (v | prefix_fill) != u64::MAX)
            || exact.any(|block| block.iter().fold(u64::MAX, |acc, &c| acc & c) != u64::MAX);
        found
            || exact.remainder().iter().any(|&c| c != u64::MAX)
            || bit_chunks
                .suffix()
                .is_some_and(|v| (v | suffix_fill) != u64::MAX)
    }
}

impl Not for &BooleanBuffer {