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
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
|
/**
* This file is part of the DOM implementation for KDE.
*
* (C) 1999 Lars Knoll ([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_doc.h"
#include "dom/dom_exception.h"
#include "dom/dom2_events.h"
#include "xml/dom_docimpl.h"
#include "xml/dom_elementimpl.h"
#include "xml/dom2_eventsimpl.h"
#include <tqrect.h>
using namespace DOM;
NamedNodeMap::NamedNodeMap()
{
impl = 0;
}
NamedNodeMap::NamedNodeMap(const NamedNodeMap &other)
{
impl = other.impl;
if (impl) impl->ref();
}
NamedNodeMap::NamedNodeMap(NamedNodeMapImpl *i)
{
impl = i;
if (impl) impl->ref();
}
NamedNodeMap &NamedNodeMap::operator = (const NamedNodeMap &other)
{
if ( impl != other.impl ) {
if(impl) impl->deref();
impl = other.impl;
if(impl) impl->ref();
}
return *this;
}
NamedNodeMap::~NamedNodeMap()
{
if(impl) impl->deref();
}
Node NamedNodeMap::getNamedItem( const DOMString &name ) const
{
if (!impl) return 0;
NodeImpl::Id nid = impl->mapId(0, name.implementation(), true);
if (!nid) return 0;
return impl->getNamedItem(nid, false, name.implementation());
}
Node NamedNodeMap::setNamedItem( const Node &arg )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
if (!arg.impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
Node r = impl->setNamedItem(arg.impl, false,
arg.impl->nodeName().implementation(), exceptioncode);
if (exceptioncode)
throw DOMException(exceptioncode);
return r;
}
Node NamedNodeMap::removeNamedItem( const DOMString &name )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
Node r = impl->removeNamedItem(impl->mapId(0, name.implementation(), false),
false, name.implementation(), exceptioncode);
if (exceptioncode)
throw DOMException(exceptioncode);
return r;
}
Node NamedNodeMap::item( unsigned long index ) const
{
if (!impl) return 0;
return impl->item(index);
}
Node NamedNodeMap::getNamedItemNS( const DOMString &namespaceURI, const DOMString &localName ) const
{
if (!impl) return 0;
NodeImpl::Id nid = impl->mapId( namespaceURI.implementation(), localName.implementation(), true );
return impl->getNamedItem(nid, true);
}
Node NamedNodeMap::setNamedItemNS( const Node &arg )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
Node r = impl->setNamedItem(arg.impl, true, 0, exceptioncode);
if (exceptioncode)
throw DOMException(exceptioncode);
return r;
}
Node NamedNodeMap::removeNamedItemNS( const DOMString &namespaceURI, const DOMString &localName )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
NodeImpl::Id nid = impl->mapId( namespaceURI.implementation(), localName.implementation(), false );
Node r = impl->removeNamedItem(nid, true, 0, exceptioncode);
if (exceptioncode)
throw DOMException(exceptioncode);
return r;
}
unsigned long NamedNodeMap::length() const
{
if (!impl) return 0;
return impl->length();
}
// ---------------------------------------------------------------------------
Node::Node(const Node &other)
{
impl = other.impl;
if(impl) impl->ref();
}
Node::Node( NodeImpl *i )
{
impl = i;
if(impl) impl->ref();
}
Node &Node::operator = (const Node &other)
{
if(impl != other.impl) {
if(impl) impl->deref();
impl = other.impl;
if(impl) impl->ref();
}
return *this;
}
bool Node::operator == (const Node &other) const
{
return (impl == other.impl);
}
bool Node::operator != (const Node &other) const
{
return !(impl == other.impl);
}
Node::~Node()
{
if(impl) impl->deref();
}
DOMString Node::nodeName() const
{
if(impl) return impl->nodeName();
return DOMString();
}
DOMString Node::nodeValue() const
{
// ### should throw exception on plain node ?
if(impl) return impl->nodeValue();
return DOMString();
}
void Node::setNodeValue( const DOMString &_str )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
if(impl) impl->setNodeValue( _str,exceptioncode );
if (exceptioncode)
throw DOMException(exceptioncode);
}
unsigned short Node::nodeType() const
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
return impl->nodeType();
}
Node Node::parentNode() const
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
return impl->parentNode();
}
NodeList Node::childNodes() const
{
if (!impl) return 0;
return impl->childNodes();
}
Node Node::firstChild() const
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
return impl->firstChild();
}
Node Node::lastChild() const
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
return impl->lastChild();
}
Node Node::previousSibling() const
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
return impl->previousSibling();
}
Node Node::nextSibling() const
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
return impl->nextSibling();
}
NamedNodeMap Node::attributes() const
{
if (!impl || !impl->isElementNode()) return 0;
return static_cast<ElementImpl*>(impl)->attributes();
}
Document Node::ownerDocument() const
{
// braindead DOM spec says that ownerDocument
// should return null if called on the document node
// we don't do that in the *impl tree to avoid excessive if()'s
// so we simply hack it here in one central place.
if (!impl || impl->getDocument() == impl) return Document(false);
return impl->getDocument();
}
Node Node::insertBefore( const Node &newChild, const Node &refChild )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
NodeImpl *r = impl->insertBefore( newChild.impl, refChild.impl, exceptioncode );
if (exceptioncode)
throw DOMException(exceptioncode);
if (!newChild.impl->closed()) newChild.impl->close();
return r;
}
Node Node::replaceChild( const Node &newChild, const Node &oldChild )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
impl->replaceChild( newChild.impl, oldChild.impl, exceptioncode );
if (exceptioncode)
throw DOMException(exceptioncode);
if (newChild.impl && !newChild.impl->closed()) newChild.impl->close();
return oldChild;
}
Node Node::removeChild( const Node &oldChild )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
impl->removeChild( oldChild.impl, exceptioncode );
if (exceptioncode)
throw DOMException(exceptioncode);
return oldChild;
}
Node Node::appendChild( const Node &newChild )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
NodeImpl *r = impl->appendChild( newChild.impl, exceptioncode );
if (exceptioncode)
throw DOMException(exceptioncode);
if (!newChild.impl->closed()) newChild.impl->close();
return r;
}
bool Node::hasAttributes()
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
if (!impl->isElementNode()) return false;
ElementImpl* e = static_cast<ElementImpl*>(impl);
return e->attributes(true) && e->attributes(true)->length();
}
bool Node::hasChildNodes( )
{
if (!impl) return false;
return impl->hasChildNodes();
}
Node Node::cloneNode( bool deep )
{
if (!impl) return 0;
return impl->cloneNode( deep );
}
void Node::normalize ( )
{
if (!impl) return;
impl->normalize();
}
bool Node::isSupported( const DOMString &feature,
const DOMString & /*version*/ ) const
{
DOMString upFeature = feature.upper();
return (upFeature == "HTML" ||
upFeature == "XML" ||
upFeature == "CORE");
}
DOMString Node::namespaceURI( ) const
{
if (!impl) return DOMString();
return impl->namespaceURI();
}
DOMString Node::prefix( ) const
{
if (!impl) return DOMString();
return impl->prefix();
}
void Node::setPrefix(const DOMString &prefix )
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
impl->setPrefix(prefix,exceptioncode);
if (exceptioncode)
throw DOMException(exceptioncode);
}
DOMString Node::localName( ) const
{
if (!impl) return DOMString();
return impl->localName();
}
void Node::addEventListener(const DOMString &type,
EventListener *listener,
const bool useCapture)
{
if (!impl) return;
if (listener)
impl->addEventListener(EventImpl::typeToId(type),listener,useCapture);
}
void Node::removeEventListener(const DOMString &type,
EventListener *listener,
bool useCapture)
{
if (!impl) return;
impl->removeEventListener(EventImpl::typeToId(type),listener,useCapture);
}
bool Node::dispatchEvent(const Event &evt)
{
if (!impl)
throw DOMException(DOMException::INVALID_STATE_ERR);
if (!evt.handle())
throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
impl->dispatchEvent(evt.handle(),exceptioncode);
if (exceptioncode)
throw DOMException(exceptioncode);
return !evt.handle()->defaultPrevented();
}
unsigned int Node::elementId() const
{
if (!impl) return 0;
return impl->id();
}
unsigned long Node::index() const
{
if (!impl) return 0;
return impl->nodeIndex();
}
TQString Node::toHTML()
{
if (!impl) return TQString::null;
return impl->toString().string();
}
void Node::applyChanges()
{
if (!impl) return;
impl->recalcStyle( NodeImpl::Inherit );
}
void Node::getCursor(int offset, int &_x, int &_y, int &height)
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int dummy;
impl->getCaret(offset, false, _x, _y, dummy, height);
}
TQRect Node::getRect()
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
return impl->getRect();
}
DOMString Node::textContent( ) const
{
if(impl) return impl->textContent();
return DOMString();
}
void Node::setTextContent(const DOMString &content) const
{
if (!impl) throw DOMException(DOMException::NOT_FOUND_ERR);
int exceptioncode = 0;
impl->setTextContent( content, exceptioncode );
if (exceptioncode)
throw DOMException(exceptioncode);
}
//-----------------------------------------------------------------------------
NodeList::NodeList()
{
impl = 0;
}
NodeList::NodeList(const NodeList &other)
{
impl = other.impl;
if(impl) impl->ref();
}
NodeList::NodeList(const NodeListImpl *i)
{
impl = const_cast<NodeListImpl *>(i);
if(impl) impl->ref();
}
NodeList &NodeList::operator = (const NodeList &other)
{
if ( impl != other.impl ) {
if(impl) impl->deref();
impl = other.impl;
if(impl) impl->ref();
}
return *this;
}
NodeList::~NodeList()
{
if(impl) impl->deref();
}
Node NodeList::item( unsigned long index ) const
{
if (!impl) return 0;
return impl->item(index);
}
unsigned long NodeList::length() const
{
if (!impl) return 0;
return impl->length();
}
|