Revision control

Copy as Markdown

// 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
// Qt-Security score:significant reason:default
#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