mirror of
https://github.com/VCMP-SqMod/SqMod.git
synced 2025-02-24 13:47:14 +01:00
4a6bfc086c
Switched to POCO library for unified platform/library interface. Deprecated the external module API. It was creating more problems than solving. Removed most built-in libraries in favor of system libraries for easier maintenance. Cleaned and secured code with help from static analyzers.
308 lines
8.6 KiB
C++
308 lines
8.6 KiB
C++
//
|
|
// TreeWalkerTest.cpp
|
|
//
|
|
// Copyright (c) 2004-2006, Applied Informatics Software Engineering GmbH.
|
|
// and Contributors.
|
|
//
|
|
// SPDX-License-Identifier: BSL-1.0
|
|
//
|
|
|
|
|
|
#include "TreeWalkerTest.h"
|
|
#include "CppUnit/TestCaller.h"
|
|
#include "CppUnit/TestSuite.h"
|
|
#include "Poco/DOM/TreeWalker.h"
|
|
#include "Poco/DOM/NodeFilter.h"
|
|
#include "Poco/DOM/Document.h"
|
|
#include "Poco/DOM/Element.h"
|
|
#include "Poco/DOM/Text.h"
|
|
#include "Poco/DOM/AutoPtr.h"
|
|
|
|
|
|
using Poco::XML::TreeWalker;
|
|
using Poco::XML::NodeFilter;
|
|
using Poco::XML::Element;
|
|
using Poco::XML::Document;
|
|
using Poco::XML::Text;
|
|
using Poco::XML::Node;
|
|
using Poco::XML::AutoPtr;
|
|
using Poco::XML::XMLString;
|
|
|
|
|
|
namespace
|
|
{
|
|
class RejectNodeFilter: public NodeFilter
|
|
{
|
|
short acceptNode(Node* node)
|
|
{
|
|
if (node->nodeType() != Node::ELEMENT_NODE || node->innerText() == "text1" || node->nodeName() == "root")
|
|
return NodeFilter::FILTER_ACCEPT;
|
|
else
|
|
return NodeFilter::FILTER_REJECT;
|
|
}
|
|
};
|
|
|
|
class SkipNodeFilter: public NodeFilter
|
|
{
|
|
short acceptNode(Node* node)
|
|
{
|
|
if (node->nodeType() != Node::ELEMENT_NODE || node->innerText() == "text1")
|
|
return NodeFilter::FILTER_ACCEPT;
|
|
else
|
|
return NodeFilter::FILTER_SKIP;
|
|
}
|
|
};
|
|
}
|
|
|
|
|
|
TreeWalkerTest::TreeWalkerTest(const std::string& name): CppUnit::TestCase(name)
|
|
{
|
|
}
|
|
|
|
|
|
TreeWalkerTest::~TreeWalkerTest()
|
|
{
|
|
}
|
|
|
|
|
|
void TreeWalkerTest::testShowAll()
|
|
{
|
|
AutoPtr<Document> pDoc = new Document;
|
|
AutoPtr<Element> pRoot = pDoc->createElement("root");
|
|
AutoPtr<Element> pElem1 = pDoc->createElement("elem");
|
|
AutoPtr<Element> pElem2 = pDoc->createElement("elem");
|
|
AutoPtr<Text> pText1 = pDoc->createTextNode("text1");
|
|
AutoPtr<Text> pText2 = pDoc->createTextNode("text2");
|
|
|
|
pElem1->appendChild(pText1);
|
|
pElem2->appendChild(pText2);
|
|
pRoot->appendChild(pElem1);
|
|
pRoot->appendChild(pElem2);
|
|
pDoc->appendChild(pRoot);
|
|
|
|
TreeWalker it(pRoot, NodeFilter::SHOW_ALL);
|
|
|
|
assertTrue (it.currentNode() == pRoot);
|
|
assertTrue (it.nextNode() == pElem1);
|
|
assertTrue (it.nextNode() == pText1);
|
|
assertTrue (it.nextNode() == pElem2);
|
|
assertTrue (it.nextNode() == pText2);
|
|
assertTrue (it.nextNode() == 0);
|
|
|
|
assertTrue (it.currentNode() == pText2);
|
|
assertTrue (it.previousNode() == pElem2);
|
|
assertTrue (it.previousNode() == pText1);
|
|
assertTrue (it.previousNode() == pElem1);
|
|
assertTrue (it.previousNode() == pRoot);
|
|
assertTrue (it.previousNode() == 0);
|
|
|
|
assertTrue (it.currentNode() == pRoot);
|
|
assertTrue (it.parentNode() == 0);
|
|
assertTrue (it.currentNode() == pRoot);
|
|
assertTrue (it.firstChild() == pElem1);
|
|
assertTrue (it.parentNode() == pRoot);
|
|
assertTrue (it.lastChild() == pElem2);
|
|
assertTrue (it.previousSibling() == pElem1);
|
|
assertTrue (it.previousSibling() == 0);
|
|
assertTrue (it.currentNode() == pElem1);
|
|
assertTrue (it.nextSibling() == pElem2);
|
|
assertTrue (it.nextSibling() == 0);
|
|
assertTrue (it.currentNode() == pElem2);
|
|
assertTrue (it.firstChild() == pText2);
|
|
assertTrue (it.nextSibling() == 0);
|
|
assertTrue (it.previousSibling() == 0);
|
|
assertTrue (it.parentNode() == pElem2);
|
|
assertTrue (it.lastChild() == pText2);
|
|
}
|
|
|
|
|
|
void TreeWalkerTest::testShowElements()
|
|
{
|
|
AutoPtr<Document> pDoc = new Document;
|
|
AutoPtr<Element> pRoot = pDoc->createElement("root");
|
|
AutoPtr<Element> pElem1 = pDoc->createElement("elem");
|
|
AutoPtr<Element> pElem2 = pDoc->createElement("elem");
|
|
AutoPtr<Text> pText1 = pDoc->createTextNode("text1");
|
|
AutoPtr<Text> pText2 = pDoc->createTextNode("text2");
|
|
|
|
pElem1->appendChild(pText1);
|
|
pElem2->appendChild(pText2);
|
|
pRoot->appendChild(pElem1);
|
|
pRoot->appendChild(pElem2);
|
|
pDoc->appendChild(pRoot);
|
|
|
|
TreeWalker it(pRoot, NodeFilter::SHOW_ELEMENT);
|
|
|
|
assertTrue (it.currentNode() == pRoot);
|
|
assertTrue (it.nextNode() == pElem1);
|
|
assertTrue (it.nextNode() == pElem2);
|
|
assertTrue (it.nextNode() == 0);
|
|
|
|
assertTrue (it.currentNode() == pElem2);
|
|
assertTrue (it.previousNode() == pElem1);
|
|
assertTrue (it.previousNode() == pRoot);
|
|
assertTrue (it.previousNode() == 0);
|
|
|
|
assertTrue (it.currentNode() == pRoot);
|
|
assertTrue (it.parentNode() == 0);
|
|
assertTrue (it.currentNode() == pRoot);
|
|
assertTrue (it.firstChild() == pElem1);
|
|
assertTrue (it.parentNode() == pRoot);
|
|
assertTrue (it.lastChild() == pElem2);
|
|
assertTrue (it.firstChild() == 0);
|
|
assertTrue (it.currentNode() == pElem2);
|
|
assertTrue (it.lastChild() == 0);
|
|
assertTrue (it.currentNode() == pElem2);
|
|
assertTrue (it.previousSibling() == pElem1);
|
|
assertTrue (it.firstChild() == 0);
|
|
assertTrue (it.lastChild() == 0);
|
|
assertTrue (it.parentNode() == pRoot);
|
|
}
|
|
|
|
|
|
void TreeWalkerTest::testFilter()
|
|
{
|
|
AutoPtr<Document> pDoc = new Document;
|
|
AutoPtr<Element> pRoot = pDoc->createElement("root");
|
|
AutoPtr<Element> pElem1 = pDoc->createElement("elem");
|
|
AutoPtr<Element> pElem2 = pDoc->createElement("elem");
|
|
AutoPtr<Text> pText1 = pDoc->createTextNode("text1");
|
|
AutoPtr<Text> pText2 = pDoc->createTextNode("text2");
|
|
|
|
pElem1->appendChild(pText1);
|
|
pElem2->appendChild(pText2);
|
|
pRoot->appendChild(pElem1);
|
|
pRoot->appendChild(pElem2);
|
|
pDoc->appendChild(pRoot);
|
|
|
|
SkipNodeFilter skipFilter;
|
|
TreeWalker it1(pRoot, NodeFilter::SHOW_ELEMENT, &skipFilter);
|
|
|
|
assertTrue (it1.nextNode() == pElem1);
|
|
assertTrue (it1.nextNode() == 0);
|
|
|
|
assertTrue (it1.currentNode() == pElem1);
|
|
assertTrue (it1.previousNode() == 0);
|
|
|
|
assertTrue (it1.parentNode() == 0);
|
|
assertTrue (it1.firstChild() == 0);
|
|
assertTrue (it1.lastChild() == 0);
|
|
assertTrue (it1.nextSibling() == 0);
|
|
assertTrue (it1.previousSibling() == 0);
|
|
|
|
TreeWalker it2(pRoot, NodeFilter::SHOW_ALL, &skipFilter);
|
|
|
|
assertTrue (it2.nextNode() == pElem1);
|
|
assertTrue (it2.nextNode() == pText1);
|
|
assertTrue (it2.nextNode() == pText2);
|
|
assertTrue (it2.nextNode() == 0);
|
|
|
|
assertTrue (it2.currentNode() == pText2);
|
|
assertTrue (it2.previousNode() == pText1);
|
|
assertTrue (it2.previousNode() == pElem1);
|
|
assertTrue (it2.previousNode() == 0);
|
|
|
|
assertTrue (it2.currentNode() == pElem1);
|
|
assertTrue (it2.parentNode() == 0);
|
|
assertTrue (it2.nextSibling() == 0);
|
|
assertTrue (it2.previousSibling() == 0);
|
|
assertTrue (it2.firstChild() == pText1);
|
|
assertTrue (it2.nextSibling() == 0);
|
|
assertTrue (it2.previousSibling() == 0);
|
|
assertTrue (it2.parentNode() == pElem1);
|
|
|
|
RejectNodeFilter rejectFilter;
|
|
TreeWalker it3(pRoot, NodeFilter::SHOW_ELEMENT, &rejectFilter);
|
|
|
|
assertTrue (it3.nextNode() == pElem1);
|
|
assertTrue (it3.nextNode() == 0);
|
|
|
|
assertTrue (it3.currentNode() == pElem1);
|
|
assertTrue (it3.previousNode() == pRoot);
|
|
assertTrue (it3.previousNode() == 0);
|
|
|
|
assertTrue (it3.currentNode() == pRoot);
|
|
assertTrue (it3.parentNode() == 0);
|
|
assertTrue (it3.firstChild() == pElem1);
|
|
assertTrue (it3.nextSibling() == 0);
|
|
assertTrue (it3.previousSibling() == 0);
|
|
assertTrue (it3.parentNode() == pRoot);
|
|
assertTrue (it3.lastChild() == pElem1);
|
|
|
|
TreeWalker it4(pRoot, NodeFilter::SHOW_ALL, &rejectFilter);
|
|
|
|
assertTrue (it4.nextNode() == pElem1);
|
|
assertTrue (it4.nextNode() == pText1);
|
|
assertTrue (it4.nextNode() == 0);
|
|
|
|
assertTrue (it4.currentNode() == pText1);
|
|
assertTrue (it4.previousNode() == pElem1);
|
|
assertTrue (it4.previousNode() == pRoot);
|
|
assertTrue (it4.previousNode() == 0);
|
|
|
|
assertTrue (it4.currentNode() == pRoot);
|
|
assertTrue (it4.parentNode() == 0);
|
|
assertTrue (it4.firstChild() == pElem1);
|
|
assertTrue (it4.firstChild() == pText1);
|
|
assertTrue (it4.nextSibling() == 0);
|
|
assertTrue (it4.previousSibling() == 0);
|
|
assertTrue (it4.parentNode() == pElem1);
|
|
assertTrue (it4.lastChild() == pText1);
|
|
assertTrue (it4.parentNode() == pElem1);
|
|
assertTrue (it4.nextSibling() == 0);
|
|
assertTrue (it4.previousSibling() == 0);
|
|
assertTrue (it4.parentNode() == pRoot);
|
|
}
|
|
|
|
|
|
void TreeWalkerTest::testShowNothing()
|
|
{
|
|
AutoPtr<Document> pDoc = new Document;
|
|
AutoPtr<Element> pRoot = pDoc->createElement("root");
|
|
AutoPtr<Element> pElem1 = pDoc->createElement("elem");
|
|
AutoPtr<Element> pElem2 = pDoc->createElement("elem");
|
|
AutoPtr<Text> pText1 = pDoc->createTextNode("text1");
|
|
AutoPtr<Text> pText2 = pDoc->createTextNode("text2");
|
|
|
|
pElem1->appendChild(pText1);
|
|
pElem2->appendChild(pText2);
|
|
pRoot->appendChild(pElem1);
|
|
pRoot->appendChild(pElem2);
|
|
pDoc->appendChild(pRoot);
|
|
|
|
TreeWalker it(pRoot, 0);
|
|
|
|
assertTrue (it.nextNode() == 0);
|
|
|
|
assertTrue (it.previousNode() == 0);
|
|
|
|
assertTrue (it.currentNode() == pRoot);
|
|
assertTrue (it.firstChild() == 0);
|
|
assertTrue (it.lastChild() == 0);
|
|
assertTrue (it.nextSibling() == 0);
|
|
assertTrue (it.previousSibling() == 0);
|
|
}
|
|
|
|
|
|
void TreeWalkerTest::setUp()
|
|
{
|
|
}
|
|
|
|
|
|
void TreeWalkerTest::tearDown()
|
|
{
|
|
}
|
|
|
|
|
|
CppUnit::Test* TreeWalkerTest::suite()
|
|
{
|
|
CppUnit::TestSuite* pSuite = new CppUnit::TestSuite("TreeWalkerTest");
|
|
|
|
CppUnit_addTest(pSuite, TreeWalkerTest, testShowAll);
|
|
CppUnit_addTest(pSuite, TreeWalkerTest, testShowElements);
|
|
CppUnit_addTest(pSuite, TreeWalkerTest, testFilter);
|
|
CppUnit_addTest(pSuite, TreeWalkerTest, testShowNothing);
|
|
|
|
return pSuite;
|
|
}
|