blob: 141037c74bdf17cd6cd17908a7ccf20c2c317451 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
package de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2011
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import de.lmu.ifi.dbs.elki.distance.distancevalue.Distance;
import de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.MTreeEntry;
/**
* Defines the requirements for an entry in an
* {@link de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax.MkMaxTreeNode}.
* Additionally to an entry in an M-Tree an MkMaxEntry holds the k-nearest neighbor distance of the underlying
* data object or MkMax-Tree node.
*
* @author Elke Achtert
* @param <D> the type of Distance used in the MkMaxTree
*/
interface MkMaxEntry<D extends Distance<D>> extends MTreeEntry<D> {
/**
* Returns the knn distance of the entry.
*
* @return the knn distance of the entry
*/
public D getKnnDistance();
/**
* Sets the knn distance of the entry.
*
* @param knnDistance the knn distance to be set
*/
public void setKnnDistance(D knnDistance);
}
|
