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 org.xml.sax.Locator;
29:
30: import javax.xml.namespace.QName;
31: import java.util.HashSet;
32: import java.util.Set;
33: import java.util.Stack;
34:
35: /**
36: * Either an {@link Element} or {@link Attribute}.
37: *
38: * @author Kohsuke Kawaguchi
39: */
40: public abstract class XmlNode extends WriterNode {
41: /**
42: * Name of the attribute/element.
43: *
44: * In TXW, we ignore all infinite names.
45: * (finite name class will be expanded to a list of {@link XmlNode}s.
46: */
47: public final QName name;
48:
49: protected XmlNode(Locator location, QName name, Leaf leaf) {
50: super (location, leaf);
51: this .name = name;
52: }
53:
54: /**
55: * Expand all refs and collect all children.
56: */
57: protected final Set<Leaf> collectChildren() {
58: Set<Leaf> result = new HashSet<Leaf>();
59:
60: Stack<Node> work = new Stack<Node>();
61: work.push(this );
62:
63: while (!work.isEmpty()) {
64: for (Leaf l : work.pop()) {
65: if (l instanceof Ref) {
66: work.push(((Ref) l).def);
67: } else {
68: result.add(l);
69: }
70: }
71: }
72:
73: return result;
74: }
75: }
|