All Classes and Interfaces
Class
Description
A tree of t-digest centroids.
A single centroid which represents a number of data points.
Maintains histogram buckets that are constant width
in base-2 floating point representation space.
Abstract class that describes how a Histogram should work.
An AVL-tree structure stored in parallel arrays.
A stack of int values.
Maintains a t-digest by collecting new points in a buffer that is then sorted occasionally and merged
into a sorted array that contains previously computed centroids.
Very simple variable byte encoding that always uses 64bit units.
Static sorting methods
Adaptive histogram based on something like streaming k-means crossed with Q-digest.