need quokka; setup for node logging

Author: iandoyle

.huskyrc.json

@@ -1,5 +0,0 @@
-{
-  "hooks": {
-    "pre-commit": "npm run lint && npm run test"
-  }
-}

src/data-structures/bloom-filter/BloomFilter.js

@@ -1,4 +1,4 @@
-export default class BloomFilter {
+module.exports = class BloomFilter {
   /**
    * @param {number} size - the size of the storage.
    */
@@ -50,7 +50,11 @@ export default class BloomFilter {
     const storage = [];
 
     // Initialize all indexes to false
-    for (let storageCellIndex = 0; storageCellIndex < size; storageCellIndex += 1) {
+    for (
+      let storageCellIndex = 0;
+      storageCellIndex < size;
+      storageCellIndex += 1
+    ) {
       storage.push(false);
     }
 
@@ -122,10 +126,6 @@ export default class BloomFilter {
    * @return {number[]}
    */
   getHashValues(item) {
-    return [
-      this.hash1(item),
-      this.hash2(item),
-      this.hash3(item),
-    ];
+    return [this.hash1(item), this.hash2(item), this.hash3(item)];
   }
-}
+};

src/data-structures/hash-table/HashTable.js

@@ -1,18 +1,20 @@
-import LinkedList from '../linked-list/LinkedList';
+const LinkedList = require('../linked-list/LinkedList');
 
 // Hash table size directly affects on the number of collisions.
 // The bigger the hash table size the less collisions you'll get.
 // For demonstrating purposes hash table size is small to show how collisions
 // are being handled.
 const defaultHashTableSize = 32;
 
-export default class HashTable {
+module.exports = class HashTable {
   /**
    * @param {number} hashTableSize
    */
   constructor(hashTableSize = defaultHashTableSize) {
     // Create hash table of certain size and fill each bucket with empty linked list.
-    this.buckets = Array(hashTableSize).fill(null).map(() => new LinkedList());
+    this.buckets = Array(hashTableSize)
+      .fill(null)
+      .map(() => new LinkedList());
 
     // Just to keep track of all actual keys in a fast way.
     this.keys = {};
@@ -36,7 +38,7 @@ export default class HashTable {
     // where charCodeAt(i) is the i-th character code of the key, n is the length of the key and
     // PRIME is just any prime number like 31.
     const hash = Array.from(key).reduce(
-      (hashAccumulator, keySymbol) => (hashAccumulator + keySymbol.charCodeAt(0)),
+      (hashAccumulator, keySymbol) => hashAccumulator + keySymbol.charCodeAt(0),
       0,
     );
 
@@ -52,7 +54,9 @@ export default class HashTable {
     const keyHash = this.hash(key);
     this.keys[key] = keyHash;
     const bucketLinkedList = this.buckets[keyHash];
-    const node = bucketLinkedList.find({ callback: nodeValue => nodeValue.key === key });
+    const node = bucketLinkedList.find({
+      callback: nodeValue => nodeValue.key === key,
+    });
 
     if (!node) {
       // Insert new node.
@@ -71,7 +75,9 @@ export default class HashTable {
     const keyHash = this.hash(key);
     delete this.keys[key];
     const bucketLinkedList = this.buckets[keyHash];
-    const node = bucketLinkedList.find({ callback: nodeValue => nodeValue.key === key });
+    const node = bucketLinkedList.find({
+      callback: nodeValue => nodeValue.key === key,
+    });
 
     if (node) {
       return bucketLinkedList.delete(node.value);
@@ -86,7 +92,9 @@ export default class HashTable {
    */
   get(key) {
     const bucketLinkedList = this.buckets[this.hash(key)];
-    const node = bucketLinkedList.find({ callback: nodeValue => nodeValue.key === key });
+    const node = bucketLinkedList.find({
+      callback: nodeValue => nodeValue.key === key,
+    });
 
     return node ? node.value.value : undefined;
   }
@@ -105,4 +113,4 @@ export default class HashTable {
   getKeys() {
     return Object.keys(this.keys);
   }
-}
+};

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

@@ -1,7 +1,7 @@
-import LinkedListNode from './LinkedListNode';
-import Comparator from '../../utils/comparator/Comparator';
+const LinkedListNode = require('./LinkedListNode');
+const Comparator = require('../../utils/comparator/Comparator');
 
-export default class LinkedList {
+module.exports = class LinkedList {
   /**
    * @param {Function} [comparatorFunction]
    */
@@ -205,7 +205,9 @@ export default class LinkedList {
    * @return {string}
    */
   toString(callback) {
-    return this.toArray().map(node => node.toString(callback)).toString();
+    return this.toArray()
+      .map(node => node.toString(callback))
+      .toString();
   }
 
   /**
@@ -235,4 +237,4 @@ export default class LinkedList {
 
     return this;
   }
-}
+};

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

@@ -1,4 +1,4 @@
-export default class LinkedListNode {
+module.exports = class LinkedListNode {
   constructor(value, next = null) {
     this.value = value;
     this.next = next;
@@ -7,4 +7,4 @@ export default class LinkedListNode {
   toString(callback) {
     return callback ? callback(this.value) : `${this.value}`;
   }
-}
+};

src/utils/comparator/Comparator.js

@@ -1,4 +1,4 @@
-export default class Comparator {
+module.exports = class Comparator {
   /**
    * @param {function(a: *, b: *)} [compareFunction] - It may be custom compare function that, let's
    * say may compare custom objects together.
@@ -78,4 +78,4 @@ export default class Comparator {
     const compareOriginal = this.compare;
     this.compare = (a, b) => compareOriginal(b, a);
   }
-}
+};