Some work about adaptive color scheme for Web UI (PR #19901)
http://[316:c51a:62a3:8b9::4]/d4708/qBittorrent/src/branch/adaptive-webui
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
239 lines
8.6 KiB
239 lines
8.6 KiB
/* |
|
* Bittorrent Client using Qt4 and libtorrent. |
|
* Copyright (C) 2013 Nick Tiskov |
|
* |
|
* 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 : daymansmail@gmail.com |
|
*/ |
|
|
|
#include <QStringList> |
|
|
|
#include "core/types.h" |
|
#include "core/utils/string.h" |
|
#include "core/bittorrent/torrenthandle.h" |
|
#include "torrentmodel.h" |
|
#include "transferlistsortmodel.h" |
|
|
|
TransferListSortModel::TransferListSortModel(QObject *parent) |
|
: QSortFilterProxyModel(parent) |
|
{ |
|
} |
|
|
|
void TransferListSortModel::setStatusFilter(TorrentFilter::Type filter) |
|
{ |
|
if (m_filter.setType(filter)) |
|
invalidateFilter(); |
|
} |
|
|
|
void TransferListSortModel::setLabelFilter(const QString &label) |
|
{ |
|
if (m_filter.setLabel(label)) |
|
invalidateFilter(); |
|
} |
|
|
|
void TransferListSortModel::disableLabelFilter() |
|
{ |
|
if (m_filter.setLabel(TorrentFilter::AnyLabel)) |
|
invalidateFilter(); |
|
} |
|
|
|
void TransferListSortModel::setTrackerFilter(const QStringList &hashes) |
|
{ |
|
if (m_filter.setHashSet(hashes.toSet())) |
|
invalidateFilter(); |
|
} |
|
|
|
void TransferListSortModel::disableTrackerFilter() |
|
{ |
|
if (m_filter.setHashSet(TorrentFilter::AnyHash)) |
|
invalidateFilter(); |
|
} |
|
|
|
bool TransferListSortModel::lessThan(const QModelIndex &left, const QModelIndex &right) const |
|
{ |
|
const int column = sortColumn(); |
|
|
|
if (column == TorrentModelItem::TR_NAME) { |
|
QVariant vL = left.data(); |
|
QVariant vR = right.data(); |
|
if (!vL.isValid() || !vR.isValid() || (vL == vR)) |
|
return lowerPositionThan(left, right); |
|
|
|
bool res = false; |
|
if (Utils::String::naturalSort(vL.toString(), vR.toString(), res)) |
|
return res; |
|
|
|
return QSortFilterProxyModel::lessThan(left, right); |
|
} |
|
else if (column == TorrentModelItem::TR_ADD_DATE || column == TorrentModelItem::TR_SEED_DATE || column == TorrentModelItem::TR_SEEN_COMPLETE_DATE) { |
|
QDateTime vL = left.data().toDateTime(); |
|
QDateTime vR = right.data().toDateTime(); |
|
|
|
//not valid dates should be sorted at the bottom. |
|
if (!vL.isValid()) return false; |
|
if (!vR.isValid()) return true; |
|
|
|
return vL < vR; |
|
} |
|
else if (column == TorrentModelItem::TR_PRIORITY) { |
|
return lowerPositionThan(left, right); |
|
} |
|
else if (column == TorrentModelItem::TR_PEERS || column == TorrentModelItem::TR_SEEDS) { |
|
int left_active = left.data().toInt(); |
|
int left_total = left.data(Qt::UserRole).toInt(); |
|
int right_active = right.data().toInt(); |
|
int right_total = right.data(Qt::UserRole).toInt(); |
|
|
|
// Active peers/seeds take precedence over total peers/seeds. |
|
if (left_active == right_active) { |
|
if (left_total == right_total) |
|
return lowerPositionThan(left, right); |
|
return (left_total < right_total); |
|
} |
|
else { |
|
return (left_active < right_active); |
|
} |
|
} |
|
else if (column == TorrentModelItem::TR_ETA) { |
|
TorrentModel *model = qobject_cast<TorrentModel *>(sourceModel()); |
|
const int prioL = model->data(model->index(left.row(), TorrentModelItem::TR_PRIORITY)).toInt(); |
|
const int prioR = model->data(model->index(right.row(), TorrentModelItem::TR_PRIORITY)).toInt(); |
|
const qlonglong etaL = left.data().toLongLong(); |
|
const qlonglong etaR = right.data().toLongLong(); |
|
const bool ascend = (sortOrder() == Qt::AscendingOrder); |
|
const bool invalidL = (etaL < 0 || etaL >= MAX_ETA); |
|
const bool invalidR = (etaR < 0 || etaR >= MAX_ETA); |
|
const bool seedingL = (prioL < 0); |
|
const bool seedingR = (prioR < 0); |
|
|
|
bool activeR = TorrentFilter::ActiveTorrent.match(model->torrentHandle(model->index(right.row()))); |
|
bool activeL = TorrentFilter::ActiveTorrent.match(model->torrentHandle(model->index(right.row()))); |
|
|
|
// Sorting rules prioritized. |
|
// 1. Active torrents at the top |
|
// 2. Seeding torrents at the bottom |
|
// 3. Torrents with invalid ETAs at the bottom |
|
|
|
if (activeL != activeR) return activeL; |
|
if (seedingL != seedingR) { |
|
if (seedingL) return !ascend; |
|
else return ascend; |
|
} |
|
|
|
if (invalidL && invalidR) { |
|
if (seedingL) { //Both seeding |
|
QDateTime dateL = model->data(model->index(left.row(), TorrentModelItem::TR_SEED_DATE)).toDateTime(); |
|
QDateTime dateR = model->data(model->index(right.row(), TorrentModelItem::TR_SEED_DATE)).toDateTime(); |
|
|
|
//not valid dates should be sorted at the bottom. |
|
if (!dateL.isValid()) return false; |
|
if (!dateR.isValid()) return true; |
|
|
|
return dateL < dateR; |
|
} |
|
else { |
|
return prioL < prioR; |
|
} |
|
} |
|
else if (!invalidL && !invalidR) { |
|
return lowerPositionThan(left, right); |
|
} |
|
else { |
|
return !invalidL; |
|
} |
|
} |
|
else if (column == TorrentModelItem::TR_LAST_ACTIVITY) { |
|
const qlonglong vL = left.data().toLongLong(); |
|
const qlonglong vR = right.data().toLongLong(); |
|
|
|
if (vL == -1) return false; |
|
if (vR == -1) return true; |
|
|
|
return vL < vR; |
|
} |
|
else if (column == TorrentModelItem::TR_RATIO_LIMIT) { |
|
const qreal vL = left.data().toDouble(); |
|
const qreal vR = right.data().toDouble(); |
|
|
|
if (vL == -1) return false; |
|
if (vR == -1) return true; |
|
|
|
return vL < vR; |
|
} |
|
|
|
if (left.data() == right.data()) |
|
return lowerPositionThan(left, right); |
|
|
|
return QSortFilterProxyModel::lessThan(left, right); |
|
} |
|
|
|
bool TransferListSortModel::lowerPositionThan(const QModelIndex &left, const QModelIndex &right) const |
|
{ |
|
const TorrentModel *model = dynamic_cast<TorrentModel*>(sourceModel()); |
|
|
|
// Sort according to TR_PRIORITY |
|
const int queueL = model->data(model->index(left.row(), TorrentModelItem::TR_PRIORITY)).toInt(); |
|
const int queueR = model->data(model->index(right.row(), TorrentModelItem::TR_PRIORITY)).toInt(); |
|
if ((queueL > 0) || (queueR > 0)) { |
|
if ((queueL > 0) && (queueR > 0)) |
|
return queueL < queueR; |
|
else |
|
return queueL != 0; |
|
} |
|
|
|
// Sort according to TR_SEED_DATE |
|
const QDateTime dateL = model->data(model->index(left.row(), TorrentModelItem::TR_SEED_DATE)).toDateTime(); |
|
const QDateTime dateR = model->data(model->index(right.row(), TorrentModelItem::TR_SEED_DATE)).toDateTime(); |
|
if (dateL.isValid() && dateR.isValid()) { |
|
if (dateL != dateR) |
|
return dateL < dateR; |
|
} |
|
else if (dateL.isValid()) |
|
return false; |
|
else if (dateR.isValid()) |
|
return true; |
|
|
|
// Finally, sort by hash |
|
const QString hashL(model->torrentHash(left.row())); |
|
const QString hashR(model->torrentHash(right.row())); |
|
return hashL < hashR; |
|
} |
|
|
|
bool TransferListSortModel::filterAcceptsRow(int sourceRow, const QModelIndex &sourceParent) const |
|
{ |
|
return matchFilter(sourceRow, sourceParent) |
|
&& QSortFilterProxyModel::filterAcceptsRow(sourceRow, sourceParent); |
|
} |
|
|
|
bool TransferListSortModel::matchFilter(int sourceRow, const QModelIndex &sourceParent) const |
|
{ |
|
TorrentModel *model = qobject_cast<TorrentModel *>(sourceModel()); |
|
if (!model) return false; |
|
|
|
BitTorrent::TorrentHandle *const torrent = model->torrentHandle(model->index(sourceRow, 0, sourceParent)); |
|
if (!torrent) return false; |
|
|
|
return m_filter.match(torrent); |
|
}
|
|
|