tested gradientfunction with daikon

Daikon.hs

+-- Contains all code used for running the daikon experiments
 module Daikon where
 
 import Control.Monad
@@ -6,7 +7,7 @@ import System.Directory
 import Data.List
 
 testNr :: Int
-testNr = 1
+testNr = 2
 
 source, pathDir, packageDir, methodName :: String
 source = case testNr of

Results/Daikon results.txt

@@ -2,4 +2,10 @@ iterator:
 5 mutations with error found: 2, 3, 4, 5, 32
 4 mutations with error found not detected by wlp: 2, 3, 4, 5
 2 mutations with unterminated calls: 1 and 31
-1 mutation stuck in a loop: 35
+1 mutation stuck in a loop: 35
\ No newline at end of file
+
+GradientFunction:
+5 mutations with error found: 2, 9, 13, 14, 22
+4 mutations with error found not detected by wlp: 9, 13, 14, 22
+0 mutations with unterminated calls
+0 mutations stuck in a loop
\ No newline at end of file

Tests/GradientFunction.java

@@ -47,14 +47,14 @@ public class GradientFunction implements MultivariateVectorFunction {
         }
 
         // compute the derivatives
-        final DerivativeStructure dsY = this.f.value(dsX);
+        final DerivativeStructure dsY = null; // this.f.value(dsX);
 
         // extract the gradient
         final double[] y = new double[point.length];
         final int[] orders = new int[point.length];
         for (int j = 0; j < point.length; ++j) {
             orders[j] = 1;
-            y[j] = dsY.getPartialDerivative(orders);
+            y[j] = 1; //dsY.getPartialDerivative(orders);
             orders[j] = 0;
         }