IE> Unfortunately aref is not a generic function so you'd have to play
IE> package naming games to hijack it which I abhor. I'm open to
IE> suggestions on ways to handle such an idiom, but nothing has come to
IE> mind yet. A macro to create slot accessors that do all the
IE> bookkeeping auto
LPP> What I have mainly carried with me from this section of the
LPP> documentation was the knowledge that psets and btrees should be used
LPP> to speed up collection operations. And while this is true for lists,
LPP> for which most operations are implemented as macros, it isn't the
LPP> same
> how do you thik it is supposed to work?
Yeah, I wonder. :)
> "The remaining problem outlined in the section on Serialization is that
> operations which mutate collection types do not have persistent side
> effects."
What I have mainly carried with me from this section of the
documentation wa
Alex is exactly right, as pointed out by the docs. set-valued slots
partially solve this annoyance with persistent collections stored in
slots, but they are unordered.
Unfortunately aref is not a generic function so you'd have to play
package naming games to hijack it which I abhor. I'm o
LPP> (32): (setf (aref (slot-value sch 'a) 2) 1)
LPP> 1
LPP> (33): (slot-value sch 'a)
LPP> #(0 0 0 0)
how do you thik it is supposed to work?
to my knowledge, elephant does not hijack (setf aref), so (setf aref) just
modifies a temporary array returned by a slot read.
db is written _only_ o
