#ifndef TREEMODEL_H
#define TREEMODEL_H
#include <QAbstractItemModel>
#include <QModelIndex>
#include <QVariant>
#include <QDebug>
#include <QMimeData>
{
Q_OBJECT
public:
};
class TreeItem;
//! [0]
{
Q_OBJECT
public:
~TreeModel();
Qt
::ItemFlags flags
(const QModelIndex &index
) const Q_DECL_OVERRIDE;
QVariant headerData
(int section, Qt
::Orientation orientation,
int role = Qt::DisplayRole) const Q_DECL_OVERRIDE;
//bool hasChildren(const QModelIndex &parent = QModelIndex()) const Q_DECL_OVERRIDE;
QMimeData* mimeData
(const QModelIndexList
&indexes
) const;
private:
void setupModelData
(const QStringList &lines, TreeItem
*parent
);
TreeItem *rootItem;
};
//! [0]
#endif // TREEMODEL_H
#include "treeitem.h"
#include "treemodel.h"
#include <QStringList>
//! [0]
{
QList<QVariant> rootData;
rootData << "Title" << "Summary";
rootItem = new TreeItem(rootData);
setupModelData
(data.
split(QString("\n")), rootItem
);
}
//! [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();
else
return rootItem->columnCount();
}
QMimeData *TreeModel
::mimeData(const QModelIndexList
&indexes
) const {
myMidedata* mime = new myMidedata();
return mime;
}
//! [2]
//! [3]
{
if (!index.isValid())
if (role != Qt::DisplayRole)
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())
return 0;
}
//! [4]
//! [5]
QVariant TreeModel
::headerData(int section, Qt
::Orientation orientation,
int role) const
{
if (orientation == Qt::Horizontal && role == Qt::DisplayRole)
return rootItem->data(section);
}
//! [5]
//! [6]
const
{
if (!hasIndex(row, column, parent))
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);
else
}
//! [6]
//! [7]
{
if (!index.isValid())
TreeItem *childItem = static_cast<TreeItem*>(index.internalPointer());
TreeItem *parentItem = childItem->parentItem();
if (parentItem == rootItem)
return createIndex(parentItem->row(), 0, parentItem);
}
//! [7]
//! [8]
int TreeModel
::rowCount(const QModelIndex &parent
) const {
// return 0;
TreeItem *parentItem;
if (parent.column() > 0)
return 0;
if (!parent.isValid())
parentItem = rootItem;
else
parentItem = static_cast<TreeItem*>(parent.internalPointer());
return parentItem->childCount();
}
//! [8]
//bool TreeModel::hasChildren(const QModelIndex &parent) const
//{
// TreeItem *parentItem;
// if (parent.column() > 0)
// return false;
// if (!parent.isValid())
// parentItem = rootItem;
// else
// parentItem = static_cast<TreeItem*>(parent.internalPointer());
// return parentItem->childCount();
//}
void TreeModel
::setupModelData(const QStringList &lines, TreeItem
*parent
) {
QList<TreeItem*> parents;
QList<int> indentations;
parents << parent;
indentations << 0;
int number = 0;
while (number < lines.count()) {
int position = 0;
while (position < lines[number].length()) {
if (lines[number].mid(position, 1) != " ")
break;
position++;
}
QString lineData
= lines
[number
].
mid(position
).
trimmed();
if (!lineData.isEmpty()) {
// Read the column data from the rest of the line.
QList<QVariant> columnData;
for (int column = 0; column < columnStrings.count(); ++column)
columnData << columnStrings[column];
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()));
}
++number;
}
}