Uses of Interface
org.apache.lucene.util.bkd.BKDWriter.BKDTreeLeafNodes
Packages that use BKDWriter.BKDTreeLeafNodes
Package
Description
Block KD-tree, implementing the generic spatial data structure described in this paper.
-
Uses of BKDWriter.BKDTreeLeafNodes in org.apache.lucene.util.bkd
Methods in org.apache.lucene.util.bkd with parameters of type BKDWriter.BKDTreeLeafNodesModifier and TypeMethodDescriptionprivate byte[]
BKDWriter.packIndex
(BKDWriter.BKDTreeLeafNodes leafNodes) Packs the two arrays, representing a semi-balanced binary tree, into a compact byte[] structure.private int
BKDWriter.recursePackIndex
(ByteBuffersDataOutput writeBuffer, BKDWriter.BKDTreeLeafNodes leafNodes, long minBlockFP, List<byte[]> blocks, byte[] lastSplitValues, boolean[] negativeDeltas, boolean isLeft, int leavesOffset, int numLeaves) lastSplitValues is per-dimension split value previously seen; we use this to prefix-code the split byte[] on each inner nodeprivate void
BKDWriter.writeIndex
(IndexOutput metaOut, IndexOutput indexOut, int countPerLeaf, BKDWriter.BKDTreeLeafNodes leafNodes, long dataStartFP)