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.
305 lines
7.6 KiB
305 lines
7.6 KiB
/*
|
|
This file is part of Akregator.
|
|
|
|
Copyright (C) 2005 Frank Osterfeld <frank.osterfeld at kdemail.net>
|
|
|
|
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.
|
|
|
|
As a special exception, permission is given to link this program
|
|
with any edition of TQt, and distribute the resulting executable,
|
|
without including the source code for TQt in the source distribution.
|
|
*/
|
|
|
|
#include "article.h"
|
|
#include "articlefilter.h"
|
|
#include "fetchqueue.h"
|
|
#include "folder.h"
|
|
#include "tag.h"
|
|
#include "tagnode.h"
|
|
#include "treenode.h"
|
|
#include "treenodevisitor.h"
|
|
|
|
#include <tqdom.h>
|
|
#include <tqstring.h>
|
|
#include <tqvaluelist.h>
|
|
|
|
namespace Akregator {
|
|
|
|
class TagNode::TagNodePrivate
|
|
{
|
|
public:
|
|
Filters::TagMatcher filter;
|
|
TreeNode* observed;
|
|
int unread;
|
|
TQString icon;
|
|
Tag tag;
|
|
TQValueList<Article> articles;
|
|
TQValueList<Article> addedArticlesNotify;
|
|
TQValueList<Article> removedArticlesNotify;
|
|
TQValueList<Article> updatedArticlesNotify;
|
|
};
|
|
|
|
TagNode::TagNode(const Tag& tag, TreeNode* observed) : d(new TagNodePrivate)
|
|
{
|
|
d->tag = tag;
|
|
d->icon = tag.icon();
|
|
d->filter = Filters::TagMatcher(tag.id());
|
|
setTitle(tag.name());
|
|
d->observed = observed;
|
|
d->unread = 0;
|
|
|
|
connect(observed, TQT_SIGNAL(signalDestroyed(TreeNode*)), this, TQT_SLOT(slotObservedDestroyed(TreeNode*)));
|
|
connect(observed, TQT_SIGNAL(signalArticlesAdded(TreeNode*, const TQValueList<Article>&)), this, TQT_SLOT(slotArticlesAdded(TreeNode*, const TQValueList<Article>&)) );
|
|
connect(observed, TQT_SIGNAL(signalArticlesUpdated(TreeNode*, const TQValueList<Article>&)), this, TQT_SLOT(slotArticlesUpdated(TreeNode*, const TQValueList<Article>&)) );
|
|
connect(observed, TQT_SIGNAL(signalArticlesRemoved(TreeNode*, const TQValueList<Article>&)), this, TQT_SLOT(slotArticlesRemoved(TreeNode*, const TQValueList<Article>&)) );
|
|
|
|
d->articles = observed->articles(tag.id());
|
|
calcUnread();
|
|
}
|
|
|
|
TQString TagNode::icon() const
|
|
{
|
|
return d->icon;
|
|
}
|
|
|
|
Tag TagNode::tag() const
|
|
{
|
|
return d->tag;
|
|
}
|
|
|
|
TagNode::~TagNode()
|
|
{
|
|
emitSignalDestroyed();
|
|
delete d;
|
|
d = 0;
|
|
}
|
|
|
|
bool TagNode::accept(TreeNodeVisitor* visitor)
|
|
{
|
|
if (visitor->visitTagNode(this))
|
|
return true;
|
|
else
|
|
return visitor->visitTreeNode(this);
|
|
}
|
|
|
|
void TagNode::calcUnread()
|
|
{
|
|
int unread = 0;
|
|
TQValueList<Article>::Iterator en = d->articles.end();
|
|
for (TQValueList<Article>::Iterator it = d->articles.begin(); it != en; ++it)
|
|
if ((*it).status() != Article::Read)
|
|
++unread;
|
|
if (d->unread != unread)
|
|
{
|
|
d->unread = unread;
|
|
nodeModified();
|
|
}
|
|
}
|
|
|
|
int TagNode::unread() const
|
|
{
|
|
return d->unread;
|
|
}
|
|
|
|
|
|
int TagNode::totalCount() const
|
|
{
|
|
return d->articles.count();
|
|
}
|
|
|
|
|
|
TQValueList<Article> TagNode::articles(const TQString& tag)
|
|
{
|
|
return d->articles;
|
|
}
|
|
|
|
TQStringList TagNode::tags() const
|
|
{
|
|
// TODO
|
|
return TQStringList();
|
|
}
|
|
|
|
TQDomElement TagNode::toOPML( TQDomElement parent, TQDomDocument document ) const
|
|
{
|
|
return TQDomElement();
|
|
}
|
|
|
|
TreeNode* TagNode::next()
|
|
{
|
|
if ( nextSibling() )
|
|
return nextSibling();
|
|
|
|
Folder* p = parent();
|
|
while (p)
|
|
{
|
|
if ( p->nextSibling() )
|
|
return p->nextSibling();
|
|
else
|
|
p = p->parent();
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
void TagNode::slotDeleteExpiredArticles()
|
|
{
|
|
// not our business
|
|
}
|
|
|
|
void TagNode::slotMarkAllArticlesAsRead()
|
|
{
|
|
setNotificationMode(false);
|
|
TQValueList<Article>::Iterator en = d->articles.end();
|
|
for (TQValueList<Article>::Iterator it = d->articles.begin(); it != en; ++it)
|
|
(*it).setqStatus(Article::Read);
|
|
setNotificationMode(true);
|
|
}
|
|
|
|
void TagNode::slotAddToFetchQueue(FetchQueue* /*queue*/, bool /*intervalFetchOnly*/)
|
|
{
|
|
// not our business
|
|
}
|
|
|
|
void TagNode::doArticleNotification()
|
|
{
|
|
if (!d->addedArticlesNotify.isEmpty())
|
|
{
|
|
emit signalArticlesAdded(this, d->addedArticlesNotify);
|
|
d->addedArticlesNotify.clear();
|
|
}
|
|
if (!d->updatedArticlesNotify.isEmpty())
|
|
{
|
|
emit signalArticlesUpdated(this, d->updatedArticlesNotify);
|
|
d->updatedArticlesNotify.clear();
|
|
}
|
|
if (!d->removedArticlesNotify.isEmpty())
|
|
{
|
|
emit signalArticlesRemoved(this, d->removedArticlesNotify);
|
|
d->removedArticlesNotify.clear();
|
|
}
|
|
TreeNode::doArticleNotification();
|
|
}
|
|
|
|
void TagNode::slotArticlesAdded(TreeNode* node, const TQValueList<Article>& list)
|
|
{
|
|
bool added = false;
|
|
for (TQValueList<Article>::ConstIterator it = list.begin(); it != list.end(); ++it)
|
|
{
|
|
if (!d->articles.contains(*it) && d->filter.matches(*it))
|
|
{
|
|
d->articles.append(*it);
|
|
d->addedArticlesNotify.append(*it);
|
|
added = true;
|
|
}
|
|
}
|
|
|
|
if (added)
|
|
{
|
|
calcUnread();
|
|
articlesModified();
|
|
}
|
|
}
|
|
|
|
void TagNode::slotArticlesUpdated(TreeNode* node, const TQValueList<Article>& list)
|
|
{
|
|
bool updated = false;
|
|
for (TQValueList<Article>::ConstIterator it = list.begin(); it != list.end(); ++it)
|
|
{
|
|
if (d->articles.contains(*it))
|
|
{
|
|
if (!d->filter.matches(*it)) // articles is in list, but doesn't match our criteria anymore -> remove it
|
|
{
|
|
d->articles.remove(*it);
|
|
d->removedArticlesNotify.append(*it);
|
|
updated = true;
|
|
}
|
|
else // otherwise the article remains in the list and we just forward the update
|
|
{
|
|
d->updatedArticlesNotify.append(*it);
|
|
updated = true;
|
|
}
|
|
}
|
|
else // article not in list
|
|
{
|
|
if (d->filter.matches(*it)) // articles is not in list, but matches our criteria -> add it
|
|
{
|
|
d->articles.append(*it);
|
|
d->addedArticlesNotify.append(*it);
|
|
updated = true;
|
|
}
|
|
}
|
|
}
|
|
if (updated)
|
|
{
|
|
calcUnread();
|
|
articlesModified();
|
|
}
|
|
}
|
|
|
|
void TagNode::slotArticlesRemoved(TreeNode* node, const TQValueList<Article>& list)
|
|
{
|
|
bool removed = false;
|
|
for (TQValueList<Article>::ConstIterator it = list.begin(); it != list.end(); ++it)
|
|
{
|
|
if (d->articles.contains(*it))
|
|
{
|
|
d->articles.remove(*it);
|
|
d->removedArticlesNotify.append(*it);
|
|
removed = true;
|
|
}
|
|
}
|
|
if (removed)
|
|
{
|
|
calcUnread();
|
|
articlesModified();
|
|
}
|
|
}
|
|
|
|
void TagNode::setTitle(const TQString& title)
|
|
{
|
|
if (d->tag.name() != title)
|
|
d->tag.setName(title);
|
|
TreeNode::setTitle(title);
|
|
}
|
|
|
|
void TagNode::slotObservedDestroyed(TreeNode* /*observed*/)
|
|
{
|
|
d->removedArticlesNotify = d->articles;
|
|
d->articles.clear();
|
|
articlesModified();
|
|
}
|
|
|
|
void TagNode::tagChanged()
|
|
{
|
|
bool changed = false;
|
|
if (title() != d->tag.name())
|
|
{
|
|
setTitle(d->tag.name());
|
|
changed = true;
|
|
}
|
|
|
|
if (d->icon != d->tag.icon())
|
|
{
|
|
d->icon = d->tag.icon();
|
|
changed = true;
|
|
}
|
|
|
|
if (changed)
|
|
nodeModified();
|
|
}
|
|
|
|
} // namespace Akregator
|
|
|
|
#include "tagnode.moc"
|