Juho Snellman <jsnell@...> writes:
> * Lift the bignum-truncate helpers into labels, since there was a
> lot of (unsigned-byte 32) boxing going on. This also allows
> replacing the special variables *truncate-x* and *truncate-y*
> with lexicals. This gives a 50% improvement on some benchmarks.
> * Implement Kenneth Weber's Accelerated Integer GCD algorithm. This
> gives about 40% improvement on other benchmarks. This is somewhat
> messy, especially since the calculations must be done with mutable
> bignums for performance. Depends on modular non-constant left
Thank you. I think both of these (and also the modular non-constant
left shift) are now implemented in sbcl-0.8.13.69. Testing,
particularly on non-x86 architectures, is as always most welcome,
especially as we are nearing release time.
http://www-jcsu.jesus.cam.ac.uk/~csr21/ +44 1223 510 299/+44 7729 383 757
(set-pprint-dispatch 'number (lambda (s o) (declare (special b)) (format s b)))
(defvar b "~&Just another Lisp hacker~%") (pprint #36rJesusCollegeCambridge)