|
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectde.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util.TopologicalSplitter.Split<E>
E - Actual entry typeprivate class TopologicalSplitter.Split<E extends SpatialEntry>

Internal data for an actual split.
| Field Summary | |
|---|---|
(package private) int |
bestSorting
Indicates whether the sorting according to maximal or to minimal value has been used for choosing the split axis and split point. |
(package private) List<E> |
maxSorting
The entries sorted according to their max values of their MBRs. |
(package private) List<E> |
minSorting
The entries sorted according to their min values of their MBRs. |
(package private) int |
splitAxis
The split axis. |
(package private) int |
splitPoint
The index of the split point. |
| Constructor Summary | |
|---|---|
TopologicalSplitter.Split()
Constructor. |
|
| Method Summary | |
|---|---|
(package private) void |
chooseSplitAxis(List<E> entries,
int minEntries)
Chooses a split axis. |
(package private) void |
chooseSplitPoint(int minEntries)
Chooses a split axis. |
List<E> |
getBestSorting()
Returns whether the sorting according to maximal or to minimal value has been used for choosing the split axis and split point. |
int |
getSplitPoint()
Returns the split point. |
private HyperBoundingBox |
mbr(List<E> entries,
int from,
int to)
Computes and returns the mbr of the specified nodes, only the nodes between from and to index are considered. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
int splitAxis
int splitPoint
int bestSorting
List<E extends SpatialEntry> maxSorting
List<E extends SpatialEntry> minSorting
| Constructor Detail |
|---|
public TopologicalSplitter.Split()
| Method Detail |
|---|
void chooseSplitAxis(List<E> entries,
int minEntries)
entries - the entries to be splitminEntries - number of minimum entries in the node to be splitvoid chooseSplitPoint(int minEntries)
minEntries - number of minimum entries in the node to be split
private HyperBoundingBox mbr(List<E> entries,
int from,
int to)
entries - the array of nodesfrom - the start indexto - the end index
public int getSplitPoint()
public List<E> getBestSorting()
|
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||||