commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From er...@apache.org
Subject svn commit: r1371264 - /commons/proper/math/trunk/src/main/java/org/apache/commons/math3/optimization/direct/PowellOptimizer.java
Date Thu, 09 Aug 2012 15:55:19 GMT
Author: erans
Date: Thu Aug  9 15:55:18 2012
New Revision: 1371264

URL: http://svn.apache.org/viewvc?rev=1371264&view=rev
Log:
Code and javadoc cleanup.

Modified:
    commons/proper/math/trunk/src/main/java/org/apache/commons/math3/optimization/direct/PowellOptimizer.java

Modified: commons/proper/math/trunk/src/main/java/org/apache/commons/math3/optimization/direct/PowellOptimizer.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math3/optimization/direct/PowellOptimizer.java?rev=1371264&r1=1371263&r2=1371264&view=diff
==============================================================================
--- commons/proper/math/trunk/src/main/java/org/apache/commons/math3/optimization/direct/PowellOptimizer.java
(original)
+++ commons/proper/math/trunk/src/main/java/org/apache/commons/math3/optimization/direct/PowellOptimizer.java
Thu Aug  9 15:55:18 2012
@@ -211,7 +211,6 @@ public class PowellOptimizer
     /**
      * Compute a new point (in the original space) and a new direction
      * vector, resulting from the line search.
-     * The parameters {@code p} and {@code d} will be changed in-place.
      *
      * @param p Point used in the line search.
      * @param d Direction used in the line search.
@@ -223,13 +222,17 @@ public class PowellOptimizer
                                             double[] d,
                                             double optimum) {
         final int n = p.length;
-        final double[][] result = new double[2][n];
-        final double[] nP = result[0];
-        final double[] nD = result[1];
+        final double[] nP = new double[n];
+        final double[] nD = new double[n];
         for (int i = 0; i < n; i++) {
             nD[i] = d[i] * optimum;
             nP[i] = p[i] + nD[i];
         }
+
+        final double[][] result = new double[2][];
+        result[0] = nP;
+        result[1] = nD;
+
         return result;
     }
 



Mime
View raw message