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

stillwater-sc / universal / 37881109786
86%
master: 84%

Build:
Build:
LAST BUILD BRANCH: docs/decimals-of-accuracy
DEFAULT BRANCH: master
Ran 09 Oct 2026 04:35AM UTC
Jobs 1
Files 693
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

09 Oct 2026 03:50AM UTC coverage: 86.349% (+0.009%) from 86.34%
37881109786

push

github

web-flow
feat(poxel): enclosing sqrt for tile_interval and the quadratic-roots application (#1649)

* feat(poxel): enclosing sqrt for tile_interval and the quadratic-roots application

sqrt for tile_interval needs no extra precision. The tile of t * t, for
an exact lattice point t, contains t^2 exactly, so comparing its key
with v orders t^2 against v without rounding. A bisection over the
lattice finds the largest t with t^2 <= v. sqrt(v) is t itself if t * t
is exactly v, and otherwise lies in the open tile above t.
- The interval sqrt applies this at both ends, since sqrt is monotone.
  Open ends stay open.
- An interval reaching below zero is restricted to its non-negative
  part; one entirely below zero gives nan.
- tile_sqrt is the single-tile, sticky-flag counterpart.
- Tests: every tile and small hull of poxel<8,0>, poxel<9,2>,
  areal<8,2> and areal<9,3>, checked exactly as L^2 <= x <= U^2 with
  strict open ends. Exact inputs must give the single containing tile,
  in agreement with tile_sqrt.
- Five mutations are caught: never the open tile above, a strict search
  comparison, an open lower end not moved inward, the wrong neighbour
  for an open upper end, and an upper end one tile too far in.

applications/precision/ubit/quadratic_roots.cpp bounds both roots of
3x^2 + 100x + 2 by the quadratic formula (The End of Error, pp. 181-184).
- It compares half, posit, float and double (relative errors), single
  tiles, and tile intervals at 16, 32 and 64 bits (equal storage).
- Each root is computed by the textbook formula and by the stable
  r1 = 2c / (-b - sqrt(d)).
- Inputs are exact, or ULP-wide (the open tile above 3, 100 and 2).
- Every enclosure is verified exactly in einteger arithmetic: signs of
  q(x) and q'(x) at the dyadic endpoints, checked against each corner
  polynomial for ULP-wide inputs. The same test, run as a bisection
  over the tiles, gives the tightest enclosure.

Measured:
- The textbook r1 spans 1365+ tiles at 32 and 64 bits, agai... (continued)

31 of 31 new or added lines in 1 file covered. (100.0%)

47171 of 54628 relevant lines covered (86.35%)

9995546.6 hits per line

Jobs
ID Job ID Ran Files Coverage
1 37881109786.1 09 Oct 2026 04:35AM UTC 693
86.35
GitHub Action Run
Source Files on build 37881109786
  • Tree
  • List 693
  • Changed 3
  • Source Changed 1
  • Coverage Changed 3
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Repo
  • Github Actions Build #37881109786
  • e3ed60c8 on github
  • Prev Build on main (#37856086365)
  • Next Build on main (#37928965054)
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