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
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtXmlPatterns module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** GNU Lesser General Public License Usage
** Alternatively, 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.0, 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.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at http://www.qtsoftware.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists purely as an
// implementation detail. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
#ifndef Patternist_AccelTreeBuilder_H
#define Patternist_AccelTreeBuilder_H
#include <QSet>
#include <QStack>
#include "private/qxmlutils_p.h"
#include "qacceltree_p.h"
#include "qbuiltintypes_p.h"
#include "qcompressedwhitespace_p.h"
#include "qnamepool_p.h"
#include "qnodebuilder_p.h"
#include "qreportcontext_p.h"
#include "qsourcelocationreflection_p.h"
#include "qpatternistlocale_p.h"
#include <QtDebug>
QT_BEGIN_HEADER
QT_BEGIN_NAMESPACE
namespace QPatternist
{
/**
* @short Builds an AccelTree from a stream of XML/Item events
* received through the NodeBuilder interface.
*
* If FromDocument is @c true, it is assumed that AccelTreeBuilder is fed
* events from an XML document, otherwise it is assumed the events
* are from node constructor expressions.
*
* @author Frans Englich <fenglich@trolltech.com>
*/
template<bool FromDocument>
class AccelTreeBuilder : public NodeBuilder
, public SourceLocationReflection
{
public:
typedef QExplicitlySharedDataPointer<AccelTreeBuilder> Ptr;
/**
* Describes the memory relevant features the builder shall support.
*/
enum Feature
{
NoneFeature, ///< No special features are enabled.
SourceLocationsFeature = 1 ///< The accel tree builder will store source locations for each start element.
};
Q_DECLARE_FLAGS(Features, Feature)
/**
* @param context may be @c null.
*/
AccelTreeBuilder(const QUrl &docURI,
const QUrl &baseURI,
const NamePool::Ptr &np,
ReportContext *const context,
Features features = NoneFeature);
virtual void startDocument();
virtual void endDocument();
virtual void startElement(const QXmlName &name);
void startElement(const QXmlName &name, qint64 line, qint64 column);
virtual void endElement();
virtual void attribute(const QXmlName &name, const QStringRef &value);
virtual void characters(const QStringRef &ch);
virtual void whitespaceOnly(const QStringRef &ch);
virtual void processingInstruction(const QXmlName &target,
const QString &data);
virtual void namespaceBinding(const QXmlName &nb);
virtual void comment(const QString &content);
virtual void item(const Item &it);
virtual QAbstractXmlNodeModel::Ptr builtDocument();
virtual NodeBuilder::Ptr create(const QUrl &baseURI) const;
virtual void startOfSequence();
virtual void endOfSequence();
inline AccelTree::Ptr builtDocument() const
{
return m_document;
}
virtual void atomicValue(const QVariant &value);
virtual const SourceLocationReflection *actualReflection() const;
virtual QSourceLocation sourceLocation() const;
private:
inline void startStructure();
inline AccelTree::PreNumber currentDepth() const
{
return m_ancestors.count() -1;
}
inline AccelTree::PreNumber currentParent() const
{
return m_ancestors.isEmpty() ? -1 : m_ancestors.top();
}
enum Constants
{
DefaultNodeStackSize = 10,
SizeIsEmpty = 0
};
AccelTree::PreNumber m_preNumber;
bool m_isPreviousAtomic;
bool m_hasCharacters;
/**
* Whether m_characters has been run through
* CompressedWhitespace::compress().
*/
bool m_isCharactersCompressed;
QString m_characters;
NamePool::Ptr m_namePool;
AccelTree::Ptr m_document;
QStack<AccelTree::PreNumber> m_ancestors;
QStack<AccelTree::PreNumber> m_size;
/** If we have already commenced a document, we don't want to
* add more document nodes. We keep track of them with this
* counter, which ensures that startDocument() and endDocument()
* are skipped consistently. */
AccelTree::PreNumber m_skippedDocumentNodes;
/**
* All attribute values goes through this set such that we store only
* one QString for identical attribute values.
*/
QSet<QString> m_attributeCompress;
const QUrl m_documentURI;
/**
* We don't store a reference pointer here because then we get a
* circular reference with GenericDynamicContext, when it stores us as
* a member.
*/
ReportContext *const m_context;
Features m_features;
};
Q_DECLARE_OPERATORS_FOR_FLAGS(AccelTreeBuilder<true>::Features)
Q_DECLARE_OPERATORS_FOR_FLAGS(AccelTreeBuilder<false>::Features)
#include "qacceltreebuilder.cpp"
}
QT_END_NAMESPACE
QT_END_HEADER
#endif
|
