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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#include "qgraphicsscene_bsp_p.h"
#include <QtCore/qstring.h>
#include <private/qgraphicsitem_p.h>
QT_BEGIN_NAMESPACE
QGraphicsSceneBspTree::QGraphicsSceneBspTree()
: leafCnt(0)
{
}
QGraphicsSceneBspTree::~QGraphicsSceneBspTree()
{
}
void QGraphicsSceneBspTree::initialize(const QRectF &rect, int depth)
{
this->rect = rect;
leafCnt = 0;
nodes.resize((1 << (depth + 1)) - 1);
nodes.fill(Node());
leaves.resize(1ll << depth);
leaves.fill(QList<QGraphicsItem *>());
initialize(rect, depth, 0);
}
void QGraphicsSceneBspTree::clear()
{
leafCnt = 0;
nodes.clear();
leaves.clear();
}
void QGraphicsSceneBspTree::insertItem(QGraphicsItem *item, const QRectF &rect)
{
climbTree([item](QList<QGraphicsItem *> *items){
items->prepend(item);
}, rect);
}
void QGraphicsSceneBspTree::removeItem(QGraphicsItem *item, const QRectF &rect)
{
climbTree([item](QList<QGraphicsItem *> *items){
items->removeAll(item);
}, rect);
}
void QGraphicsSceneBspTree::removeItems(const QSet<QGraphicsItem *> &items)
{
for (int i = 0; i < leaves.size(); ++i) {
QList<QGraphicsItem *> newItemList;
const QList<QGraphicsItem *> &oldItemList = leaves[i];
for (int j = 0; j < oldItemList.size(); ++j) {
QGraphicsItem *item = oldItemList.at(j);
if (!items.contains(item))
newItemList << item;
}
leaves[i] = newItemList;
}
}
QList<QGraphicsItem *> QGraphicsSceneBspTree::items(const QRectF &rect, bool onlyTopLevelItems) const
{
QList<QGraphicsItem *> foundItems;
climbTree([&foundItems, onlyTopLevelItems](QList<QGraphicsItem *> *items) {
for (int i = 0; i < items->size(); ++i) {
QGraphicsItem *item = items->at(i);
if (onlyTopLevelItems && item->d_ptr->parent)
item = item->topLevelItem();
if (!item->d_func()->itemDiscovered && item->d_ptr->visible) {
item->d_func()->itemDiscovered = 1;
foundItems.prepend(item);
}
}
}, rect);
// Reset discovery bits.
for (const auto &foundItem : std::as_const(foundItems))
foundItem->d_ptr->itemDiscovered = 0;
return foundItems;
}
int QGraphicsSceneBspTree::leafCount() const
{
return leafCnt;
}
QString QGraphicsSceneBspTree::debug(int index) const
{
const Node *node = &nodes.at(index);
QString tmp;
if (node->type == Node::Leaf) {
QRectF rect = rectForIndex(index);
if (!leaves[node->leafIndex].isEmpty()) {
tmp += QString::fromLatin1("[%1, %2, %3, %4] contains %5 items\n")
.arg(rect.left()).arg(rect.top())
.arg(rect.width()).arg(rect.height())
.arg(leaves[node->leafIndex].size());
}
} else {
if (node->type == Node::Horizontal) {
tmp += debug(firstChildIndex(index));
tmp += debug(firstChildIndex(index) + 1);
} else {
tmp += debug(firstChildIndex(index));
tmp += debug(firstChildIndex(index) + 1);
}
}
return tmp;
}
void QGraphicsSceneBspTree::initialize(const QRectF &rect, int depth, int index)
{
Node *node = &nodes[index];
if (index == 0) {
node->type = Node::Horizontal;
node->offset = rect.center().y();
}
if (depth) {
Node::Type type;
QRectF rect1, rect2;
qreal offset1, offset2;
if (node->type == Node::Horizontal) {
type = Node::Vertical;
rect1.setRect(rect.left(), rect.top(), rect.width(), rect.height() / 2);
rect2.setRect(rect1.left(), rect1.bottom(), rect1.width(), rect.height() - rect1.height());
offset1 = rect1.center().x();
offset2 = rect2.center().x();
} else {
type = Node::Horizontal;
rect1.setRect(rect.left(), rect.top(), rect.width() / 2, rect.height());
rect2.setRect(rect1.right(), rect1.top(), rect.width() - rect1.width(), rect1.height());
offset1 = rect1.center().y();
offset2 = rect2.center().y();
}
int childIndex = firstChildIndex(index);
Node *child = &nodes[childIndex];
child->offset = offset1;
child->type = type;
child = &nodes[childIndex + 1];
child->offset = offset2;
child->type = type;
initialize(rect1, depth - 1, childIndex);
initialize(rect2, depth - 1, childIndex + 1);
} else {
node->type = Node::Leaf;
node->leafIndex = leafCnt++;
}
}
template<typename Visitor>
void QGraphicsSceneBspTree::climbTree(Visitor &&visitor, const QRectF &rect, int index) const
{
if (nodes.isEmpty())
return;
const Node &node = nodes.at(index);
const int childIndex = firstChildIndex(index);
switch (node.type) {
case Node::Leaf: {
visitor(const_cast<QList<QGraphicsItem*>*>(&leaves[node.leafIndex]));
break;
}
case Node::Vertical:
if (rect.left() < node.offset) {
climbTree(visitor, rect, childIndex);
if (rect.right() >= node.offset)
climbTree(visitor, rect, childIndex + 1);
} else {
climbTree(visitor, rect, childIndex + 1);
}
break;
case Node::Horizontal:
if (rect.top() < node.offset) {
climbTree(visitor, rect, childIndex);
if (rect.bottom() >= node.offset)
climbTree(visitor, rect, childIndex + 1);
} else {
climbTree(visitor, rect, childIndex + 1);
}
}
}
QRectF QGraphicsSceneBspTree::rectForIndex(int index) const
{
if (index <= 0)
return rect;
int parentIdx = parentIndex(index);
QRectF rect = rectForIndex(parentIdx);
const Node *parent = &nodes.at(parentIdx);
if (parent->type == Node::Vertical) {
if (index & 1)
rect.setRight(parent->offset);
else
rect.setLeft(parent->offset);
} else {
if (index & 1)
rect.setBottom(parent->offset);
else
rect.setTop(parent->offset);
}
return rect;
}
QT_END_NAMESPACE
|
