typeorm 0.3.0-rc.9 → 0.3.0

package/browser/util/DepGraph.js

@@ -6,6 +6,7 @@
 /**
  * A simple dependency graph
  */
+import { TypeORMError } from "../error";
 /**
  * Helper for creating a Depth-First-Search on
  * a set of edges.
@@ -17,8 +18,8 @@
  * @param result An array in which the results will be populated
  */
 function createDFS(edges, leavesOnly, result) {
-    var currentPath = [];
-    var visited = {};
+    let currentPath = [];
+    let visited = {};
     return function DFS(currentNode) {
         visited[currentNode] = true;
         currentPath.push(currentNode);
@@ -28,17 +29,18 @@ function createDFS(edges, leavesOnly, result) {
             }
             else if (currentPath.indexOf(node) >= 0) {
                 currentPath.push(node);
-                throw new Error("Dependency Cycle Found: " + currentPath.join(" -> "));
+                throw new TypeORMError(`Dependency Cycle Found: ${currentPath.join(" -> ")}`);
             }
         });
         currentPath.pop();
-        if ((!leavesOnly || edges[currentNode].length === 0) && result.indexOf(currentNode) === -1) {
+        if ((!leavesOnly || edges[currentNode].length === 0) &&
+            result.indexOf(currentNode) === -1) {
             result.push(currentNode);
         }
     };
 }
-var DepGraph = /** @class */ (function () {
-    function DepGraph() {
+export class DepGraph {
+    constructor() {
         this.nodes = {};
         this.outgoingEdges = {}; // Node -> [Dependency Node]
         this.incomingEdges = {}; // Node -> [Dependant Node]
@@ -46,7 +48,7 @@ var DepGraph = /** @class */ (function () {
     /**
      * Add a node to the dependency graph. If a node already exists, this method will do nothing.
      */
-    DepGraph.prototype.addNode = function (node, 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) {
@@ -58,63 +60,63 @@ var DepGraph = /** @class */ (function () {
             this.outgoingEdges[node] = [];
             this.incomingEdges[node] = [];
         }
-    };
+    }
     /**
      * Remove a node from the dependency graph. If a node does not exist, this method will do nothing.
      */
-    DepGraph.prototype.removeNode = function (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) {
-                    var idx = edgeList[key].indexOf(node);
+                    let idx = edgeList[key].indexOf(node);
                     if (idx >= 0) {
                         edgeList[key].splice(idx, 1);
                     }
                 }, this);
             });
         }
-    };
+    }
     /**
      * Check if a node exists in the graph
      */
-    DepGraph.prototype.hasNode = function (node) {
+    hasNode(node) {
         return this.nodes.hasOwnProperty(node);
-    };
+    }
     /**
      * Get the data associated with a node name
      */
-    DepGraph.prototype.getNodeData = function (node) {
+    getNodeData(node) {
         if (this.hasNode(node)) {
             return this.nodes[node];
         }
         else {
-            throw new Error("Node does not exist: " + node);
+            throw new 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
      */
-    DepGraph.prototype.setNodeData = function (node, data) {
+    setNodeData(node, data) {
         if (this.hasNode(node)) {
             this.nodes[node] = data;
         }
         else {
-            throw new Error("Node does not exist: " + node);
+            throw new 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.
      */
-    DepGraph.prototype.addDependency = function (from, to) {
+    addDependency(from, to) {
         if (!this.hasNode(from)) {
-            throw new Error("Node does not exist: " + from);
+            throw new TypeORMError(`Node does not exist: ${from}`);
         }
         if (!this.hasNode(to)) {
-            throw new Error("Node does not exist: " + to);
+            throw new TypeORMError(`Node does not exist: ${to}`);
         }
         if (this.outgoingEdges[from].indexOf(to) === -1) {
             this.outgoingEdges[from].push(to);
@@ -123,12 +125,12 @@ var DepGraph = /** @class */ (function () {
             this.incomingEdges[to].push(from);
         }
         return true;
-    };
+    }
     /**
      * Remove a dependency between two nodes.
      */
-    DepGraph.prototype.removeDependency = function (from, to) {
-        var idx;
+    removeDependency(from, to) {
+        let idx;
         if (this.hasNode(from)) {
             idx = this.outgoingEdges[from].indexOf(to);
             if (idx >= 0) {
@@ -141,7 +143,7 @@ var DepGraph = /** @class */ (function () {
                 this.incomingEdges[to].splice(idx, 1);
             }
         }
-    };
+    }
     /**
      * Get an array containing the nodes that the specified node depends on (transitively).
      *
@@ -150,21 +152,21 @@ var DepGraph = /** @class */ (function () {
      * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned
      * in the array.
      */
-    DepGraph.prototype.dependenciesOf = function (node, leavesOnly) {
+    dependenciesOf(node, leavesOnly) {
         if (this.hasNode(node)) {
-            var result = [];
-            var DFS = createDFS(this.outgoingEdges, leavesOnly, result);
+            let result = [];
+            let DFS = createDFS(this.outgoingEdges, leavesOnly, result);
             DFS(node);
-            var idx = result.indexOf(node);
+            let idx = result.indexOf(node);
             if (idx >= 0) {
                 result.splice(idx, 1);
             }
             return result;
         }
         else {
-            throw new Error("Node does not exist: " + node);
+            throw new TypeORMError(`Node does not exist: ${node}`);
         }
-    };
+    }
     /**
      * get an array containing the nodes that depend on the specified node (transitively).
      *
@@ -172,21 +174,21 @@ var DepGraph = /** @class */ (function () {
      *
      * If `leavesOnly` is true, only nodes that do not have any dependants will be returned in the array.
      */
-    DepGraph.prototype.dependantsOf = function (node, leavesOnly) {
+    dependantsOf(node, leavesOnly) {
         if (this.hasNode(node)) {
-            var result = [];
-            var DFS = createDFS(this.incomingEdges, leavesOnly, result);
+            let result = [];
+            let DFS = createDFS(this.incomingEdges, leavesOnly, result);
             DFS(node);
-            var idx = result.indexOf(node);
+            let idx = result.indexOf(node);
             if (idx >= 0) {
                 result.splice(idx, 1);
             }
             return result;
         }
         else {
-            throw new Error("Node does not exist: " + node);
+            throw new TypeORMError(`Node does not exist: ${node}`);
         }
-    };
+    }
     /**
      * Construct the overall processing order for the dependency graph.
      *
@@ -194,33 +196,31 @@ var DepGraph = /** @class */ (function () {
      *
      * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned.
      */
-    DepGraph.prototype.overallOrder = function (leavesOnly) {
-        var self = this;
-        var result = [];
-        var keys = Object.keys(this.nodes);
+    overallOrder(leavesOnly) {
+        let self = this;
+        let result = [];
+        let 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.
-            var CycleDFS_1 = createDFS(this.outgoingEdges, false, []);
+            let CycleDFS = createDFS(this.outgoingEdges, false, []);
             keys.forEach(function (n) {
-                CycleDFS_1(n);
+                CycleDFS(n);
             });
-            var DFS_1 = createDFS(this.outgoingEdges, leavesOnly, result);
+            let 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_1(n);
+                DFS(n);
             });
             return result;
         }
-    };
-    return DepGraph;
-}());
-export { DepGraph };
+    }
+}
 
 //# sourceMappingURL=DepGraph.js.map

package/browser/util/DepGraph.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../browser/src/util/DepGraph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AAEH;;;;;;;;;GASG;AACH,SAAS,SAAS,CAAC,KAAU,EAAE,UAAe,EAAE,MAAW;IACvD,IAAI,WAAW,GAAU,EAAE,CAAC;IAC5B,IAAI,OAAO,GAAQ,EAAE,CAAC;IACtB,OAAO,SAAS,GAAG,CAAC,WAAgB;QAChC,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;QAC5B,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC9B,KAAK,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,UAAU,IAAS;YAC1C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAChB,GAAG,CAAC,IAAI,CAAC,CAAC;aACb;iBAAM,IAAI,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBACvC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,6BAA2B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAG,CAAC,CAAC;aAC1E;QACL,CAAC,CAAC,CAAC;QACH,WAAW,CAAC,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,CAAC,UAAU,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE;YACxF,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC5B;IACL,CAAC,CAAC;AACN,CAAC;AAGD;IAAA;QACI,UAAK,GAAQ,EAAE,CAAC;QAChB,kBAAa,GAAQ,EAAE,CAAC,CAAC,4BAA4B;QACrD,kBAAa,GAAQ,EAAE,CAAC,CAAC,2BAA2B;IA0LxD,CAAC;IAxLG;;OAEG;IACH,0BAAO,GAAP,UAAQ,IAAS,EAAE,IAAU;QACzB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACrB,kFAAkF;YAClF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;gBACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;aAC3B;iBAAM;gBACH,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;aAC3B;YACD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YAC9B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;SACjC;IACL,CAAC;IAED;;OAEG;IACH,6BAAU,GAAV,UAAW,IAAS;QAChB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YAChC,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,UAAU,QAAQ;gBAC/D,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,UAAU,GAAQ;oBAC5C,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBACtC,IAAI,GAAG,IAAI,CAAC,EAAE;wBACV,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;qBAChC;gBACL,CAAC,EAAE,IAAI,CAAC,CAAC;YACb,CAAC,CAAC,CAAC;SACN;IACL,CAAC;IAED;;OAEG;IACH,0BAAO,GAAP,UAAQ,IAAS;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,8BAAW,GAAX,UAAY,IAAS;QACjB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;SAC3B;aAAM;YACH,MAAM,IAAI,KAAK,CAAC,0BAAwB,IAAM,CAAC,CAAC;SACnD;IACL,CAAC;IAED;;OAEG;IACH,8BAAW,GAAX,UAAY,IAAS,EAAE,IAAS;QAC5B,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;SAC3B;aAAM;YACH,MAAM,IAAI,KAAK,CAAC,0BAAwB,IAAM,CAAC,CAAC;SACnD;IACL,CAAC;IAED;;;OAGG;IACH,gCAAa,GAAb,UAAc,IAAS,EAAE,EAAO;QAC5B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACrB,MAAM,IAAI,KAAK,CAAC,0BAAwB,IAAM,CAAC,CAAC;SACnD;QACD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACnB,MAAM,IAAI,KAAK,CAAC,0BAAwB,EAAI,CAAC,CAAC;SACjD;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE;YAC7C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACrC;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;YAC7C,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACrC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,mCAAgB,GAAhB,UAAiB,IAAS,EAAE,EAAO;QAC/B,IAAI,GAAQ,CAAC;QACb,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC3C,IAAI,GAAG,IAAI,CAAC,EAAE;gBACV,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;aAC3C;SACJ;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YAClB,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,GAAG,IAAI,CAAC,EAAE;gBACV,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;aACzC;SACJ;IACL,CAAC;IAED;;;;;;;OAOG;IACH,iCAAc,GAAd,UAAe,IAAS,EAAE,UAAe;QACrC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,MAAM,GAAU,EAAE,CAAC;YACvB,IAAI,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;YAC5D,GAAG,CAAC,IAAI,CAAC,CAAC;YACV,IAAI,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,GAAG,IAAI,CAAC,EAAE;gBACV,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;aACzB;YACD,OAAO,MAAM,CAAC;SACjB;aACI;YACD,MAAM,IAAI,KAAK,CAAC,0BAAwB,IAAM,CAAC,CAAC;SACnD;IACL,CAAC;IAED;;;;;;OAMG;IACH,+BAAY,GAAZ,UAAa,IAAS,EAAE,UAAe;QACnC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,MAAM,GAAU,EAAE,CAAC;YACvB,IAAI,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;YAC5D,GAAG,CAAC,IAAI,CAAC,CAAC;YACV,IAAI,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,GAAG,IAAI,CAAC,EAAE;gBACV,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;aACzB;YACD,OAAO,MAAM,CAAC;SACjB;aAAM;YACH,MAAM,IAAI,KAAK,CAAC,0BAAwB,IAAM,CAAC,CAAC;SACnD;IACL,CAAC;IAED;;;;;;OAMG;IACH,+BAAY,GAAZ,UAAa,UAAgB;QACzB,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,IAAI,MAAM,GAAU,EAAE,CAAC;QACvB,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACnB,OAAO,MAAM,CAAC,CAAC,cAAc;SAChC;aAAM;YACH,2EAA2E;YAC3E,mEAAmE;YACnE,IAAI,UAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACxD,IAAI,CAAC,OAAO,CAAC,UAAU,CAAM;gBACzB,UAAQ,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC,CAAC,CAAC;YAEH,IAAI,KAAG,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;YAC5D,+EAA+E;YAC/E,sDAAsD;YACtD,IAAI,CAAC,MAAM,CAAC,UAAU,IAAI;gBACtB,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;YACjD,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;gBAClB,KAAG,CAAC,CAAC,CAAC,CAAC;YACX,CAAC,CAAC,CAAC;YAEH,OAAO,MAAM,CAAC;SACjB;IACL,CAAC;IAEL,eAAC;AAAD,CA7LA,AA6LC,IAAA","file":"DepGraph.js","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\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    let currentPath: any[] = [];\n    let 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 Error(`Dependency Cycle Found: ${currentPath.join(\" -> \")}`);\n            }\n        });\n        currentPath.pop();\n        if ((!leavesOnly || edges[currentNode].length === 0) && result.indexOf(currentNode) === -1) {\n            result.push(currentNode);\n        }\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    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    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(function (edgeList) {\n                Object.keys(edgeList).forEach(function (key: any) {\n                    let idx = edgeList[key].indexOf(node);\n                    if (idx >= 0) {\n                        edgeList[key].splice(idx, 1);\n                    }\n                }, this);\n            });\n        }\n    }\n\n    /**\n     * Check if a node exists in the graph\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    getNodeData(node: any) {\n        if (this.hasNode(node)) {\n            return this.nodes[node];\n        } else {\n            throw new Error(`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    setNodeData(node: any, data: any) {\n        if (this.hasNode(node)) {\n            this.nodes[node] = data;\n        } else {\n            throw new Error(`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    addDependency(from: any, to: any) {\n        if (!this.hasNode(from)) {\n            throw new Error(`Node does not exist: ${from}`);\n        }\n        if (!this.hasNode(to)) {\n            throw new Error(`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    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    dependenciesOf(node: any, leavesOnly: any) {\n        if (this.hasNode(node)) {\n            let result: any[] = [];\n            let DFS = createDFS(this.outgoingEdges, leavesOnly, result);\n            DFS(node);\n            let idx = result.indexOf(node);\n            if (idx >= 0) {\n                result.splice(idx, 1);\n            }\n            return result;\n        }\n        else {\n            throw new Error(`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    dependantsOf(node: any, leavesOnly: any) {\n        if (this.hasNode(node)) {\n            let result: any[] = [];\n            let DFS = createDFS(this.incomingEdges, leavesOnly, result);\n            DFS(node);\n            let idx = result.indexOf(node);\n            if (idx >= 0) {\n                result.splice(idx, 1);\n            }\n            return result;\n        } else {\n            throw new Error(`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    overallOrder(leavesOnly?: any) {\n        let self = this;\n        let result: any[] = [];\n        let 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            let CycleDFS = createDFS(this.outgoingEdges, false, []);\n            keys.forEach(function (n: any) {\n                CycleDFS(n);\n            });\n\n            let 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}"],"sourceRoot":".."}
+{"version":3,"sources":["../browser/src/util/DepGraph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAA;AAEvC;;;;;;;;;GASG;AACH,SAAS,SAAS,CAAC,KAAU,EAAE,UAAe,EAAE,MAAW;IACvD,IAAI,WAAW,GAAU,EAAE,CAAA;IAC3B,IAAI,OAAO,GAAQ,EAAE,CAAA;IACrB,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;gBAChB,GAAG,CAAC,IAAI,CAAC,CAAA;aACZ;iBAAM,IAAI,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBACvC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACtB,MAAM,IAAI,YAAY,CAClB,2BAA2B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CACxD,CAAA;aACJ;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;YACE,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;SAC3B;IACL,CAAC,CAAA;AACL,CAAC;AAED,MAAM,OAAO,QAAQ;IAArB;QACI,UAAK,GAAQ,EAAE,CAAA;QACf,kBAAa,GAAQ,EAAE,CAAA,CAAC,4BAA4B;QACpD,kBAAa,GAAQ,EAAE,CAAA,CAAC,2BAA2B;IA0LvD,CAAC;IAxLG;;OAEG;IACH,OAAO,CAAC,IAAS,EAAE,IAAU;QACzB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACrB,kFAAkF;YAClF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;gBACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;aAC1B;iBAAM;gBACH,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;aAC1B;YACD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;YAC7B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;SAChC;IACL,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,IAAS;QAChB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,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,CAAC,UAC9C,QAAQ;gBAER,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,UAAU,GAAQ;oBAC5C,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;oBACrC,IAAI,GAAG,IAAI,CAAC,EAAE;wBACV,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;qBAC/B;gBACL,CAAC,EAAE,IAAI,CAAC,CAAA;YACZ,CAAC,CAAC,CAAA;SACL;IACL,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAS;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;IAC1C,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,IAAS;QACjB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;SAC1B;aAAM;YACH,MAAM,IAAI,YAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;SACzD;IACL,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,IAAS,EAAE,IAAS;QAC5B,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;SAC1B;aAAM;YACH,MAAM,IAAI,YAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;SACzD;IACL,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,IAAS,EAAE,EAAO;QAC5B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACrB,MAAM,IAAI,YAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;SACzD;QACD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACnB,MAAM,IAAI,YAAY,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAA;SACvD;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE;YAC7C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;SACpC;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;YAC7C,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;SACpC;QACD,OAAO,IAAI,CAAA;IACf,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,IAAS,EAAE,EAAO;QAC/B,IAAI,GAAQ,CAAA;QACZ,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;YAC1C,IAAI,GAAG,IAAI,CAAC,EAAE;gBACV,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;aAC1C;SACJ;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YAClB,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAC1C,IAAI,GAAG,IAAI,CAAC,EAAE;gBACV,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;aACxC;SACJ;IACL,CAAC;IAED;;;;;;;OAOG;IACH,cAAc,CAAC,IAAS,EAAE,UAAe;QACrC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,MAAM,GAAU,EAAE,CAAA;YACtB,IAAI,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,MAAM,CAAC,CAAA;YAC3D,GAAG,CAAC,IAAI,CAAC,CAAA;YACT,IAAI,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAC9B,IAAI,GAAG,IAAI,CAAC,EAAE;gBACV,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;aACxB;YACD,OAAO,MAAM,CAAA;SAChB;aAAM;YACH,MAAM,IAAI,YAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;SACzD;IACL,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,IAAS,EAAE,UAAe;QACnC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,MAAM,GAAU,EAAE,CAAA;YACtB,IAAI,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,MAAM,CAAC,CAAA;YAC3D,GAAG,CAAC,IAAI,CAAC,CAAA;YACT,IAAI,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAC9B,IAAI,GAAG,IAAI,CAAC,EAAE;gBACV,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;aACxB;YACD,OAAO,MAAM,CAAA;SAChB;aAAM;YACH,MAAM,IAAI,YAAY,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAA;SACzD;IACL,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,UAAgB;QACzB,IAAI,IAAI,GAAG,IAAI,CAAA;QACf,IAAI,MAAM,GAAU,EAAE,CAAA;QACtB,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAClC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACnB,OAAO,MAAM,CAAA,CAAC,cAAc;SAC/B;aAAM;YACH,2EAA2E;YAC3E,mEAAmE;YACnE,IAAI,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,EAAE,EAAE,CAAC,CAAA;YACvD,IAAI,CAAC,OAAO,CAAC,UAAU,CAAM;gBACzB,QAAQ,CAAC,CAAC,CAAC,CAAA;YACf,CAAC,CAAC,CAAA;YAEF,IAAI,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,MAAM,CAAC,CAAA;YAC3D,+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;SAChB;IACL,CAAC;CACJ","file":"DepGraph.js","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    let currentPath: any[] = []\n    let 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    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    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(function (\n                edgeList,\n            ) {\n                Object.keys(edgeList).forEach(function (key: any) {\n                    let idx = edgeList[key].indexOf(node)\n                    if (idx >= 0) {\n                        edgeList[key].splice(idx, 1)\n                    }\n                }, this)\n            })\n        }\n    }\n\n    /**\n     * Check if a node exists in the graph\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    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    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    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    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    dependenciesOf(node: any, leavesOnly: any) {\n        if (this.hasNode(node)) {\n            let result: any[] = []\n            let DFS = createDFS(this.outgoingEdges, leavesOnly, result)\n            DFS(node)\n            let 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    dependantsOf(node: any, leavesOnly: any) {\n        if (this.hasNode(node)) {\n            let result: any[] = []\n            let DFS = createDFS(this.incomingEdges, leavesOnly, result)\n            DFS(node)\n            let 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    overallOrder(leavesOnly?: any) {\n        let self = this\n        let result: any[] = []\n        let 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            let CycleDFS = createDFS(this.outgoingEdges, false, [])\n            keys.forEach(function (n: any) {\n                CycleDFS(n)\n            })\n\n            let 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"],"sourceRoot":".."}

package/browser/util/DirectoryExportedClassesLoader.d.ts

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

package/browser/util/DirectoryExportedClassesLoader.js

@@ -1,53 +1,60 @@
+import glob from "glob";
 import { PlatformTools } from "../platform/PlatformTools";
-import { EntitySchema } from "../index";
+import { importOrRequireFile } from "./ImportUtils";
+import { ObjectUtils } from "./ObjectUtils";
+import { InstanceChecker } from "./InstanceChecker";
 /**
  * Loads all exported classes from the given directory.
  */
-export function importClassesFromDirectories(logger, directories, formats) {
-    if (formats === void 0) { formats = [".js", ".ts"]; }
-    var logLevel = "info";
-    var classesNotFoundMessage = "No classes were found using the provided glob pattern: ";
-    var classesFoundMessage = "All classes found using provided glob pattern";
+export 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";
     function loadFileClasses(exported, allLoaded) {
-        if (typeof exported === "function" || exported instanceof EntitySchema) {
+        if (typeof exported === "function" ||
+            InstanceChecker.isEntitySchema(exported)) {
             allLoaded.push(exported);
         }
         else if (Array.isArray(exported)) {
-            exported.forEach(function (i) { return loadFileClasses(i, allLoaded); });
+            exported.forEach((i) => loadFileClasses(i, allLoaded));
         }
-        else if (typeof exported === "object" && exported !== null) {
-            Object.keys(exported).forEach(function (key) { return loadFileClasses(exported[key], allLoaded); });
+        else if (ObjectUtils.isObject(exported)) {
+            Object.keys(exported).forEach((key) => loadFileClasses(exported[key], allLoaded));
         }
         return allLoaded;
     }
-    var allFiles = directories.reduce(function (allDirs, dir) {
-        return allDirs.concat(PlatformTools.load("glob").sync(PlatformTools.pathNormalize(dir)));
+    const allFiles = directories.reduce((allDirs, dir) => {
+        return allDirs.concat(glob.sync(PlatformTools.pathNormalize(dir)));
     }, []);
     if (directories.length > 0 && allFiles.length === 0) {
-        logger.log(logLevel, classesNotFoundMessage + " \"" + directories + "\"");
+        logger.log(logLevel, `${classesNotFoundMessage} "${directories}"`);
     }
     else if (allFiles.length > 0) {
-        logger.log(logLevel, classesFoundMessage + " \"" + directories + "\" : \"" + allFiles + "\"");
+        logger.log(logLevel, `${classesFoundMessage} "${directories}" : "${allFiles}"`);
     }
-    var dirs = allFiles
-        .filter(function (file) {
-        var dtsExtension = file.substring(file.length - 5, file.length);
-        return formats.indexOf(PlatformTools.pathExtname(file)) !== -1 && dtsExtension !== ".d.ts";
+    const dirPromises = allFiles
+        .filter((file) => {
+        const dtsExtension = file.substring(file.length - 5, file.length);
+        return (formats.indexOf(PlatformTools.pathExtname(file)) !== -1 &&
+            dtsExtension !== ".d.ts");
     })
-        .map(function (file) { return PlatformTools.load(PlatformTools.pathResolve(file)); });
+        .map(async (file) => {
+        const [importOrRequireResult] = await importOrRequireFile(PlatformTools.pathResolve(file));
+        return importOrRequireResult;
+    });
+    const dirs = await Promise.all(dirPromises);
     return loadFileClasses(dirs, []);
 }
 /**
  * Loads all json files from the given directory.
  */
-export function importJsonsFromDirectories(directories, format) {
-    if (format === void 0) { format = ".json"; }
-    var allFiles = directories.reduce(function (allDirs, dir) {
-        return allDirs.concat(PlatformTools.load("glob").sync(PlatformTools.pathNormalize(dir)));
+export function importJsonsFromDirectories(directories, format = ".json") {
+    const allFiles = directories.reduce((allDirs, dir) => {
+        return allDirs.concat(glob.sync(PlatformTools.pathNormalize(dir)));
     }, []);
     return allFiles
-        .filter(function (file) { return PlatformTools.pathExtname(file) === format; })
-        .map(function (file) { return PlatformTools.load(PlatformTools.pathResolve(file)); });
+        .filter((file) => PlatformTools.pathExtname(file) === format)
+        .map((file) => require(PlatformTools.pathResolve(file)));
 }
 
 //# sourceMappingURL=DirectoryExportedClassesLoader.js.map

package/browser/util/DirectoryExportedClassesLoader.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../browser/src/util/DirectoryExportedClassesLoader.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,aAAa,EAAC,MAAM,2BAA2B,CAAC;AACxD,OAAO,EAAC,YAAY,EAAC,MAAM,UAAU,CAAC;AAEtC;;GAEG;AACH,MAAM,UAAU,4BAA4B,CAAC,MAAc,EAAE,WAAqB,EAAE,OAAwB;IAAxB,wBAAA,EAAA,WAAW,KAAK,EAAE,KAAK,CAAC;IAExG,IAAM,QAAQ,GAAG,MAAM,CAAC;IACxB,IAAM,sBAAsB,GAAG,yDAAyD,CAAC;IACzF,IAAM,mBAAmB,GAAG,+CAA+C,CAAC;IAC5E,SAAS,eAAe,CAAC,QAAa,EAAE,SAAqB;QACzD,IAAI,OAAO,QAAQ,KAAK,UAAU,IAAI,QAAQ,YAAY,YAAY,EAAE;YACpE,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SAE5B;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;YAChC,QAAQ,CAAC,OAAO,CAAC,UAAC,CAAM,IAAK,OAAA,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,EAA7B,CAA6B,CAAC,CAAC;SAE/D;aAAM,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,IAAI,EAAE;YAC1D,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,UAAA,GAAG,IAAI,OAAA,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,EAAzC,CAAyC,CAAC,CAAC;SAEnF;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,IAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,UAAC,OAAO,EAAE,GAAG;QAC7C,OAAO,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7F,CAAC,EAAE,EAAc,CAAC,CAAC;IAEnB,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;QACjD,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAK,sBAAsB,WAAK,WAAW,OAAG,CAAC,CAAC;KACtE;SAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;QAC5B,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAK,mBAAmB,WAAK,WAAW,eAAQ,QAAQ,OAAG,CAAC,CAAC;KACnF;IACD,IAAM,IAAI,GAAG,QAAQ;SAChB,MAAM,CAAC,UAAA,IAAI;QACR,IAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAClE,OAAO,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,YAAY,KAAK,OAAO,CAAC;IAC/F,CAAC,CAAC;SACD,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAnD,CAAmD,CAAC,CAAC;IAEtE,OAAO,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,0BAA0B,CAAC,WAAqB,EAAE,MAAgB;IAAhB,uBAAA,EAAA,gBAAgB;IAE9E,IAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,UAAC,OAAO,EAAE,GAAG;QAC7C,OAAO,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7F,CAAC,EAAE,EAAc,CAAC,CAAC;IAEnB,OAAO,QAAQ;SACV,MAAM,CAAC,UAAA,IAAI,IAAI,OAAA,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,MAAM,EAA1C,CAA0C,CAAC;SAC1D,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAnD,CAAmD,CAAC,CAAC;AAC1E,CAAC","file":"DirectoryExportedClassesLoader.js","sourcesContent":["import {PlatformTools} from \"../platform/PlatformTools\";\nimport {EntitySchema} from \"../index\";\nimport {Logger} from \"../logger/Logger\";\n/**\n * Loads all exported classes from the given directory.\n */\nexport function importClassesFromDirectories(logger: Logger, directories: string[], formats = [\".js\", \".ts\"]): Function[] {\n\n    const logLevel = \"info\";\n    const classesNotFoundMessage = \"No classes were found using the provided glob pattern: \";\n    const classesFoundMessage = \"All classes found using provided glob pattern\";\n    function loadFileClasses(exported: any, allLoaded: Function[]) {\n        if (typeof exported === \"function\" || exported instanceof EntitySchema) {\n            allLoaded.push(exported);\n\n        } else if (Array.isArray(exported)) {\n            exported.forEach((i: any) => loadFileClasses(i, allLoaded));\n\n        } else if (typeof exported === \"object\" && exported !== null) {\n            Object.keys(exported).forEach(key => loadFileClasses(exported[key], allLoaded));\n\n        }\n        return allLoaded;\n    }\n\n    const allFiles = directories.reduce((allDirs, dir) => {\n        return allDirs.concat(PlatformTools.load(\"glob\").sync(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(logLevel, `${classesFoundMessage} \"${directories}\" : \"${allFiles}\"`);\n    }\n    const dirs = allFiles\n        .filter(file => {\n            const dtsExtension = file.substring(file.length - 5, file.length);\n            return formats.indexOf(PlatformTools.pathExtname(file)) !== -1 && dtsExtension !== \".d.ts\";\n        })\n        .map(file => PlatformTools.load(PlatformTools.pathResolve(file)));\n\n    return loadFileClasses(dirs, []);\n}\n\n/**\n * Loads all json files from the given directory.\n */\nexport function importJsonsFromDirectories(directories: string[], format = \".json\"): any[] {\n\n    const allFiles = directories.reduce((allDirs, dir) => {\n        return allDirs.concat(PlatformTools.load(\"glob\").sync(PlatformTools.pathNormalize(dir)));\n    }, [] as string[]);\n\n    return allFiles\n        .filter(file => PlatformTools.pathExtname(file) === format)\n        .map(file => PlatformTools.load(PlatformTools.pathResolve(file)));\n}"],"sourceRoot":".."}
+{"version":3,"sources":["../browser/src/util/DirectoryExportedClassesLoader.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,MAAM,CAAA;AACvB,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAA;AAEzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAA;AACnD,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAA;AAC3C,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAA;AAEnD;;GAEG;AACH,MAAM,CAAC,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,SAAS,eAAe,CAAC,QAAa,EAAE,SAAqB;QACzD,IACI,OAAO,QAAQ,KAAK,UAAU;YAC9B,eAAe,CAAC,cAAc,CAAC,QAAQ,CAAC,EAC1C;YACE,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;SAC3B;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;YAChC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAA;SAC9D;aAAM,IAAI,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;YACvC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAClC,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAC5C,CAAA;SACJ;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,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACtE,CAAC,EAAE,EAAc,CAAC,CAAA;IAElB,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;QACjD,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,sBAAsB,KAAK,WAAW,GAAG,CAAC,CAAA;KACrE;SAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;QAC5B,MAAM,CAAC,GAAG,CACN,QAAQ,EACR,GAAG,mBAAmB,KAAK,WAAW,QAAQ,QAAQ,GAAG,CAC5D,CAAA;KACJ;IACD,MAAM,WAAW,GAAG,QAAQ;SACvB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACb,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;QACjE,OAAO,CACH,OAAO,CAAC,OAAO,CAAC,aAAa,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,mBAAmB,CACrD,aAAa,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;AAED;;GAEG;AACH,MAAM,UAAU,0BAA0B,CACtC,WAAqB,EACrB,MAAM,GAAG,OAAO;IAEhB,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;QACjD,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACtE,CAAC,EAAE,EAAc,CAAC,CAAA;IAElB,OAAO,QAAQ;SACV,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,MAAM,CAAC;SAC5D,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AAChE,CAAC","file":"DirectoryExportedClassesLoader.js","sourcesContent":["import glob from \"glob\"\nimport { PlatformTools } from \"../platform/PlatformTools\"\nimport { Logger } from \"../logger/Logger\"\nimport { importOrRequireFile } from \"./ImportUtils\"\nimport { ObjectUtils } from \"./ObjectUtils\"\nimport { InstanceChecker } from \"./InstanceChecker\"\n\n/**\n * Loads all exported classes from the given directory.\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    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((i: any) => loadFileClasses(i, allLoaded))\n        } else if (ObjectUtils.isObject(exported)) {\n            Object.keys(exported).forEach((key) =>\n                loadFileClasses(exported[key], allLoaded),\n            )\n        }\n        return allLoaded\n    }\n\n    const allFiles = directories.reduce((allDirs, dir) => {\n        return allDirs.concat(glob.sync(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.substring(file.length - 5, file.length)\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\n/**\n * Loads all json files from the given directory.\n */\nexport function importJsonsFromDirectories(\n    directories: string[],\n    format = \".json\",\n): any[] {\n    const allFiles = directories.reduce((allDirs, dir) => {\n        return allDirs.concat(glob.sync(PlatformTools.pathNormalize(dir)))\n    }, [] as string[])\n\n    return allFiles\n        .filter((file) => PlatformTools.pathExtname(file) === format)\n        .map((file) => require(PlatformTools.pathResolve(file)))\n}\n"],"sourceRoot":".."}

package/browser/util/ImportUtils.d.ts

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

package/browser/util/ImportUtils.js

@@ -0,0 +1,74 @@
+import fs from "fs";
+import path from "path";
+import { pathToFileURL } from "url";
+export 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 [
+            await Function("return filePath => import(filePath)")()(filePath.startsWith("file://")
+                ? filePath
+                : pathToFileURL(filePath).toString()),
+            "esm",
+        ];
+    };
+    const tryToRequire = async () => {
+        return [require(filePath), "commonjs"];
+    };
+    const extension = filePath.substring(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 === null || packageJson === void 0 ? void 0 : packageJson.type) === "module";
+            if (isModule)
+                return tryToImport();
+            else
+                return tryToRequire();
+        }
+        else
+            return tryToRequire();
+    }
+    return tryToRequire();
+}
+function getNearestPackageJson(filePath) {
+    return new Promise((accept) => {
+        let currentPath = filePath;
+        function searchPackageJson() {
+            const nextPath = path.dirname(currentPath);
+            if (currentPath === nextPath)
+                // the top of the file tree is reached
+                accept(null);
+            else {
+                currentPath = nextPath;
+                const potentialPackageJson = path.join(currentPath, "package.json");
+                fs.stat(potentialPackageJson, (err, stats) => {
+                    if (err != null)
+                        searchPackageJson();
+                    else if (stats.isFile()) {
+                        fs.readFile(potentialPackageJson, "utf8", (err, data) => {
+                            if (err != null)
+                                accept(null);
+                            else {
+                                try {
+                                    accept(JSON.parse(data));
+                                }
+                                catch (err) {
+                                    accept(null);
+                                }
+                            }
+                        });
+                    }
+                    else
+                        searchPackageJson();
+                });
+            }
+        }
+        searchPackageJson();
+    });
+}
+
+//# sourceMappingURL=ImportUtils.js.map

package/browser/util/ImportUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../browser/src/util/ImportUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,IAAI,CAAA;AACnB,OAAO,IAAI,MAAM,MAAM,CAAA;AACvB,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAA;AAEnC,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACrC,QAAgB;IAEhB,MAAM,WAAW,GAAG,KAAK,IAA2B,EAAE;QAClD,qFAAqF;QACrF,oDAAoD;QACpD,OAAO;YACH,MAAM,QAAQ,CAAC,qCAAqC,CAAC,EAAE,CACnD,QAAQ,CAAC,UAAU,CAAC,SAAS,CAAC;gBAC1B,CAAC,CAAC,QAAQ;gBACV,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAC3C;YACD,KAAK;SACR,CAAA;IACL,CAAC,CAAA;IACD,MAAM,YAAY,GAAG,KAAK,IAAgC,EAAE;QACxD,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC,CAAA;IAC1C,CAAC,CAAA;IAED,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAA;IAE5E,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;QAC/C,MAAM,WAAW,GAAG,MAAM,qBAAqB,CAAC,QAAQ,CAAC,CAAA;QAEzD,IAAI,WAAW,IAAI,IAAI,EAAE;YACrB,MAAM,QAAQ,GAAG,CAAC,WAAmB,aAAnB,WAAW,uBAAX,WAAW,CAAU,IAAI,MAAK,QAAQ,CAAA;YAExD,IAAI,QAAQ;gBAAE,OAAO,WAAW,EAAE,CAAA;;gBAC7B,OAAO,YAAY,EAAE,CAAA;SAC7B;;YAAM,OAAO,YAAY,EAAE,CAAA;KAC/B;IAED,OAAO,YAAY,EAAE,CAAA;AACzB,CAAC;AAED,SAAS,qBAAqB,CAAC,QAAgB;IAC3C,OAAO,IAAI,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;QAC1B,IAAI,WAAW,GAAG,QAAQ,CAAA;QAE1B,SAAS,iBAAiB;YACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;YAE1C,IAAI,WAAW,KAAK,QAAQ;gBACxB,sCAAsC;gBACtC,MAAM,CAAC,IAAI,CAAC,CAAA;iBACX;gBACD,WAAW,GAAG,QAAQ,CAAA;gBACtB,MAAM,oBAAoB,GAAG,IAAI,CAAC,IAAI,CAClC,WAAW,EACX,cAAc,CACjB,CAAA;gBAED,EAAE,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;oBACzC,IAAI,GAAG,IAAI,IAAI;wBAAE,iBAAiB,EAAE,CAAA;yBAC/B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE;wBACrB,EAAE,CAAC,QAAQ,CACP,oBAAoB,EACpB,MAAM,EACN,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;4BACV,IAAI,GAAG,IAAI,IAAI;gCAAE,MAAM,CAAC,IAAI,CAAC,CAAA;iCACxB;gCACD,IAAI;oCACA,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;iCAC3B;gCAAC,OAAO,GAAG,EAAE;oCACV,MAAM,CAAC,IAAI,CAAC,CAAA;iCACf;6BACJ;wBACL,CAAC,CACJ,CAAA;qBACJ;;wBAAM,iBAAiB,EAAE,CAAA;gBAC9B,CAAC,CAAC,CAAA;aACL;QACL,CAAC;QAED,iBAAiB,EAAE,CAAA;IACvB,CAAC,CAAC,CAAA;AACN,CAAC","file":"ImportUtils.js","sourcesContent":["import fs from \"fs\"\nimport path from \"path\"\nimport { pathToFileURL } from \"url\"\n\nexport async function importOrRequireFile(\n    filePath: string,\n): Promise<[result: any, moduleType: \"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            await Function(\"return filePath => import(filePath)\")()(\n                filePath.startsWith(\"file://\")\n                    ? filePath\n                    : pathToFileURL(filePath).toString(),\n            ),\n            \"esm\",\n        ]\n    }\n    const tryToRequire = async (): Promise<[any, \"commonjs\"]> => {\n        return [require(filePath), \"commonjs\"]\n    }\n\n    const extension = filePath.substring(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\nfunction getNearestPackageJson(filePath: string): Promise<object | null> {\n    return new Promise((accept) => {\n        let currentPath = filePath\n\n        function searchPackageJson() {\n            const nextPath = path.dirname(currentPath)\n\n            if (currentPath === nextPath)\n                // the top of the file tree is reached\n                accept(null)\n            else {\n                currentPath = nextPath\n                const potentialPackageJson = path.join(\n                    currentPath,\n                    \"package.json\",\n                )\n\n                fs.stat(potentialPackageJson, (err, stats) => {\n                    if (err != null) searchPackageJson()\n                    else if (stats.isFile()) {\n                        fs.readFile(\n                            potentialPackageJson,\n                            \"utf8\",\n                            (err, data) => {\n                                if (err != null) accept(null)\n                                else {\n                                    try {\n                                        accept(JSON.parse(data))\n                                    } catch (err) {\n                                        accept(null)\n                                    }\n                                }\n                            },\n                        )\n                    } else searchPackageJson()\n                })\n            }\n        }\n\n        searchPackageJson()\n    })\n}\n"],"sourceRoot":".."}

package/browser/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 { QueryBuilder } from "../query-builder/QueryBuilder";
+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 { DataSource } from "../data-source";
+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 isQueryBuilder(obj: unknown): obj is QueryBuilder<any>;
+    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 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;
+}