Re: Hash table thread safety
"Tim Bradshaw (as tfb at cley dot com)" <[email protected]> Wed, 1 Apr 2026 20:46:29 +0100
| Newsgroups | gmane.lisp.lispworks.general |
|---|---|
| Message-ID | <[email protected]> |
On 1 Apr 2026, at 20:01, Martin Simmons <[email protected]> wrote: > > Can you replace the two hash tables with a single hash table mapping the key > to a cons of the index and the value? No, or not easily, because I need to be able to find the next node efficiently. You can have a pointer to the next node, but then you really need a pointer back from it so deletion is easy, and then thread-safeness becomes exciting. There probably is a better approach though. --tim _______________________________________________ Lisp Hug - the mailing list for LispWorks users [email protected] http://www.lispworks.com/support/lisp-hug.html