[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

wanted: opinions on a benchmark.

Thanks for the explaination. 

About the divide-by-zero and overflow errors. What I really want
is some kind of arithmetic modulo M. However, the description of
24-bit-arithmetic in the Lispm-Manual scared me off a bit.

What would be very nice is to be able to use the same generic
arithmetic functions, "+","*","//","\", with a "small fixnum"
which had certain properties, amoung them "staying small."
It is not that I don't like SMALL-FLONUM's, it is just that
the algebraic properties of them are not ideal for hidden-line
clipping arithemetic.  What happens is that because the
lisp machine does a lot more CHECKING, this forces the program
using them to do checking too, and to compensate for the strange
algebraic properties. Its pretty obvious that if one can get
the required program behaviour from the properties of the objects
being manipulated, rather than from hairy control structure inside
the program itself, then it is a win.

The Array-accessing problem: Of course, the Maclisp object I used
to descibe a CLIPPING-PLANE was a fixed-size hunk, a very simple
structure fixed locations of which can be referenced with a single
PDP-10 instruction.
Lispm-machine arrays have much more complex properties, which simplify
the control structure of many of the programs which use them no doubt!