1 | /* |
2 | * kdfsortproxymodel.cpp |
3 | * |
4 | * Copyright (c) 2009 Dario Andres Rodriguez <andresbajotierra@gmail.com> |
5 | * |
6 | * This program is free software; you can redistribute it and/or modify |
7 | * it under the terms of the GNU General Public License as published by |
8 | * the Free Software Foundation; either version 2 of the License, or |
9 | * (at your option) any later version. |
10 | * |
11 | * This program is distributed in the hope that it will be useful, |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * GNU General Public License for more details. |
15 | * |
16 | * You should have received a copy of the GNU General Public License |
17 | * along with this program; if not, write to the Free Software |
18 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. |
19 | */ |
20 | |
21 | #include "kdfsortproxymodel.h" |
22 | |
23 | #include "kdfwidget.h" |
24 | |
25 | bool KDFSortFilterProxyModel::lessThan(const QModelIndex &left, const QModelIndex &right) const |
26 | { |
27 | |
28 | //Properly sort the file sizes using the numeric size instead of the string |
29 | // representation (10Mb < 9Gb) |
30 | if( left.column() == KDFWidget::SizeCol || left.column() == KDFWidget::FreeCol ) |
31 | { |
32 | qulonglong leftData = sourceModel()->data( left, Qt::UserRole ).toULongLong(); |
33 | qulonglong rightData = sourceModel()->data( right, Qt::UserRole ).toULongLong(); |
34 | |
35 | return leftData < rightData; |
36 | } |
37 | // Full percent can be -1 (non mounted disks) |
38 | else if ( left.column() == KDFWidget::FullCol || left.column() == KDFWidget::UsageBarCol ) |
39 | { |
40 | int leftData = sourceModel()->data( left, Qt::UserRole ).toInt(); |
41 | int rightData = sourceModel()->data( right, Qt::UserRole ).toInt(); |
42 | |
43 | return leftData < rightData; |
44 | |
45 | } |
46 | // Default sorting rules for string values |
47 | else |
48 | { |
49 | return QSortFilterProxyModel::lessThan( left, right ); |
50 | } |
51 | |
52 | } |
53 | |