All Classes

Class	Description
AbstractHashFunction<K>	A very minimal abstract hash implementation.
AbstractRank	An abstract implementation of Rank providing a few obvious derived methods.
BalancedParentheses	A data structure providing primitives for balanced parentheses represented in a bit array.
BucketedHashStore<T>	A temporary store of signatures virtually divided into buckets.
BucketedHashStore.Bucket	A bucket returned by a BucketedHashStore.
BucketedHashStore.DuplicateException	Denotes that the bucketed hash store contains a duplicate signature.
ByteArrayFunctionSpeedTest
CHDMinimalPerfectHashFunction<T>	A minimal perfect hash function implemented using the “hash, displace and compress” technique.
CHDMinimalPerfectHashFunction.Builder<T>	A builder class for CHDMinimalPerfectHashFunction.
ChunkedHashStore<T>	Deprecated. Please use a BucketedHashStore, which provides accurate bucket sizing.
ChunkedHashStore.Chunk	A chunk returned by a ChunkedHashStore.
ChunkedHashStore.DuplicateException	Denotes that the chunked hash store contains a duplicate hash triple.
Codec	A class representing a specific instantaneous code for compressed functions.
Codec.Binary	A binary fixed-width codec.
Codec.Binary.Coder
Codec.Binary.Coder.Decoder
Codec.Coder	A coder: provides methods to turn symbols into codewords.
Codec.Decoder	A decoder: provides a method to turn sequences of bits into symbols.
Codec.Gamma	A codec based on Elias's γ code (starting at zero).
Codec.Gamma.Coder
Codec.Gamma.Coder.Decoder
Codec.Huffman	A Huffman codec with length-limiting capabilities and a fast canonical decoder.
Codec.Huffman.Coder
Codec.Huffman.Coder.Decoder
Codec.Unary	A unary codec (starting at zero).
Codec.Unary.Coder
Codec.Unary.Coder.Decoder
Codec.ZeroCodec	A degenerate stateless codec (always returns zero).
Codec.ZeroCodec.Coder
Codec.ZeroCodec.Coder.Decoder
EliasFanoIndexedMonotoneLongBigList	An extension of EliasFanoMonotoneLongBigList providing indexing (i.e., content-based addressing).
EliasFanoIndexedMonotoneLongBigListSpeedTest
EliasFanoLongBigList	A compressed big list of longs; each element occupies a number of bits bounded by one plus its bit length plus the logarithm of the average bit length of an element.
EliasFanoLongBigListSpeedTest
EliasFanoMonotoneBigLongBigList	An implementation of Elias–Fano's representation of monotone sequences identical to EliasFanoMonotoneLongBigList, but slightly slower and without size limitations.
EliasFanoMonotoneBigLongBigListSpeedTest
EliasFanoMonotoneLongBigList	An implementation of Elias–Fano's representation of monotone sequences; an element occupies a number of bits bounded by two plus the logarithm of the average gap.
EliasFanoMonotoneLongBigList16	Deprecated. Please use EliasFanoMonotoneBigLongBigList
EliasFanoMonotoneLongBigListSpeedTest
EliasFanoMonotoneLongBigListTables	An implementation of Elias–Fano's representation of monotone sequences; an element occupies a number of bits bounded by two plus the logarithm of the average gap.
EliasFanoPrefixSumLongBigList	A compressed big list of longs providing prefix sums; an element occupies a number of bits bounded by two plus the logarithm of the average value.
FileLinesBigList	A wrapper exhibiting the lines of a file as a big list.
FileLinesBigList.FileLinesIterator	An iterator over the lines of a FileLinesBigList.
FileLinesList	A wrapper exhibiting the lines of a file as a list.
FileLinesList.FileLinesIterator	An iterator over the lines of a FileLinesList.
FunctionSpeedTest
GenerateGeometricValues
GeneratePowerLawValues
GenerateRandom32BitStrings
GenerateRandom64BitIntegers
GenerateRandom64BitStrings
GenerateRandomStrings
GenerateUniformValues
GOV3Function<T>	An immutable function stored quasi-succinctly using the Genuzio-Ottaviano-Vigna method to solve F2-linear systems.
GOV3Function.Builder<T>	A builder class for GOV3Function.
GOV4Function<T>	An immutable function stored quasi-succinctly using the Genuzio-Ottaviano-Vigna method to solve F2-linear systems.
GOV4Function.Builder<T>	A builder class for GOV4Function.
GOVMinimalPerfectHashFunction<T>	A minimal perfect hash function stored using the Genuzio-Ottaviano-Vigna 3-regular F3-linear system technique.
GOVMinimalPerfectHashFunction.Builder<T>	A builder class for GOVMinimalPerfectHashFunction.
GOVMinimalPerfectHashFunction128<T>	A minimal perfect hash function stored using the Genuzio-Ottaviano-Vigna 3-regular F3-linear system technique.
GOVMinimalPerfectHashFunction128.Builder<T>	A builder class for GOVMinimalPerfectHashFunction128.
GV3CompressedFunction<T>	An immutable function stored in a compressed form.
GV3CompressedFunction.Builder<T>
GV4CompressedFunction<T>	An immutable function stored in a compressed form.
GV4CompressedFunction.Builder<T>
Hashes	Basic hash functions.
HintedBsearchSelect	A hinted binary-search select implementation.
HollowTrieDistributor<T>	A distributor based on a hollow trie.
HollowTrieDistributorMonotoneMinimalPerfectHashFunction<T>	A monotone minimal perfect hash implementation based on fixed-size bucketing that uses a hollow trie as a distributor.
HollowTrieMonotoneMinimalPerfectHashFunction<T>	A hollow trie, that is, a compacted trie recording just the length of the paths associated to the internal nodes.
HollowTrieSpeedTest
HypergraphSorter<T>	A class implementing the 3-hypergraph edge sorting procedure that is necessary for the Majewski-Wormald-Havas-Czech technique.
JacobsonBalancedParentheses	An implementation of Jacobson's balanced parentheses data structure.
LcpMonotoneMinimalPerfectHashFunction<T>	A monotone minimal perfect hash implementation based on fixed-size bucketing that uses longest common prefixes as distributors.
LcpMonotoneMinimalPerfectHashFunction.Builder<T>	A builder class for LcpMonotoneMinimalPerfectHashFunction.
Linear3SystemSolver	A class implementing generation and solution of a random 3-regular linear system on F2 or F3 using the techniques described by Marco Genuzio, Giuseppe Ottaviano and Sebastiano Vigna in “Fast Scalable Construction of (Minimal Perfect Hash) Functions”, 15th International Symposium on Experimental Algorithms — SEA 2016, Lecture Notes in Computer Science, Springer, 2016.
Linear4SystemSolver	A class implementing generation and solution of a random 4-regular linear system on F2 using the techniques described by Marco Genuzio, Giuseppe Ottaviano and Sebastiano Vigna in “Fast Scalable Construction of (Minimal Perfect Hash) Functions”, 15th International Symposium on Experimental Algorithms — SEA 2016, Lecture Notes in Computer Science, Springer, 2016.
ListSpeedTest
LongFunctionSpeedTest
MappedEliasFanoMonotoneLongBigList	A memory-mapped implementation of EliasFanoMonotoneLongBigList/EliasFanoMonotoneBigLongBigList.
MergedBitVectorIterator
MinimalPerfectHashFunction<T>	Deprecated. Use a GOVMinimalPerfectHashFunction.
MinimalPerfectHashFunction.Builder<T>	A builder class for MinimalPerfectHashFunction.
Modulo2SparseSystem
Modulo2SparseSystem.Modulo2Equation
Modulo2System	Solver for linear systems on F2.
Modulo2System.Modulo2Equation	An equation on F2.
Modulo3System	Solver for linear systems on F3.
Modulo3System.Modulo3Equation	An equation on F3.
MWHCFunction<T>	Deprecated. Please a GOV3Function or a GOV4Function.
MWHCFunction.Builder<T>	A builder class for MWHCFunction.
NumberToBitVector	A transformation strategy that converts strings representing integers between 0 (inclusive) and 2k (exclusive)) into fixed-length binary vectors (most-significant bit is the 0-th).
Orient3Hypergraph	Commodity class implementing the selfless algorithm for the orientation of a 3-hypergraph.
PaCoTrieDistributor<T>	A succinct implementation of a binary partial compacted trie based on a recursive bitstream.
PaCoTrieDistributorMonotoneMinimalPerfectHashFunction<T>	A monotone minimal perfect hash implementation based on fixed-size bucketing that uses a partial compacted binary trie (PaCo trie) as distributor.
Rank	A data structure providing ranking over a bit array.
Rank11	A rank11 implementation.
Rank11Original	A rank11 implementation.
Rank12	A rank12 implementation.
Rank16	A rank16 implementation.
Rank9	A rank9 implementation.
Rank9GogPetri	A rank9 implementation.
RankSelect	A serialisation-oriented container for associated rank/select(zero) structures.
RankSelectSpeedTest
RankSpeedTest
Select	A data structure providing selection over a bit array.
Select9	A select9 implementation.
SelectSpeedTest
SelectZero	A data structure providing zero selection over a bit array.
SignedFunctionStringMap	A string map based on a signed function.
SimpleBigSelect	A big version of SimpleSelect that can only be used with a LongBigArrayBitVector (or long big arrays).
SimpleBigSelectZero	A big version of SimpleSelectZero that can only be used with a LongBigArrayBitVector (or long big arrays).
SimpleSelect	A simple select implementation based on a two-level inventory, a spill list and broadword bit search.
SimpleSelectZero	A simple zero-select implementation based on a two-level inventory, a spill list and broadword bit search.
SparseRank	A rank implementation for sparse bit arrays based on the Elias–Fano representation of monotone functions.
SparseSelect	A select implementation for sparse bit arrays based on the Elias–Fano representation of monotone functions.
SuccinctTreeDecoder
TwoSizesLongBigList	A compressed big list of longs; small elements and large elements are stored separately, using two different, optimally chosen bit sizes.
TwoSizesLongBigListSpeedTest
TwoStepsGOV3Function<T>	A function stored using two GOV3Functions—one for frequent values, and one for infrequent values.
TwoStepsGOV3Function.Builder<T>	A builder class for TwoStepsGOV3Function.
TwoStepsLcpMonotoneMinimalPerfectHashFunction<T>	A monotone minimal perfect hash implementation based on fixed-size bucketing that uses longest common prefixes as distributors, and store their lengths using a TwoStepsGOV3Function.
TwoStepsLcpMonotoneMinimalPerfectHashFunction.Builder<T>	A builder class for TwoStepsLcpMonotoneMinimalPerfectHashFunction.
TwoStepsMWHCFunction<T>	Deprecated. Please use TwoStepsGOV3Function.
TwoStepsMWHCFunction.Builder<T>	A builder class for TwoStepsMWHCFunction.
ValueStats
VLLcpMonotoneMinimalPerfectHashFunction<T>	A monotone minimal perfect hash implementation based on fixed-size bucketing that uses longest common prefixes as distributors, and store their lengths using a GOVMinimalPerfectHashFunction indexing an EliasFanoLongBigList.
VLPaCoTrieDistributor<T>	A version of a PaCoTrieDistributor whose space usage depends on the average string length, rather than on the maximum string length; mainly of theoretical interest.
VLPaCoTrieDistributorMonotoneMinimalPerfectHashFunction<T>	A version of a PaCoTrieDistributorMonotoneMinimalPerfectHashFunction whose space usage depends on the average string length, rather than on the maximum string length; mainly of theoretical interest.
ZFastTrie<T>	A z-fast trie, that is, a predecessor/successor data structure using low linear (in the number of keys) additional space and answering to the query string x in time |x|/w + log(max{|x|, |x-|, |x+|}) with high probability, where w is the machine word size, and x-/x+ are the predecessor/successor of x in the currently stored set, respectively.
ZFastTrie.ExitData<U>
ZFastTrie.Handle2NodeMap<U>	A linear-probing hash map that compares keys using signatures as a first try.
ZFastTrie.InternalNode<U>	A internal node.
ZFastTrie.Leaf<U>	An external node, a.k.a. leaf.
ZFastTrie.Node<U>	A node of the trie.
ZFastTrie.ParexData<U>
ZFastTrieDistributor<T>	A distributor based on a z-fast trie.
ZFastTrieDistributorMonotoneMinimalPerfectHashFunction<T>	A monotone minimal perfect hash implementation based on fixed-size bucketing that uses a z-fast trie as a distributor.
ZFastTrieDistributorMonotoneMinimalPerfectHashFunction.Builder<T>	A builder class for ZFastTrieDistributorMonotoneMinimalPerfectHashFunction.
ZFastTrieSpeedTest