|
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use DistanceEntry | |
|---|---|
| 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 | R*-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. |
| Uses of DistanceEntry in de.lmu.ifi.dbs.elki.index.tree |
|---|
| Methods in de.lmu.ifi.dbs.elki.index.tree with parameters of type DistanceEntry | |
|---|---|
int |
DistanceEntry.compareTo(DistanceEntry<D,E> o)
Compares this object with the specified object for order. |
| Uses of DistanceEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants |
|---|
| Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants that return types with arguments of type DistanceEntry | |
|---|---|
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. |
| Uses of DistanceEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.split |
|---|
| Method parameters in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.split with type arguments of type DistanceEntry | |
|---|---|
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. |
| Uses of DistanceEntry in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants |
|---|
| Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants with parameters of type DistanceEntry | ||
|---|---|---|
protected
|
AbstractRStarTreeNode.initReInsert(int start,
DistanceEntry<D,E>[] reInsertEntries)
* Initializes a reinsert operation. |
|
| Uses of DistanceEntry in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query |
|---|
| Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query that return types with arguments of type DistanceEntry | |
|---|---|
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. |
|
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||||