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 AbstractTreeItem *child;
37 foreach(int key, _childItems.keys()) {
38 QList<AbstractTreeItem *>::iterator iter = _childItems[key].begin();
39 while(iter != _childItems[key].end()) {
41 iter = _childItems[key].erase(iter);
42 disconnect(child, 0, this, 0);
48 quint64 AbstractTreeItem::id() const {
52 int AbstractTreeItem::defaultColumn() const {
53 // invalid QModelIndexes aka rootNodes get their Childs stuffed into column -1
61 void AbstractTreeItem::appendChild(int column, AbstractTreeItem *item) {
62 if(!_childItems.contains(column)) {
63 _childItems[column] = QList<AbstractTreeItem *>();
64 _childHash[column] = QHash<quint64, AbstractTreeItem *>();
67 _childItems[column].append(item);
68 _childHash[column][item->id()] = item;
70 connect(item, SIGNAL(destroyed()), this, SLOT(childDestroyed()));
73 void AbstractTreeItem::appendChild(AbstractTreeItem *child) {
74 appendChild(defaultColumn(), child);
77 void AbstractTreeItem::removeChild(int column, int row) {
78 if(!_childItems.contains(column)
79 || _childItems[column].size() <= row)
82 AbstractTreeItem *treeitem = _childItems[column].value(row);
83 _childItems[column].removeAt(row);
84 _childHash[column].remove(_childHash[column].key(treeitem));
85 disconnect(treeitem, 0, this, 0);
86 treeitem->deleteLater();
89 void AbstractTreeItem::removeChild(int row) {
90 removeChild(defaultColumn(), row);
93 AbstractTreeItem *AbstractTreeItem::child(int column, int row) const {
94 if(!_childItems.contains(column)
95 || _childItems[column].size() <= row)
98 return _childItems[column].value(row);
101 AbstractTreeItem *AbstractTreeItem::child(int row) const {
102 return child(defaultColumn(), row);
105 AbstractTreeItem *AbstractTreeItem::childById(int column, const uint &id) const {
106 if(!_childHash.contains(column)
107 || !_childHash[column].contains(id))
110 return _childHash[column].value(id);
113 AbstractTreeItem *AbstractTreeItem::childById(const uint &id) const {
114 return childById(defaultColumn(), id);
117 int AbstractTreeItem::childCount(int column) const {
118 if(!_childItems.contains(column))
121 return _childItems[column].count();
124 int AbstractTreeItem::childCount() const {
125 return childCount(defaultColumn());
128 int AbstractTreeItem::column() const {
132 QHash<int, QList<AbstractTreeItem*> >::const_iterator iter = _parentItem->_childItems.constBegin();
133 while(iter != _parentItem->_childItems.constEnd()) {
134 if(iter.value().contains(const_cast<AbstractTreeItem *>(this)))
139 // unable to find us o_O
140 return _parentItem->defaultColumn();
143 int AbstractTreeItem::row() const {
147 return _parentItem->_childItems[column()].indexOf(const_cast<AbstractTreeItem*>(this));
150 AbstractTreeItem *AbstractTreeItem::parent() {
154 Qt::ItemFlags AbstractTreeItem::flags() const {
158 void AbstractTreeItem::setFlags(Qt::ItemFlags flags) {
162 void AbstractTreeItem::childDestroyed() {
163 AbstractTreeItem *item = static_cast<AbstractTreeItem*>(sender());
166 qWarning() << "AbstractTreeItem::childDestroyed() received null pointer!";
170 QHash<int, QList<AbstractTreeItem*> >::const_iterator iter = _childItems.constBegin();
171 int column, row = -1;
172 while(iter != _childItems.constEnd()) {
173 row = iter.value().indexOf(item);
182 qWarning() << "AbstractTreeItem::childDestroyed(): unknown Child died:" << item << "parent:" << this;
186 _childItems[column].removeAt(row);
187 _childHash[column].remove(_childHash[column].key(item));
188 emit childDestroyed(row);
191 /*****************************************
193 *****************************************/
194 SimpleTreeItem::SimpleTreeItem(const QList<QVariant> &data, AbstractTreeItem *parent)
195 : AbstractTreeItem(parent),
200 SimpleTreeItem::~SimpleTreeItem() {
203 QVariant SimpleTreeItem::data(int column, int role) const {
204 if(role == Qt::DisplayRole && column < _itemData.count())
205 return _itemData[column];
210 int SimpleTreeItem::columnCount() const {
211 return _itemData.count();
214 /*****************************************
216 *****************************************/
217 PropertyMapItem::PropertyMapItem(const QStringList &propertyOrder, AbstractTreeItem *parent)
218 : AbstractTreeItem(parent),
219 _propertyOrder(propertyOrder)
223 PropertyMapItem::PropertyMapItem(AbstractTreeItem *parent)
224 : AbstractTreeItem(parent),
225 _propertyOrder(QStringList())
230 PropertyMapItem::~PropertyMapItem() {
233 QVariant PropertyMapItem::data(int column, int role) const {
234 if(column >= columnCount())
237 if(role != Qt::DisplayRole)
240 return property(_propertyOrder[column].toAscii());
243 int PropertyMapItem::columnCount() const {
244 return _propertyOrder.count();
247 void PropertyMapItem::appendProperty(const QString &property) {
248 _propertyOrder << property;
253 /*****************************************
255 *****************************************/
256 TreeModel::TreeModel(const QList<QVariant> &data, QObject *parent)
257 : QAbstractItemModel(parent)
259 rootItem = new SimpleTreeItem(data, 0);
262 TreeModel::~TreeModel() {
266 QModelIndex TreeModel::index(int row, int column, const QModelIndex &parent) const {
267 if(!hasIndex(row, column, parent))
268 return QModelIndex();
270 AbstractTreeItem *parentItem;
272 if(!parent.isValid())
273 parentItem = rootItem;
275 parentItem = static_cast<AbstractTreeItem*>(parent.internalPointer());
277 AbstractTreeItem *childItem = parentItem->child(parent.column(), row);
280 return createIndex(row, column, childItem);
282 return QModelIndex();
285 QModelIndex TreeModel::indexById(uint id, const QModelIndex &parent) const {
286 AbstractTreeItem *parentItem;
288 if(!parent.isValid())
289 parentItem = rootItem;
291 parentItem = static_cast<AbstractTreeItem *>(parent.internalPointer());
293 AbstractTreeItem *childItem = parentItem->childById(parent.column(), id);
296 return createIndex(childItem->row(), 0, childItem);
298 return QModelIndex();
301 QModelIndex TreeModel::indexByItem(AbstractTreeItem *item) const {
303 qWarning() << "TreeModel::indexByItem(AbstractTreeItem *item) received NULL-Pointer";
304 return QModelIndex();
308 return QModelIndex();
310 return createIndex(item->row(), 0, item);
314 QModelIndex TreeModel::parent(const QModelIndex &index) const {
316 return QModelIndex();
318 AbstractTreeItem *childItem = static_cast<AbstractTreeItem *>(index.internalPointer());
319 AbstractTreeItem *parentItem = static_cast<AbstractTreeItem *>(childItem->parent());
321 if(parentItem == rootItem)
322 return QModelIndex();
324 return createIndex(parentItem->row(), 0, parentItem);
327 int TreeModel::rowCount(const QModelIndex &parent) const {
328 AbstractTreeItem *parentItem;
329 if(!parent.isValid())
330 parentItem = rootItem;
332 parentItem = static_cast<AbstractTreeItem*>(parent.internalPointer());
334 return parentItem->childCount(parent.column());
337 int TreeModel::columnCount(const QModelIndex &parent) const {
339 // since there the Qt Views don't draw more columns than the header has columns
340 // we can be lazy and simply return the count of header columns
341 // actually this gives us more freedom cause we don't have to ensure that a rows parent
342 // has equal or more columns than that row
344 // if(parent.isValid()) {
345 // AbstractTreeItem *child;
346 // if(child = static_cast<AbstractTreeItem *>(parent.internalPointer())->child(parent.column(), parent.row()))
347 // return child->columnCount();
349 // return static_cast<AbstractTreeItem*>(parent.internalPointer())->columnCount();
351 // return rootItem->columnCount();
354 return rootItem->columnCount();
357 QVariant TreeModel::data(const QModelIndex &index, int role) const {
361 AbstractTreeItem *item = static_cast<AbstractTreeItem*>(index.internalPointer());
362 return item->data(index.column(), role);
365 Qt::ItemFlags TreeModel::flags(const QModelIndex &index) const {
366 AbstractTreeItem *item;
370 item = static_cast<AbstractTreeItem *>(index.internalPointer());
371 return item->flags();
374 QVariant TreeModel::headerData(int section, Qt::Orientation orientation, int role) const {
375 if (orientation == Qt::Horizontal && role == Qt::DisplayRole)
376 return rootItem->data(section, role);
381 void TreeModel::itemDataChanged(int column) {
382 AbstractTreeItem *item = qobject_cast<AbstractTreeItem *>(sender());
383 QModelIndex itemIndex;
386 itemIndex = QModelIndex();
388 itemIndex = createIndex(item->row(), column, item);
390 emit dataChanged(itemIndex, itemIndex);
393 void TreeModel::appendChild(AbstractTreeItem *parent, AbstractTreeItem *child) {
394 if(parent == 0 or child == 0) {
395 qWarning() << "TreeModel::appendChild(parent, child) parent and child have to be valid pointers!" << parent << child;
399 int nextRow = parent->childCount();
400 beginInsertRows(indexByItem(parent), nextRow, nextRow);
401 parent->appendChild(child);
404 connect(child, SIGNAL(dataChanged(int)),
405 this, SLOT(itemDataChanged(int)));
407 connect(child, SIGNAL(newChild(AbstractTreeItem *)),
408 this, SLOT(newChild(AbstractTreeItem *)));
410 connect(child, SIGNAL(childDestroyed(int)),
411 this, SLOT(childDestroyed(int)));
414 void TreeModel::newChild(AbstractTreeItem *child) {
415 appendChild(static_cast<AbstractTreeItem *>(sender()), child);
418 void TreeModel::childDestroyed(int row) {
419 QModelIndex parent = indexByItem(static_cast<AbstractTreeItem *>(sender()));
420 beginRemoveRows(parent, row, row);
424 bool TreeModel::removeRow(int row, const QModelIndex &parent) {
425 if(row > rowCount(parent))
428 AbstractTreeItem *item;
429 if(!parent.isValid())
432 item = static_cast<AbstractTreeItem*>(parent.internalPointer());
434 beginRemoveRows(parent, row, row);
435 item->removeChild(parent.column(), row);
440 bool TreeModel::removeRows(int row, int count, const QModelIndex &parent) {
441 // check if there is work to be done
445 // out of range check
446 if(row + count - 1 > rowCount(parent) || row < 0 || count < 0)
449 AbstractTreeItem *item;
450 if(!parent.isValid())
453 item = static_cast<AbstractTreeItem *>(parent.internalPointer());
456 beginRemoveRows(parent, row, row + count - 1);
458 for(int i = row + count - 1; i >= 0; i--) {
459 item->removeChild(parent.column(), i);
465 void TreeModel::clear() {
466 removeRows(0, rowCount());