public abstract class KllDoublesSketch extends KllSketch implements QuantilesDoublesAPI
KllSketchKllSketch.SketchTypeQuantilesDoublesAPI.DoublesPartitionBoundaries| Modifier and Type | Method and Description |
|---|---|
double[] |
getCDF(double[] splitPoints,
QuantileSearchCriteria searchCrit)
Returns an approximation to the Cumulative Distribution Function (CDF) of the input stream
as a monotonically increasing array of double ranks (or cumulative probabilities) on the interval [0.0, 1.0],
given a set of splitPoints.
|
double |
getMaxItem()
Returns the maximum item of the stream.
|
static int |
getMaxSerializedSizeBytes(int k,
long n,
boolean updatableMemoryFormat)
Returns upper bound on the serialized size of a KllDoublesSketch given the following parameters.
|
double |
getMinItem()
Returns the minimum item of the stream.
|
QuantilesDoublesAPI.DoublesPartitionBoundaries |
getPartitionBoundaries(int numEquallyWeighted,
QuantileSearchCriteria searchCrit)
This method returns an instance of
DoublesPartitionBoundaries which provides
sufficient information for the user to create the given number of equally weighted partitions. |
double[] |
getPMF(double[] splitPoints,
QuantileSearchCriteria searchCrit)
Returns an approximation to the Probability Mass Function (PMF) of the input stream
as an array of probability masses as doubles on the interval [0.0, 1.0],
given a set of splitPoints.
|
double |
getQuantile(double rank,
QuantileSearchCriteria searchCrit)
Gets the approximate quantile of the given normalized rank and the given search criterion.
|
double |
getQuantileLowerBound(double rank)
Gets the lower bound of the quantile confidence interval in which the quantile of the
given rank exists.
|
double[] |
getQuantiles(double[] ranks,
QuantileSearchCriteria searchCrit)
Gets an array of quantiles from the given array of normalized ranks.
|
double |
getQuantileUpperBound(double rank)
Gets the upper bound of the quantile confidence interval in which the true quantile of the
given rank exists.
|
double |
getRank(double quantile,
QuantileSearchCriteria searchCrit)
Gets the normalized rank corresponding to the given a quantile.
|
double |
getRankLowerBound(double rank)
Gets the lower bound of the rank confidence interval in which the true rank of the
given rank exists.
|
double[] |
getRanks(double[] quantiles,
QuantileSearchCriteria searchCrit)
Gets an array of normalized ranks corresponding to the given array of quantiles and the given
search criterion.
|
double |
getRankUpperBound(double rank)
Gets the upper bound of the rank confidence interval in which the true rank of the
given rank exists.
|
DoublesSortedView |
getSortedView()
Gets the sorted view of this sketch
|
static KllDoublesSketch |
heapify(org.apache.datasketches.memory.Memory srcMem)
Factory heapify takes a compact sketch image in Memory and instantiates an on-heap sketch.
|
QuantilesDoublesSketchIterator |
iterator()
Gets the iterator for this sketch, which is not sorted.
|
static KllDoublesSketch |
newDirectInstance(int k,
org.apache.datasketches.memory.WritableMemory dstMem,
org.apache.datasketches.memory.MemoryRequestServer memReqSvr)
Create a new direct instance of this sketch with a given k.
|
static KllDoublesSketch |
newDirectInstance(org.apache.datasketches.memory.WritableMemory dstMem,
org.apache.datasketches.memory.MemoryRequestServer memReqSvr)
Create a new direct instance of this sketch with the default k.
|
static KllDoublesSketch |
newHeapInstance()
Create a new heap instance of this sketch with the default k = 200.
|
static KllDoublesSketch |
newHeapInstance(int k)
Create a new heap instance of this sketch with a given parameter k.
|
void |
reset()
Resets this sketch to the empty state.
|
byte[] |
toByteArray()
Returns a byte array representation of this sketch.
|
void |
update(double item)
Updates this sketch with the given item.
|
static KllDoublesSketch |
wrap(org.apache.datasketches.memory.Memory srcMem)
Wrap a sketch around the given read only compact source Memory containing sketch data
that originated from this sketch.
|
static KllDoublesSketch |
writableWrap(org.apache.datasketches.memory.WritableMemory srcMem,
org.apache.datasketches.memory.MemoryRequestServer memReqSvr)
Wrap a sketch around the given source Writable Memory containing sketch data
that originated from this sketch.
|
getCurrentCompactSerializedSizeBytes, getCurrentUpdatableSerializedSizeBytes, getK, getKFromEpsilon, getMaxSerializedSizeBytes, getN, getNormalizedRankError, getNormalizedRankError, getNumRetained, getSerializedSizeBytes, hasMemory, isDirect, isEmpty, isEstimationMode, isMemoryUpdatableFormat, isReadOnly, isSameResource, merge, toString, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitgetCDF, getPartitionBoundaries, getPMF, getQuantile, getQuantiles, getRank, getRanks, getSerializedSizeBytesgetK, getN, getNumRetained, hasMemory, isDirect, isEmpty, isEstimationMode, isReadOnly, toStringpublic static KllDoublesSketch heapify(org.apache.datasketches.memory.Memory srcMem)
srcMem - a compact Memory image of a sketch serialized by this sketch.
See Memorypublic static KllDoublesSketch newDirectInstance(org.apache.datasketches.memory.WritableMemory dstMem, org.apache.datasketches.memory.MemoryRequestServer memReqSvr)
dstMem - the given destination WritableMemory object for use by the sketchmemReqSvr - the given MemoryRequestServer to request a larger WritableMemorypublic static KllDoublesSketch newDirectInstance(int k, org.apache.datasketches.memory.WritableMemory dstMem, org.apache.datasketches.memory.MemoryRequestServer memReqSvr)
k - parameter that controls size of the sketch and accuracy of estimates.dstMem - the given destination WritableMemory object for use by the sketchmemReqSvr - the given MemoryRequestServer to request a larger WritableMemorypublic static KllDoublesSketch newHeapInstance()
public static KllDoublesSketch newHeapInstance(int k)
k - parameter that controls size of the sketch and accuracy of estimates.public static KllDoublesSketch wrap(org.apache.datasketches.memory.Memory srcMem)
srcMem - the read only source Memorypublic static KllDoublesSketch writableWrap(org.apache.datasketches.memory.WritableMemory srcMem, org.apache.datasketches.memory.MemoryRequestServer memReqSvr)
srcMem - a WritableMemory that contains data.memReqSvr - the given MemoryRequestServer to request a larger WritableMemorypublic static int getMaxSerializedSizeBytes(int k,
long n,
boolean updatableMemoryFormat)
k - parameter that controls size of the sketch and accuracy of estimatesn - stream lengthupdatableMemoryFormat - true if updatable Memory format, otherwise the standard compact format.public double[] getCDF(double[] splitPoints,
QuantileSearchCriteria searchCrit)
QuantilesDoublesAPIThe resulting approximations have a probabilistic guarantee that can be obtained from the getNormalizedRankError(false) function.
getCDF in interface QuantilesDoublesAPIsplitPoints - an array of m unique, monotonically increasing items
(of the same type as the input items)
that divide the item input domain into m+1 overlapping intervals.
The start of each interval is below the lowest item retained by the sketch corresponding to a zero rank or zero probability, and the end of the interval is the rank or cumulative probability corresponding to the split point.
The (m+1)th interval represents 100% of the distribution represented by the sketch and consistent with the definition of a cumulative probability distribution, thus the (m+1)th rank or probability in the returned array is always 1.0.
If a split point exactly equals a retained item of the sketch and the search criterion is:
It is not recommended to include either the minimum or maximum items of the input stream.
searchCrit - the desired search criteria.public double getMaxItem()
QuantilesDoublesAPIgetMaxItem in interface QuantilesDoublesAPIpublic double getMinItem()
QuantilesDoublesAPIgetMinItem in interface QuantilesDoublesAPIpublic QuantilesDoublesAPI.DoublesPartitionBoundaries getPartitionBoundaries(int numEquallyWeighted, QuantileSearchCriteria searchCrit)
QuantilesDoublesAPIDoublesPartitionBoundaries which provides
sufficient information for the user to create the given number of equally weighted partitions.getPartitionBoundaries in interface QuantilesDoublesAPInumEquallyWeighted - an integer that specifies the number of equally weighted partitions between
getMinItem() and getMaxItem().
This must be a positive integer greater than zero.
searchCrit - If INCLUSIVE, all the returned quantiles are the upper boundaries of the equally weighted partitions
with the exception of the lowest returned quantile, which is the lowest boundary of the lowest ranked partition.
If EXCLUSIVE, all the returned quantiles are the lower boundaries of the equally weighted partitions
with the exception of the highest returned quantile, which is the upper boundary of the highest ranked partition.DoublesPartitionBoundaries.public double[] getPMF(double[] splitPoints,
QuantileSearchCriteria searchCrit)
QuantilesDoublesAPIThe resulting approximations have a probabilistic guarantee that can be obtained from the getNormalizedRankError(true) function.
getPMF in interface QuantilesDoublesAPIsplitPoints - an array of m unique, monotonically increasing items
(of the same type as the input items)
that divide the item input domain into m+1 consecutive, non-overlapping intervals.
Each interval except for the end intervals starts with a split point and ends with the next split point in sequence.
The first interval starts below the lowest item retained by the sketch corresponding to a zero rank or zero probability, and ends with the first split point
The last (m+1)th interval starts with the last split point and ends after the last item retained by the sketch corresponding to a rank or probability of 1.0.
The sum of the probability masses of all (m+1) intervals is 1.0.
If the search criterion is:
It is not recommended to include either the minimum or maximum items of the input stream.
searchCrit - the desired search criteria.public double getQuantile(double rank,
QuantileSearchCriteria searchCrit)
QuantilesDoublesAPIgetQuantile in interface QuantilesDoublesAPIrank - the given normalized rank, a double in the range [0.0, 1.0].searchCrit - If INCLUSIVE, the given rank includes all quantiles ≤
the quantile directly corresponding to the given rank.
If EXCLUSIVE, he given rank includes all quantiles <
the quantile directly corresponding to the given rank.QuantileSearchCriteriapublic double[] getQuantiles(double[] ranks,
QuantileSearchCriteria searchCrit)
QuantilesDoublesAPIgetQuantiles in interface QuantilesDoublesAPIranks - the given array of normalized ranks, each of which must be
in the interval [0.0,1.0].searchCrit - if INCLUSIVE, the given ranks include all quantiles ≤
the quantile directly corresponding to each rank.QuantileSearchCriteriapublic double getQuantileLowerBound(double rank)
Although it is possible to estimate the probability that the true quantile exists within the quantile confidence interval specified by the upper and lower quantile bounds, it is not possible to guarantee the width of the quantile confidence interval as an additive or multiplicative percent of the true quantile.
The approximate probability that the true quantile is within the confidence interval specified by the upper and lower quantile bounds for this sketch is 0.99.getQuantileLowerBound in interface QuantilesDoublesAPIrank - the given normalized rankpublic double getQuantileUpperBound(double rank)
Although it is possible to estimate the probability that the true quantile exists within the quantile confidence interval specified by the upper and lower quantile bounds, it is not possible to guarantee the width of the quantile interval as an additive or multiplicative percent of the true quantile.
The approximate probability that the true quantile is within the confidence interval specified by the upper and lower quantile bounds for this sketch is 0.99.getQuantileUpperBound in interface QuantilesDoublesAPIrank - the given normalized rankpublic double getRank(double quantile,
QuantileSearchCriteria searchCrit)
QuantilesDoublesAPIgetRank in interface QuantilesDoublesAPIquantile - the given quantilesearchCrit - if INCLUSIVE the given quantile is included into the rank.QuantileSearchCriteriapublic double getRankLowerBound(double rank)
getRankLowerBound in interface QuantilesAPIrank - the given normalized rank.public double getRankUpperBound(double rank)
getRankUpperBound in interface QuantilesAPIrank - the given normalized rank.public double[] getRanks(double[] quantiles,
QuantileSearchCriteria searchCrit)
QuantilesDoublesAPIgetRanks in interface QuantilesDoublesAPIquantiles - the given array of quantilessearchCrit - if INCLUSIVE, the given quantiles include the rank directly corresponding to each quantile.QuantileSearchCriteriapublic DoublesSortedView getSortedView()
QuantilesDoublesAPIgetSortedView in interface QuantilesDoublesAPIpublic QuantilesDoublesSketchIterator iterator()
QuantilesDoublesAPIiterator in interface QuantilesDoublesAPIpublic final void reset()
The parameter k will not change.
The parameter k will not change.
reset in interface QuantilesAPIpublic byte[] toByteArray()
QuantilesDoublesAPItoByteArray in interface QuantilesDoublesAPIpublic void update(double item)
QuantilesDoublesAPIupdate in interface QuantilesDoublesAPIitem - from a stream of quantiles. NaNs are ignored.Copyright © 2015–2022 The Apache Software Foundation. All rights reserved.