java.lang.Object
org.elasticsearch.tdigest.TDigest
org.elasticsearch.tdigest.AbstractTDigest
org.elasticsearch.tdigest.AVLTreeDigest
- All Implemented Interfaces:
Closeable,AutoCloseable,org.apache.lucene.util.Accountable,Releasable
-
Field Summary
Fields inherited from interface org.apache.lucene.util.Accountable
NULL_ACCOUNTABLE -
Method Summary
Modifier and TypeMethodDescriptionvoidadd(double x, long w) Adds a sample to a histogram.intbyteSize()Returns an upper bound on the number bytes that will be required to represent this histogram.doublecdf(double x) Returns the fraction of all points added which are ≤ x.intACollectionthat lets you go through the centroids in ascending order by mean.voidclose()voidcompress()Re-examines a t-digest to determine whether some centroids are redundant.doubleReturns the current compression factor.doublequantile(double q) Returns an estimate of a cutoff such that a specified fraction of the data added to this TDigest would be less than or equal to the cutoff.longvoidsetRandomSeed(long seed) Sets the seed for the RNG.longsize()Returns the number of samples represented in this histogram.Methods inherited from class org.elasticsearch.tdigest.AbstractTDigest
addMethods inherited from class org.elasticsearch.tdigest.TDigest
add, createAvlTreeDigest, createHybridDigest, createMergingDigest, createSortingDigest, getMax, getMin, reserve, setScaleFunctionMethods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface org.apache.lucene.util.Accountable
getChildResources
-
Method Details
-
ramBytesUsed
public long ramBytesUsed() -
setRandomSeed
public void setRandomSeed(long seed) Sets the seed for the RNG. In cases where a predictable tree should be created, this function may be used to make the randomness in this AVLTree become more deterministic.- Parameters:
seed- The random seed to use for RNG purposes
-
centroidCount
public int centroidCount()- Specified by:
centroidCountin classTDigest
-
add
public void add(double x, long w) Description copied from class:TDigestAdds a sample to a histogram. -
compress
public void compress()Description copied from class:TDigestRe-examines a t-digest to determine whether some centroids are redundant. If your data are perversely ordered, this may be a good idea. Even if not, this may save 20% or so in space. The cost is roughly the same as adding as many data points as there are centroids. This is typically < 10 * compression, but could be as high as 100 * compression. This is a destructive operation that is not thread-safe. -
size
public long size()Returns the number of samples represented in this histogram. If you want to know how many centroids are being used, try centroids().size(). -
cdf
public double cdf(double x) Description copied from class:TDigestReturns the fraction of all points added which are ≤ x. Points that are exactly equal get half credit (i.e. we use the mid-point rule) -
quantile
public double quantile(double q) Description copied from class:TDigestReturns an estimate of a cutoff such that a specified fraction of the data added to this TDigest would be less than or equal to the cutoff. -
centroids
Description copied from class:TDigestACollectionthat lets you go through the centroids in ascending order by mean. Centroids returned will not be re-used, but may or may not share storage with this TDigest. -
compression
public double compression()Description copied from class:TDigestReturns the current compression factor.- Specified by:
compressionin classTDigest- Returns:
- The compression factor originally used to set up the TDigest.
-
byteSize
public int byteSize()Returns an upper bound on the number bytes that will be required to represent this histogram. -
close
public void close()
-