/**************************************************************************** ** ** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies). ** Contact: http://www.qt-project.org/legal ** ** This file is part of the QtXmlPatterns module of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:LGPL21$ ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and Digia. For licensing terms and ** conditions see http://qt.digia.com/licensing. For further information ** use the contact form at http://qt.digia.com/contact-us. ** ** 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 or version 3 as published by the Free ** Software Foundation and appearing in the file LICENSE.LGPLv21 and ** LICENSE.LGPLv3 included in the packaging of this file. Please review the ** following information to ensure the GNU Lesser General Public License ** requirements will be met: https://www.gnu.org/licenses/lgpl.html and ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. ** ** In addition, as a special exception, Digia gives you certain additional ** rights. These rights are described in the Digia Qt LGPL Exception ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. ** ** $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 #include #include #include #include #include #include #include #include #include #include #include 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 */ template class AccelTreeBuilder : public NodeBuilder , public SourceLocationReflection { public: typedef QExplicitlySharedDataPointer 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 m_ancestors; QStack 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 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::Features) Q_DECLARE_OPERATORS_FOR_FLAGS(AccelTreeBuilder::Features) #include "qacceltreebuilder_tpl_p.h" } QT_END_NAMESPACE #endif