mirror of
https://bitbucket.org/smil3y/kdelibs.git
synced 2025-02-23 18:32:49 +00:00

unused in most cases, shared data and dangerous to pass around Signed-off-by: Ivailo Monev <xakepa10@gmail.com>
250 lines
5.2 KiB
C++
250 lines
5.2 KiB
C++
/*
|
|
* Copyright 2006-2007 Aaron Seigo <aseigo@kde.org>
|
|
*
|
|
* This program 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, 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 Library 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.
|
|
*/
|
|
|
|
#include "querymatch.h"
|
|
|
|
#include <QAction>
|
|
#include <QIcon>
|
|
#include <QSharedData>
|
|
#include <QStringList>
|
|
#include <QVariant>
|
|
#include <QSharedPointer>
|
|
|
|
#include <mutex>
|
|
|
|
#include "kdebug.h"
|
|
#include "abstractrunner.h"
|
|
|
|
namespace Plasma
|
|
{
|
|
|
|
class QueryMatchPrivate : public QSharedData
|
|
{
|
|
public:
|
|
QueryMatchPrivate(AbstractRunner *r)
|
|
: QSharedData(),
|
|
runner(r),
|
|
relevance(0.7),
|
|
selAction(nullptr),
|
|
enabled(true),
|
|
idSetByData(false)
|
|
{
|
|
}
|
|
|
|
QueryMatchPrivate(const QueryMatchPrivate &other)
|
|
: QSharedData(other)
|
|
{
|
|
std::lock_guard<std::recursive_mutex> lock(other.mutex);
|
|
runner = other.runner;
|
|
relevance = other.relevance;
|
|
selAction = other.selAction;
|
|
enabled = other.enabled;
|
|
idSetByData = other.idSetByData;
|
|
id = other.id;
|
|
text = other.text;
|
|
subtext = other.subtext;
|
|
icon = other.icon;
|
|
data = other.data;
|
|
}
|
|
|
|
mutable std::recursive_mutex mutex;
|
|
QWeakPointer<AbstractRunner> runner;
|
|
QString id;
|
|
QString text;
|
|
QString subtext;
|
|
QIcon icon;
|
|
QVariant data;
|
|
qreal relevance;
|
|
QAction *selAction;
|
|
bool enabled;
|
|
bool idSetByData;
|
|
};
|
|
|
|
QueryMatch::QueryMatch(AbstractRunner *runner)
|
|
: d(new QueryMatchPrivate(runner))
|
|
{
|
|
// kDebug() << "new match created";
|
|
}
|
|
|
|
QueryMatch::QueryMatch(const QueryMatch &other)
|
|
: d(other.d)
|
|
{
|
|
}
|
|
|
|
QueryMatch::~QueryMatch()
|
|
{
|
|
}
|
|
|
|
bool QueryMatch::isValid() const
|
|
{
|
|
return d->runner != nullptr;
|
|
}
|
|
|
|
QString QueryMatch::id() const
|
|
{
|
|
if (d->id.isEmpty() && d->runner) {
|
|
return d->runner.data()->id();
|
|
}
|
|
return d->id;
|
|
}
|
|
|
|
void QueryMatch::setRelevance(qreal relevance)
|
|
{
|
|
d->relevance = qMax(qreal(0.0), relevance);
|
|
}
|
|
|
|
qreal QueryMatch::relevance() const
|
|
{
|
|
return d->relevance;
|
|
}
|
|
|
|
AbstractRunner* QueryMatch::runner() const
|
|
{
|
|
return d->runner.data();
|
|
}
|
|
|
|
void QueryMatch::setText(const QString &text)
|
|
{
|
|
std::lock_guard<std::recursive_mutex> locker(d->mutex);
|
|
d->text = text;
|
|
}
|
|
|
|
void QueryMatch::setSubtext(const QString &subtext)
|
|
{
|
|
std::lock_guard<std::recursive_mutex> locker(d->mutex);
|
|
d->subtext = subtext;
|
|
}
|
|
|
|
void QueryMatch::setData(const QVariant & data)
|
|
{
|
|
std::lock_guard<std::recursive_mutex> locker(d->mutex);
|
|
d->data = data;
|
|
|
|
if (d->id.isEmpty() || d->idSetByData) {
|
|
const QString id = data.toString();
|
|
if (!id.isEmpty()) {
|
|
setId(data.toString());
|
|
d->idSetByData = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
void QueryMatch::setId(const QString &id)
|
|
{
|
|
std::lock_guard<std::recursive_mutex> locker(d->mutex);
|
|
if (d->runner) {
|
|
d->id = d->runner.data()->id();
|
|
}
|
|
|
|
if (!id.isEmpty()) {
|
|
d->id.append('_').append(id);
|
|
}
|
|
|
|
d->idSetByData = false;
|
|
}
|
|
|
|
void QueryMatch::setIcon(const QIcon &icon)
|
|
{
|
|
std::lock_guard<std::recursive_mutex> locker(d->mutex);
|
|
d->icon = icon;
|
|
}
|
|
|
|
QVariant QueryMatch::data() const
|
|
{
|
|
return d->data;
|
|
}
|
|
|
|
QString QueryMatch::text() const
|
|
{
|
|
return d->text;
|
|
}
|
|
|
|
QString QueryMatch::subtext() const
|
|
{
|
|
return d->subtext;
|
|
}
|
|
|
|
QIcon QueryMatch::icon() const
|
|
{
|
|
return d->icon;
|
|
}
|
|
|
|
void QueryMatch::setEnabled(bool enabled)
|
|
{
|
|
d->enabled = enabled;
|
|
}
|
|
|
|
bool QueryMatch::isEnabled() const
|
|
{
|
|
return d->enabled && d->runner;
|
|
}
|
|
|
|
QAction* QueryMatch::selectedAction() const
|
|
{
|
|
return d->selAction;
|
|
}
|
|
|
|
void QueryMatch::setSelectedAction(QAction *action)
|
|
{
|
|
d->selAction = action;
|
|
}
|
|
|
|
bool QueryMatch::operator<(const QueryMatch &other) const
|
|
{
|
|
if (isEnabled() != other.isEnabled()) {
|
|
return other.isEnabled();
|
|
}
|
|
|
|
if (d->relevance != other.d->relevance) {
|
|
return d->relevance < other.d->relevance;
|
|
}
|
|
|
|
// when resorting to sort by alpha, we want the
|
|
// reverse sort order!
|
|
return d->text > other.d->text;
|
|
}
|
|
|
|
QueryMatch &QueryMatch::operator=(const QueryMatch &other)
|
|
{
|
|
if (d != other.d) {
|
|
d = other.d;
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
bool QueryMatch::operator==(const QueryMatch &other) const
|
|
{
|
|
return (d == other.d);
|
|
}
|
|
|
|
bool QueryMatch::operator!=(const QueryMatch &other) const
|
|
{
|
|
return (d != other.d);
|
|
}
|
|
|
|
void QueryMatch::run() const
|
|
{
|
|
//kDebug() << "we run the term" << context->query() << "whose type is" << context->mimetype();
|
|
if (d->runner) {
|
|
d->runner.data()->run(*this);
|
|
}
|
|
}
|
|
|
|
} // Plasma namespace
|
|
|