365 lines
13 KiB
C++
365 lines
13 KiB
C++
|
/****************************************************************************
|
||
|
|
**
|
||
|
|
** Copyright (C) 2021 The Qt Company Ltd.
|
||
|
|
** Contact: https://www.qt.io/licensing/
|
||
|
|
**
|
||
|
|
** This file is part of the QtQuick module 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 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 Lesser General Public License Usage
|
||
|
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
||
|
|
** General Public License version 3 as published by the Free Software
|
||
|
|
** Foundation and appearing in the file LICENSE.LGPL3 included in the
|
||
|
|
** packaging of this file. Please review the following information to
|
||
|
|
** ensure the GNU Lesser General Public License version 3 requirements
|
||
|
|
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
|
||
|
|
**
|
||
|
|
** GNU General Public License Usage
|
||
|
|
** Alternatively, this file may be used under the terms of the GNU
|
||
|
|
** General Public License version 2.0 or (at your option) the GNU General
|
||
|
|
** Public license version 3 or any later version approved by the KDE Free
|
||
|
|
** Qt Foundation. The licenses are as published by the Free Software
|
||
|
|
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
|
||
|
|
** 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-2.0.html and
|
||
|
|
** https://www.gnu.org/licenses/gpl-3.0.html.
|
||
|
|
**
|
||
|
|
** $QT_END_LICENSE$
|
||
|
|
**
|
||
|
|
****************************************************************************/
|
||
|
|
|
||
|
|
#include <QtTest/QtTest>
|
||
|
|
#include <QtQuickTest/quicktest.h>
|
||
|
|
|
||
|
|
#include <QtQuick/qquickview.h>
|
||
|
|
#include <QtQuick/private/qquicktreeview_p.h>
|
||
|
|
#include <QtQuick/private/qquicktreeview_p_p.h>
|
||
|
|
|
||
|
|
#include <QtQml/qqmlengine.h>
|
||
|
|
#include <QtQml/qqmlcontext.h>
|
||
|
|
#include <QtQml/qqmlexpression.h>
|
||
|
|
#include <QtQml/qqmlincubator.h>
|
||
|
|
#include <QtQmlModels/private/qqmlobjectmodel_p.h>
|
||
|
|
#include <QtQmlModels/private/qqmllistmodel_p.h>
|
||
|
|
|
||
|
|
#include "testmodel.h"
|
||
|
|
|
||
|
|
#include <QtQuickTestUtils/private/qmlutils_p.h>
|
||
|
|
#include <QtQuickTestUtils/private/viewtestutils_p.h>
|
||
|
|
#include <QtQuickTestUtils/private/visualtestutils_p.h>
|
||
|
|
|
||
|
|
using namespace QQuickViewTestUtils;
|
||
|
|
using namespace QQuickVisualTestUtils;
|
||
|
|
|
||
|
|
#define LOAD_TREEVIEW(fileName) \
|
||
|
|
view->setSource(testFileUrl(fileName)); \
|
||
|
|
view->show(); \
|
||
|
|
QVERIFY(QTest::qWaitForWindowActive(view)); \
|
||
|
|
auto treeView = view->rootObject()->property("treeView").value<QQuickTreeView *>(); \
|
||
|
|
QVERIFY(treeView); \
|
||
|
|
auto treeViewPrivate = QQuickTreeViewPrivate::get(treeView); \
|
||
|
|
Q_UNUSED(treeViewPrivate) \
|
||
|
|
auto model = treeView->model().value<TestModel *>(); \
|
||
|
|
Q_UNUSED(model)
|
||
|
|
|
||
|
|
#define WAIT_UNTIL_POLISHED_ARG(item) \
|
||
|
|
QVERIFY(QQuickTest::qIsPolishScheduled(item)); \
|
||
|
|
QVERIFY(QQuickTest::qWaitForItemPolished(item))
|
||
|
|
#define WAIT_UNTIL_POLISHED WAIT_UNTIL_POLISHED_ARG(treeView)
|
||
|
|
|
||
|
|
// ########################################################
|
||
|
|
|
||
|
|
class tst_qquicktreeview : public QQmlDataTest
|
||
|
|
{
|
||
|
|
Q_OBJECT
|
||
|
|
public:
|
||
|
|
tst_qquicktreeview();
|
||
|
|
|
||
|
|
private:
|
||
|
|
QQuickView *view = nullptr;
|
||
|
|
|
||
|
|
private slots:
|
||
|
|
void initTestCase() override;
|
||
|
|
void showTreeView();
|
||
|
|
void expandAndCollapseRoot();
|
||
|
|
void toggleExpanded();
|
||
|
|
void expandAndCollapseChildren();
|
||
|
|
void requiredPropertiesRoot();
|
||
|
|
void requiredPropertiesChildren();
|
||
|
|
void emptyModel();
|
||
|
|
void updatedModifiedModel();
|
||
|
|
void insertRows();
|
||
|
|
};
|
||
|
|
|
||
|
|
tst_qquicktreeview::tst_qquicktreeview()
|
||
|
|
: QQmlDataTest(QT_QMLTEST_DATADIR)
|
||
|
|
{
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::initTestCase()
|
||
|
|
{
|
||
|
|
QQmlDataTest::initTestCase();
|
||
|
|
qmlRegisterType<TestModel>("TestModel", 1, 0, "TestModel");
|
||
|
|
view = createView();
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::showTreeView()
|
||
|
|
{
|
||
|
|
LOAD_TREEVIEW("normaltreeview.qml");
|
||
|
|
// Check that the view is showing the root of the tree
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::expandAndCollapseRoot()
|
||
|
|
{
|
||
|
|
LOAD_TREEVIEW("normaltreeview.qml");
|
||
|
|
// Check that the view only has one row loaded so far (the root of the tree)
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 1);
|
||
|
|
|
||
|
|
// Expand the root
|
||
|
|
treeView->expand(0);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
// We now expect 5 rows, the root pluss it's 4 children
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 5);
|
||
|
|
|
||
|
|
treeView->collapse(0);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
// Check that the view only has one row loaded again (the root of the tree)
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::toggleExpanded()
|
||
|
|
{
|
||
|
|
LOAD_TREEVIEW("normaltreeview.qml");
|
||
|
|
// Check that the view only has one row loaded so far (the root of the tree)
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 1);
|
||
|
|
|
||
|
|
// Expand the root
|
||
|
|
treeView->toggleExpanded(0);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
// We now expect 5 rows, the root pluss it's 4 children
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 5);
|
||
|
|
|
||
|
|
treeView->toggleExpanded(0);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
// Check that the view only has one row loaded again (the root of the tree)
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::expandAndCollapseChildren()
|
||
|
|
{
|
||
|
|
// Check that we can expand and collapse children, and that
|
||
|
|
// the tree ends up with the expected rows
|
||
|
|
LOAD_TREEVIEW("normaltreeview.qml");
|
||
|
|
|
||
|
|
const int childCount = 4;
|
||
|
|
|
||
|
|
// Expand the last child of a parent recursively four times
|
||
|
|
for (int level = 0; level < 4; ++level) {
|
||
|
|
const int nodeToExpand = level * childCount;
|
||
|
|
const int firstChildRow = nodeToExpand + 1; // (+ 1 for the root)
|
||
|
|
const int lastChildRow = firstChildRow + 4;
|
||
|
|
treeView->expand(nodeToExpand);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
QCOMPARE(treeView->rows(), lastChildRow);
|
||
|
|
|
||
|
|
auto childItem1 = treeViewPrivate->loadedTableItem(QPoint(0, firstChildRow))->item;
|
||
|
|
QCOMPARE(childItem1->property("text").toString(), "0, 0");
|
||
|
|
auto childItem2 = treeViewPrivate->loadedTableItem(QPoint(0, firstChildRow + 1))->item;
|
||
|
|
QCOMPARE(childItem2->property("text").toString(), "1, 0");
|
||
|
|
auto childItem3 = treeViewPrivate->loadedTableItem(QPoint(0, firstChildRow + 2))->item;
|
||
|
|
QCOMPARE(childItem3->property("text").toString(), "2, 0");
|
||
|
|
}
|
||
|
|
|
||
|
|
// Collapse down from level 2 (deliberatly not mirroring the expansion by
|
||
|
|
// instead collapsing both level 3 and 4 in one go)
|
||
|
|
for (int level = 2; level > 0; --level) {
|
||
|
|
const int nodeToCollapse = level * childCount;
|
||
|
|
const int firstChildRow = nodeToCollapse - childCount + 1;
|
||
|
|
const int lastChildRow = nodeToCollapse + 1; // (+ 1 for the root)
|
||
|
|
|
||
|
|
treeView->collapse(nodeToCollapse);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
QCOMPARE(treeView->rows(), lastChildRow);
|
||
|
|
|
||
|
|
auto childItem1 = treeViewPrivate->loadedTableItem(QPoint(0, firstChildRow))->item;
|
||
|
|
QCOMPARE(childItem1->property("text").toString(), "0, 0");
|
||
|
|
auto childItem2 = treeViewPrivate->loadedTableItem(QPoint(0, firstChildRow + 1))->item;
|
||
|
|
QCOMPARE(childItem2->property("text").toString(), "1, 0");
|
||
|
|
auto childItem3 = treeViewPrivate->loadedTableItem(QPoint(0, firstChildRow + 2))->item;
|
||
|
|
QCOMPARE(childItem3->property("text").toString(), "2, 0");
|
||
|
|
}
|
||
|
|
|
||
|
|
// Collapse the root
|
||
|
|
treeView->collapse(0);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
QCOMPARE(treeView->rows(), 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::requiredPropertiesRoot()
|
||
|
|
{
|
||
|
|
LOAD_TREEVIEW("normaltreeview.qml");
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 1);
|
||
|
|
|
||
|
|
const auto rootFxItem = treeViewPrivate->loadedTableItem(QPoint(0, 0));
|
||
|
|
QVERIFY(rootFxItem);
|
||
|
|
const auto rootItem = rootFxItem->item;
|
||
|
|
QVERIFY(rootItem);
|
||
|
|
|
||
|
|
const auto context = qmlContext(rootItem.data());
|
||
|
|
const auto viewProp = context->contextProperty("treeView").value<QQuickTreeView *>();
|
||
|
|
const auto isTreeNode = context->contextProperty("isTreeNode").toBool();
|
||
|
|
const auto expanded = context->contextProperty("expanded").toBool();
|
||
|
|
const auto hasChildren = context->contextProperty("hasChildren").toBool();
|
||
|
|
const auto depth = context->contextProperty("depth").toInt();
|
||
|
|
|
||
|
|
QCOMPARE(viewProp, treeView);
|
||
|
|
QCOMPARE(isTreeNode, true);
|
||
|
|
QCOMPARE(expanded, false);
|
||
|
|
QCOMPARE(hasChildren, true);
|
||
|
|
QCOMPARE(depth, 0);
|
||
|
|
|
||
|
|
treeView->expand(0);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
|
||
|
|
const auto isExpandedAfterExpand = context->contextProperty("expanded").toBool();
|
||
|
|
QCOMPARE(isExpandedAfterExpand, true);
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::requiredPropertiesChildren()
|
||
|
|
{
|
||
|
|
LOAD_TREEVIEW("normaltreeview.qml");
|
||
|
|
treeView->expand(0);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
// We now expect 5 rows, the root pluss it's 4 children
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 5);
|
||
|
|
|
||
|
|
// The last child has it's own children, so expand that one as well
|
||
|
|
const auto rootIndex = model->index(0, 0);
|
||
|
|
const int childCount = model->rowCount(rootIndex);
|
||
|
|
QCOMPARE(childCount, 4);
|
||
|
|
const auto lastChildIndex = model->index(childCount - 1, 0, rootIndex);
|
||
|
|
QVERIFY(lastChildIndex.isValid());
|
||
|
|
QCOMPARE(model->hasChildren(lastChildIndex), true);
|
||
|
|
|
||
|
|
treeView->expand(4);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
// We now expect root + 4 children + 4 children = 9 rows
|
||
|
|
const int rowCount = treeViewPrivate->loadedRows.count();
|
||
|
|
QCOMPARE(rowCount, 9);
|
||
|
|
|
||
|
|
// Go through all rows in the view, except the root
|
||
|
|
for (int row = 1; row < rowCount; ++row) {
|
||
|
|
const auto childFxItem = treeViewPrivate->loadedTableItem(QPoint(0, row));
|
||
|
|
QVERIFY(childFxItem);
|
||
|
|
const auto childItem = childFxItem->item;
|
||
|
|
QVERIFY(childItem);
|
||
|
|
|
||
|
|
const auto context = qmlContext(childItem.data());
|
||
|
|
const auto viewProp = context->contextProperty("treeView").value<QQuickTreeView *>();
|
||
|
|
const auto isTreeNode = context->contextProperty("isTreeNode").toBool();
|
||
|
|
const auto expanded = context->contextProperty("expanded").toBool();
|
||
|
|
const auto hasChildren = context->contextProperty("hasChildren").toBool();
|
||
|
|
const auto depth = context->contextProperty("depth").toInt();
|
||
|
|
|
||
|
|
QCOMPARE(viewProp, treeView);
|
||
|
|
QCOMPARE(isTreeNode, true);
|
||
|
|
QCOMPARE(expanded, row == 4);
|
||
|
|
QCOMPARE(hasChildren, row == 4 || row == 8);
|
||
|
|
QCOMPARE(depth, row <= 4 ? 1 : 2);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::emptyModel()
|
||
|
|
{
|
||
|
|
// Check that you can assign an empty model, and that
|
||
|
|
// calling functions will work as expected (and at least not crash)
|
||
|
|
LOAD_TREEVIEW("normaltreeview.qml");
|
||
|
|
treeView->setModel(QVariant());
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
|
||
|
|
QCOMPARE(treeViewPrivate->loadedItems.count(), 0);
|
||
|
|
QCOMPARE(treeView->rows(), 0);
|
||
|
|
QCOMPARE(treeView->columns(), 0);
|
||
|
|
|
||
|
|
// Check that we don't crash:
|
||
|
|
treeView->expand(10);
|
||
|
|
treeView->collapse(5);
|
||
|
|
|
||
|
|
QCOMPARE(treeView->depth(0), -1);
|
||
|
|
QCOMPARE(treeView->isExpanded(0), false);
|
||
|
|
QVERIFY(!treeView->modelIndex(10, 10).isValid());
|
||
|
|
QCOMPARE(treeView->rowAtIndex(QModelIndex()), -1);
|
||
|
|
QCOMPARE(treeView->columnAtIndex(QModelIndex()), -1);
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::updatedModifiedModel()
|
||
|
|
{
|
||
|
|
// Check that if we change the data in the model, the
|
||
|
|
// delegate items get updated.
|
||
|
|
LOAD_TREEVIEW("normaltreeview.qml");
|
||
|
|
treeView->expand(0);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
// We now expect 5 rows, the root plus it's 4 children
|
||
|
|
QCOMPARE(treeViewPrivate->loadedRows.count(), 5);
|
||
|
|
|
||
|
|
auto rootFxItem = treeViewPrivate->loadedTableItem(QPoint(0, 0));
|
||
|
|
QVERIFY(rootFxItem);
|
||
|
|
auto rootItem = rootFxItem->item;
|
||
|
|
QVERIFY(rootItem);
|
||
|
|
QCOMPARE(rootItem->property("text"), "0, 0");
|
||
|
|
model->setData(model->index(0, 0), QVariant(QString("Changed")));
|
||
|
|
QCOMPARE(rootItem->property("text"), "Changed");
|
||
|
|
|
||
|
|
auto rootFxItemCol1 = treeViewPrivate->loadedTableItem(QPoint(1, 2));
|
||
|
|
QVERIFY(rootFxItemCol1);
|
||
|
|
auto rootItemCol1 = rootFxItemCol1->item;
|
||
|
|
QVERIFY(rootItemCol1);
|
||
|
|
QCOMPARE(rootItemCol1->property("text"), "1, 1");
|
||
|
|
model->setData(model->index(1, 1, model->index(0,0)), QVariant(QString("Changed")));
|
||
|
|
QCOMPARE(rootItemCol1->property("text"), "Changed");
|
||
|
|
}
|
||
|
|
|
||
|
|
void tst_qquicktreeview::insertRows()
|
||
|
|
{
|
||
|
|
// Check that if we add new rows to the model, TreeView gets updated
|
||
|
|
// to contain the new expected number of rows (flattened to a list)
|
||
|
|
LOAD_TREEVIEW("normaltreeview.qml");
|
||
|
|
treeView->expand(0);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
|
||
|
|
QCOMPARE(treeView->rows(), 5);
|
||
|
|
|
||
|
|
const QModelIndex rootNode = model->index(0, 0, QModelIndex());
|
||
|
|
model->insertRows(0, 2, rootNode);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
|
||
|
|
QCOMPARE(treeView->rows(), 7);
|
||
|
|
auto childItem1 = treeViewPrivate->loadedTableItem(QPoint(0, 1))->item;
|
||
|
|
QCOMPARE(childItem1->property("text").toString(), "0, 0 (inserted)");
|
||
|
|
auto childItem2 = treeViewPrivate->loadedTableItem(QPoint(0, 2))->item;
|
||
|
|
QCOMPARE(childItem2->property("text").toString(), "1, 0 (inserted)");
|
||
|
|
auto childItem3 = treeViewPrivate->loadedTableItem(QPoint(0, 3))->item;
|
||
|
|
QCOMPARE(childItem3->property("text").toString(), "0, 0");
|
||
|
|
|
||
|
|
const QModelIndex indexOfInsertedChild = model->index(1, 0, rootNode);
|
||
|
|
model->insertRows(0, 2, indexOfInsertedChild);
|
||
|
|
treeView->expand(2);
|
||
|
|
WAIT_UNTIL_POLISHED;
|
||
|
|
|
||
|
|
QCOMPARE(treeView->rows(), 9);
|
||
|
|
}
|
||
|
|
|
||
|
|
QTEST_MAIN(tst_qquicktreeview)
|
||
|
|
|
||
|
|
#include "tst_qquicktreeview.moc"
|