1 | // Copyright 2012 Georg-August-Universität Göttingen, Germany
|
---|
2 | //
|
---|
3 | // Licensed under the Apache License, Version 2.0 (the "License");
|
---|
4 | // you may not use this file except in compliance with the License.
|
---|
5 | // You may obtain a copy of the License at
|
---|
6 | //
|
---|
7 | // http://www.apache.org/licenses/LICENSE-2.0
|
---|
8 | //
|
---|
9 | // Unless required by applicable law or agreed to in writing, software
|
---|
10 | // distributed under the License is distributed on an "AS IS" BASIS,
|
---|
11 | // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
---|
12 | // See the License for the specific language governing permissions and
|
---|
13 | // limitations under the License.
|
---|
14 |
|
---|
15 | package de.ugoe.cs.autoquest.usability.rules.patterns.visitors;
|
---|
16 |
|
---|
17 | import de.ugoe.cs.autoquest.tasktrees.treeifc.IEventTask;
|
---|
18 | import de.ugoe.cs.autoquest.tasktrees.treeifc.IIteration;
|
---|
19 | import de.ugoe.cs.autoquest.tasktrees.treeifc.IOptional;
|
---|
20 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence;
|
---|
21 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask;
|
---|
22 | import de.ugoe.cs.autoquest.usability.rules.patterns.InteractionPattern;
|
---|
23 | import de.ugoe.cs.autoquest.usability.rules.patterns.InteractionPatternVisitor;
|
---|
24 | import de.ugoe.cs.autoquest.usability.tasktree.filters.TaskTypeFilter;
|
---|
25 |
|
---|
26 | /**
|
---|
27 | * <p>
|
---|
28 | * TODO comment
|
---|
29 | * </p>
|
---|
30 | *
|
---|
31 | * @author Alexander Deicke
|
---|
32 | */
|
---|
33 | public class ContainsInteractionPatternVisitor extends InteractionPatternVisitor {
|
---|
34 |
|
---|
35 | /**
|
---|
36 | * <p>
|
---|
37 | * TODO: comment
|
---|
38 | * </p>
|
---|
39 | *
|
---|
40 | * @param containsPattern
|
---|
41 | */
|
---|
42 | public ContainsInteractionPatternVisitor(InteractionPattern containsPattern, TaskTypeFilter taskType) {
|
---|
43 | this.containedPattern = containsPattern;
|
---|
44 | this.taskType = taskType;
|
---|
45 | }
|
---|
46 |
|
---|
47 | /* (non-Javadoc)
|
---|
48 | * @see de.ugoe.cs.autoquest.tasktrees.treeifc.NodeVisitor#visit(de.ugoe.cs.autoquest.tasktrees.treeifc.IIteration)
|
---|
49 | */
|
---|
50 | public void visit(IIteration iteration) {
|
---|
51 | checkTaskAndReturnIfPatternIsPresent(iteration.getMarkedTask());
|
---|
52 | }
|
---|
53 |
|
---|
54 | /* (non-Javadoc)
|
---|
55 | * @see de.ugoe.cs.autoquest.tasktrees.treeifc.TaskVisitor#visit(de.ugoe.cs.autoquest.tasktrees.treeifc.IOptional)
|
---|
56 | */
|
---|
57 | public void visit(IOptional optional) {
|
---|
58 | checkTaskAndReturnIfPatternIsPresent(optional.getMarkedTask());
|
---|
59 | }
|
---|
60 |
|
---|
61 | /* (non-Javadoc)
|
---|
62 | * @see de.ugoe.cs.autoquest.tasktrees.treeifc.NodeVisitor#visit(de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence)
|
---|
63 | */
|
---|
64 | public void visit(ISequence sequence) {
|
---|
65 | checkAllChildrenAndReturnIfPatternIsPresent(sequence);
|
---|
66 | }
|
---|
67 |
|
---|
68 | private void checkAllChildrenAndReturnIfPatternIsPresent(ISequence sequence) {
|
---|
69 | for (ITask child : sequence.getChildren()) {
|
---|
70 | if(checkTaskAndReturnIfPatternIsPresent(child)) {
|
---|
71 | this.present = true;
|
---|
72 | break;
|
---|
73 | }
|
---|
74 | }
|
---|
75 | }
|
---|
76 |
|
---|
77 | private boolean checkTaskAndReturnIfPatternIsPresent(ITask task) {
|
---|
78 | if(isEvent(task)) return false;
|
---|
79 | return this.containedPattern.containedIn(task);
|
---|
80 | }
|
---|
81 |
|
---|
82 | private boolean isEvent(ITask task) {
|
---|
83 | return task instanceof IEventTask;
|
---|
84 | }
|
---|
85 |
|
---|
86 | }
|
---|