1
0
mirror of https://github.com/d47081/qBittorrent.git synced 2025-01-23 13:04:23 +00:00
qBittorrent/src/gui/transferlistsortmodel.cpp

300 lines
10 KiB
C++
Raw Normal View History

/*
2018-06-06 16:48:17 +03:00
* Bittorrent Client using Qt and libtorrent.
* Copyright (C) 2013 Nick Tiskov <daymansmail@gmail.com>
*
* 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.
*/
2018-06-06 16:48:17 +03:00
#include "transferlistsortmodel.h"
#include <QDateTime>
#include "base/bittorrent/infohash.h"
2018-06-06 16:48:17 +03:00
#include "base/bittorrent/torrenthandle.h"
#include "base/global.h"
2015-09-25 11:10:05 +03:00
#include "base/types.h"
#include "base/utils/string.h"
#include "transferlistmodel.h"
2018-06-06 16:48:17 +03:00
TransferListSortModel::TransferListSortModel(QObject *parent)
: QSortFilterProxyModel {parent}
{
setSortRole(TransferListModel::UnderlyingDataRole);
}
2015-04-19 18:17:47 +03:00
void TransferListSortModel::setStatusFilter(TorrentFilter::Type filter)
{
2015-04-19 18:17:47 +03:00
if (m_filter.setType(filter))
invalidateFilter();
}
void TransferListSortModel::setCategoryFilter(const QString &category)
{
if (m_filter.setCategory(category))
invalidateFilter();
}
void TransferListSortModel::disableCategoryFilter()
{
if (m_filter.setCategory(TorrentFilter::AnyCategory))
invalidateFilter();
}
void TransferListSortModel::setTagFilter(const QString &tag)
{
if (m_filter.setTag(tag))
invalidateFilter();
}
void TransferListSortModel::disableTagFilter()
{
if (m_filter.setTag(TorrentFilter::AnyTag))
invalidateFilter();
}
void TransferListSortModel::setTrackerFilter(const QSet<BitTorrent::InfoHash> &hashes)
{
if (m_filter.setHashSet(hashes))
invalidateFilter();
}
void TransferListSortModel::disableTrackerFilter()
{
2015-04-19 18:17:47 +03:00
if (m_filter.setHashSet(TorrentFilter::AnyHash))
invalidateFilter();
}
bool TransferListSortModel::lessThan(const QModelIndex &left, const QModelIndex &right) const
{
return lessThan_impl(left, right);
}
bool TransferListSortModel::lessThan_impl(const QModelIndex &left, const QModelIndex &right) const
{
Q_ASSERT(left.column() == right.column());
const auto invokeLessThanForColumn = [this, &left, &right](const int column) -> bool
{
return lessThan_impl(left.sibling(left.row(), column), right.sibling(right.row(), column));
};
const auto hashLessThan = [this, &left, &right]() -> bool
{
const TransferListModel *model = qobject_cast<TransferListModel *>(sourceModel());
2020-12-10 15:58:54 +08:00
const BitTorrent::InfoHash hashL = model->torrentHandle(left)->hash();
const BitTorrent::InfoHash hashR = model->torrentHandle(right)->hash();
return hashL < hashR;
};
const int sortColumn = left.column();
const QVariant leftValue = left.data(TransferListModel::UnderlyingDataRole);
const QVariant rightValue = right.data(TransferListModel::UnderlyingDataRole);
2020-11-16 10:02:11 +03:00
switch (sortColumn)
{
case TransferListModel::TR_CATEGORY:
case TransferListModel::TR_TAGS:
case TransferListModel::TR_NAME:
if (!leftValue.isValid() || !rightValue.isValid() || (leftValue == rightValue))
return invokeLessThanForColumn(TransferListModel::TR_QUEUE_POSITION);
return (Utils::String::naturalCompare(leftValue.toString(), rightValue.toString(), Qt::CaseInsensitive) < 0);
case TransferListModel::TR_STATUS:
{
const auto stateL = leftValue.value<BitTorrent::TorrentState>();
const auto stateR = rightValue.value<BitTorrent::TorrentState>();
if (stateL != stateR)
return stateL < stateR;
return invokeLessThanForColumn(TransferListModel::TR_QUEUE_POSITION);
}
case TransferListModel::TR_ADD_DATE:
case TransferListModel::TR_SEED_DATE:
2020-11-16 10:02:11 +03:00
case TransferListModel::TR_SEEN_COMPLETE_DATE:
{
const auto dateL = leftValue.toDateTime();
const auto dateR = rightValue.toDateTime();
2020-11-16 10:02:11 +03:00
if (dateL.isValid() && dateR.isValid())
{
if (dateL != dateR)
return dateL < dateR;
}
2020-11-16 10:02:11 +03:00
else if (dateL.isValid())
{
return true;
}
2020-11-16 10:02:11 +03:00
else if (dateR.isValid())
{
return false;
}
return hashLessThan();
2018-06-06 16:48:17 +03:00
}
2020-11-16 10:02:11 +03:00
case TransferListModel::TR_QUEUE_POSITION:
{
const auto positionL = leftValue.toInt();
const auto positionR = rightValue.toInt();
if ((positionL > 0) || (positionR > 0))
{
if ((positionL > 0) && (positionR > 0))
return positionL < positionR;
return positionL != 0;
}
// Sort according to TR_SEED_DATE
const auto dateL = left.sibling(left.row(), TransferListModel::TR_SEED_DATE)
.data(TransferListModel::UnderlyingDataRole).toDateTime();
const auto dateR = right.sibling(right.row(), TransferListModel::TR_SEED_DATE)
.data(TransferListModel::UnderlyingDataRole).toDateTime();
2020-11-16 10:02:11 +03:00
if (dateL.isValid() && dateR.isValid())
{
if (dateL != dateR)
return dateL < dateR;
}
2020-11-16 10:02:11 +03:00
else if (dateL.isValid())
{
return false;
}
2020-11-16 10:02:11 +03:00
else if (dateR.isValid())
{
return true;
}
return hashLessThan();
}
case TransferListModel::TR_SEEDS:
2020-11-16 10:02:11 +03:00
case TransferListModel::TR_PEERS:
{
// Active peers/seeds take precedence over total peers/seeds
const auto activeL = leftValue.toInt();
const auto activeR = rightValue.toInt();
if (activeL != activeR)
return activeL < activeR;
const auto totalL = left.data(TransferListModel::AdditionalUnderlyingDataRole).toInt();
const auto totalR = right.data(TransferListModel::AdditionalUnderlyingDataRole).toInt();
if (totalL != totalR)
return totalL < totalR;
return invokeLessThanForColumn(TransferListModel::TR_QUEUE_POSITION);
}
2020-11-16 10:02:11 +03:00
case TransferListModel::TR_ETA:
{
2018-06-06 16:48:17 +03:00
// Sorting rules prioritized.
// 1. Active torrents at the top
// 2. Seeding torrents at the bottom
// 3. Torrents with invalid ETAs at the bottom
2019-08-07 14:26:36 +08:00
const TransferListModel *model = qobject_cast<TransferListModel *>(sourceModel());
// From QSortFilterProxyModel::lessThan() documentation:
// "Note: The indices passed in correspond to the source model"
const bool isActiveL = TorrentFilter::ActiveTorrent.match(model->torrentHandle(left));
const bool isActiveR = TorrentFilter::ActiveTorrent.match(model->torrentHandle(right));
2018-06-06 16:48:17 +03:00
if (isActiveL != isActiveR)
return isActiveL;
const auto queuePosL = left.sibling(left.row(), TransferListModel::TR_QUEUE_POSITION)
.data(TransferListModel::UnderlyingDataRole).toInt();
const auto queuePosR = right.sibling(right.row(), TransferListModel::TR_QUEUE_POSITION)
.data(TransferListModel::UnderlyingDataRole).toInt();
const bool isSeedingL = (queuePosL < 0);
const bool isSeedingR = (queuePosR < 0);
2020-11-16 10:02:11 +03:00
if (isSeedingL != isSeedingR)
{
2018-06-06 16:48:17 +03:00
const bool isAscendingOrder = (sortOrder() == Qt::AscendingOrder);
if (isSeedingL)
return !isAscendingOrder;
2019-02-12 20:05:01 +02:00
return isAscendingOrder;
2018-06-06 16:48:17 +03:00
}
const auto etaL = leftValue.toLongLong();
const auto etaR = rightValue.toLongLong();
2018-06-06 16:48:17 +03:00
const bool isInvalidL = ((etaL < 0) || (etaL >= MAX_ETA));
const bool isInvalidR = ((etaR < 0) || (etaR >= MAX_ETA));
2020-11-16 10:02:11 +03:00
if (isInvalidL && isInvalidR)
{
2018-06-06 16:48:17 +03:00
if (isSeedingL) // Both seeding
return invokeLessThanForColumn(TransferListModel::TR_SEED_DATE);
2019-02-12 20:05:01 +02:00
return (queuePosL < queuePosR);
2018-06-06 16:48:17 +03:00
}
if (!isInvalidL && !isInvalidR)
2018-06-06 16:48:17 +03:00
return (etaL < etaR);
2019-02-12 20:05:01 +02:00
return !isInvalidL;
}
case TransferListModel::TR_LAST_ACTIVITY:
{
const auto lastActivityL = leftValue.toLongLong();
const auto lastActivityR = rightValue.toLongLong();
if (lastActivityL < 0) return false;
if (lastActivityR < 0) return true;
return lastActivityL < lastActivityR;
}
case TransferListModel::TR_RATIO_LIMIT:
{
const auto ratioL = leftValue.toReal();
const auto ratioR = rightValue.toReal();
if (ratioL < 0) return false;
if (ratioR < 0) return true;
return ratioL < ratioR;
}
}
return (leftValue != rightValue)
? QSortFilterProxyModel::lessThan(left, right)
: invokeLessThanForColumn(TransferListModel::TR_QUEUE_POSITION);
}
2019-08-07 14:26:36 +08:00
bool TransferListSortModel::filterAcceptsRow(const int sourceRow, const QModelIndex &sourceParent) const
{
2015-04-19 18:17:47 +03:00
return matchFilter(sourceRow, sourceParent)
&& QSortFilterProxyModel::filterAcceptsRow(sourceRow, sourceParent);
}
2019-08-07 14:26:36 +08:00
bool TransferListSortModel::matchFilter(const int sourceRow, const QModelIndex &sourceParent) const
{
2019-08-07 14:26:36 +08:00
const auto *model = qobject_cast<TransferListModel *>(sourceModel());
if (!model) return false;
2019-08-07 14:26:36 +08:00
const BitTorrent::TorrentHandle *torrent = model->torrentHandle(model->index(sourceRow, 0, sourceParent));
2015-04-19 18:17:47 +03:00
if (!torrent) return false;
2015-04-19 18:17:47 +03:00
return m_filter.match(torrent);
}