Hashing not too broken now

Still need to do expansion with bulk inserts + check deletes

Author: lee-naish

src/algorithms/controllers/HashingInsertion.js

@@ -310,6 +310,7 @@ export default {
       let inserts = {};
       let bulkInsertions = 0;
       let prevTable = [...table];
+//XXX replace by expandAndReinsert
       const limit = () => {
         if (params.expand && table.length < LARGE_SIZE) return total + 1 === Math.round(table.length * 0.8);
         return total === table.length - 1;
@@ -648,7 +649,7 @@ export default {
             // Preparation for bulk insertion
             chunker.add(
               IBookmarks.BulkInsert,
-              (vis, insertions, prevIdx) => {
+              (vis, insertions, prevIdx, table) => {
                 vis.array.unfill(INDEX, 0, undefined, table.length - 1); // Reset any coloring of slots
                 vis.array.showKth({key: item, type: HASH_TYPE.BulkInsert, insertions: insertions, increment: ""});
                 if (table.length <= PRIMES[POINTER_CUT_OFF])
@@ -661,13 +662,14 @@ export default {
                   vis.graph.updateNode(HASH_GRAPH.Value2, ' ');
                 }
               },
-              [insertions, prevIdx]
+              [insertions, prevIdx, table]
             )
             prevIdx = hashBulkInsert(table, translateInput(item, "Array"));
           }
         }
 
         // when table is full or almost full
+//XXX get rid of this when we add expandAndReinsert to bulkInsert
         if (prevIdx === FULL_SIGNAL) {
           lastInput = i;
           [table, indexArr, valueArr, nullArr] = expandAndReinsert(table, 1);

src/algorithms/pseudocode/HashingInsertion.js

@@ -149,12 +149,12 @@ const main = `
             InsertAll
             For each key k1 in OldT \\B 31
             \\In{
-              // We call HashInsert recursively!
+              HashInsert(T, k1) // recursive! \\B 32
               \\Expl{ There will never be multiple levels of
                 recursion because the new table will be large enough
                 to easily accomodate all the keys that were in T.
+                We don't animate the details of these insertions.
               \\Expl}
-              HashInsert(T, k1) \\B 32
               \\Note{ Animation can stop at this line for each
                 key
               \\Note}