mirror of
https://github.com/qbittorrent/qBittorrent.git
synced 2025-12-23 08:48:07 -06:00
Follow project coding style. Issue #2192.
This commit is contained in:
@@ -31,136 +31,139 @@
|
||||
#include <QDebug>
|
||||
#include "torrentcontentmodelfolder.h"
|
||||
|
||||
TorrentContentModelFolder::TorrentContentModelFolder(const QString& name, TorrentContentModelFolder* parent)
|
||||
: TorrentContentModelItem(parent)
|
||||
TorrentContentModelFolder::TorrentContentModelFolder(const QString &name, TorrentContentModelFolder *parent)
|
||||
: TorrentContentModelItem(parent)
|
||||
{
|
||||
Q_ASSERT(parent);
|
||||
m_name = name;
|
||||
// Do not display incomplete extensions
|
||||
if (m_name.endsWith(".!qB"))
|
||||
m_name.chop(4);
|
||||
Q_ASSERT(parent);
|
||||
m_name = name;
|
||||
// Do not display incomplete extensions
|
||||
if (m_name.endsWith(".!qB"))
|
||||
m_name.chop(4);
|
||||
}
|
||||
|
||||
TorrentContentModelFolder::TorrentContentModelFolder(const QList<QVariant>& data)
|
||||
: TorrentContentModelItem(0)
|
||||
TorrentContentModelFolder::TorrentContentModelFolder(const QList<QVariant> &data)
|
||||
: TorrentContentModelItem(0)
|
||||
{
|
||||
Q_ASSERT(data.size() == NB_COL);
|
||||
m_itemData = data;
|
||||
Q_ASSERT(data.size() == NB_COL);
|
||||
m_itemData = data;
|
||||
}
|
||||
|
||||
TorrentContentModelFolder::~TorrentContentModelFolder()
|
||||
{
|
||||
qDeleteAll(m_childItems);
|
||||
qDeleteAll(m_childItems);
|
||||
}
|
||||
|
||||
TorrentContentModelItem::ItemType TorrentContentModelFolder::itemType() const
|
||||
{
|
||||
return FolderType;
|
||||
}
|
||||
|
||||
void TorrentContentModelFolder::deleteAllChildren()
|
||||
{
|
||||
Q_ASSERT(isRootItem());
|
||||
qDeleteAll(m_childItems);
|
||||
m_childItems.clear();
|
||||
Q_ASSERT(isRootItem());
|
||||
qDeleteAll(m_childItems);
|
||||
m_childItems.clear();
|
||||
}
|
||||
|
||||
const QList<TorrentContentModelItem*>& TorrentContentModelFolder::children() const
|
||||
const QList<TorrentContentModelItem *> &TorrentContentModelFolder::children() const
|
||||
{
|
||||
return m_childItems;
|
||||
return m_childItems;
|
||||
}
|
||||
|
||||
void TorrentContentModelFolder::appendChild(TorrentContentModelItem* item)
|
||||
void TorrentContentModelFolder::appendChild(TorrentContentModelItem *item)
|
||||
{
|
||||
Q_ASSERT(item);
|
||||
m_childItems.append(item);
|
||||
// Update own size
|
||||
if (item->itemType() == FileType)
|
||||
increaseSize(item->size());
|
||||
Q_ASSERT(item);
|
||||
m_childItems.append(item);
|
||||
// Update own size
|
||||
if (item->itemType() == FileType)
|
||||
increaseSize(item->size());
|
||||
}
|
||||
|
||||
TorrentContentModelItem* TorrentContentModelFolder::child(int row) const
|
||||
TorrentContentModelItem *TorrentContentModelFolder::child(int row) const
|
||||
{
|
||||
return m_childItems.value(row, 0);
|
||||
return m_childItems.value(row, 0);
|
||||
}
|
||||
|
||||
TorrentContentModelFolder* TorrentContentModelFolder::childFolderWithName(const QString& name) const
|
||||
TorrentContentModelFolder *TorrentContentModelFolder::childFolderWithName(const QString &name) const
|
||||
{
|
||||
foreach (TorrentContentModelItem* child, m_childItems) {
|
||||
if (child->itemType() == FolderType && child->name() == name)
|
||||
return static_cast<TorrentContentModelFolder*>(child);
|
||||
}
|
||||
return 0;
|
||||
foreach (TorrentContentModelItem *child, m_childItems)
|
||||
if ((child->itemType() == FolderType) && (child->name() == name))
|
||||
return static_cast<TorrentContentModelFolder *>(child);
|
||||
return 0;
|
||||
}
|
||||
|
||||
int TorrentContentModelFolder::childCount() const
|
||||
{
|
||||
return m_childItems.count();
|
||||
return m_childItems.count();
|
||||
}
|
||||
|
||||
// Only non-root folders use this function
|
||||
void TorrentContentModelFolder::updatePriority()
|
||||
{
|
||||
if (isRootItem())
|
||||
return;
|
||||
if (isRootItem())
|
||||
return;
|
||||
|
||||
Q_ASSERT(!m_childItems.isEmpty());
|
||||
Q_ASSERT(!m_childItems.isEmpty());
|
||||
|
||||
// If all children have the same priority
|
||||
// then the folder should have the same
|
||||
// priority
|
||||
const int prio = m_childItems.first()->priority();
|
||||
for (int i=1; i<m_childItems.size(); ++i) {
|
||||
if (m_childItems.at(i)->priority() != prio) {
|
||||
setPriority(prio::MIXED);
|
||||
return;
|
||||
// If all children have the same priority
|
||||
// then the folder should have the same
|
||||
// priority
|
||||
const int prio = m_childItems.first()->priority();
|
||||
for (int i = 1; i < m_childItems.size(); ++i) {
|
||||
if (m_childItems.at(i)->priority() != prio) {
|
||||
setPriority(prio::MIXED);
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
// All child items have the same priority
|
||||
// Update own if necessary
|
||||
setPriority(prio);
|
||||
// All child items have the same priority
|
||||
// Update own if necessary
|
||||
setPriority(prio);
|
||||
}
|
||||
|
||||
void TorrentContentModelFolder::setPriority(int new_prio, bool update_parent)
|
||||
void TorrentContentModelFolder::setPriority(int newPriority, bool updateParent)
|
||||
{
|
||||
if (m_priority == new_prio)
|
||||
return;
|
||||
if (m_priority == newPriority)
|
||||
return;
|
||||
|
||||
m_priority = new_prio;
|
||||
m_priority = newPriority;
|
||||
|
||||
// Update parent priority
|
||||
if (update_parent)
|
||||
m_parentItem->updatePriority();
|
||||
// Update parent priority
|
||||
if (updateParent)
|
||||
m_parentItem->updatePriority();
|
||||
|
||||
// Update children
|
||||
if (m_priority != prio::MIXED) {
|
||||
foreach (TorrentContentModelItem* child, m_childItems)
|
||||
child->setPriority(m_priority, false);
|
||||
}
|
||||
// Update children
|
||||
if (m_priority != prio::MIXED)
|
||||
foreach (TorrentContentModelItem *child, m_childItems)
|
||||
child->setPriority(m_priority, false);
|
||||
}
|
||||
|
||||
void TorrentContentModelFolder::recalculateProgress()
|
||||
{
|
||||
qreal tProgress = 0;
|
||||
qulonglong tSize = 0;
|
||||
qulonglong tRemaining = 0;
|
||||
foreach (TorrentContentModelItem* child, m_childItems) {
|
||||
if (child->priority() != prio::IGNORED) {
|
||||
if (child->itemType() == FolderType)
|
||||
static_cast<TorrentContentModelFolder*>(child)->recalculateProgress();
|
||||
tProgress += child->progress() * child->size();
|
||||
tSize += child->size();
|
||||
tRemaining += child->remaining();
|
||||
qreal tProgress = 0;
|
||||
qulonglong tSize = 0;
|
||||
qulonglong tRemaining = 0;
|
||||
foreach (TorrentContentModelItem *child, m_childItems) {
|
||||
if (child->priority() != prio::IGNORED) {
|
||||
if (child->itemType() == FolderType)
|
||||
static_cast<TorrentContentModelFolder *>(child)->recalculateProgress();
|
||||
tProgress += child->progress() * child->size();
|
||||
tSize += child->size();
|
||||
tRemaining += child->remaining();
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (!isRootItem() && tSize > 0) {
|
||||
m_progress = tProgress / tSize;
|
||||
m_remaining = tRemaining;
|
||||
Q_ASSERT(m_progress <= 1.);
|
||||
}
|
||||
if (!isRootItem() && (tSize > 0)) {
|
||||
m_progress = tProgress / tSize;
|
||||
m_remaining = tRemaining;
|
||||
Q_ASSERT(m_progress <= 1.);
|
||||
}
|
||||
}
|
||||
|
||||
void TorrentContentModelFolder::increaseSize(qulonglong delta)
|
||||
{
|
||||
if (isRootItem())
|
||||
return;
|
||||
if (isRootItem())
|
||||
return;
|
||||
|
||||
m_size += delta;
|
||||
m_parentItem->increaseSize(delta);
|
||||
m_size += delta;
|
||||
m_parentItem->increaseSize(delta);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user