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

gaissmai / bart
95%
main: 95%

Build:
Build:
LAST BUILD BRANCH: devel
DEFAULT BRANCH: main
Repo Added 28 Jan 2024 04:47PM UTC
Token o8yVWgxNpXZkttZUhfOnVzDnjSHNLDDH4 regen
Build 2297 Last
Files 15
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

LAST BUILD ON BRANCH devel
branch: SELECT
CHANGE BRANCH
x
Sync Branches
  • No branch selected
  • backport
  • bs2
  • c2
  • coderabbitai/docstrings/1496043
  • coderabbitai/docstrings/ed5afde
  • coderabbitai/docstrings/f4590ab
  • dependabot/github_actions/actions/checkout-4
  • dependabot/github_actions/actions/checkout-5
  • dependabot/github_actions/actions/checkout-6
  • dependabot/github_actions/actions/checkout-7
  • dependabot/github_actions/actions/setup-go-5
  • dependabot/github_actions/actions/setup-go-6
  • dependabot/github_actions/actions/setup-go-7
  • dependabot/github_actions/golangci/golangci-lint-action-6
  • dependabot/github_actions/golangci/golangci-lint-action-7
  • dependabot/github_actions/golangci/golangci-lint-action-8
  • dependabot/github_actions/golangci/golangci-lint-action-9
  • dependabot/go_modules/github.com/bits-and-blooms/bitset-1.14.2
  • dependabot/go_modules/github.com/bits-and-blooms/bitset-1.14.3
  • dependabot/go_modules/github.com/bits-and-blooms/bitset-1.15.0
  • dependabot/go_modules/github.com/bits-and-blooms/bitset-1.16.0
  • dependabot/go_modules/github.com/bits-and-blooms/bitset-1.17.0
  • dependabot/go_modules/github.com/bits-and-blooms/bitset-1.18.0
  • devel
  • fastacl
  • fb-bitsetart
  • fb-genericserialize
  • fb-internalnodes
  • fb-overlaps
  • fb-slimnode
  • fix-365
  • gaissmai-patch-1
  • gaissmai-patch-2
  • json_dump
  • lite2
  • main
  • maisem/union
  • mergesteps
  • movetest
  • poc-unsafe-contains
  • readme
  • remove-toolchain-line
  • revert
  • s1-devel

27 Oct 2026 11:03AM UTC coverage: 94.726%. Remained the same
40493326152

push

github

gaissmai
wip: base_index test

3808 of 4020 relevant lines covered (94.73%)

0.95 hits per line

Relevant lines Covered
Build:
Build:
4020 RELEVANT LINES 3808 COVERED LINES
0.95 HITS PER LINE
Source Files on main
  • Tree
  • List 15
  • Changed 0
  • Source Changed 0
  • Coverage Changed 0
Coverage ∆ File Lines Relevant Covered Missed Hits/Line

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
40493326152 devel wip: base_index test push 27 Oct 2026 11:04AM UTC gaissmai github
94.73
40464873086 devel wip: base_index push 27 Oct 2026 07:04AM UTC gaissmai github
94.73
40413196309 devel docs(lpm): enhance documentation and code examples for precomputed lookup table - Improve Godoc comments and code explanations detailing the complete binary tree structure and ancestor relationships for LPM. - Update code templates and examples... push 26 Oct 2026 10:32PM UTC gaissmai github
94.74
40398797592 devel doc: typo push 26 Oct 2026 08:48PM UTC gaissmai github
94.74
40369554937 main refactor: Remove bart.Fast, rely on the rank cache in sparse.Array256 sparse.Array256 carries its own rank cache now, so a rank needs one popcount instead of four. Get and MustGet take about 35-45% less time than the former Rank based versions (m... push 26 Oct 2026 05:32PM UTC gaissmai github
94.74
40369200251 devel refactor: Remove bart.Fast, rely on the rank cache in sparse.Array256 sparse.Array256 carries its own rank cache now, so a rank needs one popcount instead of four. Get and MustGet take about 35-45% less time than the former Rank based versions (m... Pull #440 26 Oct 2026 05:30PM UTC gaissmai github
94.74
40368034050 devel refactor: Remove bart.Fast, rely on the rank cache in sparse.Array256 sparse.Array256 carries its own rank cache now, so a rank needs one popcount instead of four. Get and MustGet take about 35-45% less time than the former Rank based versions (m... Pull #440 26 Oct 2026 05:23PM UTC gaissmai github
94.74
40366188620 devel refactor: Remove bart.Fast, rely on the rank cache in sparse.Array256 sparse.Array256 carries its own rank cache now, so a rank needs one popcount instead of four. Get and MustGet take about 35-45% less time than the former Rank based versions (m... Pull #440 26 Oct 2026 05:11PM UTC gaissmai github
94.74
40366197696 devel refactor: Remove bart.Fast, rely on the rank cache in sparse.Array256 sparse.Array256 carries its own rank cache now, so a rank needs one popcount instead of four. Get and MustGet take about 35-45% less time than the former Rank based versions (m... Pull #440 26 Oct 2026 05:11PM UTC gaissmai github
94.74
40285212291 devel refactor: Remove bart.Fast, rely on the rank cache in sparse.Array256 sparse.Array256 carries its own rank cache now, so a rank needs one popcount instead of four. Get and MustGet take about 35-45% less time than the former Rank based versions (m... Pull #440 26 Oct 2026 07:21AM UTC gaissmai github
94.74
See All Builds (1919)
  • Settings
  • Repo on GitHub
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE TRIAL · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc