|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2008-2010 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (developer.feedback@nokia.com) |
|
6 ** |
|
7 ** This file is part of the HbWidgets module of the UI Extensions for Mobile. |
|
8 ** |
|
9 ** GNU Lesser General Public License Usage |
|
10 ** This file may be used under the terms of the GNU Lesser General Public |
|
11 ** License version 2.1 as published by the Free Software Foundation and |
|
12 ** appearing in the file LICENSE.LGPL included in the packaging of this file. |
|
13 ** Please review the following information to ensure the GNU Lesser General |
|
14 ** Public License version 2.1 requirements will be met: |
|
15 ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
16 ** |
|
17 ** In addition, as a special exception, Nokia gives you certain additional |
|
18 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
19 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
20 ** |
|
21 ** If you have questions regarding the use of this file, please contact |
|
22 ** Nokia at developer.feedback@nokia.com. |
|
23 ** |
|
24 ****************************************************************************/ |
|
25 |
|
26 #ifndef HBTREEMODELITERATOR_P_P_H |
|
27 #define HBTREEMODELITERATOR_P_P_H |
|
28 |
|
29 #include <hbglobal.h> |
|
30 #include "hbtreemodeliterator_p.h" |
|
31 #include "hbmodeliterator_p.h" |
|
32 |
|
33 QT_BEGIN_NAMESPACE |
|
34 class QAbstractItemModel; |
|
35 class QModelIndex; |
|
36 QT_END_NAMESPACE |
|
37 |
|
38 class HbAbstractItemContainer; |
|
39 class HbTreeModelIterator; |
|
40 |
|
41 class HbTreeModelIteratorPrivate : public HbModelIteratorPrivate |
|
42 { |
|
43 Q_DECLARE_PUBLIC(HbTreeModelIterator) |
|
44 |
|
45 public: |
|
46 HbTreeModelIteratorPrivate(); |
|
47 ~HbTreeModelIteratorPrivate(); |
|
48 |
|
49 QModelIndex first(const QModelIndex &parent) const; |
|
50 QModelIndex last(const QModelIndex &parent) const; |
|
51 int childIndexCount(const QModelIndex &index) const; |
|
52 void resetCache(); |
|
53 int searchForward(const QModelIndex &index) const; |
|
54 int searchBackward(const QModelIndex &index) const; |
|
55 QModelIndexList createParentChainList(const QModelIndex &index) const; |
|
56 bool isExpanded(const QModelIndex &index) const; |
|
57 bool isExpandedBranch(const QModelIndex &index) const; |
|
58 inline bool isInCountCache(const QModelIndex &index) const; |
|
59 inline bool isInPositionCache(const QModelIndex &index) const; |
|
60 |
|
61 struct CachedIndexCount { |
|
62 int count; |
|
63 QModelIndex index; |
|
64 CachedIndexCount(int c = 0, QModelIndex i = QModelIndex()) {count = c; index = i;}; |
|
65 }; |
|
66 |
|
67 mutable struct CachedIndexCount mCachedCount; |
|
68 mutable struct CachedIndexCount mCachedPosition; |
|
69 |
|
70 HbAbstractItemContainer *mItemContainer; |
|
71 int mExpansionKey; |
|
72 bool mUseCache; |
|
73 }; |
|
74 |
|
75 bool HbTreeModelIteratorPrivate::isInCountCache(const QModelIndex &index) const |
|
76 { |
|
77 return (mUseCache |
|
78 && index == mCachedCount.index) |
|
79 && (mCachedCount.count >= 0); |
|
80 } |
|
81 |
|
82 inline bool HbTreeModelIteratorPrivate::isInPositionCache(const QModelIndex &index) const |
|
83 { |
|
84 return (mUseCache |
|
85 && index == mCachedPosition.index) |
|
86 && (mCachedPosition.count >= 0); |
|
87 } |
|
88 |
|
89 #endif // HBMODELITERATOR_P_P_H |