commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From l..@apache.org
Subject svn commit: r917271 - /commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/interpolation/LoessInterpolator.java
Date Sun, 28 Feb 2010 19:38:15 GMT
Author: luc
Date: Sun Feb 28 19:38:15 2010
New Revision: 917271

URL: http://svn.apache.org/viewvc?rev=917271&view=rev
Log:
fixed javadoc

Modified:
    commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/interpolation/LoessInterpolator.java

Modified: commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/interpolation/LoessInterpolator.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/interpolation/LoessInterpolator.java?rev=917271&r1=917270&r2=917271&view=diff
==============================================================================
--- commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/interpolation/LoessInterpolator.java
(original)
+++ commons/proper/math/trunk/src/main/java/org/apache/commons/math/analysis/interpolation/LoessInterpolator.java
Sun Feb 28 19:38:15 2010
@@ -381,7 +381,7 @@
      * the same number of points closest to xval[i], ignoring zero weights.
      *
      * @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 bandwidthInterval a two-element array {left, right} such that: <p/>
      * <tt>(left==0 or xval[i] - xval[left-1] > xval[right] - xval[i])</tt>
@@ -409,7 +409,7 @@
      * Returns the smallest index j such that j > i && (j==weights.length || weights[j]
!= 0)
      * @param weights weights array
      * @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) {
         int j = i + 1;



Mime
View raw message