01: /*
02: * Copyright 2006 Sun Microsystems, Inc. All Rights Reserved.
03: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
04: *
05: * This code is free software; you can redistribute it and/or modify it
06: * under the terms of the GNU General Public License version 2 only, as
07: * published by the Free Software Foundation. Sun designates this
08: * particular file as subject to the "Classpath" exception as provided
09: * by Sun in the LICENSE file that accompanied this code.
10: *
11: * This code is distributed in the hope that it will be useful, but WITHOUT
12: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14: * version 2 for more details (a copy is included in the LICENSE file that
15: * accompanied this code).
16: *
17: * You should have received a copy of the GNU General Public License version
18: * 2 along with this work; if not, write to the Free Software Foundation,
19: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20: *
21: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
22: * CA 95054 USA or visit www.sun.com if you need additional information or
23: * have any questions.
24: */
25:
26: package com.sun.tools.internal.txw2.model;
27:
28: import java.util.Iterator;
29:
30: /**
31: * @author Kohsuke Kawaguchi
32: */
33: final class CycleIterator implements Iterator<Leaf> {
34: private Leaf start;
35: private Leaf current;
36: private boolean hasNext = true;
37:
38: public CycleIterator(Leaf start) {
39: assert start != null;
40: this .start = start;
41: this .current = start;
42: }
43:
44: public boolean hasNext() {
45: return hasNext;
46: }
47:
48: public Leaf next() {
49: Leaf last = current;
50: current = current.getNext();
51: if (current == start)
52: hasNext = false;
53:
54: return last;
55: }
56:
57: public void remove() {
58: throw new UnsupportedOperationException();
59: }
60: }
|