@itwin/ecschema-metadata 4.0.0-dev.52 → 4.0.0-dev.54

package/lib/cjs/utils/SchemaGraph.js

@@ -1,66 +1,66 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SchemaGraph = void 0;
-/**
- * Utility class for detecting cyclic references in a Schema graph.
- * @beta
- */
-class SchemaGraph {
-    /**
-     * Initializes a new SchemaGraph instance.
-     * @param schema The schema to analyze.
-     */
-    constructor(schema) {
-        this._schemas = [];
-        this.populateGraph(schema);
-    }
-    /**
-     * Detected cyclic references in a schema.
-     * @returns True if a cycle is found.
-     */
-    detectCycles() {
-        const visited = {};
-        const recStack = {};
-        const cycles = [];
-        for (const schema of this._schemas) {
-            if (this.detectCycleUtil(schema, visited, recStack, cycles)) {
-                return cycles.length > 0 ? cycles : undefined;
-            }
-        }
-        return undefined;
-    }
-    detectCycleUtil(schema, visited, recStack, cycles) {
-        let cycleFound = false;
-        if (!visited[schema.name]) {
-            visited[schema.name] = true;
-            recStack[schema.name] = true;
-            for (const refSchema of schema.references) {
-                if (!visited[refSchema.name] && this.detectCycleUtil(refSchema, visited, recStack, cycles)) {
-                    cycles.push({ schema, refSchema });
-                    cycleFound = true;
-                }
-                else if (recStack[refSchema.name]) {
-                    cycles.push({ schema, refSchema });
-                    cycleFound = true;
-                }
-            }
-        }
-        if (!cycleFound)
-            recStack[schema.name] = false;
-        return cycleFound;
-    }
-    populateGraph(schema) {
-        if (this._schemas.includes(schema))
-            return;
-        this._schemas.push(schema);
-        for (const refSchema of schema.references) {
-            this.populateGraph(refSchema);
-        }
-    }
-}
-exports.SchemaGraph = SchemaGraph;
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SchemaGraph = void 0;
+/**
+ * Utility class for detecting cyclic references in a Schema graph.
+ * @beta
+ */
+class SchemaGraph {
+    /**
+     * Initializes a new SchemaGraph instance.
+     * @param schema The schema to analyze.
+     */
+    constructor(schema) {
+        this._schemas = [];
+        this.populateGraph(schema);
+    }
+    /**
+     * Detected cyclic references in a schema.
+     * @returns True if a cycle is found.
+     */
+    detectCycles() {
+        const visited = {};
+        const recStack = {};
+        const cycles = [];
+        for (const schema of this._schemas) {
+            if (this.detectCycleUtil(schema, visited, recStack, cycles)) {
+                return cycles.length > 0 ? cycles : undefined;
+            }
+        }
+        return undefined;
+    }
+    detectCycleUtil(schema, visited, recStack, cycles) {
+        let cycleFound = false;
+        if (!visited[schema.name]) {
+            visited[schema.name] = true;
+            recStack[schema.name] = true;
+            for (const refSchema of schema.references) {
+                if (!visited[refSchema.name] && this.detectCycleUtil(refSchema, visited, recStack, cycles)) {
+                    cycles.push({ schema, refSchema });
+                    cycleFound = true;
+                }
+                else if (recStack[refSchema.name]) {
+                    cycles.push({ schema, refSchema });
+                    cycleFound = true;
+                }
+            }
+        }
+        if (!cycleFound)
+            recStack[schema.name] = false;
+        return cycleFound;
+    }
+    populateGraph(schema) {
+        if (this._schemas.includes(schema))
+            return;
+        this._schemas.push(schema);
+        for (const refSchema of schema.references) {
+            this.populateGraph(refSchema);
+        }
+    }
+}
+exports.SchemaGraph = SchemaGraph;
 //# sourceMappingURL=SchemaGraph.js.map

package/lib/cjs/utils/SchemaGraph.js.map

@@ -1 +1 @@
-{"version":3,"file":"SchemaGraph.js","sourceRoot":"","sources":["../../../src/utils/SchemaGraph.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAU/F;;;GAGG;AACH,MAAa,WAAW;IAGtB;;;OAGG;IACH,YAAmB,MAAc;QANzB,aAAQ,GAAa,EAAE,CAAC;QAO9B,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACI,YAAY;QACjB,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,MAAM,MAAM,GAAqB,EAAE,CAAC;QAEpC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClC,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE;gBAC3D,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;aAC/C;SACF;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,eAAe,CAAC,MAAc,EAAE,OAAY,EAAE,QAAa,EAAE,MAAwB;QAC3F,IAAI,UAAU,GAAG,KAAK,CAAC;QAEvB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACzB,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAC5B,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAE7B,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,UAAU,EAAE;gBACzC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE;oBAC1F,MAAM,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,SAAS,EAAC,CAAC,CAAC;oBACjC,UAAU,GAAG,IAAI,CAAC;iBACnB;qBAAM,IAAI,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;oBACnC,MAAM,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,SAAS,EAAC,CAAC,CAAC;oBACjC,UAAU,GAAG,IAAI,CAAC;iBACnB;aACF;SACF;QACD,IAAI,CAAC,UAAU;YACb,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;QAEhC,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,aAAa,CAAC,MAAc;QAClC,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;YAChC,OAAO;QAET,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE3B,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,UAAU,EAAE;YACzC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;SAC/B;IACH,CAAC;CACF;AA9DD,kCA8DC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\nimport { Schema } from \"../Metadata/Schema\";\r\n\r\n/** @internal */\r\nexport interface ReferenceCycle {\r\n  schema: Schema;\r\n  refSchema: Schema;\r\n}\r\n\r\n/**\r\n * Utility class for detecting cyclic references in a Schema graph.\r\n * @beta\r\n */\r\nexport class SchemaGraph {\r\n  private _schemas: Schema[] = [];\r\n\r\n  /**\r\n   * Initializes a new SchemaGraph instance.\r\n   * @param schema The schema to analyze.\r\n   */\r\n  public constructor(schema: Schema) {\r\n    this.populateGraph(schema);\r\n  }\r\n\r\n  /**\r\n   * Detected cyclic references in a schema.\r\n   * @returns True if a cycle is found.\r\n   */\r\n  public detectCycles(): ReferenceCycle[] | undefined {\r\n    const visited = {};\r\n    const recStack = {};\r\n    const cycles: ReferenceCycle[] = [];\r\n\r\n    for (const schema of this._schemas) {\r\n      if (this.detectCycleUtil(schema, visited, recStack, cycles)) {\r\n        return cycles.length > 0 ? cycles : undefined;\r\n      }\r\n    }\r\n\r\n    return undefined;\r\n  }\r\n\r\n  private detectCycleUtil(schema: Schema, visited: any, recStack: any, cycles: ReferenceCycle[]): boolean {\r\n    let cycleFound = false;\r\n\r\n    if (!visited[schema.name]) {\r\n      visited[schema.name] = true;\r\n      recStack[schema.name] = true;\r\n\r\n      for (const refSchema of schema.references) {\r\n        if (!visited[refSchema.name] && this.detectCycleUtil(refSchema, visited, recStack, cycles)) {\r\n          cycles.push({schema, refSchema});\r\n          cycleFound = true;\r\n        } else if (recStack[refSchema.name]) {\r\n          cycles.push({schema, refSchema});\r\n          cycleFound = true;\r\n        }\r\n      }\r\n    }\r\n    if (!cycleFound)\r\n      recStack[schema.name] = false;\r\n\r\n    return cycleFound;\r\n  }\r\n\r\n  private populateGraph(schema: Schema) {\r\n    if (this._schemas.includes(schema))\r\n      return;\r\n\r\n    this._schemas.push(schema);\r\n\r\n    for (const refSchema of schema.references) {\r\n      this.populateGraph(refSchema);\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"SchemaGraph.js","sourceRoot":"","sources":["../../../src/utils/SchemaGraph.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAU/F;;;GAGG;AACH,MAAa,WAAW;IAGtB;;;OAGG;IACH,YAAmB,MAAc;QANzB,aAAQ,GAAa,EAAE,CAAC;QAO9B,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACI,YAAY;QACjB,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,MAAM,MAAM,GAAqB,EAAE,CAAC;QAEpC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClC,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE;gBAC3D,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;aAC/C;SACF;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,eAAe,CAAC,MAAc,EAAE,OAAY,EAAE,QAAa,EAAE,MAAwB;QAC3F,IAAI,UAAU,GAAG,KAAK,CAAC;QAEvB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACzB,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAC5B,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAE7B,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,UAAU,EAAE;gBACzC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE;oBAC1F,MAAM,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,SAAS,EAAC,CAAC,CAAC;oBACjC,UAAU,GAAG,IAAI,CAAC;iBACnB;qBAAM,IAAI,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;oBACnC,MAAM,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,SAAS,EAAC,CAAC,CAAC;oBACjC,UAAU,GAAG,IAAI,CAAC;iBACnB;aACF;SACF;QACD,IAAI,CAAC,UAAU;YACb,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;QAEhC,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,aAAa,CAAC,MAAc;QAClC,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;YAChC,OAAO;QAET,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE3B,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,UAAU,EAAE;YACzC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;SAC/B;IACH,CAAC;CACF;AA9DD,kCA8DC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\nimport { Schema } from \"../Metadata/Schema\";\n\n/** @internal */\nexport interface ReferenceCycle {\n  schema: Schema;\n  refSchema: Schema;\n}\n\n/**\n * Utility class for detecting cyclic references in a Schema graph.\n * @beta\n */\nexport class SchemaGraph {\n  private _schemas: Schema[] = [];\n\n  /**\n   * Initializes a new SchemaGraph instance.\n   * @param schema The schema to analyze.\n   */\n  public constructor(schema: Schema) {\n    this.populateGraph(schema);\n  }\n\n  /**\n   * Detected cyclic references in a schema.\n   * @returns True if a cycle is found.\n   */\n  public detectCycles(): ReferenceCycle[] | undefined {\n    const visited = {};\n    const recStack = {};\n    const cycles: ReferenceCycle[] = [];\n\n    for (const schema of this._schemas) {\n      if (this.detectCycleUtil(schema, visited, recStack, cycles)) {\n        return cycles.length > 0 ? cycles : undefined;\n      }\n    }\n\n    return undefined;\n  }\n\n  private detectCycleUtil(schema: Schema, visited: any, recStack: any, cycles: ReferenceCycle[]): boolean {\n    let cycleFound = false;\n\n    if (!visited[schema.name]) {\n      visited[schema.name] = true;\n      recStack[schema.name] = true;\n\n      for (const refSchema of schema.references) {\n        if (!visited[refSchema.name] && this.detectCycleUtil(refSchema, visited, recStack, cycles)) {\n          cycles.push({schema, refSchema});\n          cycleFound = true;\n        } else if (recStack[refSchema.name]) {\n          cycles.push({schema, refSchema});\n          cycleFound = true;\n        }\n      }\n    }\n    if (!cycleFound)\n      recStack[schema.name] = false;\n\n    return cycleFound;\n  }\n\n  private populateGraph(schema: Schema) {\n    if (this._schemas.includes(schema))\n      return;\n\n    this._schemas.push(schema);\n\n    for (const refSchema of schema.references) {\n      this.populateGraph(refSchema);\n    }\n  }\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@itwin/ecschema-metadata",
-  "version": "4.0.0-dev.52",
+  "version": "4.0.0-dev.54",
   "description": "ECObjects core concepts in typescript",
   "license": "MIT",
   "main": "lib/cjs/ecschema-metadata.js",
@@ -22,10 +22,10 @@
   },
   "devDependencies": {
     "@bentley/units-schema": "^1.0.5",
-    "@itwin/build-tools": "4.0.0-dev.52",
-    "@itwin/core-bentley": "4.0.0-dev.52",
-    "@itwin/core-quantity": "4.0.0-dev.52",
-    "@itwin/eslint-plugin": "nightly",
+    "@itwin/build-tools": "4.0.0-dev.54",
+    "@itwin/core-bentley": "4.0.0-dev.54",
+    "@itwin/core-quantity": "4.0.0-dev.54",
+    "@itwin/eslint-plugin": "^4.0.0-dev.32",
     "@types/almost-equal": "1.1.0",
     "@types/benchmark": "^2.1.0",
     "@types/chai": "4.3.1",
@@ -43,11 +43,11 @@
     "nyc": "^15.1.0",
     "rimraf": "^3.0.2",
     "sinon": "^9.0.2",
-    "typescript": "~4.4.0"
+    "typescript": "~5.0.2"
   },
   "peerDependencies": {
-    "@itwin/core-bentley": "^4.0.0-dev.52",
-    "@itwin/core-quantity": "^4.0.0-dev.52"
+    "@itwin/core-bentley": "^4.0.0-dev.54",
+    "@itwin/core-quantity": "^4.0.0-dev.54"
   },
   "dependencies": {
     "almost-equal": "^1.1.0"