fix coding styles

Author: amejiarosario

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

@@ -1,9 +1,13 @@
 
 /**
- * Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.
+ * Design and implement a data structure for Least Recently Used (LRU) cache.
+ * It should support the following operations: get and put.
 
-    get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
-    put(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.
+    get(key) - Get the value (will always be positive) of the key
+        if the key exists in the cache, otherwise return -1.
+    put(key, value) - Set or insert the value if the key is not already present.
+        When the cache reached its capacity, it should invalidate the least
+        recently used item before inserting a new item.
 
     Follow up:
     Could you do both operations in O(1) time complexity?
@@ -27,7 +31,7 @@
  *
  * @param {number} capacity
  */
-const LRUCache = function (capacity) {
+const LRUCache = (capacity) => {
   this.map = new Map();
   this.capacity = capacity;
 };
@@ -36,7 +40,7 @@ const LRUCache = function (capacity) {
 * @param {number} key
 * @return {number}
 */
-LRUCache.prototype.get = function (key) {
+LRUCache.prototype.get = (key) => {
   const value = this.map.get(key);
   if (value) {
     this.moveToTop(key);
@@ -50,20 +54,20 @@ LRUCache.prototype.get = function (key) {
 * @param {number} value
 * @return {void}
 */
-LRUCache.prototype.put = function (key, value) {
+LRUCache.prototype.put = (key, value) => {
   this.map.set(key, value);
   this.rotate(key);
 };
 
-LRUCache.prototype.rotate = function (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);
   }
 };
 
-LRUCache.prototype.moveToTop = function (key) {
+LRUCache.prototype.moveToTop = (key) => {
   if (this.map.has(key)) {
     const value = this.map.get(key);
     this.map.delete(key);

src/data-structures/maps/hash-maps/hashing.js

@@ -1,3 +1,5 @@
+/* eslint-disable */
+
 // tag::naiveHashCode[]
 /**
  * Naïve implementation of a non-cryptographic hashing function

src/data-structures/trees/red-black-tree.spec.js

@@ -27,11 +27,6 @@ describe('RedBlackTree', () => {
     });
 
     it('should balance tree by rotating left', () => {
-      // const n1 = tree.add(1);
-      // const n2 = tree.add(2);
-      // const n3 = tree.add(3);
-      // console.log(n3)
-
       expect(tree.size).toBe(3);
 
       expect(tree.toArray()).toEqual([