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