hash - The memory cost of a hash_map structure in C++ STL -

in order use hash_map, assume consecutive memory block allocated, what's size of block default?

this following unordered_map - name hash map in c++11 onwards...

while initial size implementation specific, default .max_load_factor() stipulated standard 1.0, in general number of buckets automatically increase when .size() becomes greater. gives bit of feel things....

you can call .bucket_count() instantaneous count.