Hash Tables & JavaScript Objects

What operation is being performed in this hash table method?

class HashTable {
  _resize() {
    const newSize = this.keyMap.length * 2;
    const nextPrime = this._findNextPrime(newSize);
    const oldMap = this.keyMap;
    this.keyMap = new Array(nextPrime);
    oldMap.forEach(bucket => {
      if (bucket) {
        bucket.forEach(([key, value]) => this.set(key, value));
      }
    });
  }
}

Data compression
Collision resolution
Dynamic resizing
This method implements dynamic resizing: 1) Doubles the table size to next prime number, 2) Creates new array with increased capacity, 3) Rehashes all existing entries to new array, 4) Maintains optimal load factor, 5) Preserves all key-value pairs, 6) Improves performance by reducing collisions, 7) Common approach for growing hash tables, 8) Critical for maintaining amortized O(1) operations.
Key redistribution

Next Question (10/20)