49 lines
1.7 KiB
C++
49 lines
1.7 KiB
C++
/*
|
|
* Copyright 2017 Jos van den Oever <jos@vandenoever.info>
|
|
*
|
|
* 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) version 3 or any later version
|
|
* accepted by the membership of KDE e.V. (or its successor approved
|
|
* by the membership of KDE e.V.), which shall act as a proxy
|
|
* defined in Section 14 of version 3 of the license.
|
|
*
|
|
* 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, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef SORTED_MODEL
|
|
#define SORTED_MODEL
|
|
|
|
#include <QSortFilterProxyModel>
|
|
#include <QDebug>
|
|
|
|
class SortedModel : public QSortFilterProxyModel {
|
|
Q_OBJECT
|
|
public:
|
|
SortedModel() :QSortFilterProxyModel() {}
|
|
bool filterAcceptsRow(int source_row, const QModelIndex & source_parent) const;
|
|
Q_INVOKABLE QVariant data(const QModelIndex &index, int role = Qt::DisplayRole) const {
|
|
return QSortFilterProxyModel::data(index, role);
|
|
}
|
|
public slots:
|
|
void sortByRole(const QString& role, Qt::SortOrder order) {
|
|
QHashIterator<int, QByteArray> i(roleNames());
|
|
while (i.hasNext()) {
|
|
i.next();
|
|
if (i.value() == role) {
|
|
setSortRole(i.key());
|
|
}
|
|
}
|
|
sort(0, order);
|
|
}
|
|
};
|
|
|
|
#endif
|