[1113] | 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 | |
---|
[922] | 15 | package de.ugoe.cs.autoquest.tasktrees.treeifc; |
---|
[439] | 16 | |
---|
| 17 | /** |
---|
| 18 | * TODO comment |
---|
| 19 | * |
---|
| 20 | * @version $Revision: $ $Date: 21.02.2012$ |
---|
| 21 | * @author 2012, last modified by $Author: patrick$ |
---|
| 22 | */ |
---|
[557] | 23 | public interface ITaskTreeBuilder { |
---|
[439] | 24 | |
---|
[557] | 25 | /** |
---|
[1114] | 26 | * |
---|
[557] | 27 | */ |
---|
| 28 | void addChild(ISequence parent, ITaskTreeNode child); |
---|
[439] | 29 | |
---|
[557] | 30 | /** |
---|
[1114] | 31 | * |
---|
[557] | 32 | */ |
---|
| 33 | void addChild(ISequence parent, int index, ITaskTreeNode child); |
---|
[439] | 34 | |
---|
[557] | 35 | /** |
---|
| 36 | * @param sequence |
---|
| 37 | * @param task |
---|
| 38 | */ |
---|
| 39 | void addChild(ISelection parent, ITaskTreeNode child); |
---|
[439] | 40 | |
---|
[557] | 41 | /** |
---|
| 42 | * |
---|
| 43 | * @param iteration |
---|
| 44 | * @param newChild |
---|
| 45 | */ |
---|
| 46 | void setChild(IIteration iteration, ITaskTreeNode newChild); |
---|
[439] | 47 | |
---|
[557] | 48 | /** |
---|
| 49 | * |
---|
| 50 | * @param parent |
---|
| 51 | * @param i |
---|
| 52 | */ |
---|
| 53 | void removeChild(ISequence parent, int index); |
---|
[439] | 54 | |
---|
[557] | 55 | /** |
---|
[1114] | 56 | * |
---|
[557] | 57 | * @param parent |
---|
| 58 | * @param i |
---|
| 59 | */ |
---|
| 60 | void removeChild(ISelection parent, ITaskTreeNode child); |
---|
[439] | 61 | |
---|
[557] | 62 | /** |
---|
| 63 | * |
---|
| 64 | * @param parent |
---|
| 65 | * @param i |
---|
| 66 | */ |
---|
| 67 | void setDescription(ITaskTreeNode node, String description); |
---|
[439] | 68 | |
---|
| 69 | } |
---|