* Package name    : sparsebitset
  Version         : 1.3
  Upstream Contact: Brett Wooldridge <brett.wooldridge@gmail.com>
* URL             : https://github.com/brettwooldridge/SparseBitSet
* License         : Apache-2.0
  Programming Lang: Java
  Description     : efficient sparse bit set implementation for Java

SparseBitSet holds large numbers of bits, or bits at very high offsets, in far
less memory than the standard java.util.BitSet. BitSet keeps one contiguous
array covering every offset up to the highest bit that has been set, so
recording a single bit near the top of the int range costs hundreds of
megabytes.

SparseBitSet uses a structure modelled on virtual memory instead, and
allocates only the blocks it actually needs, for an overhead of about 0.03
32-bit words per 64 bits. It offers the same logical operations as BitSet -
and, inclusive or, exclusive or, and and-not - over all or part of the set.

This package is a build dependency of libapache-poi-java. Apache POI replaced
java.util.BitSet with SparseBitSet in 4.1.2 to fix an out-of-memory condition
when parsing arbitrary shape ids in a presentation file, so the version of POI
currently in the archive cannot be updated past 4.1.1 without it. The library
is a single class with no dependencies of its own.

It will be maintained by the Debian Java team.