blob: 508b0fa934114a29f80dc7b5a18e54f72e296179 (
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
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.commons.math3.stat.clustering;
import java.io.Serializable;
import java.util.Arrays;
import java.util.Collection;
import org.apache.commons.math3.util.MathArrays;
/**
* A simple implementation of {@link Clusterable} for points with integer coordinates.
* @since 2.0
* @deprecated As of 3.2 (to be removed in 4.0),
* use {@link org.apache.commons.math3.ml.clustering.DoublePoint} instead
*/
@Deprecated
public class EuclideanIntegerPoint implements Clusterable<EuclideanIntegerPoint>, Serializable {
/** Serializable version identifier. */
private static final long serialVersionUID = 3946024775784901369L;
/** Point coordinates. */
private final int[] point;
/**
* Build an instance wrapping an integer array.
* <p>The wrapped array is referenced, it is <em>not</em> copied.</p>
* @param point the n-dimensional point in integer space
*/
public EuclideanIntegerPoint(final int[] point) {
this.point = point;
}
/**
* Get the n-dimensional point in integer space.
* @return a reference (not a copy!) to the wrapped array
*/
public int[] getPoint() {
return point;
}
/** {@inheritDoc} */
public double distanceFrom(final EuclideanIntegerPoint p) {
return MathArrays.distance(point, p.getPoint());
}
/** {@inheritDoc} */
public EuclideanIntegerPoint centroidOf(final Collection<EuclideanIntegerPoint> points) {
int[] centroid = new int[getPoint().length];
for (EuclideanIntegerPoint p : points) {
for (int i = 0; i < centroid.length; i++) {
centroid[i] += p.getPoint()[i];
}
}
for (int i = 0; i < centroid.length; i++) {
centroid[i] /= points.size();
}
return new EuclideanIntegerPoint(centroid);
}
/** {@inheritDoc} */
@Override
public boolean equals(final Object other) {
if (!(other instanceof EuclideanIntegerPoint)) {
return false;
}
return Arrays.equals(point, ((EuclideanIntegerPoint) other).point);
}
/** {@inheritDoc} */
@Override
public int hashCode() {
return Arrays.hashCode(point);
}
/**
* {@inheritDoc}
* @since 2.1
*/
@Override
public String toString() {
return Arrays.toString(point);
}
}
|
