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