deleted_key?

[Gregory Popovitch]

I wonder why "set_deleted_key()" is needed for the sparse_hash_table. After all the bitmap clearly defines which entries are occupied. Is there any special reason for this to be present?

Thanks!

[philip...@gmail.com]

Please consider posting @ https://github.com/sparsehash/sparsehash/issues

set_deleted_key only needs to be called AFAIK if you ever call "erase".

[Gregory Popovitch]

Thanks for the answer, Philip, I was starting to think this group was dead. I realized that the main purpose of set_deleted_key() was to allow to erase elements without invalidating iterators. It would not be that useful if erase() was to return an iterator to the next element as specified for unordered_hash(). 

 

[Gregory Popovitch]

Duh, answering myself here, if we just toggle the bitmap bit off when calling erase(), further lookups for keys which have the same hash as this entry will fail.