blob: cbe0451e136a864ca12991266af1be51b9e29125 (
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
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
|
package de.lmu.ifi.dbs.elki.index.tree.query;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2013
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.database.ids.DBID;
/**
* Encapsulates the attributes for a object that can be stored in a heap. The
* object to be stored represents a node in a M-Tree and some additional
* information. Additionally to the regular expansion candidate, this object
* holds the id of the routing object of the underlying M-Tree node and its
* covering radius.
*
* FIXME: Class naming in this package is inconsistent.
*
* @author Elke Achtert
*/
public class GenericMTreeDistanceSearchCandidate implements Comparable<GenericMTreeDistanceSearchCandidate> {
/**
* The id of the routing object.
*/
public DBID routingObjectID;
/**
* Minimum distance.
*/
public double mindist;
/**
* Node ID.
*/
public int nodeID;
/**
* Creates a new heap node with the specified parameters.
*
* @param mindist the minimum distance of the node
* @param nodeID the id of the node
* @param routingObjectID the id of the routing object of the node
*/
public GenericMTreeDistanceSearchCandidate(final double mindist, final int nodeID, final DBID routingObjectID) {
this.mindist = mindist;
this.nodeID = nodeID;
this.routingObjectID = routingObjectID;
}
@Override
public int hashCode() {
return nodeID;
}
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj == null) {
return false;
}
if (getClass() != obj.getClass()) {
return false;
}
GenericMTreeDistanceSearchCandidate other = (GenericMTreeDistanceSearchCandidate) obj;
return nodeID == other.nodeID;
}
@Override
public int compareTo(GenericMTreeDistanceSearchCandidate o) {
return Double.compare(this.mindist, o.mindist);
}
}
|
