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
34 stars 3 forks source link

replace init with nil check in reader methods #20

Closed gaissmai closed 7 months ago

gaissmai commented 7 months ago

Save some cpu cycles in reader methods.

Updates #15

coveralls commented 7 months ago

Pull Request Test Coverage Report for Build 8485014960

Details


Changes Missing Coverage Covered Lines Changed/Added Lines %
table.go 8 14 57.14%
<!-- Total: 8 14 57.14% -->
Files with Coverage Reduction New Missed Lines %
node.go 3 95.8%
<!-- Total: 3 -->
Totals Coverage Status
Change from base Build 8458610018: -1.0%
Covered Lines: 880
Relevant Lines: 924

💛 - Coveralls