transmission/qt/TrackerModel.cc

153 lines
3.5 KiB
C++
Raw Normal View History

/*
* This file Copyright (C) 2009-2015 Mnemosyne LLC
*
* It may be used under the GNU GPL versions 2 or 3
* or any future license endorsed by Mnemosyne LLC.
*
* $Id$
*/
#include <algorithm> // std::sort()
#include <QUrl>
#include "Application.h" // Application
2015-06-12 22:12:12 +00:00
#include "TorrentModel.h"
#include "TrackerModel.h"
int
TrackerModel::rowCount (const QModelIndex& parent) const
{
2013-09-14 22:45:04 +00:00
Q_UNUSED (parent);
2013-09-14 22:45:04 +00:00
return parent.isValid() ? 0 : myRows.size();
}
QVariant
TrackerModel::data (const QModelIndex& index, int role) const
{
2013-09-14 22:45:04 +00:00
QVariant var;
2013-09-14 22:45:04 +00:00
const int row = index.row ();
if ((0<=row) && (row<myRows.size()))
{
2013-09-14 22:45:04 +00:00
const TrackerInfo& trackerInfo = myRows.at (row);
2013-09-14 22:45:04 +00:00
switch (role)
{
2013-09-14 22:45:04 +00:00
case Qt::DisplayRole:
var = trackerInfo.st.announce;
2013-09-14 22:45:04 +00:00
break;
2013-09-14 22:45:04 +00:00
case Qt::DecorationRole:
var = trackerInfo.st.getFavicon ();
break;
2013-09-14 22:45:04 +00:00
case TrackerRole:
var = qVariantFromValue (trackerInfo);
break;
2013-09-14 22:45:04 +00:00
default:
break;
}
}
2013-09-14 22:45:04 +00:00
return var;
}
/***
****
***/
2013-09-14 22:45:04 +00:00
struct CompareTrackers
{
bool operator() (const TrackerInfo& a, const TrackerInfo& b) const
{
if (a.torrentId != b.torrentId )
return a.torrentId < b.torrentId;
if (a.st.tier != b.st.tier)
return a.st.tier < b.st.tier;
if (a.st.isBackup != b.st.isBackup)
return !a.st.isBackup;
return a.st.announce < b.st.announce;
}
};
void
TrackerModel::refresh (const TorrentModel& torrentModel, const QSet<int>& ids)
{
2013-09-14 22:45:04 +00:00
// build a list of the TrackerInfos
QVector<TrackerInfo> trackers;
for (const int id: ids)
2013-09-14 22:45:04 +00:00
{
const Torrent * tor = torrentModel.getTorrentFromId (id);
if (tor != 0)
{
const TrackerStatsList trackerList = tor->trackerStats ();
for (const TrackerStat& st: trackerList)
2013-09-14 22:45:04 +00:00
{
TrackerInfo trackerInfo;
trackerInfo.st = st;
trackerInfo.torrentId = id;
trackers.append (trackerInfo);
}
}
}
2013-09-14 22:45:04 +00:00
// sort 'em
CompareTrackers comp;
std::sort (trackers.begin(), trackers.end(), comp);
2013-09-14 22:45:04 +00:00
// merge 'em with the existing list
int oldIndex = 0;
int newIndex = 0;
while (oldIndex < myRows.size () || newIndex < trackers.size ())
{
const bool isEndOfOld = oldIndex == myRows.size ();
const bool isEndOfNew = newIndex == trackers.size ();
if (isEndOfOld || (!isEndOfNew && comp (trackers.at (newIndex), myRows.at (oldIndex))))
{
2013-09-14 22:45:04 +00:00
// add this new row
beginInsertRows (QModelIndex (), oldIndex, oldIndex);
myRows.insert (oldIndex, trackers.at (newIndex));
2013-09-14 22:45:04 +00:00
endInsertRows ();
++oldIndex;
++newIndex;
}
else if (isEndOfNew || (!isEndOfOld && comp (myRows.at (oldIndex), trackers.at (newIndex))))
{
2013-09-14 22:45:04 +00:00
// remove this old row
beginRemoveRows (QModelIndex (), oldIndex, oldIndex);
myRows.remove (oldIndex);
2013-09-14 22:45:04 +00:00
endRemoveRows ();
}
2013-09-14 22:45:04 +00:00
else // update existing row
{
myRows[oldIndex].st = trackers.at (newIndex).st;
emit dataChanged (index (oldIndex, 0), index (oldIndex, 0));
++oldIndex;
++newIndex;
}
}
}
int
TrackerModel::find (int torrentId, const QString& url) const
{
2013-09-14 22:45:04 +00:00
for (int i=0, n=myRows.size(); i<n; ++i)
{
const TrackerInfo& inf = myRows.at(i);
if ((inf.torrentId == torrentId) && (url == inf.st.announce))
return i;
}
2013-09-14 22:45:04 +00:00
return -1;
}