@lakutata/orm 3.0.0 → 3.1.1

package/dist/vendor/typeorm/util/DepGraph.js

@@ -0,0 +1,255 @@
+"use strict";
+/**
+ * This source code is from https://github.com/jriecken/dependency-graph
+ * Just added "any" types here, wrapper everything into exported class.
+ * We cant use a package itself because we want to package "everything-in-it" for the frontend users of TypeORM.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DepGraph = void 0;
+/**
+ * A simple dependency graph
+ */
+const error_1 = require("../error");
+/**
+ * Helper for creating a Depth-First-Search on
+ * a set of edges.
+ *
+ * Detects cycles and throws an Error if one is detected.
+ *
+ * @param edges The set of edges to DFS through
+ * @param leavesOnly Whether to only return "leaf" nodes (ones who have no edges)
+ * @param result An array in which the results will be populated
+ */
+function createDFS(edges, leavesOnly, result) {
+    const currentPath = [];
+    const visited = {};
+    return function DFS(currentNode) {
+        visited[currentNode] = true;
+        currentPath.push(currentNode);
+        edges[currentNode].forEach(function (node) {
+            if (!visited[node]) {
+                DFS(node);
+            }
+            else if (currentPath.indexOf(node) >= 0) {
+                currentPath.push(node);
+                throw new error_1.TypeORMError(`Dependency Cycle Found: ${currentPath.join(" -> ")}`);
+            }
+        });
+        currentPath.pop();
+        if ((!leavesOnly || edges[currentNode].length === 0) &&
+            result.indexOf(currentNode) === -1) {
+            result.push(currentNode);
+        }
+    };
+}
+class DepGraph {
+    constructor() {
+        this.nodes = {};
+        this.outgoingEdges = {}; // Node -> [Dependency Node]
+        this.incomingEdges = {}; // Node -> [Dependant Node]
+    }
+    /**
+     * Add a node to the dependency graph. If a node already exists, this method will do nothing.
+     *
+     * @param node
+     * @param data
+     */
+    addNode(node, data) {
+        if (!this.hasNode(node)) {
+            // Checking the arguments length allows the user to add a node with undefined data
+            if (arguments.length === 2) {
+                this.nodes[node] = data;
+            }
+            else {
+                this.nodes[node] = node;
+            }
+            this.outgoingEdges[node] = [];
+            this.incomingEdges[node] = [];
+        }
+    }
+    /**
+     * Remove a node from the dependency graph. If a node does not exist, this method will do nothing.
+     *
+     * @param node
+     */
+    removeNode(node) {
+        if (this.hasNode(node)) {
+            delete this.nodes[node];
+            delete this.outgoingEdges[node];
+            delete this.incomingEdges[node];
+            [this.incomingEdges, this.outgoingEdges].forEach(function (edgeList) {
+                Object.keys(edgeList).forEach(function (key) {
+                    const idx = edgeList[key].indexOf(node);
+                    if (idx >= 0) {
+                        edgeList[key].splice(idx, 1);
+                    }
+                });
+            });
+        }
+    }
+    /**
+     * Check if a node exists in the graph
+     *
+     * @param node
+     */
+    hasNode(node) {
+        return this.nodes.hasOwnProperty(node);
+    }
+    /**
+     * Get the data associated with a node name
+     *
+     * @param node
+     */
+    getNodeData(node) {
+        if (this.hasNode(node)) {
+            return this.nodes[node];
+        }
+        else {
+            throw new error_1.TypeORMError(`Node does not exist: ${node}`);
+        }
+    }
+    /**
+     * Set the associated data for a given node name. If the node does not exist, this method will throw an error
+     *
+     * @param node
+     * @param data
+     */
+    setNodeData(node, data) {
+        if (this.hasNode(node)) {
+            this.nodes[node] = data;
+        }
+        else {
+            throw new error_1.TypeORMError(`Node does not exist: ${node}`);
+        }
+    }
+    /**
+     * Add a dependency between two nodes. If either of the nodes does not exist,
+     * an Error will be thrown.
+     *
+     * @param from
+     * @param to
+     */
+    addDependency(from, to) {
+        if (!this.hasNode(from)) {
+            throw new error_1.TypeORMError(`Node does not exist: ${from}`);
+        }
+        if (!this.hasNode(to)) {
+            throw new error_1.TypeORMError(`Node does not exist: ${to}`);
+        }
+        if (this.outgoingEdges[from].indexOf(to) === -1) {
+            this.outgoingEdges[from].push(to);
+        }
+        if (this.incomingEdges[to].indexOf(from) === -1) {
+            this.incomingEdges[to].push(from);
+        }
+        return true;
+    }
+    /**
+     * Remove a dependency between two nodes.
+     *
+     * @param from
+     * @param to
+     */
+    removeDependency(from, to) {
+        let idx;
+        if (this.hasNode(from)) {
+            idx = this.outgoingEdges[from].indexOf(to);
+            if (idx >= 0) {
+                this.outgoingEdges[from].splice(idx, 1);
+            }
+        }
+        if (this.hasNode(to)) {
+            idx = this.incomingEdges[to].indexOf(from);
+            if (idx >= 0) {
+                this.incomingEdges[to].splice(idx, 1);
+            }
+        }
+    }
+    /**
+     * Get an array containing the nodes that the specified node depends on (transitively).
+     *
+     * Throws an Error if the graph has a cycle, or the specified node does not exist.
+     *
+     * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned
+     * in the array.
+     *
+     * @param node
+     * @param leavesOnly
+     */
+    dependenciesOf(node, leavesOnly) {
+        if (this.hasNode(node)) {
+            const result = [];
+            const DFS = createDFS(this.outgoingEdges, leavesOnly, result);
+            DFS(node);
+            const idx = result.indexOf(node);
+            if (idx >= 0) {
+                result.splice(idx, 1);
+            }
+            return result;
+        }
+        else {
+            throw new error_1.TypeORMError(`Node does not exist: ${node}`);
+        }
+    }
+    /**
+     * get an array containing the nodes that depend on the specified node (transitively).
+     *
+     * Throws an Error if the graph has a cycle, or the specified node does not exist.
+     *
+     * If `leavesOnly` is true, only nodes that do not have any dependants will be returned in the array.
+     *
+     * @param node
+     * @param leavesOnly
+     */
+    dependantsOf(node, leavesOnly) {
+        if (this.hasNode(node)) {
+            const result = [];
+            const DFS = createDFS(this.incomingEdges, leavesOnly, result);
+            DFS(node);
+            const idx = result.indexOf(node);
+            if (idx >= 0) {
+                result.splice(idx, 1);
+            }
+            return result;
+        }
+        else {
+            throw new error_1.TypeORMError(`Node does not exist: ${node}`);
+        }
+    }
+    /**
+     * Construct the overall processing order for the dependency graph.
+     *
+     * Throws an Error if the graph has a cycle.
+     *
+     * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned.
+     *
+     * @param leavesOnly
+     */
+    overallOrder(leavesOnly) {
+        const self = this;
+        const result = [];
+        const keys = Object.keys(this.nodes);
+        if (keys.length === 0) {
+            return result; // Empty graph
+        }
+        else {
+            // Look for cycles - we run the DFS starting at all the nodes in case there
+            // are several disconnected subgraphs inside this dependency graph.
+            const CycleDFS = createDFS(this.outgoingEdges, false, []);
+            keys.forEach(function (n) {
+                CycleDFS(n);
+            });
+            const DFS = createDFS(this.outgoingEdges, leavesOnly, result);
+            // Find all potential starting points (nodes with nothing depending on them) an
+            // run a DFS starting at these points to get the order
+            keys.filter(function (node) {
+                return self.incomingEdges[node].length === 0;
+            }).forEach(function (n) {
+                DFS(n);
+            });
+            return result;
+        }
+    }
+}
+exports.DepGraph = DepGraph;
+//# sourceMappingURL=DepGraph.js.map

package/dist/vendor/typeorm/util/DepGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DepGraph.js","sourceRoot":"","sources":["../../../../vendor/typeorm/util/DepGraph.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAEH;;GAEG;AAEH,oCAAuC;AAEvC;;;;;;;;;GASG;AACH,SAAS,SAAS,CAAC,KAAU,EAAE,UAAe,EAAE,MAAW;IACvD,MAAM,WAAW,GAAU,EAAE,CAAA;IAC7B,MAAM,OAAO,GAAQ,EAAE,CAAA;IACvB,OAAO,SAAS,GAAG,CAAC,WAAgB;QAChC,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAA;QAC3B,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;QAC7B,KAAK,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,UAAU,IAAS;YAC1C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjB,GAAG,CAAC,IAAI,CAAC,CAAA;YACb,CAAC;iBAAM,IAAI,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACtB,MAAM,IAAI,oBAAY,CAClB,2BAA2B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CACxD,CAAA;YACL,CAAC;QACL,CAAC,CAAC,CAAA;QACF,WAAW,CAAC,GAAG,EAAE,CAAA;QACjB,IACI,CAAC,CAAC,UAAU,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;YAChD,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EACpC,CAAC;YACC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;QAC5B,CAAC;IACL,CAAC,CAAA;AACL,CAAC;AAED,MAAa,QAAQ;IAArB;QACI,UAAK,GAAQ,EAAE,CAAA;QACf,kBAAa,GAAQ,EAAE,CAAA,CAAC,4BAA4B;QACpD,kBAAa,GAAQ,EAAE,CAAA,CAAC,2BAA2B;IAoNvD,CAAC;IAlNG;;;;;OAKG;IACH,OAAO,CAAC,IAAS,EAAE,IAAU;QACzB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,kFAAkF;YAClF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;YAC3B,CAAC;iBAAM,CAAC;gBACJ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;YAC3B,CAAC;YACD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;YAC7B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;QACjC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,IAAS;QAChB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YACvB,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAA;YAC/B,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAC9B;YAAA,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,OAAO,CAC7C,UAAU,QAAQ;gBACd,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,UAAU,GAAQ;oBAC5C,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;oBACvC,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;wBACX,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;oBAChC,CAAC;gBACL,CAAC,CAAC,CAAA;YACN,CAAC,CACJ,CAAA;QACL,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,IAAS;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;IAC1C,CAAC;IAED;;;;OAIG;IACH,WAAW,CAAC,IAAS;QACjB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAC3B,CAAC;aAAM,CAAC;YACJ,MAAM,IAAI,oBAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;QAC1D,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,IAAS,EAAE,IAAS;QAC5B,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;QAC3B,CAAC;aAAM,CAAC;YACJ,MAAM,IAAI,oBAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;QAC1D,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,aAAa,CAAC,IAAS,EAAE,EAAO;QAC5B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,oBAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;QAC1D,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACpB,MAAM,IAAI,oBAAY,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAA;QACxD,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACrC,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACrC,CAAC;QACD,OAAO,IAAI,CAAA;IACf,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,IAAS,EAAE,EAAO;QAC/B,IAAI,GAAQ,CAAA;QACZ,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;YAC1C,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;gBACX,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YAC3C,CAAC;QACL,CAAC;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACnB,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAC1C,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;gBACX,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YACzC,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;;;;;;OAUG;IACH,cAAc,CAAC,IAAS,EAAE,UAAe;QACrC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,MAAM,MAAM,GAAU,EAAE,CAAA;YACxB,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,MAAM,CAAC,CAAA;YAC7D,GAAG,CAAC,IAAI,CAAC,CAAA;YACT,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAChC,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;gBACX,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YACzB,CAAC;YACD,OAAO,MAAM,CAAA;QACjB,CAAC;aAAM,CAAC;YACJ,MAAM,IAAI,oBAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;QAC1D,CAAC;IACL,CAAC;IAED;;;;;;;;;OASG;IACH,YAAY,CAAC,IAAS,EAAE,UAAe;QACnC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,MAAM,MAAM,GAAU,EAAE,CAAA;YACxB,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,MAAM,CAAC,CAAA;YAC7D,GAAG,CAAC,IAAI,CAAC,CAAA;YACT,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAChC,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;gBACX,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YACzB,CAAC;YACD,OAAO,MAAM,CAAA;QACjB,CAAC;aAAM,CAAC;YACJ,MAAM,IAAI,oBAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;QAC1D,CAAC;IACL,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY,CAAC,UAAgB;QACzB,MAAM,IAAI,GAAG,IAAI,CAAA;QACjB,MAAM,MAAM,GAAU,EAAE,CAAA;QACxB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACpC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpB,OAAO,MAAM,CAAA,CAAC,cAAc;QAChC,CAAC;aAAM,CAAC;YACJ,2EAA2E;YAC3E,mEAAmE;YACnE,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,EAAE,EAAE,CAAC,CAAA;YACzD,IAAI,CAAC,OAAO,CAAC,UAAU,CAAM;gBACzB,QAAQ,CAAC,CAAC,CAAC,CAAA;YACf,CAAC,CAAC,CAAA;YAEF,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,MAAM,CAAC,CAAA;YAC7D,+EAA+E;YAC/E,sDAAsD;YACtD,IAAI,CAAC,MAAM,CAAC,UAAU,IAAI;gBACtB,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAA;YAChD,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;gBAClB,GAAG,CAAC,CAAC,CAAC,CAAA;YACV,CAAC,CAAC,CAAA;YAEF,OAAO,MAAM,CAAA;QACjB,CAAC;IACL,CAAC;CACJ;AAvND,4BAuNC","sourcesContent":["/**\n * This source code is from https://github.com/jriecken/dependency-graph\n * Just added \"any\" types here, wrapper everything into exported class.\n * We cant use a package itself because we want to package \"everything-in-it\" for the frontend users of TypeORM.\n */\n\n/**\n * A simple dependency graph\n */\n\nimport { TypeORMError } from \"../error\"\n\n/**\n * Helper for creating a Depth-First-Search on\n * a set of edges.\n *\n * Detects cycles and throws an Error if one is detected.\n *\n * @param edges The set of edges to DFS through\n * @param leavesOnly Whether to only return \"leaf\" nodes (ones who have no edges)\n * @param result An array in which the results will be populated\n */\nfunction createDFS(edges: any, leavesOnly: any, result: any) {\n    const currentPath: any[] = []\n    const visited: any = {}\n    return function DFS(currentNode: any) {\n        visited[currentNode] = true\n        currentPath.push(currentNode)\n        edges[currentNode].forEach(function (node: any) {\n            if (!visited[node]) {\n                DFS(node)\n            } else if (currentPath.indexOf(node) >= 0) {\n                currentPath.push(node)\n                throw new TypeORMError(\n                    `Dependency Cycle Found: ${currentPath.join(\" -> \")}`,\n                )\n            }\n        })\n        currentPath.pop()\n        if (\n            (!leavesOnly || edges[currentNode].length === 0) &&\n            result.indexOf(currentNode) === -1\n        ) {\n            result.push(currentNode)\n        }\n    }\n}\n\nexport class DepGraph {\n    nodes: any = {}\n    outgoingEdges: any = {} // Node -> [Dependency Node]\n    incomingEdges: any = {} // Node -> [Dependant Node]\n\n    /**\n     * Add a node to the dependency graph. If a node already exists, this method will do nothing.\n     *\n     * @param node\n     * @param data\n     */\n    addNode(node: any, data?: any) {\n        if (!this.hasNode(node)) {\n            // Checking the arguments length allows the user to add a node with undefined data\n            if (arguments.length === 2) {\n                this.nodes[node] = data\n            } else {\n                this.nodes[node] = node\n            }\n            this.outgoingEdges[node] = []\n            this.incomingEdges[node] = []\n        }\n    }\n\n    /**\n     * Remove a node from the dependency graph. If a node does not exist, this method will do nothing.\n     *\n     * @param node\n     */\n    removeNode(node: any) {\n        if (this.hasNode(node)) {\n            delete this.nodes[node]\n            delete this.outgoingEdges[node]\n            delete this.incomingEdges[node]\n            ;[this.incomingEdges, this.outgoingEdges].forEach(\n                function (edgeList) {\n                    Object.keys(edgeList).forEach(function (key: any) {\n                        const idx = edgeList[key].indexOf(node)\n                        if (idx >= 0) {\n                            edgeList[key].splice(idx, 1)\n                        }\n                    })\n                },\n            )\n        }\n    }\n\n    /**\n     * Check if a node exists in the graph\n     *\n     * @param node\n     */\n    hasNode(node: any) {\n        return this.nodes.hasOwnProperty(node)\n    }\n\n    /**\n     * Get the data associated with a node name\n     *\n     * @param node\n     */\n    getNodeData(node: any) {\n        if (this.hasNode(node)) {\n            return this.nodes[node]\n        } else {\n            throw new TypeORMError(`Node does not exist: ${node}`)\n        }\n    }\n\n    /**\n     * Set the associated data for a given node name. If the node does not exist, this method will throw an error\n     *\n     * @param node\n     * @param data\n     */\n    setNodeData(node: any, data: any) {\n        if (this.hasNode(node)) {\n            this.nodes[node] = data\n        } else {\n            throw new TypeORMError(`Node does not exist: ${node}`)\n        }\n    }\n\n    /**\n     * Add a dependency between two nodes. If either of the nodes does not exist,\n     * an Error will be thrown.\n     *\n     * @param from\n     * @param to\n     */\n    addDependency(from: any, to: any) {\n        if (!this.hasNode(from)) {\n            throw new TypeORMError(`Node does not exist: ${from}`)\n        }\n        if (!this.hasNode(to)) {\n            throw new TypeORMError(`Node does not exist: ${to}`)\n        }\n        if (this.outgoingEdges[from].indexOf(to) === -1) {\n            this.outgoingEdges[from].push(to)\n        }\n        if (this.incomingEdges[to].indexOf(from) === -1) {\n            this.incomingEdges[to].push(from)\n        }\n        return true\n    }\n\n    /**\n     * Remove a dependency between two nodes.\n     *\n     * @param from\n     * @param to\n     */\n    removeDependency(from: any, to: any) {\n        let idx: any\n        if (this.hasNode(from)) {\n            idx = this.outgoingEdges[from].indexOf(to)\n            if (idx >= 0) {\n                this.outgoingEdges[from].splice(idx, 1)\n            }\n        }\n\n        if (this.hasNode(to)) {\n            idx = this.incomingEdges[to].indexOf(from)\n            if (idx >= 0) {\n                this.incomingEdges[to].splice(idx, 1)\n            }\n        }\n    }\n\n    /**\n     * Get an array containing the nodes that the specified node depends on (transitively).\n     *\n     * Throws an Error if the graph has a cycle, or the specified node does not exist.\n     *\n     * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned\n     * in the array.\n     *\n     * @param node\n     * @param leavesOnly\n     */\n    dependenciesOf(node: any, leavesOnly: any) {\n        if (this.hasNode(node)) {\n            const result: any[] = []\n            const DFS = createDFS(this.outgoingEdges, leavesOnly, result)\n            DFS(node)\n            const idx = result.indexOf(node)\n            if (idx >= 0) {\n                result.splice(idx, 1)\n            }\n            return result\n        } else {\n            throw new TypeORMError(`Node does not exist: ${node}`)\n        }\n    }\n\n    /**\n     * get an array containing the nodes that depend on the specified node (transitively).\n     *\n     * Throws an Error if the graph has a cycle, or the specified node does not exist.\n     *\n     * If `leavesOnly` is true, only nodes that do not have any dependants will be returned in the array.\n     *\n     * @param node\n     * @param leavesOnly\n     */\n    dependantsOf(node: any, leavesOnly: any) {\n        if (this.hasNode(node)) {\n            const result: any[] = []\n            const DFS = createDFS(this.incomingEdges, leavesOnly, result)\n            DFS(node)\n            const idx = result.indexOf(node)\n            if (idx >= 0) {\n                result.splice(idx, 1)\n            }\n            return result\n        } else {\n            throw new TypeORMError(`Node does not exist: ${node}`)\n        }\n    }\n\n    /**\n     * Construct the overall processing order for the dependency graph.\n     *\n     * Throws an Error if the graph has a cycle.\n     *\n     * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned.\n     *\n     * @param leavesOnly\n     */\n    overallOrder(leavesOnly?: any) {\n        const self = this\n        const result: any[] = []\n        const keys = Object.keys(this.nodes)\n        if (keys.length === 0) {\n            return result // Empty graph\n        } else {\n            // Look for cycles - we run the DFS starting at all the nodes in case there\n            // are several disconnected subgraphs inside this dependency graph.\n            const CycleDFS = createDFS(this.outgoingEdges, false, [])\n            keys.forEach(function (n: any) {\n                CycleDFS(n)\n            })\n\n            const DFS = createDFS(this.outgoingEdges, leavesOnly, result)\n            // Find all potential starting points (nodes with nothing depending on them) an\n            // run a DFS starting at these points to get the order\n            keys.filter(function (node) {\n                return self.incomingEdges[node].length === 0\n            }).forEach(function (n) {\n                DFS(n)\n            })\n\n            return result\n        }\n    }\n}\n"]}

package/dist/vendor/typeorm/util/DirectoryExportedClassesLoader.d.ts

@@ -0,0 +1,9 @@
+import type { Logger } from "../logger/Logger";
+/**
+ * Loads all exported classes from the given directory.
+ *
+ * @param logger
+ * @param directories
+ * @param formats
+ */
+export declare function importClassesFromDirectories(logger: Logger, directories: string[], formats?: string[]): Promise<Function[]>;

package/dist/vendor/typeorm/util/DirectoryExportedClassesLoader.js

@@ -0,0 +1,60 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.importClassesFromDirectories = importClassesFromDirectories;
+const tinyglobby_1 = require("tinyglobby");
+const PlatformTools_1 = require("../platform/PlatformTools");
+const ImportUtils_1 = require("./ImportUtils");
+const InstanceChecker_1 = require("./InstanceChecker");
+const ObjectUtils_1 = require("./ObjectUtils");
+/**
+ * Loads all exported classes from the given directory.
+ *
+ * @param logger
+ * @param directories
+ * @param formats
+ */
+async function importClassesFromDirectories(logger, directories, formats = [".js", ".mjs", ".cjs", ".ts", ".mts", ".cts"]) {
+    const logLevel = "info";
+    const classesNotFoundMessage = "No classes were found using the provided glob pattern: ";
+    const classesFoundMessage = "All classes found using provided glob pattern";
+    /**
+     *
+     * @param exported
+     * @param allLoaded
+     */
+    function loadFileClasses(exported, allLoaded) {
+        if (typeof exported === "function" ||
+            InstanceChecker_1.InstanceChecker.isEntitySchema(exported)) {
+            allLoaded.push(exported);
+        }
+        else if (Array.isArray(exported)) {
+            exported.forEach((value) => loadFileClasses(value, allLoaded));
+        }
+        else if (ObjectUtils_1.ObjectUtils.isObject(exported)) {
+            Object.values(exported).forEach((value) => loadFileClasses(value, allLoaded));
+        }
+        return allLoaded;
+    }
+    const allFiles = directories.reduce((allDirs, dir) => {
+        return allDirs.concat((0, tinyglobby_1.globSync)(PlatformTools_1.PlatformTools.pathNormalize(dir)));
+    }, []);
+    if (directories.length > 0 && allFiles.length === 0) {
+        logger.log(logLevel, `${classesNotFoundMessage} "${directories}"`);
+    }
+    else if (allFiles.length > 0) {
+        logger.log(logLevel, `${classesFoundMessage} "${directories}" : "${allFiles}"`);
+    }
+    const dirPromises = allFiles
+        .filter((file) => {
+        const dtsExtension = file.slice(-5);
+        return (formats.indexOf(PlatformTools_1.PlatformTools.pathExtname(file)) !== -1 &&
+            dtsExtension !== ".d.ts");
+    })
+        .map(async (file) => {
+        const [importOrRequireResult] = await (0, ImportUtils_1.importOrRequireFile)(PlatformTools_1.PlatformTools.pathResolve(file));
+        return importOrRequireResult;
+    });
+    const dirs = await Promise.all(dirPromises);
+    return loadFileClasses(dirs, []);
+}
+//# sourceMappingURL=DirectoryExportedClassesLoader.js.map

package/dist/vendor/typeorm/util/DirectoryExportedClassesLoader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DirectoryExportedClassesLoader.js","sourceRoot":"","sources":["../../../../vendor/typeorm/util/DirectoryExportedClassesLoader.ts"],"names":[],"mappings":";;AAcA,oEA4DC;AA1ED,2CAAqC;AAErC,6DAAyD;AACzD,+CAAmD;AACnD,uDAAmD;AACnD,+CAA2C;AAE3C;;;;;;GAMG;AACI,KAAK,UAAU,4BAA4B,CAC9C,MAAc,EACd,WAAqB,EACrB,OAAO,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC;IAExD,MAAM,QAAQ,GAAG,MAAM,CAAA;IACvB,MAAM,sBAAsB,GACxB,yDAAyD,CAAA;IAC7D,MAAM,mBAAmB,GAAG,+CAA+C,CAAA;IAC3E;;;;OAIG;IACH,SAAS,eAAe,CAAC,QAAa,EAAE,SAAqB;QACzD,IACI,OAAO,QAAQ,KAAK,UAAU;YAC9B,iCAAe,CAAC,cAAc,CAAC,QAAQ,CAAC,EAC1C,CAAC;YACC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC5B,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjC,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAA;QAClE,CAAC;aAAM,IAAI,yBAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CACtC,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,CACpC,CAAA;QACL,CAAC;QACD,OAAO,SAAS,CAAA;IACpB,CAAC;IAED,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;QACjD,OAAO,OAAO,CAAC,MAAM,CAAC,IAAA,qBAAQ,EAAC,6BAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACrE,CAAC,EAAE,EAAc,CAAC,CAAA;IAElB,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClD,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,sBAAsB,KAAK,WAAW,GAAG,CAAC,CAAA;IACtE,CAAC;SAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,CACN,QAAQ,EACR,GAAG,mBAAmB,KAAK,WAAW,QAAQ,QAAQ,GAAG,CAC5D,CAAA;IACL,CAAC;IACD,MAAM,WAAW,GAAG,QAAQ;SACvB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACb,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QACnC,OAAO,CACH,OAAO,CAAC,OAAO,CAAC,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;YACvD,YAAY,KAAK,OAAO,CAC3B,CAAA;IACL,CAAC,CAAC;SACD,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;QAChB,MAAM,CAAC,qBAAqB,CAAC,GAAG,MAAM,IAAA,iCAAmB,EACrD,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,CAClC,CAAA;QACD,OAAO,qBAAqB,CAAA;IAChC,CAAC,CAAC,CAAA;IAEN,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAE3C,OAAO,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;AACpC,CAAC","sourcesContent":["import { globSync } from \"tinyglobby\"\nimport type { Logger } from \"../logger/Logger\"\nimport { PlatformTools } from \"../platform/PlatformTools\"\nimport { importOrRequireFile } from \"./ImportUtils\"\nimport { InstanceChecker } from \"./InstanceChecker\"\nimport { ObjectUtils } from \"./ObjectUtils\"\n\n/**\n * Loads all exported classes from the given directory.\n *\n * @param logger\n * @param directories\n * @param formats\n */\nexport async function importClassesFromDirectories(\n    logger: Logger,\n    directories: string[],\n    formats = [\".js\", \".mjs\", \".cjs\", \".ts\", \".mts\", \".cts\"],\n): Promise<Function[]> {\n    const logLevel = \"info\"\n    const classesNotFoundMessage =\n        \"No classes were found using the provided glob pattern: \"\n    const classesFoundMessage = \"All classes found using provided glob pattern\"\n    /**\n     *\n     * @param exported\n     * @param allLoaded\n     */\n    function loadFileClasses(exported: any, allLoaded: Function[]) {\n        if (\n            typeof exported === \"function\" ||\n            InstanceChecker.isEntitySchema(exported)\n        ) {\n            allLoaded.push(exported)\n        } else if (Array.isArray(exported)) {\n            exported.forEach((value) => loadFileClasses(value, allLoaded))\n        } else if (ObjectUtils.isObject(exported)) {\n            Object.values(exported).forEach((value) =>\n                loadFileClasses(value, allLoaded),\n            )\n        }\n        return allLoaded\n    }\n\n    const allFiles = directories.reduce((allDirs, dir) => {\n        return allDirs.concat(globSync(PlatformTools.pathNormalize(dir)))\n    }, [] as string[])\n\n    if (directories.length > 0 && allFiles.length === 0) {\n        logger.log(logLevel, `${classesNotFoundMessage} \"${directories}\"`)\n    } else if (allFiles.length > 0) {\n        logger.log(\n            logLevel,\n            `${classesFoundMessage} \"${directories}\" : \"${allFiles}\"`,\n        )\n    }\n    const dirPromises = allFiles\n        .filter((file) => {\n            const dtsExtension = file.slice(-5)\n            return (\n                formats.indexOf(PlatformTools.pathExtname(file)) !== -1 &&\n                dtsExtension !== \".d.ts\"\n            )\n        })\n        .map(async (file) => {\n            const [importOrRequireResult] = await importOrRequireFile(\n                PlatformTools.pathResolve(file),\n            )\n            return importOrRequireResult\n        })\n\n    const dirs = await Promise.all(dirPromises)\n\n    return loadFileClasses(dirs, [])\n}\n"]}

package/dist/vendor/typeorm/util/ImportUtils.d.ts

@@ -0,0 +1,5 @@
+/**
+ *
+ * @param filePath
+ */
+export declare function importOrRequireFile(filePath: string): Promise<[any, "esm" | "commonjs"]>;

package/dist/vendor/typeorm/util/ImportUtils.js

@@ -0,0 +1,107 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.importOrRequireFile = importOrRequireFile;
+const tslib_1 = require("tslib");
+const promises_1 = tslib_1.__importDefault(require("fs/promises"));
+const path_1 = tslib_1.__importDefault(require("path"));
+const url_1 = require("url");
+/**
+ *
+ * @param filePath
+ */
+async function importOrRequireFile(filePath) {
+    const tryToImport = async () => {
+        // `Function` is required to make sure the `import` statement wil stay `import` after
+        // transpilation and won't be converted to `require`
+        return [
+            // eslint-disable-next-line @typescript-eslint/no-implied-eval
+            await Function("return filePath => import(filePath)")()(filePath.startsWith("file://")
+                ? filePath
+                : (0, url_1.pathToFileURL)(filePath).toString()),
+            "esm",
+        ];
+    };
+    const tryToRequire = () => {
+        return [require(filePath), "commonjs"];
+    };
+    const extension = filePath.slice(filePath.lastIndexOf(".") + ".".length);
+    if (extension === "mjs" || extension === "mts")
+        return tryToImport();
+    else if (extension === "cjs" || extension === "cts")
+        return tryToRequire();
+    else if (extension === "js" || extension === "ts") {
+        const packageJson = await getNearestPackageJson(filePath);
+        if (packageJson != null) {
+            const isModule = packageJson?.type === "module";
+            if (isModule)
+                return tryToImport();
+            else
+                return tryToRequire();
+        }
+        else
+            return tryToRequire();
+    }
+    return tryToRequire();
+}
+const packageJsonCache = new Map();
+const MAX_CACHE_SIZE = 1000;
+/**
+ *
+ * @param paths
+ * @param packageJson
+ */
+function setPackageJsonCache(paths, packageJson) {
+    for (const path of paths) {
+        // Simple LRU-like behavior: if we're at capacity, remove oldest entry
+        if (packageJsonCache.size >= MAX_CACHE_SIZE &&
+            !packageJsonCache.has(path)) {
+            const firstKey = packageJsonCache.keys().next().value;
+            if (firstKey)
+                packageJsonCache.delete(firstKey);
+        }
+        packageJsonCache.set(path, packageJson);
+    }
+}
+/**
+ *
+ * @param filePath
+ */
+async function getNearestPackageJson(filePath) {
+    let currentPath = filePath;
+    const paths = [];
+    while (currentPath !== path_1.default.dirname(currentPath)) {
+        currentPath = path_1.default.dirname(currentPath);
+        // Check if we have already cached the package.json for this path
+        if (packageJsonCache.has(currentPath)) {
+            setPackageJsonCache(paths, packageJsonCache.get(currentPath));
+            return packageJsonCache.get(currentPath);
+        }
+        // Add the current path to the list of paths to cache
+        paths.push(currentPath);
+        const potentialPackageJson = path_1.default.join(currentPath, "package.json");
+        try {
+            const stats = await promises_1.default.stat(potentialPackageJson);
+            if (!stats.isFile()) {
+                continue;
+            }
+            try {
+                const parsedPackage = JSON.parse(await promises_1.default.readFile(potentialPackageJson, "utf8"));
+                // Cache the parsed package.json object and return it
+                setPackageJsonCache(paths, parsedPackage);
+                return parsedPackage;
+            }
+            catch {
+                // If parsing fails, we still cache null to avoid repeated attempts
+                setPackageJsonCache(paths, null);
+                return null;
+            }
+        }
+        catch {
+            continue;
+        }
+    }
+    // the top of the file tree is reached
+    setPackageJsonCache(paths, null);
+    return null;
+}
+//# sourceMappingURL=ImportUtils.js.map

package/dist/vendor/typeorm/util/ImportUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ImportUtils.js","sourceRoot":"","sources":["../../../../vendor/typeorm/util/ImportUtils.ts"],"names":[],"mappings":";;AAQA,kDAoCC;;AA5CD,mEAA4B;AAC5B,wDAAuB;AACvB,6BAAmC;AAEnC;;;GAGG;AACI,KAAK,UAAU,mBAAmB,CACrC,QAAgB;IAEhB,MAAM,WAAW,GAAG,KAAK,IAA2B,EAAE;QAClD,qFAAqF;QACrF,oDAAoD;QACpD,OAAO;YACH,8DAA8D;YAC9D,MAAM,QAAQ,CAAC,qCAAqC,CAAC,EAAE,CACnD,QAAQ,CAAC,UAAU,CAAC,SAAS,CAAC;gBAC1B,CAAC,CAAC,QAAQ;gBACV,CAAC,CAAC,IAAA,mBAAa,EAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAC3C;YACD,KAAK;SACR,CAAA;IACL,CAAC,CAAA;IACD,MAAM,YAAY,GAAG,GAAsB,EAAE;QACzC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC,CAAA;IAC1C,CAAC,CAAA;IAED,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAA;IAExE,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,KAAK;QAAE,OAAO,WAAW,EAAE,CAAA;SAC/D,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,KAAK;QAAE,OAAO,YAAY,EAAE,CAAA;SACrE,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,MAAM,qBAAqB,CAAC,QAAQ,CAAC,CAAA;QAEzD,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAI,WAAmB,EAAE,IAAI,KAAK,QAAQ,CAAA;YAExD,IAAI,QAAQ;gBAAE,OAAO,WAAW,EAAE,CAAA;;gBAC7B,OAAO,YAAY,EAAE,CAAA;QAC9B,CAAC;;YAAM,OAAO,YAAY,EAAE,CAAA;IAChC,CAAC;IAED,OAAO,YAAY,EAAE,CAAA;AACzB,CAAC;AAED,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAyB,CAAA;AACzD,MAAM,cAAc,GAAG,IAAI,CAAA;AAE3B;;;;GAIG;AACH,SAAS,mBAAmB,CAAC,KAAe,EAAE,WAA0B;IACpE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,sEAAsE;QACtE,IACI,gBAAgB,CAAC,IAAI,IAAI,cAAc;YACvC,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAC7B,CAAC;YACC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAA;YACrD,IAAI,QAAQ;gBAAE,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;QACnD,CAAC;QACD,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAA;IAC3C,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,qBAAqB,CAAC,QAAgB;IACjD,IAAI,WAAW,GAAG,QAAQ,CAAA;IAC1B,MAAM,KAAK,GAAa,EAAE,CAAA;IAE1B,OAAO,WAAW,KAAK,cAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAC/C,WAAW,GAAG,cAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;QAEvC,iEAAiE;QACjE,IAAI,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACpC,mBAAmB,CAAC,KAAK,EAAE,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,CAAA;YAC9D,OAAO,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAE,CAAA;QAC7C,CAAC;QAED,qDAAqD;QACrD,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;QAEvB,MAAM,oBAAoB,GAAG,cAAI,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,CAAA;QAEnE,IAAI,CAAC;YACD,MAAM,KAAK,GAAG,MAAM,kBAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAA;YACjD,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClB,SAAQ;YACZ,CAAC;YAED,IAAI,CAAC;gBACD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAC5B,MAAM,kBAAE,CAAC,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC,CAClD,CAAA;gBACD,qDAAqD;gBACrD,mBAAmB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAA;gBACzC,OAAO,aAAa,CAAA;YACxB,CAAC;YAAC,MAAM,CAAC;gBACL,mEAAmE;gBACnE,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;gBAChC,OAAO,IAAI,CAAA;YACf,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACL,SAAQ;QACZ,CAAC;IACL,CAAC;IAED,sCAAsC;IACtC,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IAChC,OAAO,IAAI,CAAA;AACf,CAAC","sourcesContent":["import fs from \"fs/promises\"\nimport path from \"path\"\nimport { pathToFileURL } from \"url\"\n\n/**\n *\n * @param filePath\n */\nexport async function importOrRequireFile(\n    filePath: string,\n): Promise<[any, \"esm\" | \"commonjs\"]> {\n    const tryToImport = async (): Promise<[any, \"esm\"]> => {\n        // `Function` is required to make sure the `import` statement wil stay `import` after\n        // transpilation and won't be converted to `require`\n        return [\n            // eslint-disable-next-line @typescript-eslint/no-implied-eval\n            await Function(\"return filePath => import(filePath)\")()(\n                filePath.startsWith(\"file://\")\n                    ? filePath\n                    : pathToFileURL(filePath).toString(),\n            ),\n            \"esm\",\n        ]\n    }\n    const tryToRequire = (): [any, \"commonjs\"] => {\n        return [require(filePath), \"commonjs\"]\n    }\n\n    const extension = filePath.slice(filePath.lastIndexOf(\".\") + \".\".length)\n\n    if (extension === \"mjs\" || extension === \"mts\") return tryToImport()\n    else if (extension === \"cjs\" || extension === \"cts\") return tryToRequire()\n    else if (extension === \"js\" || extension === \"ts\") {\n        const packageJson = await getNearestPackageJson(filePath)\n\n        if (packageJson != null) {\n            const isModule = (packageJson as any)?.type === \"module\"\n\n            if (isModule) return tryToImport()\n            else return tryToRequire()\n        } else return tryToRequire()\n    }\n\n    return tryToRequire()\n}\n\nconst packageJsonCache = new Map<string, object | null>()\nconst MAX_CACHE_SIZE = 1000\n\n/**\n *\n * @param paths\n * @param packageJson\n */\nfunction setPackageJsonCache(paths: string[], packageJson: object | null) {\n    for (const path of paths) {\n        // Simple LRU-like behavior: if we're at capacity, remove oldest entry\n        if (\n            packageJsonCache.size >= MAX_CACHE_SIZE &&\n            !packageJsonCache.has(path)\n        ) {\n            const firstKey = packageJsonCache.keys().next().value\n            if (firstKey) packageJsonCache.delete(firstKey)\n        }\n        packageJsonCache.set(path, packageJson)\n    }\n}\n\n/**\n *\n * @param filePath\n */\nasync function getNearestPackageJson(filePath: string): Promise<object | null> {\n    let currentPath = filePath\n    const paths: string[] = []\n\n    while (currentPath !== path.dirname(currentPath)) {\n        currentPath = path.dirname(currentPath)\n\n        // Check if we have already cached the package.json for this path\n        if (packageJsonCache.has(currentPath)) {\n            setPackageJsonCache(paths, packageJsonCache.get(currentPath)!)\n            return packageJsonCache.get(currentPath)!\n        }\n\n        // Add the current path to the list of paths to cache\n        paths.push(currentPath)\n\n        const potentialPackageJson = path.join(currentPath, \"package.json\")\n\n        try {\n            const stats = await fs.stat(potentialPackageJson)\n            if (!stats.isFile()) {\n                continue\n            }\n\n            try {\n                const parsedPackage = JSON.parse(\n                    await fs.readFile(potentialPackageJson, \"utf8\"),\n                )\n                // Cache the parsed package.json object and return it\n                setPackageJsonCache(paths, parsedPackage)\n                return parsedPackage\n            } catch {\n                // If parsing fails, we still cache null to avoid repeated attempts\n                setPackageJsonCache(paths, null)\n                return null\n            }\n        } catch {\n            continue\n        }\n    }\n\n    // the top of the file tree is reached\n    setPackageJsonCache(paths, null)\n    return null\n}\n"]}

package/dist/vendor/typeorm/util/InstanceChecker.d.ts

@@ -0,0 +1,61 @@
+import type { MongoEntityManager } from "../entity-manager/MongoEntityManager";
+import type { SqljsEntityManager } from "../entity-manager/SqljsEntityManager";
+import type { EntitySchema } from "../entity-schema/EntitySchema";
+import type { FindOperator } from "../find-options/FindOperator";
+import type { EqualOperator } from "../find-options/EqualOperator";
+import type { Query } from "../driver/Query";
+import type { RdbmsSchemaBuilder } from "../schema-builder/RdbmsSchemaBuilder";
+import type { Subject } from "../persistence/Subject";
+import type { SelectQueryBuilder } from "../query-builder/SelectQueryBuilder";
+import type { UpdateQueryBuilder } from "../query-builder/UpdateQueryBuilder";
+import type { DeleteQueryBuilder } from "../query-builder/DeleteQueryBuilder";
+import type { SoftDeleteQueryBuilder } from "../query-builder/SoftDeleteQueryBuilder";
+import type { InsertQueryBuilder } from "../query-builder/InsertQueryBuilder";
+import type { RelationQueryBuilder } from "../query-builder/RelationQueryBuilder";
+import type { Brackets } from "../query-builder/Brackets";
+import type { Table } from "../schema-builder/table/Table";
+import type { TableCheck } from "../schema-builder/table/TableCheck";
+import type { TableColumn } from "../schema-builder/table/TableColumn";
+import type { TableExclusion } from "../schema-builder/table/TableExclusion";
+import type { TableForeignKey } from "../schema-builder/table/TableForeignKey";
+import type { TableIndex } from "../schema-builder/table/TableIndex";
+import type { TableUnique } from "../schema-builder/table/TableUnique";
+import type { View } from "../schema-builder/view/View";
+import type { NotBrackets } from "../query-builder/NotBrackets";
+import type { EntityMetadata } from "../metadata/EntityMetadata";
+import type { ColumnMetadata } from "../metadata/ColumnMetadata";
+import type { MssqlParameter } from "../driver/sqlserver/MssqlParameter";
+import type { DataSource } from "../data-source";
+import type { BaseEntity } from "../repository/BaseEntity";
+export declare class InstanceChecker {
+    static isMssqlParameter(obj: unknown): obj is MssqlParameter;
+    static isEntityMetadata(obj: unknown): obj is EntityMetadata;
+    static isColumnMetadata(obj: unknown): obj is ColumnMetadata;
+    static isSelectQueryBuilder(obj: unknown): obj is SelectQueryBuilder<any>;
+    static isInsertQueryBuilder(obj: unknown): obj is InsertQueryBuilder<any>;
+    static isDeleteQueryBuilder(obj: unknown): obj is DeleteQueryBuilder<any>;
+    static isUpdateQueryBuilder(obj: unknown): obj is UpdateQueryBuilder<any>;
+    static isSoftDeleteQueryBuilder(obj: unknown): obj is SoftDeleteQueryBuilder<any>;
+    static isRelationQueryBuilder(obj: unknown): obj is RelationQueryBuilder<any>;
+    static isBrackets(obj: unknown): obj is Brackets;
+    static isNotBrackets(obj: unknown): obj is NotBrackets;
+    static isSubject(obj: unknown): obj is Subject;
+    static isRdbmsSchemaBuilder(obj: unknown): obj is RdbmsSchemaBuilder;
+    static isMongoEntityManager(obj: unknown): obj is MongoEntityManager;
+    static isSqljsEntityManager(obj: unknown): obj is SqljsEntityManager;
+    static isEntitySchema(obj: unknown): obj is EntitySchema;
+    static isBaseEntityConstructor(obj: unknown): obj is typeof BaseEntity;
+    static isFindOperator(obj: unknown): obj is FindOperator<any>;
+    static isEqualOperator(obj: unknown): obj is EqualOperator<any>;
+    static isQuery(obj: unknown): obj is Query;
+    static isTable(obj: unknown): obj is Table;
+    static isTableCheck(obj: unknown): obj is TableCheck;
+    static isTableColumn(obj: unknown): obj is TableColumn;
+    static isTableExclusion(obj: unknown): obj is TableExclusion;
+    static isTableForeignKey(obj: unknown): obj is TableForeignKey;
+    static isTableIndex(obj: unknown): obj is TableIndex;
+    static isTableUnique(obj: unknown): obj is TableUnique;
+    static isView(obj: unknown): obj is View;
+    static isDataSource(obj: unknown): obj is DataSource;
+    private static check;
+}

package/dist/vendor/typeorm/util/InstanceChecker.js

@@ -0,0 +1,103 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InstanceChecker = void 0;
+class InstanceChecker {
+    static isMssqlParameter(obj) {
+        return this.check(obj, "MssqlParameter");
+    }
+    static isEntityMetadata(obj) {
+        return this.check(obj, "EntityMetadata");
+    }
+    static isColumnMetadata(obj) {
+        return this.check(obj, "ColumnMetadata");
+    }
+    static isSelectQueryBuilder(obj) {
+        return this.check(obj, "SelectQueryBuilder");
+    }
+    static isInsertQueryBuilder(obj) {
+        return this.check(obj, "InsertQueryBuilder");
+    }
+    static isDeleteQueryBuilder(obj) {
+        return this.check(obj, "DeleteQueryBuilder");
+    }
+    static isUpdateQueryBuilder(obj) {
+        return this.check(obj, "UpdateQueryBuilder");
+    }
+    static isSoftDeleteQueryBuilder(obj) {
+        return this.check(obj, "SoftDeleteQueryBuilder");
+    }
+    static isRelationQueryBuilder(obj) {
+        return this.check(obj, "RelationQueryBuilder");
+    }
+    static isBrackets(obj) {
+        return this.check(obj, "Brackets") || this.check(obj, "NotBrackets");
+    }
+    static isNotBrackets(obj) {
+        return this.check(obj, "NotBrackets");
+    }
+    static isSubject(obj) {
+        return this.check(obj, "Subject");
+    }
+    static isRdbmsSchemaBuilder(obj) {
+        return this.check(obj, "RdbmsSchemaBuilder");
+    }
+    static isMongoEntityManager(obj) {
+        return this.check(obj, "MongoEntityManager");
+    }
+    static isSqljsEntityManager(obj) {
+        return this.check(obj, "SqljsEntityManager");
+    }
+    static isEntitySchema(obj) {
+        return this.check(obj, "EntitySchema");
+    }
+    static isBaseEntityConstructor(obj) {
+        return (typeof obj === "function" &&
+            typeof obj.hasId === "function" &&
+            typeof obj.save === "function" &&
+            typeof obj.useDataSource === "function");
+    }
+    static isFindOperator(obj) {
+        return (this.check(obj, "FindOperator") || this.check(obj, "EqualOperator"));
+    }
+    static isEqualOperator(obj) {
+        return this.check(obj, "EqualOperator");
+    }
+    static isQuery(obj) {
+        return this.check(obj, "Query");
+    }
+    static isTable(obj) {
+        return this.check(obj, "Table");
+    }
+    static isTableCheck(obj) {
+        return this.check(obj, "TableCheck");
+    }
+    static isTableColumn(obj) {
+        return this.check(obj, "TableColumn");
+    }
+    static isTableExclusion(obj) {
+        return this.check(obj, "TableExclusion");
+    }
+    static isTableForeignKey(obj) {
+        return this.check(obj, "TableForeignKey");
+    }
+    static isTableIndex(obj) {
+        return this.check(obj, "TableIndex");
+    }
+    static isTableUnique(obj) {
+        return this.check(obj, "TableUnique");
+    }
+    static isView(obj) {
+        return this.check(obj, "View");
+    }
+    static isDataSource(obj) {
+        return this.check(obj, "DataSource");
+    }
+    static check(obj, name) {
+        return (typeof obj === "object" &&
+            obj !== null &&
+            obj["@instanceof"] ===
+                Symbol.for(name));
+    }
+}
+exports.InstanceChecker = InstanceChecker;
+//# sourceMappingURL=InstanceChecker.js.map