[1157] | 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.tasktrees.treeifc;
|
---|
| 16 |
|
---|
| 17 |
|
---|
| 18 | /**
|
---|
| 19 | * <p>
|
---|
[1213] | 20 | * This is an implementation of the visitor pattern. Through this, it is possible to effectively
|
---|
| 21 | * process a task model.
|
---|
[1157] | 22 | * </p>
|
---|
| 23 | *
|
---|
| 24 | * @author Alexander Deicke
|
---|
| 25 | */
|
---|
| 26 | public interface ITaskVisitor {
|
---|
| 27 |
|
---|
| 28 | /**
|
---|
[1213] | 29 | * <p>
|
---|
| 30 | * method called for each visited event task.
|
---|
| 31 | * </p>
|
---|
| 32 | *
|
---|
| 33 | * @param eventTask the event task to be processed
|
---|
[1191] | 34 | */
|
---|
[1213] | 35 | public void visit(IEventTask eventTask);
|
---|
[1157] | 36 |
|
---|
| 37 | /**
|
---|
[1213] | 38 | * <p>
|
---|
| 39 | * method called for each visited iteration.
|
---|
| 40 | * </p>
|
---|
| 41 | *
|
---|
| 42 | * @param iteration the iteration to be processed
|
---|
[1191] | 43 | */
|
---|
[1157] | 44 | public void visit(IIteration iteration);
|
---|
| 45 |
|
---|
| 46 | /**
|
---|
[1213] | 47 | * <p>
|
---|
| 48 | * method called for each visited optional.
|
---|
| 49 | * </p>
|
---|
| 50 | *
|
---|
| 51 | * @param optional the optional to be processed
|
---|
[1191] | 52 | */
|
---|
[1213] | 53 | public void visit(IOptional optional);
|
---|
| 54 |
|
---|
| 55 | /**
|
---|
| 56 | * <p>
|
---|
| 57 | * method called for each visited selection.
|
---|
| 58 | * </p>
|
---|
| 59 | *
|
---|
| 60 | * @param selection the selection to be processed
|
---|
| 61 | */
|
---|
[1157] | 62 | public void visit(ISelection selection);
|
---|
| 63 |
|
---|
| 64 | /**
|
---|
[1213] | 65 | * <p>
|
---|
| 66 | * method called for each visited sequence.
|
---|
| 67 | * </p>
|
---|
| 68 | *
|
---|
| 69 | * @param sequence the sequence to be processed
|
---|
[1191] | 70 | */
|
---|
[1157] | 71 | public void visit(ISequence sequence);
|
---|
| 72 |
|
---|
| 73 | /**
|
---|
[1213] | 74 | * <p>
|
---|
| 75 | * method called for each other kind of visited task (implemented to support future versions).
|
---|
| 76 | * </p>
|
---|
| 77 | *
|
---|
| 78 | * @param task the task to be processed
|
---|
[1157] | 79 | */
|
---|
| 80 | public void visit(ITask task);
|
---|
| 81 |
|
---|
| 82 | }
|
---|