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

ossuminc / riddl / 21175859553
65%

Build:
DEFAULT BRANCH: main
Ran 20 Jan 2026 02:53PM UTC
Jobs 1
Files 139
Run time 1min
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

20 Jan 2026 02:49PM UTC coverage: 65.22% (-8.3%) from 73.497%
21175859553

push

web-flow
Release: BAST Serialization Complete (Phases 1-8) (#718)

* Improve test coverage. Update copyright year to 2026
and refactor metadata-related field documentation in the AST.

* Extract magic numbers to named constants in tests

Improve test readability and maintainability by replacing 41 magic number instances with 26 well-named constants across 6 test files. Add comprehensive test coverage documentation tracking 743 passing tests and 3 production bugs fixed.

šŸ¤– Generated with [Claude Code](https://claude.com/claude-code)

Co-Authored-By: Claude Sonnet 4.5 <noreply@anthropic.com>

* Add Phase 1 performance optimizations with 2500x speedup

Implement three high-impact, low-effort optimizations:

1. Line lookup caching in RiddlParserInput (4-entry LRU cache)
   - Optimizes sequential line number lookups during parsing
   - Minimal memory overhead: 64 bytes per input

2. Capacity hints for SeqHelpers.allUnique()
   - Pre-allocates HashSet based on sequence size
   - 20% speedup on Vector sequences

3. Result caching for Finder.findByType()
   - Caches AST traversal results by type
   - 2500x speedup on repeated lookups (25ms → 0.01ms)

Performance benchmarks show:
- dokn.riddl parses in 29ms (target: <100ms)
- 1000-type file: 1258x cache speedup
- All 743 existing tests passing
- 10 new benchmark tests validate improvements

šŸ¤– Generated with [Claude Code](https://claude.com/claude-code)

Co-Authored-By: Claude Sonnet 4.5 <noreply@anthropic.com>

* Add Phase 2 performance optimizations

Implement four medium-effort optimizations:

1. ArrayBuffer accumulation in Finder.findWithParents()
   - Eliminates O(n²) complexity from :+ operator
   - Uses O(1) amortized ArrayBuffer append
   - Convert to immutable Seq only at the end

2. HashSet for URL duplicate tracking in ParsingContext
   - O(1) add/contains operations vs O(n) for ListBuffer
   - More efficient duplicate URL detection during parsing

3. groupBy for duplicate include detection
   - O(n) single p... (continued)

1502 of 3160 new or added lines in 36 files covered. (47.53%)

802 existing lines in 40 files now uncovered.

6539 of 10026 relevant lines covered (65.22%)

0.65 hits per line

Jobs
ID Job ID Ran Files Coverage
1 21175859553.1 20 Jan 2026 02:53PM UTC 139
65.22
Source Files on build 21175859553
  • Tree
  • List 139
  • Changed 64
  • Source Changed 0
  • Coverage Changed 64
Coverage āˆ† File Lines Relevant Covered Missed Hits/Line
  • Back to Repo
  • fbe82156 on github
  • Prev Build on main (#12124032764)
  • Next Build on main (#21176933808)
  • Delete
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc