/* * Bittorrent Client using Qt4 and libtorrent. * Copyright (C) 2006 Christophe Dumez * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * * In addition, as a special exception, the copyright holders give permission to * link this program with the OpenSSL project's "OpenSSL" library (or with * modified versions of it that use the same license as the "OpenSSL" library), * and distribute the linked executables. You must obey the GNU General Public * License in all respects for all of the code used other than "OpenSSL". If you * modify file(s), you may extend this exception to your version of the file(s), * but you are not obligated to do so. If you do not wish to do so, delete this * exception statement from your version. * * Contact : chris@qbittorrent.org */ #ifndef TORRENTFILESMODEL_H #define TORRENTFILESMODEL_H #include #include #include #include #include #include enum TreeItemType {TFILE, FOLDER, ROOT}; class TreeItem { private: QList childItems; QList itemData; TreeItem *parentItem; TreeItemType type; public: // File Construction TreeItem(file_entry const& f, TreeItem *parent) { parentItem = parent; type = TFILE; itemData << misc::toQString(f.path.string()).split("/").last(); qDebug("Created a TreeItem file with name %s", getName().toLocal8Bit().data()); qDebug("parent is %s", parent->getName().toLocal8Bit().data()); itemData << f.size; itemData << 0.; // Progress; itemData << 1; // Priority if(parent) parent->updateSize(); } // Folder constructor TreeItem(QString name, TreeItem *parent=0) { parentItem = parent; type = FOLDER; itemData << name; itemData << 0.; // Size itemData << 0.; // Progress; itemData << 1; // Priority } TreeItem(QList data) { parentItem = 0; type = ROOT; itemData = data; } ~TreeItem() { qDebug("Deleting item: %s", getName().toLocal8Bit().data()); qDeleteAll(childItems); } void deleteAllChildren() { Q_ASSERT(type==ROOT); qDeleteAll(childItems); childItems.clear(); Q_ASSERT(childItems.empty()); } const QList& children() const { return childItems; } QString getName() const { //Q_ASSERT(type != ROOT); return itemData.first().toString(); } void setName(QString name) { Q_ASSERT(type != ROOT); itemData.replace(0, name); } qulonglong getSize() const { return itemData.value(1).toULongLong(); } void setSize(qulonglong size) { if(getSize() == size) return; itemData.replace(1, (qulonglong)size); if(parentItem) parentItem->updateSize(); } void updateSize() { if(type == ROOT) return; Q_ASSERT(type == FOLDER); qulonglong size = 0; foreach(TreeItem* child, childItems) { size += child->getSize(); } setSize(size); } void setProgress(float progress) { if(progress == getProgress()) return; itemData.replace(2, progress); if(parentItem) parentItem->updateProgress(); } float getProgress() const { return itemData.value(2).toDouble(); } void updateProgress() { if(type == ROOT) return; Q_ASSERT(type == FOLDER); size_t total_size = 0; size_t total_done = 0; foreach(TreeItem* child, childItems) { size_t size = child->getSize(); total_size += size; total_done += size*child->getProgress(); } if(total_size == 0) setProgress(1.); else setProgress((float)total_done/(float)total_size); } int getPriority() const { return itemData.value(3).toInt(); } void setPriority(int priority) { if(getPriority() != priority) { itemData.replace(3, priority); // Update parent if(parentItem) parentItem->updatePriority(); } // Update children foreach(TreeItem* child, childItems) { child->setPriority(priority); } } void updatePriority() { if(type == ROOT) return; Q_ASSERT(type == FOLDER); int priority = getPriority(); bool first = true; foreach(TreeItem* child, childItems) { if(first) { priority = child->getPriority(); first = false; } else { if(child->getPriority() != priority) return; } } setPriority(priority); } TreeItem* childWithName(QString name) const { foreach(TreeItem *child, childItems) { if(child->getName() == name) return child; } return 0; } bool isFolder() const { return (type==FOLDER); } void appendChild(TreeItem *item) { Q_ASSERT(item); //Q_ASSERT(!childWithName(item->getName())); Q_ASSERT(type != TFILE); childItems.append(item); //Q_ASSERT(type != ROOT || childItems.size() == 1); } TreeItem *child(int row) { //Q_ASSERT(row >= 0 && row < childItems.size()); return childItems.value(row, 0); } int childCount() const { return childItems.count(); } int columnCount() const { return itemData.count(); } QVariant data(int column) const { return itemData.value(column); } int row() const { if (parentItem) { return parentItem->children().indexOf(const_cast(this)); } return 0; } TreeItem *parent() { return parentItem; } }; class TorrentFilesModel: public QAbstractItemModel { private: TreeItem *rootItem; TreeItem **files_index; public: TorrentFilesModel(QObject *parent=0): QAbstractItemModel(parent) { files_index = 0; QList rootData; rootData << "Name" << "Size" << "Progress" << "Priority"; rootItem = new TreeItem(rootData); } ~TorrentFilesModel() { delete [] files_index; delete rootItem; } void updateFilesProgress(std::vector fp) { for(unsigned int i=0; isetProgress((float)fp[i]/(float)item->getSize()); } } void updateFilesPriorities(std::vector fprio) { for(unsigned int i=0; isetPriority(fprio[i]); } } std::vector getFilesPriorities(unsigned int nbFiles) const { std::vector prio; for(unsigned int i=0; igetPriority()); } return prio; } bool allFiltered() const { if(!rootItem->childCount()) return true; return (rootItem->child(0)->getPriority() == IGNORED); } int columnCount(const QModelIndex &parent=QModelIndex()) const { if (parent.isValid()) return static_cast(parent.internalPointer())->columnCount(); else return rootItem->columnCount(); } bool setData(const QModelIndex & index, const QVariant & value, int role = Qt::EditRole) { if(!index.isValid()) return false; if (role != Qt::EditRole) return false; TreeItem *item = static_cast(index.internalPointer()); switch(index.column()) { case 0: item->setName(value.toString()); break; case 1: item->setSize(value.toULongLong()); break; case 2: item->setProgress(value.toDouble()); break; case 3: item->setPriority(value.toInt()); break; default: return false; } emit dataChanged(index, index); return true; } QVariant data(const QModelIndex &index, int role=Qt::DisplayRole) const { if (!index.isValid()) return QVariant(); TreeItem *item = static_cast(index.internalPointer()); if(index.column() == 0 && role == Qt::DecorationRole) { if(item->isFolder()) return QIcon(":/Icons/oxygen/folder.png"); else return QIcon(":/Icons/oxygen/file.png"); } if (role != Qt::DisplayRole) return QVariant(); return item->data(index.column()); } Qt::ItemFlags flags(const QModelIndex &index) const { if (!index.isValid()) return 0; return Qt::ItemIsEditable | Qt::ItemIsEnabled | Qt::ItemIsSelectable; } QVariant headerData(int section, Qt::Orientation orientation, int role) const { if (orientation == Qt::Horizontal && role == Qt::DisplayRole) return rootItem->data(section); return QVariant(); } QModelIndex index(int row, int column, const QModelIndex &parent=QModelIndex()) const { if (parent.isValid() && parent.column() != 0) return QModelIndex(); TreeItem *parentItem; if (!parent.isValid()) parentItem = rootItem; else parentItem = static_cast(parent.internalPointer()); TreeItem *childItem = parentItem->child(row); if (childItem) { return createIndex(row, column, childItem); } else { return QModelIndex(); } } QModelIndex parent(const QModelIndex &index) const { if (!index.isValid()) return QModelIndex(); TreeItem *childItem = static_cast(index.internalPointer()); TreeItem *parentItem = childItem->parent(); if (parentItem == rootItem) return QModelIndex(); return createIndex(parentItem->row(), 0, parentItem); } int rowCount(const QModelIndex &parent=QModelIndex()) const { TreeItem *parentItem; if (parent.column() > 0) return 0; if (!parent.isValid()) parentItem = rootItem; else parentItem = static_cast(parent.internalPointer()); return parentItem->childCount(); } void clear() { qDebug("clear called"); if(files_index) { delete [] files_index; files_index = 0; } rootItem->deleteAllChildren(); reset(); emit layoutChanged(); } void setupModelData(torrent_info const& t) { qDebug("setup model data called"); if(t.num_files() == 0) return; // Initialize files_index array files_index = new TreeItem*[t.num_files()]; TreeItem *parent = this->rootItem; if(t.num_files() ==1) { TreeItem *f = new TreeItem(t.file_at(0), parent); parent->appendChild(f); files_index[0] = f; emit layoutChanged(); return; } // Create parent folder TreeItem *current_parent = new TreeItem(misc::toQString(t.name()), parent); parent->appendChild(current_parent); TreeItem *root_folder = current_parent; // Iterate over files int i = 0; torrent_info::file_iterator fi = t.begin_files(); while(fi != t.end_files()) { current_parent = root_folder; QString path = QDir::cleanPath(misc::toQString(fi->path.string())); // Iterate of parts of the path to create necessary folders QStringList pathFolders = path.split('/'); Q_ASSERT(pathFolders.size() >= 2); QString fileName = pathFolders.takeLast(); QString currentFolderName = pathFolders.takeFirst(); Q_ASSERT(currentFolderName == current_parent->getName()); foreach(const QString &pathPart, pathFolders) { TreeItem *new_parent = current_parent->childWithName(pathPart); if(!new_parent) { new_parent = new TreeItem(pathPart, current_parent); current_parent->appendChild(new_parent); } current_parent = new_parent; } // Actually create the file TreeItem *f = new TreeItem(*fi, current_parent); current_parent->appendChild(f); files_index[i] = f; fi++; ++i; } emit layoutChanged(); } }; #endif // TORRENTFILESMODEL_H