zcw-shared 1.20.0 → 1.22.0

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>;

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

@@ -0,0 +1,128 @@
+export function createHashMap(initialCapacity = 16, loadFactorThreshold = 0.75) {
+    let capacity = initialCapacity;
+    let buckets = Array(capacity).fill(null);
+    let itemCount = 0;
+    function hash(key) {
+        const str = String(key);
+        let hash = 0;
+        for (let i = 0; i < str.length; i++) {
+            hash = ((hash << 5) - hash + str.charCodeAt(i)) | 0;
+        }
+        return Math.abs(hash) % capacity;
+    }
+    function resize() {
+        const oldBuckets = buckets;
+        capacity *= 2;
+        buckets = Array(capacity).fill(null);
+        itemCount = 0;
+        for (const bucket of oldBuckets) {
+            let entry = bucket;
+            while (entry !== null) {
+                hashMap.set(entry.key, entry.value);
+                entry = entry.next;
+            }
+        }
+    }
+    const hashMap = {
+        set(key, value) {
+            const index = hash(key);
+            let entry = buckets[index];
+            while (entry !== null) {
+                if (entry.key === key) {
+                    entry.value = value;
+                    return;
+                }
+                entry = entry.next;
+            }
+            const newEntry = {
+                key,
+                value,
+                next: buckets[index]
+            };
+            buckets[index] = newEntry;
+            itemCount++;
+            if (itemCount / capacity > loadFactorThreshold) {
+                resize();
+            }
+        },
+        get(key) {
+            const index = hash(key);
+            let entry = buckets[index];
+            while (entry !== null) {
+                if (entry.key === key) {
+                    return entry.value;
+                }
+                entry = entry.next;
+            }
+            return undefined;
+        },
+        has(key) {
+            return this.get(key) !== undefined;
+        },
+        delete(key) {
+            const index = hash(key);
+            let entry = buckets[index];
+            let prev = null;
+            while (entry !== null) {
+                if (entry.key === key) {
+                    if (prev === null) {
+                        buckets[index] = entry.next;
+                    }
+                    else {
+                        prev.next = entry.next;
+                    }
+                    itemCount--;
+                    return true;
+                }
+                prev = entry;
+                entry = entry.next;
+            }
+            return false;
+        },
+        keys() {
+            const result = [];
+            for (const bucket of buckets) {
+                let entry = bucket;
+                while (entry !== null) {
+                    result.push(entry.key);
+                    entry = entry.next;
+                }
+            }
+            return result;
+        },
+        values() {
+            const result = [];
+            for (const bucket of buckets) {
+                let entry = bucket;
+                while (entry !== null) {
+                    result.push(entry.value);
+                    entry = entry.next;
+                }
+            }
+            return result;
+        },
+        entries() {
+            const result = [];
+            for (const bucket of buckets) {
+                let entry = bucket;
+                while (entry !== null) {
+                    result.push([entry.key, entry.value]);
+                    entry = entry.next;
+                }
+            }
+            return result;
+        },
+        size() {
+            return itemCount;
+        },
+        clear() {
+            buckets = Array(capacity).fill(null);
+            itemCount = 0;
+        },
+        loadFactor() {
+            return itemCount / capacity;
+        }
+    };
+    return hashMap;
+}
+//# sourceMappingURL=HashMap.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"HashMap.js","sourceRoot":"","sources":["../../../src/functions/data-structures/HashMap.ts"],"names":[],"mappings":"AA+DA,MAAM,UAAU,aAAa,CAC3B,kBAA0B,EAAE,EAC5B,sBAA8B,IAAI;IAElC,IAAI,QAAQ,GAAG,eAAe,CAAA;IAC9B,IAAI,OAAO,GAAqC,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC1E,IAAI,SAAS,GAAG,CAAC,CAAA;IAEjB,SAAS,IAAI,CAAC,GAAM;QAClB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAA;QACvB,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACrD,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAA;IAClC,CAAC;IAED,SAAS,MAAM;QACb,MAAM,UAAU,GAAG,OAAO,CAAA;QAC1B,QAAQ,IAAI,CAAC,CAAA;QACb,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACpC,SAAS,GAAG,CAAC,CAAA;QAGb,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;YAChC,IAAI,KAAK,GAAG,MAAM,CAAA;YAClB,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;gBACnC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAA;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAkB;QAC7B,GAAG,CAAC,GAAM,EAAE,KAAQ;YAClB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;YACvB,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;YAG1B,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;gBACtB,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;oBACtB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAA;oBACnB,OAAM;gBACR,CAAC;gBACD,KAAK,GAAG,KAAK,CAAC,IAAI,CAAA;YACpB,CAAC;YAGD,MAAM,QAAQ,GAAuB;gBACnC,GAAG;gBACH,KAAK;gBACL,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC;aACrB,CAAA;YACD,OAAO,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAA;YACzB,SAAS,EAAE,CAAA;YAGX,IAAI,SAAS,GAAG,QAAQ,GAAG,mBAAmB,EAAE,CAAC;gBAC/C,MAAM,EAAE,CAAA;YACV,CAAC;QACH,CAAC;QAED,GAAG,CAAC,GAAM;YACR,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;YACvB,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;YAE1B,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;gBACtB,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;oBACtB,OAAO,KAAK,CAAC,KAAK,CAAA;gBACpB,CAAC;gBACD,KAAK,GAAG,KAAK,CAAC,IAAI,CAAA;YACpB,CAAC;YAED,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,GAAG,CAAC,GAAM;YACR,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAA;QACpC,CAAC;QAED,MAAM,CAAC,GAAM;YACX,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;YACvB,IAAI,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;YAC1B,IAAI,IAAI,GAA8B,IAAI,CAAA;YAE1C,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;gBACtB,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;oBACtB,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;wBAClB,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAA;oBAC7B,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;oBACxB,CAAC;oBACD,SAAS,EAAE,CAAA;oBACX,OAAO,IAAI,CAAA;gBACb,CAAC;gBACD,IAAI,GAAG,KAAK,CAAA;gBACZ,KAAK,GAAG,KAAK,CAAC,IAAI,CAAA;YACpB,CAAC;YAED,OAAO,KAAK,CAAA;QACd,CAAC;QAED,IAAI;YACF,MAAM,MAAM,GAAQ,EAAE,CAAA;YACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,KAAK,GAAG,MAAM,CAAA;gBAClB,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;oBACtB,KAAK,GAAG,KAAK,CAAC,IAAI,CAAA;gBACpB,CAAC;YACH,CAAC;YACD,OAAO,MAAM,CAAA;QACf,CAAC;QAED,MAAM;YACJ,MAAM,MAAM,GAAQ,EAAE,CAAA;YACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,KAAK,GAAG,MAAM,CAAA;gBAClB,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;oBACxB,KAAK,GAAG,KAAK,CAAC,IAAI,CAAA;gBACpB,CAAC;YACH,CAAC;YACD,OAAO,MAAM,CAAA;QACf,CAAC;QAED,OAAO;YACL,MAAM,MAAM,GAAkB,EAAE,CAAA;YAChC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,KAAK,GAAG,MAAM,CAAA;gBAClB,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAA;oBACrC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAA;gBACpB,CAAC;YACH,CAAC;YACD,OAAO,MAAM,CAAA;QACf,CAAC;QAED,IAAI;YACF,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,KAAK;YACH,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACpC,SAAS,GAAG,CAAC,CAAA;QACf,CAAC;QAED,UAAU;YACR,OAAO,SAAS,GAAG,QAAQ,CAAA;QAC7B,CAAC;KACF,CAAA;IAED,OAAO,OAAO,CAAA;AAChB,CAAC"}

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

@@ -0,0 +1,11 @@
+export interface Heap<T> {
+    insert(value: T): void;
+    extract(): T | undefined;
+    peek(): T | undefined;
+    size(): number;
+    isEmpty(): boolean;
+    clear(): void;
+    toArray(): T[];
+}
+export type HeapType = 'min' | 'max';
+export declare function createHeap<T>(type?: HeapType, compare?: (a: T, b: T) => number): Heap<T>;

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

@@ -0,0 +1,91 @@
+export function createHeap(type = 'min', compare) {
+    const heap = [];
+    const defaultCompare = (a, b) => {
+        if (a < b)
+            return -1;
+        if (a > b)
+            return 1;
+        return 0;
+    };
+    const compareFn = compare || defaultCompare;
+    const shouldSwap = (a, b) => {
+        const cmp = compareFn(a, b);
+        return type === 'min' ? cmp < 0 : cmp > 0;
+    };
+    function getParentIndex(index) {
+        return Math.floor((index - 1) / 2);
+    }
+    function getLeftChildIndex(index) {
+        return 2 * index + 1;
+    }
+    function getRightChildIndex(index) {
+        return 2 * index + 2;
+    }
+    function swap(i, j) {
+        [heap[i], heap[j]] = [heap[j], heap[i]];
+    }
+    function heapifyUp(index) {
+        while (index > 0) {
+            const parentIndex = getParentIndex(index);
+            if (shouldSwap(heap[index], heap[parentIndex])) {
+                swap(index, parentIndex);
+                index = parentIndex;
+            }
+            else {
+                break;
+            }
+        }
+    }
+    function heapifyDown(index) {
+        while (true) {
+            let targetIndex = index;
+            const leftIndex = getLeftChildIndex(index);
+            const rightIndex = getRightChildIndex(index);
+            if (leftIndex < heap.length && shouldSwap(heap[leftIndex], heap[targetIndex])) {
+                targetIndex = leftIndex;
+            }
+            if (rightIndex < heap.length && shouldSwap(heap[rightIndex], heap[targetIndex])) {
+                targetIndex = rightIndex;
+            }
+            if (targetIndex === index) {
+                break;
+            }
+            swap(index, targetIndex);
+            index = targetIndex;
+        }
+    }
+    return {
+        insert(value) {
+            heap.push(value);
+            heapifyUp(heap.length - 1);
+        },
+        extract() {
+            if (heap.length === 0) {
+                return undefined;
+            }
+            if (heap.length === 1) {
+                return heap.pop();
+            }
+            const root = heap[0];
+            heap[0] = heap.pop();
+            heapifyDown(0);
+            return root;
+        },
+        peek() {
+            return heap[0];
+        },
+        size() {
+            return heap.length;
+        },
+        isEmpty() {
+            return heap.length === 0;
+        },
+        clear() {
+            heap.length = 0;
+        },
+        toArray() {
+            return [...heap];
+        }
+    };
+}
+//# sourceMappingURL=Heap.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Heap.js","sourceRoot":"","sources":["../../../src/functions/data-structures/Heap.ts"],"names":[],"mappings":"AA0DA,MAAM,UAAU,UAAU,CACxB,OAAiB,KAAK,EACtB,OAAgC;IAEhC,MAAM,IAAI,GAAQ,EAAE,CAAA;IAGpB,MAAM,cAAc,GAAG,CAAC,CAAI,EAAE,CAAI,EAAU,EAAE;QAC5C,IAAK,CAAS,GAAI,CAAS;YAAE,OAAO,CAAC,CAAC,CAAA;QACtC,IAAK,CAAS,GAAI,CAAS;YAAE,OAAO,CAAC,CAAA;QACrC,OAAO,CAAC,CAAA;IACV,CAAC,CAAA;IAED,MAAM,SAAS,GAAG,OAAO,IAAI,cAAc,CAAA;IAG3C,MAAM,UAAU,GAAG,CAAC,CAAI,EAAE,CAAI,EAAW,EAAE;QACzC,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC3B,OAAO,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;IAC3C,CAAC,CAAA;IAED,SAAS,cAAc,CAAC,KAAa;QACnC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IACpC,CAAC;IAED,SAAS,iBAAiB,CAAC,KAAa;QACtC,OAAO,CAAC,GAAG,KAAK,GAAG,CAAC,CAAA;IACtB,CAAC;IAED,SAAS,kBAAkB,CAAC,KAAa;QACvC,OAAO,CAAC,GAAG,KAAK,GAAG,CAAC,CAAA;IACtB,CAAC;IAED,SAAS,IAAI,CAAC,CAAS,EAAE,CAAS;QAChC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IACzC,CAAC;IAED,SAAS,SAAS,CAAC,KAAa;QAC9B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,CAAC,CAAA;YACzC,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC;gBAC/C,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAA;gBACxB,KAAK,GAAG,WAAW,CAAA;YACrB,CAAC;iBAAM,CAAC;gBACN,MAAK;YACP,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,WAAW,CAAC,KAAa;QAChC,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,WAAW,GAAG,KAAK,CAAA;YACvB,MAAM,SAAS,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAA;YAC1C,MAAM,UAAU,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAA;YAE5C,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC;gBAC9E,WAAW,GAAG,SAAS,CAAA;YACzB,CAAC;YAED,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC;gBAChF,WAAW,GAAG,UAAU,CAAA;YAC1B,CAAC;YAED,IAAI,WAAW,KAAK,KAAK,EAAE,CAAC;gBAC1B,MAAK;YACP,CAAC;YAED,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAA;YACxB,KAAK,GAAG,WAAW,CAAA;QACrB,CAAC;IACH,CAAC;IAED,OAAO;QACL,MAAM,CAAC,KAAQ;YACb,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAChB,SAAS,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAC5B,CAAC;QAED,OAAO;YACL,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,OAAO,SAAS,CAAA;YAClB,CAAC;YAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,OAAO,IAAI,CAAC,GAAG,EAAE,CAAA;YACnB,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACpB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,EAAG,CAAA;YACrB,WAAW,CAAC,CAAC,CAAC,CAAA;YAEd,OAAO,IAAI,CAAA;QACb,CAAC;QAED,IAAI;YACF,OAAO,IAAI,CAAC,CAAC,CAAC,CAAA;QAChB,CAAC;QAED,IAAI;YACF,OAAO,IAAI,CAAC,MAAM,CAAA;QACpB,CAAC;QAED,OAAO;YACL,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAA;QAC1B,CAAC;QAED,KAAK;YACH,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;QACjB,CAAC;QAED,OAAO;YACL,OAAO,CAAC,GAAG,IAAI,CAAC,CAAA;QAClB,CAAC;KACF,CAAA;AACH,CAAC"}

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

@@ -0,0 +1,41 @@
+export interface LRUCacheOptions {
+    capacity: number;
+    debug?: boolean;
+    console?: {
+        log: (...args: any[]) => void;
+        warn: (...args: any[]) => void;
+    };
+}
+export interface LRUCacheStats {
+    size: number;
+    capacity: number;
+    hits: number;
+    misses: number;
+    hitRate: number;
+}
+export declare class LRUCache<K, V> {
+    private capacity;
+    private cache;
+    private head;
+    private tail;
+    private debug;
+    private console?;
+    private hits;
+    private misses;
+    constructor(options: LRUCacheOptions);
+    get(key: K): V | undefined;
+    put(key: K, value: V): void;
+    delete(key: K): boolean;
+    clear(): void;
+    get size(): number;
+    has(key: K): boolean;
+    keys(): K[];
+    values(): V[];
+    stats(): LRUCacheStats;
+    private addToHead;
+    private removeNode;
+    private moveToHead;
+    private removeTail;
+    visualize(): string;
+}
+export declare function createLRUCache<K, V>(options: LRUCacheOptions): LRUCache<K, V>;

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

@@ -0,0 +1,182 @@
+class LRUNode {
+    key;
+    value;
+    prev;
+    next;
+    constructor(key, value, prev = null, next = null) {
+        this.key = key;
+        this.value = value;
+        this.prev = prev;
+        this.next = next;
+    }
+}
+export class LRUCache {
+    capacity;
+    cache;
+    head = null;
+    tail = null;
+    debug;
+    console;
+    hits = 0;
+    misses = 0;
+    constructor(options) {
+        this.capacity = options.capacity;
+        this.cache = new Map();
+        this.debug = options.debug ?? false;
+        this.console = options.console;
+    }
+    get(key) {
+        const node = this.cache.get(key);
+        if (!node) {
+            this.misses++;
+            if (this.debug && this.console) {
+                this.console.log(`[LRU] Miss: ${String(key)}`);
+            }
+            return undefined;
+        }
+        this.hits++;
+        if (this.debug && this.console) {
+            this.console.log(`[LRU] Hit: ${String(key)} = ${String(node.value)}`);
+        }
+        this.moveToHead(node);
+        return node.value;
+    }
+    put(key, value) {
+        const existingNode = this.cache.get(key);
+        if (existingNode) {
+            existingNode.value = value;
+            this.moveToHead(existingNode);
+            if (this.debug && this.console) {
+                this.console.log(`[LRU] Update: ${String(key)} = ${String(value)}`);
+            }
+            return;
+        }
+        const newNode = new LRUNode(key, value);
+        this.cache.set(key, newNode);
+        this.addToHead(newNode);
+        if (this.debug && this.console) {
+            this.console.log(`[LRU] Add: ${String(key)} = ${String(value)}`);
+        }
+        if (this.cache.size > this.capacity) {
+            const removedNode = this.removeTail();
+            if (removedNode) {
+                this.cache.delete(removedNode.key);
+                if (this.debug && this.console) {
+                    this.console.log(`[LRU] Evict: ${String(removedNode.key)} (LRU)`);
+                }
+            }
+        }
+    }
+    delete(key) {
+        const node = this.cache.get(key);
+        if (!node) {
+            return false;
+        }
+        this.removeNode(node);
+        this.cache.delete(key);
+        if (this.debug && this.console) {
+            this.console.log(`[LRU] Delete: ${String(key)}`);
+        }
+        return true;
+    }
+    clear() {
+        this.cache.clear();
+        this.head = null;
+        this.tail = null;
+        this.hits = 0;
+        this.misses = 0;
+        if (this.debug && this.console) {
+            this.console.log('[LRU] Clear all');
+        }
+    }
+    get size() {
+        return this.cache.size;
+    }
+    has(key) {
+        return this.cache.has(key);
+    }
+    keys() {
+        const keys = [];
+        let current = this.head;
+        while (current) {
+            keys.push(current.key);
+            current = current.next;
+        }
+        return keys;
+    }
+    values() {
+        const values = [];
+        let current = this.head;
+        while (current) {
+            values.push(current.value);
+            current = current.next;
+        }
+        return values;
+    }
+    stats() {
+        const total = this.hits + this.misses;
+        return {
+            size: this.size,
+            capacity: this.capacity,
+            hits: this.hits,
+            misses: this.misses,
+            hitRate: total > 0 ? this.hits / total : 0
+        };
+    }
+    addToHead(node) {
+        node.prev = null;
+        node.next = this.head;
+        if (this.head) {
+            this.head.prev = node;
+        }
+        this.head = node;
+        if (!this.tail) {
+            this.tail = node;
+        }
+    }
+    removeNode(node) {
+        if (node.prev) {
+            node.prev.next = node.next;
+        }
+        else {
+            this.head = node.next;
+        }
+        if (node.next) {
+            node.next.prev = node.prev;
+        }
+        else {
+            this.tail = node.prev;
+        }
+    }
+    moveToHead(node) {
+        if (node === this.head) {
+            return;
+        }
+        this.removeNode(node);
+        this.addToHead(node);
+    }
+    removeTail() {
+        if (!this.tail) {
+            return null;
+        }
+        const removed = this.tail;
+        this.removeNode(removed);
+        return removed;
+    }
+    visualize() {
+        if (!this.head) {
+            return '(empty)';
+        }
+        const items = [];
+        let current = this.head;
+        while (current) {
+            items.push(`[${String(current.key)}:${String(current.value)}]`);
+            current = current.next;
+        }
+        return items.join(' <-> ');
+    }
+}
+export function createLRUCache(options) {
+    return new LRUCache(options);
+}
+//# sourceMappingURL=LRUCache.js.map