GDeLaurentis/pyadic: v0.3.0

[0.3.0] - 2026-03-05 Added implemented extended euclidean algorithm (eea) option for returning a generator Wang's eea rational reconstruction algorithm EEARR primes_with_i Changed Extended serialization and hashing capabilities and tests option to disable ValueError being raised by reconstruction algorithms that are aware of when (likely) failing Nested sum (Horner) option for Newton_polynomial_interpolation Newton interpolation catches up to 3 ZeroDivisionError before giving up ⚠️ Breaking Clarified two somewhat arbitrary choices: int(padic) returns the (lossless) integer representation of a padic integer, but now raises an exception if the valuation is negative. ModP(padic) now takes the residue modulo p, i.e. the leading digit mantissa, for any valuation. The old int(padic) behaviour is still avaiable through the mantissa, padic.num - this may require some small fix in codes: int(padic) -> padic.num. The advantage is that now padic plays better with e.g. sympy polynomials modulo p powers (before non-zero valuations would be discarded returning nonesense). Fixed Avoid obscure infinite recursion in ModP.init when trying to pass it a mpmath value by mistake, raise explcit TypeError instead special case for p-adic multiplication by zero, fixes precision loss e.g. in [high precision padic, low precision padic] @ [1, 0]