Interesting. Every time the reader is called it creates a hash table, but inserting it into the population of address-hash tables requires scanning the population to determine if it’s already there.
I’ll generate an alternative for the situation where the object being added is known to be new, thus avoiding the scan, and change the hash table implementation to use it. I’ll check other uses as well. On May 1, 2020, 11:53 PM -0700, Arthur A. Gleckler <s...@speechcode.com>, wrote: > On Fri, May 1, 2020 at 11:30 PM Arthur A. Gleckler <s...@speechcode.com> > wrote: > > > > > > I'm not sure how to proceed. Suggestions welcome. > > > > Oh, the solution is obvious: I'll create that hash table lazily. > > > > Sorry for the flood of email.
