[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
- To: (BUG lispm) at MIT-AI
- From: RWG@MIT-MC
- Date: Mon ,14 Oct 80 18:44:25 EDT
here is one that i won't apologize for, except for it's being about six years
(too?) late. lispms perpetuate goddamn losing fortran divide! (sign remain-
der = sign dividend.) not only is this the most useless, therefore
requiring the user to write his own, but it is also the glitchiest,
thus maximizing the difficulty for said user. in decreasing order of useful-
ness, integer divides are: divide for nonnegative remainder, sign remainder
= sign diviSOR, divide for nearest integer, fortran divide, divide for prime
remainder nearest xor of dividend with complement-obverse of quotient.
gls's paper warning of compiling divide-by-2 into ASH had it backwards.
ASH is a win, it's divide that loses!