Hash Tables & JavaScript Objects

What collision resolution method is implemented in this code?

class HashTable {
  set(key, value) {
    const index = this._hash(key);
    if (!this.keyMap[index]) {
      this.keyMap[index] = [];
    }
    this.keyMap[index].push([key, value]);
  }
}

Linear probing
Quadratic probing
Separate chaining
This implements separate chaining collision resolution: 1) Creates array (chain) at each index for multiple entries, 2) Allows multiple key-value pairs at same index, 3) New entries are pushed to the chain array, 4) No need to find new indices for collisions, 5) Efficient for high load factors, 6) Simple to implement and maintain, 7) Good performance with good hash function, 8) Common approach in hash table implementations.
Double hashing

Next Question (7/20)