On Thu, Jun 9, 2022 at 6:10 AM Elijah Stone <[email protected]> wrote: > Like I've said before, I think name lookup can be a _lot_ faster with an > inline cache. Plus a lockfree hash table.
In the context of numbered locales, this could mean that the locale has been marked as "owned" by a specific thread with a fast path for access within that thread, and with a slow path for development access from outside that thread (this would also require cache flushes and so on so would at least temporarily slow down "in thread" access). I should also add that I am deeply suspicious of hash table performance (and O(n) based performance conclusions) in the general case. It's frequently the case that, with a little thought, simple linear approaches beat "superior" O(n) approaches. Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
