340 lines
9.2 KiB
C++
340 lines
9.2 KiB
C++
/*
|
|
* Copyright 2010 by Marco Martin <mart@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 "datamodel.h"
|
|
#include "datasource_p.h"
|
|
|
|
#include <KDebug>
|
|
|
|
namespace Plasma
|
|
{
|
|
|
|
SortFilterModel::SortFilterModel(QObject* parent)
|
|
: QSortFilterProxyModel(parent)
|
|
{
|
|
setObjectName("SortFilterModel");
|
|
setDynamicSortFilter(true);
|
|
connect(this, SIGNAL(rowsInserted(const QModelIndex &, int, int)),
|
|
this, SIGNAL(countChanged()));
|
|
connect(this, SIGNAL(rowsRemoved(const QModelIndex &, int, int)),
|
|
this, SIGNAL(countChanged()));
|
|
connect(this, SIGNAL(modelReset()),
|
|
this, SIGNAL(countChanged()));
|
|
}
|
|
|
|
SortFilterModel::~SortFilterModel()
|
|
{
|
|
}
|
|
|
|
void SortFilterModel::syncRoleNames()
|
|
{
|
|
m_roleIds.clear();
|
|
|
|
setRoleNames(sourceModel()->roleNames());
|
|
QHash<int, QByteArray>::const_iterator i;
|
|
for (i = roleNames().constBegin(); i != roleNames().constEnd(); ++i) {
|
|
m_roleIds[i.value()] = i.key();
|
|
}
|
|
setFilterRole(m_filterRole);
|
|
setSortRole(m_sortRole);
|
|
}
|
|
|
|
int SortFilterModel::roleNameToId(const QString &name)
|
|
{
|
|
if (!m_roleIds.contains(name)) {
|
|
return -1;
|
|
}
|
|
return m_roleIds.value(name);
|
|
}
|
|
|
|
void SortFilterModel::setModel(QObject *source)
|
|
{
|
|
QAbstractItemModel *model = qobject_cast<QAbstractItemModel *>(source);
|
|
if (!model) {
|
|
kWarning() << "Error: QAbstractItemModel type expected";
|
|
return;
|
|
}
|
|
|
|
connect(model, SIGNAL(modelReset()), this, SLOT(syncRoleNames()));
|
|
QSortFilterProxyModel::setSourceModel(model);
|
|
}
|
|
|
|
|
|
|
|
|
|
void SortFilterModel::setFilterRegExp(const QString &exp)
|
|
{
|
|
//FIXME: this delaying of the reset signal seems to make the views behave a bit better, i.e. less holes and avoids some crashes, in theory shouldn't be necessary
|
|
blockSignals(true);
|
|
QSortFilterProxyModel::setFilterRegExp(QRegExp(exp, Qt::CaseInsensitive));
|
|
blockSignals(false);
|
|
reset();
|
|
}
|
|
|
|
QString SortFilterModel::filterRegExp() const
|
|
{
|
|
return QSortFilterProxyModel::filterRegExp().pattern();
|
|
}
|
|
|
|
void SortFilterModel::setFilterRole(const QString &role)
|
|
{
|
|
QSortFilterProxyModel::setFilterRole(roleNameToId(role));
|
|
m_filterRole = role;
|
|
}
|
|
|
|
QString SortFilterModel::filterRole() const
|
|
{
|
|
return m_filterRole;
|
|
}
|
|
|
|
void SortFilterModel::setSortRole(const QString &role)
|
|
{
|
|
QSortFilterProxyModel::setSortRole(roleNameToId(role));
|
|
m_sortRole = role;
|
|
sort(0, sortOrder());
|
|
}
|
|
|
|
QString SortFilterModel::sortRole() const
|
|
{
|
|
return m_sortRole;
|
|
}
|
|
|
|
void SortFilterModel::setSortOrder(const Qt::SortOrder order)
|
|
{
|
|
sort(0, order);
|
|
}
|
|
|
|
|
|
|
|
|
|
DataModel::DataModel(QObject* parent)
|
|
: QAbstractItemModel(parent),
|
|
m_dataSource(0)
|
|
{
|
|
setObjectName("DataModel");
|
|
connect(this, SIGNAL(rowsInserted(const QModelIndex &, int, int)),
|
|
this, SIGNAL(countChanged()));
|
|
connect(this, SIGNAL(rowsRemoved(const QModelIndex &, int, int)),
|
|
this, SIGNAL(countChanged()));
|
|
connect(this, SIGNAL(modelReset()),
|
|
this, SIGNAL(countChanged()));
|
|
}
|
|
|
|
DataModel::~DataModel()
|
|
{
|
|
}
|
|
|
|
void DataModel::dataUpdated(const QString &sourceName, const Plasma::DataEngine::Data &data)
|
|
{
|
|
if (!m_keyRoleFilter.isEmpty()) {
|
|
//a key that matches the one we want exists and is a list of DataEngine::Data
|
|
if (data.contains(m_keyRoleFilter) && data.value(m_keyRoleFilter).canConvert<QVariantList>()) {
|
|
setItems(sourceName, data.value(m_keyRoleFilter).value<QVariantList>());
|
|
//try to match the key we want with a regular expression if set
|
|
} else {
|
|
QRegExp regExp(m_keyRoleFilter);
|
|
if (regExp.isValid()) {
|
|
QHash<QString, QVariant>::const_iterator i;
|
|
QVariantList list;
|
|
for (i = data.constBegin(); i != data.constEnd(); ++i) {
|
|
if (regExp.exactMatch(i.key())) {
|
|
list.append(i.value());
|
|
}
|
|
}
|
|
setItems(sourceName, list);
|
|
}
|
|
}
|
|
//an item is represented by a source: keys are roles m_roleLevel == FirstLevel
|
|
} else {
|
|
QVariantList list;
|
|
|
|
foreach (QVariant data, m_dataSource->data()) {
|
|
list.append(data.value<Plasma::DataEngine::Data>());
|
|
}
|
|
setItems(QString(), list);
|
|
}
|
|
}
|
|
|
|
void DataModel::setDataSource(QObject *object)
|
|
{
|
|
DataSource *source = qobject_cast<DataSource *>(object);
|
|
if (!source) {
|
|
kWarning() << "Error: DataSource type expected";
|
|
return;
|
|
}
|
|
if (m_dataSource == source) {
|
|
return;
|
|
}
|
|
|
|
disconnect(m_dataSource, 0, this, 0);
|
|
m_dataSource = source;
|
|
connect(m_dataSource, SIGNAL(newData(const QString &, const Plasma::DataEngine::Data &)),
|
|
this, SLOT(dataUpdated(const QString &, const Plasma::DataEngine::Data &)));
|
|
connect(m_dataSource, SIGNAL(sourceRemoved(const QString &)), this, SLOT(removeSource(const QString &)));
|
|
connect(m_dataSource, SIGNAL(sourceDisconnected(const QString &)), this, SLOT(removeSource(const QString &)));
|
|
}
|
|
|
|
QObject *DataModel::dataSource() const
|
|
{
|
|
return m_dataSource;
|
|
}
|
|
|
|
void DataModel::setKeyRoleFilter(const QString key)
|
|
{
|
|
if (m_keyRoleFilter == key) {
|
|
return;
|
|
}
|
|
|
|
m_keyRoleFilter = key;
|
|
}
|
|
|
|
QString DataModel::keyRoleFilter() const
|
|
{
|
|
return m_keyRoleFilter;
|
|
}
|
|
|
|
void DataModel::setItems(const QString &sourceName, const QVariantList &list)
|
|
{
|
|
emit modelAboutToBeReset();
|
|
|
|
//convert to vector, so data() will be O(1)
|
|
m_items[sourceName] = list.toVector();
|
|
|
|
if (!list.isEmpty()) {
|
|
int role = Qt::UserRole;
|
|
m_roleNames.clear();
|
|
m_roleIds.clear();
|
|
|
|
if (list.first().canConvert<QVariantHash>()) {
|
|
foreach (const QString& roleName, list.first().value<QVariantHash>().keys()) {
|
|
++role;
|
|
m_roleNames[role] = roleName.toLatin1();
|
|
m_roleIds[roleName] = role;
|
|
}
|
|
} else {
|
|
foreach (const QString& roleName, list.first().value<QVariantMap>().keys()) {
|
|
++role;
|
|
m_roleNames[role] = roleName.toLatin1();
|
|
m_roleIds[roleName] = role;
|
|
}
|
|
}
|
|
|
|
setRoleNames(m_roleNames);
|
|
}
|
|
|
|
//make the declarative view reload everything,
|
|
//would be nice an incremental update but is not possible
|
|
emit modelReset();
|
|
}
|
|
|
|
void DataModel::removeSource(const QString &sourceName)
|
|
{
|
|
//FIXME: this could be way more efficient by not resetting the whole model
|
|
//FIXME: find a way to remove only the proper things also in the case where sources are items
|
|
emit modelAboutToBeReset();
|
|
m_items.remove(sourceName);
|
|
emit modelReset();
|
|
}
|
|
|
|
QVariant DataModel::data(const QModelIndex &index, int role) const
|
|
{
|
|
if (!index.isValid() || index.column() > 0 ||
|
|
index.row() < 0 || index.row() >= countItems()){
|
|
return QVariant();
|
|
}
|
|
|
|
int count = 0;
|
|
int actualRow = 0;
|
|
QString source;
|
|
QMap<QString, QVector<QVariant> >::const_iterator i;
|
|
for (i = m_items.constBegin(); i != m_items.constEnd(); ++i) {
|
|
const int oldCount = count;
|
|
count += i.value().count();
|
|
|
|
if (index.row() < count) {
|
|
source = i.key();
|
|
actualRow = index.row() - oldCount;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (m_items.value(source).value(actualRow).canConvert<QVariantHash>()) {
|
|
return m_items.value(source).value(actualRow).value<QVariantHash>().value(m_roleNames.value(role));
|
|
} else {
|
|
return m_items.value(source).value(actualRow).value<QVariantMap>().value(m_roleNames.value(role));
|
|
}
|
|
}
|
|
|
|
QVariant DataModel::headerData(int section, Qt::Orientation orientation, int role) const
|
|
{
|
|
Q_UNUSED(section)
|
|
Q_UNUSED(orientation)
|
|
Q_UNUSED(role)
|
|
|
|
return QVariant();
|
|
}
|
|
|
|
QModelIndex DataModel::index(int row, int column, const QModelIndex &parent) const
|
|
{
|
|
if (parent.isValid() || column > 0 || row < 0 || row >= countItems()) {
|
|
return QModelIndex();
|
|
}
|
|
|
|
return createIndex(row, column, 0);
|
|
}
|
|
|
|
QModelIndex DataModel::parent(const QModelIndex &child) const
|
|
{
|
|
Q_UNUSED(child)
|
|
|
|
return QModelIndex();
|
|
}
|
|
|
|
int DataModel::rowCount(const QModelIndex &parent) const
|
|
{
|
|
//this is not a tree
|
|
//TODO: make it possible some day?
|
|
if (parent.isValid()) {
|
|
return 0;
|
|
}
|
|
|
|
return countItems();
|
|
}
|
|
|
|
int DataModel::columnCount(const QModelIndex &parent) const
|
|
{
|
|
if (parent.isValid()) {
|
|
return 0;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
int DataModel::roleNameToId(const QString &name)
|
|
{
|
|
if (!m_roleIds.contains(name)) {
|
|
return -1;
|
|
}
|
|
return m_roleIds.value(name);
|
|
}
|
|
|
|
}
|
|
|
|
#include "datamodel.moc"
|