Regarding conflict resolution in a sparse hash table. #25
Description
Hi，The current sparse hash table employs bucket-level probing to handle conflicts, ensuring that the fill factor doesn't become too high. Is it possible to use internal probing within a specific "bucket," meaning probing downwards in a bitmap to find an unused bit, in order to locate an available slot for resolving hash collisions?
Apart from that, when determining the rehash threshold, should we consider the number of unoccupied "buckets" rather than the number of "groups"?