Provide a 2^N-bit integer type. Guaranteed to never allocate and expected binary layout Recursive implementation with very slow division.
Copied from https://raw.githubusercontent.com/d-gamedev-team/gfm/master/integers/gfm/integers/wideint.d
<b>Supports all operations that builtin integers support.</b>
TODO: Integrate representations and potential assembly optimizations from https://github.com/ckormanyos/wide-integer
Signed integer of arbitary static precision bits.
Unsigned integer of arbitary static precision bits.
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
https://github.com/ckormanyos/wide-integer
See Source File
Provide a 2^N-bit integer type. Guaranteed to never allocate and expected binary layout Recursive implementation with very slow division.
Copied from https://raw.githubusercontent.com/d-gamedev-team/gfm/master/integers/gfm/integers/wideint.d
<b>Supports all operations that builtin integers support.</b>
TODO: Integrate representations and potential assembly optimizations from https://github.com/ckormanyos/wide-integer