1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
// Create hash tableclass Node {  constructor(key, str) {    this.value = {key, str};    this.next = null;  }}
class LinkedList {  constructor() {    this.head = null;    this.tail = null;  }
  // adds a node to the end of the linked list  addNode(key, str) {    if (this.head === null) {      this.head = new Node(key, str);      this.tail = this.head;    } else {      this.tail.next = new Node(key, str);      this.tail = this.tail.next    }  }
  // finds a node from the SHA256-hashed queryStr and returns the queryStr  getNode(key) {    if (this.head === null) return undefined;    let currNode = this.head;    while (currNode) {      if (currNode.value.key === key) return currNode.value.str;      else currNode = currNode.next;    }    return undefined;  }}
export class HashTable {  constructor(size) {    this.SIZE = size;    this.table = new Array(this.SIZE);  }
  // adds a value to the hashTable  add(sha256Str, str) {    const index = hashSlingingSlasher(sha256Str, this.SIZE);    // if there is nothing at that index of the hash table    if (!this.table[index]) {      // initialize a new linked list and add a node to it      this.table[index] = new LinkedList();      this.table[index].addNode(sha256Str, str);    // if there is already a linked list at that index    } else {      // add a new node      this.table[index].addNode(sha256Str, str);    }  }
  // gets the queryStr given the SHA256-Hashed queryStr  get(key) {
    const index = hashSlingingSlasher(key, this.SIZE);    if (!this.table[index]) return undefined;    return this.table[index].getNode(key);  }
}
// hashing functionfunction hashSlingingSlasher(string, size) {  let hash = 0;  if (string.length === 0) return hash;  for (let i = 0; i < string.length; i++) {    const letter = string.charCodeAt(i);    hash = ((hash << 5) - hash) + letter;    hash = hash & hash; // Convert to 32bit integer  }  return Math.abs(hash) % size;}