Linear probing for a hash table that you’re not going to delete things from. Textbooks usually tell you to prefer other probing patterns unless you need deletio

Linear probing for a hash table that you’re not going to delete things from. Textbooks usually tell you to prefer other probing patterns unless you need deletion (and e.g. Go interface casts use quadratic probing[1]). Or is it still advantageous for some reason? (Locality?) [1] https://github.com/golang/go/blob/03cd8a7b0e47f2141a1dbdad9fdce175942d5515/src/runtime/iface.go#L95-L118 https://github.com/golang/go/blob/03cd8a7b0e47f2141a1dbdad9f... via https://lukasatkinson.de/2018/interface-dispatch/ https://lukasatkinson.de/2018/interface-dispatch/