Provide a 2^N-bit integer type. Guaranteed to never allocate and expected binary layout Recursive implementation with very slow division.

<b>Supports all operations that builtin integers support.</b>

Recursive 2^n integer implementation.

Wide unsigned integer.

Wide signed integer.

it's not sure if the unsigned operand would take precedence in a comparison/division. - a < b should be an unsigned comparison if at least one operand is unsigned - a / b should be an unsigned division if at least one operand is unsigned

See Source File

Provide a 2^N-bit integer type. Guaranteed to never allocate and expected binary layout Recursive implementation with very slow division.

<b>Supports all operations that builtin integers support.</b>