gaissmai / bart

The Balanced Routing Table is an adaptation of D. Knuth's ART algorithm combined with popcount level compression and backtracking. It is somewhat slower than ART, but requires considerably less memory.
MIT License
33 stars 3 forks source link

Size() was broken for Union() #44

Closed gaissmai closed 5 months ago

gaissmai commented 5 months ago

It makes the algorithm for union unnecessarily complex to keep this up to date as a struct member, so I decided to use the calculation.

coveralls commented 5 months ago

Pull Request Test Coverage Report for Build 9075245115

Details


Totals Coverage Status
Change from base Build 9070347900: 0.2%
Covered Lines: 1046
Relevant Lines: 1099

💛 - Coveralls