Lib.rs

(Almost) lock-free insertion only hashtable.

Lookups are performed without locking (wait-free). Insertions are performed with a shared lock (lock-free unless resize is needed). Resizing is performed with an exclusive lock.

Entries are never removed (until the table is dropped).