git-svn-id: http://moon:8086/svn/software/trunk/libsrc/xerces-c-3.0.0@1 b431acfa-c32f-4a4a-93f1-934dc6c82436
558 lines
19 KiB
C++
Executable File
558 lines
19 KiB
C++
Executable File
/*
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
* contributor license agreements. See the NOTICE file distributed with
|
|
* this work for additional information regarding copyright ownership.
|
|
* The ASF licenses this file to You under the Apache License, Version 2.0
|
|
* (the "License"); you may not use this file except in compliance with
|
|
* the License. You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
//
|
|
// Various DOM tests.
|
|
// Contents include
|
|
// 1. NodeIterator tests
|
|
// 2. Tree Walker tests
|
|
// All individual are wrapped in a memory leak checker.
|
|
//
|
|
// This is NOT a complete test of DOM functionality.
|
|
//
|
|
|
|
/*
|
|
* $Id: Traversal.cpp 671894 2008-06-26 13:29:21Z borisk $
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <xercesc/dom/DOM.hpp>
|
|
#include <xercesc/util/PlatformUtils.hpp>
|
|
#include <xercesc/util/XMLException.hpp>
|
|
#include <xercesc/util/XMLString.hpp>
|
|
#include <xercesc/util/XMLUniDefs.hpp>
|
|
|
|
|
|
XERCES_CPP_NAMESPACE_USE
|
|
|
|
bool errorOccurred = false;
|
|
|
|
#define UNUSED(x) { if(x!=0){} }
|
|
|
|
#define TASSERT(c) tassert((c), __FILE__, __LINE__)
|
|
|
|
void tassert(bool c, const char *file, int line)
|
|
{
|
|
if (!c) {
|
|
printf("Failure. Line %d, file %s\n", line, file);
|
|
errorOccurred = true;
|
|
}
|
|
};
|
|
|
|
|
|
#define EXCEPTION_TEST(operation, expected_exception) \
|
|
{ \
|
|
try { \
|
|
operation; \
|
|
printf(" Error: no exception thrown at line %d\n", __LINE__); \
|
|
errorOccurred = true; \
|
|
} \
|
|
catch (DOMException &e) { \
|
|
if (e.code != expected_exception) { \
|
|
printf(" Wrong exception code: %d at line %d\n", e.code, __LINE__); \
|
|
errorOccurred = true; \
|
|
} \
|
|
} \
|
|
catch (...) { \
|
|
printf(" Wrong exception thrown at line %d\n", __LINE__); \
|
|
errorOccurred = true; \
|
|
} \
|
|
}
|
|
|
|
class MyFilter : public DOMNodeFilter {
|
|
public:
|
|
|
|
MyFilter(short nodeType, bool reject=false) : DOMNodeFilter(), fNodeType(nodeType), fReject(reject) {};
|
|
virtual FilterAction acceptNode(const DOMNode* node) const;
|
|
private:
|
|
short fNodeType;
|
|
bool fReject;
|
|
};
|
|
/*
|
|
Node Types can be of the following:
|
|
ELEMENT_NODE = 1,
|
|
ATTRIBUTE_NODE = 2,
|
|
TEXT_NODE = 3,
|
|
CDATA_SECTION_NODE = 4,
|
|
ENTITY_REFERENCE_NODE = 5,
|
|
ENTITY_NODE = 6,
|
|
PROCESSING_INSTRUCTION_NODE = 7,
|
|
COMMENT_NODE = 8,
|
|
DOCUMENT_NODE = 9,
|
|
DOCUMENT_TYPE_NODE = 10,
|
|
DOCUMENT_FRAGMENT_NODE = 11,
|
|
NOTATION_NODE = 12
|
|
*/
|
|
DOMNodeFilter::FilterAction MyFilter::acceptNode(const DOMNode* node) const {
|
|
if (fNodeType == 0)
|
|
return DOMNodeFilter::FILTER_ACCEPT;
|
|
if (node->getNodeType() == fNodeType) {
|
|
return DOMNodeFilter::FILTER_ACCEPT;
|
|
} else {
|
|
return fReject ? DOMNodeFilter::FILTER_REJECT : DOMNodeFilter::FILTER_SKIP;
|
|
}
|
|
}
|
|
|
|
|
|
|
|
int main()
|
|
{
|
|
try {
|
|
XMLPlatformUtils::Initialize();
|
|
}
|
|
catch (const XMLException& toCatch) {
|
|
char *pMessage = XMLString::transcode(toCatch.getMessage());
|
|
fprintf(stderr, "Error during XMLPlatformUtils::Initialize(). \n"
|
|
" Message is: %s\n", pMessage);
|
|
XMLString::release(&pMessage);
|
|
return -1;
|
|
}
|
|
|
|
// Create a XMLCh buffer for string manipulation
|
|
XMLCh tempStr[4000];
|
|
XMLCh featureStr[100];
|
|
XMLString::transcode("Traversal",featureStr,99);
|
|
|
|
|
|
|
|
//
|
|
// Doc - Create a small document tree
|
|
//
|
|
|
|
{
|
|
//creating a DOM Tree
|
|
/* Tests are based on the tree structure below
|
|
doc - root - E11 (attr01) - textNode1
|
|
- E111
|
|
- E112
|
|
- cdataSec
|
|
- E12 (attr02) - textNode2
|
|
- E121
|
|
- E122
|
|
- E13 - E131
|
|
- docPI
|
|
- comment
|
|
*/
|
|
|
|
DOMImplementation* impl = DOMImplementationRegistry::getDOMImplementation(featureStr);
|
|
DOMDocument* doc = impl->createDocument();
|
|
|
|
//Creating a root element
|
|
XMLString::transcode("RootElement", tempStr, 3999);
|
|
DOMElement* root = doc->createElement(tempStr);
|
|
doc->appendChild(root);
|
|
|
|
//Creating the siblings of root
|
|
XMLString::transcode("FirstSibling", tempStr, 3999);
|
|
DOMElement* E11 = doc->createElement(tempStr);
|
|
root->appendChild(E11);
|
|
|
|
XMLString::transcode("SecondSibling", tempStr, 3999);
|
|
DOMElement* E12 = doc->createElement(tempStr);
|
|
root->appendChild(E12);
|
|
|
|
XMLString::transcode("ThirdSibling", tempStr, 3999);
|
|
DOMElement* E13 = doc->createElement(tempStr);
|
|
root->appendChild(E13);
|
|
|
|
//Attaching texts to few siblings
|
|
XMLString::transcode("Text1", tempStr, 3999);
|
|
DOMText* textNode1 = doc->createTextNode(tempStr);
|
|
E11->appendChild(textNode1);
|
|
|
|
XMLString::transcode("Text2", tempStr, 3999);
|
|
DOMText* textNode2 = doc->createTextNode(tempStr);
|
|
E12->appendChild(textNode2);
|
|
|
|
//creating child of siblings
|
|
XMLString::transcode("FirstSiblingChild1", tempStr, 3999);
|
|
DOMElement* E111 = doc->createElement(tempStr);
|
|
E11->appendChild(E111);
|
|
|
|
XMLString::transcode("Attr01", tempStr, 3999);
|
|
DOMAttr* attr01 = doc->createAttribute(tempStr);
|
|
DOMNode* rem = E11->setAttributeNode(attr01);
|
|
if (rem)
|
|
rem->release();
|
|
|
|
XMLString::transcode("FirstSiblingChild2", tempStr, 3999);
|
|
DOMElement* E112 = doc->createElement(tempStr);
|
|
E11->appendChild(E112);
|
|
|
|
XMLString::transcode("SecondSiblingChild1", tempStr, 3999);
|
|
DOMElement* E121 = doc->createElement(tempStr);
|
|
E12->appendChild(E121);
|
|
|
|
XMLString::transcode("Attr01", tempStr, 3999);
|
|
DOMAttr* attr02 = doc->createAttribute(tempStr);
|
|
rem = E12->setAttributeNode(attr02);
|
|
if (rem)
|
|
rem->release();
|
|
|
|
XMLString::transcode("SecondSiblingChild2", tempStr, 3999);
|
|
DOMElement* E122 = doc->createElement(tempStr);
|
|
E12->appendChild(E122);
|
|
|
|
XMLString::transcode("ThirdSiblingChild1", tempStr, 3999);
|
|
DOMElement* E131 = doc->createElement(tempStr);
|
|
E13->appendChild(E131);
|
|
|
|
XMLString::transcode("DocComment", tempStr, 3999);
|
|
DOMComment* comment = doc->createComment(tempStr);
|
|
root->appendChild(comment);
|
|
|
|
XMLString::transcode("DocCDataSection", tempStr, 3999);
|
|
DOMCDATASection* cdataSec = doc->createCDATASection(tempStr);
|
|
E11->appendChild(cdataSec);
|
|
|
|
XMLString::transcode("DocPI", tempStr, 3999);
|
|
XMLCh piStr[] = {chLatin_D, chLatin_o, chLatin_c, chLatin_P, chLatin_I, chNull};
|
|
DOMProcessingInstruction* docPI = doc->createProcessingInstruction(piStr, tempStr);
|
|
E13->appendChild(docPI);
|
|
|
|
|
|
/*
|
|
following are whatToShow types:
|
|
SHOW_ALL = 0x0000FFFF,
|
|
SHOW_ELEMENT = 0x00000001,
|
|
SHOW_ATTRIBUTE = 0x00000002,
|
|
SHOW_TEXT = 0x00000004,
|
|
SHOW_CDATA_SECTION = 0x00000008,
|
|
SHOW_ENTITY_REFERENCE = 0x00000010,
|
|
SHOW_ENTITY = 0x00000020,
|
|
SHOW_PROCESSING_INSTRUCTION = 0x00000040,
|
|
SHOW_COMMENT = 0x00000080,
|
|
SHOW_DOCUMENT = 0x00000100,
|
|
SHOW_DOCUMENT_TYPE = 0x00000200,
|
|
SHOW_DOCUMENT_FRAGMENT = 0x00000400,
|
|
SHOW_NOTATION = 0x00000800
|
|
*/
|
|
|
|
////////// NodeIterator Test Cases ////////////////
|
|
|
|
|
|
{
|
|
// all node iterating test
|
|
|
|
DOMNode* node = doc->getFirstChild();
|
|
UNUSED(node); // silence warning
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_ALL;
|
|
MyFilter* filter = new MyFilter(0);
|
|
|
|
DOMNodeIterator* iter = ((DOMDocumentTraversal*)doc)->createNodeIterator(root, whatToShow, filter, true);
|
|
TASSERT(iter->getWhatToShow() == 65535);
|
|
TASSERT(iter->getExpandEntityReferences() == 1);
|
|
|
|
DOMNode* nd;
|
|
nd = iter->nextNode();
|
|
TASSERT (nd ==root);
|
|
nd = iter->nextNode();
|
|
TASSERT (nd ==E11);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == textNode1);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E111);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E112);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == cdataSec);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E12);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == textNode2);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E121);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E122);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E13);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E131);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == docPI);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == comment);
|
|
nd = iter->previousNode();
|
|
TASSERT(nd == comment);
|
|
nd = iter->previousNode();
|
|
TASSERT(nd == docPI);
|
|
nd = iter->previousNode();
|
|
TASSERT(nd == E131);
|
|
|
|
//test getRoot
|
|
TASSERT(iter->getRoot() == root);
|
|
TASSERT(iter->getRoot() != doc);
|
|
|
|
delete filter;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
//element node iterating test
|
|
|
|
DOMNode* node = doc->getFirstChild();
|
|
UNUSED(node); // silence warning
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_ELEMENT;
|
|
MyFilter* filter = new MyFilter(DOMNode::ELEMENT_NODE);
|
|
|
|
DOMNodeIterator* iter = doc->createNodeIterator(root, whatToShow, filter, true);
|
|
TASSERT(iter->getWhatToShow() == 1);
|
|
TASSERT(iter->getExpandEntityReferences() == 1);
|
|
|
|
DOMNode* nd;
|
|
nd = iter->nextNode();
|
|
TASSERT (nd ==root);
|
|
nd = iter->nextNode();
|
|
TASSERT (nd ==E11);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E111);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E112);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E12);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E121);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E122);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E13);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == E131);
|
|
nd = iter->previousNode();
|
|
TASSERT(nd == E131);
|
|
nd = iter->previousNode();
|
|
TASSERT(nd == E13);
|
|
nd = iter->previousNode();
|
|
TASSERT(nd == E122);
|
|
|
|
delete filter;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
{
|
|
// Text node iterating test
|
|
|
|
DOMNode* node = doc->getFirstChild();
|
|
UNUSED(node); // silence warning
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_TEXT;
|
|
MyFilter* filter = new MyFilter(DOMNode::TEXT_NODE);
|
|
|
|
DOMNodeIterator* iter = ((DOMDocumentTraversal*)doc)->createNodeIterator(root, whatToShow, filter, true);
|
|
|
|
TASSERT(iter->getWhatToShow() == 4);
|
|
TASSERT(iter->getExpandEntityReferences() == 1);
|
|
|
|
DOMNode* nd;
|
|
nd = iter->nextNode();
|
|
TASSERT (nd ==textNode1);
|
|
nd = iter->nextNode();
|
|
TASSERT (nd ==textNode2);
|
|
nd = iter->previousNode();
|
|
TASSERT(nd == textNode2);
|
|
|
|
delete filter;
|
|
}
|
|
|
|
|
|
{
|
|
//CDataSection node itearating test
|
|
|
|
DOMNode* node = doc->getFirstChild();
|
|
UNUSED(node); // silence warning
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_CDATA_SECTION;
|
|
MyFilter* filter = new MyFilter(DOMNode::CDATA_SECTION_NODE);
|
|
|
|
DOMNodeIterator* iter = doc->createNodeIterator(root, whatToShow, filter, true);
|
|
TASSERT(iter->getWhatToShow() == 8);
|
|
TASSERT(iter->getExpandEntityReferences() == 1);
|
|
|
|
DOMNode* nd;
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == cdataSec);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == 0);
|
|
|
|
delete filter;
|
|
}
|
|
|
|
|
|
{
|
|
// PI nodes iterating test
|
|
|
|
DOMNode* node = doc->getFirstChild();
|
|
UNUSED(node); // silence warning
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_PROCESSING_INSTRUCTION;
|
|
MyFilter* filter = new MyFilter(DOMNode::PROCESSING_INSTRUCTION_NODE);
|
|
|
|
DOMNodeIterator* iter = ((DOMDocumentTraversal*)doc)->createNodeIterator(root, whatToShow, filter, true);
|
|
TASSERT(iter->getWhatToShow() == 64);
|
|
TASSERT(iter->getExpandEntityReferences() == 1);
|
|
|
|
DOMNode* nd;
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == docPI);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == 0);
|
|
|
|
delete filter;
|
|
}
|
|
|
|
|
|
|
|
{
|
|
DOMNode* node = doc->getFirstChild();
|
|
UNUSED(node); // silence warning
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_COMMENT;
|
|
MyFilter* filter = new MyFilter(DOMNode::COMMENT_NODE);
|
|
|
|
DOMNodeIterator* iter = doc->createNodeIterator(root, whatToShow, filter, true);
|
|
TASSERT(iter->getWhatToShow() == 128);
|
|
TASSERT(iter->getExpandEntityReferences() == 1);
|
|
|
|
DOMNode* nd;
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == comment);
|
|
nd = iter->nextNode();
|
|
TASSERT(nd == 0);
|
|
|
|
delete filter;
|
|
}
|
|
|
|
|
|
|
|
|
|
////////// TreeWalker Test Cases ////////////////
|
|
|
|
|
|
|
|
{
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_ALL;
|
|
DOMTreeWalker* tw = ((DOMDocumentTraversal*)doc)->createTreeWalker(doc, whatToShow, 0, true);
|
|
|
|
TASSERT(tw->getCurrentNode() == doc);
|
|
TASSERT(tw->firstChild() == root);
|
|
TASSERT(tw->nextSibling() == 0);
|
|
TASSERT(tw->lastChild() == comment);
|
|
TASSERT(tw->firstChild() == 0);
|
|
TASSERT(tw->lastChild() == 0);
|
|
TASSERT(tw->nextSibling() == 0);
|
|
TASSERT(tw->nextNode() == 0);
|
|
TASSERT(tw->previousSibling() == E13);
|
|
TASSERT(tw->previousNode() == E122);
|
|
TASSERT(tw->parentNode() == E12);
|
|
TASSERT(tw->firstChild() == textNode2);
|
|
TASSERT(tw->previousSibling() == 0);
|
|
TASSERT(tw->nextSibling() == E121);
|
|
TASSERT(tw->nextNode() == E122);
|
|
TASSERT(tw->parentNode() == E12);
|
|
TASSERT(tw->previousSibling() == E11);
|
|
TASSERT(tw->previousNode() == root);
|
|
TASSERT(tw->previousNode() == doc);
|
|
TASSERT(tw->previousNode() == 0);
|
|
TASSERT(tw->parentNode() == 0);
|
|
TASSERT(tw->getCurrentNode() == doc);
|
|
}
|
|
|
|
|
|
|
|
{
|
|
MyFilter mf(DOMNode::ELEMENT_NODE);
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_ALL;
|
|
DOMTreeWalker* tw = doc->createTreeWalker(root, whatToShow, &mf, true);
|
|
|
|
TASSERT(tw->getCurrentNode() == root);
|
|
TASSERT(tw->parentNode() == 0); //should not change currentNode
|
|
TASSERT(tw->getCurrentNode() == root);
|
|
TASSERT(tw->nextNode() == E11);
|
|
TASSERT(tw->nextNode() == E111);
|
|
tw->setCurrentNode(E12);
|
|
//when first is not visible, should it go to its sibling?
|
|
TASSERT(tw->firstChild() == E121); //first visible child
|
|
TASSERT(tw->previousSibling() == 0);
|
|
}
|
|
|
|
|
|
|
|
{
|
|
MyFilter mf(DOMNode::ELEMENT_NODE, true);
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_ELEMENT;
|
|
DOMTreeWalker* tw = ((DOMDocumentTraversal*)doc)->createTreeWalker(root, whatToShow, &mf, true);
|
|
|
|
tw->setCurrentNode(E12);
|
|
TASSERT(tw->firstChild() == E121); //still first visible child
|
|
}
|
|
|
|
|
|
|
|
{
|
|
MyFilter mf(DOMNode::TEXT_NODE);
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_TEXT;
|
|
DOMTreeWalker* tw = doc->createTreeWalker(root, whatToShow, &mf, true);
|
|
|
|
//when first is not visible, should it go to its descendent?
|
|
TASSERT(tw->firstChild() == textNode1); //E11 skipped
|
|
TASSERT(tw->firstChild() == 0);
|
|
TASSERT(tw->nextNode() == textNode2);
|
|
TASSERT(tw->nextSibling() == 0);
|
|
TASSERT(tw->parentNode() == 0); //no visible ancestor
|
|
TASSERT(tw->getCurrentNode() == textNode2);
|
|
tw->setCurrentNode(root);
|
|
//when last is not visible, should it go to its sibling & descendent?
|
|
TASSERT(tw->lastChild() == textNode2); //last visible child
|
|
tw->setCurrentNode(E12);
|
|
//when next sibling is not visible, should it go to its descendent?
|
|
TASSERT(tw->nextSibling() == 0);
|
|
}
|
|
|
|
|
|
|
|
{
|
|
MyFilter mf(DOMNode::TEXT_NODE, true);
|
|
unsigned long whatToShow = DOMNodeFilter::SHOW_TEXT;
|
|
DOMTreeWalker* tw = ((DOMDocumentTraversal*)doc)->createTreeWalker(root, whatToShow, &mf, true);
|
|
|
|
TASSERT(tw->firstChild() == 0); //E11 rejected and no children is TEXT
|
|
TASSERT(tw->getCurrentNode() == root);
|
|
TASSERT(tw->nextNode() == 0); //E11 rejected so can't get to textNode1
|
|
|
|
//test getRoot
|
|
TASSERT(tw->getRoot() == root);
|
|
TASSERT(tw->getRoot() != doc);
|
|
}
|
|
|
|
doc->release();
|
|
|
|
};
|
|
|
|
// And call the termination method
|
|
XMLPlatformUtils::Terminate();
|
|
|
|
if (errorOccurred) {
|
|
printf("Test Failed\n");
|
|
return 4;
|
|
}
|
|
|
|
printf("Test Run Successfully\n");
|
|
return 0;
|
|
};
|