blob: 7a394b8b39c3cea6c20e29474bec41904989aff2 (
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.distance;
/*
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.distance.distancevalue.Distance;
/**
* Class with distance related utility functions.
*
* @apiviz.uses de.lmu.ifi.dbs.elki.distance.distancevalue.Distance oneway - -
* handles
*
* @author Erich Schubert
*/
public final class DistanceUtil {
/**
* Returns the maximum of the given Distances or the first, if none is greater
* than the other one.
*
* @param <D> distance type
* @param d1 first Distance
* @param d2 second Distance
* @return Distance the maximum of the given Distances or the first, if
* neither is greater than the other one
*/
public static <D extends Distance<D>> D max(D d1, D d2) {
if(d1 == null) {
return d2;
}
if(d2 == null) {
return d1;
}
if(d1.compareTo(d2) > 0) {
return d1;
}
else if(d2.compareTo(d1) > 0) {
return d2;
}
else {
return d1;
}
}
/**
* Returns the minimum of the given Distances or the first, if none is less
* than the other one.
*
* @param <D> distance type
* @param d1 first Distance
* @param d2 second Distance
* @return Distance the minimum of the given Distances or the first, if
* neither is less than the other one
*/
public static <D extends Distance<D>> D min(D d1, D d2) {
if(d1 == null) {
return d2;
}
if(d2 == null) {
return d1;
}
if(d1.compareTo(d2) < 0) {
return d1;
}
else if(d2.compareTo(d1) < 0) {
return d2;
}
else {
return d1;
}
}
}
|
