Crashes Ubuntu reliably

Linear probing when table expands... BANG!

Author: lee-naish

src/algorithms/controllers/HashingChainingInsertion.js

@@ -5,6 +5,7 @@ import {
   hash1,
   HASH_GRAPH,
   EMPTY_CHAR,
+  EMPTY_CHAR_CH,
   Colors,
   INDEX,
   POINTER,
@@ -25,7 +26,7 @@ import { createPopper } from '@popperjs/core';
 // Bookmarks to link chunker with pseudocode
 const IBookmarks = {
   Init: 1,
-  EmptyArray: 2,
+  EmptyArray: 1, // XXX delete init code
   InitInsertion: 3,
   NewInsertion: 4,
   Hash1: 5,
@@ -35,6 +36,10 @@ const IBookmarks = {
   BulkInsert: 1,
 }
 
+// text to display after key in table to indicate there are more keys
+// XXX MUST be the same in function extractArray in Array2DTracer.js
+const ETC = "..";
+
 export default {
   explanation: HashingExp,
 
@@ -66,7 +71,7 @@ export default {
 
     // Initialize arrays
     let indexArr = Array.from({ length: SIZE }, (_, i) => i);
-    let valueArr = Array(SIZE).fill(EMPTY_CHAR);
+    let valueArr = Array(SIZE).fill(EMPTY_CHAR_CH);
     let nullArr = Array(SIZE).fill('');
 
     // For return
@@ -128,7 +133,7 @@ export default {
     )
 
       // Internally assign the key to the index
-      table[i].push(key);
+      table[i].unshift(key);
 
       // Chunker for placing the key
       chunker.add(
@@ -154,11 +159,22 @@ export default {
                 popper.innerHTML = table[idx];
               } 
 
+            let slotCurValue = vis.array.getValueAt(VALUE, idx);
+            if (slotCurValue === EMPTY_CHAR_CH)
+              // Update value of that index when the slot is empty
+              vis.array.updateValueAt(VALUE, idx, '[' + val + ']');
+            else
+              // / Update value of that index when the slot is not empty
+              vis.array.updateValueAt(VALUE, idx, '[' + val + '..');
+            vis.array.fill(INDEX, idx, undefined, undefined, Colors.Insert);
+
+/*
             let slotCurValue = vis.array.getValueAt(VALUE, idx);
             if (slotCurValue === EMPTY_CHAR) vis.array.updateValueAt(VALUE, idx, val); // Update value of that index when the slot is empty
-            else vis.array.updateValueAt(VALUE, idx, slotCurValue + (table[idx].length == 2 ? ".." : "")); // Update value of that index when the slot is not empty
+            else vis.array.updateValueAt(VALUE, idx, slotCurValue + (table[idx].length == 2 ? ETC : "")); // Update value of that index when the slot is not empty
             vis.array.showKth({key: vis.array.getKth().key, type: HASH_TYPE.BulkInsert, insertions: insertions});
             vis.array.fill(INDEX, idx, undefined, undefined, Colors.Insert); // Fill it green, indicating successful insertion
+*/
         },
         [key, i, insertions, table]
       )
@@ -185,7 +201,7 @@ export default {
         // hashed value
         let i = hash1(null, null, key, table.length, false);
 
-        table[i].push(key);
+        table[i].unshift(key);
         inserts[key] = i;
         lastHash = i;
       }
@@ -217,9 +233,13 @@ export default {
               } 
 
             let slotCurValue = vis.array.getValueAt(VALUE, inserts[key]);
-            console.log(typeof(slotCurValue));
-            if (slotCurValue === EMPTY_CHAR) vis.array.updateValueAt(VALUE, inserts[key], key); // Update value of that index when the slot is empty
-            else vis.array.updateValueAt(VALUE, inserts[key], slotCurValue + ((table[inserts[key]].length >= 2 && typeof(slotCurValue) == 'number') ? ".." : "")); // Update value of that index when the slot is not empty
+            console.log(typeof(slotCurValue), key, slotCurValue, table[inserts[key]]);
+            if (slotCurValue === EMPTY_CHAR_CH)
+              // Update value of that index when the slot is empty
+              vis.array.updateValueAt(VALUE, inserts[key], '[' + key + ']');
+            else
+              // / Update value of that index when the slot is not empty
+              vis.array.updateValueAt(VALUE, inserts[key], '[' + key + '..');
             vis.array.fill(INDEX, inserts[key], undefined, undefined, Colors.Insert);
           }
           vis.array.showKth({key: vis.array.getKth().key, type: HASH_TYPE.BulkInsert, insertions: insertions});
@@ -265,11 +285,12 @@ export default {
             INDEX,
             {
               rowLength: size > SMALL_SIZE ? SPLIT_SIZE : SMALL_SIZE,
-              rowHeader: ['Index', 'Value', '']
+              rowHeader: ['Index', 'Chain', '']
             }
           );
 
-          vis.array.hideArrayAtIndex([VALUE, POINTER]); // Hide value and pointer row intially
+          // vis.array.hideArrayAtIndex([VALUE, POINTER]); // Hide value and pointer row intially
+          vis.array.hideArrayAtIndex([POINTER]); // Hide pointer row intially
 
           vis.graph.weighted(true);
 
@@ -296,8 +317,9 @@ export default {
       );
 
       // Chunker to initialize empty array visually
+/*
       chunker.add(
-        IBookmarks.EmptyArray,
+        IBookmarks.Init,
         (vis) => {
           // Show the value row
           vis.array.hideArrayAtIndex(POINTER);
@@ -306,7 +328,7 @@ export default {
 
       // Chunker for intializing insertion stat
       chunker.add(
-        IBookmarks.InitInsertion,
+        IBookmarks.EmptyArray,
         (vis, insertions) => {
           vis.array.showKth({
               key: "",
@@ -318,6 +340,7 @@ export default {
         },
         [insertions]
       )
+*/
 
       // Magic numbers for length of splitting a postive integer string by "-", the index of "", and the number to delete when a negative integer is split by "-"
       const POS_INTEGER_SPLIT_LENGTH = 1;

src/algorithms/controllers/HashingCommon.js

@@ -13,7 +13,8 @@ export const FULL_SIGNAL = -1;
 
 // Magic character used between all 3 files
 export const POINTER_VALUE = 'i'
-export const EMPTY_CHAR = '-';
+export const EMPTY_CHAR = '-';      // for empty slots
+export const EMPTY_CHAR_CH = '[]';  // for empty slots with chaining
 export const DELETE_CHAR = 'X';
 
 // Color indexes

src/algorithms/controllers/HashingDelete.js

@@ -11,7 +11,8 @@ import {
   DELETE_CHAR,
   HASH_TYPE,
   newCycle,
-  EMPTY_CHAR
+  EMPTY_CHAR,
+  EMPTY_CHAR_CH
 } from './HashingCommon';
 
 // Bookmarks to link chunker with pseudocode
@@ -24,7 +25,8 @@ const IBookmarks = {
   Found: 14,
   Delete: 15,
   NotFound: 18,
-  Pending: 19,
+  Pending: 20,
+  CheckFull: 21,
 }
 
 /**
@@ -157,13 +159,15 @@ export default function HashingDelete(
   /** This part is for Chaining */
   else {
 
+/*
     chunker.add(
       IBookmarks.Pending,
       (vis, idx) => {
           vis.array.fill(INDEX, idx, undefined, undefined, Colors.Pending); // Fill pending slots with yellow
       },
       [i]
     );
+*/
 
     if (table[i].includes(key)) {
       const index = table[i].indexOf(key);
@@ -176,9 +180,15 @@ export default function HashingDelete(
           const popper = document.getElementById('float_box_' + idx);
           popper.innerHTML = table[idx];
 
-          let firstItemOfChain = table[idx][0];
-          if (firstItemOfChain != undefined) vis.array.updateValueAt(VALUE, idx, firstItemOfChain + '..');
-          else vis.array.updateValueAt(VALUE, idx, EMPTY_CHAR);
+          let chainLength = table[idx].length;
+          // let firstItemOfChain = table[idx][0];
+          // if (firstItemOfChain === undefined)
+          if (chainLength === 0)
+            vis.array.updateValueAt(VALUE, idx, EMPTY_CHAR_CH);
+          else if (chainLength === 1)
+            vis.array.updateValueAt(VALUE, idx, '[' + table[idx][0] + ']');
+          else
+            vis.array.updateValueAt(VALUE, idx, '[' + table[idx][0] + '..');
 
           vis.array.fill(INDEX, idx, undefined, undefined, Colors.Found); // Fill the slot with green, indicating that the key is found
         },
@@ -189,7 +199,8 @@ export default function HashingDelete(
     }
     else {
       chunker.add(
-        IBookmarks.NotFound,
+        // IBookmarks.NotFound, // delete code no longer expanded
+        IBookmarks.Found,
         (vis, idx) => {
           vis.array.fill(INDEX, idx, undefined, undefined, Colors.NotFound); // Fill the slot with green, indicating that the key is found
         },