Rehashes the table.
Manual rehashes may make future lookups more efficient. This is also the only way to reduce a hash table's memory footprint. Nothing happens to the table in case of failure.
Min number of preallocated entries, must be enough to fit current entries.
Zero on success, non-zero on failure (on OOM, overflow or an invalid capacity).
Rehashes the table.
Manual rehashes may make future lookups more efficient. This is also the only way to reduce a hash table's memory footprint. Nothing happens to the table in case of failure.