| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
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.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Also, abstract cpu counting into dedicated dmnsn_ncpus() function.
|
| |
|
| |
|
| |
|
|
|
|
| |
The old way made O(n) PR-trees for no particular reason.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Also, use PR-trees for unions internally.
|