Changeset 2030

Timestamp:

07/30/15 14:23:54 (9 years ago)

Author:

pharms

Message:

• moved utility method to identify most prominent tasks to central location

File:

• trunk/autoquest-core-tasktrees/src/main/java/de/ugoe/cs/autoquest/tasktrees/treeifc/TaskTreeUtils.java (modified) (2 diffs)

trunk/autoquest-core-tasktrees/src/main/java/de/ugoe/cs/autoquest/tasktrees/treeifc/TaskTreeUtils.java

@@ -14 +14 @@
 
 package de.ugoe.cs.autoquest.tasktrees.treeifc;
+
+import java.util.Collection;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
 
 /**
@@ -45 +53 @@
     }
 
+    /**
+     *
+     */
+    public static Set<ISequence> getMostProminentTasks(ITaskModel        model,
+                                                       Collection<ITask> tasks)
+    {
+        List<ISequence> sequences = new LinkedList<>();
+        
+        for (ITask task : tasks) {
+            if (task instanceof ISequence) {
+                sequences.add((ISequence) task);
+            }
+        }
+        
+        return getMostProminentSequences(model, sequences);
+    }
+
+    /**
+     *
+     */
+    public static Set<ISequence> getMostProminentSequences(ITaskModel            model,
+                                                           Collection<ISequence> tasks)
+    {
+        Map<Integer, List<ISequence>> sortedSequences = new HashMap<>();
+        
+        int maxCoverage = 0;
+        
+        for (ITask task : tasks) {
+            int coveredEvents =
+                    model.getTaskInfo((ISequence) task).getMeasureValue(TaskMetric.EVENT_COVERAGE);
+
+            List<ISequence> sequencesWithSameCoverage = sortedSequences.get(coveredEvents);
+
+            if (sequencesWithSameCoverage == null) {
+                sequencesWithSameCoverage = new LinkedList<>();
+                sortedSequences.put(coveredEvents, sequencesWithSameCoverage);
+            }
+
+            sequencesWithSameCoverage.add((ISequence) task);
+
+            maxCoverage = Math.max(maxCoverage, coveredEvents);
+        }
+        
+        Set<ISequence> result = new HashSet<>();
+        
+        for (int i = maxCoverage; i > 0; i--) {
+            List<ISequence> sequencesWithSameCoverage = sortedSequences.get(i);
+            
+            if (sequencesWithSameCoverage != null) {
+                result.addAll(sequencesWithSameCoverage);
+                
+                if (result.size() * 5 >= tasks.size()) {
+                    break;
+                }
+            }
+        }
+        
+        return result;
+    }
     
     /**