We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
The implementation of BitvSet::is_disjoint is this:
BitvSet::is_disjoint
#[inline] fn is_disjoint(&self, other: &BitvSet) -> bool { self.intersection(other).count() > 0 }
It also shouldn't use count; it can just check whether the intersection iterator is empty directly.
count
intersection