Typos.
Project: http://git-wip-us.apache.org/repos/asf/commons-math/repo Commit: http://git-wip-us.apache.org/repos/asf/commons-math/commit/0956e2d2 Tree: http://git-wip-us.apache.org/repos/asf/commons-math/tree/0956e2d2 Diff: http://git-wip-us.apache.org/repos/asf/commons-math/diff/0956e2d2 Branch: refs/heads/master Commit: 0956e2d2338531a96f2ff7d4ab405acc1b18421e Parents: d198cc8 Author: Gilles <er...@apache.org> Authored: Wed Dec 14 16:02:53 2016 +0100 Committer: Gilles <er...@apache.org> Committed: Wed Dec 14 17:38:42 2016 +0100 ---------------------------------------------------------------------- .../RandomUtilsDataGeneratorAbstractTest.java | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/commons-math/blob/0956e2d2/src/test/java/org/apache/commons/math4/random/RandomUtilsDataGeneratorAbstractTest.java ---------------------------------------------------------------------- diff --git a/src/test/java/org/apache/commons/math4/random/RandomUtilsDataGeneratorAbstractTest.java b/src/test/java/org/apache/commons/math4/random/RandomUtilsDataGeneratorAbstractTest.java index dedf278..4c8b30f 100644 --- a/src/test/java/org/apache/commons/math4/random/RandomUtilsDataGeneratorAbstractTest.java +++ b/src/test/java/org/apache/commons/math4/random/RandomUtilsDataGeneratorAbstractTest.java @@ -242,34 +242,34 @@ public abstract class RandomUtilsDataGeneratorAbstractTest { } @Test - public void testNextUniformUniformPositiveBounds() { + public void testNextUniformPositiveBounds() { for (int i = 0; i < 5; i++) { - checkNextUniformUniform(0, 10); + checkNextUniform(0, 10); } } @Test - public void testNextUniformUniformNegativeToPositiveBounds() { + public void testNextUniformNegativeToPositiveBounds() { for (int i = 0; i < 5; i++) { - checkNextUniformUniform(-3, 5); + checkNextUniform(-3, 5); } } @Test - public void testNextUniformUniformNegaiveBounds() { + public void testNextUniformNegativeBounds() { for (int i = 0; i < 5; i++) { - checkNextUniformUniform(-7, -3); + checkNextUniform(-7, -3); } } @Test - public void testNextUniformUniformMaximalInterval() { + public void testNextUniformMaximalInterval() { for (int i = 0; i < 5; i++) { - checkNextUniformUniform(-Double.MAX_VALUE, Double.MAX_VALUE); + checkNextUniform(-Double.MAX_VALUE, Double.MAX_VALUE); } } - private void checkNextUniformUniform(double min, double max) { + private void checkNextUniform(double min, double max) { // Set up bin bounds - min, binBound[0], ..., binBound[binCount-2], max final int binCount = 5; final double binSize = max / binCount - min/binCount; // Prevent overflow in extreme value case
