See: Description
| Interface | Description |
|---|---|
| DoublesSortedView |
The Sorted View for quantiles of primitive type double.
|
| DoublesSortedViewIterator |
The quantiles SortedView iterator for type double.
|
| FloatsSortedView |
The Sorted View for quantiles of primitive type float.
|
| FloatsSortedViewIterator |
The quantiles SortedView Iterator for type float.
|
| GenericSortedView<T> |
The Sorted View for quantiles of generic type.
|
| 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.
|
| SortedViewIterator |
This is the base interface for the SortedViewIterator hierarchy used with a SortedView obtained
from a quantile-type sketch.
|
| Class | Description |
|---|---|
| BinarySearch |
Contains common equality binary search algorithms.
|
| GenericInequalitySearch |
This provides efficient, unique and unambiguous binary searching for inequality comparison criteria
for ordered arrays of values that may include duplicate values.
|
| GenericSortedViewIterator<T> |
The quantiles SortedView Iterator for generic types.
|
| QuantilesDoublesAPI.DoublesPartitionBoundaries |
This encapsulates the essential information needed to construct actual partitions and is returned from the
getPartitionBoundaries(int, QuantileSearchCritera) method.
|
| QuantilesFloatsAPI.FloatsPartitionBoundaries |
This encapsulates the essential information needed to construct actual partitions and is returned from the
getPartitionBoundaries(int, QuantileSearchCritera) method.
|
| QuantilesGenericAPI.GenericPartitionBoundaries<T> |
This encapsulates the essential information needed to construct actual partitions and is returned from the
getPartitionBoundaries(int, QuantileSearchCritera) method.
|
| QuantilesUtil |
Utilities for the quantiles sketches.
|
| Enum | Description |
|---|---|
| GenericInequalitySearch.Inequality |
The enumerator of inequalities
|
| InequalitySearch |
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.
|
Copyright © 2015–2022 The Apache Software Foundation. All rights reserved.