Hash Table Algoritması

1class HashTable {
2  private buckets: Array>;
3  constructor(size = 16) {
4    this.buckets = Array.from({ length: size }, () => []);
5  }
6  set(key: string, value: string) {
7    const bucket = this.buckets[this.hash(key)];
8    const existing = bucket.find((entry) => entry[0] === key);
9    if (existing) { existing[1] = value; } else { bucket.push([key, value]); }
10  }
11  get(key: string) {
12    return this.buckets[this.hash(key)].find((entry) => entry[0] === key)?.[1];
13  }
14  private hash(key: string) {
15    return [...key].reduce((sum, char) => sum + char.charCodeAt(0), 0) % this.buckets.length;
16  }
17}