Uses of Package
org.apache.datasketches.quantilescommon
Package
Description
This package is for the implementations of the sketch algorithm developed by Zohar Karnin, Kevin Lang,
and Edo Liberty that is commonly referred to as the "KLL" sketch after the authors' last names.
The quantiles package contains stochastic streaming algorithms that enable single-pass
analysis of the distribution of a stream of quantiles.
This package contains common tools and methods for the quantiles, kll and
req packages.
This package is for the implementation of the Relative Error Quantiles sketch algorithm.
-
ClassDescriptionThe SortedView of the Quantiles Classic DoublesSketch and the KllDoublesSketch.The SortedView for the KllFloatsSketch and the ReqSketch.This defines the returned results of the getParitionBoundaries() function and includes the basic methods needed to construct actual partitions.The SortedView for the KllItemsSketch and the classic ItemsSketch.The SortedView of the KllLongsSketch.This enables the special functions for performing efficient partitioning of massive data.This is a stochastic streaming sketch that enables near-real time analysis of the approximate distribution of items from a very large stream in a single pass, requiring only that the items are comparable.The Quantiles API for item type double.The quantiles sketch iterator for primitive type double.These search criteria are used by the KLL, REQ and Classic Quantiles sketches in the DataSketches library.The Quantiles API for item type float.The quantiles sketch iterator for primitive type float.The Quantiles API for item type generic.The quantiles sketch iterator for generic types.The Quantiles API for item type long.The quantiles sketch iterator for primitive type long.This is the base interface for the SketchIterator hierarchy used for viewing the non-ordered quantiles retained by a sketch.This defines the methods required to compute the partition limits.
-
ClassDescriptionThis defines the returned results of the getParitionBoundaries() function and includes the basic methods needed to construct actual partitions.This enables the special functions for performing efficient partitioning of massive data.These search criteria are used by the KLL, REQ and Classic Quantiles sketches in the DataSketches library.The Quantiles API for item type generic.
-
ClassDescriptionThe SortedView of the Quantiles Classic DoublesSketch and the KllDoublesSketch.This defines the returned results of the getParitionBoundaries() function and includes the basic methods needed to construct actual partitions.The SortedView for the KllItemsSketch and the classic ItemsSketch.This enables the special functions for performing efficient partitioning of massive data.This is a stochastic streaming sketch that enables near-real time analysis of the approximate distribution of items from a very large stream in a single pass, requiring only that the items are comparable.The Quantiles API for item type double.The quantiles sketch iterator for primitive type double.These search criteria are used by the KLL, REQ and Classic Quantiles sketches in the DataSketches library.The Quantiles API for item type generic.The quantiles sketch iterator for generic types.This is the base interface for the SketchIterator hierarchy used for viewing the non-ordered quantiles retained by a sketch.This defines the methods required to compute the partition limits.
-
ClassDescriptionThe Sorted View for quantile sketches of primitive type double.Iterator over quantile sketches of primitive type double.The Sorted View for quantiles of primitive type float.Iterator over quantile sketches of primitive type float.The enumerator of inequalitiesThis defines the returned results of the getParitionBoundaries() function and includes the basic methods needed to construct actual partitions.The Sorted View for quantiles of generic type.Iterator over quantile sketches of generic type.A simple structure to hold a pair of arraysA simple structure to hold a pair of arraysA simple structure to hold a pair of arraysA simple structure to hold a pair of arraysThis provides efficient, unique and unambiguous binary searching for inequality comparison criteria for ordered arrays of values that may include duplicate values.The Sorted View for quantile sketches of primitive type long.Iterator over quantile sketches of primitive type long.This enables the special functions for performing efficient partitioning of massive data.This is a stochastic streaming sketch that enables near-real time analysis of the approximate distribution of items from a very large stream in a single pass, requiring only that the items are comparable.The Quantiles API for item type double.The quantiles sketch iterator for primitive type double.These search criteria are used by the KLL, REQ and Classic Quantiles sketches in the DataSketches library.The Quantiles API for item type float.The quantiles sketch iterator for primitive type float.The Quantiles API for item type generic.The quantiles sketch iterator for generic types.The Quantiles API for item type long.The quantiles sketch iterator for primitive type long.This is the base interface for the SketchIterator hierarchy used for viewing the non-ordered quantiles retained by a sketch.This defines the methods required to compute the partition limits.This is the base interface for the Sorted View interface hierarchy and defines the methods that are type independent.This is the base interface for the SortedViewIterator hierarchy used with a SortedView obtained from a quantile-type sketch.
-
ClassDescriptionThe SortedView for the KllFloatsSketch and the ReqSketch.This is a stochastic streaming sketch that enables near-real time analysis of the approximate distribution of items from a very large stream in a single pass, requiring only that the items are comparable.These search criteria are used by the KLL, REQ and Classic Quantiles sketches in the DataSketches library.The Quantiles API for item type float.The quantiles sketch iterator for primitive type float.This is the base interface for the SketchIterator hierarchy used for viewing the non-ordered quantiles retained by a sketch.