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 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:GPL-EXCEPT$
** 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 The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QFile>
#include <QStack>
#include <QXmlNamePool>
#include <QXmlStreamReader>
#include <QtDebug>
#include <QTest>
#include "LoadingModel.h"
LoadingModel::LoadingModel(const Node::Vector &content,
const QXmlNamePool &np) : QSimpleXmlNodeModel(np)
, m_nodes(content)
{
/*
for (const Node *n : content)
qDebug() << "this:" << n
<< "kind:" << n->kind
<< "parent: " << n->parent
<< "preceding: " << n->precedingSibling
<< "following: " << n->followingSibling
<< "firstChild: " << n->firstChild
<< "value: " << n->value;
*/
}
LoadingModel::~LoadingModel()
{
qDeleteAll(m_nodes);
}
const LoadingModel::Node *LoadingModel::toInternal(const QXmlNodeModelIndex &ni) const
{
return static_cast<const Node *>(ni.internalPointer());
}
QXmlNodeModelIndex LoadingModel::createIndex(const Node *const internal) const
{
if (!internal)
qFatal("%s: cannot construct a model index from a null pointer", Q_FUNC_INFO);
return QAbstractXmlNodeModel::createIndex(const_cast<Node *>(internal));
}
QUrl LoadingModel::documentUri(const QXmlNodeModelIndex &) const
{
qFatal("%s: This method should not be called during the test", Q_FUNC_INFO);
return QUrl();
}
QXmlNodeModelIndex::NodeKind LoadingModel::kind(const QXmlNodeModelIndex &ni) const
{
if (ni.isNull())
qFatal("%s: node model index should not be null", Q_FUNC_INFO);
return toInternal(ni)->kind;
}
QXmlNodeModelIndex::DocumentOrder LoadingModel::compareOrder(const QXmlNodeModelIndex &n1, const QXmlNodeModelIndex &n2) const
{
const Node *const in1 = toInternal(n1);
const Node *const in2 = toInternal(n2);
if (m_nodes.indexOf(in1) == -1)
qFatal("%s: node n1 is not in internal node list", Q_FUNC_INFO);
if (m_nodes.indexOf(in2) == -1)
qFatal("%s: node n2 is not in internal node list", Q_FUNC_INFO);
if(in1 == in2)
return QXmlNodeModelIndex::Is;
else if(m_nodes.indexOf(in1) < m_nodes.indexOf(in2))
return QXmlNodeModelIndex::Precedes;
else
return QXmlNodeModelIndex::Follows;
}
QXmlNodeModelIndex LoadingModel::root(const QXmlNodeModelIndex &) const
{
if (kind(createIndex(m_nodes.first())) != QXmlNodeModelIndex::Document) {
qWarning("%s: first node must be a Document node", Q_FUNC_INFO);
return QXmlNodeModelIndex();
}
return createIndex(m_nodes.first());
}
QXmlName LoadingModel::name(const QXmlNodeModelIndex &ni) const
{
return toInternal(ni)->name;
}
QVariant LoadingModel::typedValue(const QXmlNodeModelIndex &ni) const
{
const Node *const internal = toInternal(ni);
if (internal->kind != QXmlNodeModelIndex::Attribute
&& internal->kind != QXmlNodeModelIndex::Element) {
qWarning("%s: node must be an attribute or element", Q_FUNC_INFO);
return QVariant();
}
return internal->value;
}
QString LoadingModel::stringValue(const QXmlNodeModelIndex &ni) const
{
const Node *const internal = toInternal(ni);
switch(internal->kind)
{
case QXmlNodeModelIndex::Text:
/* Fallthrough. */
case QXmlNodeModelIndex::ProcessingInstruction:
/* Fallthrough. */
case QXmlNodeModelIndex::Comment:
/* Fallthrough. */
case QXmlNodeModelIndex::Attribute:
return internal->value;
default:
return QString();
}
}
QXmlNodeModelIndex LoadingModel::nextFromSimpleAxis(QAbstractXmlNodeModel::SimpleAxis axis,
const QXmlNodeModelIndex &ni) const
{
const Node *const internal = toInternal(ni);
/* Note that a QXmlNodeModelIndex containing a null pointer is not a null node. */
switch(axis)
{
case Parent:
return internal->parent ? createIndex(internal->parent) : QXmlNodeModelIndex();
case FirstChild:
return internal->firstChild ? createIndex(internal->firstChild) : QXmlNodeModelIndex();
case PreviousSibling:
return internal->precedingSibling ? createIndex(internal->precedingSibling) : QXmlNodeModelIndex();
case NextSibling:
return internal->followingSibling ? createIndex(internal->followingSibling) : QXmlNodeModelIndex();
default:
qWarning("%s: unknown axis enum value %d", Q_FUNC_INFO, static_cast<int>(axis));
return QXmlNodeModelIndex();
}
}
QVector<QXmlNodeModelIndex> LoadingModel::attributes(const QXmlNodeModelIndex &ni) const
{
QVector<QXmlNodeModelIndex> retval;
for (const Node *n : toInternal(ni)->attributes)
retval.append(createIndex(n));
return retval;
}
class Loader
{
public:
inline Loader(const QXmlNamePool &namePool) : m_namePool(namePool)
, m_currentNode(0)
{
m_parentStack.push(0);
}
private:
inline void adjustSiblings(LoadingModel::Node *const justBorn);
friend class LoadingModel;
Q_DISABLE_COPY(Loader);
void load();
QXmlNamePool m_namePool;
QXmlStreamReader m_reader;
LoadingModel::Node::Vector m_result;
LoadingModel::Node * m_currentNode;
QStack<LoadingModel::Node *> m_parentStack;
};
inline void Loader::adjustSiblings(LoadingModel::Node *const justBorn)
{
if(m_currentNode)
{
if(m_currentNode->parent == justBorn->parent)
justBorn->precedingSibling = m_currentNode;
m_currentNode->followingSibling = justBorn;
}
m_currentNode = justBorn;
/* Otherwise we're the first child, and our precedingSibling should remain null. */
if(m_parentStack.top() && !m_parentStack.top()->firstChild)
m_parentStack.top()->firstChild = justBorn;
}
void Loader::load()
{
QFile in(QLatin1String("tree.xml"));
/* LoadingModel::m_result will be null, signalling failure. */
if(!in.open(QIODevice::ReadOnly))
return;
QXmlStreamReader reader(&in);
while(!reader.atEnd())
{
reader.readNext();
switch(reader.tokenType())
{
case QXmlStreamReader::StartDocument:
/* Fallthrough. */
case QXmlStreamReader::StartElement:
{
QXmlName name;
if(reader.tokenType() == QXmlStreamReader::StartElement)
{
name = QXmlName(m_namePool,
reader.name().toString(),
reader.namespaceUri().toString(),
reader.prefix().toString());
}
/* Else, the name is null. */
LoadingModel::Node *const tmp = new LoadingModel::Node(reader.tokenType() == QXmlStreamReader::StartElement
? QXmlNodeModelIndex::Element
: QXmlNodeModelIndex::Document,
m_parentStack.top(),
QString(),
name);
m_result.append(tmp);
if(m_currentNode)
{
if(m_currentNode->parent == m_parentStack.top())
m_currentNode->followingSibling = tmp;
}
const QXmlStreamAttributes attributes(reader.attributes());
const int len = attributes.count();
for(int i = 0; i < len; ++i)
{
const QXmlStreamAttribute &attr = attributes.at(i);
const LoadingModel::Node *const a = new LoadingModel::Node(QXmlNodeModelIndex::Attribute,
m_parentStack.top(),
attr.value().toString(),
QXmlName(m_namePool,
attr.name().toString(),
attr.namespaceUri().toString(),
attr.prefix().toString()));
/* We add it also to m_result such that compareOrder() is correct
* for attributes. m_result owns a. */
tmp->attributes.append(a);
m_result.append(a);
}
adjustSiblings(tmp);
m_parentStack.push(m_currentNode);
break;
}
case QXmlStreamReader::EndDocument:
/* Fallthrough. */
case QXmlStreamReader::EndElement:
{
m_currentNode->followingSibling = 0;
m_currentNode = m_parentStack.pop();
if(reader.tokenType() == QXmlStreamReader::EndDocument)
const_cast<LoadingModel::Node *>(m_result.first())->followingSibling = 0;
break;
}
case QXmlStreamReader::Characters:
{
LoadingModel::Node *const tmp = new LoadingModel::Node(QXmlNodeModelIndex::Text, m_parentStack.top(), reader.text().toString());
m_result.append(tmp);
adjustSiblings(tmp);
break;
}
case QXmlStreamReader::ProcessingInstruction:
{
LoadingModel::Node *const tmp = new LoadingModel::Node(QXmlNodeModelIndex::ProcessingInstruction,
m_parentStack.top(),
reader.processingInstructionData().toString(),
QXmlName(m_namePool, reader.processingInstructionTarget().toString()));
m_result.append(tmp);
adjustSiblings(tmp);
break;
}
case QXmlStreamReader::Comment:
{
LoadingModel::Node *const tmp = new LoadingModel::Node(QXmlNodeModelIndex::Comment, m_parentStack.top(), reader.text().toString());
m_result.append(tmp);
adjustSiblings(tmp);
break;
}
case QXmlStreamReader::DTD:
qFatal("%s: QXmlStreamReader::DTD token is not supported", Q_FUNC_INFO);
break;
case QXmlStreamReader::EntityReference:
qFatal("%s: QXmlStreamReader::EntityReference token is not supported", Q_FUNC_INFO);
break;
case QXmlStreamReader::NoToken:
/* Fallthrough. */
case QXmlStreamReader::Invalid:
{
qWarning("%s", qPrintable(reader.errorString()));
m_result.clear();
return;
}
}
}
if(reader.hasError())
{
qWarning("%s", qPrintable(reader.errorString()));
m_result.clear();
}
}
QAbstractXmlNodeModel::Ptr LoadingModel::create(const QXmlNamePool &np)
{
Loader loader(np);
loader.load();
if (loader.m_result.isEmpty()) {
qWarning("%s: attempt to create model with no content", Q_FUNC_INFO);
return Ptr(0);
}
return Ptr(new LoadingModel(loader.m_result, np));
}
|