Changeset 1760 for branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/temporalrelation/SequenceForTaskDetectionRuleAlignment.java

Timestamp:

09/23/14 13:55:37 (10 years ago)

Author:

rkrimmel

Message:

Memory improvement and bugs

File:

• branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/temporalrelation/SequenceForTaskDetectionRuleAlignment.java (modified) (5 diffs)

branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/temporalrelation/SequenceForTaskDetectionRuleAlignment.java

@@ -16 +16 @@
 
 import java.io.Serializable;
+import java.util.ArrayDeque;
 import java.util.ArrayList;
 import java.util.Collections;
@@ -167 +168 @@
             appData.getStopWatch().stop("task replacement");
             appData.getStopWatch().stop("whole loop");
-            // appData.getStopWatch().dumpStatistics(System.out);
+            appData.getStopWatch().dumpStatistics(System.out);
             appData.getStopWatch().reset();
 
-            // } while (appData.detectedAndReplacedTasks()||iteration < maxIterations);
-        }
-        while (iteration < maxIterations);
+        } while (appData.detectedAndReplacedTasks());
+        //} while (iteration < maxIterations);
         Console.println("created " + appData.getResult().getNewlyCreatedTasks().size() +
             " new tasks and " + appData.getResult().getNewlyCreatedTaskInstances().size() +
@@ -666 +666 @@
             }
         }
+        appData.matchseqs =null;
     }
 
@@ -1123 +1124 @@
         private final ObjectDistanceSubstitionMatrix submat;
 
-        private LinkedList<PlannedReplacement>[] plannedReplacements;
+        private ArrayDeque<PlannedReplacement>[] plannedReplacements;
 
         /** The list of all found matches */
@@ -1173 +1174 @@
 
         private void initializeQueues(int size) {
-            plannedReplacements = new LinkedList[size];
+            plannedReplacements = new ArrayDeque[size];
             for (int i = 0; i < size; i++) {
-                plannedReplacements[i] = new LinkedList<PlannedReplacement>();
-            }
-        }
-
-        public Queue<PlannedReplacement>[] getPlannedReplacements() {
+                plannedReplacements[i] = new ArrayDeque<PlannedReplacement>(30);
+            }
+        }
+
+        public ArrayDeque<PlannedReplacement>[] getPlannedReplacements() {
             return plannedReplacements;
         }