Re: GETF Speedup?
"Bradford Miller (as bradford dot w dot miller at gmail dot com)" <[email protected]>
| Newsgroups | gmane.lisp.lispworks.general |
|---|---|
| Message-ID | <[email protected]> |
This discussion reminds me of the Symbolics “Table Management Facility” (q.v. https://www.chai.uni-hamburg.de/~moeller/symbolics-info/documentation/Symbolics-Common-Lisp-Language-Concepts.pdf ). The basic idea was you used the common lisp hash table interface in your code, and the machine would organize it for efficiency based on size (you could predeclare a size so you didn’t pay a runtime penalty for reorganization). > On Oct 13, 2025, at 2:06 PM, Yuri Davidovsky (as work at disclosure dot ie) <[email protected]> wrote: > > > >> On 13 Oct 2025, at 17:28, David McClain <[email protected]> wrote: >> >> And now the count is down to 10 associations!! > > Pretty much what Bradshaw’s tests showed. 10 key/value pairs should still be sufficient for small time dictionary storage, especially if you place frequently used items at the top of the list. > > _______________________________________________ > Lisp Hug - the mailing list for LispWorks users > [email protected] > http://www.lispworks.com/support/lisp-hug.html