blob: 59a24d1256ad65e4583248400df3c62df9c26b74 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/*****************************************************************************
* Copyright (c) 2008 CEA LIST.
*
*
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* Chokri Mraidha (CEA LIST) Chokri.Mraidha@cea.fr - Initial API and implementation
* Patrick Tessier (CEA LIST) Patrick.Tessier@cea.fr - modification
*
*****************************************************************************/
package org.eclipse.papyrus.profile.tree.objects;
import java.util.ArrayList;
import org.eclipse.emf.transaction.TransactionalEditingDomain;
import org.eclipse.uml2.uml.Element;
// TODO: Auto-generated Javadoc
/**
* The Class ParentTreeObject.
*/
public abstract class ParentTreeObject extends TreeObject {
/**
* The children.
*/
protected ArrayList children;
/**
* The Constructor.
*
* @param element
* the element
* @param parent
* the parent
*/
public ParentTreeObject(ParentTreeObject parent, Element element, TransactionalEditingDomain domain) {
super(parent, element, domain);
}
/**
* Adds the child.
*
* @param child
* the child
*/
public void addChild(TreeObject child) {
children.add(child);
}
/**
* Removes the child.
*
* @param child
* the child
*/
public void removeChild(TreeObject child) {
children.remove(child);
}
/**
* Move child up.
*
* @param child
* the child
*/
public void moveChildUp(TreeObject child) {
if(children == null) {
return;
}
int index = children.indexOf(child);
if(index < 1) {
// do nothing
return;
}
TreeObject tmp = (TreeObject)children.get(index - 1);
children.set(index - 1, child);
children.set(index, tmp);
}
/**
* Move child down.
*
* @param child
* the child
*/
public void moveChildDown(TreeObject child) {
if(children == null) {
return;
}
int index = children.indexOf(child);
if((index == -1) || (index >= children.size() - 1)) {
// do nothing
return;
}
TreeObject tmp = (TreeObject)children.get(index + 1);
children.set(index + 1, child);
children.set(index, tmp);
}
/**
* Gets the children.
*
* @return the children
*/
public TreeObject[] getChildren() {
if (children == null) {
children = new ArrayList();
createChildren();
}
return (TreeObject[])children.toArray(new TreeObject[children.size()]);
}
/* subclasses should override this method and add the child nodes */
/**
* Creates the children.
*/
protected abstract void createChildren();
}
|
