storagedummyimpl.cpp

/*
    This file is part of Akregator.
 
    2005 Frank Osterfeld <frank.osterfeld@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 "storagedummyimpl.h"
#include "feedstoragedummyimpl.h"
 
#include <tqmap.h>
#include <tqstring.h>
#include <tqstringlist.h>
 
namespace Akregator {
namespace Backend {
 
class StorageDummyImpl::StorageDummyImplPrivate
{
    public:
    class Entry
    {
        public:
        int unread;
        int totalCount;
        int lastFetch;
    FeedStorage* feedStorage;
    };
 
    void addEntry(const TQString& url, int unread, int totalCount, int lastFetch)
    {
        Entry entry;
        entry.unread = unread;
        entry.totalCount = totalCount;
        entry.lastFetch = lastFetch;
        entry.feedStorage = 0;
        feeds[url] = entry;
    
    }
    TQString tagSet;
    TQString feedList;
    TQMap<TQString, Entry> feeds;
};
 
StorageDummyImpl::StorageDummyImpl() : d(new StorageDummyImplPrivate)
{
}
 
StorageDummyImpl::~StorageDummyImpl()
{
    delete d; d = 0;
}
void StorageDummyImpl::initialize(const TQStringList&) {}
 
bool StorageDummyImpl::open(bool /*autoCommit*/)
{
    return true;
}
 
bool StorageDummyImpl::autoCommit() const
{
    return false;
}
 
bool StorageDummyImpl::close()
{
    for (TQMap<TQString, StorageDummyImplPrivate::Entry>::ConstIterator it = d->feeds.begin(); it != d->feeds.end(); ++it)
    {
        (*it).feedStorage->close();
        delete (*it).feedStorage;
    }
    return true;
}
 
bool StorageDummyImpl::commit()
{
    return true;
}
 
bool StorageDummyImpl::rollback()
{
    return true;
}
 
int StorageDummyImpl::unreadFor(const TQString &url)
{
    return d->feeds.contains(url) ? d->feeds[url].unread : 0;
}
 
void StorageDummyImpl::setUnreadFor(const TQString &url, int unread)
{
    if (!d->feeds.contains(url))
       d->addEntry(url, unread, unread, 0);
    else
       d->feeds[url].unread = unread;
}
 
int StorageDummyImpl::totalCountFor(const TQString &url)
{
    return d->feeds.contains(url) ? d->feeds[url].totalCount : 0;
}
 
void StorageDummyImpl::setTotalCountFor(const TQString &url, int total)
{
    if (!d->feeds.contains(url))
       d->addEntry(url, 0, total, 0);
    else
       d->feeds[url].totalCount = total;
}
 
int StorageDummyImpl::lastFetchFor(const TQString& url)
{
    return d->feeds.contains(url) ? d->feeds[url].lastFetch : 0;
}
 
void StorageDummyImpl::setLastFetchFor(const TQString& url, int lastFetch)
{
    if (!d->feeds.contains(url))
       d->addEntry(url, 0, 0, lastFetch);
    else 
       d->feeds[url].lastFetch = lastFetch;
}
        
void StorageDummyImpl::slotCommit()
{
}
 
FeedStorage* StorageDummyImpl::archiveFor(const TQString& url)
{
    if (!d->feeds.contains(url))
        d->feeds[url].feedStorage = new FeedStorageDummyImpl(url, this);
 
    return d->feeds[url].feedStorage;
}
 
TQStringList StorageDummyImpl::feeds() const
{
    return d->feeds.keys();
}
    
void StorageDummyImpl::add(Storage* source)
{
    TQStringList feeds = source->feeds();
    for (TQStringList::ConstIterator it = feeds.begin(); it != feeds.end(); ++it)
    {
        FeedStorage* fa = archiveFor(*it);
        fa->add(source->archiveFor(*it));
    }
}
 
void StorageDummyImpl::clear()
{
    for (TQMap<TQString, StorageDummyImplPrivate::Entry>::ConstIterator it = d->feeds.begin(); it != d->feeds.end(); ++it)
    {
        delete (*it).feedStorage;
    }
    d->feeds.clear();
 
}
 
void StorageDummyImpl::storeFeedList(const TQString& opmlStr)
{
    d->feedList = opmlStr;
}
 
TQString StorageDummyImpl::restoreFeedList() const
{
    return d->feedList;
}
 
void StorageDummyImpl::storeTagSet(const TQString& xmlStr)
{
    d->tagSet = xmlStr;
}
 
TQString StorageDummyImpl::restoreTagSet() const
{
    return d->tagSet;
}
 
} // namespace Backend
} // namespace Akregator
 
#include "storagedummyimpl.moc"