Package org.apache.lucene.util.bkd
package org.apache.lucene.util.bkd
Block KD-tree, implementing the generic spatial data structure described in
this paper.
-
ClassDescriptionBasic parameters for indexing points on the BKD tree.Offline Radix selector for BKD tree.Sliced reference to points in an PointWriter.Handles intersection of an multi-dimensional shape in byte[] space with a block KD-tree previously written with
BKDWriter.ReusableDocIdSetIteratorto handle low cardinality leaves.Used to track all state for a single call toBKDReader.intersect(org.apache.lucene.index.PointValues.IntersectVisitor).Recursively builds a block KD-tree to assign all incoming points in N-dim space to smaller and smaller N-dim rectangles (cells) until the number of points in a given rectangle is <=config.maxPointsInLeafNode.flat representation of a kd-treeUtility class to read buffered points from in-heap arrays.Reusable implementation for a point value on-heapUtility class to write new points into in-heap arrays.Utility APIs for sorting and partitioning buffered points.Reads points from disk in a fixed-with format, previously written withOfflinePointWriter.Reusable implementation for a point value offlineWrites points to disk in a fixed-with format.One pass iterator through all points previously written with aPointWriter, abstracting away whether points are read from (offline) disk or simple arrays in heap.Represents a dimensional point value written in the BKD tree.Appends many points, and then at the end provides aPointReaderto iterate those points.