diff options
Diffstat (limited to 'src/uscxml/util/DOM.cpp')
-rw-r--r-- | src/uscxml/util/DOM.cpp | 402 |
1 files changed, 402 insertions, 0 deletions
diff --git a/src/uscxml/util/DOM.cpp b/src/uscxml/util/DOM.cpp new file mode 100644 index 0000000..c7ed1e9 --- /dev/null +++ b/src/uscxml/util/DOM.cpp @@ -0,0 +1,402 @@ +/** + * @file + * @author 2012-2013 Stefan Radomski (stefan.radomski@cs.tu-darmstadt.de) + * @copyright Simplified BSD + * + * @cond + * This program is free software: you can redistribute it and/or modify + * it under the terms of the FreeBSD license as published by the FreeBSD + * project. + * + * This program 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. + * + * You should have received a copy of the FreeBSD license along with this + * program. If not, see <http://www.opensource.org/licenses/bsd-license>. + * @endcond + */ + +#include <algorithm> + +#include "uscxml/Common.h" +#include "uscxml/util/Convenience.h" +//#include "uscxml/util/UUID.h" +#include "uscxml/util/DOM.h" +//#include "uscxml/util/Convenience.h" + +#include <xercesc/util/PlatformUtils.hpp> +#include <xercesc/dom/DOM.hpp> +#include <xercesc/framework/StdOutFormatTarget.hpp> + +#include "easylogging++.h" + +//#include <glog/logging.h> +//#include <boost/algorithm/string.hpp> + +namespace uscxml { + +using namespace xercesc; + +std::ostream& operator<< (std::ostream& os, const DOMNode& node) { + + DOMImplementation *implementation = DOMImplementationRegistry::getDOMImplementation(X("LS")); + DOMLSSerializer *serializer = ((DOMImplementationLS*)implementation)->createLSSerializer(); + if (serializer->getDomConfig()->canSetParameter(XMLUni::fgDOMWRTFormatPrettyPrint, true)) + serializer->getDomConfig()->setParameter(XMLUni::fgDOMWRTFormatPrettyPrint, true); + serializer->setNewLine(XMLString::transcode("\r\n")); + + X output = serializer->writeToString(&node); + os << output; + return os; +} + +std::ostream& operator<< (std::ostream& os, const X& xmlString) { + os << xmlString._localForm; + return os; +} + +std::string DOMUtils::idForNode(const DOMNode* node) { + std::string nodeId; + std::string seperator; + const DOMNode* curr = node; + while(curr) { + switch (curr->getNodeType()) { + case DOMNode::ELEMENT_NODE: { + const DOMElement* elem = dynamic_cast<const DOMElement*>(curr); + if (HAS_ATTR(elem, "id")) { + std::string elementId = ATTR(elem, "id"); + std::replace( elementId.begin(), elementId.end(), '.', '_'); + std::replace( elementId.begin(), elementId.end(), ',', '_'); + + nodeId.insert(0, elementId + seperator); + seperator = "_"; + return nodeId; + } else { + DOMNode* sibling = curr->getPreviousSibling(); + int index = 0; + while(sibling) { + if (sibling->getNodeType() == DOMNode::ELEMENT_NODE) { + if (iequals(TAGNAME_CAST(sibling), TAGNAME(elem))) { + index++; + } + } + sibling = sibling->getPreviousSibling(); + } + nodeId.insert(0, TAGNAME(elem) + toStr(index) + seperator); + seperator = "_"; + } + break; + } + case DOMNode::DOCUMENT_NODE: + return nodeId; + default: + break; + } + + curr = curr->getParentNode(); + } + return nodeId; +} + +std::string DOMUtils::xPathForNode(const DOMNode* node, const std::string& ns) { + std::string xPath; + std::string nsPrefix; + + if (ns.size() > 0) { + nsPrefix = ns + ":"; + } + + if (!node || node->getNodeType() != DOMNode::ELEMENT_NODE) + return xPath; + + const DOMNode* curr = node; + while(curr) { + switch (curr->getNodeType()) { + case DOMNode::ELEMENT_NODE: { + const DOMElement* elem = dynamic_cast<const DOMElement*>(curr); + if (HAS_ATTR(elem, "id")) { + // we assume ids to be unique and return immediately + if (ns == "*") { + xPath.insert(0, "//*[local-name() = \"" + TAGNAME(elem) + "\"][@id=\"" + ATTR(elem, "id") + "\"]"); + } else { + xPath.insert(0, "//" + nsPrefix + TAGNAME(elem) + "[@id=\"" + ATTR(elem, "id") + "\"]"); + } + return xPath; + } else { + // check previous siblings to count our index + DOMNode* sibling = curr->getPreviousSibling(); + int index = 1; // xpath indices start at 1 + while(sibling) { + if (sibling->getNodeType() == DOMNode::ELEMENT_NODE) { + if (iequals(TAGNAME_CAST(sibling), TAGNAME(elem))) { + index++; + } + } + sibling = sibling->getPreviousSibling(); + } + if (ns == "*") { + xPath.insert(0, "/*[local-name() = \"" + TAGNAME(elem) + "\"][" + toStr(index) + "]"); + } else { + xPath.insert(0, "/" + nsPrefix + TAGNAME(elem) + "[" + toStr(index) + "]"); + } + } + break; + } + case DOMNode::DOCUMENT_NODE: + return xPath; + default: + LOG(ERROR) << "Only nodes of type element supported for now"; + return ""; + break; + } + curr = curr->getParentNode(); + } + return xPath; +} + +bool DOMUtils::hasIntersection(const std::list<DOMElement*>& l1, const std::list<DOMElement*>& l2) { + for (auto i = l1.begin(); i != l1.end(); i++) { + for (auto j = l2.begin(); j != l2.end(); j++) { + if (*i == *j) + return true; + } + } + return false; +} + +bool DOMUtils::isMember(const DOMNode* node, + const DOMNodeList* list) { + for (size_t i = 0; i < list->getLength(); i++) { + if (list->item(i) == node) + return true; + } + return false; +} + +bool DOMUtils::isMember(const DOMNode* node, + const std::list<DOMNode*>& list) { + + for (auto listIter = list.begin(); listIter != list.end(); listIter++) { + if ((*listIter) == node) + return true; + } + return false; +} + +bool DOMUtils::isMember(const DOMElement* node, + const std::list<DOMElement*>& list) { + + for (auto listIter = list.begin(); listIter != list.end(); listIter++) { + if ((*listIter) == node) + return true; + } + return false; +} + +const DOMNode* DOMUtils::getNearestAncestor(const DOMNode* node, const std::string tagName) { + const DOMNode* parent = node->getParentNode(); + while(parent) { + if (parent->getNodeType() == DOMNode::ELEMENT_NODE && + iequals(TAGNAME_CAST(parent), tagName)) { + return parent; + } + parent = parent->getParentNode(); + } + return NULL; +} + +bool DOMUtils::isDescendant(const DOMNode* s1, + const DOMNode* s2) { + if (!s1 || !s2) + return false; + + const DOMNode* parent = s1->getParentNode(); + while(parent) { + if (s2 == parent) + return true; + parent = parent->getParentNode(); + } + return false; +} + +std::list<DOMElement*> DOMUtils::inPostFixOrder(const std::set<std::string>& elements, + const DOMElement* root, + const bool includeEmbeddedDoc) { + std::list<DOMElement*> nodes; + inPostFixOrder(elements, root, includeEmbeddedDoc, nodes); + return nodes; +} + +void DOMUtils::inPostFixOrder(const std::set<std::string>& elements, + const DOMElement* root, + const bool includeEmbeddedDoc, + std::list<DOMElement*>& nodes) { + + DOMNodeList* children = root->getChildNodes(); + for (size_t i = 0; i < children->getLength(); i++) { + if (children->item(i)->getNodeType() != DOMNode::ELEMENT_NODE) + continue; + const DOMElement* childElem = dynamic_cast<const DOMElement*>(children->item(i)); + if (!includeEmbeddedDoc && LOCALNAME(childElem) == "scxml") + continue; + inPostFixOrder(elements, childElem, includeEmbeddedDoc, nodes); + + } + for (size_t i = 0; i < children->getLength(); i++) { + if (children->item(i)->getNodeType() != DOMNode::ELEMENT_NODE) + continue; + const DOMElement* childElem = dynamic_cast<const DOMElement*>(children->item(i)); + if (!includeEmbeddedDoc && TAGNAME(childElem) == XML_PREFIX(root).str() + "scxml") + continue; + + if (elements.find(TAGNAME(childElem)) != elements.end()) { + nodes.push_back((DOMElement*)childElem); + } + } +} + +std::list<DOMElement*> DOMUtils::inDocumentOrder(const std::set<std::string>& elements, + const DOMElement* root, + const bool includeEmbeddedDoc) { + std::list<DOMElement*> nodes; + inDocumentOrder(elements, root, includeEmbeddedDoc, nodes); + return nodes; +} + +void DOMUtils::inDocumentOrder(const std::set<std::string>& elements, + const DOMElement* root, + const bool includeEmbeddedDoc, + std::list<DOMElement*>& nodes) { + if (elements.find(TAGNAME(root)) != elements.end()) { + nodes.push_back((DOMElement*)root); + } + + DOMNodeList* children = root->getChildNodes(); + for (size_t i = 0; i < children->getLength(); i++) { + if (children->item(i)->getNodeType() != DOMNode::ELEMENT_NODE) + continue; + const DOMElement* childElem = dynamic_cast<const DOMElement*>(children->item(i)); + if (!includeEmbeddedDoc && TAGNAME(childElem) == XML_PREFIX(root).str() + "scxml") + continue; + inDocumentOrder(elements, childElem, includeEmbeddedDoc, nodes); + } +} + +std::list<DOMNode*> DOMUtils::getElementsByType(const DOMNode* root, + DOMNode::NodeType type) { + std::list<DOMNode*> result; + std::list<DOMNode*> stack; + std::list<DOMNode*>::iterator stackIter; + + if (!root) + return result; + + stack.push_back((DOMNode*)root); + while(stack.size() > 0) { +// for(stackIter = stack.begin(); stackIter != stack.end(); stackIter++) { +// std::cout << stackIter->getNodeType() << " " << stackIter->getLocalName() << " " << stackIter->getNodeValue() << std::endl; +// } +// std::cout << std::endl; + + DOMNode* currNode = stack.back(); + if (currNode->hasChildNodes()) { + stack.push_back(currNode->getFirstChild()); + continue; + } + + // roll back stack and pop everyone without next sibling + do { + currNode = stack.back(); + if (currNode->getNodeType() == type) + result.push_back(currNode); + stack.pop_back(); + if (currNode->getNextSibling()) { + stack.push_back(currNode->getNextSibling()); + break; + } + } while(stack.size() > 0); + } + return result; +} + + +std::list<DOMElement*> DOMUtils::filterChildElements(const std::string& tagName, + const std::list<DOMElement*>& nodeSet, + bool recurse) { + + std::list<DOMElement*> filteredChildElems; + std::list<DOMElement*>::const_iterator nodeIter = nodeSet.begin(); + while(nodeIter != nodeSet.end()) { + std::list<DOMElement*> filtered = filterChildElements(tagName, *nodeIter, recurse); + filteredChildElems.merge(filtered); // TODO: guess we want insert? + nodeIter++; + } + return filteredChildElems; +} + +std::list<DOMElement*> DOMUtils::filterChildElements(const std::string& tagName, + const DOMElement* node, + bool recurse) { + + std::list<DOMElement*> filteredChildElems; + + if (!node) + return filteredChildElems; + + DOMNodeList* children = node->getChildNodes(); + for (unsigned int i = 0; i < children->getLength(); i++) { + if (children->item(i)->getNodeType() != DOMNode::ELEMENT_NODE) + continue; + const DOMElement* childElem = dynamic_cast<const DOMElement*>(children->item(i)); + + // std::cerr << TAGNAME(childs.item(i)) << std::endl; + if(iequals(TAGNAME(childElem), tagName)) { + filteredChildElems.push_back((DOMElement*)childElem); + } + if (recurse) { + std::list<DOMElement*> nested = filterChildElements(tagName, childElem, recurse); + filteredChildElems.merge(nested); + } + } + return filteredChildElems; +} + + +std::list<DOMNode*> DOMUtils::filterChildType(const DOMNode::NodeType type, + const std::list<DOMNode*>& nodeSet, + bool recurse) { + std::list<DOMNode*> filteredChildType; + std::list<DOMNode*>::const_iterator nodeIter = nodeSet.begin(); + while(nodeIter != nodeSet.end()) { + std::list<DOMNode*> filtered = filterChildType(type, *nodeIter, recurse); + filteredChildType.merge(filtered); + nodeIter++; + } + return filteredChildType; +} + +std::list<DOMNode*> DOMUtils::filterChildType(const DOMNode::NodeType type, + const DOMNode* node, + bool recurse) { + + std::list<DOMNode*> filteredChildTypes; + + if (!node) + return filteredChildTypes; + + DOMNodeList* children = node->getChildNodes(); + for (unsigned int i = 0; i < children->getLength(); i++) { + if (children->item(i)->getNodeType() == type) + filteredChildTypes.push_back(children->item(i)); + if (recurse) { + std::list<DOMNode*> nested = filterChildType(type, children->item(i), recurse); + filteredChildTypes.merge(nested); + + } + } + return filteredChildTypes; +} + + +}
\ No newline at end of file |