Re: GETF Speedup?
"Tim Bradshaw (as tfb at cley dot com)" <[email protected]>
| Newsgroups | gmane.lisp.lispworks.general |
|---|---|
| Message-ID | <[email protected]> |
On 12 Oct 2025, at 15:06, Yuri Davidovsky <[email protected]> wrote: > > Additionally, it appears that in all the tests the key values were rather synthetic using plain numbers (you might as well use an array and access values by their indices in such case), most likely in real word usage the keys would be symbols, or keywords (maybe strings in some cases). This will make the key comparison more time consuming for lists and hash tables with their hash calculation overhead might close the gap. Yes I might play with that. Certainly hash tables need to compute hashes and that has some cost, which is likely higher for hairy list structures, say. Note that getf is very limited: it can only use eql tests. --tim _______________________________________________ Lisp Hug - the mailing list for LispWorks users [email protected] http://www.lispworks.com/support/lisp-hug.html