| commit | 658708520d88e48f914a28e86748821974b0b09d | |
| author | Peter Clifton <pcjc2@cam.ac.uk> | |
| Mon, 13 Oct 2008 19:21:19 +0000 (13 19:21 +0000) | ||
| committer | Peter Clifton <pcjc2@cam.ac.uk> | |
| Mon, 13 Oct 2008 19:21:19 +0000 (13 19:21 +0000) | ||
| tree | 9c90818d400a26a5af531a976b532aec7617c548 | treesnapshot (tar.gz zip) |
| parent | f6cd7e592e468d2554409275a587dab97859fb79 | commitdiff |
Check all r-tree node children for fit before working out penalties
Working out the penalty involves multiplications which produce a
"long long" result, and is seen to be appear in profiling.
Make a pass at testing all children for the fast case of the child
node containing the desired box, before working out size penalties
to expanding each child.
Working out the penalty involves multiplications which produce a
"long long" result, and is seen to be appear in profiling.
Make a pass at testing all children for the fast case of the child
node containing the desired box, before working out size penalties
to expanding each child.
| src/rtree.c | diffblobblamehistory |