mulInternal

fnvoid mulInternal(BigDigit[] result, const(BigDigit)[] x, const(BigDigit)[] y) pure nothrow @safe

General unsigned multiply routine for bigints. Sets result = x * y.

The length of y must not be larger than the length of x. Different algorithms are used, depending on the lengths of x and y. TODO: "Modern Computer Arithmetic" suggests the OddEvenKaratsuba algorithm for the unbalanced case. (But I doubt it would be faster in practice).