#include <KoRTree.h>

Inheritance diagram for KoRTree< T >::NonLeafNode:

Public Member Functions
LeafNode *	chooseLeaf (const QRectF &bb) override

NonLeafNode *	chooseNode (const QRectF &bb, int level) override

void	contained (const QRectF &point, QMap< int, T > &result) const override

void	contains (const QPointF &point, QMap< int, T > &result) const override

virtual Node *	getNode (int index) const

virtual void	insert (const QRectF &bb, Node *data)

void	intersects (const QRectF &rect, QMap< int, T > &result) const override

void	keys (QList< QRectF > &result) const override

void	move (Node *node, int index) override

	NonLeafNode (int capacity, int level, Node *parent)

void	remove (int index) override

void	values (QMap< int, T > &result) const override

	~NonLeafNode () override

Public Member Functions inherited from KoRTree< T >::Node
virtual const QRectF &	boundingBox () const

virtual const QRectF &	childBoundingBox (int index) const

virtual int	childCount () const

virtual void	clear ()

virtual bool	isLeaf () const

virtual bool	isRoot () const

virtual int	level () const

	Node (int capacity, int level, Node *parent)

virtual Node *	parent () const

virtual int	place () const

virtual void	setChildBoundingBox (int index, const QRectF &rect)

virtual void	setLevel (int level)

virtual void	setParent (Node *parent)

virtual void	setPlace (int place)

virtual void	updateBoundingBox ()

virtual	~Node ()

Protected Member Functions
virtual Node *	getLeastEnlargement (const QRectF &bb) const

Protected Attributes
QVector< Node * >	m_childs

Protected Attributes inherited from KoRTree< T >::Node
QRectF	m_boundingBox

QVector< QRectF >	m_childBoundingBox

int	m_counter

int	m_level

Node *	m_parent

int	m_place

Detailed Description

template<typename T>
class KoRTree< T >::NonLeafNode

Definition at line 245 of file KoRTree.h.

Constructor & Destructor Documentation

◆ NonLeafNode()

template<typename T >

KoRTree< T >::NonLeafNode::NonLeafNode	(	int	capacity,
		int	level,
		Node *	parent )

Definition at line 833 of file KoRTree.h.

        : Node(capacity, level, parent)
        , m_childs(capacity)
{
    //debugFlake << "NonLeafNode::NonLeafNode()" << this;
}

◆ ~NonLeafNode()

template<typename T >

KoRTree< T >::NonLeafNode::~NonLeafNode ( )

override

Definition at line 841 of file KoRTree.h.

{
    //debugFlake << "NonLeafNode::~NonLeafNode()" << this;
    for (int i = 0; i < this->m_counter; ++i) {
        delete m_childs[i];
    }
}

Member Function Documentation

◆ chooseLeaf()

template<typename T >

KoRTree< T >::LeafNode * KoRTree< T >::NonLeafNode::chooseLeaf ( const QRectF & bb )

overridevirtual

Implements KoRTree< T >::Node.

Definition at line 883 of file KoRTree.h.

{
    return getLeastEnlargement(bb)->chooseLeaf(bb);
}

References KoRTree< T >::LeafNode::chooseLeaf().

◆ chooseNode()

template<typename T >

KoRTree< T >::NonLeafNode * KoRTree< T >::NonLeafNode::chooseNode	(	const QRectF &	bb,
		int	level )

overridevirtual

Implements KoRTree< T >::Node.

Definition at line 889 of file KoRTree.h.

{
    if (this->m_level > level) {
        return getLeastEnlargement(bb)->chooseNode(bb, level);
    } else {
        return this;
    }
 
}

References KoRTree< T >::NonLeafNode::chooseNode().

◆ contained()

template<typename T >

void KoRTree< T >::NonLeafNode::contained	(	const QRectF &	point,
		QMap< int, T > &	result ) const

overridevirtual

Implements KoRTree< T >::Node.

Definition at line 920 of file KoRTree.h.

{
    for (int i = 0; i < this->m_counter; ++i) {
        if (this->m_childBoundingBox[i].intersects(rect)) {
            m_childs[i]->contained(rect, result);
        }
    }
}

References KoRTree< T >::intersects().

◆ contains()

template<typename T >

void KoRTree< T >::NonLeafNode::contains	(	const QPointF &	point,
		QMap< int, T > &	result ) const

overridevirtual

Implements KoRTree< T >::Node.

Definition at line 910 of file KoRTree.h.

{
    for (int i = 0; i < this->m_counter; ++i) {
        if (this->m_childBoundingBox[i].contains(point)) {
            m_childs[i]->contains(point, result);
        }
    }
}

References KoRTree< T >::contains().

◆ getLeastEnlargement()

template<typename T >

KoRTree< T >::Node * KoRTree< T >::NonLeafNode::getLeastEnlargement ( const QRectF & bb ) const

protectedvirtual

Definition at line 952 of file KoRTree.h.

{
    //debugFlake << "NonLeafNode::getLeastEnlargement";
    QVarLengthArray<qreal> area(this->m_counter);
    for (int i = 0; i < this->m_counter; ++i) {
        QSizeF big(this->m_childBoundingBox[i].united(bb).size());
        area[i] = big.width() * big.height() - this->m_childBoundingBox[i].width() * this->m_childBoundingBox[i].height();
    }
 
    int minIndex = 0;
    qreal minArea = area[minIndex];
    //debugFlake << " min" << minIndex << minArea;
 
    for (int i = 1; i < this->m_counter; ++i) {
        if (area[i] < minArea) {
            minIndex = i;
            minArea = area[i];
            //debugFlake << " min" << minIndex << minArea;
        }
    }
 
    return m_childs[minIndex];
}

◆ getNode()

template<typename T >

KoRTree< T >::Node * KoRTree< T >::NonLeafNode::getNode ( int index ) const

virtual

Definition at line 946 of file KoRTree.h.

{
    return m_childs[index];
}

◆ insert()

template<typename T >

void KoRTree< T >::NonLeafNode::insert	(	const QRectF &	bb,
		Node *	data )

virtual

Definition at line 850 of file KoRTree.h.

{
    m_childs[this->m_counter] = data;
    data->setPlace(this->m_counter);
    data->setParent(this);
    this->m_childBoundingBox[this->m_counter] = bb;
    this->m_boundingBox = this->m_boundingBox.united(bb);
    //debugFlake << "NonLeafNode::insert" << this->nodeId() << data->nodeId();
    ++this->m_counter;
}

References KoRTree< T >::Node::setParent(), and KoRTree< T >::Node::setPlace().

◆ intersects()

template<typename T >

void KoRTree< T >::NonLeafNode::intersects	(	const QRectF &	rect,
		QMap< int, T > &	result ) const

overridevirtual

Implements KoRTree< T >::Node.

Definition at line 900 of file KoRTree.h.

{
    for (int i = 0; i < this->m_counter; ++i) {
        if (this->m_childBoundingBox[i].intersects(rect)) {
            m_childs[i]->intersects(rect, result);
        }
    }
}

References KoRTree< T >::intersects(), and KoRTree< T >::NonLeafNode::intersects().

◆ keys()

template<typename T >

void KoRTree< T >::NonLeafNode::keys ( QList< QRectF > & result ) const

overridevirtual

Implements KoRTree< T >::Node.

Definition at line 930 of file KoRTree.h.

{
    for (int i = 0; i < this->m_counter; ++i) {
        m_childs[i]->keys(result);
    }
}

◆ move()

template<typename T >

void KoRTree< T >::NonLeafNode::move	(	Node *	node,
		int	index )

overridevirtual

Implements KoRTree< T >::Node.

Definition at line 872 of file KoRTree.h.

{
    //debugFlake << "NonLeafNode::move" << this << node << index << node->nodeId() << "->" << this->nodeId();
    NonLeafNode * n = dynamic_cast<NonLeafNode *>(node);
    if (n) {
        QRectF bb = n->childBoundingBox(index);
        insert(bb, n->getNode(index));
    }
}

References KoRTree< T >::Node::childBoundingBox(), KoRTree< T >::NonLeafNode::getNode(), and KoRTree< T >::insert().

◆ remove()

template<typename T >

void KoRTree< T >::NonLeafNode::remove ( int index )

overridevirtual

Reimplemented from KoRTree< T >::Node.

Definition at line 862 of file KoRTree.h.

{
    for (int i = index + 1; i < this->m_counter; ++i) {
        m_childs[i-1] = m_childs[i];
        m_childs[i-1]->setPlace(i - 1);
    }
    Node::remove(index);
}

References Node::remove().

◆ values()

template<typename T >

void KoRTree< T >::NonLeafNode::values ( QMap< int, T > & result ) const

overridevirtual

Implements KoRTree< T >::Node.

Definition at line 938 of file KoRTree.h.

{
    for (int i = 0; i < this->m_counter; ++i) {
        m_childs[i]->values(result);
    }
}

Member Data Documentation

◆ m_childs

template<typename T >

QVector<Node *> KoRTree< T >::NonLeafNode::m_childs

protected

Definition at line 274 of file KoRTree.h.

The documentation for this class was generated from the following file:

libs/flake/KoRTree.h

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

◆ NonLeafNode()

◆ ~NonLeafNode()

Member Function Documentation

◆ chooseLeaf()

◆ chooseNode()

◆ contained()

◆ contains()

◆ getLeastEnlargement()

◆ getNode()

◆ insert()

◆ intersects()

◆ keys()

◆ move()

◆ remove()

◆ values()

Member Data Documentation

◆ m_childs