fix: stop assuming HybridBitmap::Large having higher cardinality than Small

Previously, when bitmap_has_all got a Small lhs and a Large rhs, it
simply return false, since a set with fewer cardinality can't has_all
another one with higher cardinality. But due to we don't always demote
Large to Small after cardinality reducing operations, that's not true
anymore.

As a defense, we removed this branch, and the doubting rhs will fall
into branch below, where rhs cardinality is actually checked before
returning false.

Author: harry-hao

src/common/io/src/bitmap.rs

@@ -947,16 +947,14 @@ pub fn bitmap_has_all(lhs: &[u8], rhs: &[u8]) -> Result<bool> {
         return Ok(lhs.has_all_with(&rhs));
     }
 
-    // Fast path: HybridSmall lhs cannot contain HybridLarge rhs
-    if as_roaring(lhs).is_none() && is_hybrid_large(rhs) {
-        return Ok(false);
-    }
-
-    // Fast path: HybridSmall lhs, Legacy rhs — cardinality check
+    // Fast path: HybridSmall lhs, HybridLarge or Legacy rhs cardinality check
+    // We need to check cardinality here because: (1) it might be a legacy tree,
+    // and (2) we don't always demote HybridBitmap after reducing its cardinality immediately.
     if as_roaring(lhs).is_none() && as_roaring(rhs).is_some() {
         let lhs_small = SmallReader::new(lhs)?;
+        let rhs_roaring = as_roaring(rhs).unwrap();
         // Fast path: rhs has more values than lhs, impossible to contain
-        if reader::bitmap_len_above(rhs, lhs_small.len())? {
+        if reader::bitmap_len_above(rhs_roaring, lhs_small.len())? {
             return Ok(false);
         }
         // rhs has <= lhs_small.len() values, but still need to check containment