--wip-- [skip ci]

Author: amejiarosario

.eslintignore

@@ -0,0 +1,6 @@
+/runtimes/**
+src/data-structures/maps/hash-maps/hashing.js
+src/data-structures/maps/hash-maps/*-test.js
+src/data-structures/maps/hash-maps/hash-map-*.js
+src/data-structures/linked-lists/linked-list-*.js
+src/data-structures/custom/lru-cache-*.js

.eslintrc.js

@@ -1,23 +1,23 @@
 module.exports = {
-  "extends": "airbnb-base",
-  "env": {
-    "jest": true
+  extends: 'airbnb-base',
+  env: {
+    jest: true
+  },
+  globals: {
+    BigInt: true,
   },
   rules: {
     // https://github.com/airbnb/javascript/issues/1089
 
     // https://stackoverflow.com/a/35637900/684957
     // allow to add properties to arguments
-    "no-param-reassign": [2, { "props": false }],
+    'no-param-reassign': [2, { 'props': false }],
 
     // https://eslint.org/docs/rules/no-plusplus
     // allows unary operators ++ and -- in the afterthought (final expression) of a for loop.
-    "no-plusplus": [2, { "allowForLoopAfterthoughts": true }],
+    'no-plusplus': [2, { 'allowForLoopAfterthoughts': true }],
 
     // Allow for..of
-    "no-restricted-syntax": [0, "ForOfStatement"],
-  },
-  globals: {
-    BigInt: true,
+    'no-restricted-syntax': [0, 'ForOfStatement'],
   }
 };

package-lock.json

@@ -3,14 +3,12 @@
   "version": "1.1.0",
   "description": "Data Structures & Algorithms in JS",
   "main": "./src/index.js",
-  "dependencies": {
-
-  },
+  "dependencies": {},
   "devDependencies": {
     "benchmark": "2.1.4",
     "eslint": "4.19.1",
-    "eslint-config-airbnb-base": "12.1.0",
-    "eslint-plugin-import": "2.12.0",
+    "eslint-config-airbnb-base": "^13.1.0",
+    "eslint-plugin-import": "^2.16.0",
     "eslint-plugin-jest": "21.17.0",
     "jest": "23.6.0",
     "textlint-plugin-asciidoctor": "1.0.2"
@@ -19,7 +17,8 @@
     "test": "jest src/",
     "watch": "jest src/ --watch --coverage",
     "coverage": "jest src/ --coverage && open coverage/lcov-report/index.html",
-    "linter": "npx eslint --fix -f codeframe src/"
+    "linter": "npx eslint --fix --format codeframe src/",
+    "ci": "npm run linter && npm test"
   },
   "keywords": [
     "algorithms",

package.json

@@ -16,8 +16,8 @@ function merge(array1, array2 = []) {
   // merge elements on a and b in asc order. Run-time O(a + b)
   for (let index = 0, i1 = 0, i2 = 0;
     index < mergedLength; index++) { // <1>
-    if (i2 >= array2.length ||
-      (i1 < array1.length && array1[i1] <= array2[i2])) {
+    if (i2 >= array2.length
+      || (i1 < array1.length && array1[i1] <= array2[i2])) {
       mergedArray[index] = array1[i1]; // <2>
       i1 += 1;
     } else {
@@ -45,7 +45,7 @@ function splitSort(array) {
   // base case
   if (size < 2) {
     return array;
-  } else if (size === 2) {
+  } if (size === 2) {
     return array[0] < array[1] ? array : [array[1], array[0]]; // <1>
   }
 

src/algorithms/sorting/merge-sort.js

@@ -1,4 +1,3 @@
-
 /**
  * Design and implement a data structure for Least Recently Used (LRU) cache.
  * It should support the following operations: get and put.
@@ -31,46 +30,41 @@
  *
  * @param {number} capacity
  */
-const LRUCache = (capacity) => {
-  this.map = new Map();
-  this.capacity = capacity;
-};
+class LRUCache {
+  constructor(capacity) {
+    this.map = new Map();
+    this.capacity = capacity;
+  }
 
-/**
-* @param {number} key
-* @return {number}
-*/
-LRUCache.prototype.get = (key) => {
-  const value = this.map.get(key);
-  if (value) {
-    this.moveToTop(key);
-    return value;
+  get(key) {
+    const value = this.map.get(key);
+    if (value) {
+      this.moveToTop(key);
+      return value;
+    }
+    return -1;
   }
-  return -1;
-};
 
-/**
-* @param {number} key
-* @param {number} value
-* @return {void}
-*/
-LRUCache.prototype.put = (key, value) => {
-  this.map.set(key, value);
-  this.rotate(key);
-};
+  put(key, value) {
+    this.map.set(key, value);
+    this.rotate(key);
+  }
 
-LRUCache.prototype.rotate = (key) => {
-  this.moveToTop(key);
-  while (this.map.size > this.capacity) {
-    const it = this.map.keys();
-    this.map.delete(it.next().value);
+  rotate(key) {
+    this.moveToTop(key);
+    while (this.map.size > this.capacity) {
+      const it = this.map.keys();
+      this.map.delete(it.next().value);
+    }
   }
-};
 
-LRUCache.prototype.moveToTop = (key) => {
-  if (this.map.has(key)) {
-    const value = this.map.get(key);
-    this.map.delete(key);
-    this.map.set(key, value);
+  moveToTop(key) {
+    if (this.map.has(key)) {
+      const value = this.map.get(key);
+      this.map.delete(key);
+      this.map.set(key, value);
+    }
   }
-};
+}
+
+module.exports = LRUCache;

src/data-structures/custom/lru-cache.js

@@ -1,5 +1,5 @@
-const Node = require('./node');
 const util = require('util');
+const Node = require('./node');
 
 // tag::constructor[]
 /**

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

@@ -74,4 +74,3 @@ module.exports = HashMap;
 // assert.equal(hashMap.get('cat'), 8); // got overwritten by art 😱
 // assert.equal(hashMap.get('rat'), 8); // got overwritten by art 😱
 // assert.equal(hashMap.get('dog'), 8); // got overwritten by art 😱
-

src/data-structures/maps/hash-maps/hash-map-1.js

@@ -32,6 +32,7 @@ class Queue {
   dequeue() {
     return this.items.removeFirst();
   }
+
   // end::dequeue[]
   /**
    * Size of the queue
@@ -66,4 +67,3 @@ queue.dequeue(); //↪️ b
 queue.dequeue(); //↪️ c
 // end::snippet[]
 // */
-

src/data-structures/queues/queue.js

@@ -85,4 +85,3 @@ class ArraySet {
 }
 
 module.exports = ArraySet;
-

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

@@ -87,4 +87,3 @@ class HashMapSet {
 }
 
 module.exports = HashMapSet;
-

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

@@ -72,4 +72,3 @@ class MapSet {
 }
 
 module.exports = MapSet;
-

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

@@ -37,4 +37,3 @@ Stack.prototype.push = Stack.prototype.add;
 Stack.prototype.pop = Stack.prototype.remove;
 
 module.exports = Stack;
-

src/data-structures/stacks/stack-1.js

@@ -67,4 +67,3 @@ stack.remove(); //↪️ c
 stack.remove(); //↪️ a
 // end::snippet[]
 // */
-

src/data-structures/stacks/stack.js

@@ -24,14 +24,14 @@ function balance(node) {
     // left subtree is higher than right subtree
     if (node.left.balanceFactor > 0) {
       return rightRotation(node);
-    } else if (node.left.balanceFactor < 0) {
+    } if (node.left.balanceFactor < 0) {
       return leftRightRotation(node);
     }
   } else if (node.balanceFactor < -1) {
     // right subtree is higher than left subtree
     if (node.right.balanceFactor < 0) {
       return leftRotation(node);
-    } else if (node.right.balanceFactor > 0) {
+    } if (node.right.balanceFactor > 0) {
       return rightLeftRotation(node);
     }
   }

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

@@ -69,7 +69,7 @@ class BinarySearchTree {
   findNodeAndParent(value, node = this.root, parent = null) {
     if (!node || node.value === value) {
       return { found: node, parent };
-    } else if (value < node.value) {
+    } if (value < node.value) {
       return this.findNodeAndParent(value, node.left, node);
     }
     return this.findNodeAndParent(value, node.right, node);

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

@@ -18,9 +18,9 @@ function binarySearchRecursive(array, search, offset = 0) {
 
   if (current === search) {
     return offset + half;
-  } else if (array.length < 2) {
+  } if (array.length < 2) {
     return -1;
-  } else if (search > current) {
+  } if (search > current) {
     const right = array.slice(half);
     return binarySearchRecursive(right, search, offset + half);
   }
@@ -49,7 +49,7 @@ function binarySearchIterative(array, search) {
 
     if (current === search) {
       return currentIndex;
-    } else if (search > current) {
+    } if (search > current) {
       start = currentIndex;
     } else if (search < current) {
       end = currentIndex;