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

make Walk() fit for range-over-func #30

Closed gaissmai closed 4 months ago

coveralls commented 4 months ago

Pull Request Test Coverage Report for Build 8889836766

Warning: This coverage report may be inaccurate.

This pull request's base commit is no longer the HEAD commit of its target branch. This means it includes changes from outside the original pull request, including, potentially, unrelated coverage changes.

Details


Changes Missing Coverage Covered Lines Changed/Added Lines %
table.go 7 9 77.78%
<!-- Total: 15 17 88.24% -->
Files with Coverage Reduction New Missed Lines %
table.go 2 96.82%
<!-- Total: 2 -->
Totals Coverage Status
Change from base Build 8836925002: -0.4%
Covered Lines: 1069
Relevant Lines: 1122

💛 - Coveralls