blob: e54099ebfa67caa12abc843ddd599e43490a25fa (
plain)
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
|
/**
* @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 <uscxml/Common.h>
#include "uscxml/DOMUtils.h"
#include <uscxml/Convenience.h>
#include <glog/logging.h>
#include <SAX/helpers/InputSourceResolver.hpp>
namespace uscxml {
std::string DOMUtils::xPathForNode(const Arabica::DOM::Node<std::string>& node) {
std::string xPath;
if (!node || node.getNodeType() != Arabica::DOM::Node_base::ELEMENT_NODE)
return xPath;
Arabica::DOM::Node<std::string> curr = node;
while(curr) {
switch (curr.getNodeType()) {
case Arabica::DOM::Node_base::ELEMENT_NODE: {
if (HAS_ATTR(curr, "id")) {
// we assume ids to be unique and return immediately
xPath.insert(0, "//" + TAGNAME(curr) + "[@id=\"" + ATTR(curr, "id") + "\"]");
return xPath;
} else {
// check previous siblings to count our index
Arabica::DOM::Node<std::string> sibling = curr.getPreviousSibling();
int index = 1;
while(sibling) {
if (sibling.getNodeType() == Arabica::DOM::Node_base::ELEMENT_NODE) {
if (iequals(TAGNAME(sibling), TAGNAME(curr))) {
index++;
}
}
sibling = sibling.getPreviousSibling();
}
xPath.insert(0, "/" + TAGNAME(curr) + "[" + toStr(index) + "]");
}
break;
}
case Arabica::DOM::Node_base::DOCUMENT_NODE:
return xPath;
default:
LOG(ERROR) << "Only nodes of type element supported for now";
return "";
break;
}
curr = curr.getParentNode();
}
return xPath;
}
NameSpacingParser NameSpacingParser::fromXML(const std::string& xml) {
std::stringstream* ss = new std::stringstream();
(*ss) << xml;
// we need an auto_ptr for arabica to assume ownership
std::auto_ptr<std::istream> ssPtr(ss);
Arabica::SAX::InputSource<std::string> inputSource;
inputSource.setByteStream(ssPtr);
return fromInputSource(inputSource);
}
NameSpacingParser NameSpacingParser::fromInputSource(Arabica::SAX::InputSource<std::string>& source) {
NameSpacingParser parser;
if(!parser.parse(source) || !parser.getDocument().hasChildNodes()) {
if(parser._errorHandler.errorsReported()) {
LOG(ERROR) << "could not parse input:";
LOG(ERROR) << parser._errorHandler.errors() << std::endl;
} else {
Arabica::SAX::InputSourceResolver resolver(source, Arabica::default_string_adaptor<std::string>());
if (!resolver.resolve()) {
LOG(ERROR) << source.getSystemId() << ": no such file";
}
}
}
return parser;
}
NameSpacingParser::NameSpacingParser() {
setErrorHandler(_errorHandler);
}
void NameSpacingParser::startPrefixMapping(const std::string& prefix, const std::string& uri) {
nameSpace.insert(std::make_pair(uri, prefix));
}
}
|
