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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/****************************************************************************
**
** Copyright (C) 2015 The Qt Company Ltd.
** Contact: http://www.qt.io/licensing/
**
** This file is part of the test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL21$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see http://www.qt.io/terms-conditions. For further
** information use the contact form at http://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 or version 3 as published by the Free
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
** LICENSE.LGPLv3 included in the packaging of this file. Please review the
** following information to ensure the GNU Lesser General Public License
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** As a special exception, The Qt Company gives you certain additional
** rights. These rights are described in The Qt Company LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QtDebug>
#include "TreeSortFilter.h"
using namespace QPatternistSDK;
TreeSortFilter::TreeSortFilter(QObject *p) : QSortFilterProxyModel(p)
{
Q_ASSERT(p);
}
bool TreeSortFilter::lessThan(const QModelIndex &left,
const QModelIndex &right) const
{
const QVariant leftData(sourceModel()->data(left));
const QVariant rightData(sourceModel()->data(right));
return numericLessThan(leftData.toString(), rightData.toString());
}
bool TreeSortFilter::numericLessThan(const QString &l, const QString &r) const
{
QString ls(l);
QString rs(r);
const int len = (l.length() > r.length() ? r.length() : l.length());
for(int i = 0;i < len; ++i)
{
const QChar li(l.at(i));
const QChar ri(r.at(i));
if(li >= QLatin1Char('0') &&
li <= QLatin1Char('9') &&
ri >= QLatin1Char('0') &&
ri <= QLatin1Char('9'))
{
ls = l.mid(i);
rs = r.mid(i);
break;
}
else if(li != ri)
break;
}
const int ld = ls.toInt();
const int rd = rs.toInt();
if(ld == rd)
return ls.localeAwareCompare(rs) < 0;
else
return ld < rd;
}
bool TreeSortFilter::filterAcceptsRow(int sourceRow, const QModelIndex &sourceParent) const
{
if(filterRegExp().isEmpty())
return true;
QModelIndex current(sourceModel()->index(sourceRow, filterKeyColumn(), sourceParent));
if(sourceModel()->hasChildren(current))
{
bool atLeastOneValidChild = false;
int i = 0;
while(!atLeastOneValidChild)
{
const QModelIndex child(current.child(i, current.column()));
if(!child.isValid())
// No valid child
break;
atLeastOneValidChild = filterAcceptsRow(i, current);
i++;
}
return atLeastOneValidChild;
}
return sourceModel()->data(current).toString().contains(filterRegExp());
}
// vim: et:ts=4:sw=4:sts=4
|
