Skip to main content
aboutsummaryrefslogtreecommitdiffstats
blob: efc99c9c47560a08037f7f8cc8f8716d89fe63f3 (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
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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
/***************************************************************************
 * Copyright (c) 2004-2007 Eike Stepper, Germany.
 * 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:
 *    Eike Stepper - initial API and implementation
 **************************************************************************/
package org.eclipse.net4j.ui.wizards;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;

/**
 * @author Eike Stepper
 */
public abstract class CompoundStep extends Step implements List<Step>
{
  private List<Step> children = new ArrayList(0);

  public CompoundStep()
  {
  }

  public void add(int index, Step child)
  {
    child.setParent(this);
    children.add(index, child);
  }

  public boolean add(Step child)
  {
    child.setParent(this);
    return children.add(child);
  }

  public boolean addAll(Collection<? extends Step> c)
  {
    for (Step step : c)
    {
      step.setParent(this);
    }

    return children.addAll(c);
  }

  public boolean addAll(int index, Collection<? extends Step> c)
  {
    for (Step step : c)
    {
      step.setParent(this);
    }

    return children.addAll(index, c);
  }

  public void clear()
  {
    for (Step step : this)
    {
      step.setParent(null);
    }

    children.clear();
  }

  public boolean contains(Object o)
  {
    return children.contains(o);
  }

  public boolean containsAll(Collection<?> c)
  {
    return children.containsAll(c);
  }

  public boolean equals(Object o)
  {
    return children.equals(o);
  }

  public Step get(int index)
  {
    return children.get(index);
  }

  public Step getFirst()
  {
    return children.isEmpty() ? null : children.get(0);
  }

  public Step getLast()
  {
    return children.isEmpty() ? null : children.get(children.size() - 1);
  }

  public int hashCode()
  {
    return children.hashCode();
  }

  public int indexOf(Object o)
  {
    return children.indexOf(o);
  }

  public boolean isEmpty()
  {
    return children.isEmpty();
  }

  public Iterator<Step> iterator()
  {
    return new Itr(children.iterator());
  }

  public int lastIndexOf(Object o)
  {
    return children.lastIndexOf(o);
  }

  public ListIterator<Step> listIterator()
  {
    return new ListItr(children.listIterator());
  }

  public ListIterator<Step> listIterator(int index)
  {
    return new ListItr(children.listIterator(index));
  }

  public Step remove(int index)
  {
    return children.remove(index);
  }

  public boolean remove(Object o)
  {
    boolean removed = children.remove(o);
    if (removed)
    {
      ((Step)o).setParent(null);
    }

    return removed;
  }

  public boolean removeAll(Collection<?> c)
  {
    for (Object o : c)
    {
      if (c instanceof Step)
      {
        ((Step)o).setParent(null);
      }
    }

    return children.removeAll(c);
  }

  public boolean retainAll(Collection<?> c)
  {
    for (Step step : this)
    {
      if (!c.contains(step))
      {
        step.setParent(null);
      }
    }

    return children.retainAll(c);
  }

  public Step set(int index, Step element)
  {
    Step old = children.set(index, element);
    if (old != null)
    {
      old.setParent(null);
    }

    return old;
  }

  public int size()
  {
    return children.size();
  }

  public List<Step> subList(int fromIndex, int toIndex)
  {
    return children.subList(fromIndex, toIndex);
  }

  public <T> T[] toArray(T[] a)
  {
    return children.toArray(a);
  }

  public Object[] toArray()
  {
    return children.toArray();
  }

  @Override
  public void accept(IStepVisitor visitor)
  {
    super.accept(visitor);
    for (Step step : this)
    {
      step.accept(visitor);
    }
  }

  @Override
  public boolean isFinished()
  {
    return false;
  }

  @Override
  public boolean isReady()
  {
    return false;
  }

  @Override
  void setWizard(SteppingWizard wizard)
  {
    if (isEmpty())
    {
      throw new IllegalStateException("isEmpty()");
    }

    super.setWizard(wizard);
    for (Step child : children)
    {
      child.setWizard(wizard);
    }
  }

  /**
   * @author Eike Stepper
   */
  private static final class Itr implements Iterator<Step>
  {
    private Iterator<Step> delegate;

    private Step last;

    private Itr(Iterator<Step> delegate)
    {
      this.delegate = delegate;
    }

    public boolean hasNext()
    {
      return delegate.hasNext();
    }

    public Step next()
    {
      return last = delegate.next();
    }

    public void remove()
    {
      delegate.remove();
      last.setParent(null);
    }
  }

  /**
   * @author Eike Stepper
   */
  private final class ListItr implements ListIterator<Step>
  {
    private final ListIterator<Step> delegate;

    private Step last;

    private ListItr(ListIterator<Step> delegate)
    {
      this.delegate = delegate;
    }

    public boolean hasNext()
    {
      return delegate.hasNext();
    }

    public Step next()
    {
      return last = delegate.next();
    }

    public void remove()
    {
      delegate.remove();
      last.setParent(null);
    }

    public void add(Step child)
    {
      child.setParent(CompoundStep.this);
      delegate.add(child);
    }

    public boolean hasPrevious()
    {
      return delegate.hasPrevious();
    }

    public int nextIndex()
    {
      return delegate.nextIndex();
    }

    public Step previous()
    {
      return last = delegate.previous();
    }

    public int previousIndex()
    {
      return delegate.previousIndex();
    }

    public void set(Step child)
    {
      if (last != null)
      {
        last.setParent(null);
      }

      last = child;
      last.setParent(CompoundStep.this);
    }
  }
}

Back to the top