Load factor of hash tables with tombstones
问题 So the question came up about whether tombstones should be included when calculating the load factor of a hash table. I thought that, given that the load factor is used to determine when to expand capacity, tombstones should not be included. An obvious example is if you almost fill and then remove every value in a hash table. Here insertions are super easy (no collisions) so I believe the load factor shouldn't include them. But you could look at this and think that with all the tombstones