refactor: use new roaring64_bitmap_contains_range_closed function for intersect_with_range

Author: Dr-Emann

croaring/Cargo.toml

@@ -30,7 +30,7 @@ criterion = { version = "0.8", features = ["html_reports"] }
 [dependencies]
 # Support for allocators that use allocator-api2
 allocator-api2 = { version = "0.4.0", optional = true, default-features = false, features = ["alloc"] }
-ffi = { package = "croaring-sys", path = "../croaring-sys", version = "4.7.0" }
+ffi = { package = "croaring-sys", path = "../croaring-sys", version = "4.7.1" }
 
 [[bench]]
 name = "benches"

croaring/src/bitmap64/imp.rs

@@ -590,24 +590,9 @@ impl Bitmap64 {
     #[must_use]
     #[doc(alias = "roaring64_bitmap_contains_range")]
     pub fn contains_range<R: RangeBounds<u64>>(&self, range: R) -> bool {
-        let Some(exclusive_range) = range_to_exclusive(range) else {
-            return true;
-        };
-        self._contains_range(exclusive_range)
-    }
+        let (start, last) = range_to_inclusive(range);
 
-    #[inline]
-    fn _contains_range(&self, exclusive_range: ExclusiveRangeRes) -> bool {
-        let ExclusiveRangeRes {
-            start,
-            end,
-            needs_max,
-        } = exclusive_range;
-
-        if needs_max && !self.contains(u64::MAX) {
-            return false;
-        }
-        unsafe { ffi::roaring64_bitmap_contains_range(self.raw.as_ptr(), start, end) }
+        unsafe { ffi::roaring64_bitmap_contains_range_closed(self.raw.as_ptr(), start, last) }
     }
 
     /// Selects the element at index 'rank' where the smallest element is at index 0