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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
package de.lmu.ifi.dbs.elki.result.optics;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2012
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;
import de.lmu.ifi.dbs.elki.distance.distancevalue.DoubleDistance;
/**
* Provides an entry in a cluster order.
*
* @author Elke Achtert
*/
public class DoubleDistanceClusterOrderEntry implements Comparable<ClusterOrderEntry<DoubleDistance>>, ClusterOrderEntry<DoubleDistance> {
/**
* The id of the entry.
*/
private DBID objectID;
/**
* The id of the entry's predecessor.
*/
private DBID predecessorID;
/**
* The reachability of the entry.
*/
private double reachability;
/**
* Creates a new entry in a cluster order with the specified parameters.
*
* @param objectID the id of the entry
* @param predecessorID the id of the entry's predecessor
* @param reachability the reachability of the entry
*/
public DoubleDistanceClusterOrderEntry(DBID objectID, DBID predecessorID, double reachability) {
this.objectID = objectID;
this.predecessorID = predecessorID;
this.reachability = reachability;
}
/**
* Indicates whether some other object is "equal to" this one.
*
* NOTE: for the use in an UpdatableHeap, only the ID is compared!
*
* @param o the reference object with which to compare.
* @return <code>true</code> if this object has the same attribute values as
* the o argument; <code>false</code> otherwise.
*/
@Override
public boolean equals(Object o) {
if(this == o) {
return true;
}
if(o == null || !(o instanceof ClusterOrderEntry)) {
return false;
}
final ClusterOrderEntry<?> that = (ClusterOrderEntry<?>) o;
// Compare by ID only, for UpdatableHeap!
return objectID.sameDBID(that.getID());
}
/**
* Returns a hash code value for the object.
*
* @return the object id if this entry
*/
@Override
public int hashCode() {
return objectID.hashCode();
}
/**
* Returns a string representation of the object.
*
* @return a string representation of the object.
*/
@Override
public String toString() {
return objectID + "(" + predecessorID + "," + reachability + ")";
}
/**
* Returns the object id of this entry.
*
* @return the object id of this entry
*/
@Override
public DBID getID() {
return objectID;
}
/**
* Returns the id of the predecessor of this entry if this entry has a
* predecessor, null otherwise.
*
* @return the id of the predecessor of this entry
*/
@Override
public DBID getPredecessorID() {
return predecessorID;
}
/**
* Returns the reachability distance of this entry
*
* @return the reachability distance of this entry
*/
@Override
public DoubleDistance getReachability() {
return new DoubleDistance(reachability);
}
@Override
public int compareTo(ClusterOrderEntry<DoubleDistance> o) {
if(o instanceof DoubleDistanceClusterOrderEntry) {
int delta = Double.compare(this.reachability, ((DoubleDistanceClusterOrderEntry) o).reachability);
if(delta != 0) {
return delta;
}
}
else {
int delta = this.getReachability().compareTo(o.getReachability());
if(delta != 0) {
return delta;
}
}
return -getID().compareTo(o.getID());
}
}
|
