Modifier and Type | Method and Description |
---|---|
Centroid |
GroupTree.ceiling(Centroid base) |
protected Centroid |
AbstractTDigest.createCentroid(double mean,
int id) |
static Centroid |
Centroid.createWeighted(double x,
int w,
Iterable<? extends Double> data) |
Centroid |
GroupTree.first() |
Centroid |
GroupTree.floor(Centroid base) |
Centroid |
GroupTree.last() |
Modifier and Type | Method and Description |
---|---|
Iterable<? extends Centroid> |
TreeDigest.centroids() |
Iterable<? extends Centroid> |
AVLTreeDigest.centroids() |
Iterable<? extends Centroid> |
ArrayDigest.centroids() |
abstract Iterable<? extends Centroid> |
TDigest.centroids()
An iterable that lets you go through the centroids in ascending order by mean.
|
Iterator<Centroid> |
GroupTree.iterator()
Iteratres through all groups in the tree.
|
Iterable<Centroid> |
GroupTree.tailSet(Centroid start) |
Modifier and Type | Method and Description |
---|---|
void |
GroupTree.add(Centroid centroid) |
void |
TreeDigest.add(double x,
int w,
Centroid base) |
Centroid |
GroupTree.ceiling(Centroid base) |
int |
Centroid.compareTo(Centroid o) |
Centroid |
GroupTree.floor(Centroid base) |
int |
GroupTree.headCount(Centroid base) |
long |
GroupTree.headSum(Centroid base) |
void |
GroupTree.move(double x,
int count,
Centroid v,
Iterable<? extends Double> data)
Modify an existing value in the tree subject to the constraint that the change will not alter the
ordering of the tree.
|
void |
GroupTree.remove(Centroid base) |
Iterable<Centroid> |
GroupTree.tailSet(Centroid start) |
Constructor and Description |
---|
GroupTree(Centroid leaf) |
Copyright © 2015. All rights reserved.