plasma-framework/autotests/dynamictreemodel.cpp

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

291 lines
7.3 KiB
C++
Raw Normal View History

/*
SPDX-FileCopyrightText: 2009 Stephen Kelly <steveire@gmail.com>
SPDX-FileCopyrightText: 2009 Nokia Corporation and /or its subsidiary(-ies) <qt-info@nokia.com>
This file is part of the test suite of the Qt Toolkit.
SPDX-License-Identifier: LGPL-2.1-only WITH Qt-LGPL-exception-1.1
*/
#include "dynamictreemodel.h"
2018-11-06 07:23:52 +01:00
#include <QTimer>
DynamicTreeModel::DynamicTreeModel(QObject *parent)
: QAbstractItemModel(parent)
, nextId(1)
{
}
QModelIndex DynamicTreeModel::index(int row, int column, const QModelIndex &parent) const
{
// if (column != 0)
// return QModelIndex();
2014-04-26 01:45:47 +02:00
if (column < 0 || row < 0) {
return QModelIndex();
}
QList<QList<qint64>> childIdColumns = m_childItems.value(parent.internalId());
2014-04-26 01:45:47 +02:00
const qint64 grandParent = findParentId(parent.internalId());
if (grandParent >= 0) {
QList<QList<qint64>> parentTable = m_childItems.value(grandParent);
2014-04-26 01:45:47 +02:00
Q_ASSERT(parent.column() < parentTable.size());
QList<qint64> parentSiblings = parentTable.at(parent.column());
Q_ASSERT(parent.row() < parentSiblings.size());
}
2014-04-26 01:45:47 +02:00
if (childIdColumns.size() == 0) {
return QModelIndex();
}
2014-04-26 01:45:47 +02:00
if (column >= childIdColumns.size()) {
return QModelIndex();
}
2014-04-26 01:45:47 +02:00
QList<qint64> rowIds = childIdColumns.at(column);
2014-04-26 01:45:47 +02:00
if (row >= rowIds.size()) {
return QModelIndex();
}
2014-04-26 01:45:47 +02:00
qint64 id = rowIds.at(row);
2014-04-26 01:45:47 +02:00
return createIndex(row, column, reinterpret_cast<void *>(id));
}
qint64 DynamicTreeModel::findParentId(qint64 searchId) const
{
2014-04-26 01:45:47 +02:00
if (searchId <= 0) {
return -1;
}
QHashIterator<qint64, QList<QList<qint64>>> i(m_childItems);
2014-04-26 01:45:47 +02:00
while (i.hasNext()) {
i.next();
QListIterator<QList<qint64>> j(i.value());
2014-04-26 01:45:47 +02:00
while (j.hasNext()) {
QList<qint64> l = j.next();
if (l.contains(searchId)) {
return i.key();
}
}
}
2014-04-26 01:45:47 +02:00
return -1;
}
QModelIndex DynamicTreeModel::parent(const QModelIndex &index) const
{
2014-04-26 01:45:47 +02:00
if (!index.isValid()) {
return QModelIndex();
}
2014-04-26 01:45:47 +02:00
qint64 searchId = index.internalId();
qint64 parentId = findParentId(searchId);
// Will never happen for valid index, but what the hey...
if (parentId <= 0) {
return QModelIndex();
}
2014-04-26 01:45:47 +02:00
qint64 grandParentId = findParentId(parentId);
if (grandParentId < 0) {
grandParentId = 0;
}
2014-04-26 01:45:47 +02:00
int column = 0;
QList<qint64> childList = m_childItems.value(grandParentId).at(column);
2014-04-26 01:45:47 +02:00
int row = childList.indexOf(parentId);
2014-04-26 01:45:47 +02:00
return createIndex(row, column, reinterpret_cast<void *>(parentId));
}
2014-04-26 01:45:47 +02:00
int DynamicTreeModel::rowCount(const QModelIndex &index) const
{
QList<QList<qint64>> cols = m_childItems.value(index.internalId());
2014-04-26 01:45:47 +02:00
if (cols.size() == 0) {
return 0;
}
2014-04-26 01:45:47 +02:00
if (index.column() > 0) {
return 0;
}
2014-04-26 01:45:47 +02:00
return cols.at(0).size();
}
2014-04-26 01:45:47 +02:00
int DynamicTreeModel::columnCount(const QModelIndex &index) const
{
// Q_UNUSED(index);
2014-04-26 01:45:47 +02:00
return m_childItems.value(index.internalId()).size();
}
QVariant DynamicTreeModel::data(const QModelIndex &index, int role) const
{
2014-04-26 01:45:47 +02:00
if (!index.isValid()) {
return QVariant();
}
2014-04-26 01:45:47 +02:00
if (Qt::DisplayRole == role) {
return m_items.value(index.internalId());
}
return QVariant();
}
void DynamicTreeModel::clear()
{
2014-04-26 01:45:47 +02:00
beginResetModel();
m_items.clear();
m_childItems.clear();
nextId = 1;
endResetModel();
}
2014-04-26 01:45:47 +02:00
ModelChangeCommand::ModelChangeCommand(DynamicTreeModel *model, QObject *parent)
: QObject(parent)
, m_model(model)
, m_numCols(1)
, m_startRow(-1)
, m_endRow(-1)
{
}
QModelIndex ModelChangeCommand::findIndex(QList<int> rows)
{
2014-04-26 01:45:47 +02:00
const int col = 0;
QModelIndex parent = QModelIndex();
QListIterator<int> i(rows);
while (i.hasNext()) {
parent = m_model->index(i.next(), col, parent);
Q_ASSERT(parent.isValid());
}
return parent;
}
2014-04-26 01:45:47 +02:00
ModelInsertCommand::ModelInsertCommand(DynamicTreeModel *model, QObject *parent)
: ModelChangeCommand(model, parent)
{
}
void ModelInsertCommand::doCommand()
{
2014-04-26 01:45:47 +02:00
QModelIndex parent = findIndex(m_rowNumbers);
m_model->beginInsertRows(parent, m_startRow, m_endRow);
qint64 parentId = parent.internalId();
for (int row = m_startRow; row <= m_endRow; row++) {
for (int col = 0; col < m_numCols; col++) {
if (m_model->m_childItems[parentId].size() <= col) {
m_model->m_childItems[parentId].append(QList<qint64>());
}
// QString name = QUuid::createUuid().toString();
2014-04-26 01:45:47 +02:00
qint64 id = m_model->newId();
QString name = QString::number(id);
2014-04-26 01:45:47 +02:00
m_model->m_items.insert(id, name);
m_model->m_childItems[parentId][col].insert(row, id);
}
}
2014-04-26 01:45:47 +02:00
m_model->endInsertRows();
}
ModelMoveCommand::ModelMoveCommand(DynamicTreeModel *model, QObject *parent)
2014-04-26 01:45:47 +02:00
: ModelChangeCommand(model, parent)
{
}
bool ModelMoveCommand::emitPreSignal(const QModelIndex &srcParent, int srcStart, int srcEnd, const QModelIndex &destParent, int destRow)
{
2014-04-26 01:45:47 +02:00
return m_model->beginMoveRows(srcParent, srcStart, srcEnd, destParent, destRow);
}
void ModelMoveCommand::doCommand()
{
QModelIndex srcParent = findIndex(m_rowNumbers);
QModelIndex destParent = findIndex(m_destRowNumbers);
2014-04-26 01:45:47 +02:00
if (!emitPreSignal(srcParent, m_startRow, m_endRow, destParent, m_destRow)) {
return;
}
2014-04-26 01:45:47 +02:00
for (int column = 0; column < m_numCols; ++column) {
QList<qint64> l = m_model->m_childItems.value(srcParent.internalId())[column].mid(m_startRow, m_endRow - m_startRow + 1);
2014-04-26 01:45:47 +02:00
for (int i = m_startRow; i <= m_endRow; i++) {
m_model->m_childItems[srcParent.internalId()][column].removeAt(m_startRow);
}
int d;
2014-04-26 01:45:47 +02:00
if (m_destRow < m_startRow) {
d = m_destRow;
2014-04-26 01:45:47 +02:00
} else {
if (srcParent == destParent) {
d = m_destRow - (m_endRow - m_startRow + 1);
2014-04-26 01:45:47 +02:00
} else {
d = m_destRow - (m_endRow - m_startRow) + 1;
2014-04-26 01:45:47 +02:00
}
}
2014-04-26 01:45:47 +02:00
foreach (const qint64 id, l) {
m_model->m_childItems[destParent.internalId()][column].insert(d++, id);
}
}
emitPostSignal();
}
void ModelMoveCommand::emitPostSignal()
{
m_model->endMoveRows();
}
2014-04-26 01:45:47 +02:00
ModelResetCommand::ModelResetCommand(DynamicTreeModel *model, QObject *parent)
: ModelMoveCommand(model, parent)
{
}
ModelResetCommand::~ModelResetCommand()
{
}
bool ModelResetCommand::emitPreSignal(const QModelIndex &srcParent, int srcStart, int srcEnd, const QModelIndex &destParent, int destRow)
{
Q_UNUSED(srcParent);
Q_UNUSED(srcStart);
Q_UNUSED(srcEnd);
Q_UNUSED(destParent);
Q_UNUSED(destRow);
return true;
}
void ModelResetCommand::emitPostSignal()
{
m_model->reset();
}
2014-04-26 01:45:47 +02:00
ModelResetCommandFixed::ModelResetCommandFixed(DynamicTreeModel *model, QObject *parent)
: ModelMoveCommand(model, parent)
{
}
ModelResetCommandFixed::~ModelResetCommandFixed()
{
}
bool ModelResetCommandFixed::emitPreSignal(const QModelIndex &srcParent, int srcStart, int srcEnd, const QModelIndex &destParent, int destRow)
{
Q_UNUSED(srcParent);
Q_UNUSED(srcStart);
Q_UNUSED(srcEnd);
Q_UNUSED(destParent);
Q_UNUSED(destRow);
m_model->beginResetModel();
return true;
}
void ModelResetCommandFixed::emitPostSignal()
{
m_model->endResetModel();
}