Changeset 1152 for trunk/autoquest-core-usability-evaluation/src/main/java/de/ugoe/cs/autoquest/usability/rules/patterns/visitors

Timestamp:

04/08/13 16:50:21 (11 years ago)

Author:

pharms

Message:

• complete refactoring of task tree model with a separation of task models and task instances

Location:

trunk/autoquest-core-usability-evaluation/src/main/java/de/ugoe/cs/autoquest/usability/rules/patterns/visitors

Files:

• ContainsEventVisitor.java (modified) (4 diffs)
• ContainsPatternVisitor.java (modified) (4 diffs)
• EndsWithEventVisitor.java (modified) (1 diff)
• EndsWithPatternVisitor.java (modified) (3 diffs)
• StartsWithEventVisitor.java (modified) (1 diff)
• StartsWithPatternVisitor.java (modified) (3 diffs)

trunk/autoquest-core-usability-evaluation/src/main/java/de/ugoe/cs/autoquest/usability/rules/patterns/visitors/ContainsEventVisitor.java

@@ -19 +19 @@
 import de.ugoe.cs.autoquest.tasktrees.treeifc.IIteration;
 import de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence;
-import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask;
 import de.ugoe.cs.autoquest.usability.rules.patterns.UsagePatternVisitor;
 import de.ugoe.cs.autoquest.usability.tasktree.filters.EventTypeFilter;
@@ -47 +47 @@
      */
     public void visit(IIteration iteration) {
-        checkAllChildrenAndReturnIfPatternIsPresent(iteration.getChildren());
+        checkTaskAndReturnIfPatternIsPresent(iteration.getMarkedTask());
     }
 
@@ -57 +57 @@
     }
     
-    private void checkAllChildrenAndReturnIfPatternIsPresent(List<ITaskTreeNode> children) {
-        for(ITaskTreeNode node : children) {
-            node.accept(this);
-            if(this.present) {
+    private void checkAllChildrenAndReturnIfPatternIsPresent(List<ITask> children) {
+        for (ITask task : children) {
+            if (checkTaskAndReturnIfPatternIsPresent(task)) {
                 break;
             }
@@ -66 +65 @@
     }
 
+    /**
+     *
+     */
+    private boolean checkTaskAndReturnIfPatternIsPresent(ITask task) {
+        task.accept(this);
+        return this.present;
+    }
 }

trunk/autoquest-core-usability-evaluation/src/main/java/de/ugoe/cs/autoquest/usability/rules/patterns/visitors/ContainsPatternVisitor.java

@@ -15 +15 @@
 package de.ugoe.cs.autoquest.usability.rules.patterns.visitors;
 
+import de.ugoe.cs.autoquest.tasktrees.treeifc.IEventTask;
 import de.ugoe.cs.autoquest.tasktrees.treeifc.IIteration;
 import de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence;
-import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTree;
-import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask;
+import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskModel;
 import de.ugoe.cs.autoquest.usability.rules.patterns.UsagePattern;
 import de.ugoe.cs.autoquest.usability.rules.patterns.UsagePatternVisitor;
@@ -47 +48 @@
      */
     public void visit(IIteration iteration) {
-        checkAllChildrenAndReturnIfPatternIsPresent(iteration);
+        checkTaskAndReturnIfPatternIsPresent(iteration.getMarkedTask());
 
     }
@@ -59 +60 @@
     }
     
-    private void checkAllChildrenAndReturnIfPatternIsPresent(ITaskTreeNode node) {
-        for(ITaskTreeNode child : node.getChildren()) {
-            ITaskTree taskTree;
-            if(isEvent(child)) {
-                taskTree = PatternsVisitorUtil.createTaskTreeFromNode(node);
-            } else {
-                taskTree = PatternsVisitorUtil.createTaskTreeFromNode(child);
-            }
-            this.present = containedPattern.containedIn(taskTree); 
-            if(this.present) {
+    private void checkAllChildrenAndReturnIfPatternIsPresent(ISequence sequence) {
+        for (ITask child : sequence.getChildren()) {
+            if(checkTaskAndReturnIfPatternIsPresent(child)) {
                 break;
             }
@@ -74 +68 @@
     }
     
-    private boolean isEvent(ITaskTreeNode firstNode) {
-        return firstNode.getChildren().isEmpty();
+    private boolean checkTaskAndReturnIfPatternIsPresent(ITask task) {
+        ITaskModel taskModel = PatternsVisitorUtil.createTaskModelFromNode(task);
+        this.present = containedPattern.containedIn(taskModel); 
+    }
+    
+    private boolean isEvent(ITask task) {
+        return task instanceof IEventTask;
     }
 

trunk/autoquest-core-usability-evaluation/src/main/java/de/ugoe/cs/autoquest/usability/rules/patterns/visitors/EndsWithEventVisitor.java

@@ -45 +45 @@
      */
     public void visit(IIteration iteration) {
-        PatternsVisitorUtil.lastNodeOf(iteration.getChildren()).accept(this);
+        iteration.getMarkedTask().accept(this);
     }
 

trunk/autoquest-core-usability-evaluation/src/main/java/de/ugoe/cs/autoquest/usability/rules/patterns/visitors/EndsWithPatternVisitor.java

@@ -15 +15 @@
 package de.ugoe.cs.autoquest.usability.rules.patterns.visitors;
 
+import de.ugoe.cs.autoquest.tasktrees.treeifc.IEventTask;
 import de.ugoe.cs.autoquest.tasktrees.treeifc.IIteration;
 import de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence;
-import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTree;
-import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask;
+import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskModel;
 import de.ugoe.cs.autoquest.usability.rules.patterns.UsagePattern;
 import de.ugoe.cs.autoquest.usability.rules.patterns.UsagePatternVisitor;
@@ -47 +48 @@
      */
     public void visit(IIteration iteration) {
-        ITaskTree taskTree = PatternsVisitorUtil.createTaskTreeFromNode(iteration);
-        this.present = containedPattern.containedIn(taskTree); 
+        ITaskModel taskModel = PatternsVisitorUtil.createTaskModelFromNode(iteration);
+        this.present = containedPattern.containedIn(taskModel); 
 
     }
@@ -56 +57 @@
      */
     public void visit(ISequence sequence) {
-        ITaskTreeNode lastNode = PatternsVisitorUtil.lastNodeOf(sequence.getChildren());
-        ITaskTree taskTree;
-        if(isEvent(lastNode)) {
-            taskTree = PatternsVisitorUtil.createTaskTreeFromNode(sequence);
+        ITask lastTask = PatternsVisitorUtil.lastNodeOf(sequence.getChildren());
+        ITaskModel taskModel;
+        if(isEvent(lastTask)) {
+            taskModel = PatternsVisitorUtil.createTaskModelFromNode(sequence);
         } else {
-            taskTree = PatternsVisitorUtil.createTaskTreeFromNode(lastNode);
+            taskModel = PatternsVisitorUtil.createTaskModelFromNode(lastTask);
         }
-        this.present = containedPattern.containedIn(taskTree);      
+        this.present = containedPattern.containedIn(taskModel);      
     }
 
-    private boolean isEvent(ITaskTreeNode firstNode) {
-        return firstNode.getChildren().isEmpty();
+    private boolean isEvent(ITask lastTask) {
+        return lastTask instanceof IEventTask;
     }
 

trunk/autoquest-core-usability-evaluation/src/main/java/de/ugoe/cs/autoquest/usability/rules/patterns/visitors/StartsWithEventVisitor.java

@@ -45 +45 @@
      */
     public void visit(IIteration iteration) {
-        PatternsVisitorUtil.firstNodeOf(iteration.getChildren()).accept(this);
+        iteration.getMarkedTask().accept(this);
     }
     

trunk/autoquest-core-usability-evaluation/src/main/java/de/ugoe/cs/autoquest/usability/rules/patterns/visitors/StartsWithPatternVisitor.java

@@ -15 +15 @@
 package de.ugoe.cs.autoquest.usability.rules.patterns.visitors;
 
+import de.ugoe.cs.autoquest.tasktrees.treeifc.IEventTask;
 import de.ugoe.cs.autoquest.tasktrees.treeifc.IIteration;
 import de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence;
-import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTree;
-import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTreeNode;
+import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask;
+import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskModel;
 import de.ugoe.cs.autoquest.usability.rules.patterns.UsagePattern;
 import de.ugoe.cs.autoquest.usability.rules.patterns.UsagePatternVisitor;
@@ -47 +48 @@
      */
     public void visit(IIteration iteration) {
-        ITaskTree taskTree = PatternsVisitorUtil.createTaskTreeFromNode(iteration);
-        this.present = containedPattern.containedIn(taskTree);  
+        ITaskModel taskModel = PatternsVisitorUtil.createTaskModelFromNode(iteration);
+        this.present = containedPattern.containedIn(taskModel);  
     }
 
@@ -55 +56 @@
      */
     public void visit(ISequence sequence) {
-        ITaskTreeNode firstNode = PatternsVisitorUtil.firstNodeOf(sequence.getChildren());
-        ITaskTree taskTree;
-        if(isEvent(firstNode)) {
-            taskTree = PatternsVisitorUtil.createTaskTreeFromNode(sequence);
+        ITask firstTask = PatternsVisitorUtil.firstNodeOf(sequence.getChildren());
+        ITaskModel taskModel;
+        if(isEvent(firstTask)) {
+            taskModel = PatternsVisitorUtil.createTaskModelFromNode(sequence);
         } else {
-            taskTree = PatternsVisitorUtil.createTaskTreeFromNode(firstNode);
+            taskModel = PatternsVisitorUtil.createTaskModelFromNode(firstTask);
         }
-        this.present = containedPattern.containedIn(taskTree);      
+        this.present = containedPattern.containedIn(taskModel);      
     }
 
-    private boolean isEvent(ITaskTreeNode firstNode) {
-        return firstNode.getChildren().isEmpty();
+    private boolean isEvent(ITask firstTask) {
+        return firstTask instanceof IEventTask;
     }