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
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
133
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
|
/****************************************************************************
**
** Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QVariant>
#include "qabstractxmlnodemodel_p.h"
#include "qitemmappingiterator_p.h"
#include "qitem_p.h"
#include "qxmlname.h"
#include "qxmlquery_p.h"
#include "qpullbridge_p.h"
QT_BEGIN_NAMESPACE
using namespace QPatternist;
/*!
\brief Bridges a QPatternist::SequenceIterator to QAbstractXmlPullProvider.
\class QPatternist::PullBridge
\internal
\reentrant
\ingroup xml-tools
The approach of this class is rather straight forward since QPatternist::SequenceIterator
and QAbstractXmlPullProvider are conceptually similar. While QPatternist::SequenceIterator only
delivers top level items(since it's not an event stream, it's a list of items), PullBridge
needs to recursively iterate the children of nodes too, which is achieved through the
stack m_iterators.
*/
AbstractXmlPullProvider::Event PullBridge::next()
{
m_index = m_iterators.top().second->next();
if(!m_index.isNull())
{
Item item(m_index);
if(item && item.isAtomicValue())
m_current = AtomicValue;
else
{
Q_ASSERT(item.isNode());
switch(m_index.kind())
{
case QXmlNodeModelIndex::Attribute:
{
m_current = Attribute;
break;
}
case QXmlNodeModelIndex::Comment:
{
m_current = Comment;
break;
}
case QXmlNodeModelIndex::Element:
{
m_iterators.push(qMakePair(StartElement, m_index.iterate(QXmlNodeModelIndex::AxisChild)));
m_current = StartElement;
break;
}
case QXmlNodeModelIndex::Document:
{
m_iterators.push(qMakePair(StartDocument, m_index.iterate(QXmlNodeModelIndex::AxisChild)));
m_current = StartDocument;
break;
}
case QXmlNodeModelIndex::Namespace:
{
m_current = Namespace;
break;
}
case QXmlNodeModelIndex::ProcessingInstruction:
{
m_current = ProcessingInstruction;
break;
}
case QXmlNodeModelIndex::Text:
{
m_current = Text;
break;
}
}
}
}
else
{
if(m_iterators.isEmpty())
m_current = EndOfInput;
else
{
switch(m_iterators.top().first)
{
case StartOfInput:
{
m_current = EndOfInput;
break;
}
case StartElement:
{
m_current = EndElement;
m_iterators.pop();
break;
}
case StartDocument:
{
m_current = EndDocument;
m_iterators.pop();
break;
}
default:
{
Q_ASSERT_X(false, Q_FUNC_INFO,
"Invalid value.");
m_current = EndOfInput;
}
}
}
}
return m_current;
}
AbstractXmlPullProvider::Event PullBridge::current() const
{
return m_current;
}
QXmlNodeModelIndex PullBridge::index() const
{
return m_index;
}
QSourceLocation PullBridge::sourceLocation() const
{
return m_index.model()->sourceLocation(m_index);
}
QXmlName PullBridge::name() const
{
return m_index.name();
}
QVariant PullBridge::atomicValue() const
{
return QVariant();
}
QString PullBridge::stringValue() const
{
return QString();
}
QHash<QXmlName, QString> PullBridge::attributes()
{
Q_ASSERT(m_current == StartElement);
QHash<QXmlName, QString> attributes;
QXmlNodeModelIndex::Iterator::Ptr it = m_index.iterate(QXmlNodeModelIndex::AxisAttribute);
QXmlNodeModelIndex index = it->next();
while (!index.isNull()) {
const Item attribute(index);
attributes.insert(index.name(), index.stringValue());
index = it->next();
}
return attributes;
}
QHash<QXmlName, QXmlItem> PullBridge::attributeItems()
{
Q_ASSERT(m_current == StartElement);
QHash<QXmlName, QXmlItem> attributes;
QXmlNodeModelIndex::Iterator::Ptr it = m_index.iterate(QXmlNodeModelIndex::AxisAttribute);
QXmlNodeModelIndex index = it->next();
while (!index.isNull()) {
const Item attribute(index);
attributes.insert(index.name(), QXmlItem(index));
index = it->next();
}
return attributes;
}
QT_END_NAMESPACE
|
