2011-04-27 10:05:43 +00:00
|
|
|
/****************************************************************************
|
|
|
|
**
|
2016-01-22 12:24:00 +00:00
|
|
|
** Copyright (C) 2016 The Qt Company Ltd.
|
|
|
|
** Contact: https://www.qt.io/licensing/
|
2011-04-27 10:05:43 +00:00
|
|
|
**
|
|
|
|
** This file is part of the examples of the Qt Toolkit.
|
|
|
|
**
|
|
|
|
** $QT_BEGIN_LICENSE:BSD$
|
2016-01-22 12:24:00 +00:00
|
|
|
** 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.
|
|
|
|
**
|
|
|
|
** BSD License Usage
|
|
|
|
** Alternatively, you may use this file under the terms of the BSD license
|
|
|
|
** as follows:
|
2011-04-27 10:05:43 +00:00
|
|
|
**
|
|
|
|
** "Redistribution and use in source and binary forms, with or without
|
|
|
|
** modification, are permitted provided that the following conditions are
|
|
|
|
** met:
|
|
|
|
** * Redistributions of source code must retain the above copyright
|
|
|
|
** notice, this list of conditions and the following disclaimer.
|
|
|
|
** * Redistributions in binary form must reproduce the above copyright
|
|
|
|
** notice, this list of conditions and the following disclaimer in
|
|
|
|
** the documentation and/or other materials provided with the
|
|
|
|
** distribution.
|
2015-02-13 11:15:33 +00:00
|
|
|
** * Neither the name of The Qt Company Ltd nor the names of its
|
|
|
|
** contributors may be used to endorse or promote products derived
|
|
|
|
** from this software without specific prior written permission.
|
2012-09-19 12:28:29 +00:00
|
|
|
**
|
2011-04-27 10:05:43 +00:00
|
|
|
**
|
|
|
|
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
|
2012-01-24 06:17:24 +00:00
|
|
|
**
|
2011-04-27 10:05:43 +00:00
|
|
|
** $QT_END_LICENSE$
|
|
|
|
**
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
/*
|
|
|
|
treemodel.cpp
|
|
|
|
|
|
|
|
Provides a simple tree model to show how to create and use hierarchical
|
|
|
|
models.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "treemodel.h"
|
2018-11-23 19:05:42 +00:00
|
|
|
#include "treeitem.h"
|
2011-04-27 10:05:43 +00:00
|
|
|
|
2012-11-22 12:40:51 +00:00
|
|
|
#include <QStringList>
|
|
|
|
|
2011-04-27 10:05:43 +00:00
|
|
|
//! [0]
|
|
|
|
TreeModel::TreeModel(const QString &data, QObject *parent)
|
|
|
|
: QAbstractItemModel(parent)
|
|
|
|
{
|
2018-11-23 19:05:42 +00:00
|
|
|
rootItem = new TreeItem({tr("Title"), tr("Summary")});
|
|
|
|
setupModelData(data.split('\n'), rootItem);
|
2011-04-27 10:05:43 +00:00
|
|
|
}
|
|
|
|
//! [0]
|
|
|
|
|
|
|
|
//! [1]
|
|
|
|
TreeModel::~TreeModel()
|
|
|
|
{
|
|
|
|
delete rootItem;
|
|
|
|
}
|
|
|
|
//! [1]
|
|
|
|
|
|
|
|
//! [2]
|
|
|
|
int TreeModel::columnCount(const QModelIndex &parent) const
|
|
|
|
{
|
|
|
|
if (parent.isValid())
|
|
|
|
return static_cast<TreeItem*>(parent.internalPointer())->columnCount();
|
2018-11-23 19:05:42 +00:00
|
|
|
return rootItem->columnCount();
|
2011-04-27 10:05:43 +00:00
|
|
|
}
|
|
|
|
//! [2]
|
|
|
|
|
|
|
|
//! [3]
|
|
|
|
QVariant TreeModel::data(const QModelIndex &index, int role) const
|
|
|
|
{
|
|
|
|
if (!index.isValid())
|
|
|
|
return QVariant();
|
|
|
|
|
|
|
|
if (role != Qt::DisplayRole)
|
|
|
|
return QVariant();
|
|
|
|
|
|
|
|
TreeItem *item = static_cast<TreeItem*>(index.internalPointer());
|
|
|
|
|
|
|
|
return item->data(index.column());
|
|
|
|
}
|
|
|
|
//! [3]
|
|
|
|
|
|
|
|
//! [4]
|
|
|
|
Qt::ItemFlags TreeModel::flags(const QModelIndex &index) const
|
|
|
|
{
|
|
|
|
if (!index.isValid())
|
2018-11-23 19:05:42 +00:00
|
|
|
return Qt::NoItemFlags;
|
2011-04-27 10:05:43 +00:00
|
|
|
|
2012-11-26 13:27:37 +00:00
|
|
|
return QAbstractItemModel::flags(index);
|
2011-04-27 10:05:43 +00:00
|
|
|
}
|
|
|
|
//! [4]
|
|
|
|
|
|
|
|
//! [5]
|
|
|
|
QVariant TreeModel::headerData(int section, Qt::Orientation orientation,
|
|
|
|
int role) const
|
|
|
|
{
|
|
|
|
if (orientation == Qt::Horizontal && role == Qt::DisplayRole)
|
|
|
|
return rootItem->data(section);
|
|
|
|
|
|
|
|
return QVariant();
|
|
|
|
}
|
|
|
|
//! [5]
|
|
|
|
|
|
|
|
//! [6]
|
2018-11-23 19:05:42 +00:00
|
|
|
QModelIndex TreeModel::index(int row, int column, const QModelIndex &parent) const
|
2011-04-27 10:05:43 +00:00
|
|
|
{
|
|
|
|
if (!hasIndex(row, column, parent))
|
|
|
|
return QModelIndex();
|
|
|
|
|
|
|
|
TreeItem *parentItem;
|
|
|
|
|
|
|
|
if (!parent.isValid())
|
|
|
|
parentItem = rootItem;
|
|
|
|
else
|
|
|
|
parentItem = static_cast<TreeItem*>(parent.internalPointer());
|
|
|
|
|
|
|
|
TreeItem *childItem = parentItem->child(row);
|
|
|
|
if (childItem)
|
|
|
|
return createIndex(row, column, childItem);
|
2018-11-23 19:05:42 +00:00
|
|
|
return QModelIndex();
|
2011-04-27 10:05:43 +00:00
|
|
|
}
|
|
|
|
//! [6]
|
|
|
|
|
|
|
|
//! [7]
|
|
|
|
QModelIndex TreeModel::parent(const QModelIndex &index) const
|
|
|
|
{
|
|
|
|
if (!index.isValid())
|
|
|
|
return QModelIndex();
|
|
|
|
|
|
|
|
TreeItem *childItem = static_cast<TreeItem*>(index.internalPointer());
|
2014-05-15 21:34:21 +00:00
|
|
|
TreeItem *parentItem = childItem->parentItem();
|
2011-04-27 10:05:43 +00:00
|
|
|
|
|
|
|
if (parentItem == rootItem)
|
|
|
|
return QModelIndex();
|
|
|
|
|
|
|
|
return createIndex(parentItem->row(), 0, parentItem);
|
|
|
|
}
|
|
|
|
//! [7]
|
|
|
|
|
|
|
|
//! [8]
|
|
|
|
int TreeModel::rowCount(const QModelIndex &parent) const
|
|
|
|
{
|
|
|
|
TreeItem *parentItem;
|
|
|
|
if (parent.column() > 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (!parent.isValid())
|
|
|
|
parentItem = rootItem;
|
|
|
|
else
|
|
|
|
parentItem = static_cast<TreeItem*>(parent.internalPointer());
|
|
|
|
|
|
|
|
return parentItem->childCount();
|
|
|
|
}
|
|
|
|
//! [8]
|
|
|
|
|
|
|
|
void TreeModel::setupModelData(const QStringList &lines, TreeItem *parent)
|
|
|
|
{
|
2018-11-23 19:05:42 +00:00
|
|
|
QVector<TreeItem*> parents;
|
|
|
|
QVector<int> indentations;
|
2011-04-27 10:05:43 +00:00
|
|
|
parents << parent;
|
|
|
|
indentations << 0;
|
|
|
|
|
|
|
|
int number = 0;
|
|
|
|
|
|
|
|
while (number < lines.count()) {
|
|
|
|
int position = 0;
|
|
|
|
while (position < lines[number].length()) {
|
2015-10-13 07:06:58 +00:00
|
|
|
if (lines[number].at(position) != ' ')
|
2011-04-27 10:05:43 +00:00
|
|
|
break;
|
|
|
|
position++;
|
|
|
|
}
|
|
|
|
|
2018-11-23 19:05:42 +00:00
|
|
|
const QString lineData = lines[number].mid(position).trimmed();
|
2011-04-27 10:05:43 +00:00
|
|
|
|
|
|
|
if (!lineData.isEmpty()) {
|
|
|
|
// Read the column data from the rest of the line.
|
2018-11-23 19:05:42 +00:00
|
|
|
const QStringList columnStrings = lineData.split('\t', QString::SkipEmptyParts);
|
|
|
|
QVector<QVariant> columnData;
|
|
|
|
columnData.reserve(columnStrings.count());
|
|
|
|
for (const QString &columnString : columnStrings)
|
|
|
|
columnData << columnString;
|
2011-04-27 10:05:43 +00:00
|
|
|
|
|
|
|
if (position > indentations.last()) {
|
|
|
|
// The last child of the current parent is now the new parent
|
|
|
|
// unless the current parent has no children.
|
|
|
|
|
|
|
|
if (parents.last()->childCount() > 0) {
|
|
|
|
parents << parents.last()->child(parents.last()->childCount()-1);
|
|
|
|
indentations << position;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
while (position < indentations.last() && parents.count() > 0) {
|
|
|
|
parents.pop_back();
|
|
|
|
indentations.pop_back();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Append a new item to the current parent's list of children.
|
|
|
|
parents.last()->appendChild(new TreeItem(columnData, parents.last()));
|
|
|
|
}
|
2012-11-22 12:40:51 +00:00
|
|
|
++number;
|
2011-04-27 10:05:43 +00:00
|
|
|
}
|
|
|
|
}
|