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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
// **********************************************************************
//
// Copyright (c) 2003-2006 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
package IceGrid.TreeNode;
import IceGrid.Model;
//
// A parent that holds a list of children
//
abstract class ListParent extends Parent
{
protected ListParent(String id, Model model, boolean root)
{
super(id, model, root);
}
protected ListParent(String id, Model model)
{
this(id, model, false);
}
protected void addDescriptor(Object descriptor)
{
_descriptors.add(descriptor);
}
protected void removeDescriptor(Object descriptor)
{
//
// A straight remove uses equals(), which is not the desired behavior
//
java.util.Iterator p = _descriptors.iterator();
while(p.hasNext())
{
if(descriptor == p.next())
{
p.remove();
break;
}
}
}
//
// Try to add this new element
//
void tryAdd(Object descriptor)
throws UpdateFailedException
{
_descriptors.add(descriptor);
java.util.List newChildren = new java.util.LinkedList();
java.util.List list = _parent.findAllInstances(this);
java.util.Iterator p = list.iterator();
while(p.hasNext())
{
ListParent container = (ListParent)p.next();
try
{
newChildren.add(container.addNewChild(descriptor));
}
catch(UpdateFailedException e)
{
//
// Rollback
//
java.util.Iterator q = newChildren.iterator();
p = list.iterator();
while(q.hasNext())
{
container = (ListParent)p.next();
container.removeChild((CommonBase)q.next());
}
removeDescriptor(descriptor);
throw e;
}
}
}
//
// Try to update this child
//
void tryUpdate(CommonBase child)
throws UpdateFailedException
{
java.util.List list = _parent.findAllInstances(this);
Object descriptor = child.getDescriptor();
java.util.List backupList = new java.util.Vector();
java.util.List children = new java.util.Vector();
java.util.List editables = new java.util.LinkedList();
java.util.Iterator p = list.iterator();
while(p.hasNext())
{
ListParent parent = (ListParent)p.next();
try
{
child = parent.findChildWithDescriptor(descriptor);
backupList.add(parent.rebuildChild(child, editables));
children.add(child);
}
catch(UpdateFailedException e)
{
for(int i = backupList.size() - 1; i >= 0; --i)
{
parent = (ListParent)list.get(i);
child = (CommonBase)children.get(i);
parent.restoreChild(child, backupList.get(i));
}
throw e;
}
}
//
// Success
//
p = editables.iterator();
while(p.hasNext())
{
Editable editable = (Editable)p.next();
editable.markModified();
}
}
boolean destroyChild(CommonBase child)
{
if(child.isEphemeral())
{
removeChild(child, true);
return true;
}
else
{
if(_model.canUpdate())
{
Object descriptor = child.getDescriptor();
removeDescriptor(descriptor);
getEditable().markModified();
//
// List of Services, Adapters etc
//
java.util.List list = _parent.findAllInstances(this);
java.util.Iterator p = list.iterator();
while(p.hasNext())
{
ListParent parent = (ListParent)p.next();
parent.removeChild(
parent.findChildWithDescriptor(descriptor),
true);
}
return true;
}
else
{
return false;
}
}
}
protected java.util.List _descriptors;
}
|