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

stillwater-sc / universal / 23771903248
85%
master: 84%

Build:
Build:
LAST BUILD BRANCH: feat/issue-1079-phase5-suites
DEFAULT BRANCH: master
Ran 30 Mar 2026 11:30PM UTC
Jobs 1
Files 630
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

30 Mar 2026 11:01PM UTC coverage: 84.343% (-0.02%) from 84.358%
23771903248

push

github

web-flow
feat(ucalc): DBNS double-base steps visualization (#682)

* feat(ucalc): DBNS double-base steps visualization (#659)

Add DBNS-specific step-by-step arithmetic decomposition showing:

Multiplication (trivial):
  1. Decompose: sign, (a,b) exponent pairs for bases 2 and 3
  2. XOR signs
  3. Add exponent pairs: (a1+a2, b1+b2)
     "two integer adds -- no multiplier needed, like LNS but denser grid"

Addition (complex):
  1. Decompose operands
  2. Factor out common powers of 2 and 3
  3. Add residuals (requires evaluation)
  4. Re-encode as DBNS

Division: subtract exponent pairs (trivial).

Also:
- Register dbns8 and dbns16 types in ucalc registry
- Add DBNS_THROW_ARITHMETIC_EXCEPTION suppression
- Implement missing dbns::sqrt via double conversion (forward decl
  existed without implementation, causing linker failure)

This completes all 8 phases of step-by-step arithmetic visualization
(parent #631).

Resolves #659

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

* fix(ucalc): replace __int128 with double for portable fixpnt multiply

__int128 triggers -Wpedantic warnings and isn't available on MSVC.
Since this is educational display code, double (53-bit mantissa) is
adequate for fixpnt up to ~26-bit operands and fully cross-platform.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

* fix(ucalc): zero handling and dynamic search range in DBNS steps

Two fixes:

1. Critical: zero decomposition now sets is_zero flag and displays
   "0" instead of "+2^0 * 3^0 = 1". Addition residual computation
   also checks is_zero to avoid evaluating 2^0 * 3^0 for zero.

2. Search range for base-3 exponent derived from magnitude
   (b_center = round(log3(|v|)), +/- 10) instead of fixed [-8, 8],
   so larger dbns16 values find correct decompositions.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

---------

Co-authored-by: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

44582 of 52858 relevant lines covered (84.34%)

6104876.9 hits per line

Coverage Regressions

Lines Coverage ∆ File
10
31.43
-3.57% include/sw/universal/verification/test_suite_randoms.hpp
Jobs
ID Job ID Ran Files Coverage
1 23771903248.1 30 Mar 2026 11:30PM UTC 630
84.34
GitHub Action Run
Source Files on build 23771903248
  • Tree
  • List 630
  • Changed 3
  • Source Changed 1
  • Coverage Changed 2
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Repo
  • Github Actions Build #23771903248
  • 5d5c3ae2 on github
  • Prev Build on main (#23769032919)
  • Next Build on main (#23777246976)
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