• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

peterstace / simplefeatures / 5192735111
91%
master: 71%

Build:
Build:
LAST BUILD BRANCH: optimize_disjoint_envelope_overlay
DEFAULT BRANCH: master
Ran 06 Jun 2023 08:03PM UTC
Jobs 1
Files 61
Run time 14s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

pending completion
5192735111

push

github

peterstace
Simplify the bulk load algorithm

The previous bulk loading algorithm needed to keep the number of levels
consistent in the r-tree consistent (i.e. every leaf node had to be the
same distance from the root). This as a constraint required for the
`Insert` and `Delete` methods. Because those methods no longer exist, we
can greatly simplify the bulk loading algorithm.

With the simplified algorithm, the distance between the root and the
leaf nodes will differ by at most 1 level. Nodes are now packed much
more tightly, which reduces memory usage for some trees (but DOESN'T
improve CPU performance).

7661 of 8394 relevant lines covered (91.27%)

32254.93 hits per line

Jobs
ID Job ID Ran Files Coverage
1 5192735111.1 06 Jun 2023 08:03PM UTC 0
91.27
GitHub Action Run
Source Files on build 5192735111
Detailed source file information is not available for this build.
  • Back to Repo
  • 5e01de53 on github
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc