|
|||||||||
PREV NEXT | FRAMES NO FRAMES |
Rank
providing a few obvious derived methods.MinimalPerfectHashFunction.values
.
LcpMonotoneMinimalPerfectHashFunction.log2BucketSize
bits.
TwoStepsLcpMonotoneMinimalPerfectHashFunction.log2BucketSize
bits.
MinimalPerfectHashFunction.BITS_PER_BLOCK
bits.
TwoStepsMWHCFunction.firstFunction
to suggest that TwoStepsMWHCFunction.secondFunction
should be queried instead, provided that there is a first function.
FileLinesList
.null
.
SparseRank
structure sharing data with this instance.
SparseSelect
structure sharing data with this instance.
Fast.ceilLog2(int)
of LcpMonotoneMinimalPerfectHashFunction.bucketSize
.
Fast.ceilLog2(int)
of TwoStepsLcpMonotoneMinimalPerfectHashFunction.bucketSize
.
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
.
ShiftAddXorSignedStringMap.width
nonzero bits.
HypergraphSorter.GAMMA
* HypergraphSorter.numEdges
⌉ + 1 ).
LcpMonotoneMinimalPerfectHashFunction.log2BucketSize
bits) and
to the length of the longest common prefix of its bucket (remaining bits).
TwoStepsLcpMonotoneMinimalPerfectHashFunction.log2BucketSize
bits) and
to the length of the longest common prefix of its bucket (remaining bits).
null
.
MWHCFunction.marker
.
rank16
implementation.rank9
implementation.null
.
select9
implementation.null
.
ShiftAddXorSignedStringMap.width
nonzero bits.
T
into bit vectors.
T
into bit vectors.
TwoStepsMWHCFunction
.
|
|||||||||
PREV NEXT | FRAMES NO FRAMES |