zcw-shared 1.21.0 → 1.22.0

package/dist/functions/data-structures/AVLTree.js

@@ -0,0 +1,197 @@
+export function createAVLTree(compare = (a, b) => a < b ? -1 : a > b ? 1 : 0) {
+    let root = null;
+    let count = 0;
+    function getHeight(node) {
+        return node ? node.height : 0;
+    }
+    function getBalance(node) {
+        return node ? getHeight(node.left) - getHeight(node.right) : 0;
+    }
+    function updateHeight(node) {
+        node.height = 1 + Math.max(getHeight(node.left), getHeight(node.right));
+    }
+    function rotateRight(y) {
+        const x = y.left;
+        const T2 = x.right;
+        x.right = y;
+        y.left = T2;
+        updateHeight(y);
+        updateHeight(x);
+        return x;
+    }
+    function rotateLeft(x) {
+        const y = x.right;
+        const T2 = y.left;
+        y.left = x;
+        x.right = T2;
+        updateHeight(x);
+        updateHeight(y);
+        return y;
+    }
+    function insertNode(node, value) {
+        if (node === null) {
+            count++;
+            return { value, left: null, right: null, height: 1 };
+        }
+        const cmp = compare(value, node.value);
+        if (cmp < 0) {
+            node.left = insertNode(node.left, value);
+        }
+        else if (cmp > 0) {
+            node.right = insertNode(node.right, value);
+        }
+        else {
+            return node;
+        }
+        updateHeight(node);
+        const balance = getBalance(node);
+        if (balance > 1 && node.left && compare(value, node.left.value) < 0) {
+            return rotateRight(node);
+        }
+        if (balance < -1 && node.right && compare(value, node.right.value) > 0) {
+            return rotateLeft(node);
+        }
+        if (balance > 1 && node.left && compare(value, node.left.value) > 0) {
+            node.left = rotateLeft(node.left);
+            return rotateRight(node);
+        }
+        if (balance < -1 && node.right && compare(value, node.right.value) < 0) {
+            node.right = rotateRight(node.right);
+            return rotateLeft(node);
+        }
+        return node;
+    }
+    function searchNode(node, value) {
+        if (node === null) {
+            return false;
+        }
+        const cmp = compare(value, node.value);
+        if (cmp === 0) {
+            return true;
+        }
+        else if (cmp < 0) {
+            return searchNode(node.left, value);
+        }
+        else {
+            return searchNode(node.right, value);
+        }
+    }
+    function findMinNode(node) {
+        while (node.left !== null) {
+            node = node.left;
+        }
+        return node;
+    }
+    function deleteNode(node, value) {
+        if (node === null) {
+            return null;
+        }
+        const cmp = compare(value, node.value);
+        if (cmp < 0) {
+            node.left = deleteNode(node.left, value);
+        }
+        else if (cmp > 0) {
+            node.right = deleteNode(node.right, value);
+        }
+        else {
+            count--;
+            if (node.left === null || node.right === null) {
+                node = node.left || node.right;
+            }
+            else {
+                const minRight = findMinNode(node.right);
+                node.value = minRight.value;
+                node.right = deleteNode(node.right, minRight.value);
+                count++;
+            }
+        }
+        if (node === null) {
+            return null;
+        }
+        updateHeight(node);
+        const balance = getBalance(node);
+        if (balance > 1 && getBalance(node.left) >= 0) {
+            return rotateRight(node);
+        }
+        if (balance > 1 && getBalance(node.left) < 0) {
+            node.left = rotateLeft(node.left);
+            return rotateRight(node);
+        }
+        if (balance < -1 && getBalance(node.right) <= 0) {
+            return rotateLeft(node);
+        }
+        if (balance < -1 && getBalance(node.right) > 0) {
+            node.right = rotateRight(node.right);
+            return rotateLeft(node);
+        }
+        return node;
+    }
+    function inorder(node, result) {
+        if (node !== null) {
+            inorder(node.left, result);
+            result.push(node.value);
+            inorder(node.right, result);
+        }
+    }
+    function checkBalance(node) {
+        if (node === null) {
+            return true;
+        }
+        const balance = Math.abs(getBalance(node));
+        if (balance > 1) {
+            return false;
+        }
+        return checkBalance(node.left) && checkBalance(node.right);
+    }
+    return {
+        insert(value) {
+            root = insertNode(root, value);
+        },
+        search(value) {
+            return searchNode(root, value);
+        },
+        delete(value) {
+            const existed = this.search(value);
+            if (existed) {
+                root = deleteNode(root, value);
+                return true;
+            }
+            return false;
+        },
+        findMin() {
+            if (root === null) {
+                return undefined;
+            }
+            return findMinNode(root).value;
+        },
+        findMax() {
+            if (root === null) {
+                return undefined;
+            }
+            let node = root;
+            while (node.right !== null) {
+                node = node.right;
+            }
+            return node.value;
+        },
+        inorderTraversal() {
+            const result = [];
+            inorder(root, result);
+            return result;
+        },
+        height() {
+            return getHeight(root);
+        },
+        size() {
+            return count;
+        },
+        isBalanced() {
+            return checkBalance(root);
+        },
+        clear() {
+            root = null;
+            count = 0;
+        }
+    };
+}
+//# sourceMappingURL=AVLTree.js.map

package/dist/functions/data-structures/AVLTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AVLTree.js","sourceRoot":"","sources":["../../../src/functions/data-structures/AVLTree.ts"],"names":[],"mappings":"AAmEA,MAAM,UAAU,aAAa,CAC3B,UAAkC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,CAAS,GAAI,CAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAS,GAAI,CAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1G,IAAI,IAAI,GAAsB,IAAI,CAAA;IAClC,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,SAAS,SAAS,CAAC,IAAuB;QACxC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/B,CAAC;IAED,SAAS,UAAU,CAAC,IAAuB;QACzC,OAAO,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAChE,CAAC;IAED,SAAS,YAAY,CAAC,IAAgB;QACpC,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IACzE,CAAC;IAGD,SAAS,WAAW,CAAC,CAAa;QAChC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAK,CAAA;QACjB,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAA;QAElB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAA;QACX,CAAC,CAAC,IAAI,GAAG,EAAE,CAAA;QAEX,YAAY,CAAC,CAAC,CAAC,CAAA;QACf,YAAY,CAAC,CAAC,CAAC,CAAA;QAEf,OAAO,CAAC,CAAA;IACV,CAAC;IAGD,SAAS,UAAU,CAAC,CAAa;QAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAM,CAAA;QAClB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAA;QAEjB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAA;QACV,CAAC,CAAC,KAAK,GAAG,EAAE,CAAA;QAEZ,YAAY,CAAC,CAAC,CAAC,CAAA;QACf,YAAY,CAAC,CAAC,CAAC,CAAA;QAEf,OAAO,CAAC,CAAA;IACV,CAAC;IAED,SAAS,UAAU,CAAC,IAAuB,EAAE,KAAQ;QAEnD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,KAAK,EAAE,CAAA;YACP,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,CAAA;QACtD,CAAC;QAED,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACtC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC1C,CAAC;aAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QAC5C,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAA;QACb,CAAC;QAGD,YAAY,CAAC,IAAI,CAAC,CAAA;QAGlB,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAA;QAKhC,IAAI,OAAO,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACpE,OAAO,WAAW,CAAC,IAAI,CAAC,CAAA;QAC1B,CAAC;QAGD,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvE,OAAO,UAAU,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QAGD,IAAI,OAAO,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACpE,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACjC,OAAO,WAAW,CAAC,IAAI,CAAC,CAAA;QAC1B,CAAC;QAGD,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvE,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACpC,OAAO,UAAU,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED,SAAS,UAAU,CAAC,IAAuB,EAAE,KAAQ;QACnD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACtC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,OAAO,IAAI,CAAA;QACb,CAAC;aAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACnB,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QACrC,CAAC;aAAM,CAAC;YACN,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QACtC,CAAC;IACH,CAAC;IAED,SAAS,WAAW,CAAC,IAAgB;QACnC,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC1B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QAClB,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,SAAS,UAAU,CAAC,IAAuB,EAAE,KAAQ;QACnD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,IAAI,CAAA;QACb,CAAC;QAED,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QAEtC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC1C,CAAC;aAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QAC5C,CAAC;aAAM,CAAC;YAEN,KAAK,EAAE,CAAA;YAEP,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC9C,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAA;YAChC,CAAC;iBAAM,CAAC;gBACN,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACxC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;gBAC3B,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;gBACnD,KAAK,EAAE,CAAA;YACT,CAAC;QACH,CAAC;QAED,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,IAAI,CAAA;QACb,CAAC;QAGD,YAAY,CAAC,IAAI,CAAC,CAAA;QAGlB,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAA;QAGhC,IAAI,OAAO,GAAG,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,OAAO,WAAW,CAAC,IAAI,CAAC,CAAA;QAC1B,CAAC;QAGD,IAAI,OAAO,GAAG,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAK,CAAC,CAAA;YAClC,OAAO,WAAW,CAAC,IAAI,CAAC,CAAA;QAC1B,CAAC;QAGD,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAChD,OAAO,UAAU,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QAGD,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;YACrC,OAAO,UAAU,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED,SAAS,OAAO,CAAC,IAAuB,EAAE,MAAW;QACnD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YAC1B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACvB,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IAED,SAAS,YAAY,CAAC,IAAuB;QAC3C,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,IAAI,CAAA;QACb,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAA;QAC1C,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAChB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAC5D,CAAC;IAED,OAAO;QACL,MAAM,CAAC,KAAQ;YACb,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAChC,CAAC;QAED,MAAM,CAAC,KAAQ;YACb,OAAO,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAChC,CAAC;QAED,MAAM,CAAC,KAAQ;YACb,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAClC,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBAC9B,OAAO,IAAI,CAAA;YACb,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC;QAED,OAAO;YACL,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,OAAO,SAAS,CAAA;YAClB,CAAC;YACD,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,CAAA;QAChC,CAAC;QAED,OAAO;YACL,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,OAAO,SAAS,CAAA;YAClB,CAAC;YACD,IAAI,IAAI,GAAG,IAAI,CAAA;YACf,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC3B,IAAI,GAAG,IAAI,CAAC,KAAK,CAAA;YACnB,CAAC;YACD,OAAO,IAAI,CAAC,KAAK,CAAA;QACnB,CAAC;QAED,gBAAgB;YACd,MAAM,MAAM,GAAQ,EAAE,CAAA;YACtB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YACrB,OAAO,MAAM,CAAA;QACf,CAAC;QAED,MAAM;YACJ,OAAO,SAAS,CAAC,IAAI,CAAC,CAAA;QACxB,CAAC;QAED,IAAI;YACF,OAAO,KAAK,CAAA;QACd,CAAC;QAED,UAAU;YACR,OAAO,YAAY,CAAC,IAAI,CAAC,CAAA;QAC3B,CAAC;QAED,KAAK;YACH,IAAI,GAAG,IAAI,CAAA;YACX,KAAK,GAAG,CAAC,CAAA;QACX,CAAC;KACF,CAAA;AACH,CAAC"}

package/dist/functions/data-structures/BinarySearchTree.d.ts

@@ -0,0 +1,19 @@
+export interface TreeNode<T> {
+    value: T;
+    left: TreeNode<T> | null;
+    right: TreeNode<T> | null;
+}
+export interface BinarySearchTree<T> {
+    insert(value: T): void;
+    search(value: T): boolean;
+    delete(value: T): boolean;
+    findMin(): T | undefined;
+    findMax(): T | undefined;
+    inorderTraversal(): T[];
+    preorderTraversal(): T[];
+    postorderTraversal(): T[];
+    height(): number;
+    size(): number;
+    clear(): void;
+}
+export declare function createBinarySearchTree<T>(compare?: (a: T, b: T) => number): BinarySearchTree<T>;

package/dist/functions/data-structures/BinarySearchTree.js

@@ -0,0 +1,150 @@
+export function createBinarySearchTree(compare = (a, b) => a < b ? -1 : a > b ? 1 : 0) {
+    let root = null;
+    let count = 0;
+    function insertNode(node, value) {
+        if (node === null) {
+            count++;
+            return { value, left: null, right: null };
+        }
+        const cmp = compare(value, node.value);
+        if (cmp < 0) {
+            node.left = insertNode(node.left, value);
+        }
+        else if (cmp > 0) {
+            node.right = insertNode(node.right, value);
+        }
+        return node;
+    }
+    function searchNode(node, value) {
+        if (node === null) {
+            return false;
+        }
+        const cmp = compare(value, node.value);
+        if (cmp === 0) {
+            return true;
+        }
+        else if (cmp < 0) {
+            return searchNode(node.left, value);
+        }
+        else {
+            return searchNode(node.right, value);
+        }
+    }
+    function findMinNode(node) {
+        while (node.left !== null) {
+            node = node.left;
+        }
+        return node;
+    }
+    function deleteNode(node, value) {
+        if (node === null) {
+            return null;
+        }
+        const cmp = compare(value, node.value);
+        if (cmp < 0) {
+            node.left = deleteNode(node.left, value);
+        }
+        else if (cmp > 0) {
+            node.right = deleteNode(node.right, value);
+        }
+        else {
+            count--;
+            if (node.left === null) {
+                return node.right;
+            }
+            else if (node.right === null) {
+                return node.left;
+            }
+            const minRight = findMinNode(node.right);
+            node.value = minRight.value;
+            node.right = deleteNode(node.right, minRight.value);
+            count++;
+        }
+        return node;
+    }
+    function inorder(node, result) {
+        if (node !== null) {
+            inorder(node.left, result);
+            result.push(node.value);
+            inorder(node.right, result);
+        }
+    }
+    function preorder(node, result) {
+        if (node !== null) {
+            result.push(node.value);
+            preorder(node.left, result);
+            preorder(node.right, result);
+        }
+    }
+    function postorder(node, result) {
+        if (node !== null) {
+            postorder(node.left, result);
+            postorder(node.right, result);
+            result.push(node.value);
+        }
+    }
+    function getHeight(node) {
+        if (node === null) {
+            return 0;
+        }
+        return 1 + Math.max(getHeight(node.left), getHeight(node.right));
+    }
+    return {
+        insert(value) {
+            root = insertNode(root, value);
+        },
+        search(value) {
+            return searchNode(root, value);
+        },
+        delete(value) {
+            const existed = this.search(value);
+            if (existed) {
+                root = deleteNode(root, value);
+                return true;
+            }
+            return false;
+        },
+        findMin() {
+            if (root === null) {
+                return undefined;
+            }
+            return findMinNode(root).value;
+        },
+        findMax() {
+            if (root === null) {
+                return undefined;
+            }
+            let node = root;
+            while (node.right !== null) {
+                node = node.right;
+            }
+            return node.value;
+        },
+        inorderTraversal() {
+            const result = [];
+            inorder(root, result);
+            return result;
+        },
+        preorderTraversal() {
+            const result = [];
+            preorder(root, result);
+            return result;
+        },
+        postorderTraversal() {
+            const result = [];
+            postorder(root, result);
+            return result;
+        },
+        height() {
+            return getHeight(root);
+        },
+        size() {
+            return count;
+        },
+        clear() {
+            root = null;
+            count = 0;
+        }
+    };
+}
+//# sourceMappingURL=BinarySearchTree.js.map

package/dist/functions/data-structures/BinarySearchTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BinarySearchTree.js","sourceRoot":"","sources":["../../../src/functions/data-structures/BinarySearchTree.ts"],"names":[],"mappings":"AAqEA,MAAM,UAAU,sBAAsB,CACpC,UAAkC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,CAAS,GAAI,CAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAS,GAAI,CAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1G,IAAI,IAAI,GAAuB,IAAI,CAAA;IACnC,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,SAAS,UAAU,CAAC,IAAwB,EAAE,KAAQ;QACpD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,KAAK,EAAE,CAAA;YACP,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;QAC3C,CAAC;QAED,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACtC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC1C,CAAC;aAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QAC5C,CAAC;QAGD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,SAAS,UAAU,CAAC,IAAwB,EAAE,KAAQ;QACpD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACtC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,OAAO,IAAI,CAAA;QACb,CAAC;aAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACnB,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QACrC,CAAC;aAAM,CAAC;YACN,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QACtC,CAAC;IACH,CAAC;IAED,SAAS,WAAW,CAAC,IAAiB;QACpC,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC1B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QAClB,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,SAAS,UAAU,CAAC,IAAwB,EAAE,KAAQ;QACpD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,IAAI,CAAA;QACb,CAAC;QAED,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QAEtC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC1C,CAAC;aAAM,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QAC5C,CAAC;aAAM,CAAC;YAEN,KAAK,EAAE,CAAA;YAGP,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,KAAK,CAAA;YACnB,CAAC;iBAAM,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC/B,OAAO,IAAI,CAAC,IAAI,CAAA;YAClB,CAAC;YAID,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACxC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;YAC3B,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAA;YACnD,KAAK,EAAE,CAAA;QACT,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED,SAAS,OAAO,CAAC,IAAwB,EAAE,MAAW;QACpD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YAC1B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACvB,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IAED,SAAS,QAAQ,CAAC,IAAwB,EAAE,MAAW;QACrD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACvB,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YAC3B,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IAED,SAAS,SAAS,CAAC,IAAwB,EAAE,MAAW;QACtD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YAC5B,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;YAC7B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACzB,CAAC;IACH,CAAC;IAED,SAAS,SAAS,CAAC,IAAwB;QACzC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,CAAC,CAAA;QACV,CAAC;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IAClE,CAAC;IAED,OAAO;QACL,MAAM,CAAC,KAAQ;YACb,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAChC,CAAC;QAED,MAAM,CAAC,KAAQ;YACb,OAAO,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAChC,CAAC;QAED,MAAM,CAAC,KAAQ;YACb,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAClC,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBAC9B,OAAO,IAAI,CAAA;YACb,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC;QAED,OAAO;YACL,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,OAAO,SAAS,CAAA;YAClB,CAAC;YACD,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,CAAA;QAChC,CAAC;QAED,OAAO;YACL,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBAClB,OAAO,SAAS,CAAA;YAClB,CAAC;YACD,IAAI,IAAI,GAAG,IAAI,CAAA;YACf,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC3B,IAAI,GAAG,IAAI,CAAC,KAAK,CAAA;YACnB,CAAC;YACD,OAAO,IAAI,CAAC,KAAK,CAAA;QACnB,CAAC;QAED,gBAAgB;YACd,MAAM,MAAM,GAAQ,EAAE,CAAA;YACtB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YACrB,OAAO,MAAM,CAAA;QACf,CAAC;QAED,iBAAiB;YACf,MAAM,MAAM,GAAQ,EAAE,CAAA;YACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YACtB,OAAO,MAAM,CAAA;QACf,CAAC;QAED,kBAAkB;YAChB,MAAM,MAAM,GAAQ,EAAE,CAAA;YACtB,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YACvB,OAAO,MAAM,CAAA;QACf,CAAC;QAED,MAAM;YACJ,OAAO,SAAS,CAAC,IAAI,CAAC,CAAA;QACxB,CAAC;QAED,IAAI;YACF,OAAO,KAAK,CAAA;QACd,CAAC;QAED,KAAK;YACH,IAAI,GAAG,IAAI,CAAA;YACX,KAAK,GAAG,CAAC,CAAA;QACX,CAAC;KACF,CAAA;AACH,CAAC"}

package/dist/functions/data-structures/Graph.d.ts

@@ -0,0 +1,19 @@
+export interface Graph {
+    addVertex(vertex: string): void;
+    addEdge(from: string, to: string, weight?: number): void;
+    removeVertex(vertex: string): void;
+    removeEdge(from: string, to: string): void;
+    getVertices(): string[];
+    getNeighbors(vertex: string): Array<{
+        vertex: string;
+        weight: number;
+    }>;
+    bfs(start: string): string[];
+    dfs(start: string): string[];
+    topologicalSort(): string[] | null;
+    hasCycle(): boolean;
+    vertexCount(): number;
+    edgeCount(): number;
+    clear(): void;
+}
+export declare function createGraph(directed?: boolean): Graph;

package/dist/functions/data-structures/Graph.js

@@ -0,0 +1,190 @@
+export function createGraph(directed = false) {
+    const adjacencyList = new Map();
+    return {
+        addVertex(vertex) {
+            if (!adjacencyList.has(vertex)) {
+                adjacencyList.set(vertex, new Map());
+            }
+        },
+        addEdge(from, to, weight = 1) {
+            this.addVertex(from);
+            this.addVertex(to);
+            adjacencyList.get(from).set(to, weight);
+            if (!directed) {
+                adjacencyList.get(to).set(from, weight);
+            }
+        },
+        removeVertex(vertex) {
+            if (!adjacencyList.has(vertex)) {
+                return;
+            }
+            for (const [v, edges] of adjacencyList) {
+                edges.delete(vertex);
+            }
+            adjacencyList.delete(vertex);
+        },
+        removeEdge(from, to) {
+            if (adjacencyList.has(from)) {
+                adjacencyList.get(from).delete(to);
+            }
+            if (!directed && adjacencyList.has(to)) {
+                adjacencyList.get(to).delete(from);
+            }
+        },
+        getVertices() {
+            return Array.from(adjacencyList.keys());
+        },
+        getNeighbors(vertex) {
+            if (!adjacencyList.has(vertex)) {
+                return [];
+            }
+            const neighbors = [];
+            for (const [v, weight] of adjacencyList.get(vertex)) {
+                neighbors.push({ vertex: v, weight });
+            }
+            return neighbors;
+        },
+        bfs(start) {
+            if (!adjacencyList.has(start)) {
+                return [];
+            }
+            const visited = new Set();
+            const queue = [start];
+            const result = [];
+            visited.add(start);
+            while (queue.length > 0) {
+                const vertex = queue.shift();
+                result.push(vertex);
+                for (const [neighbor] of adjacencyList.get(vertex)) {
+                    if (!visited.has(neighbor)) {
+                        visited.add(neighbor);
+                        queue.push(neighbor);
+                    }
+                }
+            }
+            return result;
+        },
+        dfs(start) {
+            if (!adjacencyList.has(start)) {
+                return [];
+            }
+            const visited = new Set();
+            const result = [];
+            function dfsVisit(vertex) {
+                visited.add(vertex);
+                result.push(vertex);
+                for (const [neighbor] of adjacencyList.get(vertex)) {
+                    if (!visited.has(neighbor)) {
+                        dfsVisit(neighbor);
+                    }
+                }
+            }
+            dfsVisit(start);
+            return result;
+        },
+        topologicalSort() {
+            if (!directed) {
+                return null;
+            }
+            const inDegree = new Map();
+            const result = [];
+            for (const vertex of adjacencyList.keys()) {
+                inDegree.set(vertex, 0);
+            }
+            for (const [, edges] of adjacencyList) {
+                for (const [to] of edges) {
+                    inDegree.set(to, (inDegree.get(to) || 0) + 1);
+                }
+            }
+            const queue = [];
+            for (const [vertex, degree] of inDegree) {
+                if (degree === 0) {
+                    queue.push(vertex);
+                }
+            }
+            while (queue.length > 0) {
+                const vertex = queue.shift();
+                result.push(vertex);
+                for (const [neighbor] of adjacencyList.get(vertex)) {
+                    const newDegree = inDegree.get(neighbor) - 1;
+                    inDegree.set(neighbor, newDegree);
+                    if (newDegree === 0) {
+                        queue.push(neighbor);
+                    }
+                }
+            }
+            if (result.length !== adjacencyList.size) {
+                return null;
+            }
+            return result;
+        },
+        hasCycle() {
+            const visited = new Set();
+            const recStack = new Set();
+            function hasCycleDFS(vertex) {
+                visited.add(vertex);
+                recStack.add(vertex);
+                for (const [neighbor] of adjacencyList.get(vertex)) {
+                    if (!visited.has(neighbor)) {
+                        if (hasCycleDFS(neighbor)) {
+                            return true;
+                        }
+                    }
+                    else if (recStack.has(neighbor)) {
+                        return true;
+                    }
+                }
+                recStack.delete(vertex);
+                return false;
+            }
+            if (directed) {
+                for (const vertex of adjacencyList.keys()) {
+                    if (!visited.has(vertex)) {
+                        if (hasCycleDFS(vertex)) {
+                            return true;
+                        }
+                    }
+                }
+                return false;
+            }
+            else {
+                function hasUndirectedCycle(vertex, parent) {
+                    visited.add(vertex);
+                    for (const [neighbor] of adjacencyList.get(vertex)) {
+                        if (!visited.has(neighbor)) {
+                            if (hasUndirectedCycle(neighbor, vertex)) {
+                                return true;
+                            }
+                        }
+                        else if (neighbor !== parent) {
+                            return true;
+                        }
+                    }
+                    return false;
+                }
+                for (const vertex of adjacencyList.keys()) {
+                    if (!visited.has(vertex)) {
+                        if (hasUndirectedCycle(vertex, null)) {
+                            return true;
+                        }
+                    }
+                }
+                return false;
+            }
+        },
+        vertexCount() {
+            return adjacencyList.size;
+        },
+        edgeCount() {
+            let edges = 0;
+            for (const [, neighbors] of adjacencyList) {
+                edges += neighbors.size;
+            }
+            return directed ? edges : edges / 2;
+        },
+        clear() {
+            adjacencyList.clear();
+        }
+    };
+}
+//# sourceMappingURL=Graph.js.map

package/dist/functions/data-structures/Graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../../../src/functions/data-structures/Graph.ts"],"names":[],"mappings":"AAgEA,MAAM,UAAU,WAAW,CAAC,WAAoB,KAAK;IACnD,MAAM,aAAa,GAAG,IAAI,GAAG,EAA+B,CAAA;IAE5D,OAAO;QACL,SAAS,CAAC,MAAc;YACtB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/B,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;YACtC,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAY,EAAE,EAAU,EAAE,SAAiB,CAAC;YAElD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;YACpB,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;YAGlB,aAAa,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAA;YAGxC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,aAAa,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;YAC1C,CAAC;QACH,CAAC;QAED,YAAY,CAAC,MAAc;YACzB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/B,OAAM;YACR,CAAC;YAGD,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;gBACvC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;YACtB,CAAC;YAGD,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;QAC9B,CAAC;QAED,UAAU,CAAC,IAAY,EAAE,EAAU;YACjC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5B,aAAa,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YACrC,CAAC;YAED,IAAI,CAAC,QAAQ,IAAI,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACrC,CAAC;QACH,CAAC;QAED,WAAW;YACT,OAAO,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAA;QACzC,CAAC;QAED,YAAY,CAAC,MAAc;YACzB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/B,OAAO,EAAE,CAAA;YACX,CAAC;YAED,MAAM,SAAS,GAA8C,EAAE,CAAA;YAC/D,KAAK,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;gBACrD,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAA;YACvC,CAAC;YACD,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,GAAG,CAAC,KAAa;YACf,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,OAAO,EAAE,CAAA;YACX,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;YACjC,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,CAAA;YAC/B,MAAM,MAAM,GAAa,EAAE,CAAA;YAE3B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAElB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;gBAC7B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBAEnB,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;oBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;wBACrB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;oBACtB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,MAAM,CAAA;QACf,CAAC;QAED,GAAG,CAAC,KAAa;YACf,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,OAAO,EAAE,CAAA;YACX,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;YACjC,MAAM,MAAM,GAAa,EAAE,CAAA;YAE3B,SAAS,QAAQ,CAAC,MAAc;gBAC9B,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;gBACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBAEnB,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;oBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3B,QAAQ,CAAC,QAAQ,CAAC,CAAA;oBACpB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,QAAQ,CAAC,KAAK,CAAC,CAAA;YACf,OAAO,MAAM,CAAA;QACf,CAAC;QAED,eAAe;YACb,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,OAAO,IAAI,CAAA;YACb,CAAC;YAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAA;YAC1C,MAAM,MAAM,GAAa,EAAE,CAAA;YAG3B,KAAK,MAAM,MAAM,IAAI,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC1C,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;YACzB,CAAC;YAGD,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;gBACtC,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;oBACzB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBAC/C,CAAC;YACH,CAAC;YAGD,MAAM,KAAK,GAAa,EAAE,CAAA;YAC1B,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACxC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;oBACjB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACpB,CAAC;YACH,CAAC;YAGD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;gBAC7B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBAEnB,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;oBACpD,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAE,GAAG,CAAC,CAAA;oBAC7C,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;oBAEjC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;wBACpB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;oBACtB,CAAC;gBACH,CAAC;YACH,CAAC;YAGD,IAAI,MAAM,CAAC,MAAM,KAAK,aAAa,CAAC,IAAI,EAAE,CAAC;gBACzC,OAAO,IAAI,CAAA;YACb,CAAC;YAED,OAAO,MAAM,CAAA;QACf,CAAC;QAED,QAAQ;YACN,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;YACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;YAElC,SAAS,WAAW,CAAC,MAAc;gBACjC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;gBACnB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;gBAEpB,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;oBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3B,IAAI,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC;4BAC1B,OAAO,IAAI,CAAA;wBACb,CAAC;oBACH,CAAC;yBAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAClC,OAAO,IAAI,CAAA;oBACb,CAAC;gBACH,CAAC;gBAED,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;gBACvB,OAAO,KAAK,CAAA;YACd,CAAC;YAED,IAAI,QAAQ,EAAE,CAAC;gBAEb,KAAK,MAAM,MAAM,IAAI,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;oBAC1C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBACzB,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;4BACxB,OAAO,IAAI,CAAA;wBACb,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,OAAO,KAAK,CAAA;YACd,CAAC;iBAAM,CAAC;gBAEN,SAAS,kBAAkB,CAAC,MAAc,EAAE,MAAqB;oBAC/D,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;oBAEnB,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;wBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;4BAC3B,IAAI,kBAAkB,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC;gCACzC,OAAO,IAAI,CAAA;4BACb,CAAC;wBACH,CAAC;6BAAM,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;4BAC/B,OAAO,IAAI,CAAA;wBACb,CAAC;oBACH,CAAC;oBACD,OAAO,KAAK,CAAA;gBACd,CAAC;gBAED,KAAK,MAAM,MAAM,IAAI,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;oBAC1C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBACzB,IAAI,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;4BACrC,OAAO,IAAI,CAAA;wBACb,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QAED,WAAW;YACT,OAAO,aAAa,CAAC,IAAI,CAAA;QAC3B,CAAC;QAED,SAAS;YACP,IAAI,KAAK,GAAG,CAAC,CAAA;YACb,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC1C,KAAK,IAAI,SAAS,CAAC,IAAI,CAAA;YACzB,CAAC;YACD,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAA;QACrC,CAAC;QAED,KAAK;YACH,aAAa,CAAC,KAAK,EAAE,CAAA;QACvB,CAAC;KACF,CAAA;AACH,CAAC"}

package/dist/functions/data-structures/HashMap.d.ts

@@ -0,0 +1,13 @@
+export interface HashMap<K, V> {
+    set(key: K, value: V): void;
+    get(key: K): V | undefined;
+    has(key: K): boolean;
+    delete(key: K): boolean;
+    keys(): K[];
+    values(): V[];
+    entries(): Array<[K, V]>;
+    size(): number;
+    clear(): void;
+    loadFactor(): number;
+}
+export declare function createHashMap<K, V>(initialCapacity?: number, loadFactorThreshold?: number): HashMap<K, V>;