count.count.IndexMapping that approximates the memory-optimal one (namely LogarithmicMapping) by extracting the floor value of the logarithm to the base 2 from the binary
representations of floating-point values and linearly interpolating the logarithm in-between
using, again, the binary representation.Input that is backed by an array.DDSketch that offers constant-time insertion and whose size
grows until the maximum number of bins is reached, at which point bins with highest indices are
collapsed, which causes the relative accuracy guarantee to be lost on highest quantiles.DDSketch that offers constant-time insertion and whose size
grows until the maximum number of bins is reached, at which point bins with lowest indices are
collapsed, which causes the relative accuracy guarantee to be lost on lowest quantiles.DDSketch that encodes the content of this sketch with the specified index
mapping and the specified stores.IndexMapping that approximates the memory-optimal one (namely LogarithmicMapping) by extracting the floor value of the logarithm to the base 2 from the binary
representations of floating-point values and cubically interpolating the logarithm in-between.QuantileSketch with relative-error guarantees.IndexMapping and
Store supplier.IndexMapping and
Store suppliers.IndexMapping and
Store supplier.DDSketch with the provided relative accuracy guarantee.DDSketch.Input.decodeSignedVarLong deserializes long values that have been encoded using
encodeSignedVarLong(Output, long).decodeUnsignedVarLong deserializes long values that have been encoded using
encodeUnsignedVarLong(Output, long).decodeSignedVarLong deserializes double values that have been encoded using
encodeVarDouble(Output, double).encodeSignedVarLong serializes long values using zig-zag encoding, which
ensures small-scale integers are turned into integers that have leading zeros, whether they are
positive or negative, hence allows for space-efficient encoding of those values.encodeUnsignedVarLong serializes long values 7 bits at a time, starting with
the least significant bits.encodeVarDouble serializes double values using a method that is similar to the
varint encoding and that is space-efficient for non-negative integer values.new DDSketch(new BitwiseLinearlyInterpolatedMapping(relativeAccuracy),
UnboundedSizeDenseStore::new).new DDSketch(new BitwiseLinearlyInterpolatedMapping(relativeAccuracy),
() -> new CollapsingHighestDenseStore(maxNumBins)).new DDSketch(new BitwiseLinearlyInterpolatedMapping(relativeAccuracy),
() -> new CollapsingLowestDenseStore(maxNumBins).Output that is backed by an array of bytes, whose capacity is grown
as necessary.double positive values and int values that imposes relative
guarantees on the composition of IndexMapping.value(int) and IndexMapping.index(double).IndexMapping to bins
encoded using another one.IndexMapping that approximates the memory-optimal one (namely LogarithmicMapping) by extracting the floor value of the logarithm to the base 2 from the binary
representations of floating-point values and linearly interpolating the logarithm in-between.DDSketch that offers constant-time insertion and whose size
grows until the maximum number of bins is reached, at which point bins with highest indices are
collapsed, which causes the relative accuracy guarantee to be lost on highest.DDSketch that offers constant-time insertion and whose size
grows until the maximum number of bins is reached, at which point bins with lowest indices are
collapsed, which causes the relative accuracy guarantee to be lost on lowest quantiles.IndexMapping that is memory-optimal, that is to say that given a targeted
relative accuracy, it requires the least number of indices to cover a given range of values.DDSketch that offers constant-time insertion and whose size
grows indefinitely to accommodate for the range of input values.DDSketch from a mapping, possibly non-empty stores and a
non-negative count for the zero bucket.DDSketchWithExactSummaryStatistics from a DDSketch
and exact summary statistics.IndexMapping that approximates the memory-optimal one (namely LogarithmicMapping) by extracting the floor value of the logarithm to the base 2 from the binary
representations of floating-point values and quadratically interpolating the logarithm
in-between.double values and can compute quantiles over the ingested
values.IndexMapping that approximates the memory-optimal one (namely LogarithmicMapping) by extracting the floor value of the logarithm to the base 2 from the binary
representations of floating-point values and quartically interpolating the logarithm in-between.signedVarLongEncodedLength returns the number of bytes that encodeSignedVarLong(Output, long) encodes a long value into.DDSketch that offers insertion time that is logarithmic in
the number of non-empty bins that the sketch contains and whose size grows indefinitely to
accommodate for the range of input values.DDSketch that offers constant-time insertion and whose size
grows indefinitely to accommodate for the range of input values.unsignedVarLongEncodedLength returns the number of bytes that encodeUnsignedVarLong(Output, long) encodes a long value into.varDoubleEncodedLength returns the number of bytes that encodeVarDouble(Output,
double) encodes a double value into.QuantileSketch to keep track of quantiles.