1. How does a intrusive hash table solve the problem with having multiple
indexes? You still have to insert the object to both hash tables.
2. It would be good to call out all the hash containers that are used instead
of saying plethora. From what I see in the code we have these.
InkHashTable (wrapper around Tcl_HashTable)
RawHashTable (C++ wrapper around InkHashTable)
TSHashTable -> IntrusiveHashMap
unordered_map/set
Intrusive hash tables and chaining hash tables are not where I see most of the
latest work being done with hash tables. Google use dense_hash_map and is
moving to flat_hash_map that use advanced probing techniques.
Have you done benchmarks with IntrusiveHashMap? My guess is that the
performance wouldn't be good compared to modern hash tables after reading
comparable benchmarks.
-Bryan
> On Aug 13, 2018, at 11:28 AM, Alan M. Carroll <a...@network-geographics.com>
> wrote:
>
> I've written up some of my notes and thoughts on hash containers and how to
> proceed here - https://solidwallofcode.github.io/notes/hash-table.en.html
>
> Please respond to this email string if you have comments of your own.
>
