Package-level declarations

Basic parameters for indexing points on the BKD tree.

Offline Radix selector for BKD tree.

Handles reading a block KD-tree in byte[] space previously written with BKDWriter.

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. The tree is partially balanced, which means the leaf nodes will have the requested config.maxPointsInLeafNode except one that might have less. Leaf nodes may straddle the two bottom levels of the binary tree. Values that fall exactly on a cell boundary may be in either cell.

Utility class to read buffered points from in-heap arrays.

Utility 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 with [ ].

Writes points to disk in a fixed-with format.

One pass iterator through all points previously written with a PointWriter, 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 a PointReader to iterate those points. This abstracts away whether we write to disk, or use simple arrays in heap.