adjustTree(Node *node1, Node *node2) | KoRTree< T > | [protected] |
condenseTree(Node *node, QVector< Node * > &reinsert) | KoRTree< T > | [protected] |
contains(const QPointF &point) const | KoRTree< T > | |
createLeafNode(int capacity, int level, Node *parent) | KoRTree< T > | [inline, protected, virtual] |
createNoneLeafNode(int capacity, int level, Node *parent) | KoRTree< T > | [inline, protected, virtual] |
insert(const QRectF &bb, const T &data) | KoRTree< T > | [virtual] |
insert(Node *node) | KoRTree< T > | [protected] |
insertHelper(const QRectF &bb, const T &data, int id) | KoRTree< T > | [protected] |
intersects(const QRectF &rect) const | KoRTree< T > | [virtual] |
keys() const | KoRTree< T > | |
KoRTree(int capacity, int minimum) | KoRTree< T > | |
m_capacity | KoRTree< T > | [protected] |
m_leafMap | KoRTree< T > | [protected] |
m_minimum | KoRTree< T > | [protected] |
m_root | KoRTree< T > | [protected] |
pickNext(Node *node, QVector< bool > &marker, Node *group1, Node *group2) | KoRTree< T > | [protected] |
pickSeeds(Node *node) | KoRTree< T > | [protected] |
remove(const T &data) | KoRTree< T > | |
splitNode(Node *node) | KoRTree< T > | [protected] |
values() const | KoRTree< T > | |
~KoRTree() | KoRTree< T > | [virtual] |