Add functions to GrowableBitSet.

Author: Jarcho

compiler/rustc_index/src/bit_set.rs

@@ -1336,13 +1336,29 @@ impl<T: Idx> GrowableBitSet<T> {
         self.bit_set.insert(elem)
     }
 
+    #[inline]
+    pub fn insert_range(&mut self, elems: Range<T>) {
+        self.ensure(elems.end.index());
+        self.bit_set.insert_range(elems);
+    }
+
     /// Returns `true` if the set has changed.
     #[inline]
     pub fn remove(&mut self, elem: T) -> bool {
         self.ensure(elem.index() + 1);
         self.bit_set.remove(elem)
     }
 
+    #[inline]
+    pub fn clear(&mut self) {
+        self.bit_set.clear();
+    }
+
+    #[inline]
+    pub fn count(&self) -> usize {
+        self.bit_set.count()
+    }
+
     #[inline]
     pub fn is_empty(&self) -> bool {
         self.bit_set.is_empty()
@@ -1354,6 +1370,16 @@ impl<T: Idx> GrowableBitSet<T> {
         self.bit_set.words.get(word_index).is_some_and(|word| (word & mask) != 0)
     }
 
+    #[inline]
+    pub fn contains_any(&self, elems: Range<T>) -> bool {
+        if elems.start.index() < self.bit_set.domain_size {
+            self.bit_set
+                .contains_any(elems.start..T::new(elems.end.index().min(self.bit_set.domain_size)))
+        } else {
+            false
+        }
+    }
+
     #[inline]
     pub fn iter(&self) -> BitIter<'_, T> {
         self.bit_set.iter()