🔧 chore eslint

Author: amejiarosario

src/data-structures/graphs/graph.js

@@ -47,7 +47,7 @@ class Graph {
   removeVertex(value) {
     const current = this.nodes.get(value); // <1>
     if (current) {
-      Array.from(this.nodes.values()).forEach(node => node.removeAdjacent(current)); // <2>
+      Array.from(this.nodes.values()).forEach((node) => node.removeAdjacent(current)); // <2>
     }
     return this.nodes.delete(value); // <3>
   }
@@ -156,7 +156,7 @@ class Graph {
       if (node && !visited.has(node)) {
         yield node;
         visited.set(node);
-        node.getAdjacents().forEach(adj => visitList.add(adj));
+        node.getAdjacents().forEach((adj) => visitList.add(adj));
       }
     }
   }
@@ -243,7 +243,7 @@ class Graph {
     sourceNode.getAdjacents().forEach((node) => {
       if (!newPath.has(node)) {
         const nextPaths = this.findAllPaths(node.value, destination, newPath);
-        nextPaths.forEach(nextPath => paths.push(nextPath));
+        nextPaths.forEach((nextPath) => paths.push(nextPath));
       }
     });
     return paths;

src/data-structures/graphs/graph.spec.js

@@ -2,7 +2,7 @@ const { Graph } = require('../../index');
 
 describe('Graph', () => {
   let graph;
-  const getValues = node => (Array.isArray(node) ? node.map(a => getValues(a)) : node.value);
+  const getValues = (node) => (Array.isArray(node) ? node.map((a) => getValues(a)) : node.value);
 
   beforeEach(() => {
     graph = new Graph();

src/data-structures/graphs/node.spec.js

@@ -10,7 +10,7 @@ describe('Node (Graph)', () => {
   describe('#addAdjacent', () => {
     it('should add node to adjacent list', () => {
       node.addAdjacent(new Node(2));
-      expect(node.getAdjacents().map(n => n.value)).toEqual([2]);
+      expect(node.getAdjacents().map((n) => n.value)).toEqual([2]);
     });
   });
 
@@ -32,26 +32,26 @@ describe('Node (Graph)', () => {
 
     it('should remove node to adjacent list', () => {
       expect(a.removeAdjacent(c)).toBe(true);
-      expect(node.getAdjacents().map(n => n.value)).toEqual(['b']);
+      expect(node.getAdjacents().map((n) => n.value)).toEqual(['b']);
 
       expect(a.removeAdjacent(b)).toBe(true);
-      expect(node.getAdjacents().map(n => n.value)).toEqual([]);
+      expect(node.getAdjacents().map((n) => n.value)).toEqual([]);
     });
 
     it('should return undefined if not found', () => {
       expect(a.removeAdjacent(d)).toBe(false);
-      expect(node.getAdjacents().map(n => n.value)).toEqual(['b', 'c']);
+      expect(node.getAdjacents().map((n) => n.value)).toEqual(['b', 'c']);
     });
   });
 
   describe('#getAdjacents', () => {
     it('should get adjacents', () => {
       node.addAdjacent(new Node('b'));
-      expect(node.getAdjacents().map(n => n.value)).toEqual(['b']);
+      expect(node.getAdjacents().map((n) => n.value)).toEqual(['b']);
     });
 
     it('should get adjacents when empty', () => {
-      expect(node.getAdjacents().map(n => n.value)).toEqual([]);
+      expect(node.getAdjacents().map((n) => n.value)).toEqual([]);
     });
   });
 

src/data-structures/linked-lists/linked-list.js

@@ -298,7 +298,7 @@ class LinkedList {
 
   toString() {
     const parts = [...this]; // see [Symbol.iterator]()
-    return parts.map(n => util.inspect(n.node.value)).join(' -> ');
+    return parts.map((n) => util.inspect(n.node.value)).join(' -> ');
   }
 }
 

src/data-structures/sets/array-set.js

@@ -9,7 +9,7 @@ class ArraySet {
    */
   constructor(iterable = []) {
     this.array = [];
-    Array.from(iterable).forEach(element => this.add(element));
+    Array.from(iterable).forEach((element) => this.add(element));
   }
 
   /**

src/data-structures/sets/hash-set.js

@@ -12,7 +12,7 @@ class HashMapSet {
    */
   constructor(iterable = []) {
     this.hashMap = new HashMap();
-    Array.from(iterable).forEach(element => this.add(element));
+    Array.from(iterable).forEach((element) => this.add(element));
   }
 
   /**

src/data-structures/sets/map-set.js

@@ -9,7 +9,7 @@ class MapSet {
    */
   constructor(iterable = []) {
     this.map = new Map();
-    Array.from(iterable).forEach(element => this.add(element));
+    Array.from(iterable).forEach((element) => this.add(element));
   }
 
   /**

src/data-structures/sets/tree-set.js

@@ -16,7 +16,7 @@ class TreeSet {
    */
   constructor(iterable = []) {
     this.tree = new Tree();
-    Array.from(iterable).forEach(value => this.add(value)); // <1>
+    Array.from(iterable).forEach((value) => this.add(value)); // <1>
   }
 
   /**

src/data-structures/trees/avl-tree.spec.js

@@ -69,7 +69,7 @@ describe('AvlTree', () => {
     });
 
     it('should not balance', () => {
-      [30, 20, 40, 10, 50].forEach(v => tree.add(v));
+      [30, 20, 40, 10, 50].forEach((v) => tree.add(v));
 
       expect(tree.toArray()).toEqual([
         30,

src/data-structures/trees/binary-search-tree.spec.js

@@ -2,7 +2,7 @@ const { BinarySearchTree } = require('../../index');
 
 describe('Binary Search Tree', () => {
   let bst;
-  const getValues = treeGenerator => Array.from(treeGenerator).map(node => node.value);
+  const getValues = (treeGenerator) => Array.from(treeGenerator).map((node) => node.value);
 
   beforeEach(() => {
     bst = new BinarySearchTree();
@@ -134,7 +134,7 @@ describe('Binary Search Tree', () => {
         // get keys
         expect(getValues(bst.inOrderTraversal())).toEqual([1, {}, 'dos']);
         // get data
-        expect(Array.from(bst.inOrderTraversal()).map(n => n.data())).toEqual([
+        expect(Array.from(bst.inOrderTraversal()).map((n) => n.data())).toEqual([
           1,
           fn,
           2,
@@ -312,7 +312,7 @@ describe('Binary Search Tree', () => {
 
       it('should generate an array from dfs', () => {
         const nodes = Array.from(bst.dfs());
-        const values = nodes.map(node => node.value);
+        const values = nodes.map((node) => node.value);
         expect(values).toEqual([10, 5, 4, 3, 30, 15, 40]);
       });
     });
@@ -326,15 +326,15 @@ describe('Binary Search Tree', () => {
     describe('#preOrderTraversal', () => {
       it('should generate an array from preOrderTraversal', () => {
         const nodes = Array.from(bst.preOrderTraversal());
-        const values = nodes.map(node => node.value);
+        const values = nodes.map((node) => node.value);
         expect(values).toEqual([10, 5, 4, 3, 30, 15, 40]);
       });
     });
 
     describe('#postOrderTraversal', () => {
       it('should generate an array from postOrderTraversal', () => {
         const nodes = Array.from(bst.postOrderTraversal());
-        const values = nodes.map(node => node.value);
+        const values = nodes.map((node) => node.value);
         expect(values).toEqual([3, 4, 5, 15, 40, 30, 10]);
       });
     });