1 /***************************************************************************
2 * Copyright (C) 2005-07 by the Quassel IRC Team *
3 * devel@quassel-irc.org *
5 * This program is free software; you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation; either version 2 of the License, or *
8 * (at your option) version 3. *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 * You should have received a copy of the GNU General Public License *
16 * along with this program; if not, write to the *
17 * Free Software Foundation, Inc., *
18 * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19 ***************************************************************************/
21 #include "treemodel.h"
25 /*****************************************
26 * Abstract Items of a TreeModel
27 *****************************************/
28 AbstractTreeItem::AbstractTreeItem(AbstractTreeItem *parent)
31 _flags(Qt::ItemIsSelectable | Qt::ItemIsEnabled)
35 AbstractTreeItem::~AbstractTreeItem() {
36 foreach(int key, _childItems.keys()) {
37 qDeleteAll(_childItems[key]);
41 quint64 AbstractTreeItem::id() const {
45 int AbstractTreeItem::defaultColumn() const {
46 // invalid QModelIndexes aka rootNodes get their Childs stuffed into column -1
54 void AbstractTreeItem::appendChild(int column, AbstractTreeItem *item) {
55 if(!_childItems.contains(column)) {
56 _childItems[column] = QList<AbstractTreeItem *>();
57 _childHash[column] = QHash<quint64, AbstractTreeItem *>();
60 _childItems[column].append(item);
61 _childHash[column][item->id()] = item;
63 connect(item, SIGNAL(destroyed()), this, SLOT(childDestroyed()));
66 void AbstractTreeItem::appendChild(AbstractTreeItem *child) {
67 appendChild(defaultColumn(), child);
70 void AbstractTreeItem::removeChild(int column, int row) {
71 if(!_childItems.contains(column)
72 || _childItems[column].size() <= row)
75 AbstractTreeItem *treeitem = _childItems[column].value(row);
76 _childItems[column].removeAt(row);
77 _childHash[column].remove(_childHash[column].key(treeitem));
78 treeitem->deleteLater();
81 void AbstractTreeItem::removeChild(int row) {
82 removeChild(defaultColumn(), row);
85 AbstractTreeItem *AbstractTreeItem::child(int column, int row) const {
86 if(!_childItems.contains(column)
87 || _childItems[column].size() <= row)
90 return _childItems[column].value(row);
93 AbstractTreeItem *AbstractTreeItem::child(int row) const {
94 return child(defaultColumn(), row);
97 AbstractTreeItem *AbstractTreeItem::childById(int column, const uint &id) const {
98 if(!_childHash.contains(column)
99 || !_childHash[column].contains(id))
102 return _childHash[column].value(id);
105 AbstractTreeItem *AbstractTreeItem::childById(const uint &id) const {
106 return childById(defaultColumn(), id);
109 int AbstractTreeItem::childCount(int column) const {
110 if(!_childItems.contains(column))
113 return _childItems[column].count();
116 int AbstractTreeItem::childCount() const {
117 return childCount(defaultColumn());
120 int AbstractTreeItem::column() const {
124 QHash<int, QList<AbstractTreeItem*> >::const_iterator iter = _parentItem->_childItems.constBegin();
126 while(iter != _parentItem->_childItems.constEnd()) {
127 pos = iter.value().indexOf(const_cast<AbstractTreeItem *>(this));
133 // unable to find us o_O
134 return _parentItem->defaultColumn();
137 int AbstractTreeItem::row() const {
141 return _parentItem->_childItems[column()].indexOf(const_cast<AbstractTreeItem*>(this));
144 AbstractTreeItem *AbstractTreeItem::parent() {
148 Qt::ItemFlags AbstractTreeItem::flags() const {
152 void AbstractTreeItem::setFlags(Qt::ItemFlags flags) {
156 void AbstractTreeItem::childDestroyed() {
157 AbstractTreeItem *item = static_cast<AbstractTreeItem*>(sender());
158 removeChild(item->column(), item->row());
161 /*****************************************
163 *****************************************/
164 SimpleTreeItem::SimpleTreeItem(const QList<QVariant> &data, AbstractTreeItem *parent)
165 : AbstractTreeItem(parent),
170 SimpleTreeItem::~SimpleTreeItem() {
173 QVariant SimpleTreeItem::data(int column, int role) const {
174 if(role == Qt::DisplayRole && column < _itemData.count())
175 return _itemData[column];
180 int SimpleTreeItem::columnCount() const {
181 return _itemData.count();
184 /*****************************************
186 *****************************************/
187 PropertyMapItem::PropertyMapItem(const QStringList &propertyOrder, AbstractTreeItem *parent)
188 : AbstractTreeItem(parent),
189 _propertyOrder(propertyOrder)
193 PropertyMapItem::PropertyMapItem(AbstractTreeItem *parent)
194 : AbstractTreeItem(parent),
195 _propertyOrder(QStringList())
200 PropertyMapItem::~PropertyMapItem() {
203 QVariant PropertyMapItem::data(int column, int role) const {
204 if(column >= columnCount())
207 if(role != Qt::DisplayRole)
210 return property(_propertyOrder[column].toAscii());
213 int PropertyMapItem::columnCount() const {
214 return _propertyOrder.count();
217 void PropertyMapItem::appendProperty(const QString &property) {
218 _propertyOrder << property;
223 /*****************************************
225 *****************************************/
226 TreeModel::TreeModel(const QList<QVariant> &data, QObject *parent)
227 : QAbstractItemModel(parent)
229 rootItem = new SimpleTreeItem(data, 0);
232 TreeModel::~TreeModel() {
236 QModelIndex TreeModel::index(int row, int column, const QModelIndex &parent) const {
237 if(!hasIndex(row, column, parent))
238 return QModelIndex();
240 AbstractTreeItem *parentItem;
242 if(!parent.isValid())
243 parentItem = rootItem;
245 parentItem = static_cast<AbstractTreeItem*>(parent.internalPointer());
247 AbstractTreeItem *childItem = parentItem->child(parent.column(), row);
250 return createIndex(row, column, childItem);
252 return QModelIndex();
255 QModelIndex TreeModel::indexById(uint id, const QModelIndex &parent) const {
256 AbstractTreeItem *parentItem;
258 if(!parent.isValid())
259 parentItem = rootItem;
261 parentItem = static_cast<AbstractTreeItem *>(parent.internalPointer());
263 AbstractTreeItem *childItem = parentItem->childById(parent.column(), id);
266 return createIndex(childItem->row(), 0, childItem);
268 return QModelIndex();
271 QModelIndex TreeModel::indexByItem(AbstractTreeItem *item) const {
273 qWarning() << "TreeModel::indexByItem(AbstractTreeItem *item) received NULL-Pointer";
274 return QModelIndex();
278 return QModelIndex();
280 return createIndex(item->row(), 0, item);
284 QModelIndex TreeModel::parent(const QModelIndex &index) const {
286 return QModelIndex();
288 AbstractTreeItem *childItem = static_cast<AbstractTreeItem *>(index.internalPointer());
289 AbstractTreeItem *parentItem = static_cast<AbstractTreeItem *>(childItem->parent());
291 if(parentItem == rootItem)
292 return QModelIndex();
294 return createIndex(parentItem->row(), 0, parentItem);
297 int TreeModel::rowCount(const QModelIndex &parent) const {
298 AbstractTreeItem *parentItem;
299 if(!parent.isValid())
300 parentItem = rootItem;
302 parentItem = static_cast<AbstractTreeItem*>(parent.internalPointer());
304 return parentItem->childCount(parent.column());
307 int TreeModel::columnCount(const QModelIndex &parent) const {
309 return static_cast<AbstractTreeItem*>(parent.internalPointer())->columnCount();
311 return rootItem->columnCount();
314 QVariant TreeModel::data(const QModelIndex &index, int role) const {
318 AbstractTreeItem *item = static_cast<AbstractTreeItem*>(index.internalPointer());
319 return item->data(index.column(), role);
322 Qt::ItemFlags TreeModel::flags(const QModelIndex &index) const {
323 AbstractTreeItem *item;
327 item = static_cast<AbstractTreeItem *>(index.internalPointer());
328 return item->flags();
331 QVariant TreeModel::headerData(int section, Qt::Orientation orientation, int role) const {
332 if (orientation == Qt::Horizontal && role == Qt::DisplayRole)
333 return rootItem->data(section, role);
338 void TreeModel::itemDataChanged(int column) {
339 AbstractTreeItem *item = qobject_cast<AbstractTreeItem *>(sender());
340 QModelIndex itemIndex;
343 itemIndex = QModelIndex();
345 itemIndex = createIndex(item->row(), column, item);
347 emit dataChanged(itemIndex, itemIndex);
350 void TreeModel::appendChild(AbstractTreeItem *parent, AbstractTreeItem *child) {
351 if(parent == 0 or child == 0) {
352 qWarning() << "TreeModel::apendChild(parent, child) parent and child have to be valid pointers!" << parent << child;
356 int nextRow = parent->childCount();
357 beginInsertRows(indexByItem(parent), nextRow, nextRow);
358 parent->appendChild(child);
361 connect(child, SIGNAL(dataChanged(int)),
362 this, SLOT(itemDataChanged(int)));
366 bool TreeModel::removeRow(int row, const QModelIndex &parent) {
367 if(row > rowCount(parent))
370 AbstractTreeItem *item;
371 if(!parent.isValid())
374 item = static_cast<AbstractTreeItem*>(parent.internalPointer());
376 beginRemoveRows(parent, row, row);
377 item->removeChild(parent.column(), row);
382 bool TreeModel::removeRows(int row, int count, const QModelIndex &parent) {
383 // check if there is work to be done
387 // out of range check
388 if(row + count - 1 > rowCount(parent) || row < 0 || count < 0)
391 AbstractTreeItem *item;
392 if(!parent.isValid())
395 item = static_cast<AbstractTreeItem *>(parent.internalPointer());
398 beginRemoveRows(parent, row, row + count - 1);
400 for(int i = row + count - 1; i >= 0; i--) {
401 item->removeChild(parent.column(), i);
407 void TreeModel::clear() {
408 removeRows(0, rowCount());