File: notesortfilterproxymodel.cpp

package info (click to toggle)
nixnote2 2.0~beta11-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 9,448 kB
  • ctags: 7,058
  • sloc: cpp: 68,338; java: 1,096; sh: 834; makefile: 27
file content (81 lines) | stat: -rw-r--r-- 2,959 bytes parent folder | download
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
/*********************************************************************************
NixNote - An open-source client for the Evernote service.
Copyright (C) 2015 Randy Baumgarte

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 "notesortfilterproxymodel.h"
#include "global.h"

NoteSortFilterProxyModel::NoteSortFilterProxyModel() :
    QSortFilterProxyModel()
{
    lidMap = new QMap<qint32,qint32>();
}


NoteSortFilterProxyModel::~NoteSortFilterProxyModel()
{
    delete lidMap;
}


bool NoteSortFilterProxyModel::filterAcceptsRow(qint32 source_row, const QModelIndex &source_parent) const {
    QModelIndex idx = sourceModel()->index(source_row,NOTE_TABLE_LID_POSITION, source_parent);
    qint32 rowLid = sourceModel()->data(idx).toInt();
    if (lidMap->contains(rowLid)) {
        lidMap->remove(rowLid);
        lidMap->insert(rowLid, source_row);
        return true;
    }
    return false;
}


bool NoteSortFilterProxyModel::lessThan(const QModelIndex &left, const QModelIndex &right) const {
    QVariant leftData = this->sourceModel()->data(left);
    QVariant rightData = this->sourceModel()->data(right);

    if (left.column() == NOTE_TABLE_IS_DIRTY_POSITION)
        return leftData.toBool() < rightData.toBool();

    if (leftData.type() == QVariant::Invalid || rightData.type() == QVariant::Invalid)
        return true;

    if (leftData.type() == QVariant::Icon || rightData.type() == QVariant::Icon)
        return true;

    if (leftData.type() == QVariant::Image || rightData.type() == QVariant::Image)
        return true;

    if (leftData.type() == QVariant::String && rightData.type() == QVariant::String) {
        QString left = leftData.toString();
        QString right = rightData.toString();
        return left.toLower() < right.toLower();
    }

    if (leftData.type() == QVariant::Int && rightData.type() == QVariant::Int)
        return leftData.toInt() < rightData.toInt();

    if (leftData.type() == QVariant::LongLong && rightData.type() == QVariant::LongLong)
        return leftData.toLongLong() < rightData.toLongLong();

    if (leftData.type() == QVariant::Double && rightData.type() == QVariant::Double)
        return leftData.toDouble() < rightData.toDouble();

    return true;
}