All Classes and Interfaces
Class
Description
A single centroid which represents a number of data points.
Reference implementations for cdf and quantile if we have all data sorted.
Uses a
SortingDigest implementation under the covers for small sample populations, then switches to MergingDigest.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.
Encodes the various scale functions for t-digests.
Static sorting methods
Simple implementation of the TDigest interface that stores internally and sorts all samples to calculate quantiles and CDFs.
Adaptive histogram based on something like streaming k-means crossed with Q-digest.