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
|
/*
This file is part of Massif Visualizer
Copyright 2010 Milian Wolff <mail@milianw.de>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) version 3, or any
later version accepted by the membership of KDE e.V. (or its
successor approved by the membership of KDE e.V.), which shall
act as a proxy defined in Section 6 of version 3 of the license.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library. If not, see <http://www.gnu.org/licenses/>.
*/
#include "filtereddatatreemodel.h"
#include "datatreemodel.h"
using namespace Massif;
FilteredDataTreeModel::FilteredDataTreeModel(DataTreeModel* parent)
: QSortFilterProxyModel(parent)
{
setDynamicSortFilter(true);
setSourceModel(parent);
m_timer.setSingleShot(true);
m_timer.setInterval(150);
connect(&m_timer, &QTimer::timeout, this, &FilteredDataTreeModel::timeout);
}
void FilteredDataTreeModel::setFilter(const QString& needle)
{
m_needle = needle;
m_timer.start();
}
void FilteredDataTreeModel::timeout()
{
invalidateFilter();
}
bool FilteredDataTreeModel::filterAcceptsRow(int source_row, const QModelIndex& source_parent) const
{
if (m_needle.isEmpty()) {
return true;
}
const QModelIndex& dataIdx = sourceModel()->index(source_row, 0, source_parent);
Q_ASSERT(dataIdx.isValid());
if (sourceModel()->data(dataIdx, DataTreeModel::RawLabelRole).toString().contains(m_needle, Qt::CaseInsensitive)) {
return true;
} else {
const int rows = sourceModel()->rowCount(dataIdx);
for ( int i = 0; i < rows; ++i ) {
if ( filterAcceptsRow(i, dataIdx) ) {
return true;
}
}
return false;
}
}
bool FilteredDataTreeModel::filterAcceptsColumn(int, const QModelIndex&) const
{
return true;
}
void FilteredDataTreeModel::setSourceModel(QAbstractItemModel* sourceModel)
{
QSortFilterProxyModel::setSourceModel(sourceModel);
}
#include "moc_filtereddatatreemodel.cpp"
|
