引用orlp · 2025-02
“Skimming the paper [1], the key difference they used is that their hash table insertion algorithm will probe further than the first empty slot, instead of greedily filling the first empty slot it finds.”
略读论文,指出关键差别是插入时会探测超过第一个空槽,而非贪心填充