| /**************************************************************************** |
| ** |
| ** Copyright (C) 2016 The Qt Company Ltd. |
| ** Contact: https://www.qt.io/licensing/ |
| ** |
| ** This file is part of the QtWidgets module of the Qt Toolkit. |
| ** |
| ** $QT_BEGIN_LICENSE:LGPL$ |
| ** Commercial License Usage |
| ** Licensees holding valid commercial Qt licenses may use this file in |
| ** accordance with the commercial license agreement provided with the |
| ** Software or, alternatively, in accordance with the terms contained in |
| ** a written agreement between you and The Qt Company. For licensing terms |
| ** and conditions see https://www.qt.io/terms-conditions. For further |
| ** information use the contact form at https://www.qt.io/contact-us. |
| ** |
| ** GNU Lesser General Public License Usage |
| ** Alternatively, this file may be used under the terms of the GNU Lesser |
| ** General Public License version 3 as published by the Free Software |
| ** Foundation and appearing in the file LICENSE.LGPL3 included in the |
| ** packaging of this file. Please review the following information to |
| ** ensure the GNU Lesser General Public License version 3 requirements |
| ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. |
| ** |
| ** GNU General Public License Usage |
| ** Alternatively, this file may be used under the terms of the GNU |
| ** General Public License version 2.0 or (at your option) the GNU General |
| ** Public license version 3 or any later version approved by the KDE Free |
| ** Qt Foundation. The licenses are as published by the Free Software |
| ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3 |
| ** included in the packaging of this file. Please review the following |
| ** information to ensure the GNU General Public License requirements will |
| ** be met: https://www.gnu.org/licenses/gpl-2.0.html and |
| ** https://www.gnu.org/licenses/gpl-3.0.html. |
| ** |
| ** $QT_END_LICENSE$ |
| ** |
| ****************************************************************************/ |
| |
| #include "qgraphicsscene_bsp_p.h" |
| |
| #include <QtCore/qstring.h> |
| #include <private/qgraphicsitem_p.h> |
| |
| QT_BEGIN_NAMESPACE |
| |
| class QGraphicsSceneInsertItemBspTreeVisitor : public QGraphicsSceneBspTreeVisitor |
| { |
| public: |
| QGraphicsItem *item; |
| |
| void visit(QList<QGraphicsItem *> *items) override |
| { items->prepend(item); } |
| }; |
| |
| class QGraphicsSceneRemoveItemBspTreeVisitor : public QGraphicsSceneBspTreeVisitor |
| { |
| public: |
| QGraphicsItem *item; |
| |
| void visit(QList<QGraphicsItem *> *items) override |
| { items->removeAll(item); } |
| }; |
| |
| class QGraphicsSceneFindItemBspTreeVisitor : public QGraphicsSceneBspTreeVisitor |
| { |
| public: |
| QList<QGraphicsItem *> *foundItems; |
| bool onlyTopLevelItems; |
| |
| void visit(QList<QGraphicsItem *> *items) override |
| { |
| 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); |
| } |
| } |
| } |
| }; |
| |
| QGraphicsSceneBspTree::QGraphicsSceneBspTree() |
| : leafCnt(0) |
| { |
| insertVisitor = new QGraphicsSceneInsertItemBspTreeVisitor; |
| removeVisitor = new QGraphicsSceneRemoveItemBspTreeVisitor; |
| findVisitor = new QGraphicsSceneFindItemBspTreeVisitor; |
| } |
| |
| QGraphicsSceneBspTree::~QGraphicsSceneBspTree() |
| { |
| delete insertVisitor; |
| delete removeVisitor; |
| delete findVisitor; |
| } |
| |
| void QGraphicsSceneBspTree::initialize(const QRectF &rect, int depth) |
| { |
| this->rect = rect; |
| leafCnt = 0; |
| nodes.resize((1 << (depth + 1)) - 1); |
| nodes.fill(Node()); |
| leaves.resize(1 << 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) |
| { |
| insertVisitor->item = item; |
| climbTree(insertVisitor, rect); |
| } |
| |
| void QGraphicsSceneBspTree::removeItem(QGraphicsItem *item, const QRectF &rect) |
| { |
| removeVisitor->item = item; |
| climbTree(removeVisitor, 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 *> tmp; |
| findVisitor->foundItems = &tmp; |
| findVisitor->onlyTopLevelItems = onlyTopLevelItems; |
| climbTree(findVisitor, rect); |
| // Reset discovery bits. |
| for (int i = 0; i < tmp.size(); ++i) |
| tmp.at(i)->d_ptr->itemDiscovered = 0; |
| return tmp; |
| } |
| |
| 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().x(); |
| } |
| |
| 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++; |
| } |
| } |
| |
| void QGraphicsSceneBspTree::climbTree(QGraphicsSceneBspTreeVisitor *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->visit(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::Horizontal) { |
| 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 |