feat: implement hashing algorithms and some extra features

.github/workflows/hashing.yml

@@ -0,0 +1,26 @@
+name: Hashing Algorithms CI
+
+on:
+  push:
+    branches: [2024_sem2]
+    paths-ignore:
+      - 'doc/**' # Ignore all files and subdirectories under "doc/"
+      - 'docs/**' # Ignore all files and subdirectories under "docs/"
+  pull_request:
+    branches: [2024_sem2]
+
+jobs:
+  test:
+    runs-on: ubuntu-latest
+    steps:
+      - name: Checkout 🛎️
+        uses: actions/checkout@v2.3.1
+        with:
+          persist-credentials: false
+
+      - name: Install and Test 🔧
+        run: |
+          npm install
+          npm run test-hashinsert
+          npm run test-hashsearch
+          npm run test-hashdelete

package.json

@@ -17,6 +17,10 @@
     "test-msdrs": "npm test -- ./src/algorithms/controllers/MSDRadixSort.test.js",
     "test-uf": "npm test -- ./src/algorithms/controllers/unionFind.test.js",
     "test-234t": "npm test -- ./src/algorithms/controllers/TTFTree.test.js",
+    "test-hashinsert": "npm test -- ./src/algorithms/controllers/tests/HashingInsertion.test.js",
+    "test-hashsearch": "npm test -- ./src/algorithms/controllers/tests/HashingSearch.test.js",
+    "test-hashdelete": "npm test -- ./src/algorithms/controllers/tests/HashingDeletion.test.js",
+    "test-234t": "npm test -- ./src/algorithms/controllers/TTFTree.test.js",
     "test-avl": "npm test -- ./src/algorithms/controllers/AVLTree.test.js",
     "test-url": "npm test -- ./src/algorithms/parameters/helpers/urlHelpers.test.js"
   },
@@ -63,6 +67,7 @@
     "@mui/lab": "latest",
     "@mui/material": "^5.14.4",
     "@mui/styles": "^5.14.4",
+    "@popperjs/core": "^2.11.8",
     "@testing-library/jest-dom": "^4.2.4",
     "@testing-library/react": "^12.1.2",
     "@testing-library/react-hooks": "^8.0.1",

src/algorithms/controllers/AStar.js

@@ -166,7 +166,7 @@ export default {
       5,
       (vis, v) => {
         vis.array.set(v, algNameStr);
-        vis.array.getRendererClass().zoom = 8;
+        vis.array.setZoom(0.8);
       },
       [[nodes, heuristics, minCosts, parents, finalCosts], 0]
     );