//! Lazy exact-real expression graph and approximation kernels.
//!
//! The implementation is intentionally split by semantic pressure rather than
//! by one node type per file. `node` owns the compact expression enum, caches,
//! structural facts, and graph rewrites because those pieces are tightly coupled
//! in hot constructors. `approximation` owns the precision-refinement kernels
//! for elementary functions. The smaller sibling modules are documentation
//! anchors for planned split points where moving code has not yet measured
//! neutral.
pub use Computable;
pub use Precision;
pub use ;