[1150] | 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 |
|
---|
[1152] | 17 | import de.ugoe.cs.autoquest.tasktrees.treeifc.IEventTask;
|
---|
[1150] | 18 | import de.ugoe.cs.autoquest.tasktrees.treeifc.IIteration;
|
---|
| 19 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence;
|
---|
[1152] | 20 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask;
|
---|
[1204] | 21 | import de.ugoe.cs.autoquest.usability.rules.patterns.InteractionPattern;
|
---|
| 22 | import de.ugoe.cs.autoquest.usability.rules.patterns.InteractionPatternVisitor;
|
---|
| 23 | import de.ugoe.cs.autoquest.usability.tasktree.filters.TaskTypeFilter;
|
---|
[1150] | 24 |
|
---|
| 25 | /**
|
---|
| 26 | * <p>
|
---|
| 27 | * TODO comment
|
---|
| 28 | * </p>
|
---|
| 29 | *
|
---|
| 30 | * @author Alexander Deicke
|
---|
| 31 | */
|
---|
[1204] | 32 | public class ContainsInteractionPatternVisitor extends InteractionPatternVisitor {
|
---|
[1150] | 33 |
|
---|
| 34 | /**
|
---|
| 35 | * <p>
|
---|
| 36 | * TODO: comment
|
---|
| 37 | * </p>
|
---|
| 38 | *
|
---|
| 39 | * @param containsPattern
|
---|
| 40 | */
|
---|
[1204] | 41 | public ContainsInteractionPatternVisitor(InteractionPattern containsPattern, TaskTypeFilter taskType) {
|
---|
[1150] | 42 | this.containedPattern = containsPattern;
|
---|
[1204] | 43 | this.taskType = taskType;
|
---|
[1150] | 44 | }
|
---|
| 45 |
|
---|
| 46 | /* (non-Javadoc)
|
---|
| 47 | * @see de.ugoe.cs.autoquest.tasktrees.treeifc.NodeVisitor#visit(de.ugoe.cs.autoquest.tasktrees.treeifc.IIteration)
|
---|
| 48 | */
|
---|
| 49 | public void visit(IIteration iteration) {
|
---|
[1152] | 50 | checkTaskAndReturnIfPatternIsPresent(iteration.getMarkedTask());
|
---|
[1150] | 51 | }
|
---|
| 52 |
|
---|
| 53 | /* (non-Javadoc)
|
---|
| 54 | * @see de.ugoe.cs.autoquest.tasktrees.treeifc.NodeVisitor#visit(de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence)
|
---|
| 55 | */
|
---|
| 56 | public void visit(ISequence sequence) {
|
---|
| 57 | checkAllChildrenAndReturnIfPatternIsPresent(sequence);
|
---|
| 58 | }
|
---|
| 59 |
|
---|
[1152] | 60 | private void checkAllChildrenAndReturnIfPatternIsPresent(ISequence sequence) {
|
---|
| 61 | for (ITask child : sequence.getChildren()) {
|
---|
| 62 | if(checkTaskAndReturnIfPatternIsPresent(child)) {
|
---|
[1161] | 63 | this.present = true;
|
---|
[1150] | 64 | break;
|
---|
| 65 | }
|
---|
| 66 | }
|
---|
| 67 | }
|
---|
| 68 |
|
---|
[1152] | 69 | private boolean checkTaskAndReturnIfPatternIsPresent(ITask task) {
|
---|
[1161] | 70 | if(isEvent(task)) return false;
|
---|
| 71 | return this.containedPattern.containedIn(task);
|
---|
[1150] | 72 | }
|
---|
[1152] | 73 |
|
---|
| 74 | private boolean isEvent(ITask task) {
|
---|
| 75 | return task instanceof IEventTask;
|
---|
| 76 | }
|
---|
[1150] | 77 |
|
---|
| 78 | }
|
---|