| 1 | /**************************************************************************** | 
|---|
| 2 | ** | 
|---|
| 3 | ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). | 
|---|
| 4 | ** Contact: Qt Software Information (qt-info@nokia.com) | 
|---|
| 5 | ** | 
|---|
| 6 | ** This file is part of the demonstration applications of the Qt Toolkit. | 
|---|
| 7 | ** | 
|---|
| 8 | ** $QT_BEGIN_LICENSE:LGPL$ | 
|---|
| 9 | ** Commercial Usage | 
|---|
| 10 | ** Licensees holding valid Qt Commercial licenses may use this file in | 
|---|
| 11 | ** accordance with the Qt Commercial License Agreement provided with the | 
|---|
| 12 | ** Software or, alternatively, in accordance with the terms contained in | 
|---|
| 13 | ** a written agreement between you and Nokia. | 
|---|
| 14 | ** | 
|---|
| 15 | ** GNU Lesser General Public License Usage | 
|---|
| 16 | ** Alternatively, this file may be used under the terms of the GNU Lesser | 
|---|
| 17 | ** General Public License version 2.1 as published by the Free Software | 
|---|
| 18 | ** Foundation and appearing in the file LICENSE.LGPL included in the | 
|---|
| 19 | ** packaging of this file.  Please review the following information to | 
|---|
| 20 | ** ensure the GNU Lesser General Public License version 2.1 requirements | 
|---|
| 21 | ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. | 
|---|
| 22 | ** | 
|---|
| 23 | ** In addition, as a special exception, Nokia gives you certain | 
|---|
| 24 | ** additional rights. These rights are described in the Nokia Qt LGPL | 
|---|
| 25 | ** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this | 
|---|
| 26 | ** package. | 
|---|
| 27 | ** | 
|---|
| 28 | ** GNU General Public License Usage | 
|---|
| 29 | ** Alternatively, this file may be used under the terms of the GNU | 
|---|
| 30 | ** General Public License version 3.0 as published by the Free Software | 
|---|
| 31 | ** Foundation and appearing in the file LICENSE.GPL included in the | 
|---|
| 32 | ** packaging of this file.  Please review the following information to | 
|---|
| 33 | ** ensure the GNU General Public License version 3.0 requirements will be | 
|---|
| 34 | ** met: http://www.gnu.org/copyleft/gpl.html. | 
|---|
| 35 | ** | 
|---|
| 36 | ** If you are unsure which license is appropriate for your use, please | 
|---|
| 37 | ** contact the sales department at qt-sales@nokia.com. | 
|---|
| 38 | ** $QT_END_LICENSE$ | 
|---|
| 39 | ** | 
|---|
| 40 | ****************************************************************************/ | 
|---|
| 41 |  | 
|---|
| 42 | #include "model.h" | 
|---|
| 43 | #include <QIcon> | 
|---|
| 44 | #include <QPixmap> | 
|---|
| 45 |  | 
|---|
| 46 | Model::Model(int rows, int columns, QObject *parent) | 
|---|
| 47 | : QAbstractItemModel(parent), | 
|---|
| 48 | rc(rows), cc(columns), | 
|---|
| 49 | tree(new QVector<Node>(rows, Node(0))) | 
|---|
| 50 | { | 
|---|
| 51 |  | 
|---|
| 52 | } | 
|---|
| 53 |  | 
|---|
| 54 | Model::~Model() | 
|---|
| 55 | { | 
|---|
| 56 | delete tree; | 
|---|
| 57 | } | 
|---|
| 58 |  | 
|---|
| 59 | QModelIndex Model::index(int row, int column, const QModelIndex &parent) const | 
|---|
| 60 | { | 
|---|
| 61 | if (row < rc && row >= 0 && column < cc && column >= 0) { | 
|---|
| 62 | Node *p = static_cast<Node*>(parent.internalPointer()); | 
|---|
| 63 | Node *n = node(row, p); | 
|---|
| 64 | if (n) | 
|---|
| 65 | return createIndex(row, column, n); | 
|---|
| 66 | } | 
|---|
| 67 | return QModelIndex(); | 
|---|
| 68 | } | 
|---|
| 69 |  | 
|---|
| 70 | QModelIndex Model::parent(const QModelIndex &child) const | 
|---|
| 71 | { | 
|---|
| 72 | if (child.isValid()) { | 
|---|
| 73 | Node *n = static_cast<Node*>(child.internalPointer()); | 
|---|
| 74 | Node *p = parent(n); | 
|---|
| 75 | if (p) | 
|---|
| 76 | return createIndex(row(p), 0, p); | 
|---|
| 77 | } | 
|---|
| 78 | return QModelIndex(); | 
|---|
| 79 | } | 
|---|
| 80 |  | 
|---|
| 81 | int Model::rowCount(const QModelIndex &parent) const | 
|---|
| 82 | { | 
|---|
| 83 | return (parent.isValid() && parent.column() != 0) ? 0 : rc; | 
|---|
| 84 | } | 
|---|
| 85 |  | 
|---|
| 86 | int Model::columnCount(const QModelIndex &parent) const | 
|---|
| 87 | { | 
|---|
| 88 | Q_UNUSED(parent); | 
|---|
| 89 | return cc; | 
|---|
| 90 | } | 
|---|
| 91 |  | 
|---|
| 92 | QVariant Model::data(const QModelIndex &index, int role) const | 
|---|
| 93 | { | 
|---|
| 94 | if (!index.isValid()) | 
|---|
| 95 | return QVariant(); | 
|---|
| 96 | if (role == Qt::DisplayRole) | 
|---|
| 97 | return "Item " + QString::number(index.row()) + ":" + QString::number(index.column()); | 
|---|
| 98 | if (role == Qt::DecorationRole) { | 
|---|
| 99 | if (index.column() == 0) | 
|---|
| 100 | return iconProvider.icon(QFileIconProvider::Folder); | 
|---|
| 101 | return iconProvider.icon(QFileIconProvider::File); | 
|---|
| 102 | } | 
|---|
| 103 | return QVariant(); | 
|---|
| 104 | } | 
|---|
| 105 |  | 
|---|
| 106 | QVariant Model::headerData(int section, Qt::Orientation orientation, int role) const | 
|---|
| 107 | { | 
|---|
| 108 | static QIcon services(QPixmap(":/images/services.png")); | 
|---|
| 109 | if (role == Qt::DisplayRole) | 
|---|
| 110 | return QString::number(section); | 
|---|
| 111 | if (role == Qt::DecorationRole) | 
|---|
| 112 | return qVariantFromValue(services); | 
|---|
| 113 | return QAbstractItemModel::headerData(section, orientation, role); | 
|---|
| 114 | } | 
|---|
| 115 |  | 
|---|
| 116 | bool Model::hasChildren(const QModelIndex &parent) const | 
|---|
| 117 | { | 
|---|
| 118 | if (parent.isValid() && parent.column() != 0) | 
|---|
| 119 | return false; | 
|---|
| 120 | return rc > 0 && cc > 0; | 
|---|
| 121 | } | 
|---|
| 122 |  | 
|---|
| 123 | Qt::ItemFlags Model::flags(const QModelIndex &index) const | 
|---|
| 124 | { | 
|---|
| 125 | if (!index.isValid()) | 
|---|
| 126 | return 0; | 
|---|
| 127 | return (Qt::ItemIsDragEnabled|Qt::ItemIsSelectable|Qt::ItemIsEnabled); | 
|---|
| 128 | } | 
|---|
| 129 |  | 
|---|
| 130 | Model::Node *Model::node(int row, Node *parent) const | 
|---|
| 131 | { | 
|---|
| 132 | if (parent && !parent->children) | 
|---|
| 133 | parent->children = new QVector<Node>(rc, Node(parent)); | 
|---|
| 134 | QVector<Node> *v = parent ? parent->children : tree; | 
|---|
| 135 | return const_cast<Node*>(&(v->at(row))); | 
|---|
| 136 | } | 
|---|
| 137 |  | 
|---|
| 138 | Model::Node *Model::parent(Node *child) const | 
|---|
| 139 | { | 
|---|
| 140 | return child ? child->parent : 0; | 
|---|
| 141 | } | 
|---|
| 142 |  | 
|---|
| 143 | int Model::row(Node *node) const | 
|---|
| 144 | { | 
|---|
| 145 | const Node *first = node->parent ? &(node->parent->children->at(0)) : &(tree->at(0)); | 
|---|
| 146 | return (node - first); | 
|---|
| 147 | } | 
|---|