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 HeapPointWriter |
BKDWriter.switchToHeap(PointWriter source)
Pull a partition back into heap once the point count is low enough while recursing.
|
Modifier and Type | Method and Description |
---|---|
private void |
BKDWriter.computeCommonPrefixLength(HeapPointWriter heapPointWriter,
byte[] commonPrefix,
int from,
int to) |
private byte[] |
BKDRadixSelector.heapPartition(HeapPointWriter points,
PointWriter left,
PointWriter right,
int dim,
int from,
int to,
int partitionPoint,
int commonPrefix) |
private byte[] |
BKDRadixSelector.heapRadixSelect(HeapPointWriter points,
int dim,
int from,
int to,
int partitionPoint,
int commonPrefix) |
void |
BKDRadixSelector.heapRadixSort(HeapPointWriter points,
int from,
int to,
int dim,
int commonPrefixLength)
Sort the heap writer by the specified dim.
|