Thomas Chust scripsit: > Or perhaps just normal arithmetic replacing bitwise-ior by + and > arithmetic-shift by (lambda (x n) (* x (expt 2 n))). This is probably no > less efficient, as the result is going to be a bignum anyway.
Well, only on 32-bit machines. -- John Cowan http://www.ccil.org/~cowan [email protected] Is not a patron, my Lord [Chesterfield], one who looks with unconcern on a man struggling for life in the water, and when he has reached ground encumbers him with help? --Samuel Johnson _______________________________________________ Chicken-users mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/chicken-users
