Object2ObjectFunction<K,V> rangeMap
AbstractObject2ObjectFunction<K,V> prefixMap
ObjectBigList<K> list
ImmutableBinaryTrie.Node root
int size
TransformationStrategy<T> transformationStrategy
ImmutableBinaryTrie.Node left
ImmutableBinaryTrie.Node right
long[] path
null
if there is no compaction at this node).int pathLength
long word
word
-th word.private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
private void writeObject(ObjectOutputStream s) throws IOException
IOException
ImmutableBinaryTrie<T> intervalApproximator
long blockSize
Decoder decoder
char[] symbol2char
Char2IntOpenHashMap char2symbol
int size
long[][] blockStart
ImmutableExternalPrefixMap.size
.long[][] blockOffset
ImmutableExternalPrefixMap.blockStart
giving the offset in blocks in the dump file
of the corresponding word in ImmutableExternalPrefixMap.blockStart
. If there are no overflows, this will just
be an initial segment of the natural numbers, but overflows cause jumps.boolean selfContained
long dumpStreamLength
Object2LongFunction<K> function
ObjectBigList<K> list
long size
LiterallySignedStringMap.list
.Object2LongFunction<K> function
LongBigList signatures
Object2LongFunction<K> function
LongBigList signatures
int width
int shift
ShiftAddXorSignedStringMap.width
nonzero bits.long mask
ShiftAddXorSignedStringMap.width
nonzero bits.Object2ObjectFunction<K,V> rangeMap
StringMap<S extends CharSequence> stringMap
PrefixMap<S extends CharSequence> map
Object2ObjectFunction<K,V> prefixMap
Object2ObjectFunction<K,V> rangeMap
StringMap<S extends CharSequence> stringMap
ObjectBigList<K> list
it.unimi.dsi.big.util.TernaryIntervalSearchTree.Node root
int size
boolean modified
TernaryIntervalSearchTree.add(CharSequence)
modified the tree.BitVector bitVector
int width
long fullMask
AbstractBitVector.LongBigListView.width
bits set to one.BitVector bitVector
long from
long to
BooleanBigList list
private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
private void writeObject(ObjectOutputStream s) throws IOException
IOException
long length
LongArrayBitVector bitVector
BitVector[] codeWord
Char2IntOpenHashMap char2symbol
boolean prefixFree
long[] lastCodeWordPlusOne
int[] lengthIncrement
CanonicalFast64CodeWordDecoder.lastCodeWordPlusOne
specifying the increment in length between codeword lengths
(without repetitions). In particular, the first entry
is the length of the first block of same-length codewords, the second entry is the difference in length
between the second and the first block of same-length codewords, and so on.int[] howManyUpToBlock
CanonicalFast64CodeWordDecoder.lastCodeWordPlusOne
specifying how many codewords we have up to a certain block (included).int[] symbol
BitVector[] codeWord
long[] longCodeWord
CodeWordCoder.codeWord
containing the codewords as longs (right aligned).int[] length
Fast64CodeWordCoder.longCodeWord
, of codewords length.int size
BitVector[] codeWord
Fast64CodeWordCoder coder
CanonicalFast64CodeWordDecoder decoder
int size
TreeDecoder.Node root
CodeWordCoder coder
TreeDecoder decoder
TreeDecoder.Node root
int n
TreeDecoder.Node left
TreeDecoder.Node right
CharOpenHashSet delimiters
private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
int bufferSize
buffer.length
).CharSet wordConstituents
Character.isLetterOrDigit(int)
.FastBufferedReader fastBufferedReader
private Object readResolve()
private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
Mutable strings produced by this method are always compact; this seems reasonable, as stored strings are unlikely going to be changed.
Because of limitations of ObjectInputStream
, this method must
read one character at a time, and does not try to do any read-ahead (in
particular, it does not create any object). On non-buffered data inputs
it might be very slow.
IOException
ClassNotFoundException
private void writeObject(ObjectOutputStream s) throws IOException
The serialised version of a mutable string is made of its length followed by its characters (in UTF-16 format). Note that the compactness state is forgotten.
Because of limitations of ObjectOutputStream
, this method must
write one character at a time, and does not try to do any caching (in
particular, it does not create any object). On non-buffered data outputs
it might be very slow.
IOException
Object2ObjectFunction<K,V> rangeMap
Object2ObjectFunction<K,V> prefixMap
ObjectList<K> list
long m
int d
long[] bits
HashFunction hashFunction
long size
Funnel<T> funnel
ByteArrayFrontCodedList byteFrontCodedList
ByteArrayFrontCodedList
, or null
.CharArrayFrontCodedList charFrontCodedList
CharArrayFrontCodedList
, or null
.boolean utf8
LongArrayBitVector[] bitVector
LongBigList[] registers
int log2m
int m
int mMinus1
int registerSize
int counterSize
HyperLogLogCounterArray.registerSize
*
HyperLogLogCounterArray.m
).int counterShift
long seed
double alphaMM
HyperLogLogCounterArray.m
2 (see the paper).long sentinelMask
Fast.leastSignificantBit(long)
does not return too large a value.ImmutableBinaryTrie.Node root
int size
TransformationStrategy<T> transformationStrategy
ImmutableBinaryTrie.Node left
ImmutableBinaryTrie.Node right
long[] path
null
if there is no compaction at this node).int pathLength
int word
word
-th word.private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
private void writeObject(ObjectOutputStream s) throws IOException
IOException
ImmutableBinaryTrie<T> intervalApproximator
long blockSize
Decoder decoder
char[] symbol2char
Char2IntOpenHashMap char2symbol
int size
int[] blockStart
ImmutableExternalPrefixMap.size
.int[] blockOffset
ImmutableExternalPrefixMap.blockStart
giving the offset in blocks in the dump file
of the corresponding word in ImmutableExternalPrefixMap.blockStart
. If there are no overflows, this will just
be an initial segment of the natural numbers, but overflows cause jumps.boolean selfContained
long dumpStreamLength
LongArrayBitVector[] bitVector
LongBigList[] registers
int log2m
int m
int mMinus1
int registerSize
int counterSize
IntHyperLogLogCounterArray.registerSize
*
IntHyperLogLogCounterArray.m
).int counterShift
long seed
double alphaMM
IntHyperLogLogCounterArray.m
2 (see the paper).long sentinelMask
Fast.leastSignificantBit(long)
does not return too large a value.Object2LongFunction<K> function
ObjectList<K> list
int size
LiterallySignedStringMap.list
.FrontCodedStringList frontCodedStringList
int[] permutation
private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
IOException
ClassNotFoundException
private void writeObject(ObjectOutputStream s) throws IOException
IOException
Object2LongFunction<K> function
LongBigList signatures
int width
int shift
ShiftAddXorSignedStringMap.width
nonzero bits.long mask
ShiftAddXorSignedStringMap.width
nonzero bits.PrefixMap<S extends CharSequence> map
Object2ObjectFunction<K,V> prefixMap
Object2ObjectFunction<K,V> rangeMap
StringMap<S extends CharSequence> stringMap
ObjectList<K> list
it.unimi.dsi.util.TernaryIntervalSearchTree.Node root
int size
boolean modified
TernaryIntervalSearchTree.add(CharSequence)
modified the tree.