/**************************************************************************** ** ** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies). ** All rights reserved. ** Contact: Nokia Corporation (qt-info@nokia.com) ** ** This file is part of the examples of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:BSD$ ** You may use this file under the terms of the BSD license as follows: ** ** "Redistribution and use in source and binary forms, with or without ** modification, are permitted provided that the following conditions are ** met: ** * Redistributions of source code must retain the above copyright ** notice, this list of conditions and the following disclaimer. ** * Redistributions in binary form must reproduce the above copyright ** notice, this list of conditions and the following disclaimer in ** the documentation and/or other materials provided with the ** distribution. ** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor ** the names of its contributors may be used to endorse or promote ** products derived from this software without specific prior written ** permission. ** ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT ** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR ** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT ** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT ** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, ** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY ** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT ** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE." ** $QT_END_LICENSE$ ** ****************************************************************************/ /* treemodel.cpp Provides a simple tree model to show how to create and use hierarchical models. */ #include #include "folder_item.h" #include "folder_model.h" #include "data_base_management.h" #include "folder.h" #include "db_helper.h" #include "qnaturalsorting.h" #include "yacreader_global_gui.h" #include "QsLog.h" #ifdef Q_OS_MAC #include QIcon finishedFolderIcon; void drawMacOSXFinishedFolderIcon() { QIcon ico = QFileIconProvider().icon(QFileIconProvider::Folder); QPixmap pixNormalOff = ico.pixmap(16,16, QIcon::Normal, QIcon::Off); QPixmap pixNormalOn = ico.pixmap(16,16, QIcon::Normal, QIcon::On); QPixmap pixSelectedOff = ico.pixmap(16,16, QIcon::Selected, QIcon::Off); QPixmap pixSelectedOn = ico.pixmap(16,16, QIcon::Selected, QIcon::On); QPixmap tick(":/images/folder_finished_macosx.png"); { QPainter p(&pixNormalOff); p.drawPixmap(4,7,tick); } finishedFolderIcon.addPixmap(pixNormalOff, QIcon::Normal, QIcon::Off); { QPainter p(&pixNormalOn); p.drawPixmap(4,7,tick); } finishedFolderIcon.addPixmap(pixNormalOn, QIcon::Normal, QIcon::On); { QPainter p(&pixSelectedOff); p.drawPixmap(4,7,tick); } finishedFolderIcon.addPixmap(pixSelectedOff, QIcon::Selected, QIcon::Off); { QPainter p(&pixSelectedOn); p.drawPixmap(4,7,tick); } finishedFolderIcon.addPixmap(pixSelectedOn, QIcon::Selected, QIcon::On); } #endif #define ROOT 1 FolderModel::FolderModel(QObject *parent) : QAbstractItemModel(parent),rootItem(0) { connect(this,SIGNAL(beforeReset()),this,SIGNAL(modelAboutToBeReset())); connect(this,SIGNAL(reset()),this,SIGNAL(modelReset())); } //! [0] FolderModel::FolderModel( QSqlQuery &sqlquery, QObject *parent) : QAbstractItemModel(parent),rootItem(0) { //lo m�s probable es que el nodo ra�z no necesite tener informaci�n QList rootData; rootData << "root"; //id 0, padre 0, title "root" (el id, y el id del padre van a ir en la clase TreeItem) rootItem = new FolderItem(rootData); rootItem->id = ROOT; rootItem->parentItem = 0; setupModelData(sqlquery, rootItem); //sqlquery.finish(); } //! [0] //! [1] FolderModel::~FolderModel() { if(rootItem != 0) delete rootItem; } //! [1] //! [2] int FolderModel::columnCount(const QModelIndex &parent) const { if (parent.isValid()) return static_cast(parent.internalPointer())->columnCount(); else return rootItem->columnCount(); } //! [2] //! [3] QVariant FolderModel::data(const QModelIndex &index, int role) const { if (!index.isValid()) return QVariant(); FolderItem *item = static_cast(index.internalPointer()); if (role == Qt::ToolTipRole) { QString toolTip = item->data(FolderModel::Name).toString(); int totalNumOfChildren = item->childCount() + item->comicNames.size(); if(totalNumOfChildren > 0) { toolTip = toolTip + " - " + QString::number(totalNumOfChildren); } return toolTip; } if (role == Qt::DecorationRole) #ifdef Q_OS_MAC if(item->data(FolderModel::Finished).toBool()){ if(finishedFolderIcon.isNull()){ drawMacOSXFinishedFolderIcon(); } return QVariant(finishedFolderIcon); } else { return QVariant(QFileIconProvider().icon(QFileIconProvider::Folder)); } #else if(item->data(FolderModel::Finished).toBool()) return QVariant(YACReader::noHighlightedIcon(":/images/sidebar/folder_finished.png")); else return QVariant(YACReader::noHighlightedIcon(":/images/sidebar/folder.png")); #endif if(role == FolderModel::CompletedRole) return item->data(FolderModel::Completed); if(role == FolderModel::FinishedRole) return item->data(FolderModel::Finished); if(role == FolderModel::IdRole) return item->id; if (role != Qt::DisplayRole) return QVariant(); return item->data(index.column()); } //! [3] //! [4] Qt::ItemFlags FolderModel::flags(const QModelIndex &index) const { if (!index.isValid()) return 0; return Qt::ItemIsEnabled | Qt::ItemIsSelectable | Qt::ItemIsDropEnabled | Qt::ItemIsDragEnabled; } //! [4] //! [5] QVariant FolderModel::headerData(int section, Qt::Orientation orientation, int role) const { if (orientation == Qt::Horizontal && role == Qt::DisplayRole) return rootItem->data(section); return QVariant(); } //! [5] //! [6] QModelIndex FolderModel::index(int row, int column, const QModelIndex &parent) const { if (!hasIndex(row, column, parent)) return QModelIndex(); FolderItem *parentItem; if (!parent.isValid()) parentItem = rootItem; else parentItem = static_cast(parent.internalPointer()); FolderItem *childItem = parentItem->child(row); if (childItem) return createIndex(row, column, childItem); else return QModelIndex(); } //! [6] //! [7] QModelIndex FolderModel::parent(const QModelIndex &index) const { if (!index.isValid()) return QModelIndex(); FolderItem *childItem = static_cast(index.internalPointer()); FolderItem *parentItem = childItem->parent(); if (parentItem == rootItem) return QModelIndex(); return createIndex(parentItem->row(), 0, parentItem); } //! [7] /* QModelIndex FolderModel::indexFromItem(FolderItem * item,int column) { //if(item->parent() != 0) // return index(item->row(),column,parent(indexFromItem(item->parent(),column-1))); //else // return index(item->row(),0,QModelIndex()); return createIndex(item->row(), column, item); }*/ //! [8] int FolderModel::rowCount(const QModelIndex &parent) const { FolderItem *parentItem; if (parent.column() > 0) return 0; if (!parent.isValid()) parentItem = rootItem; else parentItem = static_cast(parent.internalPointer()); return parentItem->childCount(); } //! [8] void FolderModel::setupModelData(QString path) { beginResetModel(); if(rootItem != 0) delete rootItem; //TODO comprobar que se libera bien la memoria rootItem = 0; //inicializar el nodo ra�z QList rootData; rootData << "root"; //id 0, padre 0, title "root" (el id, y el id del padre van a ir en la clase TreeItem) rootItem = new FolderItem(rootData); rootItem->id = ROOT; rootItem->parentItem = 0; //cargar la base de datos _databasePath = path; QSqlDatabase db = DataBaseManagement::loadDatabase(path); //crear la consulta { QSqlQuery selectQuery("select * from folder where id <> 1 order by parentId,name",db); setupModelData(selectQuery,rootItem); } //selectQuery.finish(); db.close(); QSqlDatabase::removeDatabase(path); endResetModel(); } void FolderModel::setupModelData(QSqlQuery &sqlquery, FolderItem *parent) { //64 bits para la primary key, es decir la misma precisi�n que soporta sqlit 2^64 //el diccionario permitir� encontrar cualquier nodo del �rbol r�pidamente, de forma que a�adir un hijo a un padre sea O(1) items.clear(); //se a�ade el nodo 0 items.insert(parent->id,parent); QSqlRecord record = sqlquery.record(); int name = record.indexOf("name"); int path = record.indexOf("path"); int finished = record.indexOf("finished"); int completed = record.indexOf("completed"); int id = record.indexOf("id"); int parentId = record.indexOf("parentId"); while (sqlquery.next()) { QList data; data << sqlquery.value(name).toString(); data << sqlquery.value(path).toString(); data << sqlquery.value(finished).toBool(); data << sqlquery.value(completed).toBool(); FolderItem * item = new FolderItem(data); item->id = sqlquery.value(id).toULongLong(); //la inserci�n de hijos se hace de forma ordenada FolderItem * parent = items.value(sqlquery.value(parentId).toULongLong()); //if(parent !=0) //TODO if parent==0 the parent of item was removed from the DB and delete on cascade didn't work, ERROR. parent->appendChild(item); //se a�ade el item al map, de forma que se pueda encontrar como padre en siguientes iteraciones items.insert(item->id,item); } } void FolderModel::updateFolderModelData(QSqlQuery &sqlquery, FolderItem *parent) { Q_UNUSED(parent); QSqlRecord record = sqlquery.record(); int name = record.indexOf("name"); int path = record.indexOf("path"); int finished = record.indexOf("finished"); int completed = record.indexOf("completed"); int id = record.indexOf("id"); int parentId = record.indexOf("parentId"); while (sqlquery.next()) { QList data; data << sqlquery.value(name).toString(); data << sqlquery.value(path).toString(); data << sqlquery.value(finished).toBool(); data << sqlquery.value(completed).toBool(); FolderItem * item = new FolderItem(data); item->id = sqlquery.value(id).toULongLong(); //la inserci�n de hijos se hace de forma ordenada FolderItem * parent = items.value(sqlquery.value(parentId).toULongLong()); if(parent !=0) //TODO if parent==0 the parent of item was removed from the DB and delete on cascade didn't work, ERROR. parent->appendChild(item); //se a�ade el item al map, de forma que se pueda encontrar como padre en siguientes iteraciones items.insert(item->id,item); } } QString FolderModel::getDatabase() { return _databasePath; } QString FolderModel::getFolderPath(const QModelIndex &folder) { if(!folder.isValid()) //root folder return "/"; return static_cast(folder.internalPointer())->data(FolderModel::Path).toString(); } /* void FolderModel::resetFilter() { beginResetModel(); filter = ""; includeComics = false; //TODO hay que liberar la memoria reservada para el filtrado //items.clear(); filteredItems.clear(); FolderItem * root = rootItem; rootItem = rootBeforeFilter; //TODO si no se aplica el filtro previamente, esto invalidar�a en modelo if(root !=0) delete root; rootBeforeFilter = 0; filterEnabled = false; endResetModel(); }*/ void FolderModel::updateFolderCompletedStatus(const QModelIndexList &list, bool status) { QSqlDatabase db = DataBaseManagement::loadDatabase(_databasePath); db.transaction(); foreach (QModelIndex mi, list) { FolderItem * item = static_cast(mi.internalPointer()); item->setData(FolderModel::Completed,status); Folder f = DBHelper::loadFolder(item->id,db); f.setCompleted(status); DBHelper::update(f,db); } db.commit(); db.close(); QSqlDatabase::removeDatabase(_databasePath); emit dataChanged(index(list.first().row(),FolderModel::Name),index(list.last().row(),FolderModel::Completed)); } void FolderModel::updateFolderFinishedStatus(const QModelIndexList &list, bool status) { QSqlDatabase db = DataBaseManagement::loadDatabase(_databasePath); db.transaction(); foreach (QModelIndex mi, list) { FolderItem * item = static_cast(mi.internalPointer()); item->setData(FolderModel::Finished,status); Folder f = DBHelper::loadFolder(item->id,db); f.setFinished(status); DBHelper::update(f,db); } db.commit(); db.close(); QSqlDatabase::removeDatabase(_databasePath); emit dataChanged(index(list.first().row(),FolderModel::Name),index(list.last().row(),FolderModel::Completed)); } QStringList FolderModel::getSubfoldersNames(const QModelIndex &mi) { QStringList result; qulonglong id = 1; if(mi.isValid()){ FolderItem * item = static_cast(mi.internalPointer()); id = item->id; } QSqlDatabase db = DataBaseManagement::loadDatabase(_databasePath); db.transaction(); result = DBHelper::loadSubfoldersNames(id,db); db.commit(); db.close(); QSqlDatabase::removeDatabase(_databasePath); //TODO sort result)) qSort(result.begin(),result.end(),naturalSortLessThanCI); return result; } void FolderModel::fetchMoreFromDB(const QModelIndex &parent) { FolderItem * item; if(parent.isValid()) item = static_cast(parent.internalPointer()); else item = rootItem; //Remove all children if(item->childCount() > 0) { beginRemoveRows(parent, 0, item->childCount()-1); item->clearChildren(); endRemoveRows(); } QSqlDatabase db = DataBaseManagement::loadDatabase(_databasePath); QList items; QList nextLevelItems; QSqlQuery selectQuery(db); selectQuery.prepare("select * from folder where id <> 1 and parentId = :parentId order by parentId,name"); items << item; bool firstLevelUpdated = false; while(items.size() > 0) { nextLevelItems.clear(); foreach(FolderItem * item, items) { QLOG_DEBUG() << "ID " << item->id; selectQuery.bindValue(":parentId", item->id); selectQuery.exec(); if(!firstLevelUpdated) { //NO size support int numResults = 0; while(selectQuery.next()) numResults++; if(!selectQuery.seek(-1)) selectQuery.exec(); //END no size support beginInsertRows(parent, 0, numResults-1); } updateFolderModelData(selectQuery,item); if(!firstLevelUpdated) { endInsertRows(); firstLevelUpdated = true; } nextLevelItems << item->children(); } items.clear(); items = nextLevelItems; } QLOG_DEBUG() << "item->childCount()-1" << item->childCount()-1; db.close(); QSqlDatabase::removeDatabase(_databasePath); } QModelIndex FolderModel::addFolderAtParent(const QString &folderName, const QModelIndex &parent) { FolderItem * parentItem; if(parent.isValid()) parentItem = static_cast(parent.internalPointer()); else parentItem = rootItem; Folder newFolder; newFolder.name = folderName; newFolder.parentId = parentItem->id; newFolder.path = parentItem->data(1).toString() + "/" + folderName; QSqlDatabase db = DataBaseManagement::loadDatabase(_databasePath); newFolder.id = DBHelper::insert(&newFolder, db); DBHelper::updateChildrenInfo(parentItem->id, db); QSqlDatabase::removeDatabase(_databasePath); int destRow = 0; QList data; data << newFolder.name; data << newFolder.path; data << false; //finished data << true; //completed FolderItem * item = new FolderItem(data); item->id = newFolder.id; beginInsertRows(parent,0,0); //TODO calculate the destRow before inserting the new child parentItem->appendChild(item); destRow = parentItem->children().indexOf(item); //TODO optimize this, appendChild should return the index of the new item items.insert(item->id,item); endInsertRows(); return index(destRow,0,parent); } void FolderModel::deleteFolder(const QModelIndex &mi) { beginRemoveRows(mi.parent(),mi.row(),mi.row()); FolderItem * item = static_cast(mi.internalPointer()); FolderItem * parent = item->parent(); parent->removeChild(mi.row()); Folder f; f.setId(item->id); QSqlDatabase db = DataBaseManagement::loadDatabase(_databasePath); DBHelper::removeFromDB(&f,db); DBHelper::updateChildrenInfo(item->parent()->id, db); QSqlDatabase::removeDatabase(_databasePath); endRemoveRows(); } void FolderModel::updateFolderChildrenInfo(qulonglong folderId) { QSqlDatabase db = DataBaseManagement::loadDatabase(_databasePath); DBHelper::updateChildrenInfo(folderId, db); QSqlDatabase::removeDatabase(_databasePath); } //PROXY FolderModelProxy::FolderModelProxy(QObject *parent) :QSortFilterProxyModel(parent),rootItem(0),filterEnabled(false),filter(""),includeComics(true) { } FolderModelProxy::~FolderModelProxy() { } bool FolderModelProxy::filterAcceptsRow(int source_row, const QModelIndex &source_parent) const { if(!filterEnabled) return true; FolderItem * parent = static_cast(source_parent.internalPointer()); if(parent == 0) parent = static_cast(sourceModel())->rootItem; FolderItem * item = parent->children().at(source_row); return filteredItems.contains(item->id); } void FolderModelProxy::setFilter(const YACReader::SearchModifiers modifier, QString filter, bool includeComics) { clear(); this->filter = filter; this->includeComics = includeComics; this->modifier = modifier; filterEnabled = true; setupFilteredModelData(); } void FolderModelProxy::setupFilteredModelData() { beginResetModel(); //TODO hay que liberar memoria de anteriores filtrados //inicializar el nodo ra�z if(rootItem != 0) delete rootItem; //TODO comprobar que se libera bien la memoria rootItem = 0; //inicializar el nodo ra�z QList rootData; rootData << "root"; rootItem = new FolderItem(rootData); rootItem->id = ROOT; rootItem->parentItem = 0; FolderModel * model = static_cast(sourceModel()); //cargar la base de datos QSqlDatabase db = DataBaseManagement::loadDatabase(model->_databasePath); //crear la consulta { QSqlQuery selectQuery(db); //TODO check if(!includeComics) { selectQuery.prepare("select * from folder where id <> 1 and upper(name) like upper(:filter) order by parentId,name "); selectQuery.bindValue(":filter", "%%"+filter+"%%"); } else { switch(modifier) { case YACReader::NoModifiers: selectQuery.prepare("SELECT DISTINCT f.id, f.parentId, f.name, f.path, f.finished, f.completed " "FROM folder f LEFT JOIN comic c ON (f.id = c.parentId) " "WHERE f.id <> 1 AND ((UPPER(c.fileName) like UPPER(:filter)) OR (UPPER(f.name) like UPPER(:filter2))) ORDER BY f.parentId,f.name"); selectQuery.bindValue(":filter", "%%"+filter+"%%"); selectQuery.bindValue(":filter2", "%%"+filter+"%%"); break; case YACReader::OnlyRead: selectQuery.prepare("SELECT DISTINCT f.id, f.parentId, f.name, f.path, f.finished, f.completed " "FROM folder f LEFT JOIN (comic c INNER JOIN comic_info ci ON (c.comicInfoId = ci.id)) ON (f.id = c.parentId) " "WHERE f.id <> 1 AND ((UPPER(c.fileName) like UPPER(:filter)) OR (UPPER(f.name) like UPPER(:filter2))) AND ci.read = 1 ORDER BY f.parentId,f.name;"); selectQuery.bindValue(":filter", "%%"+filter+"%%"); selectQuery.bindValue(":filter2", "%%"+filter+"%%"); break; case YACReader::OnlyUnread: selectQuery.prepare("SELECT DISTINCT f.id, f.parentId, f.name, f.path, f.finished, f.completed " "FROM folder f LEFT JOIN (comic c INNER JOIN comic_info ci ON (c.comicInfoId = ci.id)) ON (f.id = c.parentId) " "WHERE f.id <> 1 AND ((UPPER(c.fileName) like UPPER(:filter)) OR (UPPER(f.name) like UPPER(:filter2))) AND ci.read = 0 ORDER BY f.parentId,f.name;"); selectQuery.bindValue(":filter", "%%"+filter+"%%"); selectQuery.bindValue(":filter2", "%%"+filter+"%%"); break; default: QLOG_ERROR() << "not implemented"; break; } } selectQuery.exec(); setupFilteredModelData(selectQuery,rootItem); } //selectQuery.finish(); db.close(); QSqlDatabase::removeDatabase(model->_databasePath); endResetModel(); } void FolderModelProxy::clear() { filterEnabled = false; filteredItems.clear(); QSortFilterProxyModel::clear(); } void FolderModelProxy::setupFilteredModelData(QSqlQuery &sqlquery, FolderItem *parent) { FolderModel * model = static_cast(sourceModel()); //64 bits para la primary key, es decir la misma precisi�n que soporta sqlit 2^64 filteredItems.clear(); //se a�ade el nodo 0 al modelo que representa el arbol de elementos que cumplen con el filtro filteredItems.insert(parent->id,parent); QSqlRecord record = sqlquery.record(); int name = record.indexOf("name"); int path = record.indexOf("path"); int finished = record.indexOf("finished"); int completed = record.indexOf("completed"); int parentIdIndex = record.indexOf("parentId"); while (sqlquery.next()) { //se procesan todos los folders que cumplen con el filtro //datos de la base de datos QList data; data << sqlquery.value(name).toString(); data << sqlquery.value(path).toString(); data << sqlquery.value(finished).toBool(); data << sqlquery.value(completed).toBool(); FolderItem * item = new FolderItem(data); item->id = sqlquery.value(0).toULongLong(); //id del padre quint64 parentId = sqlquery.value(parentIdIndex).toULongLong(); //se a�ade el item al map, de forma que se pueda encontrar como padre en siguientes iteraciones if(!filteredItems.contains(item->id)) filteredItems.insert(item->id,item); //es necesario conocer las coordenadas de origen para poder realizar scroll autom�tico en la vista item->originalItem = model->items.value(item->id); //si el padre ya existe en el modelo, el item se a�ade como hijo if(filteredItems.contains(parentId)) filteredItems.value(parentId)->appendChild(item); else//si el padre a�n no se ha a�adido, hay que a�adirlo a �l y todos los padres hasta el nodo ra�z { //comprobamos con esta variable si el �ltimo de los padres (antes del nodo ra�z) ya exist�a en el modelo bool parentPreviousInserted = false; //mientras no se alcance el nodo ra�z se procesan todos los padres (de abajo a arriba) while(parentId != ROOT ) { //el padre no estaba en el modelo filtrado, as� que se rescata del modelo original FolderItem * parentItem = model->items.value(parentId); //se debe crear un nuevo nodo (para no compartir los hijos con el nodo original) FolderItem * newparentItem = new FolderItem(parentItem->getData()); //padre que se a�adir� a la estructura de directorios filtrados newparentItem->id = parentId; newparentItem->originalItem = parentItem; //si el modelo contiene al padre, se a�ade el item actual como hijo if(filteredItems.contains(parentId)) { filteredItems.value(parentId)->appendChild(item); parentPreviousInserted = true; } //sino se registra el nodo para poder encontrarlo con posterioridad y se a�ade el item actual como hijo else { newparentItem->appendChild(item); filteredItems.insert(newparentItem->id,newparentItem); parentPreviousInserted = false; } //variables de control del bucle, se avanza hacia el nodo padre item = newparentItem; parentId = parentItem->parentItem->id; } //si el nodo es hijo de 1 y no hab�a sido previamente insertado como hijo, se a�ade como tal if(!parentPreviousInserted) filteredItems.value(ROOT)->appendChild(item); } } }