What algorithms are available for modifying a hash table?

Question

I have implemented native hash table functions in C, but currently it does not support resizing. I was wondering what algorithms exist apart from the brute force of creating a new empty hash table and moving everything there?

Answer 1

There is a step-by-step resizing.

From Wikipedia:

Incremental resizing

-, , , . , - :

-, .      .      .      .      , .

, , (r + 1)/r .

, - ( , ); , , .

Answer 2

.

, , - , VirtualAlloc, . , laymans, - "malloc" " 1000MB, 10 ". , 10 , . , ", 10 ". 10 10 . . , , , .

Answer 3

, , . , , . , . , , , .