I've done some timing tests to compare the new BigInt implementation with the old one. For the changelog: -- Multiplication is now 5 times faster, division is 300 times faster, and squaring is 10 times faster. For large numbers (~5000 machine words), the speedup is 5 times larger than this.
============ On 24 March 2010 22:24, Don Clugston <[email protected]> wrote: > On 19 March 2010 04:46, Don Clugston <[email protected]> wrote: >> I've converted my BigInt module from Tango to Phobos2. It's a great >> test of the new operator overloading! >> After 2.042 comes out, I'd like to add it to Phobos. > > OK, it's now in. There are still some obvious things wrong with it > (not all of the formatting options are supported, for example), and > the internal stuff doesn't take full advantage of D2 yet. Nonetheless > it works. > > The modules > std\internal\math\biguintcore.d > std\internal\math\biguintnoasm.d std\internal\math\biguintx86.d > > will need to be added to the Linux and OSX makefiles. > _______________________________________________ phobos mailing list [email protected] http://lists.puremagic.com/mailman/listinfo/phobos
