2018-02-27 18:06:05 +01:00
|
|
|
/*
|
|
|
|
* Strawberry Music Player
|
|
|
|
* This file was part of Clementine.
|
|
|
|
* Copyright 2010, David Sansome <me@davidsansome.com>
|
|
|
|
*
|
|
|
|
* Strawberry 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 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* Strawberry 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 Strawberry. If not, see <http://www.gnu.org/licenses/>.
|
2018-08-09 18:39:44 +02:00
|
|
|
*
|
2018-02-27 18:06:05 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
|
2018-05-01 00:41:33 +02:00
|
|
|
#include <QtGlobal>
|
|
|
|
#include <QObject>
|
2020-02-08 03:40:30 +01:00
|
|
|
#include <QAbstractItemModel>
|
2018-05-01 00:41:33 +02:00
|
|
|
#include <QSortFilterProxyModel>
|
|
|
|
#include <QMetaType>
|
2018-02-27 18:06:05 +01:00
|
|
|
#include <QDateTime>
|
2018-05-01 00:41:33 +02:00
|
|
|
#include <QVariant>
|
|
|
|
#include <QString>
|
2020-02-08 03:40:30 +01:00
|
|
|
#include <QChar>
|
2018-05-01 00:41:33 +02:00
|
|
|
|
|
|
|
#include "multisortfilterproxy.h"
|
2018-02-27 18:06:05 +01:00
|
|
|
|
|
|
|
MultiSortFilterProxy::MultiSortFilterProxy(QObject *parent)
|
|
|
|
: QSortFilterProxyModel(parent) {}
|
|
|
|
|
|
|
|
void MultiSortFilterProxy::AddSortSpec(int role, Qt::SortOrder order) {
|
|
|
|
sorting_ << SortSpec(role, order);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool MultiSortFilterProxy::lessThan(const QModelIndex &left, const QModelIndex &right) const {
|
|
|
|
|
|
|
|
for (const SortSpec &spec : sorting_) {
|
|
|
|
const int ret = Compare(left.data(spec.first), right.data(spec.first));
|
|
|
|
|
|
|
|
if (ret < 0) {
|
|
|
|
return spec.second == Qt::AscendingOrder;
|
|
|
|
}
|
|
|
|
else if (ret > 0) {
|
|
|
|
return spec.second != Qt::AscendingOrder;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return left.row() < right.row();
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
static inline int DoCompare(T left, T right) {
|
|
|
|
|
|
|
|
if (left < right) return -1;
|
|
|
|
if (left > right) return 1;
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
int MultiSortFilterProxy::Compare(const QVariant &left, const QVariant &right) const {
|
|
|
|
|
2018-05-01 00:41:33 +02:00
|
|
|
// Copied from the QSortFilterProxyModel::lessThan implementation, but returns -1, 0 or 1 instead of true or false.
|
2018-02-27 18:06:05 +01:00
|
|
|
switch (left.userType()) {
|
|
|
|
case QVariant::Invalid: return (right.type() != QVariant::Invalid) ? -1 : 0;
|
|
|
|
case QVariant::Int: return DoCompare(left.toInt(), right.toInt());
|
|
|
|
case QVariant::UInt: return DoCompare(left.toUInt(), right.toUInt());
|
|
|
|
case QVariant::LongLong: return DoCompare(left.toLongLong(), right.toLongLong());
|
|
|
|
case QVariant::ULongLong: return DoCompare(left.toULongLong(), right.toULongLong());
|
|
|
|
case QMetaType::Float: return DoCompare(left.toFloat(), right.toFloat());
|
|
|
|
case QVariant::Double: return DoCompare(left.toDouble(), right.toDouble());
|
|
|
|
case QVariant::Char: return DoCompare(left.toChar(), right.toChar());
|
|
|
|
case QVariant::Date: return DoCompare(left.toDate(), right.toDate());
|
|
|
|
case QVariant::Time: return DoCompare(left.toTime(), right.toTime());
|
|
|
|
case QVariant::DateTime: return DoCompare(left.toDateTime(), right.toDateTime());
|
|
|
|
case QVariant::String:
|
|
|
|
default:
|
|
|
|
if (isSortLocaleAware())
|
|
|
|
return left.toString().localeAwareCompare(right.toString());
|
|
|
|
else
|
|
|
|
return left.toString().compare(right.toString(), sortCaseSensitivity());
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|