data-structure-typed 1.33.5 → 1.33.7

package/dist/data-structures/hash/hash-table.js

@@ -1,38 +1,50 @@
 "use strict";
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.HashTable = exports.HashNode = void 0;
-var HashNode = (function () {
-    function HashNode(key, val) {
+exports.HashTable = exports.HashTableNode = void 0;
+var HashTableNode = (function () {
+    function HashTableNode(key, val) {
         this.key = key;
         this.val = val;
         this.next = null;
     }
-    return HashNode;
+    return HashTableNode;
 }());
-exports.HashNode = HashNode;
+exports.HashTableNode = HashTableNode;
 var HashTable = (function () {
-    function HashTable(capacity) {
-        if (capacity === void 0) { capacity = 1000; }
-        this._capacity = capacity;
+    function HashTable(capacity, hashFn) {
+        if (capacity === void 0) { capacity = HashTable.DEFAULT_CAPACITY; }
+        this._hashFn = hashFn || this._defaultHashFn;
+        this._capacity = Math.max(capacity, HashTable.DEFAULT_CAPACITY);
         this._size = 0;
-        this._buckets = new Array(this.capacity).fill(null);
+        this._buckets = new Array(this._capacity).fill(null);
     }
-    Object.defineProperty(HashTable.prototype, "buckets", {
+    Object.defineProperty(HashTable.prototype, "hashFn", {
         get: function () {
-            return this._buckets;
+            return this._hashFn;
         },
         set: function (value) {
-            this._buckets = value;
+            this._hashFn = value;
         },
         enumerable: false,
         configurable: true
     });
-    Object.defineProperty(HashTable.prototype, "size", {
+    Object.defineProperty(HashTable.prototype, "buckets", {
         get: function () {
-            return this._size;
+            return this._buckets;
         },
         set: function (value) {
-            this._size = value;
+            this._buckets = value;
         },
         enumerable: false,
         configurable: true
@@ -47,41 +59,74 @@ var HashTable = (function () {
         enumerable: false,
         configurable: true
     });
-    HashTable.prototype.hash = function (key) {
+    HashTable.prototype._defaultHashFn = function (key) {
+        var hashValue = typeof key === 'string' ? this._murmurStringHashFn(key) : this._objectHash(key);
+        return hashValue % this._capacity;
+    };
+    HashTable.prototype._multiplicativeStringHashFn = function (key) {
         var keyString = String(key);
         var hash = 0;
         for (var i = 0; i < keyString.length; i++) {
-            hash += keyString.charCodeAt(i);
+            var charCode = keyString.charCodeAt(i);
+            var A = 0.618033988749895;
+            var M = 1 << 30;
+            hash = (hash * A + charCode) % M;
+        }
+        return Math.abs(hash);
+    };
+    HashTable.prototype._murmurStringHashFn = function (key) {
+        var keyString = String(key);
+        var seed = 0;
+        var hash = seed;
+        for (var i = 0; i < keyString.length; i++) {
+            var char = keyString.charCodeAt(i);
+            hash = (hash ^ char) * 0x5bd1e995;
+            hash = (hash ^ (hash >>> 15)) * 0x27d4eb2d;
+            hash = hash ^ (hash >>> 15);
+        }
+        return Math.abs(hash);
+    };
+    HashTable.prototype._hash = function (key) {
+        return this.hashFn(key);
+    };
+    HashTable.prototype._stringHash = function (key) {
+        var hash = 0;
+        for (var i = 0; i < key.length; i++) {
+            hash = (hash * 31 + key.charCodeAt(i)) & 0xffffffff;
         }
-        return hash % this.capacity;
+        return hash;
     };
-    HashTable.prototype.put = function (key, val) {
-        var index = this.hash(key);
-        var newNode = new HashNode(key, val);
-        if (!this.buckets[index]) {
-            this.buckets[index] = newNode;
+    HashTable.prototype._objectHash = function (key) {
+        return this._stringHash(JSON.stringify(key));
+    };
+    HashTable.prototype.set = function (key, val) {
+        var index = this._hash(key);
+        var newNode = new HashTableNode(key, val);
+        if (!this._buckets[index]) {
+            this._buckets[index] = newNode;
         }
         else {
-            var currentNode = this.buckets[index];
-            while (currentNode.next) {
+            var currentNode = this._buckets[index];
+            while (currentNode) {
                 if (currentNode.key === key) {
                     currentNode.val = val;
                     return;
                 }
+                if (!currentNode.next) {
+                    break;
+                }
                 currentNode = currentNode.next;
             }
-            if (currentNode.key === key) {
-                currentNode.val = val;
-            }
-            else {
-                currentNode.next = newNode;
-            }
+            currentNode.next = newNode;
+        }
+        this._size++;
+        if (this._size / this._capacity >= HashTable.LOAD_FACTOR) {
+            this._expand();
         }
-        this.size++;
     };
     HashTable.prototype.get = function (key) {
-        var index = this.hash(key);
-        var currentNode = this.buckets[index];
+        var index = this._hash(key);
+        var currentNode = this._buckets[index];
         while (currentNode) {
             if (currentNode.key === key) {
                 return currentNode.val;
@@ -91,8 +136,8 @@ var HashTable = (function () {
         return undefined;
     };
     HashTable.prototype.remove = function (key) {
-        var index = this.hash(key);
-        var currentNode = this.buckets[index];
+        var index = this._hash(key);
+        var currentNode = this._buckets[index];
         var prevNode = null;
         while (currentNode) {
             if (currentNode.key === key) {
@@ -100,15 +145,60 @@ var HashTable = (function () {
                     prevNode.next = currentNode.next;
                 }
                 else {
-                    this.buckets[index] = currentNode.next;
+                    this._buckets[index] = currentNode.next;
                 }
-                this.size--;
+                this._size--;
+                currentNode.next = null;
                 return;
             }
             prevNode = currentNode;
             currentNode = currentNode.next;
         }
     };
+    HashTable.prototype._expand = function () {
+        var e_1, _a;
+        var newCapacity = this._capacity * 2;
+        var newBuckets = new Array(newCapacity).fill(null);
+        try {
+            for (var _b = __values(this._buckets), _c = _b.next(); !_c.done; _c = _b.next()) {
+                var bucket = _c.value;
+                var currentNode = bucket;
+                while (currentNode) {
+                    var newIndex = this._hash(currentNode.key);
+                    var newNode = new HashTableNode(currentNode.key, currentNode.val);
+                    if (!newBuckets[newIndex]) {
+                        newBuckets[newIndex] = newNode;
+                    }
+                    else {
+                        var currentNewNode = newBuckets[newIndex];
+                        while (currentNewNode.next) {
+                            currentNewNode = currentNewNode.next;
+                        }
+                        currentNewNode.next = newNode;
+                    }
+                    currentNode = currentNode.next;
+                }
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
+        this._buckets = newBuckets;
+        this._capacity = newCapacity;
+    };
+    Object.defineProperty(HashTable.prototype, "size", {
+        get: function () {
+            return this._size;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    HashTable.DEFAULT_CAPACITY = 16;
+    HashTable.LOAD_FACTOR = 0.75;
     return HashTable;
 }());
 exports.HashTable = HashTable;

package/dist/data-structures/hash/hash-table.js.map

@@ -1 +1 @@
-{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../../src/data-structures/hash/hash-table.ts"],"names":[],"mappings":";;;AAOA;IAKE,kBAAY,GAAM,EAAE,GAAM;QACxB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IACH,eAAC;AAAD,CAAC,AAVD,IAUC;AAVY,4BAAQ;AAYrB;IAkCE,mBAAY,QAAe;QAAf,yBAAA,EAAA,eAAe;QACzB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IArCD,sBAAI,8BAAO;aAAX;YACE,OAAO,IAAI,CAAC,QAAQ,CAAC;QACvB,CAAC;aAED,UAAY,KAAmC;YAC7C,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACxB,CAAC;;;OAJA;IAMD,sBAAI,2BAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;aAED,UAAS,KAAa;YACpB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;;;OAJA;IAMD,sBAAI,+BAAQ;aAAZ;YACE,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;aAED,UAAa,KAAa;YACxB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACzB,CAAC;;;OAJA;IA4BO,wBAAI,GAAZ,UAAa,GAAM;QACjB,IAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,IAAI,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACjC;QACD,OAAO,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC9B,CAAC;IASD,uBAAG,GAAH,UAAI,GAAM,EAAE,GAAM;QAChB,IAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAM,OAAO,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEvC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YACxB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;SAC/B;aAAM;YAEL,IAAI,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC;YACvC,OAAO,WAAW,CAAC,IAAI,EAAE;gBACvB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE;oBAE3B,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC;oBACtB,OAAO;iBACR;gBACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;aAChC;YACD,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE;gBAE3B,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC;aACvB;iBAAM;gBAEL,WAAW,CAAC,IAAI,GAAG,OAAO,CAAC;aAC5B;SACF;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IASD,uBAAG,GAAH,UAAI,GAAM;QACR,IAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAEtC,OAAO,WAAW,EAAE;YAClB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE;gBAC3B,OAAO,WAAW,CAAC,GAAG,CAAC;aACxB;YACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;SAChC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IASD,0BAAM,GAAN,UAAO,GAAM;QACX,IAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,QAAQ,GAA0B,IAAI,CAAC;QAE3C,OAAO,WAAW,EAAE;YAClB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE;gBAC3B,IAAI,QAAQ,EAAE;oBACZ,QAAQ,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;iBAClC;qBAAM;oBACL,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC;iBACxC;gBACD,IAAI,CAAC,IAAI,EAAE,CAAC;gBACZ,OAAO;aACR;YACD,QAAQ,GAAG,WAAW,CAAC;YACvB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;SAChC;IACH,CAAC;IACH,gBAAC;AAAD,CAAC,AAzID,IAyIC;AAzIY,8BAAS"}
+{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../../src/data-structures/hash/hash-table.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AAQA;IAKE,uBAAY,GAAM,EAAE,GAAM;QACxB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IACH,oBAAC;AAAD,CAAC,AAVD,IAUC;AAVY,sCAAa;AAc1B;IAiCE,mBAAY,QAA6C,EAAE,MAAwB;QAAvE,yBAAA,EAAA,WAAmB,SAAS,CAAC,gBAAgB;QACvD,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,IAAI,CAAC,cAAc,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,gBAAgB,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAA6B,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnF,CAAC;IArCD,sBAAI,6BAAM;aAAV;YACE,OAAO,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;aAED,UAAW,KAAsB;YAC/B,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACvB,CAAC;;;OAJA;IAMD,sBAAI,8BAAO;aAAX;YACE,OAAO,IAAI,CAAC,QAAQ,CAAC;QACvB,CAAC;aAED,UAAY,KAAwC;YAClD,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACxB,CAAC;;;OAJA;IAMD,sBAAI,+BAAQ;aAAZ;YACE,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;aAED,UAAa,KAAa;YACxB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACzB,CAAC;;;OAJA;IA6BS,kCAAc,GAAxB,UAAyB,GAAM;QAE7B,IAAM,SAAS,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAClG,OAAO,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;IACpC,CAAC;IASS,+CAA2B,GAArC,UAAyC,GAAM;QAC7C,IAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAEzC,IAAM,CAAC,GAAG,iBAAiB,CAAC;YAC5B,IAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAClB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;SAClC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAQS,uCAAmB,GAA7B,UAAiC,GAAM;QACrC,IAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAM,IAAI,GAAG,CAAC,CAAC;QACf,IAAI,IAAI,GAAG,IAAI,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAM,IAAI,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,UAAU,CAAC;YAClC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;YAC3C,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;SAC7B;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAOS,yBAAK,GAAf,UAAgB,GAAM;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAQS,+BAAW,GAArB,UAAsB,GAAW;QAC/B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACnC,IAAI,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;SACrD;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IASS,+BAAW,GAArB,UAAsB,GAAM;QAI1B,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAWD,uBAAG,GAAH,UAAI,GAAM,EAAE,GAAM;QAChB,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAM,OAAO,GAAG,IAAI,aAAa,CAAO,GAAG,EAAE,GAAG,CAAC,CAAC;QAElD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YACzB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;SAChC;aAAM;YAEL,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAE,CAAC;YACxC,OAAO,WAAW,EAAE;gBAClB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE;oBAE3B,WAAW,CAAC,GAAG,GAAG,GAAG,CAAC;oBACtB,OAAO;iBACR;gBACD,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE;oBACrB,MAAM;iBACP;gBACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;aAChC;YAED,WAAW,CAAC,IAAI,GAAG,OAAO,CAAC;SAC5B;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;QAGb,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,WAAW,EAAE;YACxD,IAAI,CAAC,OAAO,EAAE,CAAC;SAChB;IACH,CAAC;IASD,uBAAG,GAAH,UAAI,GAAM;QACR,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEvC,OAAO,WAAW,EAAE;YAClB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE;gBAC3B,OAAO,WAAW,CAAC,GAAG,CAAC;aACxB;YACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;SAChC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IASD,0BAAM,GAAN,UAAO,GAAM;QACX,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,QAAQ,GAA+B,IAAI,CAAC;QAEhD,OAAO,WAAW,EAAE;YAClB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE;gBAC3B,IAAI,QAAQ,EAAE;oBACZ,QAAQ,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;iBAClC;qBAAM;oBACL,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC;iBACzC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,WAAW,CAAC,IAAI,GAAG,IAAI,CAAC;gBACxB,OAAO;aACR;YACD,QAAQ,GAAG,WAAW,CAAC;YACvB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;SAChC;IACH,CAAC;IAMS,2BAAO,GAAjB;;QACE,IAAM,WAAW,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACvC,IAAM,UAAU,GAAG,IAAI,KAAK,CAA6B,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEjF,KAAqB,IAAA,KAAA,SAAA,IAAI,CAAC,QAAQ,CAAA,gBAAA,4BAAE;gBAA/B,IAAM,MAAM,WAAA;gBACf,IAAI,WAAW,GAAG,MAAM,CAAC;gBACzB,OAAO,WAAW,EAAE;oBAClB,IAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;oBAC7C,IAAM,OAAO,GAAG,IAAI,aAAa,CAAO,WAAW,CAAC,GAAG,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC;oBAE1E,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE;wBACzB,UAAU,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC;qBAChC;yBAAM;wBACL,IAAI,cAAc,GAAG,UAAU,CAAC,QAAQ,CAAE,CAAC;wBAC3C,OAAO,cAAc,CAAC,IAAI,EAAE;4BAC1B,cAAc,GAAG,cAAc,CAAC,IAAI,CAAC;yBACtC;wBACD,cAAc,CAAC,IAAI,GAAG,OAAO,CAAC;qBAC/B;oBACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;iBAChC;aACF;;;;;;;;;QAED,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC;IAC/B,CAAC;IAED,sBAAI,2BAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;;;OAAA;IApOuB,0BAAgB,GAAG,EAAE,CAAC;IACtB,qBAAW,GAAG,IAAI,CAAC;IAoO7C,gBAAC;CAAA,AA9PD,IA8PC;AA9PY,8BAAS"}

package/dist/data-structures/hash/index.js

@@ -20,4 +20,5 @@ __exportStar(require("./coordinate-set"), exports);
 __exportStar(require("./pair"), exports);
 __exportStar(require("./tree-map"), exports);
 __exportStar(require("./tree-set"), exports);
+__exportStar(require("./hash-map"), exports);
 //# sourceMappingURL=index.js.map

package/dist/data-structures/hash/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/data-structures/hash/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,+CAA6B;AAC7B,mDAAiC;AACjC,mDAAiC;AACjC,yCAAuB;AACvB,6CAA2B;AAC3B,6CAA2B"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/data-structures/hash/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,+CAA6B;AAC7B,mDAAiC;AACjC,mDAAiC;AACjC,yCAAuB;AACvB,6CAA2B;AAC3B,6CAA2B;AAC3B,6CAA2B"}

package/dist/data-structures/linked-list/skip-linked-list.js

@@ -1,10 +1,127 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.SkipLinkedList = void 0;
-var SkipLinkedList = (function () {
-    function SkipLinkedList() {
+exports.SkipList = exports.SkipListNode = void 0;
+var SkipListNode = (function () {
+    function SkipListNode(key, value, level) {
+        this.key = key;
+        this.value = value;
+        this.forward = new Array(level);
     }
-    return SkipLinkedList;
+    return SkipListNode;
 }());
-exports.SkipLinkedList = SkipLinkedList;
+exports.SkipListNode = SkipListNode;
+var SkipList = (function () {
+    function SkipList(maxLevel, probability) {
+        if (maxLevel === void 0) { maxLevel = 16; }
+        if (probability === void 0) { probability = 0.5; }
+        this._head = new SkipListNode(null, null, maxLevel);
+        this._level = 0;
+        this._maxLevel = maxLevel;
+        this._probability = probability;
+    }
+    Object.defineProperty(SkipList.prototype, "probability", {
+        get: function () {
+            return this._probability;
+        },
+        set: function (value) {
+            this._probability = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(SkipList.prototype, "maxLevel", {
+        get: function () {
+            return this._maxLevel;
+        },
+        set: function (value) {
+            this._maxLevel = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(SkipList.prototype, "level", {
+        get: function () {
+            return this._level;
+        },
+        set: function (value) {
+            this._level = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(SkipList.prototype, "head", {
+        get: function () {
+            return this._head;
+        },
+        set: function (value) {
+            this._head = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    SkipList.prototype.randomLevel = function () {
+        var level = 1;
+        while (Math.random() < this.probability && level < this.maxLevel) {
+            level++;
+        }
+        return level;
+    };
+    SkipList.prototype.add = function (key, value) {
+        var newNode = new SkipListNode(key, value, this.randomLevel());
+        var update = new Array(this.maxLevel).fill(this.head);
+        var current = this.head;
+        for (var i = this.level - 1; i >= 0; i--) {
+            while (current.forward[i] && current.forward[i].key < key) {
+                current = current.forward[i];
+            }
+            update[i] = current;
+        }
+        for (var i = 0; i < newNode.forward.length; i++) {
+            newNode.forward[i] = update[i].forward[i];
+            update[i].forward[i] = newNode;
+        }
+        if (newNode.forward[0] !== null) {
+            this.level = Math.max(this.level, newNode.forward.length);
+        }
+    };
+    SkipList.prototype.get = function (key) {
+        var current = this.head;
+        for (var i = this.level - 1; i >= 0; i--) {
+            while (current.forward[i] && current.forward[i].key < key) {
+                current = current.forward[i];
+            }
+        }
+        current = current.forward[0];
+        if (current && current.key === key) {
+            return current.value;
+        }
+        return undefined;
+    };
+    SkipList.prototype.remove = function (key) {
+        var update = new Array(this.maxLevel).fill(this.head);
+        var current = this.head;
+        for (var i = this.level - 1; i >= 0; i--) {
+            while (current.forward[i] && current.forward[i].key < key) {
+                current = current.forward[i];
+            }
+            update[i] = current;
+        }
+        current = current.forward[0];
+        if (current && current.key === key) {
+            for (var i = 0; i < this.level; i++) {
+                if (update[i].forward[i] !== current) {
+                    break;
+                }
+                update[i].forward[i] = current.forward[i];
+            }
+            while (this.level > 0 && this.head.forward[this.level - 1] === null) {
+                this.level--;
+            }
+            return true;
+        }
+        return false;
+    };
+    return SkipList;
+}());
+exports.SkipList = SkipList;
 //# sourceMappingURL=skip-linked-list.js.map

package/dist/data-structures/linked-list/skip-linked-list.js.map

@@ -1 +1 @@
-{"version":3,"file":"skip-linked-list.js","sourceRoot":"","sources":["../../../src/data-structures/linked-list/skip-linked-list.ts"],"names":[],"mappings":";;;AAAA;IAAA;IAA6B,CAAC;IAAD,qBAAC;AAAD,CAAC,AAA9B,IAA8B;AAAjB,wCAAc"}
+{"version":3,"file":"skip-linked-list.js","sourceRoot":"","sources":["../../../src/data-structures/linked-list/skip-linked-list.ts"],"names":[],"mappings":";;;AAQA;IAKE,sBAAY,GAAM,EAAE,KAAQ,EAAE,KAAa;QACzC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IACH,mBAAC;AAAD,CAAC,AAVD,IAUC;AAVY,oCAAY;AAYzB;IAyCE,kBAAY,QAAa,EAAE,WAAiB;QAAhC,yBAAA,EAAA,aAAa;QAAE,4BAAA,EAAA,iBAAiB;QAC1C,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAO,IAAW,EAAE,IAAW,EAAE,QAAQ,CAAC,CAAC;QACxE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IA7CD,sBAAI,iCAAW;aAAf;YACE,OAAO,IAAI,CAAC,YAAY,CAAC;QAC3B,CAAC;aAED,UAAgB,KAAa;YAC3B,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;QAC5B,CAAC;;;OAJA;IAKD,sBAAI,8BAAQ;aAAZ;YACE,OAAO,IAAI,CAAC,SAAS,CAAC;QACxB,CAAC;aAED,UAAa,KAAa;YACxB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACzB,CAAC;;;OAJA;IAKD,sBAAI,2BAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAED,UAAU,KAAa;YACrB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;;;OAJA;IAKD,sBAAI,0BAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;aAED,UAAS,KAAyB;YAChC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;;;OAJA;IA4BO,8BAAW,GAAnB;QACE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE;YAChE,KAAK,EAAE,CAAC;SACT;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAQD,sBAAG,GAAH,UAAI,GAAM,EAAE,KAAQ;QAClB,IAAM,OAAO,GAAG,IAAI,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACjE,IAAM,MAAM,GAAyB,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9E,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACxC,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,EAAE;gBACzD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aAC9B;YACD,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;SACrB;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/C,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;SAChC;QAED,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;YAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;SAC3D;IACH,CAAC;IAQD,sBAAG,GAAH,UAAI,GAAM;QACR,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACxC,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,EAAE;gBACzD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aAC9B;SACF;QAED,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAE7B,IAAI,OAAO,IAAI,OAAO,CAAC,GAAG,KAAK,GAAG,EAAE;YAClC,OAAO,OAAO,CAAC,KAAK,CAAC;SACtB;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAQD,yBAAM,GAAN,UAAO,GAAM;QACX,IAAM,MAAM,GAAyB,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9E,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACxC,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,EAAE;gBACzD,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aAC9B;YACD,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;SACrB;QAED,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAE7B,IAAI,OAAO,IAAI,OAAO,CAAC,GAAG,KAAK,GAAG,EAAE;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;gBACnC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE;oBACpC,MAAM;iBACP;gBACD,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aAC3C;YACD,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;gBACnE,IAAI,CAAC,KAAK,EAAE,CAAC;aACd;YACD,OAAO,IAAI,CAAC;SACb;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACH,eAAC;AAAD,CAAC,AAjJD,IAiJC;AAjJY,4BAAQ"}

package/dist/types/data-structures/hash.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=hash.js.map

package/dist/types/data-structures/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../../src/types/data-structures/hash.ts"],"names":[],"mappings":""}

package/dist/types/data-structures/index.js

@@ -29,4 +29,5 @@ __exportStar(require("./heap"), exports);
 __exportStar(require("./singly-linked-list"), exports);
 __exportStar(require("./doubly-linked-list"), exports);
 __exportStar(require("./navigator"), exports);
+__exportStar(require("./hash"), exports);
 //# sourceMappingURL=index.js.map

package/dist/types/data-structures/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/types/data-structures/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,gDAA8B;AAC9B,wCAAsB;AACtB,6CAA2B;AAC3B,iDAA+B;AAC/B,kDAAgC;AAChC,mDAAiC;AACjC,8CAA4B;AAC5B,yDAAuC;AACvC,4CAA0B;AAC1B,mDAAiC;AACjC,mDAAiC;AACjC,yCAAuB;AACvB,uDAAqC;AACrC,uDAAqC;AACrC,8CAA4B"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/types/data-structures/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,gDAA8B;AAC9B,wCAAsB;AACtB,6CAA2B;AAC3B,iDAA+B;AAC/B,kDAAgC;AAChC,mDAAiC;AACjC,8CAA4B;AAC5B,yDAAuC;AACvC,4CAA0B;AAC1B,mDAAiC;AACjC,mDAAiC;AACjC,yCAAuB;AACvB,uDAAqC;AACrC,uDAAqC;AACrC,8CAA4B;AAC5B,yCAAuB"}

package/docs/index.html

@@ -13,7 +13,7 @@
 <div class="tsd-page-title">
 <h2>data-structure-typed</h2></div>
 <div class="tsd-panel tsd-typography"><a id="md:data-structure-typed" class="tsd-anchor"></a><h1><a href="#md:data-structure-typed">Data Structure Typed</a></h1><p>Data Structures of Javascript &amp; TypeScript.</p>
-<p>Do you envy languages like C++ with <span style="border-radius: 5px;background-color: #0A7DBE; color: #ffffff; padding: 0 3px;">std</span>, Python with <span style="border-radius: 5px;background-color: #0A7DBE; color: #ffffff; padding: 0 3px;">collections</span>, and Java with <span style="border-radius: 5px;background-color: #0A7DBE; color: #ffffff; padding: 0 3px;">java.util</span>? Well, no need to envy anymore! JavaScript and TypeScript now have <span style="border-radius: 5px;background-color: #0A7DBE; color: #ffffff; padding: 0 3px;">data-structure-typed</span></p>
+<p>Do you envy languages like C++ with <a href="">std</a>, Python with <a href="">collections</a>, and Java with <a href="">java.util</a> ? Well, no need to envy anymore! JavaScript and TypeScript now have <a href="">data-structure-typed</a>.</p>
 <p>Now you can use this library in Node.js and browser environments in CommonJS(require export.modules = ), ESModule(import export), Typescript(import export), UMD(var Queue = dataStructureTyped.Queue)</p>
 <p><img src="https://img.shields.io/badge/License-MIT-blue.svg" alt="License">
 <img src="https://img.shields.io/github/languages/top/zrwusa/data-structure-typed" alt="Language">
@@ -258,24 +258,17 @@ Floyd-Warshall Algorithm, Tarjan&#39;s Algorithm.</p>
     <tr>
       <td>Set</td>
       <td>std::set&lt;T&gt;</td>
-      <td>Set</td>
+      <td>Set&lt;E&gt</td>
       <td>HashSet&lt;E&gt;</td>
       <td>set</td>
     </tr>
     <tr>
       <td>Map</td>
       <td>std::map&lt;K, V&gt;</td>
-      <td>Map</td>
+      <td>Map&lt;K, V&gt;</td>
       <td>HashMap&lt;K, V&gt;</td>
       <td>dict</td>
     </tr>
-    <tr>
-      <td>Unordered Map</td>
-      <td>std::unordered_map&lt;K, V&gt;</td>
-      <td>N/A</td>
-      <td>HashMap&lt;K, V&gt;</td>
-      <td>defaultdict</td>
-    </tr>
     <tr>
       <td>Unordered Set</td>
       <td>std::unordered_set&lt;T&gt;</td>
@@ -283,24 +276,31 @@ Floyd-Warshall Algorithm, Tarjan&#39;s Algorithm.</p>
       <td>HashSet&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
+    <tr>
+      <td>Unordered Map</td>
+      <td>std::unordered_map&lt;K, V&gt;</td>
+      <td>HashMap&lt;K, V&gt;</td>
+      <td>HashMap&lt;K, V&gt;</td>
+      <td>defaultdict</td>
+    </tr>
     <tr>
       <td>Queue</td>
       <td>std::queue&lt;T&gt;</td>
-      <td>Queue</td>
+      <td>Queue&lt;E&gt;</td>
       <td>Queue&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
     <tr>
       <td>Priority Queue</td>
       <td>std::priority_queue&lt;T&gt;</td>
-      <td>PriorityQueue</td>
+      <td>PriorityQueue&lt;E&gt;</td>
       <td>PriorityQueue&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
     <tr>
       <td>Stack</td>
       <td>std::stack&lt;T&gt;</td>
-      <td>Stack</td>
+      <td>Stack&lt;E&gt;</td>
       <td>Stack&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
@@ -314,7 +314,7 @@ Floyd-Warshall Algorithm, Tarjan&#39;s Algorithm.</p>
     <tr>
       <td>Deque</td>
       <td>std::deque&lt;T&gt;</td>
-      <td>Deque</td>
+      <td>Deque&lt;E&gt;</td>
       <td>N/A</td>
       <td>N/A</td>
     </tr>
@@ -342,17 +342,10 @@ Floyd-Warshall Algorithm, Tarjan&#39;s Algorithm.</p>
     <tr>
       <td>Ordered Dictionary</td>
       <td>N/A</td>
-      <td>Map</td>
+      <td>Map&lt;K, V&gt;</td>
       <td>N/A</td>
       <td>OrderedDict</td>
     </tr>
-    <tr>
-      <td>Double-Ended Queue (Deque)</td>
-      <td>std::deque&lt;T&gt;</td>
-      <td>Deque</td>
-      <td>N/A</td>
-      <td>N/A</td>
-    </tr>
     <tr>
       <td>Linked Hash Set</td>
       <td>N/A</td>
@@ -370,21 +363,21 @@ Floyd-Warshall Algorithm, Tarjan&#39;s Algorithm.</p>
     <tr>
       <td>Sorted Set</td>
       <td>N/A</td>
-      <td>AVLTree, RBTree</td>
+      <td>AVLTree</td>
       <td>TreeSet&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
     <tr>
       <td>Sorted Map</td>
       <td>N/A</td>
-      <td>AVLTree, RBTree</td>
+      <td>AVLTree</td>
       <td>TreeMap&lt;K, V&gt;</td>
       <td>N/A</td>
     </tr>
     <tr>
       <td>Tree Set</td>
       <td>std::set</td>
-      <td>AVLTree, RBTree</td>
+      <td>AVLTree</td>
       <td>TreeSet&lt;E&gt;</td>
       <td>N/A</td>
     </tr>
@@ -766,8 +759,9 @@ optimal approach to data structure design.</p>
 <li><a href="classes/DirectedVertex.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Directed<wbr/>Vertex</span></a></li>
 <li><a href="classes/DoublyLinkedList.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Doubly<wbr/>Linked<wbr/>List</span></a></li>
 <li><a href="classes/DoublyLinkedListNode.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Doubly<wbr/>Linked<wbr/>List<wbr/>Node</span></a></li>
-<li><a href="classes/HashNode.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Hash<wbr/>Node</span></a></li>
+<li><a href="classes/HashMap.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Hash<wbr/>Map</span></a></li>
 <li><a href="classes/HashTable.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Hash<wbr/>Table</span></a></li>
+<li><a href="classes/HashTableNode.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Hash<wbr/>Table<wbr/>Node</span></a></li>
 <li><a href="classes/Heap.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Heap</span></a></li>
 <li><a href="classes/HeapItem.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Heap<wbr/>Item</span></a></li>
 <li><a href="classes/LinkedListQueue.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Linked<wbr/>List<wbr/>Queue</span></a></li>
@@ -791,7 +785,8 @@ optimal approach to data structure design.</p>
 <li><a href="classes/SegmentTreeNode.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Segment<wbr/>Tree<wbr/>Node</span></a></li>
 <li><a href="classes/SinglyLinkedList.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Singly<wbr/>Linked<wbr/>List</span></a></li>
 <li><a href="classes/SinglyLinkedListNode.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Singly<wbr/>Linked<wbr/>List<wbr/>Node</span></a></li>
-<li><a href="classes/SkipLinkedList.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Skip<wbr/>Linked<wbr/>List</span></a></li>
+<li><a href="classes/SkipList.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Skip<wbr/>List</span></a></li>
+<li><a href="classes/SkipListNode.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Skip<wbr/>List<wbr/>Node</span></a></li>
 <li><a href="classes/SplayTree.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Splay<wbr/>Tree</span></a></li>
 <li><a href="classes/Stack.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Stack</span></a></li>
 <li><a href="classes/TreeMap.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-128"></use></svg><span>Tree<wbr/>Map</span></a></li>
@@ -833,6 +828,7 @@ optimal approach to data structure design.</p>
 <li><a href="types/Direction.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-4194304"></use></svg><span>Direction</span></a></li>
 <li><a href="types/DummyAny.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-4194304"></use></svg><span>Dummy<wbr/>Any</span></a></li>
 <li><a href="types/EdgeId.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-4194304"></use></svg><span>Edge<wbr/>Id</span></a></li>
+<li><a href="types/HashFunction.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-4194304"></use></svg><span>Hash<wbr/>Function</span></a></li>
 <li><a href="types/HeapOptions.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-4194304"></use></svg><span>Heap<wbr/>Options</span></a></li>
 <li><a href="types/IAVLTreeNode.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-4194304"></use></svg><span>IAVLTree<wbr/>Node</span></a></li>
 <li><a href="types/IBSTNode.html"><svg class="tsd-kind-icon" viewBox="0 0 24 24"><use href="#icon-4194304"></use></svg><span>IBSTNode</span></a></li>