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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Qt Software Information (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** 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 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at qt-sales@nokia.com.
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QGRAPHICSSCENEBSPTREEINDEX_P_H
#define QGRAPHICSSCENEBSPTREEINDEX_P_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists for the convenience
// of qapplication_*.cpp, qwidget*.cpp and qfiledialog.cpp. This header
// file may change from version to version without notice, or even be removed.
//
// We mean it.
//
#include "qgraphicsscenebsptreeindex.h"
#if !defined(QT_NO_GRAPHICSVIEW) || (QT_EDITION & QT_MODULE_GRAPHICSVIEW) != QT_MODULE_GRAPHICSVIEW
#include <private/qgraphicssceneindex_p.h>
#include <private/qgraphicsitem_p.h>
QT_BEGIN_NAMESPACE
static const int QGRAPHICSSCENE_INDEXTIMER_TIMEOUT = 2000;
class QGraphicsScene;
class QGraphicsSceneBspTreeIndexPrivate : public QGraphicsSceneIndexPrivate
{
Q_DECLARE_PUBLIC(QGraphicsSceneBspTreeIndex)
public:
QGraphicsSceneBspTreeIndexPrivate(QGraphicsScene *scene);
QGraphicsSceneBspTree bsp;
QRectF sceneRect;
int bspTreeDepth;
int indexTimerId;
bool restartIndexTimer;
bool regenerateIndex;
int lastItemCount;
QList<QGraphicsItem *> indexedItems;
QList<QGraphicsItem *> unindexedItems;
QList<int> freeItemIndexes;
bool purgePending;
QSet<QGraphicsItem *> removedItems;
void purgeRemovedItems();
void _q_updateIndex();
void startIndexTimer(int interval = QGRAPHICSSCENE_INDEXTIMER_TIMEOUT);
void resetIndex();
void addToIndex(QGraphicsItem *item);
void removeFromIndex(QGraphicsItem *item);
void _q_updateSortCache();
bool sortCacheEnabled;
bool updatingSortCache;
void invalidateSortCache();
static void climbTree(QGraphicsItem *item, int *stackingOrder);
static bool closestItemFirst_withoutCache(const QGraphicsItem *item1, const QGraphicsItem *item2);
static bool closestItemLast_withoutCache(const QGraphicsItem *item1, const QGraphicsItem *item2);
static inline bool closestItemFirst_withCache(const QGraphicsItem *item1, const QGraphicsItem *item2)
{
return item1->d_ptr->globalStackingOrder < item2->d_ptr->globalStackingOrder;
}
static inline bool closestItemLast_withCache(const QGraphicsItem *item1, const QGraphicsItem *item2)
{
return item1->d_ptr->globalStackingOrder >= item2->d_ptr->globalStackingOrder;
}
static void sortItems(QList<QGraphicsItem *> *itemList, Qt::SortOrder order, bool cached);
};
/*!
\internal
*/
inline bool qt_closestLeaf(const QGraphicsItem *item1, const QGraphicsItem *item2)
{
// Return true if sibling item1 is on top of item2.
const QGraphicsItemPrivate *d1 = item1->d_ptr;
const QGraphicsItemPrivate *d2 = item2->d_ptr;
bool f1 = d1->flags & QGraphicsItem::ItemStacksBehindParent;
bool f2 = d2->flags & QGraphicsItem::ItemStacksBehindParent;
if (f1 != f2) return f2;
qreal z1 = d1->z;
qreal z2 = d2->z;
return z1 > z2;
}
/*!
\internal
*/
static inline bool qt_notclosestLeaf(const QGraphicsItem *item1, const QGraphicsItem *item2)
{
return qt_closestLeaf(item2, item1);
}
QT_END_NAMESPACE
#endif // QGRAPHICSSCENEBSPTREEINDEX_P_H
#endif
|
