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 | * <p> |
---|
19 | * A temporal relationship is a node in a task model which is no leaf node. They are used to |
---|
20 | * structure the tasks in a task model into useful orders. A temporal relationship defines through |
---|
21 | * its type how its children can be executed to fulfill the task they represent themselves. E.g., |
---|
22 | * the task of filling out a form can be subdivided into several subtasks for filling out the |
---|
23 | * different elements of the. The task itself will define the order, in which the fill out process |
---|
24 | * can and must be done. |
---|
25 | * </p> |
---|
26 | * |
---|
27 | * @author Patrick Harms |
---|
28 | */ |
---|
29 | public interface ITemporalRelationship extends ITask { |
---|
30 | |
---|
31 | /** |
---|
32 | * <p> |
---|
33 | * returns an exact copy of this temporal relationship. The clone has the same id. Its children |
---|
34 | * are clones of the children of the cloned task. A call on the method {@link #equals(ITask)} |
---|
35 | * with the result of this method must return true. |
---|
36 | * </p> |
---|
37 | * |
---|
38 | * @return as described |
---|
39 | */ |
---|
40 | public ITemporalRelationship clone(); |
---|
41 | |
---|
42 | } |
---|