gfm.integers.wideint

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>

Members

Structs

wideIntImpl
struct wideIntImpl(bool signed, int bits)

Recursive 2^n integer implementation.

Templates

uwideint
template uwideint(int bits)

Wide unsigned integer.

wideint
template wideint(int bits)

Wide signed integer.

Bugs

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

Meta