1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
/*
Copyright (C) 2012 Martin Klapetek <mklapetek@kde.org>
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) 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 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 "persons-proxy-model.h"
#include <KDebug>
PersonsProxyModel::PersonsProxyModel(QObject *parent)
: KCategorizedSortFilterProxyModel(parent)
{
}
PersonsProxyModel::~PersonsProxyModel()
{
}
bool PersonsProxyModel::lessThan(const QModelIndex& left, const QModelIndex& right) const
{
return QSortFilterProxyModel::lessThan(left, right);
}
QVariant PersonsProxyModel::data(const QModelIndex &index, int role) const
{
if (!index.isValid()) {
return QVariant();
}
if (role == KCategorizedSortFilterProxyModel::CategoryDisplayRole) {
return index.data(Qt::DisplayRole).toString().left(1);
}
return QSortFilterProxyModel::data(index, role);
}
// int PersonsProxyModel::compareCategories(const QModelIndex& left, const QModelIndex& right) const
// {
// return KCategorizedSortFilterProxyModel::compareCategories(left, right);
// }
//
// bool PersonsProxyModel::subSortLessThan(const QModelIndex &left, const QModelIndex &right) const
// {
// return QString::localeAwareCompare(left.data(Qt::DisplayRole).toString(), right.data(Qt::DisplayRole).toString()) < 0;
// }
|