Newer
Older
* Copyright (c) 1999-2002 The Apache Software Foundation. All rights
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
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The end-user documentation included with the redistribution,
* if any, must include the following acknowledgment:
* "This product includes software developed by the
* Apache Software Foundation (http://www.apache.org/)."
* Alternately, this acknowledgment may appear in the software itself,
* if and wherever such third-party acknowledgments normally appear.
*
* 4. The names "Xerces" and "Apache Software Foundation" must
* not be used to endorse or promote products derived from this
* software without prior written permission. For written
* permission, please contact apache\@apache.org.
*
* 5. Products derived from this software may not be called "Apache",
* nor may "Apache" appear in their name, without prior written
* permission of the Apache Software Foundation.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
* ====================================================================
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Apache Software Foundation, and was
* originally based on software copyright (c) 1999, International
* Business Machines, Inc., http://www.ibm.com . For more information
* on the Apache Software Foundation, please see
* <http://www.apache.org/>.
*/
/*
* $Id$
*/
//
// file DocumentImpl.cpp
//
#include "DocumentImpl.hpp"
#include "DOM_DOMException.hpp"
#include "DOM_Node.hpp"
#include "DocumentTypeImpl.hpp"
#include "ElementImpl.hpp"
#include "ElementNSImpl.hpp"
#include "AttrImpl.hpp"
#include "AttrNSImpl.hpp"
#include "CDATASectionImpl.hpp"
#include "CommentImpl.hpp"
#include "DocumentFragmentImpl.hpp"
#include "EntityImpl.hpp"
#include "EntityReferenceImpl.hpp"
#include "NotationImpl.hpp"
#include "ProcessingInstructionImpl.hpp"
#include "TextImpl.hpp"
#include "DOM_DOMImplementation.hpp"
#include "DeepNodeListImpl.hpp"
#include "NamedNodeMapImpl.hpp"
#include "DStringPool.hpp"
#include <xercesc/internal/XMLReader.hpp>
#include "TreeWalkerImpl.hpp"
#include "NodeIteratorImpl.hpp"
#include "NodeIDMap.hpp"
#include "DOM_Document.hpp"
#include <xercesc/util/HashPtr.hpp>
#include "RangeImpl.hpp"
#include "DOM_Document.hpp"
static DOMString *nam = 0; // will be lazily initialized to "#document"
static XMLRegisterCleanup namCleanup;
DocumentImpl::DocumentImpl()
: ParentNode(this)
{
docType = null;
docElement = null;
namePool = new DStringPool(257);
iterators = 0L;
treeWalkers = 0L;
fNodeIDMap = 0;
userData = 0;
ranges = 0;
fChanges = 0;
errorChecking = true;
};
//DOM Level 2
DocumentImpl::DocumentImpl(const DOMString &fNamespaceURI,
const DOMString &qualifiedName,
DocumentTypeImpl *doctype)
: ParentNode(this)
{
docType=null;
setDocumentType(doctype);
docElement=null;
namePool = new DStringPool(257);
iterators = 0;
treeWalkers = 0;
fNodeIDMap = 0;
userData = 0;
ranges = 0;
fChanges = 0;
errorChecking = true;
appendChild(createElementNS(fNamespaceURI, qualifiedName)); //root element
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
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
}
void DocumentImpl::setDocumentType(DocumentTypeImpl *doctype)
{
if (!doctype)
return;
if (doctype->getOwnerDocument() != null)
throw DOM_DOMException( //one doctype can belong to only one DocumentImpl
DOM_DOMException::WRONG_DOCUMENT_ERR, null);
doctype->setOwnerDocument(this);
doctype->getEntities()->ownerNode->setOwnerDocument(this);
doctype->getNotations()->ownerNode->setOwnerDocument(this);
doctype -> referenced(); // Warning, tricky! An external (DOM_Node) reference
// to a node normally bumps the reference count to its
// document also. But this could not happen when the
// user created the DOM_DocumentType because there was
// no document yet. Now we have the document, and
// the docs ref count must be got back in sync.
appendChild(doctype);
}
DocumentImpl::~DocumentImpl()
{
if (iterators != 0L) {
// The data in the vector is pointers owned by smart pointers, and will be cleaned up when they go away.
delete iterators;
}
if (treeWalkers != 0L) {
// The data in the vector is pointers owned by smart pointers, and will be cleaned up when they go away.
delete treeWalkers;
}
if (ranges != 0L) {
delete ranges;
ranges = 0;
}
if (userData) {
// make sure we won't access userData any further
hasUserData(false);
delete userData;
}
delete namePool;
// Do not delete docType and docElement pointers here.
// These are also normal child nodes of the document,
// and refcounting will take them out in the usual way.
delete fNodeIDMap;
};
NodeImpl *DocumentImpl::cloneNode(bool deep) {
// clone the node itself
DocumentImpl *newdoc = new DocumentImpl();
// then the children by _importing_ them
if (deep) {
for (ChildNode *n = firstChild; n != null; n = n->nextSibling) {
newdoc->appendChild(newdoc->importNode(n, true));
}
}
newdoc->setErrorChecking(errorChecking);
return newdoc;
};
DOMString DocumentImpl::getNodeName() {
return DStringPool::getStaticString("#document"
, &nam
, reinitDocumentImpl
, namCleanup);
}
short DocumentImpl::getNodeType() {
return DOM_Node::DOCUMENT_NODE;
};
// even though ownerDocument refers to this in this implementation
// the DOM Level 2 spec says it must be null, so make it appear so
DocumentImpl * DocumentImpl::getOwnerDocument() {
return null;
}
bool DocumentImpl::isDocumentImpl() {
return true;
};
AttrImpl *DocumentImpl::createAttribute(const DOMString &nam)
{
if (errorChecking && !isXMLName(nam)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR,null);
}
return new AttrImpl(this,nam);
};
CDATASectionImpl *DocumentImpl::createCDATASection(const DOMString &data) {
return new CDATASectionImpl(this,data);
};
CommentImpl *DocumentImpl::createComment(const DOMString &data)
{
return new CommentImpl(this,data);
};
DocumentFragmentImpl *DocumentImpl::createDocumentFragment()
{
return new DocumentFragmentImpl(this);
};
DocumentTypeImpl *DocumentImpl::createDocumentType(const DOMString &nam)
{
if (errorChecking && !isXMLName(nam)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR, null);
}
return new DocumentTypeImpl(this, nam);
};
DocumentTypeImpl *
DocumentImpl::createDocumentType(const DOMString &qualifiedName,
const DOMString &publicId,
const DOMString &systemId)
{
if (errorChecking && !isXMLName(qualifiedName)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR, null);
}
return new DocumentTypeImpl(this, qualifiedName, publicId, systemId);
};
ElementImpl *DocumentImpl::createElement(const DOMString &tagName)
{
if (errorChecking && !isXMLName(tagName)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR,null);
}
DOMString pooledTagName = this->namePool->getPooledString(tagName);
return new ElementImpl(this,pooledTagName);
};
ElementImpl *DocumentImpl::createElement(const XMLCh *tagName)
{
DOMString pooledTagName = this->namePool->getPooledString(tagName);
return new ElementImpl(this,pooledTagName);
};
EntityImpl *DocumentImpl::createEntity(const DOMString &nam)
{
if (errorChecking && !isXMLName(nam)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR, null);
}
return new EntityImpl(this, nam);
};
EntityReferenceImpl *DocumentImpl::createEntityReference(const DOMString &nam)
{
if (errorChecking && !isXMLName(nam)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR, null);
}
return new EntityReferenceImpl(this, nam);
};
NotationImpl *DocumentImpl::createNotation(const DOMString &nam)
{
if (errorChecking && !isXMLName(nam)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR, null);
}
return new NotationImpl(this, nam);
};
ProcessingInstructionImpl *DocumentImpl::createProcessingInstruction(
const DOMString &target, const DOMString &data)
{
if (errorChecking && !isXMLName(target)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR,null);
}
return new ProcessingInstructionImpl(this,target,data);
};
TextImpl *DocumentImpl::createTextNode(const DOMString &data)
{
return new TextImpl(this,data);
};
NodeIteratorImpl* DocumentImpl::createNodeIterator (DOM_Node root, unsigned long whatToShow, DOM_NodeFilter* filter, bool entityReferenceExpansion)
{
// Create the node iterator implementation object.
// Add it to the vector of iterators that must be synchronized when a node is deleted.
// The vector of iterators is kept in the "owner document" if there is one. If there isn't one, I assume that root is the
// owner document.
NodeIteratorImpl* iter = new NodeIteratorImpl(root, whatToShow, filter, entityReferenceExpansion);
DOM_Document doc = root.getOwnerDocument();
DocumentImpl* impl;
if (! doc.isNull()) {
impl = (DocumentImpl *) doc.fImpl;
}
else
impl = (DocumentImpl *) root.fImpl;
if (impl->iterators == 0L) {
impl->iterators = new NodeIterators(1, false);
impl->iterators->addElement(iter);
}
return iter;
}
TreeWalkerImpl* DocumentImpl::createTreeWalker (DOM_Node root, unsigned long whatToShow, DOM_NodeFilter* filter, bool entityReferenceExpansion)
{
// See notes for createNodeIterator...
TreeWalkerImpl* twi = new TreeWalkerImpl(root, whatToShow, filter, entityReferenceExpansion);
DOM_Document doc = root.getOwnerDocument();
DocumentImpl* impl;
if (! doc.isNull()) {
impl = (DocumentImpl *) doc.fImpl;
}
else
impl = (DocumentImpl *) root.fImpl;
if (impl->treeWalkers == 0L) {
impl->treeWalkers = new TreeWalkers(1, false);
impl->treeWalkers->addElement(twi);
}
return twi;
}
DocumentTypeImpl *DocumentImpl::getDoctype()
{
return docType;
};
ElementImpl *DocumentImpl::getDocumentElement()
{
return docElement;
};
DeepNodeListImpl *DocumentImpl::getElementsByTagName(const DOMString &tagname)
{
return new DeepNodeListImpl(this,tagname);
};
NodeImpl *DocumentImpl::insertBefore(NodeImpl *newChild, NodeImpl *refChild)
{
// Only one such child permitted
if (errorChecking &&
((newChild->isElementImpl() && docElement!=null) ||
(newChild->isDocumentTypeImpl() && docType!=null))) {
throw DOM_DOMException(DOM_DOMException::HIERARCHY_REQUEST_ERR,null);
}
ParentNode::insertBefore(newChild,refChild);
// If insert succeeded, cache the kid appropriately
if(newChild->isElementImpl())
docElement=(ElementImpl *)newChild;
else if(newChild->isDocumentTypeImpl())
docType=(DocumentTypeImpl *)newChild;
return newChild;
};
bool DocumentImpl::isXMLName(const DOMString &s)
{
const XMLCh *nam;
int length;
int i;
length = s.length();
if (length == 0)
return false;
nam = s.rawBuffer();
if (!XMLReader::isFirstNameChar(nam[0]))
return false;
for (i=1; i<length; i++)
{
if (!XMLReader::isNameChar(nam[i]))
return false;
}
return true;
};
// referenced(). Override this function here in class DocumentImpl because
// we don't want the action taken in NodeImpl, which is
// to add a reference to the node's owning document.
//
void DocumentImpl::referenced()
{
// Intentionally empty.
};
NodeImpl *DocumentImpl::removeChild(NodeImpl *oldChild)
{
ParentNode::removeChild(oldChild);
// If remove succeeded, un-cache the kid appropriately
if(oldChild->isElementImpl())
docElement=null;
else if(oldChild->isDocumentTypeImpl())
docType=null;
return oldChild;
};
//
// unreferenced() will be called whenever the refernce count on
// this document goes from 1 to 0. In all cases, when this
// happens to a document node (which is the case here), it
// is time to actually delete the document.
//
// See also NodeImpl::referenced() and unreferenced(), which
// update document node ref counts based on references coming
// or going to nodes owned by the document.
//
void DocumentImpl::unreferenced()
{
deleteIf(this);
};
//Introduced in DOM Level 2
NodeImpl *DocumentImpl::importNode(NodeImpl *source, bool deep)
{
NodeImpl *newnode=null;
bool oldErrorCheckingFlag = errorChecking;
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
switch (source->getNodeType())
{
case DOM_Node::ELEMENT_NODE :
{
ElementImpl *newelement;
if (source->getLocalName() == null)
newelement = createElement(source->getNodeName());
else
newelement = createElementNS(source->getNamespaceURI(),
source->getNodeName());
NamedNodeMapImpl *srcattr=source->getAttributes();
if (srcattr!=null)
for(unsigned int i=0;i<srcattr->getLength();++i)
{
AttrImpl *attr = (AttrImpl *) srcattr->item(i);
AttrImpl * pOldAttr = null;
if (attr -> getSpecified())
{ // not a default attribute
AttrImpl *nattr = (AttrImpl *) importNode(attr, true);
if (attr -> getLocalName() == null)
pOldAttr = newelement->setAttributeNode(nattr);
else
pOldAttr = newelement->setAttributeNodeNS(nattr);
if (pOldAttr)
{
if (pOldAttr->nodeRefCount == 0)
NodeImpl::deleteIf(pOldAttr);
}
}
}
newnode=newelement;
}
break;
case DOM_Node::ATTRIBUTE_NODE :
{
if (source->getLocalName() == null)
newnode = createAttribute(source->getNodeName());
else
newnode = createAttributeNS(source->getNamespaceURI(),
source->getNodeName());
// if source is an AttrImpl from this very same implementation
// avoid creating the child nodes if possible
// if (source instanceof AttrImpl) {
AttrImpl *attr = (AttrImpl *) source;
if (attr->hasStringValue()) {
AttrImpl *newattr = (AttrImpl *) newnode;
newattr->setValue(attr->getValue());
deep = false;
}
else {
deep = true;
}
// }
// else {
// // Kids carry value
// deep = true;
// }
}
break;
case DOM_Node::TEXT_NODE :
newnode = createTextNode(source->getNodeValue());
break;
case DOM_Node::CDATA_SECTION_NODE :
newnode = createCDATASection(source->getNodeValue());
break;
case DOM_Node::ENTITY_REFERENCE_NODE :
{
EntityReferenceImpl* newentityRef = createEntityReference(source->getNodeName());
newnode=newentityRef;
errorChecking = false;
newentityRef->setReadOnly(false, true); //allow deep import temporarily
}
break;
case DOM_Node::ENTITY_NODE :
{
EntityImpl *srcentity=(EntityImpl *)source;
EntityImpl *newentity = createEntity(source->getNodeName());
newentity->setPublicId(srcentity->getPublicId());
newentity->setSystemId(srcentity->getSystemId());
newentity->setNotationName(srcentity->getNotationName());
// Kids carry additional value
newnode=newentity;
newentity->setReadOnly(false, true);// allow deep import temporarily
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
}
break;
case DOM_Node::PROCESSING_INSTRUCTION_NODE :
newnode = createProcessingInstruction(source->getNodeName(),
source->getNodeValue());
break;
case DOM_Node::COMMENT_NODE :
newnode = createComment(source->getNodeValue());
break;
case DOM_Node::DOCUMENT_TYPE_NODE :
{
DocumentTypeImpl *srcdoctype = (DocumentTypeImpl *)source;
DocumentTypeImpl *newdoctype = (DocumentTypeImpl *)
createDocumentType(srcdoctype->getNodeName(),
srcdoctype->getPublicId(),
srcdoctype->getSystemId());
// Values are on NamedNodeMaps
NamedNodeMapImpl *smap = srcdoctype->getEntities();
NamedNodeMapImpl *tmap = newdoctype->getEntities();
if(smap != null) {
for(unsigned int i = 0; i < smap->getLength(); i++) {
tmap->setNamedItem(importNode(smap->item(i), true));
}
}
smap = srcdoctype->getNotations();
tmap = newdoctype->getNotations();
if (smap != null) {
for(unsigned int i = 0; i < smap->getLength(); i++) {
tmap->setNamedItem(importNode(smap->item(i), true));
}
}
// NOTE: At this time, the DOM definition of DocumentType
// doesn't cover Elements and their Attributes. domimpl's
// extentions in that area will not be preserved, even if
// copying from domimpl to domimpl. We could special-case
// that here. Arguably we should. Consider. ?????
newnode = newdoctype;
}
break;
case DOM_Node::DOCUMENT_FRAGMENT_NODE :
newnode = createDocumentFragment();
// No name, kids carry value
break;
case DOM_Node::NOTATION_NODE :
{
NotationImpl *srcnotation=(NotationImpl *)source;
NotationImpl *newnotation = createNotation(source->getNodeName());
newnotation->setPublicId(srcnotation->getPublicId());
newnotation->setSystemId(srcnotation->getSystemId());
// Kids carry additional value
newnode=newnotation;
// No name, no value
break;
}
case DOM_Node::DOCUMENT_NODE : // Document can't be child of Document
default: // Unknown node type
throw DOM_DOMException(DOM_DOMException::NOT_SUPPORTED_ERR, null);
}
// If deep, replicate and attach the kids.
if (deep)
for (NodeImpl *srckid = source->getFirstChild();
srckid != null;
srckid = srckid->getNextSibling()) {
newnode->appendChild(importNode(srckid, true));
}
if (newnode->getNodeType() == DOM_Node::ENTITY_REFERENCE_NODE
|| newnode->getNodeType() == DOM_Node::ENTITY_NODE) {
((EntityReferenceImpl*)newnode)->setReadOnly(true, true);
errorChecking = oldErrorCheckingFlag;
}
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
return newnode;
};
ElementImpl *DocumentImpl::createElementNS(const DOMString &fNamespaceURI,
const DOMString &qualifiedName)
{
if (errorChecking && !isXMLName(qualifiedName)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR,null);
}
//DOMString pooledTagName = this->namePool->getPooledString(qualifiedName);
return new ElementNSImpl(this, fNamespaceURI, qualifiedName);
}
AttrImpl *DocumentImpl::createAttributeNS(const DOMString &fNamespaceURI,
const DOMString &qualifiedName)
{
if (!isXMLName(qualifiedName)) {
throw DOM_DOMException(DOM_DOMException::INVALID_CHARACTER_ERR,null);
}
return new AttrNSImpl(this, fNamespaceURI, qualifiedName);
}
DeepNodeListImpl *DocumentImpl::getElementsByTagNameNS(const DOMString &fNamespaceURI,
const DOMString &fLocalName)
{
return new DeepNodeListImpl(this, fNamespaceURI, fLocalName);
}
ElementImpl *DocumentImpl::getElementById(const DOMString &elementId)
{
if (fNodeIDMap == 0)
return null;
AttrImpl *theAttr = fNodeIDMap->find(elementId);
if (theAttr == null)
return null;
return theAttr->getOwnerElement();
}
//Return the index > 0 of ':' in the given qualified name qName="prefix:localName".
//Return 0 if there is no ':', or -1 if qName is malformed such as ":abcd".
int DocumentImpl::indexofQualifiedName(const DOMString & qName)
{
//Check if s = prefix:localName, name or malformed
const XMLCh *qNameP = qName.rawBuffer();
int qNameLen = qName.length(); //note: qName[qNameLen] may not be 0
int index = -1, count = 0;
for (int i = 0; i < qNameLen; ++i)
if (*qNameP++ == chColon) {
index = i;
++count; //number of ':' found
}
if (qNameLen == 0 || count > 1 || index == 0 || index == qNameLen-1)
return -1;
return count == 0 ? 0 : index;
}
XMLDeclImpl* DocumentImpl::createXMLDecl(const DOMString& version, const DOMString& encoding, const DOMString& standalone)
{
return new XMLDeclImpl(this, version, encoding, standalone);
}
RangeImpl* DocumentImpl::createRange()
{
RangeImpl* range = new RangeImpl(DOM_Document(this));
if (ranges == 0L) {
ranges = new RangeImpls(1, false);
}
ranges->addElement(range);
return range;
}
RangeImpls* DocumentImpl::getRanges()
{
return ranges;
}
void DocumentImpl::removeRange(RangeImpl* range)
{
if (ranges != null) {
unsigned int sz = ranges->size();
if (sz !=0) {
for (unsigned int i =0; i<sz; i++) {
if (ranges->elementAt(i) == range) {
ranges->removeElementAt(i);
delete range;
break;
}
}
}
}
}
/** Uses the kidOK lookup table to check whether the proposed
tree structure is legal.
????? It feels like there must be a more efficient solution,
but for the life of me I can't think what it would be.
*/
bool DocumentImpl::isKidOK(NodeImpl *parent, NodeImpl *child)
{
static int kidOK[14];
if (kidOK[DOM_Node::DOCUMENT_NODE] == 0)
{
kidOK[DOM_Node::DOCUMENT_NODE] =
1 << DOM_Node::ELEMENT_NODE |
1 << DOM_Node::PROCESSING_INSTRUCTION_NODE |
1 << DOM_Node::COMMENT_NODE |
1 << DOM_Node::DOCUMENT_TYPE_NODE |
1 << DOM_Node::XML_DECL_NODE;
kidOK[DOM_Node::DOCUMENT_FRAGMENT_NODE] =
kidOK[DOM_Node::ENTITY_NODE] =
kidOK[DOM_Node::ENTITY_REFERENCE_NODE] =
kidOK[DOM_Node::ELEMENT_NODE] =
1 << DOM_Node::ELEMENT_NODE |
1 << DOM_Node::PROCESSING_INSTRUCTION_NODE |
1 << DOM_Node::COMMENT_NODE |
1 << DOM_Node::TEXT_NODE |
1 << DOM_Node::CDATA_SECTION_NODE |
1 << DOM_Node::ENTITY_REFERENCE_NODE |
1 << DOM_Node::XML_DECL_NODE;
kidOK[DOM_Node::ATTRIBUTE_NODE] =
1 << DOM_Node::TEXT_NODE |
1 << DOM_Node::ENTITY_REFERENCE_NODE;
kidOK[DOM_Node::PROCESSING_INSTRUCTION_NODE] =
kidOK[DOM_Node::COMMENT_NODE] =
kidOK[DOM_Node::TEXT_NODE] =
kidOK[DOM_Node::CDATA_SECTION_NODE] =
kidOK[DOM_Node::NOTATION_NODE] =
0;
};
int p=parent->getNodeType();
int ch = child->getNodeType();
return (kidOK[p] & 1<<ch) != 0;
}
void DocumentImpl::setUserData(NodeImpl* n, void* data)
{
if (!userData && data)
userData = new RefHashTableOf<void>(29, false, new HashPtr());
if (!data && userData)
userData->removeKey((void*)n);
else
userData->put((void*)n,data);
}
void* DocumentImpl::getUserData(NodeImpl* n)
{
if (userData)
return userData->get((void*)n);
else
return null;
}
void* DocumentImpl::getUserData()
{
return (hasUserData()) ? getUserData(this) : null;
}
void DocumentImpl::setUserData(void* val)
{
setUserData(this, val);
if (val)
hasUserData(true);
else
hasUserData(false);
};
/**
* Denotes that this node has changed.
*/
void DocumentImpl::changed() {
fChanges++;
}
/**
* Returns the number of changes to this node.
*/
int DocumentImpl::changes() {
return fChanges;
}
// -----------------------------------------------------------------------
// Notification that lazy data has been deleted
// -----------------------------------------------------------------------
void DocumentImpl::reinitDocumentImpl() {
delete nam;
nam = 0;
}