fix(queue-28): init file added

Author: Wakidur Rahaman

data-structure/linked-list/LinkedList.js

@@ -0,0 +1 @@
+// Init

data-structure/linked-list/LinkedListNode.js

@@ -1,6 +1,5 @@
 /**
- * A Queue is a linear structure which follows a particular order in which the operations are performed. 
- * The order is First In First Out (FIFO). 
+ * In computer science, a queue is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principle (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once a new element is added, all elements that were added before have to be removed before the new element can be removed. Often a peek or front operation is also entered, returning the value of the front element without dequeuing it. A queue is an example of a linear data structure, or more abstractly a sequential collection.
  * A good example of a queue would simply be a line at a grocery store. The customer in line (queue) first, will leave first. 
  * 
  * Here's a JavaScript implementation of a Queue data structure. 🔥

javascript-today-magazine/queue-data-structure.ts

@@ -0,0 +1,25 @@
+export default class Comparator {
+  /**
+   * Constructor.
+   * @param {function(a: *, b: *)} [compareFunction] - It may be custom compare function that, let's
+   * say may compare custom objects together.
+   */
+
+  constructor(compareFunction) {
+    this.compare = compareFunction || Comparator.defaultCompareFunction;
+  }
+
+  /**
+   * Default comparison function. It just assumes that 'a' and 'b' are strings or numbers.
+   * @param {(string|number)} a 
+   * @param {(string|number)} b 
+   * @returns {number}
+   */
+  static defaultCompareFunction(a, b) {
+    if (a === b) {
+      return 0;
+    }
+
+    return a < b ? -1 : 1;
+  }
+}

utils/comparator.js

@@ -0,0 +1,27 @@
+export default class Comparator {
+    [x: string]: (a: any, b: any) => 0 | 1 | -1;
+    /**
+     * Constructor.
+     * @param {function(a: *, b: *)} [compareFunction] - It may be custom compare function that, let's
+     * say may compare custom objects together.
+     */
+  
+    constructor(compareFunction: (a: any, b: any) => 0 | 1 | -1) {
+      this.compare = compareFunction || Comparator.defaultCompareFunction;
+    }
+  
+    /**
+     * Default comparison function. It just assumes that 'a' and 'b' are strings or numbers.
+     * @param {(string|number)} a 
+     * @param {(string|number)} b 
+     * @returns {number}
+     */
+    static defaultCompareFunction(a: number, b: number) {
+      if (a === b) {
+        return 0;
+      }
+  
+      return a < b ? -1 : 1;
+    }
+  }
+