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
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** 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 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, 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.
**
** 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.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QFile>
#include <QtTest/QtTest>
#include <QSourceLocation>
#include <QXmlFormatter>
#include <QXmlNamePool>
#include <QXmlQuery>
#include <QXmlResultItems>
#include <QXmlSerializer>
#include <QFileInfo>
#include <QDir>
#include "TestNodeModel.h"
#include "LoadingModel.h"
#include "../qxmlquery/TestFundament.h"
/*!
\class tst_QAbstractXmlNodeModel
\internal
\since 4.4
\brief Tests the QAbstractXmlNodeModel class.
*/
class tst_QAbstractXmlNodeModel : public QObject
, private TestFundament
{
Q_OBJECT
private Q_SLOTS:
// TODO lots of tests missing
void initTestCase();
void constructor() const;
void objectSize() const;
void nextFromSimpleAxis();
void nextFromSimpleAxis_data() const;
void constCorrectness() const;
void createData() const;
void createPointerAdditionalData() const;
void createDataAdditionalData() const;
void id() const;
void idref() const;
void typedValue() const;
void sourceLocation() const;
private:
QAbstractXmlNodeModel::Ptr m_nodeModel;
QXmlNamePool m_namePool;
QXmlNodeModelIndex m_rootNode;
};
const char testFileName[] = "tree.xml";
void tst_QAbstractXmlNodeModel::initTestCase()
{
const QString testFilePath = QFINDTESTDATA(testFileName);
QVERIFY2(!testFilePath.isEmpty(), "tree.xml not found");
const QString testDirectory = QFileInfo(testFilePath).absolutePath();
QVERIFY2(QDir::setCurrent(testDirectory), qPrintable(QStringLiteral("Could not chdir to ") + testDirectory));
m_nodeModel = LoadingModel::create(m_namePool);
QVERIFY(m_nodeModel);
m_rootNode = m_nodeModel->root(QXmlNodeModelIndex());
QVERIFY(!m_rootNode.isNull());
}
void tst_QAbstractXmlNodeModel::constructor() const
{
/* Allocate instance. */
{
TestNodeModel instance;
}
{
TestNodeModel instance1;
TestNodeModel instance2;
}
{
TestNodeModel instance1;
TestNodeModel instance2;
TestNodeModel instance3;
}
}
void tst_QAbstractXmlNodeModel::objectSize() const
{
/* We can't currently test this in portable way,
* so disable it. */
return;
const int pointerSize = sizeof(void *);
// adjust for pointer alignment
const int sharedDataSize = ((sizeof(QSharedData) + pointerSize) / pointerSize) * pointerSize;
const int modelSize = sizeof(QAbstractXmlNodeModel);
/* A d pointer plus a vtable pointer. */
QCOMPARE(modelSize, sharedDataSize + pointerSize * 2);
}
/*!
Tests nextFromSimpleAxis(). More exactly that all the logic in
QAbstractXmlNodeModel::iterate() is as we expect to. Subsequently, a lot
of testing code is in LoadingModel(.cpp).
Approach:
1. In initTestCase() we loaded tree.xml into LoadingModel and
stored the root node in m_rootNode.
2. We execute a query that navigates from m_rootNode and write out
the result using QXmlFormatter.
3. We execute the exact same query, but this time use the built in node backend,
and write out the result in the same way. This is our baseline.
4. Compare the two.
Hence we check QAbstractXmlNodeModel::iterate() and friends against our XQuery
code, which in turn is (mainly) checked by the XQTS. This means safer testing
since we don't create baselines manually, and it also means that we can modify
the input file, tree.xml, without having to update static baselines.
*/
void tst_QAbstractXmlNodeModel::nextFromSimpleAxis()
{
QFETCH(QString, queryString);
QBuffer out;
/* Fill out, using LoadingModel. */
{
QXmlQuery query(m_namePool);
query.bindVariable(QLatin1String("node"), m_rootNode);
query.setQuery(queryString);
QVERIFY(query.isValid());
QVERIFY(out.open(QIODevice::WriteOnly));
QXmlFormatter formatter(query, &out);
QVERIFY(query.evaluateTo(&formatter));
}
QBuffer baseline;
/* Create the baseline. */
{
QXmlQuery openDoc(m_namePool);
const QString testFilePath = QDir::currentPath() + QLatin1Char('/') + QLatin1String(testFileName);
openDoc.bindVariable(QLatin1String("docURI"), QVariant(QUrl::fromLocalFile(testFilePath)));
openDoc.setQuery(QLatin1String("doc($docURI)"));
QXmlResultItems doc;
QVERIFY(openDoc.isValid());
openDoc.evaluateTo(&doc);
QXmlQuery produceBaseline(m_namePool);
produceBaseline.bindVariable(QLatin1String("node"), doc.next());
produceBaseline.setQuery(queryString);
QVERIFY(produceBaseline.isValid());
QVERIFY(baseline.open(QIODevice::WriteOnly));
QXmlFormatter baselineFormatter(produceBaseline, &baseline);
QVERIFY(produceBaseline.evaluateTo(&baselineFormatter));
}
if(out.data() != baseline.data())
{
QTextStream(stderr) << "ACTUAL:" << QString::fromUtf8(out.data().constData())
<< "EXPECTED:" << QString::fromUtf8(baseline.data().constData());
}
QCOMPARE(out.data(), baseline.data());
}
void tst_QAbstractXmlNodeModel::nextFromSimpleAxis_data() const
{
QTest::addColumn<QString>("queryString");
QTest::newRow("The whole tree")
<< "$node";
QTest::newRow("::descendant-or-self from $node, all nodes.")
<< "$node/descendant-or-self::node()";
QTest::newRow("::descendant from $node, all nodes.")
<< "$node/descendant::node()";
QTest::newRow("::descendant from node with no descendants.")
<< "$node/descendant::node()";
QTest::newRow("following-sibling on $root.")
<< "$node/text()[1]/following-sibling::node()";
QTest::newRow("following-sibling from section1.")
<< "$node//section1/following-sibling::node()";
QTest::newRow("preceding-sibling-sibling from section1.")
<< "$node//section1/preceding-sibling::node()";
QTest::newRow("following-sibling from oneTextChild.")
<< "$node//oneTextChild/following-sibling::node()";
QTest::newRow("preceding-sibling-sibling from oneTextChild.")
<< "$node//oneTextChild/preceding-sibling::node()";
QTest::newRow("preceding-sibling on $root.")
<< "$node/preceding-sibling::node()";
QTest::newRow("::ancestor from node at the end")
<< "$node//node()/ancestor::node()";
QTest::newRow("::ancestor-or-self from node at the end")
<< "$node//node()/ancestor-or-self::node()";
QTest::newRow("Copy attributes from all nodes.")
<< "<e>{for $i in $node//node()/@* order by $i return $i}</e>";
QTest::newRow("::preceding from node at the end")
<< "($node//node())[last()]/preceding::node()";
QTest::newRow("::preceding from $node")
<< "$node/preceding::node()";
QTest::newRow("::following from node at the end")
<< "($node//node())[last()]/following::node()";
QTest::newRow("::following from $node")
<< "$node//following::node()";
QTest::newRow("::following from $node")
<< "$node/following::node()";
QTest::newRow("::descendant from text() nodes.")
<< "$node/descendant-or-self::text()/descendant::node()";
QTest::newRow("::descendant-or-self from text() nodes.")
<< "$node/descendant-or-self::text()/descendant-or-self::node()";
QTest::newRow("descendant-or-self::node() from section1.")
<< "$node//section1/descendant-or-self::node()";
QTest::newRow("descendant::node() from section1.")
<< "$node//section1/descendant::node()";
/* Checks for axis order. */
QTest::newRow("::descendant from text() nodes with last(), checking axis order.")
<< "$node/descendant-or-self::text()/(descendant::node()[last()])";
QTest::newRow("::descendant-or-self from text() nodes with last(), checking axis order.")
<< "$node/descendant-or-self::text()/(descendant-or-self::node()[last()])";
QTest::newRow("::descendant from text() nodes with predicate, checking axis order.")
<< "$node/descendant-or-self::text()/(descendant::node()[2])";
QTest::newRow("::descendant-or-self from text() nodes with predicate, checking axis order.")
<< "$node/descendant-or-self::text()/(descendant-or-self::node()[2])";
QTest::newRow("::following from node at the end with predicate, checking axis order.")
<< "($node//node())[last()]/(following::node()[2])";
QTest::newRow("::following from node at the end with last(), checking axis order.")
<< "($node//node())[last()]/(following::node()[last()])";
QTest::newRow("ancestor:: from node at the end with predicate, checking axis order.")
<< "($node//node())[last()]/(ancestor::node()[2])";
QTest::newRow("ancestor:: from node at the end with last(), checking axis order.")
<< "($node//node())[last()]/(ancestor::node()[last()])";
QTest::newRow("ancestor-or-self:: from node at the end with predicate, checking axis order.")
<< "($node//node())[last()]/(ancestor::node()[2])";
QTest::newRow("ancestor-or-self:: from node at the end with last(), checking axis order.")
<< "($node//node())[last()]/(ancestor::node()[last()])";
QTest::newRow("::preceding from node at the end with predicate, checking axis order.")
<< "($node//node())[last()]/(preceding::node()[2])";
QTest::newRow("descendant-or-self in two levels, with last()")
<< "$node/descendant-or-self::text()/(descendant-or-self::node()[last()])";
QTest::newRow("descendant-or-self with last()")
<< "$node/descendant-or-self::node()[last()]";
QTest::newRow("::preceding from node at the end with last(), checking axis order.")
<< "$node/preceding::node()[last()]";
QTest::newRow("::preceding combined with descendant-or-self, from node at the end with last(), checking axis order.")
<< "$node//preceding::node()[last()]";
QTest::newRow("::preceding combined with descendant-or-self, from node at the end with last(), checking axis order.")
<< "($node//node())[last()]/(preceding::node()[last()])";
}
void tst_QAbstractXmlNodeModel::constCorrectness() const
{
// TODO
}
void tst_QAbstractXmlNodeModel::createData() const
{
// TODO
// Verify that the argument is qint64
}
void tst_QAbstractXmlNodeModel::createPointerAdditionalData() const
{
// TODO
// Verify that the second argument is qint64
}
void tst_QAbstractXmlNodeModel::createDataAdditionalData() const
{
// TODO
}
void tst_QAbstractXmlNodeModel::id() const
{
// TODO verify that invalid NCNames are not sent to the model.
}
void tst_QAbstractXmlNodeModel::idref() const
{
// TODO verify that invalid NCNames are not sent to the model.
}
/*!
Verify that if QAbstractXmlNodeModel::typedValue() return a null
QVariant, it is treated as that the node has no typed value.
*/
void tst_QAbstractXmlNodeModel::typedValue() const
{
class TypedModel : public TestNodeModel
{
public:
virtual QVariant typedValue(const QXmlNodeModelIndex &) const
{
return QVariant();
}
QXmlNodeModelIndex root() const
{
return createIndex(qint64(1));
}
};
TypedModel model;
QXmlQuery query;
query.bindVariable(QLatin1String("node"), model.root());
query.setQuery(QLatin1String("declare variable $node external;"
"string($node), data($node)"));
QByteArray output;
QBuffer buffer(&output);
QVERIFY(buffer.open(QIODevice::WriteOnly));
QVERIFY(query.isValid());
QXmlSerializer serializer(query, &buffer);
QVERIFY(query.evaluateTo(&serializer));
QVERIFY(output.isEmpty());
}
void tst_QAbstractXmlNodeModel::sourceLocation() const
{
const QAbstractXmlNodeModel* const constModel = m_nodeModel.data();
const QSourceLocation location = constModel->sourceLocation(m_rootNode);
}
QTEST_MAIN(tst_QAbstractXmlNodeModel)
#include "tst_qabstractxmlnodemodel.moc"
// vim: et:ts=4:sw=4:sts=4
|