mirror of
https://github.com/qbittorrent/qBittorrent
synced 2025-07-16 02:03:07 -07:00
253 lines
6.8 KiB
C++
253 lines
6.8 KiB
C++
/*
|
|
* Bittorrent Client using Qt and libtorrent.
|
|
* Copyright (C) 2010 Christophe Dumez <chris@qbittorrent.org>
|
|
* Copyright (C) 2010 Arnaud Demaiziere <arnaud@qbittorrent.org>
|
|
*
|
|
* 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, arnaud@qbittorrent.org
|
|
*/
|
|
|
|
#include <QDebug>
|
|
|
|
#include "base/iconprovider.h"
|
|
#include "base/bittorrent/session.h"
|
|
#include "rssmanager.h"
|
|
#include "rssfeed.h"
|
|
#include "rssarticle.h"
|
|
#include "rssfolder.h"
|
|
|
|
using namespace Rss;
|
|
|
|
Folder::Folder(const QString &name)
|
|
: m_name(name)
|
|
{
|
|
}
|
|
|
|
uint Folder::unreadCount() const
|
|
{
|
|
uint nbUnread = 0;
|
|
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
for ( ; it != itend; ++it)
|
|
nbUnread += it.value()->unreadCount();
|
|
|
|
return nbUnread;
|
|
}
|
|
|
|
void Folder::removeChild(const QString &childId)
|
|
{
|
|
if (m_children.contains(childId)) {
|
|
FilePtr child = m_children.take(childId);
|
|
child->removeAllSettings();
|
|
}
|
|
}
|
|
|
|
// Refresh All Children
|
|
bool Folder::refresh()
|
|
{
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
bool refreshed = false;
|
|
for ( ; it != itend; ++it) {
|
|
if (it.value()->refresh())
|
|
refreshed = true;
|
|
}
|
|
return refreshed;
|
|
}
|
|
|
|
ArticleList Folder::articleListByDateDesc() const
|
|
{
|
|
ArticleList news;
|
|
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
for ( ; it != itend; ++it) {
|
|
int n = news.size();
|
|
news << it.value()->articleListByDateDesc();
|
|
std::inplace_merge(news.begin(), news.begin() + n, news.end(), articleDateRecentThan);
|
|
}
|
|
return news;
|
|
}
|
|
|
|
ArticleList Folder::unreadArticleListByDateDesc() const
|
|
{
|
|
ArticleList unreadNews;
|
|
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
for ( ; it != itend; ++it) {
|
|
int n = unreadNews.size();
|
|
unreadNews << it.value()->unreadArticleListByDateDesc();
|
|
std::inplace_merge(unreadNews.begin(), unreadNews.begin() + n, unreadNews.end(), articleDateRecentThan);
|
|
}
|
|
return unreadNews;
|
|
}
|
|
|
|
FileList Folder::getContent() const
|
|
{
|
|
return m_children.values();
|
|
}
|
|
|
|
uint Folder::getNbFeeds() const
|
|
{
|
|
uint nbFeeds = 0;
|
|
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
for ( ; it != itend; ++it) {
|
|
if (FolderPtr folder = qSharedPointerDynamicCast<Folder>(it.value()))
|
|
nbFeeds += folder->getNbFeeds();
|
|
else
|
|
++nbFeeds; // Feed
|
|
}
|
|
return nbFeeds;
|
|
}
|
|
|
|
QString Folder::displayName() const
|
|
{
|
|
return m_name;
|
|
}
|
|
|
|
void Folder::rename(const QString &newName)
|
|
{
|
|
if (m_name == newName) return;
|
|
|
|
Q_ASSERT(!m_parent->hasChild(newName));
|
|
if (!m_parent->hasChild(newName)) {
|
|
// Update parent
|
|
FilePtr folder = m_parent->m_children.take(m_name);
|
|
m_parent->m_children[newName] = folder;
|
|
// Actually rename
|
|
m_name = newName;
|
|
}
|
|
}
|
|
|
|
void Folder::markAsRead()
|
|
{
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
for ( ; it != itend; ++it) {
|
|
it.value()->markAsRead();
|
|
}
|
|
}
|
|
|
|
FeedList Folder::getAllFeeds() const
|
|
{
|
|
FeedList streams;
|
|
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
for ( ; it != itend; ++it) {
|
|
if (FeedPtr feed = qSharedPointerDynamicCast<Feed>(it.value()))
|
|
streams << feed;
|
|
else if (FolderPtr folder = qSharedPointerDynamicCast<Folder>(it.value()))
|
|
streams << folder->getAllFeeds();
|
|
}
|
|
return streams;
|
|
}
|
|
|
|
QHash<QString, FeedPtr> Folder::getAllFeedsAsHash() const
|
|
{
|
|
QHash<QString, FeedPtr> ret;
|
|
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
for ( ; it != itend; ++it) {
|
|
if (FeedPtr feed = qSharedPointerDynamicCast<Feed>(it.value())) {
|
|
qDebug() << Q_FUNC_INFO << feed->url();
|
|
ret[feed->url()] = feed;
|
|
}
|
|
else if (FolderPtr folder = qSharedPointerDynamicCast<Folder>(it.value())) {
|
|
ret.unite(folder->getAllFeedsAsHash());
|
|
}
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
bool Folder::addFile(const FilePtr &item)
|
|
{
|
|
Q_ASSERT(!m_children.contains(item->id()));
|
|
if (!m_children.contains(item->id())) {
|
|
m_children[item->id()] = item;
|
|
// Update parent
|
|
item->m_parent = this;
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
void Folder::removeAllItems()
|
|
{
|
|
m_children.clear();
|
|
}
|
|
|
|
FilePtr Folder::child(const QString &childId)
|
|
{
|
|
return m_children.value(childId);
|
|
}
|
|
|
|
void Folder::removeAllSettings()
|
|
{
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
for ( ; it != itend; ++it)
|
|
it.value()->removeAllSettings();
|
|
}
|
|
|
|
void Folder::saveItemsToDisk()
|
|
{
|
|
foreach (const FilePtr &child, m_children.values())
|
|
child->saveItemsToDisk();
|
|
}
|
|
|
|
QString Folder::id() const
|
|
{
|
|
return m_name;
|
|
}
|
|
|
|
QString Folder::iconPath() const
|
|
{
|
|
return IconProvider::instance()->getIconPath("inode-directory");
|
|
}
|
|
|
|
bool Folder::hasChild(const QString &childId)
|
|
{
|
|
return m_children.contains(childId);
|
|
}
|
|
|
|
FilePtr Folder::takeChild(const QString &childId)
|
|
{
|
|
return m_children.take(childId);
|
|
}
|
|
|
|
void Folder::recheckRssItemsForDownload()
|
|
{
|
|
FileHash::ConstIterator it = m_children.begin();
|
|
FileHash::ConstIterator itend = m_children.end();
|
|
for ( ; it != itend; ++it)
|
|
it.value()->recheckRssItemsForDownload();
|
|
}
|