Apache
/
commons-math
mirror of https://github.com/apache/commons-math.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Simplify hashCode/equals/toString methods by using appropriate methods from java.util.Arrays, similar to EuclideanDoublePoint. 

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@1413424 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Thomas Neidhart 2012-11-25 21:23:31 +00:00
parent 17c50866e0
commit 71e11fc375
1 changed files with 4 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
src/main/java/org/apache/commons/math3/stat/clustering/EuclideanIntegerPoint.java
View File

@ -18,6 +18,7 @@
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;
@ -77,26 +78,13 @@ public class EuclideanIntegerPoint implements Clusterable<EuclideanIntegerPoint>
if (!(other instanceof EuclideanIntegerPoint)) {
return false;
}
final int[] otherPoint = ((EuclideanIntegerPoint) other).getPoint();
if (point.length != otherPoint.length) {
return false;
}
for (int i = 0; i < point.length; i++) {
if (point[i] != otherPoint[i]) {
return false;
}
}
return true;
return Arrays.equals(point, ((EuclideanIntegerPoint) other).point);
}
/** {@inheritDoc} */
@Override
public int hashCode() {
int hashCode = 0;
for (Integer i : point) {
hashCode += i.hashCode() * 13 + 7;
}
return hashCode;
return Arrays.hashCode(point);
}
/**
@ -105,16 +93,7 @@ public class EuclideanIntegerPoint implements Clusterable<EuclideanIntegerPoint>
*/
@Override
public String toString() {
final StringBuilder buff = new StringBuilder("(");
final int[] coordinates = getPoint();
for (int i = 0; i < coordinates.length; i++) {
buff.append(coordinates[i]);
if (i < coordinates.length - 1) {
buff.append(",");
}
}
buff.append(")");
return buff.toString();
return Arrays.toString(point);
}
}