use pre-computed lookup table for prefixToBaseIdx

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

26 stars 3 forks source link

use pre-computed lookup table for prefixToBaseIdx #56

Closed gaissmai closed 3 months ago

gaissmai commented 3 months ago

squeezed out a little more ops/sec with lookup table
simplify method naming

coveralls commented 3 months ago

Pull Request Test Coverage Report for Build 9357233728

Details

41 of 41 (100.0%) changed or added relevant lines in 4 files are covered.
3 unchanged lines in 1 file lost coverage.
Overall coverage decreased (-0.1%) to 95.868%

Files with Coverage Reduction	New Missed Lines	%
node.go	3	96.21%
<!--	Total:	3		-->

Totals
Change from base Build 9352679638:	-0.1%
Covered Lines:	1160
Relevant Lines:	1210

gaissmai / bart

use pre-computed lookup table for prefixToBaseIdx #56

Pull Request Test Coverage Report for Build 9357233728

Details

💛 - Coveralls