nlptoolkit-datastructure 1.0.7 → 1.0.9

package/README.md

@@ -7,7 +7,7 @@ For Developers
 ============
 
 You can also see [Java](https://github.com/starlangsoftware/DataStructure), [Python](https://github.com/starlangsoftware/DataStructure-Py), 
-[Cython](https://github.com/starlangsoftware/DataStructure-Cy), [Swift](https://github.com/starlangsoftware/DataStructure-Swift), [C](https://github.com/starlangsoftware/DataStructure-C), 
+[Cython](https://github.com/starlangsoftware/DataStructure-Cy), [Swift](https://github.com/starlangsoftware/DataStructure-Swift), [Php](https://github.com/starlangsoftware/DataStructure-Php), [C](https://github.com/starlangsoftware/DataStructure-C), 
 [C#](https://github.com/starlangsoftware/DataStructure-CS), or [C++](https://github.com/starlangsoftware/DataStructure-CPP) repository.
 
 ## Requirements

package/dist/CounterHashMap.js

@@ -1,131 +1,121 @@
-(function (factory) {
-    if (typeof module === "object" && typeof module.exports === "object") {
-        var v = factory(require, exports);
-        if (v !== undefined) module.exports = v;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CounterHashMap = void 0;
+class CounterHashMap extends Map {
+    constructor() {
+        super();
     }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports"], factory);
+    /**
+     * The put method takes a K type input. If this map contains a mapping for the key, it puts this key after
+     * incrementing its value by one. If his map does not contain a mapping, then it directly puts key with the value of 1.
+     *
+     * @param key to put.
+     */
+    put(key) {
+        if (this.has(key)) {
+            this.set(key, this.get(key) + 1);
+        }
+        else {
+            this.set(key, 1);
+        }
     }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.CounterHashMap = void 0;
-    class CounterHashMap extends Map {
-        constructor() {
-            super();
+    /**
+     * The putNTimes method takes a K and an integer N as inputs. If this map contains a mapping for the key, it puts this key after
+     * incrementing its value by N. If his map does not contain a mapping, then it directly puts key with the value of N.
+     *
+     * @param key to put.
+     * @param N   to increment value.
+     */
+    putNTimes(key, N) {
+        if (this.has(key)) {
+            this.set(key, this.get(key) + N);
         }
-        /**
-         * The put method takes a K type input. If this map contains a mapping for the key, it puts this key after
-         * incrementing its value by one. If his map does not contain a mapping, then it directly puts key with the value of 1.
-         *
-         * @param key to put.
-         */
-        put(key) {
-            if (this.has(key)) {
-                this.set(key, this.get(key) + 1);
-            }
-            else {
-                this.set(key, 1);
-            }
+        else {
+            this.set(key, N);
         }
-        /**
-         * The putNTimes method takes a K and an integer N as inputs. If this map contains a mapping for the key, it puts this key after
-         * incrementing its value by N. If his map does not contain a mapping, then it directly puts key with the value of N.
-         *
-         * @param key to put.
-         * @param N   to increment value.
-         */
-        putNTimes(key, N) {
-            if (this.has(key)) {
-                this.set(key, this.get(key) + N);
-            }
-            else {
-                this.set(key, N);
-            }
+    }
+    /**
+     * The count method takes a K as input, if this map contains a mapping for the key, it returns the value corresponding
+     * this key, 0 otherwise.
+     *
+     * @param key to get value.
+     * @return the value corresponding given key, 0 if it is not mapped.
+     */
+    count(key) {
+        if (this.has(key)) {
+            return this.get(key);
         }
-        /**
-         * The count method takes a K as input, if this map contains a mapping for the key, it returns the value corresponding
-         * this key, 0 otherwise.
-         *
-         * @param key to get value.
-         * @return the value corresponding given key, 0 if it is not mapped.
-         */
-        count(key) {
-            if (this.has(key)) {
-                return this.get(key);
-            }
-            else {
-                return 0;
-            }
+        else {
+            return 0;
         }
-        /**
-         * The sumOfCounts method loops through the values contained in this map and accumulates the counts of this values.
-         *
-         * @return accumulated counts.
-         */
-        sumOfCounts() {
-            let sum = 0;
-            for (let count of this.values()) {
-                sum += count;
-            }
-            return sum;
+    }
+    /**
+     * The sumOfCounts method loops through the values contained in this map and accumulates the counts of this values.
+     *
+     * @return accumulated counts.
+     */
+    sumOfCounts() {
+        let sum = 0;
+        for (let count of this.values()) {
+            sum += count;
         }
-        /**
-         * The max method takes a threshold as input and loops through the mappings contained in this map. It accumulates the
-         * count values and if the current entry's count value is greater than maxCount, which is initialized as 0,
-         * it updates the maxCount as current count and maxKey as the current count's key.
-         * <p>
-         * At the end of the loop, if the ratio of maxCount/total is greater than the given threshold it returns maxKey, else null.
-         *
-         * @param threshold double value.
-         * @return K type maxKey if greater than the given threshold, null otherwise.
-         */
-        max(threshold = 0.0) {
-            let maxCount = 0;
-            let total = 0;
-            let maxKey;
-            for (const [key, value] of this.entries()) {
-                let count = value;
-                total += count;
-                if (count > maxCount) {
-                    maxCount = count;
-                    maxKey = key;
-                }
-            }
-            if (maxCount / total > threshold) {
-                return maxKey;
-            }
-            else {
-                return undefined;
+        return sum;
+    }
+    /**
+     * The max method takes a threshold as input and loops through the mappings contained in this map. It accumulates the
+     * count values and if the current entry's count value is greater than maxCount, which is initialized as 0,
+     * it updates the maxCount as current count and maxKey as the current count's key.
+     * <p>
+     * At the end of the loop, if the ratio of maxCount/total is greater than the given threshold it returns maxKey, else null.
+     *
+     * @param threshold double value.
+     * @return K type maxKey if greater than the given threshold, null otherwise.
+     */
+    max(threshold = 0.0) {
+        let maxCount = 0;
+        let total = 0;
+        let maxKey;
+        for (const [key, value] of this.entries()) {
+            let count = value;
+            total += count;
+            if (count > maxCount) {
+                maxCount = count;
+                maxKey = key;
             }
         }
-        /**
-         * The add method adds value of each key of toBeAdded to the current counterHashMap.
-         *
-         * @param toBeAdded CounterHashMap to be added to this counterHashMap.
-         */
-        add(toBeAdded) {
-            for (let value of toBeAdded.keys()) {
-                this.putNTimes(value, toBeAdded.get(value));
-            }
+        if (maxCount / total > threshold) {
+            return maxKey;
         }
-        /**
-         * The topN method takes an integer N as inout. It creates an {@link Array} result and loops through the the
-         * mappings contained in this map and adds each entry to the result {@link Array}. Then sort this {@link Array}
-         * according to their values and returns an {@link Array} which is a sublist of result with N elements.
-         *
-         * @param N Integer value for defining size of the sublist.
-         * @return a sublist of N element.
-         */
-        topN(N) {
-            var result = [];
-            for (let entry of this.entries()) {
-                result.push(entry);
-            }
-            result.sort((a, b) => (a[1] > b[1]) ? -1 : ((b[1] > a[1]) ? 1 : 0));
-            return result;
+        else {
+            return undefined;
+        }
+    }
+    /**
+     * The add method adds value of each key of toBeAdded to the current counterHashMap.
+     *
+     * @param toBeAdded CounterHashMap to be added to this counterHashMap.
+     */
+    add(toBeAdded) {
+        for (let value of toBeAdded.keys()) {
+            this.putNTimes(value, toBeAdded.get(value));
+        }
+    }
+    /**
+     * The topN method takes an integer N as inout. It creates an {@link Array} result and loops through the the
+     * mappings contained in this map and adds each entry to the result {@link Array}. Then sort this {@link Array}
+     * according to their values and returns an {@link Array} which is a sublist of result with N elements.
+     *
+     * @param N Integer value for defining size of the sublist.
+     * @return a sublist of N element.
+     */
+    topN(N) {
+        var result = [];
+        for (let entry of this.entries()) {
+            result.push(entry);
         }
+        result.sort((a, b) => (a[1] > b[1]) ? -1 : ((b[1] > a[1]) ? 1 : 0));
+        return result;
     }
-    exports.CounterHashMap = CounterHashMap;
-});
+}
+exports.CounterHashMap = CounterHashMap;
 //# sourceMappingURL=CounterHashMap.js.map

package/dist/CounterHashMap.js.map

@@ -1 +1 @@
-{"version":3,"file":"CounterHashMap.js","sourceRoot":"","sources":["../source/CounterHashMap.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,MAAa,cAAkB,SAAQ,GAAc;QAEjD;YACI,KAAK,EAAE,CAAC;QACZ,CAAC;QAED;;;;;WAKG;QACH,GAAG,CAAC,GAAM;YACN,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAC;gBACd,IAAI,CAAC,GAAG,CAAC,GAAG,EAAU,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;aAC3C;iBAAM;gBACH,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;aACnB;QACL,CAAC;QAED;;;;;;WAMG;QACH,SAAS,CAAC,GAAM,EAAE,CAAS;YACvB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAC;gBACd,IAAI,CAAC,GAAG,CAAC,GAAG,EAAU,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;aAC3C;iBAAM;gBACH,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;aACnB;QACL,CAAC;QAED;;;;;;WAMG;QACH,KAAK,CAAC,GAAM;YACR,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAC;gBACd,OAAe,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;aAC/B;iBAAM;gBACH,OAAO,CAAC,CAAA;aACX;QACL,CAAC;QAED;;;;WAIG;QACH,WAAW;YACP,IAAI,GAAG,GAAG,CAAC,CAAA;YACX,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAC;gBAC5B,GAAG,IAAI,KAAK,CAAA;aACf;YACD,OAAO,GAAG,CAAA;QACd,CAAC;QAED;;;;;;;;;WASG;QACH,GAAG,CAAC,YAAoB,GAAG;YACvB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,MAAM,CAAA;YACV,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;gBACvC,IAAI,KAAK,GAAG,KAAK,CAAA;gBACjB,KAAK,IAAI,KAAK,CAAA;gBACd,IAAI,KAAK,GAAG,QAAQ,EAAE;oBAClB,QAAQ,GAAG,KAAK,CAAA;oBAChB,MAAM,GAAG,GAAG,CAAA;iBACf;aACJ;YACD,IAAI,QAAQ,GAAG,KAAK,GAAG,SAAS,EAAC;gBAC7B,OAAU,MAAM,CAAA;aACnB;iBAAM;gBACH,OAAO,SAAS,CAAA;aACnB;QACL,CAAC;QAED;;;;WAIG;QACH,GAAG,CAAC,SAA4B;YAC5B,KAAK,IAAI,KAAK,IAAI,SAAS,CAAC,IAAI,EAAE,EAAC;gBAC/B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAU,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;aACtD;QACL,CAAC;QAED;;;;;;;WAOG;QACH,IAAI,CAAC,CAAS;YACV,IAAI,MAAM,GAAwB,EAAE,CAAA;YACpC,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,EAAC;gBAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;aACrB;YACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACnE,OAAO,MAAM,CAAA;QACjB,CAAC;KAEJ;IAxHD,wCAwHC"}
+{"version":3,"file":"CounterHashMap.js","sourceRoot":"","sources":["../source/CounterHashMap.ts"],"names":[],"mappings":";;;AAAA,MAAa,cAAkB,SAAQ,GAAc;IAEjD;QACI,KAAK,EAAE,CAAC;IACZ,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,GAAM;QACN,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAC,CAAC;YACf,IAAI,CAAC,GAAG,CAAC,GAAG,EAAU,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC5C,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACpB,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,SAAS,CAAC,GAAM,EAAE,CAAS;QACvB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAC,CAAC;YACf,IAAI,CAAC,GAAG,CAAC,GAAG,EAAU,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC5C,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QACpB,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,GAAM;QACR,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAC,CAAC;YACf,OAAe,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAChC,CAAC;aAAM,CAAC;YACJ,OAAO,CAAC,CAAA;QACZ,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,WAAW;QACP,IAAI,GAAG,GAAG,CAAC,CAAA;QACX,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAC,CAAC;YAC7B,GAAG,IAAI,KAAK,CAAA;QAChB,CAAC;QACD,OAAO,GAAG,CAAA;IACd,CAAC;IAED;;;;;;;;;OASG;IACH,GAAG,CAAC,YAAoB,GAAG;QACvB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,CAAA;QACV,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;YACxC,IAAI,KAAK,GAAG,KAAK,CAAA;YACjB,KAAK,IAAI,KAAK,CAAA;YACd,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACnB,QAAQ,GAAG,KAAK,CAAA;gBAChB,MAAM,GAAG,GAAG,CAAA;YAChB,CAAC;QACL,CAAC;QACD,IAAI,QAAQ,GAAG,KAAK,GAAG,SAAS,EAAC,CAAC;YAC9B,OAAU,MAAM,CAAA;QACpB,CAAC;aAAM,CAAC;YACJ,OAAO,SAAS,CAAA;QACpB,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,SAA4B;QAC5B,KAAK,IAAI,KAAK,IAAI,SAAS,CAAC,IAAI,EAAE,EAAC,CAAC;YAChC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAU,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;QACvD,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,CAAS;QACV,IAAI,MAAM,GAAwB,EAAE,CAAA;QACpC,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,EAAC,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACtB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACnE,OAAO,MAAM,CAAA;IACjB,CAAC;CAEJ;AAxHD,wCAwHC"}

package/dist/LRUCache.js

@@ -1,69 +1,61 @@
-(function (factory) {
-    if (typeof module === "object" && typeof module.exports === "object") {
-        var v = factory(require, exports);
-        if (v !== undefined) module.exports = v;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LRUCache = void 0;
+class LRUCache {
+    cacheSize;
+    map;
+    /**
+     * A constructor of {@link LRUCache} class which takes cacheSize as input. It creates new {@link Map} and
+     * {@link Map}.
+     *
+     * @param cacheSize Integer input defining cache size.
+     */
+    constructor(cacheSize) {
+        this.cacheSize = cacheSize;
+        this.map = new Map();
     }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports"], factory);
+    /**
+     * The contains method takes a K type input key and returns true if the {@link Map} has the given key, false otherwise.
+     *
+     * @param key K type input key.
+     * @return true if the {@link Map} has the given key, false otherwise.
+     */
+    contains(key) {
+        return this.map.has(key);
     }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.LRUCache = void 0;
-    class LRUCache {
-        /**
-         * A constructor of {@link LRUCache} class which takes cacheSize as input. It creates new {@link Map} and
-         * {@link Map}.
-         *
-         * @param cacheSize Integer input defining cache size.
-         */
-        constructor(cacheSize) {
-            this.cacheSize = cacheSize;
-            this.map = new Map();
+    /**
+     * The get method takes K type input key and returns the least recently used value. First it checks whether the {@link Map}
+     * has the given key, if so it gets the corresponding cacheNode. It removes that element from map
+     * and adds it again to the beginning of the map since it is more likely to be used again. At the end, returns the
+     * data value.
+     *
+     * @param key K type input key.
+     * @return data value if the {@link Map} has the given key, null otherwise.
+     */
+    get(key) {
+        if (this.map.has(key)) {
+            let value = this.map.get(key);
+            this.map.delete(key);
+            this.map.set(key, value);
+            return value;
         }
-        /**
-         * The contains method takes a K type input key and returns true if the {@link Map} has the given key, false otherwise.
-         *
-         * @param key K type input key.
-         * @return true if the {@link Map} has the given key, false otherwise.
-         */
-        contains(key) {
-            return this.map.has(key);
-        }
-        /**
-         * The get method takes K type input key and returns the least recently used value. First it checks whether the {@link Map}
-         * has the given key, if so it gets the corresponding cacheNode. It removes that element from map
-         * and adds it again to the beginning of the map since it is more likely to be used again. At the end, returns the
-         * data value.
-         *
-         * @param key K type input key.
-         * @return data value if the {@link Map} has the given key, null otherwise.
-         */
-        get(key) {
-            if (this.map.has(key)) {
-                let value = this.map.get(key);
-                this.map.delete(key);
-                this.map.set(key, value);
-                return value;
-            }
-            return null;
-        }
-        /**
-         * The add method take a key and a data as inputs. First it checks the size of the {@link Map}, if it is full (i.e
-         * equal to the given cacheSize) then it removes the last node. If it has space for new entries,
-         * it creates new node with given inputs and puts it to the {@link Map}.
-         *
-         * @param key  K type input.
-         * @param data T type input
-         */
-        add(key, data) {
-            if (this.map.size == this.cacheSize) {
-                let firstKey = this.map.entries().next().value;
-                this.map.delete(firstKey);
-            }
-            this.map.set(key, data);
+        return null;
+    }
+    /**
+     * The add method take a key and a data as inputs. First it checks the size of the {@link Map}, if it is full (i.e
+     * equal to the given cacheSize) then it removes the last node. If it has space for new entries,
+     * it creates new node with given inputs and puts it to the {@link Map}.
+     *
+     * @param key  K type input.
+     * @param data T type input
+     */
+    add(key, data) {
+        if (this.map.size == this.cacheSize) {
+            let firstKey = this.map.entries().next().value;
+            this.map.delete(firstKey);
         }
+        this.map.set(key, data);
     }
-    exports.LRUCache = LRUCache;
-});
+}
+exports.LRUCache = LRUCache;
 //# sourceMappingURL=LRUCache.js.map

package/dist/LRUCache.js.map

@@ -1 +1 @@
-{"version":3,"file":"LRUCache.js","sourceRoot":"","sources":["../source/LRUCache.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,MAAa,QAAQ;QAKjB;;;;;WAKG;QACH,YAAY,SAAiB;YACzB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;YAC1B,IAAI,CAAC,GAAG,GAAG,IAAI,GAAG,EAAQ,CAAA;QAC9B,CAAC;QAED;;;;;WAKG;QACH,QAAQ,CAAC,GAAM;YACX,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC5B,CAAC;QAED;;;;;;;;WAQG;QACH,GAAG,CAAC,GAAM;YACN,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;gBACnB,IAAI,KAAK,GAAW,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACrC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBACpB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;gBACxB,OAAO,KAAK,CAAC;aAChB;YACD,OAAO,IAAI,CAAA;QACf,CAAC;QAED;;;;;;;WAOG;QACH,GAAG,CAAC,GAAM,EAAE,IAAO;YACf,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE;gBACjC,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAA;gBAC9C,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;aAC5B;YACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAC3B,CAAC;KACJ;IA5DD,4BA4DC"}
+{"version":3,"file":"LRUCache.js","sourceRoot":"","sources":["../source/LRUCache.ts"],"names":[],"mappings":";;;AAAA,MAAa,QAAQ;IAEA,SAAS,CAAQ;IAC1B,GAAG,CAAW;IAEtB;;;;;OAKG;IACH,YAAY,SAAiB;QACzB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;QAC1B,IAAI,CAAC,GAAG,GAAG,IAAI,GAAG,EAAQ,CAAA;IAC9B,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,GAAM;QACX,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC5B,CAAC;IAED;;;;;;;;OAQG;IACH,GAAG,CAAC,GAAM;QACN,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,IAAI,KAAK,GAAW,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACrC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACpB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;YACxB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAA;IACf,CAAC;IAED;;;;;;;OAOG;IACH,GAAG,CAAC,GAAM,EAAE,IAAO;QACf,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAClC,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAA;YAC9C,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;QAC7B,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;IAC3B,CAAC;CACJ;AA5DD,4BA4DC"}

package/dist/Queue.d.ts

@@ -3,10 +3,34 @@ export declare class Queue<T> {
     private head;
     private tail;
     private maxSize;
+    /**
+     * Constructor of the queue data structure
+     * @param maxSize Maximum size of the queue
+     */
     constructor(maxSize: number);
+    /**
+     * Adds a set of elements to the end of the queue
+     * @param items Elements to be inserted into the queue
+     */
     enqueueAll(items: Array<T>): void;
+    /**
+     * Adds an element to the end of the queue.
+     * @param item Element added to the queue.
+     */
     enqueue(item: T): void;
+    /**
+     * Removes an element from the start of the queue.
+     * @return Removed item
+     */
     dequeue(): T;
+    /**
+     * Returns head of the queue.
+     * @return Head of the queue
+     */
     peek(): T;
+    /**
+     * Checks if the queue is empty or not.
+     * @return Returns true if the queue is empty, false otherwise.
+     */
     isEmpty(): boolean;
 }

package/dist/Queue.js

@@ -1,44 +1,61 @@
-(function (factory) {
-    if (typeof module === "object" && typeof module.exports === "object") {
-        var v = factory(require, exports);
-        if (v !== undefined) module.exports = v;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Queue = void 0;
+class Queue {
+    list = [];
+    head;
+    tail;
+    maxSize;
+    /**
+     * Constructor of the queue data structure
+     * @param maxSize Maximum size of the queue
+     */
+    constructor(maxSize) {
+        this.head = 0;
+        this.tail = 0;
+        this.maxSize = maxSize;
+        this.list = new Array(maxSize);
     }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports"], factory);
-    }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.Queue = void 0;
-    class Queue {
-        constructor(maxSize) {
-            this.list = [];
-            this.head = 0;
-            this.tail = 0;
-            this.maxSize = maxSize;
-            this.list = new Array(maxSize);
-        }
-        enqueueAll(items) {
-            for (let item of items) {
-                this.enqueue(item);
-            }
-        }
-        enqueue(item) {
-            this.list[this.tail] = item;
-            this.tail = (this.tail + 1) % this.maxSize;
-        }
-        dequeue() {
-            let item = this.list[this.head];
-            this.head = (this.head + 1) % this.maxSize;
-            return item;
-        }
-        peek() {
-            return this.list[this.head];
-        }
-        isEmpty() {
-            return this.head == this.tail;
+    /**
+     * Adds a set of elements to the end of the queue
+     * @param items Elements to be inserted into the queue
+     */
+    enqueueAll(items) {
+        for (let item of items) {
+            this.enqueue(item);
         }
     }
-    exports.Queue = Queue;
-});
+    /**
+     * Adds an element to the end of the queue.
+     * @param item Element added to the queue.
+     */
+    enqueue(item) {
+        this.list[this.tail] = item;
+        this.tail = (this.tail + 1) % this.maxSize;
+    }
+    /**
+     * Removes an element from the start of the queue.
+     * @return Removed item
+     */
+    dequeue() {
+        let item = this.list[this.head];
+        this.head = (this.head + 1) % this.maxSize;
+        return item;
+    }
+    /**
+     * Returns head of the queue.
+     * @return Head of the queue
+     */
+    peek() {
+        return this.list[this.head];
+    }
+    /**
+     * Checks if the queue is empty or not.
+     * @return Returns true if the queue is empty, false otherwise.
+     */
+    isEmpty() {
+        return this.head == this.tail;
+    }
+}
+exports.Queue = Queue;
 //# sourceMappingURL=Queue.js.map

package/dist/Queue.js.map

@@ -1 +1 @@
-{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../source/Queue.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,MAAa,KAAK;QAOd,YAAY,OAAe;YALnB,SAAI,GAAc,EAAE,CAAA;YAMxB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;YACb,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;YACb,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;YACtB,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAI,OAAO,CAAC,CAAA;QACrC,CAAC;QAEM,UAAU,CAAC,KAAe;YAC7B,KAAK,IAAI,IAAI,IAAI,KAAK,EAAC;gBACnB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;aACrB;QACL,CAAC;QAEM,OAAO,CAAC,IAAO;YAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;YAC3B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAA;QAC9C,CAAC;QAEM,OAAO;YACV,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC/B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAA;YAC1C,OAAO,IAAI,CAAA;QACf,CAAC;QAEM,IAAI;YACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC/B,CAAC;QAEM,OAAO;YACV,OAAO,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAA;QACjC,CAAC;KAEJ;IAvCD,sBAuCC"}
+{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../source/Queue.ts"],"names":[],"mappings":";;;AAAA,MAAa,KAAK;IAEN,IAAI,GAAc,EAAE,CAAA;IACpB,IAAI,CAAS;IACb,IAAI,CAAS;IACb,OAAO,CAAQ;IAEvB;;;OAGG;IACH,YAAY,OAAe;QACvB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACb,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;QACb,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAI,OAAO,CAAC,CAAA;IACrC,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,KAAe;QAC7B,KAAK,IAAI,IAAI,IAAI,KAAK,EAAC,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACtB,CAAC;IACL,CAAC;IAED;;;OAGG;IACI,OAAO,CAAC,IAAO;QAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;QAC3B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAA;IAC9C,CAAC;IAED;;;OAGG;IACI,OAAO;QACV,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC/B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAA;QAC1C,OAAO,IAAI,CAAA;IACf,CAAC;IAED;;;OAGG;IACI,IAAI;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC/B,CAAC;IAED;;;OAGG;IACI,OAAO;QACV,OAAO,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAA;IACjC,CAAC;CAEJ;AA/DD,sBA+DC"}

package/dist/Stack.d.ts

@@ -1,7 +1,30 @@
+/**
+ * Stack is a list data structure consisting of many elements. There are two types of operations defined for the
+ * elements of the stack: Adding an element to the stack (push) and removing an element from the stack (pop). In a
+ * stack, to be popped element is always the last pushed element. Also, when an element is pushed on to the stack, it
+ * is placed on top of the stack (at the end of the list).
+ * @param T Type of the data stored in the stack node.
+ */
 export declare class Stack<T> {
     private list;
     constructor();
+    /**
+     * When we push an element on top of the stack, we only need to increase the field top by 1 and place the new
+     * element on this new position. If the stack is full before this push operation, we can not push.
+     * @param item Item to insert.
+     */
     push(item: T): void;
+    /**
+     * When we remove an element from the stack (the function also returns that removed element), we need to be careful
+     * if the stack was empty or not. If the stack is not empty, the topmost element of the stack is returned and the
+     * field top is decreased by 1. If the stack is empty, the function will return null.
+     * @return The removed element
+     */
     pop(): T | null;
+    /**
+     * The function checks whether an array-implemented stack is empty or not. The function returns true if the stack is
+     * empty, false otherwise.
+     * @return True if the stack is empty, false otherwise.
+     */
     isEmpty(): boolean;
 }