[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
(setf (apply #'foo ...) ...)
- To: Charles Hedrick <HEDRICK@RUTGERS.ARPA>
- Subject: (setf (apply #'foo ...) ...)
- From: Skef Wholey <Wholey@CMU-CS-C.ARPA>
- Date: Mon, 06 May 1985 17:51:00 -0000
- Cc: common-lisp@SU-AI.ARPA, GSB@MIT-MC.ARPA
- Sender: WHOLEY@CMU-CS-C.ARPA
Just for the record (and to maybe make things epsilon easier for other
implementors), (setf (apply #'aref ...) ...) in Spice Lisp turns into a call to
Lisp::%Aset, which takes its arguments in the new-element-is-last order,
instead of the Zetalisp order. That turned out to be just as easy for us.
Also, the Let bindings that Setf produces that it can't prove can go away are
examined by a general-purpose "Let optimizer" in our compiler, which does a
more thorough job of removing spurious bindings.