loading this file
(in-package :maxima) ;; move to front
(defun m2f(r)(let((v (get r 'operators)))(cond(v(remprop r
'operators)(setf(get r 'operators) v)))))
(map nil #'m2f (apropos-list "m"))
(map nil #'m2f (apropos-list "%"))
(map nil #'m2f (apropos-list "$"))
speeds up maxima on the test suite, on my computer, by about 2%.
I suggest someone put it in the setup files somewhere. Even if it is
only 2%.
Barton Willis wrote:
>
>
> Some newer hunks of code use hash tables instead of the property list;
> for example, *flonum-op* and *big-float-op* are hash tables that hold
> functions
> for numerical evaluation of trig-like function.
>
I'm not sure how this is really being done, but perhaps CLOS would do
the same thing?
Converting Maxima to use CLOS would be a challenge.
RJF