Fix some of eslint errors

Author: 64json

Backtracking/Knight's tour problem/code.js

@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+import { Array1DTracer, Array2DTracer, LogTracer } from 'algorithm-visualizer';
 
 /*
 For N>3 the time taken by this algorithm is sufficiently high
@@ -28,7 +28,7 @@ pos[0] = pos[1] = -1;
 
 const boardTracer = new Array2DTracer('Board').set(board);
 const posTracer = new Array1DTracer('Knight Position').set(pos);
-const logTracer = new LogTracer('Console');
+const logTracer = new LogTracer('Console').wait();
 
 function knightTour(x, y, moveNum) {
   if (moveNum === N * N) {
@@ -44,9 +44,9 @@ function knightTour(x, y, moveNum) {
     posTracer.denotify(0);
     posTracer.denotify(1);
     /*
-		Check if knight is still in the board
-		Check that knight does not visit an already visited square
-		*/
+    Check if knight is still in the board
+    Check that knight does not visit an already visited square
+    */
     if (nextX >= 0 && nextX < N && nextY >= 0 && nextY < N && board[nextX][nextY] === -1) {
       board[nextX][nextY] = moveNum;
 

Backtracking/N Queens Problem/code.js

@@ -1,6 +1,6 @@
-import { Array2DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+import { Array2DTracer, LogTracer } from 'algorithm-visualizer';
 
-const N = 4;	// just change the value of N and the visuals will reflect the configuration!
+const N = 4; // just change the value of N and the visuals will reflect the configuration!
 const board = (function createArray(N) {
   const result = [];
   for (let i = 0; i < N; i++) {
@@ -16,13 +16,13 @@ const queens = (function qSetup(N) {
   return result;
 }(N));
 
-let boardTracer = new Array2DTracer('Board'),
-  queenTracer = new Array2DTracer('Queen Positions'),
-  logger = new LogTracer('Progress');
+const boardTracer = new Array2DTracer('Board');
+const queenTracer = new Array2DTracer('Queen Positions');
+const logger = new LogTracer('Progress');
 
 boardTracer.set(board);
 queenTracer.set(queens);
-logger.print(`N Queens: ${N}X${N}matrix, ${N} queens`);
+logger.print(`N Queens: ${N}X${N}matrix, ${N} queens`).wait();
 
 function validState(row, col, currentQueen) {
   for (let q = 0; q < currentQueen; q++) {
@@ -42,8 +42,8 @@ function nQ(currentQueen, currentCol) {
     return true;
   }
 
-  let found = false,
-    row = 0;
+  let found = false;
+  let row = 0;
   while ((row < N) && (!found)) {
     boardTracer.select(row, currentCol).wait();
     logger.print(`Trying queen ${currentQueen} at row ${row} & col ${currentCol}`);

Cryptography/Affine Cipher/code.js

@@ -1,23 +1,11 @@
-import { Array1DTracer, LogTracer, Randomize, Tracer } from 'algorithm-visualizer';
+import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
 
-function randString(length) {
-  const choices = 'abcdefghijklmnopqrstuvwxyz';
-  let text = '';
-
-  for (let i = 0; i < length; i++) {
-    text += choices[Randomize.integer(0, choices.length - 1)];
-  }
-
-  return text;
-}
-
-// let plainText = randString (5);
 const plainText = 'secret';
 const ptTracer = new Array1DTracer('Encryption');
 const ctTracer = new Array1DTracer('Decryption');
 const logger = new LogTracer();
 
-ptTracer.set(plainText);
+ptTracer.set(plainText).wait();
 
 /*
  code assumes that plainText contains ONLY LOWER CASE ALPHABETS
@@ -27,8 +15,8 @@ Number.prototype.mod = function (n) {
   return ((this % n) + n) % n;
 };
 
-let keys = { a: 5, b: 7 },
-  N = 26;
+const keys = { a: 5, b: 7 };
+const N = 26;
 
 function encrypt(plainText) {
   let cypherText = '';
@@ -62,13 +50,13 @@ function encrypt(plainText) {
 
 function decrypt(cypherText) {
   let plainText = '';
-  const aInverse = (function () {
+  const aInverse = ((() => {
     for (let i = 1; i < N; i++) {
       if (((keys.a * i).mod(N)) === 1) {
         return i;
       }
     }
-  }());
+  })());
 
   logger.print(`a<sup>-1</sup> = ${aInverse}`);
 

Cryptography/Caesar Cipher/code.js

@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
 
 const string = 'hello! how are you doing?';
 const rotation = 5;
@@ -15,7 +15,7 @@ const encryptTracer = new Array1DTracer('Encryption');
 const decryptTracer = new Array1DTracer('Decryption');
 const logger = new LogTracer();
 
-encryptTracer.set(string);
+encryptTracer.set(string).wait();
 
 function getPosUp(pos) {
   return (pos === alphabet.length - 1) ? 0 : pos + 1;

Dynamic Programming/Catalan Number/code.js

@@ -1,4 +1,4 @@
-import { Array1DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+import { Array1DTracer, LogTracer } from 'algorithm-visualizer';
 
 const N = 10;
 const A = new Array(N + 1);
@@ -7,7 +7,7 @@ for (let i = N; i >= 0; i--) {
 }
 
 const tracer = new Array1DTracer(' Catalan Numbers ').set(A);
-const logger = new LogTracer();
+const logger = new LogTracer().wait();
 
 A[0] = 1;
 tracer.notify(0, A[0]).wait();

Dynamic Programming/Fibonacci Sequence/code.js

@@ -1,13 +1,12 @@
-import { Array1DTracer, Tracer } from 'algorithm-visualizer';
+import { Array1DTracer } from 'algorithm-visualizer';
 
 const tracer = new Array1DTracer('Sequence');
 const index = 15;
 const D = [1, 1];
 for (let i = 2; i < index; i++) {
   D.push(0);
 }
-tracer.set(D);
-
+tracer.set(D).wait();
 
 for (let i = 2; i < index; i++) {
   D[i] = D[i - 2] + D[i - 1];

Dynamic Programming/Integer Partition/code.js

@@ -1,17 +1,17 @@
-import { Array2DTracer, LogTracer, Randomize, Tracer } from 'algorithm-visualizer';
+import { Array2DTracer, LogTracer, Randomize } from 'algorithm-visualizer';
 
 const tracer = new Array2DTracer();
 const logger = new LogTracer();
 const integer = Randomize.integer(5, 14);
-let D = [],
-  A = [];
+const D = [];
+const A = [];
 for (let i = 0; i <= integer; i++) {
   D.push([]);
   D[0][i] = 1;
   D[i][1] = 1;
   for (let j = 0; j <= integer; j++) D[i][j] = 0;
 }
-tracer.set(D);
+tracer.set(D).wait();
 
 function partition(A, n, p) {
   if (n === 0) logger.print(`[${A.join(', ')}]`);

Dynamic Programming/Knapsack Problem/code.js

@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+import { Array1DTracer, Array2DTracer, LogTracer } from 'algorithm-visualizer';
 
 const val = [1, 4, 5, 7]; // The value of all available items
 const wt = [1, 3, 4, 5]; // The weights of available items
@@ -16,16 +16,15 @@ for (let i = 0; i < N + 1; i++) {
 const tracer = new Array2DTracer('Knapsack Table').set(DP);
 const dataViewer1 = new Array1DTracer('Values').set(val);
 const dataViewer2 = new Array1DTracer('Weights').set(wt);
-const logger = new LogTracer();
-
+const logger = new LogTracer().wait();
 
 for (let i = 0; i <= N; i++) {
   for (let j = 0; j <= W; j++) {
     if (i === 0 || j === 0) {
       /*
-			If we have no items or maximum weight we can take in collection is 0
-			then the total weight in our collection is 0
-			*/
+      If we have no items or maximum weight we can take in collection is 0
+      then the total weight in our collection is 0
+      */
       DP[i][0] = 0;
       tracer.notify(i, j, DP[i][j]).wait();
       tracer.denotify(i, j);
@@ -37,9 +36,9 @@ for (let i = 0; i <= N; i++) {
       const A = val[i - 1] + DP[i - 1][j - wt[i - 1]];
       const B = DP[i - 1][j];
       /*
-			find the maximum of these two values
-			and take which gives us a greater weight
-			 */
+      find the maximum of these two values
+      and take which gives us a greater weight
+       */
       if (A > B) {
         DP[i][j] = A;
         tracer.notify(i, j, DP[i][j]).wait();

Dynamic Programming/Longest Common Subsequence/code.js

@@ -1,4 +1,4 @@
-import { Array1DTracer, Array2DTracer, LogTracer, Tracer } from 'algorithm-visualizer';
+import { Array1DTracer, Array2DTracer, LogTracer } from 'algorithm-visualizer';
 
 const string1 = 'AGGTAB';
 const string2 = 'GXTXAYB';
@@ -12,42 +12,42 @@ for (let i = 0; i < m + 1; i++) {
 const tracer1 = new Array1DTracer('String 1').set(string1);
 const tracer2 = new Array1DTracer('String 2').set(string2);
 const tracer3 = new Array2DTracer('Memo Table').set(A);
-const logger = new LogTracer();
+const logger = new LogTracer().wait();
 
-let i,
-  j;
+let i;
+let j;
 
 // Build the memo table in bottom up fashion
 for (i = 0; i <= m; i++) {
- 	for (j = 0; j <= n; j++) {
- 		if (i === 0 || j === 0) {
- 			A[i][j] = 0;
- 		} else if (string1[i - 1] === string2[j - 1]) {
- 			tracer1.select(i - 1).wait();
- 			tracer2.select(j - 1).wait();
- 			tracer3.select(i - 1, j - 1).wait();
+  for (j = 0; j <= n; j++) {
+    if (i === 0 || j === 0) {
+      A[i][j] = 0;
+    } else if (string1[i - 1] === string2[j - 1]) {
+      tracer1.select(i - 1).wait();
+      tracer2.select(j - 1).wait();
+      tracer3.select(i - 1, j - 1).wait();
 
- 			A[i][j] = A[i - 1][j - 1] + 1;
+      A[i][j] = A[i - 1][j - 1] + 1;
 
- 			tracer1.deselect(i - 1);
- 			tracer2.deselect(j - 1);
- 			tracer3.deselect(i - 1, j - 1);
- 		} else {
- 			tracer3.select(i - 1, j).wait();
- 			tracer3.select(i, j - 1).wait();
+      tracer1.deselect(i - 1);
+      tracer2.deselect(j - 1);
+      tracer3.deselect(i - 1, j - 1);
+    } else {
+      tracer3.select(i - 1, j).wait();
+      tracer3.select(i, j - 1).wait();
 
- 			if (A[i - 1][j] > A[i][j - 1]) {
- 				A[i][j] = A[i - 1][j];
- 			} else {
- 				A[i][j] = A[i][j - 1];
- 			}
+      if (A[i - 1][j] > A[i][j - 1]) {
+        A[i][j] = A[i - 1][j];
+      } else {
+        A[i][j] = A[i][j - 1];
+      }
 
- 			tracer3.deselect(i - 1, j);
- 			tracer3.deselect(i, j - 1);
- 		}
- 		tracer3.notify(i, j, A[i][j]).wait();
- 		tracer3.denotify(i, j);
- 	}
+      tracer3.deselect(i - 1, j);
+      tracer3.deselect(i, j - 1);
+    }
+    tracer3.notify(i, j, A[i][j]).wait();
+    tracer3.denotify(i, j);
+  }
 }
 
 let finalString = '';
@@ -57,7 +57,7 @@ while (i >= 1 && j >= 1) {
   tracer3.select(i, j).wait();
   if (string1[i - 1] === string2[j - 1]) {
     tracer1.select(i - 1).wait();
- 		tracer2.select(j - 1).wait();
+    tracer2.select(j - 1).wait();
 
     finalString = string1[i - 1] + finalString;
     i--;

Dynamic Programming/Longest Increasing Subsequence/code.js

@@ -1,10 +1,10 @@
-import { Array1DTracer, LogTracer, Randomize, Tracer } from 'algorithm-visualizer';
+import { Array1DTracer, LogTracer, Randomize } from 'algorithm-visualizer';
 
 const tracer = new Array1DTracer();
 const logger = new LogTracer();
 const A = Randomize.array1D(10, { min: 0, max: 10 });
 const LIS = new Array(A.length);
-tracer.set(A);
+tracer.set(A).wait();
 
 // Initialize LIS values for all indexes
 for (let i = 0; i < A.length; i++) {