| 1 | /**************************************************************************** |
| 2 | ** |
| 3 | ** Copyright (C) 2016 The Qt Company Ltd. |
| 4 | ** Contact: https://www.qt.io/licensing/ |
| 5 | ** |
| 6 | ** This file is part of the demonstration applications of the Qt Toolkit. |
| 7 | ** |
| 8 | ** $QT_BEGIN_LICENSE:BSD$ |
| 9 | ** Commercial License Usage |
| 10 | ** Licensees holding valid commercial Qt licenses may use this file in |
| 11 | ** accordance with the commercial license agreement provided with the |
| 12 | ** Software or, alternatively, in accordance with the terms contained in |
| 13 | ** a written agreement between you and The Qt Company. For licensing terms |
| 14 | ** and conditions see https://www.qt.io/terms-conditions. For further |
| 15 | ** information use the contact form at https://www.qt.io/contact-us. |
| 16 | ** |
| 17 | ** BSD License Usage |
| 18 | ** Alternatively, you may use this file under the terms of the BSD license |
| 19 | ** as follows: |
| 20 | ** |
| 21 | ** "Redistribution and use in source and binary forms, with or without |
| 22 | ** modification, are permitted provided that the following conditions are |
| 23 | ** met: |
| 24 | ** * Redistributions of source code must retain the above copyright |
| 25 | ** notice, this list of conditions and the following disclaimer. |
| 26 | ** * Redistributions in binary form must reproduce the above copyright |
| 27 | ** notice, this list of conditions and the following disclaimer in |
| 28 | ** the documentation and/or other materials provided with the |
| 29 | ** distribution. |
| 30 | ** * Neither the name of The Qt Company Ltd nor the names of its |
| 31 | ** contributors may be used to endorse or promote products derived |
| 32 | ** from this software without specific prior written permission. |
| 33 | ** |
| 34 | ** |
| 35 | ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 36 | ** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 37 | ** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 38 | ** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 39 | ** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 40 | ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 41 | ** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 42 | ** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 43 | ** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 44 | ** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 45 | ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE." |
| 46 | ** |
| 47 | ** $QT_END_LICENSE$ |
| 48 | ** |
| 49 | ****************************************************************************/ |
| 50 | |
| 51 | #include "model.h" |
| 52 | |
| 53 | #include <QPixmap> |
| 54 | |
| 55 | Model::Model(int rows, int columns, QObject *parent) |
| 56 | : QAbstractItemModel(parent), |
| 57 | services(QPixmap(":/images/services.png" )), |
| 58 | rc(rows), cc(columns), |
| 59 | tree(new QVector<Node>(rows, Node())) |
| 60 | { |
| 61 | |
| 62 | } |
| 63 | |
| 64 | Model::~Model() |
| 65 | { |
| 66 | delete tree; |
| 67 | } |
| 68 | |
| 69 | QModelIndex Model::index(int row, int column, const QModelIndex &parent) const |
| 70 | { |
| 71 | if (row < rc && row >= 0 && column < cc && column >= 0) { |
| 72 | Node *parentNode = static_cast<Node*>(parent.internalPointer()); |
| 73 | Node *childNode = node(row, parent: parentNode); |
| 74 | if (childNode) |
| 75 | return createIndex(arow: row, acolumn: column, adata: childNode); |
| 76 | } |
| 77 | return QModelIndex(); |
| 78 | } |
| 79 | |
| 80 | QModelIndex Model::parent(const QModelIndex &child) const |
| 81 | { |
| 82 | if (child.isValid()) { |
| 83 | Node *childNode = static_cast<Node*>(child.internalPointer()); |
| 84 | Node *parentNode = parent(child: childNode); |
| 85 | if (parentNode) |
| 86 | return createIndex(arow: row(node: parentNode), acolumn: 0, adata: parentNode); |
| 87 | } |
| 88 | return QModelIndex(); |
| 89 | } |
| 90 | |
| 91 | int Model::rowCount(const QModelIndex &parent) const |
| 92 | { |
| 93 | return (parent.isValid() && parent.column() != 0) ? 0 : rc; |
| 94 | } |
| 95 | |
| 96 | int Model::columnCount(const QModelIndex &parent) const |
| 97 | { |
| 98 | Q_UNUSED(parent); |
| 99 | return cc; |
| 100 | } |
| 101 | |
| 102 | QVariant Model::data(const QModelIndex &index, int role) const |
| 103 | { |
| 104 | if (!index.isValid()) |
| 105 | return QVariant(); |
| 106 | if (role == Qt::DisplayRole) |
| 107 | return QVariant("Item " + QString::number(index.row()) + ':' + QString::number(index.column())); |
| 108 | if (role == Qt::DecorationRole) { |
| 109 | if (index.column() == 0) |
| 110 | return iconProvider.icon(type: QFileIconProvider::Folder); |
| 111 | return iconProvider.icon(type: QFileIconProvider::File); |
| 112 | } |
| 113 | return QVariant(); |
| 114 | } |
| 115 | |
| 116 | QVariant Model::(int section, Qt::Orientation orientation, int role) const |
| 117 | { |
| 118 | if (role == Qt::DisplayRole) |
| 119 | return QString::number(section); |
| 120 | if (role == Qt::DecorationRole) |
| 121 | return QVariant::fromValue(value: services); |
| 122 | return QAbstractItemModel::headerData(section, orientation, role); |
| 123 | } |
| 124 | |
| 125 | bool Model::hasChildren(const QModelIndex &parent) const |
| 126 | { |
| 127 | if (parent.isValid() && parent.column() != 0) |
| 128 | return false; |
| 129 | return rc > 0 && cc > 0; |
| 130 | } |
| 131 | |
| 132 | Qt::ItemFlags Model::flags(const QModelIndex &index) const |
| 133 | { |
| 134 | if (!index.isValid()) |
| 135 | return {}; |
| 136 | return Qt::ItemIsDragEnabled|QAbstractItemModel::flags(index); |
| 137 | } |
| 138 | |
| 139 | Model::Node *Model::node(int row, Node *parent) const |
| 140 | { |
| 141 | if (parent && !parent->children) |
| 142 | parent->children = new QVector<Node>(rc, Node(parent)); |
| 143 | QVector<Node> *v = parent ? parent->children : tree; |
| 144 | return const_cast<Node*>(&(v->at(i: row))); |
| 145 | } |
| 146 | |
| 147 | Model::Node *Model::parent(Node *child) const |
| 148 | { |
| 149 | return child ? child->parent : nullptr; |
| 150 | } |
| 151 | |
| 152 | int Model::row(Node *node) const |
| 153 | { |
| 154 | const Node *first = node->parent ? &(node->parent->children->at(i: 0)) : &(tree->at(i: 0)); |
| 155 | return node - first; |
| 156 | } |
| 157 | |