Repository: commons-math Updated Branches: refs/heads/MATH_3_X 9f148d41e -> 265ed5dd4
Fixed trailing whitespace. Project: http://git-wip-us.apache.org/repos/asf/commons-math/repo Commit: http://git-wip-us.apache.org/repos/asf/commons-math/commit/265ed5dd Tree: http://git-wip-us.apache.org/repos/asf/commons-math/tree/265ed5dd Diff: http://git-wip-us.apache.org/repos/asf/commons-math/diff/265ed5dd Branch: refs/heads/MATH_3_X Commit: 265ed5dd48d9ad028af8558160c40323f0415384 Parents: 9f148d4 Author: Luc Maisonobe <l...@apache.org> Authored: Mon Jul 27 09:57:39 2015 +0200 Committer: Luc Maisonobe <l...@apache.org> Committed: Mon Jul 27 09:57:39 2015 +0200 ---------------------------------------------------------------------- .../commons/math3/stat/inference/KolmogorovSmirnovTest.java | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/commons-math/blob/265ed5dd/src/main/java/org/apache/commons/math3/stat/inference/KolmogorovSmirnovTest.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/math3/stat/inference/KolmogorovSmirnovTest.java b/src/main/java/org/apache/commons/math3/stat/inference/KolmogorovSmirnovTest.java index 3f868b5..74bede9 100644 --- a/src/main/java/org/apache/commons/math3/stat/inference/KolmogorovSmirnovTest.java +++ b/src/main/java/org/apache/commons/math3/stat/inference/KolmogorovSmirnovTest.java @@ -934,10 +934,10 @@ public class KolmogorovSmirnovTest { } /** - * Fills a boolean array randomly with a fixed number of {@code true} values. - * The method uses a simplified version of the Fisher-Yates shuffle algorithm. + * Fills a boolean array randomly with a fixed number of {@code true} values. + * The method uses a simplified version of the Fisher-Yates shuffle algorithm. * By processing first the {@code true} values followed by the remaining {@code false} values - * less random numbers need to be generated. The method is optimized for the case + * less random numbers need to be generated. The method is optimized for the case * that the number of {@code true} values is larger than or equal to the number of * {@code false} values. *
