| boundingBox() const | KoRTree< T >::Node | [inline, virtual] |
| childBoundingBox(int index) const | KoRTree< T >::Node | [inline, virtual] |
| childCount() const | KoRTree< T >::Node | [inline, virtual] |
| chooseLeaf(const QRectF &bb)=0 | KoRTree< T >::Node | [pure virtual] |
| chooseNode(const QRectF &bb, int level)=0 | KoRTree< T >::Node | [pure virtual] |
| clear() | KoRTree< T >::Node | [virtual] |
| contains(const QPointF &point, QMap< int, T > &result) const =0 | KoRTree< T >::Node | [pure virtual] |
| intersects(const QRectF &rect, QMap< int, T > &result) const =0 | KoRTree< T >::Node | [pure virtual] |
| isLeaf() const | KoRTree< T >::Node | [inline, virtual] |
| isRoot() const | KoRTree< T >::Node | [inline, virtual] |
| keys(QList< QRectF > &result) const =0 | KoRTree< T >::Node | [pure virtual] |
| level() const | KoRTree< T >::Node | [inline, virtual] |
| m_boundingBox | KoRTree< T >::Node | [protected] |
| m_childBoundingBox | KoRTree< T >::Node | [protected] |
| m_counter | KoRTree< T >::Node | [protected] |
| m_level | KoRTree< T >::Node | [protected] |
| m_parent | KoRTree< T >::Node | [protected] |
| m_place | KoRTree< T >::Node | [protected] |
| move(Node *node, int index)=0 | KoRTree< T >::Node | [pure virtual] |
| Node(int capacity, int level, Node *parent) | KoRTree< T >::Node | |
| parent() const | KoRTree< T >::Node | [inline, virtual] |
| place() const | KoRTree< T >::Node | [inline, virtual] |
| remove(int index) | KoRTree< T >::Node | [virtual] |
| setChildBoundingBox(int index, const QRectF &rect) | KoRTree< T >::Node | [inline, virtual] |
| setLevel(int level) | KoRTree< T >::Node | [inline, virtual] |
| setParent(Node *parent) | KoRTree< T >::Node | [inline, virtual] |
| setPlace(int place) | KoRTree< T >::Node | [inline, virtual] |
| updateBoundingBox() | KoRTree< T >::Node | [virtual] |
| values(QMap< int, T > &result) const =0 | KoRTree< T >::Node | [pure virtual] |
| ~Node() | KoRTree< T >::Node | [inline, virtual] |
