Package | Description |
---|---|
de.lmu.ifi.dbs.elki.index.tree |
Tree-based index structures
|
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants |
M-Tree and variants.
|
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.split |
Splitting strategies of nodes in an M-Tree (and variants).
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query |
Queries on the R-Tree family of indexes: kNN and range queries.
|
Modifier and Type | Method and Description |
---|---|
int |
DistanceEntry.compareTo(DistanceEntry<D,E> o)
Compares this object with the specified object for order.
|
Modifier and Type | Method and Description |
---|---|
protected List<DistanceEntry<D,E>> |
AbstractMTree.getSortedEntries(N node,
DBID q)
Sorts the entries of the specified node according to their minimum distance
to the specified object.
|
protected List<DistanceEntry<D,E>> |
AbstractMTree.getSortedEntries(N node,
DBIDs ids)
Sorts the entries of the specified node according to their minimum distance
to the specified objects.
|
Modifier and Type | Method and Description |
---|---|
private D |
MTreeSplit.assignNN(Set<E> assigned1,
Set<E> assigned2,
List<DistanceEntry<D,E>> list,
D currentCR,
boolean isLeaf)
Assigns the first object of the specified list to the first assignment that
it is not yet assigned to the second assignment.
|
Modifier and Type | Method and Description |
---|---|
protected List<DistanceEntry<D,SpatialEntry>> |
GenericRStarTreeKNNQuery.getSortedEntries(AbstractRStarTreeNode<?,?> node,
DBIDs ids)
Sorts the entries of the specified node according to their minimum distance
to the specified objects.
|