Source: sparsebitset
Section: java
Maintainer: Debian Java Maintainers <pkg-java-maintainers@lists.alioth.debian.org>
Uploaders: Emmanuel Bourg <ebourg@apache.org>
Build-Depends:
 debhelper-compat (= 13),
 default-jdk,
 junit4,
 maven-debian-helper (>= 2.6)
Standards-Version: 4.7.4
Vcs-Git: https://salsa.debian.org/java-team/sparsebitset.git
Vcs-Browser: https://salsa.debian.org/java-team/sparsebitset
Homepage: https://github.com/brettwooldridge/SparseBitSet

Package: libsparsebitset-java
Architecture: all
Depends: ${maven:Depends}, ${misc:Depends}
Suggests: ${maven:OptionalDepends}
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.
