Package | Description |
---|---|
org.apache.lucene.util.bkd |
Block KD-tree, implementing the generic spatial data structure described in
this paper.
|
Modifier and Type | Method and Description |
---|---|
private BKDWriter.PathSlice |
BKDWriter.switchToHeap(BKDWriter.PathSlice source,
java.util.List<java.io.Closeable> toCloseHeroically)
Pull a partition back into heap once the point count is low enough while recursing.
|
Modifier and Type | Method and Description |
---|---|
private void |
BKDWriter.build(int nodeID,
int leafNodeOffset,
BKDWriter.PathSlice[] slices,
LongBitSet ordBitSet,
IndexOutput out,
byte[] minPackedValue,
byte[] maxPackedValue,
int[] parentSplits,
byte[] splitPackedValues,
long[] leafBlockFPs,
java.util.List<java.io.Closeable> toCloseHeroically)
The array (sized numDims) of PathSlice describe the cell we have currently recursed to.
|
private byte[] |
BKDWriter.markRightTree(long rightCount,
int splitDim,
BKDWriter.PathSlice source,
LongBitSet ordBitSet)
Marks bits for the ords (points) that belong in the right sub tree (those docs that have values >= the splitValue).
|
private BKDWriter.PathSlice |
BKDWriter.switchToHeap(BKDWriter.PathSlice source,
java.util.List<java.io.Closeable> toCloseHeroically)
Pull a partition back into heap once the point count is low enough while recursing.
|