| Commit message (Collapse) | Author | Age | Files | Lines |
... | |
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
| |
A quick experiment shows that arrays average less than 2 elements, and this helps
a bit with the memory-hogginess of the parser.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Grab priority leaves all at once instead of round-robin.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
| |
To avoid testing degenerate boxes, set prtree->root to NULL when
the tree contains no bounded objects.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
This saves us nearly a factor of 2, and I feel silly for not doing this before.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|