blob: 89e6ebb14d3f1155201afb31a3a6bc48892a08b2 (
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
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
|
package de.lmu.ifi.dbs.elki.algorithm.clustering.optics;
/*
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 de.lmu.ifi.dbs.elki.database.ids.DBID;
import de.lmu.ifi.dbs.elki.database.ids.DBIDUtil;
/**
* Entry in the priority heap.
*
* @author Elke Achtert
*
* @apiviz.exclude
*/
public class OPTICSHeapEntry implements Comparable<OPTICSHeapEntry> {
/**
* The id of the entry.
*/
DBID objectID;
/**
* The id of the entry's predecessor.
*/
DBID predecessorID;
/**
* The reachability of the entry.
*/
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 OPTICSHeapEntry(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 instanceof OPTICSHeapEntry)) {
return false;
}
final OPTICSHeapEntry that = (OPTICSHeapEntry) o;
// Compare by ID only, for UpdatableHeap!
return DBIDUtil.equal(objectID, that.objectID);
}
/**
* 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 + ")";
}
@Override
public int compareTo(OPTICSHeapEntry o) {
if(this.reachability < o.reachability) {
return -1;
}
if(this.reachability > o.reachability) {
return +1;
}
return -DBIDUtil.compare(objectID, o.objectID);
}
}
|
