61 lines
2.1 KiB
C++
61 lines
2.1 KiB
C++
/**
|
|
* Copyright 2013 Albert Vaca <albertvaka@gmail.com>
|
|
*
|
|
* 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 <https://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "devicessortproxymodel.h"
|
|
|
|
#include "dbusinterfaces.h"
|
|
#include "devicesmodel.h"
|
|
|
|
DevicesSortProxyModel::DevicesSortProxyModel(DevicesModel* devicesModel)
|
|
: QSortFilterProxyModel(devicesModel)
|
|
{
|
|
setSourceModel(devicesModel);
|
|
setSortRole(DevicesModel::StatusModelRole);
|
|
sort(0);
|
|
}
|
|
|
|
bool DevicesSortProxyModel::lessThan(const QModelIndex& left, const QModelIndex& right) const
|
|
{
|
|
QAbstractItemModel* model = sourceModel();
|
|
Q_ASSERT(qobject_cast<DevicesModel*>(model));
|
|
|
|
//Show connected devices first
|
|
int statusLeft = model->data(left, DevicesModel::StatusModelRole).toInt();
|
|
int statusRight = model->data(right, DevicesModel::StatusModelRole).toInt();
|
|
|
|
if (statusLeft != statusRight) {
|
|
return statusLeft > statusRight;
|
|
}
|
|
|
|
//Fallback to alphabetical order
|
|
QString nameLeft = model->data(left, DevicesModel::NameModelRole).toString();
|
|
QString nameRight = model->data(right, DevicesModel::NameModelRole).toString();
|
|
|
|
return nameLeft > nameRight;
|
|
|
|
}
|
|
|
|
bool DevicesSortProxyModel::filterAcceptsRow(int source_row, const QModelIndex& source_parent) const
|
|
{
|
|
Q_UNUSED(source_row);
|
|
Q_UNUSED(source_parent);
|
|
//Possible to-do: Implement filter
|
|
return true;
|
|
}
|