Repository: commons-math Updated Branches: refs/heads/develop d731d1645 -> 085816b7c
Javadoc. Project: http://git-wip-us.apache.org/repos/asf/commons-math/repo Commit: http://git-wip-us.apache.org/repos/asf/commons-math/commit/bc93a9f7 Tree: http://git-wip-us.apache.org/repos/asf/commons-math/tree/bc93a9f7 Diff: http://git-wip-us.apache.org/repos/asf/commons-math/diff/bc93a9f7 Branch: refs/heads/develop Commit: bc93a9f76a9ffca55fec5b5ccba49505fd22f0ff Parents: d731d16 Author: Gilles <[email protected]> Authored: Tue May 17 13:08:50 2016 +0200 Committer: Gilles <[email protected]> Committed: Tue May 17 13:08:50 2016 +0200 ---------------------------------------------------------------------- .../apache/commons/math4/util/IntegerSequence.java | 14 ++++++++------ 1 file changed, 8 insertions(+), 6 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/commons-math/blob/bc93a9f7/src/main/java/org/apache/commons/math4/util/IntegerSequence.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/math4/util/IntegerSequence.java b/src/main/java/org/apache/commons/math4/util/IntegerSequence.java index 233ce3a..0ea1949 100644 --- a/src/main/java/org/apache/commons/math4/util/IntegerSequence.java +++ b/src/main/java/org/apache/commons/math4/util/IntegerSequence.java @@ -48,9 +48,10 @@ public class IntegerSequence { } /** - * Creates a sequence \( a_i, i < 0 <= n \) - * where \( a_i = start + i * step \) - * and \( n \) is such that \( a_n <= max \) and \( a_{n+1} > max \). + * Creates a sequence <code>a<sub>i</sub>, i < 0 < n</code> + * where <code>a<sub>i</sub> = start + i * step</code> + * and {@code n} is such that <code>a<sub>n</sub> <= max</code> + * and <code>a<sub>n+1</sub> > max</code>. * * @param start First value of the range. * @param max Last value of the range that satisfies the above @@ -78,9 +79,10 @@ public class IntegerSequence { private final int step; /** - * Creates a sequence \( a_i, i < 0 <= n \) - * where \( a_i = start + i * step \) - * and \( n \) is such that \( a_n <= max \) and \( a_{n+1} > max \). + * Creates a sequence <code>a<sub>i</sub>, i < 0 < n</code> + * where <code>a<sub>i</sub> = start + i * step</code> + * and {@code n} is such that <code>a<sub>n</sub> <= max</code> + * and <code>a<sub>n+1</sub> > max</code>. * * @param start First value of the range. * @param max Last value of the range that satisfies the above
