You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by se...@apache.org on 2013/07/19 00:41:19 UTC
svn commit: r1504702 -
/commons/proper/math/trunk/src/test/java/org/apache/commons/math3/transform/FastSineTransformerTest.java
Author: sebb
Date: Thu Jul 18 22:41:19 2013
New Revision: 1504702
URL: http://svn.apache.org/r1504702
Log:
Unnecessary casts
Modified:
commons/proper/math/trunk/src/test/java/org/apache/commons/math3/transform/FastSineTransformerTest.java
Modified: commons/proper/math/trunk/src/test/java/org/apache/commons/math3/transform/FastSineTransformerTest.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/test/java/org/apache/commons/math3/transform/FastSineTransformerTest.java?rev=1504702&r1=1504701&r2=1504702&view=diff
==============================================================================
--- commons/proper/math/trunk/src/test/java/org/apache/commons/math3/transform/FastSineTransformerTest.java (original)
+++ commons/proper/math/trunk/src/test/java/org/apache/commons/math3/transform/FastSineTransformerTest.java Thu Jul 18 22:41:19 2013
@@ -143,7 +143,7 @@ public final class FastSineTransformerTe
final double[] y = new double[n];
final double[] sin = new double[2 * n];
for (int i = 0; i < sin.length; i++) {
- sin[i] = FastMath.sin(FastMath.PI * i / (double) n);
+ sin[i] = FastMath.sin(FastMath.PI * i / n);
}
for (int j = 0; j < n; j++) {
double yj = 0.0;
@@ -157,7 +157,7 @@ public final class FastSineTransformerTe
if (normalization == DstNormalization.STANDARD_DST_I) {
s = 1.0;
} else if (normalization == DstNormalization.ORTHOGONAL_DST_I) {
- s = FastMath.sqrt(2.0 / (double) n);
+ s = FastMath.sqrt(2.0 / n);
} else {
throw new MathIllegalStateException();
}
@@ -165,7 +165,7 @@ public final class FastSineTransformerTe
if (normalization == DstNormalization.STANDARD_DST_I) {
s = 2.0 / n;
} else if (normalization == DstNormalization.ORTHOGONAL_DST_I) {
- s = FastMath.sqrt(2.0 / (double) n);
+ s = FastMath.sqrt(2.0 / n);
} else {
throw new MathIllegalStateException();
}