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
|
/*
* Copyright (c) 2007 Henri Sivonen
* Copyright (c) 2008 Mozilla Foundation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
package nu.validator.saxtree;
import org.xml.sax.Locator;
/**
* Common superclass for parent nodes.
* @version $Id$
* @author hsivonen
*/
public abstract class ParentNode extends Node {
/**
* The end locator.
*/
protected Locator endLocator;
/**
* The first child.
*/
private Node firstChild = null;
/**
* The last child (for efficiency).
*/
private Node lastChild = null;
/**
* The constuctor.
* @param locator the locator
*/
ParentNode(Locator locator) {
super(locator);
}
/**
* Sets the endLocator.
*
* @param endLocator the endLocator to set
*/
public void setEndLocator(Locator endLocator) {
this.endLocator = new LocatorImpl(endLocator);
}
/**
* Copies the endLocator from another node.
*
* @param another the another node
*/
public void copyEndLocator(ParentNode another) {
this.endLocator = another.endLocator;
}
/**
* Returns the firstChild.
*
* @return the firstChild
*/
public final Node getFirstChild() {
return firstChild;
}
/**
* Returns the lastChild.
*
* @return the lastChild
*/
public final Node getLastChild() {
return lastChild;
}
/**
* Insert a new child before a pre-existing child and return the newly inserted child.
* @param child the new child
* @param sibling the existing child before which to insert (must be a child of this node) or <code>null</code> to append
* @return <code>child</code>
*/
public Node insertBefore(Node child, Node sibling) {
assert sibling == null || this == sibling.getParentNode();
if (sibling == null) {
return appendChild(child);
}
child.detach();
child.setParentNode(this);
if (firstChild == sibling) {
child.setNextSibling(sibling);
firstChild = child;
} else {
Node prev = firstChild;
Node next = firstChild.getNextSibling();
while (next != sibling) {
prev = next;
next = next.getNextSibling();
}
prev.setNextSibling(child);
child.setNextSibling(next);
}
return child;
}
public Node insertBetween(Node child, Node prev, Node next) {
assert prev == null || this == prev.getParentNode();
assert next == null || this == next.getParentNode();
assert prev != null || next == firstChild;
assert next != null || prev == lastChild;
assert prev == null || next == null || prev.getNextSibling() == next;
if (next == null) {
return appendChild(child);
}
child.detach();
child.setParentNode(this);
child.setNextSibling(next);
if (prev == null) {
firstChild = child;
} else {
prev.setNextSibling(child);
}
return child;
}
/**
* Append a child to this node and return the child.
*
* @param child the child to append.
* @return <code>child</code>
*/
public Node appendChild(Node child) {
child.detach();
child.setParentNode(this);
if (firstChild == null) {
firstChild = child;
} else {
lastChild.setNextSibling(child);
}
lastChild = child;
return child;
}
/**
* Append the children of another node to this node removing them from the other node .
* @param parent the other node whose children to append to this one
*/
public void appendChildren(Node parent) {
Node child = parent.getFirstChild();
if (child == null) {
return;
}
ParentNode another = (ParentNode) parent;
if (firstChild == null) {
firstChild = child;
} else {
lastChild.setNextSibling(child);
}
lastChild = another.lastChild;
do {
child.setParentNode(this);
} while ((child = child.getNextSibling()) != null);
another.firstChild = null;
another.lastChild = null;
}
/**
* Remove a child from this node.
* @param node the child to remove
*/
void removeChild(Node node) {
assert this == node.getParentNode();
if (firstChild == node) {
firstChild = node.getNextSibling();
if (lastChild == node) {
lastChild = null;
}
} else {
Node prev = firstChild;
Node next = firstChild.getNextSibling();
while (next != node) {
prev = next;
next = next.getNextSibling();
}
prev.setNextSibling(node.getNextSibling());
if (lastChild == node) {
lastChild = prev;
}
}
}
}
|
