diff options
| author | Andreas Aardal Hanssen <andreas.aardal.hanssen@nokia.com> | 2009-06-02 14:07:51 (GMT) |
|---|---|---|
| committer | Andreas Aardal Hanssen <andreas.aardal.hanssen@nokia.com> | 2009-06-09 07:31:07 (GMT) |
| commit | fe640c1245075cabdafa88a16bdd33f9b49452c0 (patch) | |
| tree | b1e9aac160c5d32805f19e07c580dc6b6af49b7a /util | |
| parent | 6f218ce216021ff2e8ecf828b2f29b1b9d82b401 (diff) | |
| download | Qt-fe640c1245075cabdafa88a16bdd33f9b49452c0.zip Qt-fe640c1245075cabdafa88a16bdd33f9b49452c0.tar.gz Qt-fe640c1245075cabdafa88a16bdd33f9b49452c0.tar.bz2 | |
A faster item discovery function for rectangles (recursive).
This function works much faster than the last one, but still it can be
much faster. The main expense right now it seems is the transform
calculations, and the item->collidesWithPath call. There's still much
to gain here.
This function does not make use of the BSP tree's fast lookup so it makes
lookups slower in (e.g.) the chip demo.
Diffstat (limited to 'util')
0 files changed, 0 insertions, 0 deletions