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

fixed javadoc 

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@917271 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Luc Maisonobe 2010-02-28 19:38:15 +00:00
parent 1c9a550569
commit 0ff118952a
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/main/java/org/apache/commons/math/analysis/interpolation/LoessInterpolator.java
View File

@ -381,7 +381,7 @@ public class LoessInterpolator
* the same number of points closest to xval[i], ignoring zero weights. * the same number of points closest to xval[i], ignoring zero weights.
* *
* @param xval arguments array * @param xval arguments array
* @param xval weights array * @param weights weights array
* @param i the index around which the new interval should be computed * @param i the index around which the new interval should be computed
* @param bandwidthInterval a two-element array {left, right} such that: <p/> * @param bandwidthInterval a two-element array {left, right} such that: <p/>
* <tt>(left==0 or xval[i] - xval[left-1] > xval[right] - xval[i])</tt> * <tt>(left==0 or xval[i] - xval[left-1] > xval[right] - xval[i])</tt>
@ -409,7 +409,7 @@ public class LoessInterpolator
* Returns the smallest index j such that j > i && (j==weights.length || weights[j] != 0) * Returns the smallest index j such that j > i && (j==weights.length || weights[j] != 0)
* @param weights weights array * @param weights weights array
* @param i the index from which to start search; must be < weights.length * @param i the index from which to start search; must be < weights.length
* @return the smallest index j such that j > i && (j==weights.length || weights[j] != 0) * @return the smallest index j such that j > i && (j==weights.length || weights[j] != 0)
*/ */
private static int nextNonzero(final double[] weights, final int i) { private static int nextNonzero(final double[] weights, final int i) {
int j = i + 1; int j = i + 1;