Package | Description |
---|---|
io.druid.collections.spatial | |
io.druid.collections.spatial.split |
Modifier and Type | Class and Description |
---|---|
class |
Point |
Modifier and Type | Method and Description |
---|---|
Node |
Node.getParent() |
Node |
RTree.getRoot() |
Modifier and Type | Method and Description |
---|---|
List<Node> |
Point.getChildren() |
List<Node> |
Node.getChildren() |
Modifier and Type | Method and Description |
---|---|
void |
Point.addChild(Node node) |
void |
Node.addChild(Node node) |
void |
Node.addToBitmapIndex(Node node) |
boolean |
Point.contains(Node other) |
boolean |
Node.contains(Node other) |
static void |
RTreeUtils.enclose(Node[] nodes) |
static double |
RTreeUtils.getEnclosingArea(Node a,
Node b) |
static double |
RTreeUtils.getExpansionCost(Node node,
Point point) |
static void |
RTreeUtils.printRTreeNode(Node node,
int level) |
static boolean |
RTreeUtils.verifyEnclose(Node node) |
Constructor and Description |
---|
Node(float[] minCoordinates,
float[] maxCoordinates,
List<Node> children,
boolean isLeaf,
Node parent,
MutableBitmap bitmap) |
Constructor and Description |
---|
Node(float[] minCoordinates,
float[] maxCoordinates,
List<Node> children,
boolean isLeaf,
Node parent,
MutableBitmap bitmap) |
Modifier and Type | Method and Description |
---|---|
Node |
QuadraticGutmanSplitStrategy.pickNext(List<Node> nodes,
Node[] groups) |
Node |
LinearGutmanSplitStrategy.pickNext(List<Node> nodes,
Node[] groups)
This algorithm is from the original paper.
|
abstract Node |
GutmanSplitStrategy.pickNext(List<Node> nodes,
Node[] groups) |
Node[] |
QuadraticGutmanSplitStrategy.pickSeeds(List<Node> nodes) |
Node[] |
LinearGutmanSplitStrategy.pickSeeds(List<Node> nodes)
This algorithm is from the original paper.
|
abstract Node[] |
GutmanSplitStrategy.pickSeeds(List<Node> nodes) |
Node[] |
SplitStrategy.split(Node node) |
Node[] |
GutmanSplitStrategy.split(Node node)
This algorithm is from the original paper.
|
Modifier and Type | Method and Description |
---|---|
boolean |
SplitStrategy.needToSplit(Node node) |
boolean |
GutmanSplitStrategy.needToSplit(Node node) |
Node |
QuadraticGutmanSplitStrategy.pickNext(List<Node> nodes,
Node[] groups) |
Node |
LinearGutmanSplitStrategy.pickNext(List<Node> nodes,
Node[] groups)
This algorithm is from the original paper.
|
abstract Node |
GutmanSplitStrategy.pickNext(List<Node> nodes,
Node[] groups) |
Node[] |
SplitStrategy.split(Node node) |
Node[] |
GutmanSplitStrategy.split(Node node)
This algorithm is from the original paper.
|
Modifier and Type | Method and Description |
---|---|
Node |
QuadraticGutmanSplitStrategy.pickNext(List<Node> nodes,
Node[] groups) |
Node |
LinearGutmanSplitStrategy.pickNext(List<Node> nodes,
Node[] groups)
This algorithm is from the original paper.
|
abstract Node |
GutmanSplitStrategy.pickNext(List<Node> nodes,
Node[] groups) |
Node[] |
QuadraticGutmanSplitStrategy.pickSeeds(List<Node> nodes) |
Node[] |
LinearGutmanSplitStrategy.pickSeeds(List<Node> nodes)
This algorithm is from the original paper.
|
abstract Node[] |
GutmanSplitStrategy.pickSeeds(List<Node> nodes) |
Copyright © 2011–2017. All rights reserved.