Ultimathnum 0.8.0

Divider<T> is magic ✨

• Various API and non-API changes (0.y.z)
• #61 Binary logarithm methods
• #59 Nonzero<T>
• #58 Division by constant
• #56 Get/set systems integer bit at index
• #55 Auto unwrap unsigned systems integer division
• #53 BinaryInteger/power(_:)
• #52 Make InfiniInt<T> generic over Element
• #51 Miscellaneous 0.8.0 stuff

Ultimathnum 0.7.0

Random numbers and enhanced abstractions.

Narrator: Infinite 1-by-1-as-2 multiplication just works.

• #50 BinaryInteger/multiplication(_:)
• #49 BinaryInteger.random(in:using:)
• #48 BinaryInteger.arbitrary(...)
• #47 Miscellaneous 0.7.0 stuff
• #45 Randomness
• #42 Protocol: ArbitraryInteger

.product(name: "Ultimathnum",  package: "Ultimathnum"), // umbrella
.product(name: "CoreKit",      package: "Ultimathnum"),
.product(name: "DoubleIntKit", package: "Ultimathnum"),
.product(name: "FibonacciKit", package: "Ultimathnum"),
.product(name: "InfiniIntKit", package: "Ultimathnum"),
.product(name: "RandomIntKit", package: "Ultimathnum"), // oh, so shiny!
.product(name: "StdlibIntKit", package: "Ultimathnum"),

Ultimathnum 0.6.0

What hasn't changed? Wait, there's a new module too!?

• Various API and non-API changes (0.y.z).
• #41 Make DoubleInt great again!
• #40 New BitCountable protocol
• #38 Miscellaneous 0.6.0 stuff
• #37 Order and Signedness enums (no protocols)
• #36 Flush shifts greater than IX.max
• #35 No masking shift requirements
• #34 Mark all infinite-by-finite divisions as errors
• #32 Generic shift operations
• #31 Pointer-bit binary integer bit counts
• #30 Rework lsb/msb stuff
• #29 Optional DataInt.Body elements
• #27 DataInt.Body/isEmpty
• #23 StdlibIntKit

Ultimathnum 0.5.1

Some BinaryInteger.init(clamping:) infinity fixes (#21).

Ultimathnum 0.5.0

• Various API and non-API changes (0.y.z).
• #21 Super generic init(clamping:)
• #20 Use (low:high:) and remove (high:low:)
• #19 Rework binary integer shift requirements
• #18 Bad signed vs unsigned systems integer comparisons
• #17 Shift/inverse() should return Optional<Shift>
• #16 Simpler bit counting methods

Ultimathnum 0.4.0

Added some stuff and fixed a bug.

• Various API and non-API changes (0.y.z).
• #14 Bad negative versus infinite comparison
• #13 DataInt/isNormal
• #12 BinaryInteger/isZero and DataInt/isZero
• #11 Finite<T> and Natural<T> trusted inputs
• #10 FiniteInteger(s)
• #9 GCD and XGCD algorithms

Ultimathnum 0.3.1

• #6 Negative and infinite large-storage multiplication edge case
• #7 Try compact InfiniInt<T> storage model (nah)

Ultimathnum 0.3.0

• Various API and non-API changes and improvements (0.y.z).
• Trimmed lots of low-value [Mutable]DataInt.Body methods.
• #5 Arithmetic in Karatsuba algorithm should be discard() not unchecked().

Ultimathnum 0.2.0

• Various API and non-API changes and improvements (0.y.z).
• Negative and infinite small storage multiplication edge case (#3)

Ultimathnum 0.1.1

• 9fe5cca fixes Endianness/matchesLittleEndianByteOrder.