| 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.IIteration;
|
|---|
| 18 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence;
|
|---|
| 19 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTree;
|
|---|
| 20 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskTreeNode;
|
|---|
| 21 | import de.ugoe.cs.autoquest.usability.rules.patterns.UsagePattern;
|
|---|
| 22 | import de.ugoe.cs.autoquest.usability.rules.patterns.UsagePatternVisitor;
|
|---|
| 23 | import de.ugoe.cs.autoquest.usability.util.PatternsVisitorUtil;
|
|---|
| 24 |
|
|---|
| 25 | /**
|
|---|
| 26 | * <p>
|
|---|
| 27 | * TODO comment
|
|---|
| 28 | * </p>
|
|---|
| 29 | *
|
|---|
| 30 | * @author Alexander Deicke
|
|---|
| 31 | */
|
|---|
| 32 | public class EndsWithPatternVisitor extends UsagePatternVisitor {
|
|---|
| 33 |
|
|---|
| 34 | /**
|
|---|
| 35 | * <p>
|
|---|
| 36 | * TODO: comment
|
|---|
| 37 | * </p>
|
|---|
| 38 | *
|
|---|
| 39 | * @param endsWithPattern
|
|---|
| 40 | */
|
|---|
| 41 | public EndsWithPatternVisitor(UsagePattern endsWithPattern) {
|
|---|
| 42 | this.containedPattern = endsWithPattern;
|
|---|
| 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) {
|
|---|
| 49 | ITaskTree taskTree = PatternsVisitorUtil.createTaskTreeFromNode(iteration);
|
|---|
| 50 | this.present = containedPattern.containedIn(taskTree);
|
|---|
| 51 |
|
|---|
| 52 | }
|
|---|
| 53 |
|
|---|
| 54 | /* (non-Javadoc)
|
|---|
| 55 | * @see de.ugoe.cs.autoquest.tasktrees.treeifc.NodeVisitor#visit(de.ugoe.cs.autoquest.tasktrees.treeifc.ISequence)
|
|---|
| 56 | */
|
|---|
| 57 | public void visit(ISequence sequence) {
|
|---|
| 58 | ITaskTreeNode lastNode = PatternsVisitorUtil.lastNodeOf(sequence.getChildren());
|
|---|
| 59 | ITaskTree taskTree;
|
|---|
| 60 | if(isEvent(lastNode)) {
|
|---|
| 61 | taskTree = PatternsVisitorUtil.createTaskTreeFromNode(sequence);
|
|---|
| 62 | } else {
|
|---|
| 63 | taskTree = PatternsVisitorUtil.createTaskTreeFromNode(lastNode);
|
|---|
| 64 | }
|
|---|
| 65 | this.present = containedPattern.containedIn(taskTree);
|
|---|
| 66 | }
|
|---|
| 67 |
|
|---|
| 68 | private boolean isEvent(ITaskTreeNode firstNode) {
|
|---|
| 69 | return firstNode.getChildren().isEmpty();
|
|---|
| 70 | }
|
|---|
| 71 |
|
|---|
| 72 | }
|
|---|
