axiolid-exact
Filtered exact arithmetic: interval filter, dyadic big integers, a + b*sqrt(c).
| Latest release | 0.1.2 (2026-09-28) |
| crates.io | axiolid-exact |
| Layer | algorithms (algorithm.reference) |
| API documentation | rustdoc · docs.rs |
| Source | crates/algorithms/exact/ |
Overview
Filtered exact arithmetic for constructions over f64 input (ADR 0068): signs and orderings of values f64 cannot hold, such as where two segments cross, where a line meets a circle, or roots of the form (a + b*sqrt(c)) / d. Each sign question is one expression evaluated first in outward-rounded interval arithmetic and, only if that cannot decide, in exact dyadic big-integer arithmetic (num-bigint). It has no division and evaluates no square roots; approximate values are available for output only.
Design notes
Choosing between this crate and axiolid-predicates: if the question is the sign of a polynomial in the input coordinates (orientation, in-circle), use axiolid-predicates, which needs no big integers. If the question is about a constructed point (a crossing, a line/circle hit), use this crate.
Depends on
Changes
Latest release, 0.1.2 (2026-09-28):
Changed
- The crates.io page is this crate's own
README.md, with links to its API documentation, its reference page and the source (ADR 0078).
Full history: crates/algorithms/exact/CHANGELOG.md