Package org.apache.datasketches.quantilescommon
This package contains common tools and methods for the quantiles, kll and
req packages.
-
Interface Summary Interface Description DoublesSortedView The Sorted View for quantile sketches of primitive type double.FloatsSortedView The Sorted View for quantiles of primitive type float.GenericSortedView<T> The Sorted View for quantiles of generic type.PartitionBoundaries This defines a set of results computed from the getParitionBoundaries() function and encapsulates the basic methods needed to construct actual partitions based on generic items.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.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.QuantilesSketchIterator This is the base interface for the SketchIterator hierarchy used for viewing the non-ordered quantiles retained by a sketch.SortedView This is the base interface for the Sorted View interface hierarchy and defines the methods that are type independent. -
Class Summary Class Description BinarySearch Contains common equality binary search algorithms.DoublesSortedViewIterator Iterator over quantile sketches of primitive type double.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.GenericPartitionBoundaries<T> Implements PartitionBoundariesGenericSortedViewIterator<T> Iterator over quantile sketches of generic type.QuantilesUtil Utilities for the quantiles sketches.SortedViewIterator This is the base interface for the SortedViewIterator hierarchy used with a SortedView obtained from a quantile-type sketch. -
Enum Summary Enum Description GenericInequalitySearch.Inequality The enumerator of inequalitiesInequalitySearch This provides efficient, unique and unambiguous binary searching for inequality comparison criteria for ordered arrays of values that may include duplicate values.QuantileSearchCriteria These search criteria are used by the KLL, REQ and Classic Quantiles sketches in the DataSketches library.