MuseScore/libmscore/bsp.cpp

352 lines
11 KiB
C++
Raw Normal View History

2012-05-26 14:26:10 +02:00
//=============================================================================
// MuseScore
// Music Composition & Notation
//
// Copyright (C) 2007-2011 Werner Schweer
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License version 2
// as published by the Free Software Foundation and appearing in
// the file LICENCE.GPL
//
// This code is from Qt implementation of QGraphicsItem
// Copyright (C) 1992-2007 Trolltech ASA. All rights reserved.
//=============================================================================
#include "bsp.h"
#include "element.h"
2013-05-13 18:49:17 +02:00
namespace Ms {
2012-05-26 14:26:10 +02:00
//---------------------------------------------------------
// InsertItemBspTreeVisitor
//---------------------------------------------------------
class InsertItemBspTreeVisitor : public BspTreeVisitor
{
public:
Element* item;
2012-05-26 14:26:10 +02:00
inline void visit(QList<Element*> *items) { items->prepend(item); }
2012-05-26 14:26:10 +02:00
};
//---------------------------------------------------------
// RemoveItemBspTreeVisitor
//---------------------------------------------------------
class RemoveItemBspTreeVisitor : public BspTreeVisitor
{
public:
Element* item;
2012-05-26 14:26:10 +02:00
inline void visit(QList<Element*> *items) { items->removeAll(item); }
2012-05-26 14:26:10 +02:00
};
//---------------------------------------------------------
// FindItemBspTreeVisitor
//---------------------------------------------------------
class FindItemBspTreeVisitor : public BspTreeVisitor
{
public:
QList<Element*> foundItems;
2012-05-26 14:26:10 +02:00
void visit(QList<Element*>* items) {
2012-05-26 14:26:10 +02:00
for (int i = 0; i < items->size(); ++i) {
Element* item = items->at(i);
2012-05-26 14:26:10 +02:00
if (!item->itemDiscovered) {
2014-01-03 12:09:23 +01:00
item->itemDiscovered = true;
foundItems.prepend(item);
2012-05-26 14:26:10 +02:00
}
}
}
};
//---------------------------------------------------------
// BspTree
//---------------------------------------------------------
BspTree::BspTree()
: leafCnt(0)
{
depth = 0;
}
//---------------------------------------------------------
// intmaxlog
//---------------------------------------------------------
static inline int intmaxlog(int n)
{
return (n > 0 ? qMax(int(::ceil(::log(qreal(n))/::log(qreal(2)))), 5) : 0);
}
//---------------------------------------------------------
// initialize
//---------------------------------------------------------
void BspTree::initialize(const QRectF& rect, int n)
{
depth = intmaxlog(n);
this->rect = rect;
leafCnt = 0;
nodes.resize((1 << (depth+1)) - 1);
leaves.resize(1 << depth);
leaves.fill(QList<Element*>());
2012-05-26 14:26:10 +02:00
initialize(rect, depth, 0);
}
//---------------------------------------------------------
// clear
//---------------------------------------------------------
void BspTree::clear()
{
leafCnt = 0;
nodes.clear();
leaves.clear();
}
//---------------------------------------------------------
// insert
//---------------------------------------------------------
void BspTree::insert(Element* element)
2012-05-26 14:26:10 +02:00
{
InsertItemBspTreeVisitor insertVisitor;
insertVisitor.item = element;
climbTree(&insertVisitor, element->pageBoundingRect());
2012-05-26 14:26:10 +02:00
}
//---------------------------------------------------------
// remove
//---------------------------------------------------------
void BspTree::remove(Element* element)
2012-05-26 14:26:10 +02:00
{
RemoveItemBspTreeVisitor removeVisitor;
removeVisitor.item = element;
climbTree(&removeVisitor, element->pageBoundingRect());
2012-05-26 14:26:10 +02:00
}
//---------------------------------------------------------
// items
//---------------------------------------------------------
QList<Element*> BspTree::items(const QRectF& rect)
2012-05-26 14:26:10 +02:00
{
FindItemBspTreeVisitor findVisitor;
climbTree(&findVisitor, rect);
QList<Element*> l;
for (Element * e : findVisitor.foundItems) {
e->itemDiscovered = false;
if (e->pageBoundingRect().intersects(rect))
l.append(e);
}
return l;
2012-05-26 14:26:10 +02:00
}
//---------------------------------------------------------
// items
//---------------------------------------------------------
QList<Element*> BspTree::items(const QPointF& pos)
2012-05-26 14:26:10 +02:00
{
FindItemBspTreeVisitor findVisitor;
climbTree(&findVisitor, pos);
2012-05-26 14:26:10 +02:00
QList<Element*> l;
2014-01-03 12:09:23 +01:00
for (Element* e : findVisitor.foundItems) {
e->itemDiscovered = false;
2012-05-26 14:26:10 +02:00
if (e->contains(pos))
l.append(e);
}
return l;
}
#ifndef NDEBUG
//---------------------------------------------------------
// debug
//---------------------------------------------------------
QString BspTree::debug(int index) const
{
const Node* node = &nodes.at(index);
QString tmp;
2014-05-21 17:57:19 +02:00
if (node->type == Node::Type::LEAF) {
2012-05-26 14:26:10 +02:00
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 {
2014-05-21 17:57:19 +02:00
if (node->type == Node::Type::HORIZONTAL) {
2012-05-26 14:26:10 +02:00
tmp += debug(firstChildIndex(index));
tmp += debug(firstChildIndex(index) + 1);
}
else {
tmp += debug(firstChildIndex(index));
tmp += debug(firstChildIndex(index) + 1);
}
}
return tmp;
}
#endif
//---------------------------------------------------------
// initialize
//---------------------------------------------------------
void BspTree::initialize(const QRectF& rect, int depth, int index)
{
Node* node = &nodes[index];
if (index == 0) {
2014-05-21 17:57:19 +02:00
node->type = Node::Type::HORIZONTAL;
2012-05-26 14:26:10 +02:00
node->offset = rect.center().x();
}
if (depth) {
Node::Type type;
QRectF rect1, rect2;
qreal offset1, offset2;
2014-05-21 17:57:19 +02:00
if (node->type == Node::Type::HORIZONTAL) {
type = Node::Type::VERTICAL;
2012-05-26 14:26:10 +02:00
rect1.setRect(rect.left(), rect.top(), rect.width(), rect.height() * .5);
rect2.setRect(rect1.left(), rect1.bottom(), rect1.width(), rect.height() - rect1.height());
offset1 = rect1.center().x();
offset2 = rect2.center().x();
}
else {
2014-05-21 17:57:19 +02:00
type = Node::Type::HORIZONTAL;
2012-05-26 14:26:10 +02:00
rect1.setRect(rect.left(), rect.top(), rect.width() * .5, 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 {
2014-05-21 17:57:19 +02:00
node->type = Node::Type::LEAF;
2012-05-26 14:26:10 +02:00
node->leafIndex = leafCnt++;
}
}
//---------------------------------------------------------
// climbTree
//---------------------------------------------------------
void BspTree::climbTree(BspTreeVisitor* visitor, const QPointF& pos, int index)
{
if (nodes.isEmpty())
return;
Node* node = &nodes[index];
int childIndex = firstChildIndex(index);
switch (node->type) {
2014-05-21 17:57:19 +02:00
case Node::Type::LEAF:
2012-05-26 14:26:10 +02:00
visitor->visit(&leaves[node->leafIndex]);
break;
2014-05-21 17:57:19 +02:00
case Node::Type::VERTICAL:
2012-05-26 14:26:10 +02:00
if (pos.x() < node->offset)
climbTree(visitor, pos, childIndex);
else
climbTree(visitor, pos, childIndex + 1);
break;
2014-05-21 17:57:19 +02:00
case Node::Type::HORIZONTAL:
2012-05-26 14:26:10 +02:00
if (pos.y() < node->offset)
climbTree(visitor, pos, childIndex);
else
climbTree(visitor, pos, childIndex + 1);
break;
}
}
//---------------------------------------------------------
// climbTree
//---------------------------------------------------------
void BspTree::climbTree(BspTreeVisitor* visitor, const QRectF& rect, int index)
{
if (nodes.isEmpty())
return;
Node* node = &nodes[index];
int childIndex = firstChildIndex(index);
switch (node->type) {
2014-05-21 17:57:19 +02:00
case Node::Type::LEAF:
2012-05-26 14:26:10 +02:00
visitor->visit(&leaves[node->leafIndex]);
break;
2014-05-21 17:57:19 +02:00
case Node::Type::VERTICAL:
2012-05-26 14:26:10 +02:00
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;
2014-05-21 17:57:19 +02:00
case Node::Type::HORIZONTAL:
2012-05-26 14:26:10 +02:00
int childIndex = firstChildIndex(index);
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);
}
}
}
//---------------------------------------------------------
// rectForIndex
//---------------------------------------------------------
QRectF BspTree::rectForIndex(int index) const
{
if (index <= 0)
return rect;
int parentIdx = parentIndex(index);
QRectF rect = rectForIndex(parentIdx);
const Node *parent = &nodes.at(parentIdx);
2014-05-21 17:57:19 +02:00
if (parent->type == Node::Type::HORIZONTAL) {
2012-05-26 14:26:10 +02:00
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;
}
2013-05-13 18:49:17 +02:00
}