Package org.apache.datasketches.quantilescommon

package org.apache.datasketches.quantilescommon

This package contains common tools and methods for the quantiles, kll and req packages.

Related Packages

Package	Description
org.apache.datasketches	This package is the parent package for all sketch families and common code areas.

Class	Description
BinarySearch	Contains common equality binary search algorithms.
DoublesSketchSortedView	The SortedView of the Quantiles Classic DoublesSketch and the KllDoublesSketch.
DoublesSortedView	The Sorted View for quantile sketches of primitive type double.
DoublesSortedViewIterator	Iterator over quantile sketches of primitive type double.
FloatsSketchSortedView	The SortedView for the KllFloatsSketch and the ReqSketch.
FloatsSortedView	The Sorted View for quantiles of primitive type float.
FloatsSortedViewIterator	Iterator over quantile sketches of primitive type float.
GenericInequalitySearch	This provides efficient, unique and unambiguous binary searching for inequality comparison criteria for ordered arrays of values that may include duplicate values.
GenericInequalitySearch.Inequality	The enumerator of inequalities
GenericPartitionBoundaries<T>	This defines the returned results of the getParitionBoundaries() function and includes the basic methods needed to construct actual partitions.
GenericSortedView<T>	The Sorted View for quantiles of generic type.
GenericSortedViewIterator<T>	Iterator over quantile sketches of generic type.
IncludeMinMax	This class reinserts the min and max values into the sorted view arrays as required.
IncludeMinMax.DoublesPair	A simple structure to hold a pair of arrays
IncludeMinMax.FloatsPair	A simple structure to hold a pair of arrays
IncludeMinMax.ItemsPair<T>	A simple structure to hold a pair of arrays
IncludeMinMax.LongsPair	A simple structure to hold a pair of arrays
InequalitySearch	This provides efficient, unique and unambiguous binary searching for inequality comparison criteria for ordered arrays of values that may include duplicate values.
ItemsSketchSortedView<T>	The SortedView for the KllItemsSketch and the classic ItemsSketch.
KolmogorovSmirnov	Kolmogorov-Smirnov Test See Kolmogorov–Smirnov Test
LongsSketchSortedView	The SortedView of the KllLongsSketch.
LongsSortedView	The Sorted View for quantile sketches of primitive type long.
LongsSortedViewIterator	Iterator over quantile sketches of primitive type long.
PartitioningFeature<T>	This enables the special functions for performing efficient partitioning of massive data.
QuantilesAPI	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.
QuantilesDoublesAPI	The Quantiles API for item type double.
QuantilesDoublesSketchIterator	The quantiles sketch iterator for primitive type double.
QuantileSearchCriteria	These search criteria are used by the KLL, REQ and Classic Quantiles sketches in the DataSketches library.
QuantilesFloatsAPI	The Quantiles API for item type float.
QuantilesFloatsSketchIterator	The quantiles sketch iterator for primitive type float.
QuantilesGenericAPI<T>	The Quantiles API for item type generic.
QuantilesGenericSketchIterator<T>	The quantiles sketch iterator for generic types.
QuantilesLongsAPI	The Quantiles API for item type long.
QuantilesLongsSketchIterator	The quantiles sketch iterator for primitive type long.
QuantilesSketchIterator	This is the base interface for the SketchIterator hierarchy used for viewing the non-ordered quantiles retained by a sketch.
QuantilesUtil	Utilities for the quantiles sketches.
SketchPartitionLimits	This defines the methods required to compute the partition limits.
SortedView	This is the base interface for the Sorted View interface hierarchy and defines the methods that are type independent.
SortedViewIterator	This is the base interface for the SortedViewIterator hierarchy used with a SortedView obtained from a quantile-type sketch.