Re: GETF Speedup?
"Yuri Davidovsky (as work at disclosure dot ie)" <[email protected]>
| Newsgroups | gmane.lisp.lispworks.general |
|---|---|
| Message-ID | <[email protected]> |
> On 11 Oct 2025, at 17:30, David McClain <[email protected]> wrote: > > I half expect that lists are, as often as possible, not actually stored as conventional linked lists. But rather, as a serial vector with tags indicating something about the CAR/CDR relationship. It appears that in many cases lists can be represented by vectors, and if the cons allows for some storage beyond just two pointers, it could store numbers and shortish strings avoiding memory lookups for car and cdr calls when traversing. The catch is though if you try to splice another cons in the middle of the list, the whole business breaks and you are in trouble and may have to convert the array into an actual linked list, or do some lookup trickery. But if that does not happen and you only append stuff and push/pop stuff, it could work just fine in most situations. You will also get free random access for the likes of (nth). _______________________________________________ Lisp Hug - the mailing list for LispWorks users [email protected] http://www.lispworks.com/support/lisp-hug.html