RoaringBitmap

This is not yet production ready.

This is a Rust port of the Roaring bitmap data structure, initially defined as a Java library and described in Better bitmap performance with Roaring bitmaps.

Developing

Take note of the Collections reform RFC for the API. Mostly aiming to duplicate the BitvSet API.

TODO

• Bounded Iterators (§ in the RFC)
  • fn range(&self, min: Bound<&T>, max: Bound<&T>) -> RangedItems<'a, T>;
• Set Operations (§ in the RFC)
  • Comparisons
    • fn is_disjoint(&self, other: &Self) -> bool;
    • fn is_subset(&self, other: &Self) -> bool;
    • fn is_superset(&self, other: &Self) -> bool;
  • Combinations
    • Iterated Functions
      • fn union<'a>(&'a self, other: &'a Self) -> I;
      • fn intersection<'a>(&'a self, other: &'a Self) -> I;
      • fn difference<'a>(&'a self, other: &'a Self) -> I;
      • fn symmetric_difference<'a>(&'a self, other: &'a Self) -> I;
    • Operator Traits
      • std::ops::BitOr
      • std::ops::BitAnd
      • std::ops::BitXor
      • std::ops::Sub
    • Inplace Functions
      • fn union_with(&mut self, other: &BitvSet)
      • fn intersect_with(&mut self, other: &BitvSet)
      • fn difference_with(&mut self, other: &BitvSet)
      • fn symmetric_difference_with(&mut self, other: &BitvSet)