kde-playground/kdepimlibs/akonadi/persistentsearchattribute.cpp
2015-04-14 21:49:29 +00:00

176 lines
4.6 KiB
C++

/*
Copyright (c) 2010 Volker Krause <vkrause@kde.org>
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU Library General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at your
option) any later version.
This library 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 Library General Public
License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#include "persistentsearchattribute.h"
#include "collection.h"
#include <akonadi/private/imapparser_p.h>
#include <QtCore/QString>
#include <QtCore/QStringList>
using namespace Akonadi;
class PersistentSearchAttribute::Private
{
public:
Private()
: remote(true)
, recursive(false)
{
}
QString queryString;
QList<qint64> queryCollections;
bool remote;
bool recursive;
};
PersistentSearchAttribute::PersistentSearchAttribute()
: d(new Private)
{
}
PersistentSearchAttribute::~PersistentSearchAttribute()
{
delete d;
}
QString PersistentSearchAttribute::queryLanguage() const
{
return QLatin1String("SPARQL");
}
void PersistentSearchAttribute::setQueryLanguage(const QString &language)
{
Q_UNUSED(language);
}
QString PersistentSearchAttribute::queryString() const
{
return d->queryString;
}
void PersistentSearchAttribute::setQueryString(const QString &query)
{
d->queryString = query;
}
QList<qint64> PersistentSearchAttribute::queryCollections() const
{
return d->queryCollections;
}
void PersistentSearchAttribute::setQueryCollections(const QList<Collection> &collections)
{
d->queryCollections.clear();
Q_FOREACH (const Collection &collection, collections) {
d->queryCollections << collection.id();
}
}
void PersistentSearchAttribute::setQueryCollections(const QList<qint64> &collectionsIds)
{
d->queryCollections = collectionsIds;
}
bool PersistentSearchAttribute::isRecursive() const
{
return d->recursive;
}
void PersistentSearchAttribute::setRecursive(bool recursive)
{
d->recursive = recursive;
}
bool PersistentSearchAttribute::isRemoteSearchEnabled() const
{
return d->remote;
}
void PersistentSearchAttribute::setRemoteSearchEnabled(bool enabled)
{
d->remote = enabled;
}
QByteArray PersistentSearchAttribute::type() const
{
return "PERSISTENTSEARCH"; // ### should eventually be AKONADI_PARAM_PERSISTENTSEARCH
}
Attribute *PersistentSearchAttribute::clone() const
{
PersistentSearchAttribute *attr = new PersistentSearchAttribute;
attr->setQueryString(queryString());
attr->setQueryCollections(queryCollections());
attr->setRecursive(isRecursive());
attr->setRemoteSearchEnabled(isRemoteSearchEnabled());
return attr;
}
QByteArray PersistentSearchAttribute::serialized() const
{
QStringList cols;
Q_FOREACH (qint64 colId, d->queryCollections) {
cols << QString::number(colId);
}
QList<QByteArray> l;
// ### eventually replace with the AKONADI_PARAM_PERSISTENTSEARCH_XXX constants
l.append("QUERYSTRING");
l.append(ImapParser::quote(d->queryString.toUtf8()));
l.append("QUERYCOLLECTIONS");
l.append("(" + cols.join(QLatin1String(" ")).toLatin1() + ")");
if (d->remote) {
l.append("REMOTE");
}
if (d->recursive) {
l.append("RECURSIVE");
}
return "(" + ImapParser::join(l, " ") + ')'; //krazy:exclude=doublequote_chars
}
void PersistentSearchAttribute::deserialize(const QByteArray &data)
{
QList<QByteArray> l;
ImapParser::parseParenthesizedList(data, l);
for (int i = 0; i < l.size() - 1; ++i) {
const QByteArray key = l.at(i);
if (key == "QUERYLANGUAGE") {
// Skip the value
++i;
} else if (key == "QUERYSTRING") {
d->queryString = QString::fromUtf8(l.at(i + 1));
++i;
} else if (key == "QUERYCOLLECTIONS") {
QList<QByteArray> ids;
ImapParser::parseParenthesizedList(l.at(i + 1), ids);
d->queryCollections.clear();
Q_FOREACH (const QByteArray &id, ids) {
d->queryCollections << id.toLongLong();
}
++i;
} else if (key == "REMOTE") {
d->remote = true;
} else if (key == "RECURSIVE") {
d->recursive = true;
}
}
}