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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
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) 2015
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 java.io.IOException;
import java.io.ObjectInput;
import java.io.ObjectOutput;
import de.lmu.ifi.dbs.elki.database.ids.DBID;
import de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.MTreeDirectoryEntry;
/**
* Represents an entry in a directory node of an {@link MkMaxTree}. Additionally
* to an MTreeDirectoryEntry an MkMaxDirectoryEntry holds the knn distance of
* the underlying MkMax-Tree node.
*
* @author Elke Achtert
*/
class MkMaxDirectoryEntry extends MTreeDirectoryEntry implements MkMaxEntry {
/**
* Serial version UID
*/
private static final long serialVersionUID = 2;
/**
* The aggregated k-nearest neighbor distance of the underlying MkMax-Tree
* node.
*/
private double knnDistance;
/**
* Empty constructor for serialization purposes.
*/
public MkMaxDirectoryEntry() {
super();
}
/**
* Constructor.
*
* @param objectID the id of the routing object
* @param parentDistance the distance from the routing object of this entry to
* its parent's routing object
* @param nodeID the id of the underlying node
* @param coveringRadius the covering radius of the entry
* @param knnDistance the aggregated knn distance of the underlying MkMax-Tree
* node
*/
public MkMaxDirectoryEntry(DBID objectID, double parentDistance, Integer nodeID, double coveringRadius, double knnDistance) {
super(objectID, parentDistance, nodeID, coveringRadius);
this.knnDistance = knnDistance;
}
@Override
public double getKnnDistance() {
return knnDistance;
}
@Override
public void setKnnDistance(double knnDistance) {
this.knnDistance = knnDistance;
}
/**
* Calls the super method and writes the knn distance of this entry to the
* specified stream.
*/
@Override
public void writeExternal(ObjectOutput out) throws IOException {
super.writeExternal(out);
out.writeDouble(knnDistance);
}
/**
* Calls the super method and reads the knn distance of this entry from the
* specified input stream.
*/
@Override
public void readExternal(ObjectInput in) throws IOException, ClassNotFoundException {
super.readExternal(in);
this.knnDistance = in.readDouble();
}
/**
* Indicates whether some other object is "equal to" this one.
*
* @param o the object to be tested
* @return true, if the super method returns true and o is an
* MkMaxDirectoryEntry and has the same knnDistance as this entry.
*/
@Override
public boolean equals(Object o) {
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
if (!super.equals(o)) {
return false;
}
final MkMaxDirectoryEntry that = (MkMaxDirectoryEntry) o;
return Double.compare(knnDistance, that.knnDistance) == 0;
}
}
|
