docs(hash-table): add new hash table

Author: guilhermebkel

algorithms/searching/hash-table/LinearProbingHash.js

@@ -0,0 +1,53 @@
+const Search = require("../Search")
+
+class LinearProbingHash extends Search {
+	#keyValuePairsCount
+	#linearProbingTableSize
+	#keys
+	#values
+
+	constructor() {
+		super()
+
+		this.#keyValuePairsCount = 0
+		this.#linearProbingTableSize = 16
+		this.#keys = []
+		this.#values = []		
+	}
+
+	put (key, value) {
+		let i
+
+		for(i = this.generateHash(key); !!this.#keys[i]; i++) {
+			const currentKey = this.#keys[i]
+
+			const areKeysEqual = this.compareValues(key, currentKey) === 0
+			
+			if (areKeysEqual) {
+				this.#values[i] = value
+				return
+			}
+		}
+
+		this.#keys[i] = key
+		this.#values[i] = value
+
+		this.#keyValuePairsCount++
+	}
+
+	get (key) {
+		for (let i = this.generateHash(key); !!this.#keys[i]; i++) {
+			const currentKey = this.#keys[i]
+
+			const areKeysEqual = this.compareValues(key, currentKey) === 0
+			
+			if (areKeysEqual) {
+				return this.#values[i]
+			}
+		}
+
+		return null
+	}
+}
+
+module.exports = LinearProbingHash

algorithms/searching/hash-table/LinearProbingHash.test.js

@@ -0,0 +1,13 @@
+const assert = require("assert")
+const LinearProbingHash = require("./LinearProbingHash.js")
+
+const linearProbingHash = new LinearProbingHash()
+
+linearProbingHash.put("Guilherme", 123)
+linearProbingHash.put("Mota", 431)
+linearProbingHash.put("teste", 0)
+
+assert.deepEqual(linearProbingHash.get("Guilherme"), 123)
+assert.deepEqual(linearProbingHash.get("NotExistentKey"), null)
+
+

algorithms/searching/hash-table/SeparateChainingHash.js

@@ -0,0 +1,42 @@
+const Search = require("../Search")
+const SequentialSearch = require("../symbol-table/SequentialSearch")
+
+class SeparateChainingHash extends Search {
+	#keyValuePairsCount
+	#hashTableSize
+	#sequentialSearchTables
+
+	constructor() {
+		super()
+
+		this.#keyValuePairsCount = 0
+		this.#hashTableSize = 0
+		this.#sequentialSearchTables = []
+	}
+
+	get (key) {
+		const hash = this.generateHash(key)
+
+		const sequentialSearchTable = this.#sequentialSearchTables[hash]
+
+		if (!sequentialSearchTable) {
+			return null
+		}
+
+		const value = sequentialSearchTable.get(key)
+
+		return value
+	}
+
+	put (key, value) {
+		const hash = this.generateHash(key)
+
+		if (!this.#sequentialSearchTables[hash]) {
+			this.#sequentialSearchTables[hash] = new SequentialSearch()
+		}
+
+		this.#sequentialSearchTables[hash].put(key, value)
+	}
+}
+
+module.exports = SeparateChainingHash

algorithms/searching/hash-table/SeparateChainingHash.test.js

@@ -0,0 +1,12 @@
+const assert = require("assert")
+const SeparateChainingHash = require("./SeparateChainingHash.js")
+
+const separateChainingHash = new SeparateChainingHash()
+
+separateChainingHash.put("Guilherme", 123)
+separateChainingHash.put("Mota", 431)
+separateChainingHash.put("teste", 0)
+
+assert.deepEqual(separateChainingHash.get("Guilherme"), 123)
+assert.deepEqual(separateChainingHash.get("NotExistentKey"), null)
+