A B C D E F G H I J L M N O P R S T U V W

A

AbstractHashFunction<K> - Class in it.unimi.dsi.sux4j.mph

A very minimal abstract hash implementation.

AbstractHashFunction() - Constructor for class it.unimi.dsi.sux4j.mph.AbstractHashFunction

AbstractRank - Class in it.unimi.dsi.sux4j.bits

An abstract implementation of Rank providing a few obvious derived methods.

AbstractRank() - Constructor for class it.unimi.dsi.sux4j.bits.AbstractRank

array - Variable in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

The bit array supporting MinimalPerfectHashFunction.values.

B

bits - Variable in class it.unimi.dsi.sux4j.bits.Rank16

bits - Variable in class it.unimi.dsi.sux4j.bits.Rank9

BITS_PER_BLOCK - Static variable in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

The number of bits per block in the rank structure.

bitsPerSkip() - Method in class it.unimi.dsi.sux4j.mph.HollowTrieDistributor

BitstreamImmutablePaCoTrie<T> - Class in it.unimi.dsi.sux4j.mph

A succinct implementation of a binary partial compacted trie based on a recursive bitstream.

BitstreamImmutablePaCoTrie(Iterable<? extends T>, int, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.BitstreamImmutablePaCoTrie

Creates a partial compacted trie using given elements, bucket size and transformation strategy.

bitVector() - Method in class it.unimi.dsi.sux4j.bits.HintedBsearchSelect

bitVector() - Method in interface it.unimi.dsi.sux4j.bits.Rank

Returns the bit vector indexed by this structure.

bitVector - Variable in class it.unimi.dsi.sux4j.bits.Rank16

bitVector() - Method in class it.unimi.dsi.sux4j.bits.Rank16

bitVector - Variable in class it.unimi.dsi.sux4j.bits.Rank9

bitVector() - Method in class it.unimi.dsi.sux4j.bits.Rank9

bitVector() - Method in class it.unimi.dsi.sux4j.bits.RankSelect

bitVector() - Method in interface it.unimi.dsi.sux4j.bits.Select

Returns the bit vector indexed by this structure.

bitVector() - Method in class it.unimi.dsi.sux4j.bits.Select9

bitVector() - Method in interface it.unimi.dsi.sux4j.bits.SelectZero

Returns the bit vector indexed by this structure.

bitVector() - Method in class it.unimi.dsi.sux4j.bits.SimpleSelect

bitVector() - Method in class it.unimi.dsi.sux4j.bits.SimpleSelectZero

bitVector() - Method in class it.unimi.dsi.sux4j.bits.SparseRank

Returns the bit vector indexed; since the bits are not stored in this data structure, a copy is built on purpose and returned.

bitVector() - Method in class it.unimi.dsi.sux4j.bits.SparseSelect

Returns the bit vector indexed; since the bits are not stored in this data structure, a copy is built on purpose and returned.

bitVectorToEdge(BitVector, long, int, int[]) - Static method in class it.unimi.dsi.sux4j.mph.HypergraphSorter

Turns a bit vector into a 3-hyperedge.

bucketSize - Variable in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

The size of a bucket.

bucketSize - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

The size of a bucket.

bucketSizeMask - Variable in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

The mask for LcpMonotoneMinimalPerfectHashFunction.log2BucketSize bits.

bucketSizeMask - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

The mask for TwoStepsLcpMonotoneMinimalPerfectHashFunction.log2BucketSize bits.

buildTrie(ObjectList<BitVector>, ObjectList<BitVector>, int, Reference2LongMap<BitVector>) - Method in class it.unimi.dsi.sux4j.mph.HollowTrie

Builds a trie recursively.

C

close() - Method in class it.unimi.dsi.sux4j.io.FileLinesList.FileLinesIterator

containsKey(Object) - Method in class it.unimi.dsi.sux4j.mph.AbstractHashFunction

containsKey(Object) - Method in class it.unimi.dsi.sux4j.mph.BitstreamImmutablePaCoTrie

containsKey(Object) - Method in class it.unimi.dsi.sux4j.mph.HollowTrieDistributor

containsKey(Object) - Method in class it.unimi.dsi.sux4j.mph.MWHCFunction

containsKey(Object) - Method in class it.unimi.dsi.sux4j.mph.RelativeTrieDistributor

containsKey(Object) - Method in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated.

count() - Method in class it.unimi.dsi.sux4j.bits.AbstractRank

count() - Method in interface it.unimi.dsi.sux4j.bits.Rank

Returns the number of ones in the bit vector indexed by this class.

count - Variable in class it.unimi.dsi.sux4j.bits.Rank16

count() - Method in class it.unimi.dsi.sux4j.bits.Rank16

count - Variable in class it.unimi.dsi.sux4j.bits.Rank9

count() - Method in class it.unimi.dsi.sux4j.bits.Rank9

count() - Method in class it.unimi.dsi.sux4j.bits.RankSelect

count - Variable in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

The number of nonzero bit pairs up to a given block of MinimalPerfectHashFunction.BITS_PER_BLOCK bits.

countNonzeroPairs(long) - Static method in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

Counts the number of nonzero pairs of bits in a long.

D

data - Variable in class it.unimi.dsi.sux4j.mph.MWHCFunction

The final magick—the list of modulo-3 values that define the output of the minimal hash function.

E

edge - Variable in class it.unimi.dsi.sux4j.mph.HypergraphSorter

An 3×n array recording the triple of vertices involved in each hyperedge.

EliasFanoLongBigList - Class in it.unimi.dsi.sux4j.util

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.

EliasFanoLongBigList(LongIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(IntIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(ShortIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(ByteIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(LongIterator) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(IntIterator) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(ShortIterator) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(ByteIterator) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(IntIterator, int) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(ShortIterator, short) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(ByteIterator, byte) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoLongBigList(LongIterator, long) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

Creates a new Elias–Fano long big list.

EliasFanoMonotoneLongBigList - Class in it.unimi.dsi.sux4j.util

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.

EliasFanoMonotoneLongBigList(long, int, LongBigList, SimpleSelect) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

EliasFanoMonotoneLongBigList(IntIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

Creates an Elias–Fano representation of the values returned by the given iterable object.

EliasFanoMonotoneLongBigList(ShortIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

Creates an Elias–Fano representation of the values returned by the given iterable object.

EliasFanoMonotoneLongBigList(ByteIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

Creates an Elias–Fano representation of the values returned by the given iterable object.

EliasFanoMonotoneLongBigList(LongIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

Creates an Elias–Fano representation of the values returned by the given iterable object.

EliasFanoMonotoneLongBigList(long, long, ByteIterator) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

Creates an Elias–Fano representation of the values returned by an iterator, given that the overall number of elements and an upper bound are provided, too.

EliasFanoMonotoneLongBigList(long, long, ShortIterator) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

Creates an Elias–Fano representation of the values returned by an iterator, given that the overall number of elements and an upper bound are provided, too.

EliasFanoMonotoneLongBigList(long, long, IntIterator) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

Creates an Elias–Fano representation of the values returned by an iterator, given that the overall number of elements and an upper bound are provided, too.

EliasFanoMonotoneLongBigList(long, long, LongIterator) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

Creates an Elias–Fano representation of the values returned by an iterator, given that the overall number of elements and an upper bound are provided, too.

EliasFanoMonotoneLongBigList(long[], LongIterator) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

Creates an Elias–Fano representation of the values returned by an iterator, given that the overall number of elements and an upper bound are provided, too.

EliasFanoPrefixSumLongBigList - Class in it.unimi.dsi.sux4j.util

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.

EliasFanoPrefixSumLongBigList(LongIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoPrefixSumLongBigList

Creates a new Elias–Fano prefix-sum long big list.

EliasFanoPrefixSumLongBigList(IntIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoPrefixSumLongBigList

Creates a new Elias–Fano prefix-sum long big list.

EliasFanoPrefixSumLongBigList(ShortIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoPrefixSumLongBigList

Creates a new Elias–Fano prefix-sum long big list.

EliasFanoPrefixSumLongBigList(ByteIterable) - Constructor for class it.unimi.dsi.sux4j.util.EliasFanoPrefixSumLongBigList

Creates a new Elias–Fano prefix-sum long big list.

escape - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

The escape value returned by TwoStepsMWHCFunction.firstFunction to suggest that TwoStepsMWHCFunction.secondFunction should be queried instead, provided that there is a first function.

F

FileLinesList - Class in it.unimi.dsi.sux4j.io

A wrapper exhibiting the lines of a file as a list.

FileLinesList(CharSequence, String, int, EnumSet<FastBufferedInputStream.LineTerminator>) - Constructor for class it.unimi.dsi.sux4j.io.FileLinesList

Creates a file-lines collection for the specified filename with the specified encoding, buffer size and terminator set.

FileLinesList(CharSequence, String, int) - Constructor for class it.unimi.dsi.sux4j.io.FileLinesList

Creates a file-lines collection for the specified filename with the specified encoding, buffer size and with all terminators.

FileLinesList(CharSequence, String) - Constructor for class it.unimi.dsi.sux4j.io.FileLinesList

Creates a file-lines collection for the specified filename with the specified encoding, default buffer size and with all terminators.

FileLinesList.FileLinesIterator - Class in it.unimi.dsi.sux4j.io

An iterator over the lines of a FileLinesList.

FileLinesList.FileLinesIterator(FileLinesList, int, FastBufferedInputStream, CharsetDecoder, ByteBuffer, CharBuffer) - Constructor for class it.unimi.dsi.sux4j.io.FileLinesList.FileLinesIterator

finalize() - Method in class it.unimi.dsi.sux4j.io.FileLinesList.FileLinesIterator

firstFunction - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

The first function, or null.

G

GAMMA - Static variable in class it.unimi.dsi.sux4j.mph.HypergraphSorter

The mythical threshold (or better, a reasonable upper bound of): random 3-hypergraphs are acyclic with positive probability if the ratio hyperedges/vertices exceeds this constant.

generateAndSort(Iterator<? extends T>, TransformationStrategy<? super T>, long) - Method in class it.unimi.dsi.sux4j.mph.HypergraphSorter

Generates a random 3-hypergraph and tries to sort its edges.

get(int) - Method in class it.unimi.dsi.sux4j.io.FileLinesList

get(int, FastBufferedInputStream, ByteBuffer, CharBuffer, CharsetDecoder) - Method in class it.unimi.dsi.sux4j.io.FileLinesList

get(Object) - Method in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated.

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.BitstreamImmutablePaCoTrie

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.HollowTrie

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.HollowTrieDistributor

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.HollowTrieMonotoneMinimalPerfectHashFunction

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.MWHCFunction

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.PaCoTrieMonotoneMinimalPerfectHashFunction

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.RelativeTrieDistributor

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.RelativeTrieMonotoneMinimalPerfectHashFunction

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

getLong(Object) - Method in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

getLong(long) - Method in class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

getLong(long) - Method in class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

getLong(long) - Method in class it.unimi.dsi.sux4j.util.EliasFanoPrefixSumLongBigList

getLong(Object) - Method in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated.

getLong(long) - Method in class it.unimi.dsi.sux4j.util.TwoSizesLongBigList

getRank() - Method in class it.unimi.dsi.sux4j.bits.SparseSelect

Creates a new SparseRank structure sharing data with this instance.

getSelect() - Method in class it.unimi.dsi.sux4j.bits.SparseRank

Creates a new SparseSelect structure sharing data with this instance.

H

hash - Variable in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated. The underlying map.

Hashes - Class in it.unimi.dsi.sux4j.mph

Basic hash functions.

hasNext() - Method in class it.unimi.dsi.sux4j.io.FileLinesList.FileLinesIterator

hasPrevious() - Method in class it.unimi.dsi.sux4j.io.FileLinesList.FileLinesIterator

hasTerms() - Method in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

hasTerms() - Method in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

HintedBsearchSelect - Class in it.unimi.dsi.sux4j.bits

A hinted binary-search select implementation.

HintedBsearchSelect(Rank9) - Constructor for class it.unimi.dsi.sux4j.bits.HintedBsearchSelect

HollowTrie<T> - Class in it.unimi.dsi.sux4j.mph

A hollow trie, that is, a compacted trie recording just the length of the paths associated to the internal nodes.

HollowTrie(Iterable<? extends T>, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.HollowTrie

HollowTrie(Iterator<? extends T>, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.HollowTrie

HollowTrieDistributor<T> - Class in it.unimi.dsi.sux4j.mph

A distributor based on a hollow trie.

HollowTrieDistributor(Iterable<? extends T>, int, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.HollowTrieDistributor

Creates a partial compacted trie using given elements, bucket size and transformation strategy.

HollowTrieDistributor(Iterable<? extends T>, int, TransformationStrategy<? super T>, File) - Constructor for class it.unimi.dsi.sux4j.mph.HollowTrieDistributor

Creates a partial compacted trie using given elements, bucket size, transformation strategy, and temporary directory.

HollowTrieMonotoneMinimalPerfectHashFunction<T> - Class in it.unimi.dsi.sux4j.mph

A monotone minimal perfect hash implementation based on fixed-size bucketing that uses a hollow trie as a distributor.

HollowTrieMonotoneMinimalPerfectHashFunction(Iterable<? extends T>, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.HollowTrieMonotoneMinimalPerfectHashFunction

Creates a new hollow-trie-based monotone minimal perfect hash function using the given elements and transformation strategy, using the default temporary directory.

HollowTrieMonotoneMinimalPerfectHashFunction(Iterable<? extends T>, TransformationStrategy<? super T>, File) - Constructor for class it.unimi.dsi.sux4j.mph.HollowTrieMonotoneMinimalPerfectHashFunction

Creates a new hollow-trie-based monotone minimal perfect hash function using the given elements, transformation strategy, and temporary directory.

HypergraphSorter<T> - Class in it.unimi.dsi.sux4j.mph

A class implementing the 3-hypergraph edge sorting procedure that is necessary for the Majewski-Wormald-Havas-Czech technique.

HypergraphSorter(int) - Constructor for class it.unimi.dsi.sux4j.mph.HypergraphSorter

Creates a hypergraph sorter for a given number of edges.

I

it.unimi.dsi.sux4j.bits - package it.unimi.dsi.sux4j.bits

Ranking and selection structures.

it.unimi.dsi.sux4j.io - package it.unimi.dsi.sux4j.io

I/O classes exploiting succinct data structures.

it.unimi.dsi.sux4j.mph - package it.unimi.dsi.sux4j.mph

Minimal perfect hash functions.

it.unimi.dsi.sux4j.util - package it.unimi.dsi.sux4j.util

Succinct data structures for collections.

J

jenkins(BitVector, long, long[]) - Static method in class it.unimi.dsi.sux4j.mph.Hashes

Jenkins 64-bit hashing (all three values produced).

jenkins(BitVector, long) - Static method in class it.unimi.dsi.sux4j.mph.Hashes

Jenkins 64-bit hashing.

jenkins(BitVector) - Static method in class it.unimi.dsi.sux4j.mph.Hashes

Jenkins 64-bit hashing.

L

l - Variable in class it.unimi.dsi.sux4j.bits.SparseRank

The number of lower bits.

l - Variable in class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

The number of lower bits.

lastOne - Variable in class it.unimi.dsi.sux4j.bits.Rank16

lastOne() - Method in class it.unimi.dsi.sux4j.bits.Rank16

lastOne - Variable in class it.unimi.dsi.sux4j.bits.Rank9

lastOne() - Method in class it.unimi.dsi.sux4j.bits.Rank9

lcp2Bucket - Variable in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

A function mapping each longest common prefix to its bucket.

lcp2Bucket - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

A function mapping each longest common prefix to its bucket.

lcpLengths - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

LcpMonotoneMinimalPerfectHashFunction<T> - Class in it.unimi.dsi.sux4j.mph

A monotone minimal perfect hash implementation based on fixed-size bucketing that uses longest common prefixes as distributors.

LcpMonotoneMinimalPerfectHashFunction(Iterable<? extends T>, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

length() - Method in class it.unimi.dsi.sux4j.bits.SparseSelect

length() - Method in class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

length - Variable in class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

The length of the sequence.

length() - Method in class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

length() - Method in class it.unimi.dsi.sux4j.util.EliasFanoPrefixSumLongBigList

length() - Method in class it.unimi.dsi.sux4j.util.TwoSizesLongBigList

list() - Method in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated.

listIterator(int) - Method in class it.unimi.dsi.sux4j.io.FileLinesList

log2BucketSize - Variable in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

Fast.ceilLog2(int) of LcpMonotoneMinimalPerfectHashFunction.bucketSize.

log2BucketSize - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

Fast.ceilLog2(int) of TwoStepsLcpMonotoneMinimalPerfectHashFunction.bucketSize.

lowerBits - Variable in class it.unimi.dsi.sux4j.bits.SparseRank

The list of lower bits of the position of each one, stored explicitly.

lowerBits - Variable in class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

The list of lower bits of each element, stored explicitly.

lowerLBitsMask - Variable in class it.unimi.dsi.sux4j.bits.SparseRank

The mask for lower bits.

M

m - Variable in class it.unimi.dsi.sux4j.bits.SparseRank

The number of ones in the underlying bit array.

m - Variable in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

The number of vertices of the intermediate hypergraph.

m - Variable in class it.unimi.dsi.sux4j.mph.MWHCFunction

The number of vertices of the intermediate hypergraph.

main(String[]) - Static method in class it.unimi.dsi.sux4j.mph.HollowTrie

main(String[]) - Static method in class it.unimi.dsi.sux4j.mph.HollowTrieMonotoneMinimalPerfectHashFunction

main(String[]) - Static method in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

main(String[]) - Static method in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

main(String[]) - Static method in class it.unimi.dsi.sux4j.mph.MWHCFunction

main(String[]) - Static method in class it.unimi.dsi.sux4j.mph.PaCoTrieMonotoneMinimalPerfectHashFunction

main(String[]) - Static method in class it.unimi.dsi.sux4j.mph.RelativeTrieMonotoneMinimalPerfectHashFunction

main(String[]) - Static method in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

main(String[]) - Static method in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated.

marker - Variable in class it.unimi.dsi.sux4j.mph.MWHCFunction

Optionally, a MWHCFunction.rank structure built on this bit array is used to mark positions containing non-zero value; indexing in MWHCFunction.data is made by ranking if this field is non-null.

mask - Variable in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated. The mask to get only ShiftAddXorSignedStringMap.width nonzero bits.

MinimalPerfectHashFunction<T> - Class in it.unimi.dsi.sux4j.mph

A minimal perfect hash function.

MinimalPerfectHashFunction(Iterable<? extends T>, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

Creates a new minimal perfect hash table for the given elements.

MinimalPerfectHashFunction(MinimalPerfectHashFunction<T>) - Constructor for class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

Creates a new minimal perfect hash by copying a given one; non-transient fields are (shallow) copied.

MWHCFunction<T> - Class in it.unimi.dsi.sux4j.mph

An immutable function stored using the Majewski-Wormald-Havas-Czech 3-hypergraph technique.

MWHCFunction(Iterable<? extends T>, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.MWHCFunction

Creates a new function for the given elements, assigning to each element its ordinal position.

MWHCFunction(Iterable<? extends T>, TransformationStrategy<? super T>, LongList, int) - Constructor for class it.unimi.dsi.sux4j.mph.MWHCFunction

Creates a new function for the given elements and values.

MWHCFunction(MWHCFunction<T>) - Constructor for class it.unimi.dsi.sux4j.mph.MWHCFunction

Creates a new function by copying a given one; non-transient fields are (shallow) copied.

N

n - Variable in class it.unimi.dsi.sux4j.bits.SparseRank

The length of the underlying bit array.

n - Variable in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

The number of elements.

n - Variable in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

The number of elements.

n - Variable in class it.unimi.dsi.sux4j.mph.MWHCFunction

The number of elements.

n - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

The number of elements.

n - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

The number of elements.

next() - Method in class it.unimi.dsi.sux4j.io.FileLinesList.FileLinesIterator

nextIndex() - Method in class it.unimi.dsi.sux4j.io.FileLinesList.FileLinesIterator

numberOfLeaves() - Method in class it.unimi.dsi.sux4j.mph.BitstreamImmutablePaCoTrie

Returns the number of leaves in this trie.

numBits() - Method in class it.unimi.dsi.sux4j.bits.HintedBsearchSelect

numBits() - Method in interface it.unimi.dsi.sux4j.bits.Rank

Returns the overall number of bits allocated by this structure.

numBits() - Method in class it.unimi.dsi.sux4j.bits.Rank16

numBits() - Method in class it.unimi.dsi.sux4j.bits.Rank9

numBits() - Method in class it.unimi.dsi.sux4j.bits.RankSelect

numBits() - Method in interface it.unimi.dsi.sux4j.bits.Select

Returns the overall number of bits allocated by this structure.

numBits() - Method in class it.unimi.dsi.sux4j.bits.Select9

numBits() - Method in interface it.unimi.dsi.sux4j.bits.SelectZero

Returns the overall number of bits allocated by this structure.

numBits() - Method in class it.unimi.dsi.sux4j.bits.SimpleSelect

numBits() - Method in class it.unimi.dsi.sux4j.bits.SimpleSelectZero

numBits() - Method in class it.unimi.dsi.sux4j.bits.SparseRank

numBits() - Method in class it.unimi.dsi.sux4j.bits.SparseSelect

numBits() - Method in class it.unimi.dsi.sux4j.mph.BitstreamImmutablePaCoTrie

numBits() - Method in class it.unimi.dsi.sux4j.mph.HollowTrie

numBits() - Method in class it.unimi.dsi.sux4j.mph.HollowTrieDistributor

numBits() - Method in class it.unimi.dsi.sux4j.mph.HollowTrieMonotoneMinimalPerfectHashFunction

numBits() - Method in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

Returns the number of bits used by this structure.

numBits() - Method in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

Returns the number of bits used by this structure.

numBits() - Method in class it.unimi.dsi.sux4j.mph.MWHCFunction

Returns the number of bits used by this structure.

numBits() - Method in class it.unimi.dsi.sux4j.mph.PaCoTrieMonotoneMinimalPerfectHashFunction

numBits() - Method in class it.unimi.dsi.sux4j.mph.RelativeTrieDistributor

numBits() - Method in class it.unimi.dsi.sux4j.mph.RelativeTrieMonotoneMinimalPerfectHashFunction

numBits() - Method in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

Returns the number of bits used by this structure.

numBits() - Method in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

Returns the number of bits used by this structure.

numBits() - Method in class it.unimi.dsi.sux4j.util.EliasFanoLongBigList

numBits() - Method in class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

numBits() - Method in class it.unimi.dsi.sux4j.util.TwoSizesLongBigList

numEdges - Variable in class it.unimi.dsi.sux4j.mph.HypergraphSorter

The number of edges in the hypergraph.

numOnes - Variable in class it.unimi.dsi.sux4j.bits.Rank16

numOnes - Variable in class it.unimi.dsi.sux4j.bits.Rank9

numVertices - Variable in class it.unimi.dsi.sux4j.mph.HypergraphSorter

The number of vertices in the hypergraph ( ⌈ HypergraphSorter.GAMMA * HypergraphSorter.numEdges ⌉ + 1 ).

numWords - Variable in class it.unimi.dsi.sux4j.bits.Rank16

numWords - Variable in class it.unimi.dsi.sux4j.bits.Rank9

O

offsetLcpLength - Variable in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

A function mapping each element to the offset inside its bucket (lowest LcpMonotoneMinimalPerfectHashFunction.log2BucketSize bits) and to the length of the longest common prefix of its bucket (remaining bits).

offsets - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

A function mapping each element to the offset inside its bucket (lowest TwoStepsLcpMonotoneMinimalPerfectHashFunction.log2BucketSize bits) and to the length of the longest common prefix of its bucket (remaining bits).

P

PaCoTrieMonotoneMinimalPerfectHashFunction<T> - Class in it.unimi.dsi.sux4j.mph

A monotone minimal perfect hash implementation based on fixed-size bucketing that uses a partial compacted binary trie (PaCo trie) as distributor.

PaCoTrieMonotoneMinimalPerfectHashFunction(Iterable<? extends T>, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.PaCoTrieMonotoneMinimalPerfectHashFunction

Creates a new PaCo-trie-based monotone minimal perfect hash function using the given elements and transformation strategy.

prefixSum(long) - Method in class it.unimi.dsi.sux4j.util.EliasFanoPrefixSumLongBigList

Returns the prefix sum of this list up to the given index.

previous() - Method in class it.unimi.dsi.sux4j.io.FileLinesList.FileLinesIterator

previousIndex() - Method in class it.unimi.dsi.sux4j.io.FileLinesList.FileLinesIterator

R

rank(long, long) - Method in class it.unimi.dsi.sux4j.bits.AbstractRank

Rank - Interface in it.unimi.dsi.sux4j.bits

A data structure providing ranking over a bit array.

rank(long) - Method in interface it.unimi.dsi.sux4j.bits.Rank

Returns the number of ones preceding the specified position.

rank(long, long) - Method in interface it.unimi.dsi.sux4j.bits.Rank

Returns the number of ones in the specified interval.

rank(long) - Method in class it.unimi.dsi.sux4j.bits.Rank16

rank(long, long) - Method in class it.unimi.dsi.sux4j.bits.Rank16

rank(long) - Method in class it.unimi.dsi.sux4j.bits.Rank9

rank(long, long) - Method in class it.unimi.dsi.sux4j.bits.Rank9

rank - Variable in class it.unimi.dsi.sux4j.bits.RankSelect

A rank structure, or null.

rank(long, long) - Method in class it.unimi.dsi.sux4j.bits.RankSelect

rank(long) - Method in class it.unimi.dsi.sux4j.bits.RankSelect

rank(long) - Method in class it.unimi.dsi.sux4j.bits.SparseRank

rank(long) - Method in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

rank - Variable in class it.unimi.dsi.sux4j.mph.MWHCFunction

The ranking structure on MWHCFunction.marker.

Rank16 - Class in it.unimi.dsi.sux4j.bits

A rank16 implementation.

Rank16(long[], long) - Constructor for class it.unimi.dsi.sux4j.bits.Rank16

Rank16(BitVector) - Constructor for class it.unimi.dsi.sux4j.bits.Rank16

Rank9 - Class in it.unimi.dsi.sux4j.bits

A rank9 implementation.

Rank9(long[], long) - Constructor for class it.unimi.dsi.sux4j.bits.Rank9

Rank9(BitVector) - Constructor for class it.unimi.dsi.sux4j.bits.Rank9

RankSelect - Class in it.unimi.dsi.sux4j.bits

A serialisation-oriented container for associated rank/select(zero) structures.

RankSelect(Rank, Select, SelectZero) - Constructor for class it.unimi.dsi.sux4j.bits.RankSelect

Creates a new rank/select container using the given structures.

RankSelect(Rank, Select) - Constructor for class it.unimi.dsi.sux4j.bits.RankSelect

Creates a new rank/select container without zero selection using the given structures.

rankZero(long) - Method in class it.unimi.dsi.sux4j.bits.AbstractRank

rankZero(long, long) - Method in class it.unimi.dsi.sux4j.bits.AbstractRank

rankZero(long) - Method in interface it.unimi.dsi.sux4j.bits.Rank

Returns the number of zeroes preceding the specified position.

rankZero(long, long) - Method in interface it.unimi.dsi.sux4j.bits.Rank

Returns the number of zeroes in the specified interval.

rankZero(long, long) - Method in class it.unimi.dsi.sux4j.bits.RankSelect

rankZero(long) - Method in class it.unimi.dsi.sux4j.bits.RankSelect

RelativeTrieDistributor<T> - Class in it.unimi.dsi.sux4j.mph

A distributor based on a relative trie.

RelativeTrieDistributor(Iterable<? extends T>, int, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.RelativeTrieDistributor

Creates a partial compacted trie using given elements, bucket size and transformation strategy.

RelativeTrieDistributor(Iterable<? extends T>, int, TransformationStrategy<? super T>, File) - Constructor for class it.unimi.dsi.sux4j.mph.RelativeTrieDistributor

Creates a partial compacted trie using given elements, bucket size, transformation strategy, and temporary directory.

RelativeTrieMonotoneMinimalPerfectHashFunction<T> - Class in it.unimi.dsi.sux4j.mph

A monotone minimal perfect hash implementation based on fixed-size bucketing that uses a relative trie as a distributor.

RelativeTrieMonotoneMinimalPerfectHashFunction(Iterable<? extends T>, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.RelativeTrieMonotoneMinimalPerfectHashFunction

Creates a new hollow-trie-based monotone minimal perfect hash function using the given elements and transformation strategy.

RelativeTrieMonotoneMinimalPerfectHashFunction(Iterable<? extends T>, TransformationStrategy<? super T>, int) - Constructor for class it.unimi.dsi.sux4j.mph.RelativeTrieMonotoneMinimalPerfectHashFunction

Creates a new hollow-trie-based monotone minimal perfect hash function using the given elements, transformation strategy and bucket size.

remap - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

A mapping from values of the first function to actual values, provided that there is a first function.

S

secondFunction - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

The second function.

seed - Variable in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

The seed of the underlying 3-hypergraph.

seed - Variable in class it.unimi.dsi.sux4j.mph.MWHCFunction

The seed of the underlying 3-hypergraph.

select(long) - Method in class it.unimi.dsi.sux4j.bits.HintedBsearchSelect

select - Variable in class it.unimi.dsi.sux4j.bits.RankSelect

A select structure, or null.

select(long) - Method in class it.unimi.dsi.sux4j.bits.RankSelect

Select - Interface in it.unimi.dsi.sux4j.bits

A data structure providing selection over a bit array.

select(long) - Method in interface it.unimi.dsi.sux4j.bits.Select

Returns the position of the bit of given rank.

select(long) - Method in class it.unimi.dsi.sux4j.bits.Select9

select(long) - Method in class it.unimi.dsi.sux4j.bits.SimpleSelect

select(long) - Method in class it.unimi.dsi.sux4j.bits.SparseSelect

Select9 - Class in it.unimi.dsi.sux4j.bits

A select9 implementation.

Select9(Rank9) - Constructor for class it.unimi.dsi.sux4j.bits.Select9

selectUpper - Variable in class it.unimi.dsi.sux4j.util.EliasFanoMonotoneLongBigList

The select structure used to extract the upper bits.

selectZero - Variable in class it.unimi.dsi.sux4j.bits.RankSelect

A zero-select structure, or null.

selectZero(long) - Method in class it.unimi.dsi.sux4j.bits.RankSelect

SelectZero - Interface in it.unimi.dsi.sux4j.bits

A data structure providing zero selection over a bit array.

selectZero(long) - Method in interface it.unimi.dsi.sux4j.bits.SelectZero

Returns the position of the bit of given rank.

selectZero(long) - Method in class it.unimi.dsi.sux4j.bits.SimpleSelectZero

selectZeroUpper - Variable in class it.unimi.dsi.sux4j.bits.SparseRank

The rank structure used to extract the upper bits.

serialVersionUID - Static variable in class it.unimi.dsi.sux4j.mph.AbstractHashFunction

serialVersionUID - Static variable in class it.unimi.dsi.sux4j.mph.HollowTrieMonotoneMinimalPerfectHashFunction

serialVersionUID - Static variable in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

serialVersionUID - Static variable in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

serialVersionUID - Static variable in class it.unimi.dsi.sux4j.mph.MWHCFunction

serialVersionUID - Static variable in class it.unimi.dsi.sux4j.mph.PaCoTrieMonotoneMinimalPerfectHashFunction

serialVersionUID - Static variable in class it.unimi.dsi.sux4j.mph.RelativeTrieMonotoneMinimalPerfectHashFunction

serialVersionUID - Static variable in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

serialVersionUID - Static variable in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

shift - Variable in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated. The left shift to get only ShiftAddXorSignedStringMap.width nonzero bits.

ShiftAddXorSignedStringMap - Class in it.unimi.dsi.sux4j.util

Deprecated. Moved to the DSI utilities.

ShiftAddXorSignedStringMap(Iterator<? extends CharSequence>, Object2LongFunction<CharSequence>) - Constructor for class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated. Creates a new shift-add-xor signed string map using a given hash map and 32-bit signatures.

ShiftAddXorSignedStringMap(Iterator<? extends CharSequence>, Object2LongFunction<CharSequence>, int) - Constructor for class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated. Creates a new shift-add-xor signed string map using a given hash map.

signatures - Variable in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated. Signatures.

SimpleSelect - Class in it.unimi.dsi.sux4j.bits

A simple select implementation based on a two-level inventory and broadword bit search.

SimpleSelect(long[], long) - Constructor for class it.unimi.dsi.sux4j.bits.SimpleSelect

SimpleSelect(BitVector) - Constructor for class it.unimi.dsi.sux4j.bits.SimpleSelect

SimpleSelectZero - Class in it.unimi.dsi.sux4j.bits

A simple zero-select implementation based on a two-level inventory and broadword bit search.

SimpleSelectZero(long[], long) - Constructor for class it.unimi.dsi.sux4j.bits.SimpleSelectZero

SimpleSelectZero(BitVector) - Constructor for class it.unimi.dsi.sux4j.bits.SimpleSelectZero

size() - Method in class it.unimi.dsi.sux4j.io.FileLinesList

size() - Method in class it.unimi.dsi.sux4j.mph.AbstractHashFunction

size() - Method in class it.unimi.dsi.sux4j.mph.BitstreamImmutablePaCoTrie

size() - Method in class it.unimi.dsi.sux4j.mph.HollowTrie

size() - Method in class it.unimi.dsi.sux4j.mph.HollowTrieDistributor

size() - Method in class it.unimi.dsi.sux4j.mph.HollowTrieMonotoneMinimalPerfectHashFunction

size() - Method in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

Returns the number of terms hashed.

size() - Method in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

size() - Method in class it.unimi.dsi.sux4j.mph.MWHCFunction

Returns the number of elements in the function domain.

size() - Method in class it.unimi.dsi.sux4j.mph.PaCoTrieMonotoneMinimalPerfectHashFunction

size() - Method in class it.unimi.dsi.sux4j.mph.RelativeTrieDistributor

size() - Method in class it.unimi.dsi.sux4j.mph.RelativeTrieMonotoneMinimalPerfectHashFunction

size() - Method in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

Returns the number of terms hashed.

size() - Method in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

Returns the number of elements in the function domain.

size() - Method in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated.

SparseRank - Class in it.unimi.dsi.sux4j.bits

A rank implementation for sparse bit arrays based on the Elias–Fano representation of monotone functions.

SparseRank(long[], long) - Constructor for class it.unimi.dsi.sux4j.bits.SparseRank

Creates a new rank structure using a long array.

SparseRank(BitVector) - Constructor for class it.unimi.dsi.sux4j.bits.SparseRank

Creates a new rank structure using a bit vector.

SparseRank(long, long, LongIterator) - Constructor for class it.unimi.dsi.sux4j.bits.SparseRank

Creates a new rank structure using an iterator.

SparseRank(long, long, int, LongBigList, BitVector) - Constructor for class it.unimi.dsi.sux4j.bits.SparseRank

SparseSelect - Class in it.unimi.dsi.sux4j.bits

A select implementation for sparse bit arrays based on the Elias–Fano representation of monotone functions.

SparseSelect(long[], long) - Constructor for class it.unimi.dsi.sux4j.bits.SparseSelect

Creates a new select structure using a long array.

SparseSelect(BitVector) - Constructor for class it.unimi.dsi.sux4j.bits.SparseSelect

Creates a new select structure using a bit vector.

SparseSelect(long, long, LongIterator) - Constructor for class it.unimi.dsi.sux4j.bits.SparseSelect

Creates a new select structure using an iterator.

SparseSelect(long, long, int, LongBigList, SimpleSelect) - Constructor for class it.unimi.dsi.sux4j.bits.SparseSelect

stack - Variable in class it.unimi.dsi.sux4j.mph.HypergraphSorter

The hyperedge stack.

superCount - Variable in class it.unimi.dsi.sux4j.bits.Rank16

T

toString() - Method in class it.unimi.dsi.sux4j.io.FileLinesList

transform - Variable in class it.unimi.dsi.sux4j.mph.LcpMonotoneMinimalPerfectHashFunction

The transformation strategy.

transform - Variable in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

The transformation strategy.

transform - Variable in class it.unimi.dsi.sux4j.mph.MWHCFunction

The transformation strategy to turn objects of type T into bit vectors.

transform - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

The transformation strategy.

transform - Variable in class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

The transformation strategy to turn objects of type T into bit vectors.

TwoSizesLongBigList - Class in it.unimi.dsi.sux4j.util

A compressed big list of longs; small elements and large elements are stored separately, using two different, optimally chosen bit sizes.

TwoSizesLongBigList(IntIterable) - Constructor for class it.unimi.dsi.sux4j.util.TwoSizesLongBigList

Builds a new two-sizes long big list using a given iterable object.

TwoSizesLongBigList(ShortIterable) - Constructor for class it.unimi.dsi.sux4j.util.TwoSizesLongBigList

Builds a new two-sizes long big list using a given iterable object.

TwoSizesLongBigList(ByteIterable) - Constructor for class it.unimi.dsi.sux4j.util.TwoSizesLongBigList

Builds a new two-sizes long big list using a given iterable object.

TwoSizesLongBigList(LongIterable) - Constructor for class it.unimi.dsi.sux4j.util.TwoSizesLongBigList

Builds a new two-sizes long big list using a given iterable object.

TwoStepsLcpMonotoneMinimalPerfectHashFunction<T> - Class in it.unimi.dsi.sux4j.mph

A monotone minimal perfect hash implementation based on fixed-size bucketing that uses longest common prefixes as distributors, and store their lengths using a TwoStepsMWHCFunction.

TwoStepsLcpMonotoneMinimalPerfectHashFunction(Iterable<? extends T>, TransformationStrategy<? super T>) - Constructor for class it.unimi.dsi.sux4j.mph.TwoStepsLcpMonotoneMinimalPerfectHashFunction

TwoStepsMWHCFunction<T> - Class in it.unimi.dsi.sux4j.mph

A read-only function stored using two Majewski-Wormald-Havas-Czech functions—one for frequent values, and one for infrequent values.

TwoStepsMWHCFunction(Iterable<? extends T>, TransformationStrategy<? super T>, LongList) - Constructor for class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

Creates a new two-step function for the given elements and values.

TwoStepsMWHCFunction(TwoStepsMWHCFunction<T>) - Constructor for class it.unimi.dsi.sux4j.mph.TwoStepsMWHCFunction

Creates a new function by copying a given one; non-transient fields are (shallow) copied.

U

upperBits - Variable in class it.unimi.dsi.sux4j.bits.SparseRank

The upper bits.

V

values - Variable in class it.unimi.dsi.sux4j.mph.MinimalPerfectHashFunction

The final magick—the list of modulo-3 values that define the output of the minimal hash function.

W

width - Variable in class it.unimi.dsi.sux4j.mph.MWHCFunction

The data width.

width - Variable in class it.unimi.dsi.sux4j.util.ShiftAddXorSignedStringMap

Deprecated. The width in bits of each signature.

A B C D E F G H I J L M N O P R S T U V W