Hashing in reasonable shape

After *lots* of work.  Still a bunch of things that could be improved
plus code needs a clean up.

Author: lee-naish

src/algorithms/controllers/AVLTreeInsertion.js

@@ -802,6 +802,10 @@ export default {
                 vis.graph.setFunctionName('Tree is Empty');
                 vis.graph.setFunctionInsertText(``);
                 vis.array.patch(0);
+                // make a bit more room for tree
+                vis.graph.setSize(2.5);
+                vis.graph.setZoom(0.8);
+                vis.array.setZoom(0.9);
             },
             [nodes],
             1

src/algorithms/controllers/HashingCommon.js

@@ -68,18 +68,26 @@ export const POINTER_CUT_OFF = 1;
  * @param {*} toggleAnimate whether animation is carried out or not
  * @returns the hashed value
  */
-export function hash1(chunker, bookmark, key, tableSize, toggleAnimate) {
+export function hash1(chunker, bookmark, key, tableSize, toggleAnimate, type) {
   let hashed = (key * PRIME) % tableSize; // Hash the key
 
   if (toggleAnimate) {
     // Update the graph
     chunker.add(
       bookmark,
-      (vis, val) => {
+      (vis, val, key) => {
         vis.graph.updateNode(HASH_GRAPH.Value, val);
         vis.graph.select(HASH_GRAPH.Value);
+        vis.graph.updateNode(HASH_GRAPH.Key, key);
+          let kth = vis.array.getKth();
+          vis.array.showKth({
+            key: key,
+            type,
+            insertions: kth.insertions,
+            increment: ' '
+          });
       },
-      [hashed]
+      [hashed, key, type]
     )
   }
 
@@ -104,6 +112,7 @@ export function hash2(chunker, bookmark, key, tableSize, toggleAnimate) {
     chunker.add(
       bookmark,
       (vis, val) => {
+        vis.graph.updateNode(HASH_GRAPH.Key2, key);
         vis.graph.updateNode(HASH_GRAPH.Value2, val);
         vis.graph.select(HASH_GRAPH.Value2);
       },

src/algorithms/controllers/HashingDelete.js

@@ -56,7 +56,7 @@ export default function HashingDelete(
   );
 
   // Hashing the key
-  let i = hash1(chunker, IBookmarks.ApplyHash, key, SIZE, true); // Target value after being hashed
+  let i = hash1(chunker, IBookmarks.ApplyHash, key, SIZE, true, HASH_TYPE.Delete); // Target value after being hashed
 
   /** This part is for Linear Probing and Double Hashing */
   if (ALGORITHM_NAME !== 'HashingCH') {
@@ -85,7 +85,7 @@ export default function HashingDelete(
       [i]
     );
 
-    let explored = 0;
+    let explored = 0; // XXX shouldn't need this
     // Search for the target key, checking each probed position
     while (table[i] !== key && table[i] !== undefined && explored < SIZE) {
       // Chunker for not matching