Structs§

  • Stores a set of intervals on the indices.
  • This data structure optimizes for cases where the stored bits in each row are expected to be highly contiguous (long ranges of 1s or 0s), in contrast to BitMatrix and SparseBitMatrix which are optimized for “random”/non-contiguous bits and cheap(er) point queries at the expense of memory usage.