ObjectBigList<MutableString> list
AbstractObject2ObjectFunction<LongInterval,MutableString> prefixMap
Object2ObjectFunction<java.lang.CharSequence,LongInterval> rangeMap
ImmutableBinaryTrie.Node root
int size
TransformationStrategy<? super T> transformationStrategy
ImmutableBinaryTrie.Node left
long[] path
null
if there is no compaction at this node).int pathLength
ImmutableBinaryTrie.Node right
long word
word
-th word.private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
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.long blockSize
long[][] blockStart
Function.size()
.Char2IntOpenHashMap char2symbol
Decoder decoder
long dumpStreamLength
ImmutableBinaryTrie<java.lang.CharSequence> intervalApproximator
boolean selfContained
long size
char[] symbol2char
Object2LongFunction<? extends java.lang.CharSequence> function
ObjectBigList<? extends MutableString> list
long size
LiterallySignedStringMap.list
.Object2LongFunction<? extends java.lang.CharSequence> function
LongBigList signatures
Object2LongFunction<? extends java.lang.CharSequence> function
long mask
ShiftAddXorSignedStringMap.width
nonzero bits.int shift
ShiftAddXorSignedStringMap.width
nonzero bits.LongBigList signatures
int width
Object2ObjectFunction<java.lang.CharSequence,LongInterval> rangeMap
PrefixMap<S extends java.lang.CharSequence> map
Object2ObjectFunction<LongInterval,S extends java.lang.CharSequence> prefixMap
Object2ObjectFunction<java.lang.CharSequence,LongInterval> rangeMap
ObjectBigList<? extends S extends java.lang.CharSequence> list
StringMap<S extends java.lang.CharSequence> stringMap
boolean modified
TernaryIntervalSearchTree.add(CharSequence)
modified the tree.it.unimi.dsi.big.util.TernaryIntervalSearchTree.Node root
int size
BitVector bitVector
long fullMask
AbstractBitVector.LongBigListView.width
bits set to one.int width
BitVector bitVector
long from
long to
BooleanBigList list
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
long length
LongArrayBitVector bitVector
Char2IntOpenHashMap char2symbol
BitVector[] codeWord
boolean prefixFree
int[] howManyUpToBlock
CanonicalFast64CodeWordDecoder.lastCodeWordPlusOne
specifying how many codewords we have up to a certain block (included).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[] symbol
BitVector[] codeWord
int[] length
Fast64CodeWordCoder.longCodeWord
, of codewords length.long[] longCodeWord
CodeWordCoder.codeWord
containing the codewords as longs (right aligned).Fast64CodeWordCoder coder
BitVector[] codeWord
CanonicalFast64CodeWordDecoder decoder
int size
CodeWordCoder coder
TreeDecoder decoder
TreeDecoder.Node root
int size
int n
TreeDecoder.Node root
int symbol
TreeDecoder.Node left
TreeDecoder.Node right
CharOpenHashSet delimiters
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
int bufferSize
buffer.length
).CharSet wordConstituents
Character.isLetterOrDigit(int)
.FastBufferedReader fastBufferedReader
private java.lang.Object readResolve()
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.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.
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.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.
java.io.IOException
ObjectList<MutableString> list
Object2ObjectFunction<Interval,MutableString> prefixMap
Object2ObjectFunction<java.lang.CharSequence,Interval> rangeMap
long[] bits
int d
com.google.common.hash.Funnel<T> funnel
com.google.common.hash.HashFunction hashFunction
long m
long size
ByteArrayFrontCodedList byteFrontCodedList
ByteArrayFrontCodedList
, or null
.CharArrayFrontCodedList charFrontCodedList
CharArrayFrontCodedList
, or null
.boolean utf8
double alphaMM
HyperLogLogCounterArray.m
2 (see the paper).long[][] bits
int counterLongwords
Long.SIZE
registers per counter).long counterResidualMask
HyperLogLogCounterArray.counterSize
%
Long.SIZE
lowest bits).int counterShift
int counterSize
HyperLogLogCounterArray.registerSize
*
HyperLogLogCounterArray.m
).int log2m
boolean longwordAligned
long[] lsbMask
registerSize * i
).int m
int mMinus1
long[] msbMask
registerSize * (i + 1) - 1
).LongBigList[] registers
int registerSize
long seed
long sentinelMask
Long.numberOfTrailingZeros(long)
does not return too large a value.ImmutableBinaryTrie.Node root
int size
TransformationStrategy<? super T> transformationStrategy
ImmutableBinaryTrie.Node left
long[] path
null
if there is no compaction at this node).int pathLength
ImmutableBinaryTrie.Node right
int word
word
-th word.private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
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.long blockSize
int[] blockStart
ImmutableExternalPrefixMap.size
.Char2IntOpenHashMap char2symbol
Decoder decoder
long dumpStreamLength
ImmutableBinaryTrie<java.lang.CharSequence> intervalApproximator
boolean selfContained
int size
char[] symbol2char
int left
int right
Object2LongFunction<? extends java.lang.CharSequence> function
ObjectList<? extends MutableString> list
int size
LiterallySignedStringMap.list
.long left
long right
FrontCodedStringList frontCodedStringList
int[] permutation
private void readObject(java.io.ObjectInputStream s) throws java.io.IOException, java.lang.ClassNotFoundException
java.io.IOException
java.lang.ClassNotFoundException
private void writeObject(java.io.ObjectOutputStream s) throws java.io.IOException
java.io.IOException
Object2LongFunction<? extends java.lang.CharSequence> function
long mask
ShiftAddXorSignedStringMap.width
nonzero bits.int shift
ShiftAddXorSignedStringMap.width
nonzero bits.LongBigList signatures
int width
long x
SplitMix64Random.PHI
as increment).long x
SplitMix64RandomGenerator.PHI
as increment).PrefixMap<S extends java.lang.CharSequence> map
Object2ObjectFunction<Interval,S extends java.lang.CharSequence> prefixMap
Object2ObjectFunction<java.lang.CharSequence,Interval> rangeMap
ObjectList<? extends S extends java.lang.CharSequence> list
StringMap<S extends java.lang.CharSequence> stringMap
boolean modified
TernaryIntervalSearchTree.add(CharSequence)
modified the tree.it.unimi.dsi.util.TernaryIntervalSearchTree.Node root
int size
boolean asciiCase
boolean caseSensitive
char[] pattern
long s0
long s1
long s0
long s1
long s0
long s1
long s0
long s1
int p
long[] s
int p
long[] s
int p
long[] s
int p
long[] s
long s0
long s1
long x
long s0
long s1
long s2
long s3
long s0
long s1
long s2
long s3
long s0
long s1
long s2
long s3
long s0
long s1
long s2
long s3