[adgjlsfhk1]

tombstones use the same bit as empty (empty and deleted don't have hash codes, so there's room).

the key realization behind swissdict is that all the complications people add are only necessary if you have a bad hash function, so you can just use a good one and be happier.

linear probing also has the significant advantage that it allows removing tombstones when whenever the next entry is empty