/***************************************************************************
- * Copyright (C) 2005-08 by the Quassel Project *
+ * Copyright (C) 2005-09 by the Quassel Project *
* devel@quassel-irc.org *
* *
* This program is free software; you can redistribute it and/or modify *
#include "treemodel.h"
-#include <QDebug>
#include <QCoreApplication>
+#include <QDebug>
+
+#include "quassel.h"
+
+class RemoveChildLaterEvent : public QEvent {
+public:
+ RemoveChildLaterEvent(AbstractTreeItem *child) : QEvent(QEvent::User), _child(child) {};
+ inline AbstractTreeItem *child() { return _child; }
+private:
+ AbstractTreeItem *_child;
+};
+
/*****************************************
* Abstract Items of a TreeModel
*****************************************/
AbstractTreeItem::AbstractTreeItem(AbstractTreeItem *parent)
: QObject(parent),
- _flags(Qt::ItemIsSelectable | Qt::ItemIsEnabled)
+ _flags(Qt::ItemIsSelectable | Qt::ItemIsEnabled),
+ _treeItemFlags(0)
{
}
-AbstractTreeItem::~AbstractTreeItem() {
-}
-
-quint64 AbstractTreeItem::id() const {
- return qHash(this);
-}
-
bool AbstractTreeItem::newChild(AbstractTreeItem *item) {
- // check if a child with that ID is already known
- Q_ASSERT(childById(item->id()) == 0);
-
int newRow = childCount();
emit beginAppendChilds(newRow, newRow);
_childItems.append(item);
emit endAppendChilds();
-
return true;
}
bool AbstractTreeItem::newChilds(const QList<AbstractTreeItem *> &items) {
if(items.isEmpty())
return false;
-
- QList<AbstractTreeItem *>::const_iterator itemIter = items.constBegin();
- AbstractTreeItem *item;
- while(itemIter != items.constEnd()) {
- item = *itemIter;
- if(childById(item->id()) != 0) {
- qWarning() << "AbstractTreeItem::newChilds(): received child that is already attached" << item << item->id();
- return false;
- }
- itemIter++;
- }
int nextRow = childCount();
int lastRow = nextRow + items.count() - 1;
emit beginAppendChilds(nextRow, lastRow);
- itemIter = items.constBegin();
- while(itemIter != items.constEnd()) {
- _childItems.append(*itemIter);
- itemIter++;
- }
+ _childItems << items;
emit endAppendChilds();
return true;
}
bool AbstractTreeItem::removeChild(int row) {
- if(childCount() <= row)
+ if(row < 0 || childCount() <= row)
return false;
child(row)->removeAllChilds();
emit beginRemoveChilds(row, row);
AbstractTreeItem *treeitem = _childItems.takeAt(row);
- treeitem->deleteLater();
+ delete treeitem;
emit endRemoveChilds();
- return true;
-}
+ checkForDeletion();
-bool AbstractTreeItem::removeChildById(const quint64 &id) {
- const int numChilds = childCount();
-
- for(int i = 0; i < numChilds; i++) {
- if(_childItems[i]->id() == id)
- return removeChild(i);
- }
-
- return false;
+ return true;
}
void AbstractTreeItem::removeAllChilds() {
const int numChilds = childCount();
-
+
if(numChilds == 0)
return;
-
+
AbstractTreeItem *child;
QList<AbstractTreeItem *>::iterator childIter;
childIter = _childItems.begin();
while(childIter != _childItems.end()) {
child = *childIter;
+ child->setTreeItemFlags(0); // disable self deletion, as this would only fuck up consitency and the child gets deleted anyways
child->removeAllChilds();
childIter++;
}
while(childIter != _childItems.end()) {
child = *childIter;
childIter = _childItems.erase(childIter);
- child->deleteLater();
+ delete child;
}
emit endRemoveChilds();
+
+ checkForDeletion();
}
-AbstractTreeItem *AbstractTreeItem::child(int row) const {
- if(childCount() <= row)
- return 0;
- else
- return _childItems[row];
+void AbstractTreeItem::removeChildLater(AbstractTreeItem *child) {
+ Q_ASSERT(child);
+ QCoreApplication::postEvent(this, new RemoveChildLaterEvent(child));
}
-AbstractTreeItem *AbstractTreeItem::childById(const quint64 &id) const {
- const int numChilds = childCount();
- for(int i = 0; i < numChilds; i++) {
- if(_childItems[i]->id() == id)
- return _childItems[i];
- }
- return 0;
+void AbstractTreeItem::customEvent(QEvent *event) {
+ if(event->type() != QEvent::User)
+ return;
+
+ event->accept();
+
+ RemoveChildLaterEvent *removeEvent = static_cast<RemoveChildLaterEvent *>(event);
+ int childRow = _childItems.indexOf(removeEvent->child());
+ if(childRow == -1)
+ return;
+
+ // since we are called asynchronously we have to recheck if the item in question still has no childs
+ if(removeEvent->child()->childCount())
+ return;
+
+ removeChild(childRow);
}
-int AbstractTreeItem::childCount() const {
- return _childItems.count();
+bool AbstractTreeItem::reParent(AbstractTreeItem *newParent) {
+ // currently we support only re parenting if the child that's about to be
+ // adopted does not have any children itself.
+ if(childCount() != 0) {
+ qDebug() << "AbstractTreeItem::reParent(): cannot reparent" << this << "with children.";
+ return false;
+ }
+
+ int oldRow = row();
+ if(oldRow == -1)
+ return false;
+
+ emit parent()->beginRemoveChilds(oldRow, oldRow);
+ parent()->_childItems.removeAt(oldRow);
+ emit parent()->endRemoveChilds();
+
+ AbstractTreeItem *oldParent = parent();
+ setParent(newParent);
+
+ bool success = newParent->newChild(this);
+ if(!success)
+ qWarning() << "AbstractTreeItem::reParent(): failed to attach to new parent after removing from old parent! this:" << this << "new parent:" << newParent;
+
+ if(oldParent)
+ oldParent->checkForDeletion();
+
+ return success;
}
-int AbstractTreeItem::row() const {
- if(!parent())
- return -1;
+AbstractTreeItem *AbstractTreeItem::child(int row) const {
+ if(childCount() <= row)
+ return 0;
else
- return parent()->_childItems.indexOf(const_cast<AbstractTreeItem *>(this));
+ return _childItems[row];
}
-AbstractTreeItem *AbstractTreeItem::parent() const {
- return qobject_cast<AbstractTreeItem *>(QObject::parent());
+int AbstractTreeItem::childCount(int column) const {
+ if(column > 0)
+ return 0;
+ else
+ return _childItems.count();
}
-Qt::ItemFlags AbstractTreeItem::flags() const {
- return _flags;
-}
+int AbstractTreeItem::row() const {
+ if(!parent()) {
+ qWarning() << "AbstractTreeItem::row():" << this << "has no parent AbstractTreeItem as it's parent! parent is" << QObject::parent();
+ return -1;
+ }
-void AbstractTreeItem::setFlags(Qt::ItemFlags flags) {
- _flags = flags;
+ int row_ = parent()->_childItems.indexOf(const_cast<AbstractTreeItem *>(this));
+ if(row_ == -1)
+ qWarning() << "AbstractTreeItem::row():" << this << "is not in the child list of" << QObject::parent();
+ return row_;
}
void AbstractTreeItem::dumpChildList() {
- qDebug() << "==== Childlist for Item:" << this << id() << "====";
+ qDebug() << "==== Childlist for Item:" << this << "====";
if(childCount() > 0) {
AbstractTreeItem *child;
QList<AbstractTreeItem *>::const_iterator childIter = _childItems.constBegin();
while(childIter != _childItems.constEnd()) {
child = *childIter;
- qDebug() << "Row:" << child->row() << child << child->id() << child->data(0, Qt::DisplayRole);
+ qDebug() << "Row:" << child->row() << child << child->data(0, Qt::DisplayRole);
childIter++;
}
}
- qDebug() << "==== End Of Childlist ====";
+ qDebug() << "==== End Of Childlist ====";
}
/*****************************************
PropertyMapItem::~PropertyMapItem() {
}
-
+
QVariant PropertyMapItem::data(int column, int role) const {
if(column >= columnCount())
return QVariant();
case Qt::ToolTipRole:
return toolTip(column);
case Qt::DisplayRole:
+ case TreeModel::SortRole: // fallthrough, since SortRole should default to DisplayRole
return property(_propertyOrder[column].toAscii());
default:
return QVariant();
}
-
+
}
bool PropertyMapItem::setData(int column, const QVariant &value, int role) {
int PropertyMapItem::columnCount() const {
return _propertyOrder.count();
}
-
+
void PropertyMapItem::appendProperty(const QString &property) {
_propertyOrder << property;
}
rootItem = new SimpleTreeItem(data, 0);
connectItem(rootItem);
- if(QCoreApplication::instance()->arguments().contains("--debugmodel")) {
+ if(Quassel::isOptionSet("debugmodel")) {
connect(this, SIGNAL(rowsAboutToBeInserted(const QModelIndex &, int, int)),
- this, SLOT(debug_rowsAboutToBeInserted(const QModelIndex &, int, int)));
+ this, SLOT(debug_rowsAboutToBeInserted(const QModelIndex &, int, int)));
connect(this, SIGNAL(rowsAboutToBeRemoved(const QModelIndex &, int, int)),
- this, SLOT(debug_rowsAboutToBeRemoved(const QModelIndex &, int, int)));
+ this, SLOT(debug_rowsAboutToBeRemoved(const QModelIndex &, int, int)));
connect(this, SIGNAL(rowsInserted(const QModelIndex &, int, int)),
- this, SLOT(debug_rowsInserted(const QModelIndex &, int, int)));
+ this, SLOT(debug_rowsInserted(const QModelIndex &, int, int)));
connect(this, SIGNAL(rowsRemoved(const QModelIndex &, int, int)),
- this, SLOT(debug_rowsRemoved(const QModelIndex &, int, int)));
+ this, SLOT(debug_rowsRemoved(const QModelIndex &, int, int)));
+ connect(this, SIGNAL(dataChanged(const QModelIndex &, const QModelIndex &)),
+ this, SLOT(debug_dataChanged(const QModelIndex &, const QModelIndex &)));
}
}
}
QModelIndex TreeModel::index(int row, int column, const QModelIndex &parent) const {
- if(!hasIndex(row, column, parent))
+ if(row < 0 || row >= rowCount(parent) || column < 0 || column >= columnCount(parent))
return QModelIndex();
-
+
AbstractTreeItem *parentItem;
-
+
if(!parent.isValid())
parentItem = rootItem;
else
parentItem = static_cast<AbstractTreeItem *>(parent.internalPointer());
-
+
AbstractTreeItem *childItem = parentItem->child(row);
if(childItem)
return QModelIndex();
}
-QModelIndex TreeModel::indexById(quint64 id, const QModelIndex &parent) const {
- AbstractTreeItem *parentItem;
-
- if(!parent.isValid())
- parentItem = rootItem;
- else
- parentItem = static_cast<AbstractTreeItem *>(parent.internalPointer());
-
- AbstractTreeItem *childItem = parentItem->childById(id);
-
- if(childItem)
- return createIndex(childItem->row(), 0, childItem);
- else
- return QModelIndex();
-}
-
QModelIndex TreeModel::indexByItem(AbstractTreeItem *item) const {
if(item == 0) {
qWarning() << "TreeModel::indexByItem(AbstractTreeItem *item) received NULL-Pointer";
return QModelIndex();
}
-
+
if(item == rootItem)
return QModelIndex();
else
QModelIndex TreeModel::parent(const QModelIndex &index) const {
if(!index.isValid()) {
- qWarning() << "TreeModel::parent(): has been asked for the rootItems Parent!";
+ // ModelTest does this
+ // qWarning() << "TreeModel::parent(): has been asked for the rootItems Parent!";
return QModelIndex();
}
-
+
AbstractTreeItem *childItem = static_cast<AbstractTreeItem *>(index.internalPointer());
AbstractTreeItem *parentItem = childItem->parent();
Q_ASSERT(parentItem);
if(parentItem == rootItem)
return QModelIndex();
-
+
return createIndex(parentItem->row(), 0, parentItem);
}
else
parentItem = static_cast<AbstractTreeItem*>(parent.internalPointer());
- return parentItem->childCount();
+ return parentItem->childCount(parent.column());
}
int TreeModel::columnCount(const QModelIndex &parent) const {
Q_UNUSED(parent)
+ return rootItem->columnCount();
// since there the Qt Views don't draw more columns than the header has columns
// we can be lazy and simply return the count of header columns
// actually this gives us more freedom cause we don't have to ensure that a rows parent
// has equal or more columns than that row
-
-// if(parent.isValid()) {
-// AbstractTreeItem *child;
-// if(child = static_cast<AbstractTreeItem *>(parent.internalPointer())->child(parent.column(), parent.row()))
-// return child->columnCount();
-// else
-// return static_cast<AbstractTreeItem*>(parent.internalPointer())->columnCount();
-// } else {
-// return rootItem->columnCount();
-// }
- return rootItem->columnCount();
+// AbstractTreeItem *parentItem;
+// if(!parent.isValid())
+// parentItem = rootItem;
+// else
+// parentItem = static_cast<AbstractTreeItem*>(parent.internalPointer());
+// return parentItem->columnCount();
}
QVariant TreeModel::data(const QModelIndex &index, int role) const {
}
Qt::ItemFlags TreeModel::flags(const QModelIndex &index) const {
- AbstractTreeItem *item;
- if(!index.isValid())
- item = rootItem;
- else
- item = static_cast<AbstractTreeItem *>(index.internalPointer());
- return item->flags();
+ if(!index.isValid()) {
+ return rootItem->flags() & Qt::ItemIsDropEnabled;
+ } else {
+ AbstractTreeItem *item = static_cast<AbstractTreeItem *>(index.internalPointer());
+ return item->flags();
+ }
}
QVariant TreeModel::headerData(int section, Qt::Orientation orientation, int role) const {
void TreeModel::connectItem(AbstractTreeItem *item) {
connect(item, SIGNAL(dataChanged(int)),
- this, SLOT(itemDataChanged(int)));
-
+ this, SLOT(itemDataChanged(int)));
+
connect(item, SIGNAL(beginAppendChilds(int, int)),
- this, SLOT(beginAppendChilds(int, int)));
+ this, SLOT(beginAppendChilds(int, int)));
connect(item, SIGNAL(endAppendChilds()),
- this, SLOT(endAppendChilds()));
-
+ this, SLOT(endAppendChilds()));
+
connect(item, SIGNAL(beginRemoveChilds(int, int)),
- this, SLOT(beginRemoveChilds(int, int)));
+ this, SLOT(beginRemoveChilds(int, int)));
connect(item, SIGNAL(endRemoveChilds()),
- this, SLOT(endRemoveChilds()));
+ this, SLOT(endRemoveChilds()));
}
void TreeModel::beginAppendChilds(int firstRow, int lastRow) {
AbstractTreeItem *parentItem = qobject_cast<AbstractTreeItem *>(sender());
if(!parentItem) {
- qWarning() << "TreeModel::beginAppendChilds(): cannot append Childs to unknown parent";
+ qWarning() << "TreeModel::beginAppendChilds(): cannot append Children to unknown parent";
return;
}
QModelIndex parent = indexByItem(parentItem);
Q_ASSERT(!_aboutToRemoveOrInsert);
-
+
_aboutToRemoveOrInsert = true;
_childStatus = ChildStatus(parent, rowCount(parent), firstRow, lastRow);
beginInsertRows(parent, firstRow, lastRow);
void TreeModel::endAppendChilds() {
AbstractTreeItem *parentItem = qobject_cast<AbstractTreeItem *>(sender());
if(!parentItem) {
- qWarning() << "TreeModel::endAppendChilds(): cannot append Childs to unknown parent";
+ qWarning() << "TreeModel::endAppendChilds(): cannot append Children to unknown parent";
return;
}
Q_ASSERT(_aboutToRemoveOrInsert);
void TreeModel::beginRemoveChilds(int firstRow, int lastRow) {
AbstractTreeItem *parentItem = qobject_cast<AbstractTreeItem *>(sender());
if(!parentItem) {
- qWarning() << "TreeModel::beginRemoveChilds(): cannot append Childs to unknown parent";
+ qWarning() << "TreeModel::beginRemoveChilds(): cannot append Children to unknown parent";
return;
}
+
+ for(int i = firstRow; i <= lastRow; i++) {
+ disconnect(parentItem->child(i), 0, this, 0);
+ }
+
+ // consitency checks
QModelIndex parent = indexByItem(parentItem);
Q_ASSERT(firstRow <= lastRow);
Q_ASSERT(parentItem->childCount() > lastRow);
Q_ASSERT(!_aboutToRemoveOrInsert);
-
_aboutToRemoveOrInsert = true;
_childStatus = ChildStatus(parent, rowCount(parent), firstRow, lastRow);
+
beginRemoveRows(parent, firstRow, lastRow);
}
void TreeModel::endRemoveChilds() {
AbstractTreeItem *parentItem = qobject_cast<AbstractTreeItem *>(sender());
if(!parentItem) {
- qWarning() << "TreeModel::endRemoveChilds(): cannot append Childs to unknown parent";
+ qWarning() << "TreeModel::endRemoveChilds(): cannot remove Children from unknown parent";
return;
}
+
+ // concistency checks
Q_ASSERT(_aboutToRemoveOrInsert);
ChildStatus cs = _childStatus;
QModelIndex parent = indexByItem(parentItem);
Q_ASSERT(cs.parent == parent);
Q_ASSERT(rowCount(parent) == cs.childCount - cs.end + cs.start - 1);
-
_aboutToRemoveOrInsert = false;
+
endRemoveRows();
}
}
void TreeModel::debug_rowsAboutToBeInserted(const QModelIndex &parent, int start, int end) {
- // qDebug() << "debug_rowsAboutToBeInserted" << parent << parent.internalPointer() << parent.data().toString() << rowCount(parent) << start << end;
+ qDebug() << "debug_rowsAboutToBeInserted" << parent << parent.internalPointer() << parent.data().toString() << rowCount(parent) << start << end;
}
void TreeModel::debug_rowsAboutToBeRemoved(const QModelIndex &parent, int start, int end) {
parentItem = static_cast<AbstractTreeItem *>(parent.internalPointer());
if(!parentItem)
parentItem = rootItem;
- qDebug() << "#" << parent << parentItem << parent.data().toString() << rowCount(parent) << start << end;
+ qDebug() << "debug_rowsAboutToBeRemoved" << parent << parentItem << parent.data().toString() << rowCount(parent) << start << end;
QModelIndex child;
AbstractTreeItem *childItem;
child = parent.child(i, 0);
childItem = parentItem->child(i);
Q_ASSERT(childItem);
- qDebug() << ">>>" << i << child << childItem->id() << child.data().toString();
+ qDebug() << ">>>" << i << child << child.data().toString();
}
}
parentItem = static_cast<AbstractTreeItem *>(parent.internalPointer());
if(!parentItem)
parentItem = rootItem;
- qDebug() << "#" << parent << parentItem << parent.data().toString() << rowCount(parent) << start << end;
+ qDebug() << "debug_rowsInserted:" << parent << parentItem << parent.data().toString() << rowCount(parent) << start << end;
QModelIndex child;
AbstractTreeItem *childItem;
child = parent.child(i, 0);
childItem = parentItem->child(i);
Q_ASSERT(childItem);
- qDebug() << "<<<" << i << child << childItem->id() << child.data().toString();
+ qDebug() << "<<<" << i << child << child.data().toString();
}
}
void TreeModel::debug_rowsRemoved(const QModelIndex &parent, int start, int end) {
- // qDebug() << "debug_rowsRemoved" << parent << parent.internalPointer() << parent.data().toString() << rowCount(parent) << start << end;
+ qDebug() << "debug_rowsRemoved" << parent << parent.internalPointer() << parent.data().toString() << rowCount(parent) << start << end;
+}
+
+void TreeModel::debug_dataChanged(const QModelIndex &topLeft, const QModelIndex &bottomRight) {
+ qDebug() << "debug_dataChanged" << topLeft << bottomRight;
+ QStringList displayData;
+ for(int row = topLeft.row(); row <= bottomRight.row(); row++) {
+ displayData = QStringList();
+ for(int column = topLeft.column(); column <= bottomRight.column(); column++) {
+ displayData << data(topLeft.sibling(row, column), Qt::DisplayRole).toString();
+ }
+ qDebug() << " row:" << row << displayData;
+ }
}