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
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
|
/**
* This file is part of the DOM implementation for KDE.
*
* (C) 1999 Lars Knoll ([email protected])
* (C) 2000 Frederik Holljen ([email protected])
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#include "dom/dom_exception.h"
#include "dom/dom_string.h"
#include "xml/dom2_traversalimpl.h"
using namespace DOM;
NodeIterator::NodeIterator()
{
impl = 0;
}
NodeIterator::NodeIterator(const NodeIterator &other)
{
impl = other.impl;
if (impl) impl->ref();
}
NodeIterator::NodeIterator(NodeIteratorImpl *i)
{
impl = i;
if (impl) impl->ref();
}
NodeIterator &NodeIterator::operator = (const NodeIterator &other)
{
if ( impl != other.impl ) {
if (impl) impl->deref();
impl = other.impl;
if (impl) impl->ref();
}
return *this;
}
NodeIterator::~NodeIterator()
{
if (impl) impl->deref();
}
Node NodeIterator::root()
{
if (impl) return impl->root();
return 0;
}
unsigned long NodeIterator::whatToShow()
{
if (impl) return impl->whatToShow();
return 0;
}
NodeFilter NodeIterator::filter()
{
if (impl) return impl->filter();
return 0;
}
bool NodeIterator::expandEntityReferences()
{
if (impl) return impl->expandEntityReferences();
return 0;
}
Node NodeIterator::nextNode( )
{
if (!impl)
throw DOMException(DOMException::INVALID_STATE_ERR);
int exceptioncode = 0;
NodeImpl *r = impl->nextNode(exceptioncode);
if (exceptioncode)
throw DOMException(exceptioncode);
return r;
}
Node NodeIterator::previousNode( )
{
if (!impl)
throw DOMException(DOMException::INVALID_STATE_ERR);
int exceptioncode = 0;
NodeImpl *r = impl->previousNode(exceptioncode);
if (exceptioncode)
throw DOMException(exceptioncode);
return r;
}
void NodeIterator::detach()
{
if (!impl)
throw DOMException(DOMException::INVALID_STATE_ERR);
int exceptioncode = 0;
impl->detach(exceptioncode);
if (exceptioncode)
throw DOMException(exceptioncode);
}
NodeIteratorImpl *NodeIterator::handle() const
{
return impl;
}
bool NodeIterator::isNull() const
{
return (impl == 0);
}
// -----------------------------------------------------------
NodeFilter::NodeFilter()
{
impl = 0;
}
NodeFilter::NodeFilter(const NodeFilter &other)
{
impl = other.impl;
if (impl) impl->ref();
}
NodeFilter::NodeFilter(NodeFilterImpl *i)
{
impl = i;
if (impl) impl->ref();
}
NodeFilter &NodeFilter::operator = (const NodeFilter &other)
{
if ( impl != other.impl ) {
if (impl) impl->deref();
impl = other.impl;
if (impl) impl->ref();
}
return *this;
}
NodeFilter::~NodeFilter()
{
if (impl) impl->deref();
}
short NodeFilter::acceptNode(const Node &n)
{
if (impl) return impl->acceptNode(n);
return 0;
}
void NodeFilter::setCustomNodeFilter(CustomNodeFilter *custom)
{
if (impl) impl->setCustomNodeFilter(custom);
}
CustomNodeFilter *NodeFilter::customNodeFilter()
{
if (impl) return impl->customNodeFilter();
return 0;
}
NodeFilterImpl *NodeFilter::handle() const
{
return impl;
}
bool NodeFilter::isNull() const
{
return (impl == 0);
}
NodeFilter NodeFilter::createCustom(CustomNodeFilter *custom)
{
NodeFilterImpl *i = new NodeFilterImpl();
i->setCustomNodeFilter(custom);
return i;
}
// --------------------------------------------------------------
CustomNodeFilter::CustomNodeFilter()
{
impl = 0;
}
CustomNodeFilter::~CustomNodeFilter()
{
}
short CustomNodeFilter::acceptNode (const Node &/*n*/)
{
return NodeFilter::FILTER_ACCEPT;
}
bool CustomNodeFilter::isNull()
{
return false;
}
DOMString CustomNodeFilter::customNodeFilterType()
{
return "";
}
// --------------------------------------------------------------
TreeWalker::TreeWalker()
{
impl = 0;
}
TreeWalker::TreeWalker(const TreeWalker &other)
{
impl = other.impl;
if (impl) impl->ref();
}
TreeWalker::TreeWalker(TreeWalkerImpl *i)
{
impl = i;
if (impl) impl->ref();
}
TreeWalker & TreeWalker::operator = (const TreeWalker &other)
{
if ( impl != other.impl ) {
if (impl) impl->deref();
impl = other.impl;
if (impl) impl->ref();
}
return *this;
}
TreeWalker::~TreeWalker()
{
if (impl) impl->deref();
}
Node TreeWalker::root()
{
if (impl) return impl->getRoot();
return 0;
}
unsigned long TreeWalker::whatToShow()
{
if (impl) return impl->getWhatToShow();
return 0;
}
NodeFilter TreeWalker::filter()
{
if (impl) return impl->getFilter();
return 0;
}
bool TreeWalker::expandEntityReferences()
{
if (impl) return impl->getExpandEntityReferences();
return false;
}
Node TreeWalker::currentNode()
{
if (impl) return impl->getCurrentNode();
return 0;
}
void TreeWalker::setCurrentNode(const Node& _currentNode)
{
if (impl) impl->setCurrentNode(_currentNode.handle());
}
Node TreeWalker::parentNode()
{
if (impl) return impl->parentNode();
return 0;
}
Node TreeWalker::firstChild()
{
if (impl) return impl->firstChild();
return 0;
}
Node TreeWalker::lastChild()
{
if (impl) return impl->lastChild();
return 0;
}
Node TreeWalker::previousSibling()
{
if (impl) return impl->previousSibling();
return 0;
}
Node TreeWalker::nextSibling()
{
if (impl) return impl->nextSibling();
return 0;
}
Node TreeWalker::previousNode()
{
if (impl) return impl->previousNode();
return 0;
}
Node TreeWalker::nextNode()
{
if (impl) return impl->nextNode();
return 0;
}
TreeWalkerImpl *TreeWalker::handle() const
{
return impl;
}
bool TreeWalker::isNull() const
{
return (impl == 0);
}
// -----------------------------------------------------------------------
/*DocumentTraversal::DocumentTraversal()
{
}
DocumentTraversal::DocumentTraversal(const DocumentTraversal &other)
{
}
DocumentTraversal &DocumentTraversal::operator = (const DocumentTraversal &other)
{
DocumentTraversal::operator = (other);
return *this;
}
DocumentTraversal::~DocumentTraversal()
{
}
NodeIterator DocumentTraversal::createNodeIterator( const Node &root, long whatToShow,
const NodeFilter &filter,
bool entityReferenceExpansion )
{
return NodeIterator();
}
TreeWalker DocumentTraversal::createTreeWalker( const Node &root, long whatToShow,
const NodeFilter &filter,
bool entityReferenceExpansion )
{
return TreeWalker();
}
*/
|
