2 * This file is part of NeverNote
\r
3 * Copyright 2009 Randy Baumgarte
\r
5 * This file may be licensed under the terms of of the
\r
6 * GNU General Public License Version 2 (the ``GPL'').
\r
8 * Software distributed under the License is distributed
\r
9 * on an ``AS IS'' basis, WITHOUT WARRANTY OF ANY KIND, either
\r
10 * express or implied. See the GPL for the specific language
\r
11 * governing rights and limitations.
\r
13 * You should have received a copy of the GPL along with this
\r
14 * program. If not, go to http://www.gnu.org/licenses/gpl.html
\r
15 * or write to the Free Software Foundation, Inc.,
\r
16 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
\r
20 package cx.fbn.nevernote.filters;
\r
22 import java.util.HashMap;
\r
23 import java.util.Map;
\r
25 import com.trolltech.qt.core.QAbstractItemModel;
\r
26 import com.trolltech.qt.core.QModelIndex;
\r
27 import com.trolltech.qt.core.QObject;
\r
28 import com.trolltech.qt.gui.QSortFilterProxyModel;
\r
30 import cx.fbn.nevernote.Global;
\r
32 public class NoteSortFilterProxyModel extends QSortFilterProxyModel {
\r
33 private final Map<String,String> guids;
\r
35 public NoteSortFilterProxyModel(QObject parent) {
\r
37 guids = new HashMap<String,String>();
\r
38 setDynamicSortFilter(true);
\r
40 public void clear() {
\r
43 public void addGuid(String guid) {
\r
44 // if (!guids.containsKey(guid))
\r
45 guids.put(guid, null);
\r
47 public void filter() {
\r
51 protected boolean filterAcceptsRow(int sourceRow, QModelIndex sourceParent) {
\r
52 if (guids.size() == 0)
\r
54 QAbstractItemModel model = sourceModel();
\r
55 QModelIndex guidIndex = sourceModel().index(sourceRow, Global.noteTableGuidPosition);
\r
56 String guid = (String)model.data(guidIndex);
\r
58 if (guids.containsKey(guid))
\r
65 protected boolean lessThan(QModelIndex left, QModelIndex right) {
\r
67 Object leftData = sourceModel().data(left);
\r
68 Object rightData = sourceModel().data(right);
\r
70 if (leftData instanceof Long && rightData instanceof Long) {
\r
71 Long leftLong = (Long)leftData;
\r
72 Long rightLong = (Long)rightData;
\r
73 return leftLong.compareTo(rightLong) < 0;
\r
75 if (leftData instanceof String && rightData instanceof String) {
\r
76 String leftString = (String)leftData;
\r
77 String rightString = (String)rightData;
\r
78 return leftString.compareTo(rightString) < 0;
\r
81 return super.lessThan(left, right);
\r