blob: 7338bdd1dd996527d6611c817ccabbcdf3a4ba79 (
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
|
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) 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;
/**
* Candidate for expansion in a distance search (generic implementation).
*
* @author Erich Schubert
*
* @param <D> Distance type
*/
public class GenericDistanceSearchCandidate<D extends Distance<D>> implements Comparable<GenericDistanceSearchCandidate<D>> {
/**
* Distance value
*/
public D mindist;
/**
* Page id
*/
public Integer nodeID;
/**
* Constructor.
*
* @param mindist The minimum distance to this candidate
* @param pagenr The page number of this candidate
*/
public GenericDistanceSearchCandidate(final D mindist, final Integer pagenr) {
super();
this.mindist = mindist;
this.nodeID = pagenr;
}
@Override
public boolean equals(Object obj) {
final GenericDistanceSearchCandidate<?> other = (GenericDistanceSearchCandidate<?>) obj;
return this.nodeID == other.nodeID;
}
@Override
public int compareTo(GenericDistanceSearchCandidate<D> o) {
return this.mindist.compareTo(o.mindist);
}
}
|
