trying to figure out how to hash viablely

3 files changed, 33 insertions, 1 deletions

diff --git a/src/main/java/org/schemaspy/model/GenericTree.java b/src/main/java/org/schemaspy/model/GenericTree.java
index cf5f9c0..5a44869 100644
--- a/src/main/java/org/schemaspy/model/GenericTree.java
+++ b/src/main/java/org/schemaspy/model/GenericTree.java
@@ -138,4 +138,6 @@ public class GenericTree {
         for(GenericTreeNode gtn : ref.getChildren())
             toArrayHelp(gtn, result);
     }
+
+
 }
diff --git a/src/main/java/org/schemaspy/model/ReportVector.java b/src/main/java/org/schemaspy/model/ReportVector.java
index 80da4a6..7b084b5 100644
--- a/src/main/java/org/schemaspy/model/ReportVector.java
+++ b/src/main/java/org/schemaspy/model/ReportVector.java
@@ -8,6 +8,7 @@ import java.util.Map;
 
 public class ReportVector {
     private ArrayList<StackTraceLine> stackTrace;
+    private int stackTraceHash;
     private int codeCoverage; //unused right now
     GenericTreeNode parentMutation;
 
@@ -17,6 +18,10 @@ public class ReportVector {
         stackTrace = new ArrayList<StackTraceLine>();
     }
 
+    public int getStackTraceHash() { return stackTraceHash; }
+
+    public void setStackTraceHash(int stackTraceHash) { this.stackTraceHash = stackTraceHash; }
+
     public ArrayList<StackTraceLine> getStackTrace() {
         return stackTrace;
     }
@@ -138,4 +143,29 @@ public class ReportVector {
         }
         return true;
     }
+
+    public int hashStackTrace(GenericTree mutationTree,GenericTreeNode currentNode)
+    {
+        int hash = 0;
+
+
+        for(GenericTreeNode gtn : mutationTree.toArray())
+        {
+            if(!gtn.getReportVector().getStackTrace().get(gtn.getReportVector().getStackTrace().size()-1).compare(currentNode.getReportVector().getStackTrace().get(currentNode.getReportVector().getStackTrace().size()-1)))
+                hash = gtn.getReportVector().getStackTraceHash();
+
+           for(StackTraceLine stl : gtn.getReportVector().getStackTrace())
+           {
+               for(StackTraceLine stlCurrent : currentNode.getReportVector().getStackTrace())
+               {
+
+                    if(!stl.compare(stlCurrent))
+                        hash = hash+5;
+
+                    if()
+
+               }
+           }
+        }
+    }
 }
diff --git a/src/main/java/org/schemaspy/model/Scorer.java b/src/main/java/org/schemaspy/model/Scorer.java
index de7a5fb..bcc1fdb 100644
--- a/src/main/java/org/schemaspy/model/Scorer.java
+++ b/src/main/java/org/schemaspy/model/Scorer.java
@@ -267,7 +267,7 @@ public class Scorer {
     {
         int i = 0;
         ReportVector rpv = gtn.getReportVector();
-        rpv.setStackTraceHash(rpv.hashStackTrace());
+        rpv.setStackTraceHash(rpv.hashStackTrace(mutationTree,gtn));
         predict = rpv.getStackTraceHash();
         for(GenericTreeNode gtnLoop : mutationTree.toArray())
         {