1 /****************************************************************************
3 ** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
4 ** All rights reserved.
5 ** Contact: Nokia Corporation (qt-info@nokia.com)
7 ** This file is part of the test suite of the Qt Toolkit.
9 ** $QT_BEGIN_LICENSE:LGPL$
10 ** No Commercial Usage
11 ** This file contains pre-release code and may not be distributed.
12 ** You may use this file in accordance with the terms and conditions
13 ** contained in the Technology Preview License Agreement accompanying
16 ** GNU Lesser General Public License Usage
17 ** Alternatively, this file may be used under the terms of the GNU Lesser
18 ** General Public License version 2.1 as published by the Free Software
19 ** Foundation and appearing in the file LICENSE.LGPL included in the
20 ** packaging of this file. Please review the following information to
21 ** ensure the GNU Lesser General Public License version 2.1 requirements
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
24 ** In addition, as a special exception, Nokia gives you certain additional
25 ** rights. These rights are described in the Nokia Qt LGPL Exception
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
28 ** If you have questions regarding the use of this file, please contact
29 ** Nokia at qt-info@nokia.com.
40 ****************************************************************************/
44 #include "TreeSortFilter.h"
46 using namespace QPatternistSDK;
48 TreeSortFilter::TreeSortFilter(QObject *p) : QSortFilterProxyModel(p)
53 bool TreeSortFilter::lessThan(const QModelIndex &left,
54 const QModelIndex &right) const
56 const QVariant leftData(sourceModel()->data(left));
57 const QVariant rightData(sourceModel()->data(right));
59 return numericLessThan(leftData.toString(), rightData.toString());
62 bool TreeSortFilter::numericLessThan(const QString &l, const QString &r) const
66 const int len = (l.length() > r.length() ? r.length() : l.length());
68 for(int i = 0;i < len; ++i)
70 const QChar li(l.at(i));
71 const QChar ri(r.at(i));
73 if(li >= QLatin1Char('0') &&
74 li <= QLatin1Char('9') &&
75 ri >= QLatin1Char('0') &&
76 ri <= QLatin1Char('9'))
86 const int ld = ls.toInt();
87 const int rd = rs.toInt();
90 return ls.localeAwareCompare(rs) < 0;
95 bool TreeSortFilter::filterAcceptsRow(int sourceRow, const QModelIndex &sourceParent) const
97 if(filterRegExp().isEmpty())
100 QModelIndex current(sourceModel()->index(sourceRow, filterKeyColumn(), sourceParent));
102 if(sourceModel()->hasChildren(current))
104 bool atLeastOneValidChild = false;
106 while(!atLeastOneValidChild)
108 const QModelIndex child(current.child(i, current.column()));
113 atLeastOneValidChild = filterAcceptsRow(i, current);
116 return atLeastOneValidChild;
119 return sourceModel()->data(current).toString().contains(filterRegExp());
122 // vim: et:ts=4:sw=4:sts=4