@itwin/ecschema-metadata 5.10.0-dev.1 → 5.10.0-dev.4

package/lib/esm/utils/ECClassHierarchy.js.map

@@ -1 +1 @@
-{"version":3,"file":"ECClassHierarchy.js","sourceRoot":"","sources":["../../../src/utils/ECClassHierarchy.ts"],"names":[],"mappings":"AAiBA;;;;;GAKG;AACH,MAAM,OAAO,gBAAgB;IACnB,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE3C,aAAa,CAAC,QAAuB;QAC3C,MAAM,UAAU,GAAe,EAAE,WAAW,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;QACvE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACnD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEM,YAAY,CAAC,QAAuB,EAAE,YAA2B,EAAE,UAAmB,KAAK;QAChG,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAE1F,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC;YACtF,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,IAAI,CAAC,eAAe,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAEO,eAAe,CAAC,YAA2B,EAAE,QAAuB;QAC1E,MAAM,cAAc,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;QACtG,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;YACtF,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAEM,eAAe,CAAC,QAAuB,EAAE,YAA2B;QACzE,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QACD,MAAM,KAAK,GAAG,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC;QACpG,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,mBAAmB,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;IACnD,CAAC;IAEO,mBAAmB,CAAC,YAA2B,EAAE,QAAuB;QAC9E,MAAM,cAAc,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAClE,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,OAAO;QACT,CAAC;QACD,MAAM,YAAY,GAAG,cAAc,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3G,IAAI,YAAY,KAAK,CAAC,CAAC,EAAE,CAAC;YACxB,cAAc,CAAC,cAAc,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAEM,gBAAgB,CAAC,QAAuB;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,aAAa,GAAoB,EAAE,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,WAAW,EAAE,CAAC;YAC3C,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;YACvC,aAAa,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;QACnE,CAAC;QAED,OAAO,aAAa,CAAC;IACvB,CAAC;IAEM,mBAAmB,CAAC,QAAuB;QAChD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,gBAAgB,GAAoB,CAAC,GAAG,UAAU,CAAC,cAAc,CAAC,CAAC;QACzE,KAAK,MAAM,eAAe,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;YACxD,gBAAgB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,eAAe,CAAC,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,gBAAgB,CAAC;IAC1B,CAAC;CACF","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\nimport { SchemaItemKey } from \"../SchemaKey\";\r\n\r\ninterface ClassEntry {\r\n  readonly baseClasses: BaseClassEntry[];\r\n  readonly derivedClasses: SchemaItemKey[];\r\n}\r\n\r\n/** Interface for a Baseclass entry in the hierarchy */\r\ninterface BaseClassEntry {\r\n  readonly baseClassKey: SchemaItemKey;\r\n  readonly isMixin: boolean;\r\n}\r\n\r\n/**\r\n * The class hierarchy is a helper class that maintains the relationships between ECClasses and their base classes\r\n * within a SchemaContext. It allows for efficient retrieval of base and derived classes based on their schema item\r\n * keys to support lazy loaded classes properly.\r\n * @internal\r\n */\r\nexport class ECClassHierarchy {\r\n  private _hierarchy = new Map<string, ClassEntry>();\r\n\r\n  private addClassEntry(classKey: SchemaItemKey): ClassEntry {\r\n    const classEntry: ClassEntry = { baseClasses: [], derivedClasses: [] };\r\n    this._hierarchy.set(classKey.fullName, classEntry);\r\n    return classEntry;\r\n  }\r\n\r\n  public addBaseClass(classKey: SchemaItemKey, baseClassKey: SchemaItemKey, isMixin: boolean = false): void {\r\n    const classEntry = this._hierarchy.get(classKey.fullName) ?? this.addClassEntry(classKey);\r\n\r\n    if (!classEntry.baseClasses.find((entry) => entry.baseClassKey.matches(baseClassKey))) {\r\n      classEntry.baseClasses.push({ baseClassKey, isMixin });\r\n    }\r\n\r\n    if (!isMixin) {\r\n      this.addDerivedClass(baseClassKey, classKey);\r\n    }\r\n  }\r\n\r\n  private addDerivedClass(baseClassKey: SchemaItemKey, classKey: SchemaItemKey): void {\r\n    const baseClassEntry = this._hierarchy.get(baseClassKey.fullName) ?? this.addClassEntry(baseClassKey);\r\n    if (!baseClassEntry.derivedClasses.find((derivedKey) => derivedKey.matches(classKey))) {\r\n      baseClassEntry.derivedClasses.push(classKey);\r\n    }\r\n  }\r\n\r\n  public removeBaseClass(classKey: SchemaItemKey, baseClassKey: SchemaItemKey): void {\r\n    const classEntry = this._hierarchy.get(classKey.fullName);\r\n    if (!classEntry) {\r\n      return;\r\n    }\r\n    const index = classEntry.baseClasses.findIndex((entry) => entry.baseClassKey.matches(baseClassKey));\r\n    if (index !== -1) {\r\n      classEntry.baseClasses.splice(index, 1);\r\n    }\r\n\r\n    this.removedDerivedClass(baseClassKey, classKey);\r\n  }\r\n\r\n  private removedDerivedClass(baseClassKey: SchemaItemKey, classKey: SchemaItemKey): void {\r\n    const baseClassEntry = this._hierarchy.get(baseClassKey.fullName);\r\n    if (!baseClassEntry) {\r\n      return;\r\n    }\r\n    const derivedIndex = baseClassEntry.derivedClasses.findIndex((derivedKey) => derivedKey.matches(classKey));\r\n    if (derivedIndex !== -1) {\r\n      baseClassEntry.derivedClasses.splice(derivedIndex, 1);\r\n    }\r\n  }\r\n\r\n  public getBaseClassKeys(classKey: SchemaItemKey): ReadonlyArray<SchemaItemKey> {\r\n    const classEntry = this._hierarchy.get(classKey.fullName);\r\n    if (!classEntry) {\r\n      return [];\r\n    }\r\n\r\n    const baseClassKeys: SchemaItemKey[] = [];\r\n    for (const entry of classEntry.baseClasses) {\r\n      baseClassKeys.push(entry.baseClassKey);\r\n      baseClassKeys.push(...this.getBaseClassKeys(entry.baseClassKey));\r\n    }\r\n\r\n    return baseClassKeys;\r\n  }\r\n\r\n  public getDerivedClassKeys(classKey: SchemaItemKey): ReadonlyArray<SchemaItemKey> {\r\n    const classEntry = this._hierarchy.get(classKey.fullName);\r\n    if (!classEntry) {\r\n      return [];\r\n    }\r\n\r\n    const derivedClassKeys: SchemaItemKey[] = [...classEntry.derivedClasses];\r\n    for (const derivedClassKey of classEntry.derivedClasses) {\r\n      derivedClassKeys.push(...this.getDerivedClassKeys(derivedClassKey));\r\n    }\r\n    return derivedClassKeys;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ECClassHierarchy.js","sourceRoot":"","sources":["../../../src/utils/ECClassHierarchy.ts"],"names":[],"mappings":"AAiBA;;;;;GAKG;AACH,MAAM,OAAO,gBAAgB;IACnB,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE3C,aAAa,CAAC,QAAuB;QAC3C,MAAM,UAAU,GAAe,EAAE,WAAW,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;QACvE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACnD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEM,YAAY,CAAC,QAAuB,EAAE,YAA2B,EAAE,UAAmB,KAAK;QAChG,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAE1F,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC;YACtF,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,IAAI,CAAC,eAAe,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAEO,eAAe,CAAC,YAA2B,EAAE,QAAuB;QAC1E,MAAM,cAAc,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;QACtG,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;YACtF,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAEM,eAAe,CAAC,QAAuB,EAAE,YAA2B;QACzE,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QACD,MAAM,KAAK,GAAG,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC;QACpG,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,mBAAmB,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;IACnD,CAAC;IAEO,mBAAmB,CAAC,YAA2B,EAAE,QAAuB;QAC9E,MAAM,cAAc,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAClE,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,OAAO;QACT,CAAC;QACD,MAAM,YAAY,GAAG,cAAc,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3G,IAAI,YAAY,KAAK,CAAC,CAAC,EAAE,CAAC;YACxB,cAAc,CAAC,cAAc,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAEM,gBAAgB,CAAC,QAAuB;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,aAAa,GAAoB,EAAE,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,WAAW,EAAE,CAAC;YAC3C,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;YACvC,aAAa,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC;QACnE,CAAC;QAED,OAAO,aAAa,CAAC;IACvB,CAAC;IAEM,mBAAmB,CAAC,QAAuB;QAChD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,gBAAgB,GAAoB,CAAC,GAAG,UAAU,CAAC,cAAc,CAAC,CAAC;QACzE,KAAK,MAAM,eAAe,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;YACxD,gBAAgB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,eAAe,CAAC,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,gBAAgB,CAAC;IAC1B,CAAC;CACF","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*--------------------------------------------------------------------------------------------*/\nimport { SchemaItemKey } from \"../SchemaKey\";\n\ninterface ClassEntry {\n  readonly baseClasses: BaseClassEntry[];\n  readonly derivedClasses: SchemaItemKey[];\n}\n\n/** Interface for a Baseclass entry in the hierarchy */\ninterface BaseClassEntry {\n  readonly baseClassKey: SchemaItemKey;\n  readonly isMixin: boolean;\n}\n\n/**\n * The class hierarchy is a helper class that maintains the relationships between ECClasses and their base classes\n * within a SchemaContext. It allows for efficient retrieval of base and derived classes based on their schema item\n * keys to support lazy loaded classes properly.\n * @internal\n */\nexport class ECClassHierarchy {\n  private _hierarchy = new Map<string, ClassEntry>();\n\n  private addClassEntry(classKey: SchemaItemKey): ClassEntry {\n    const classEntry: ClassEntry = { baseClasses: [], derivedClasses: [] };\n    this._hierarchy.set(classKey.fullName, classEntry);\n    return classEntry;\n  }\n\n  public addBaseClass(classKey: SchemaItemKey, baseClassKey: SchemaItemKey, isMixin: boolean = false): void {\n    const classEntry = this._hierarchy.get(classKey.fullName) ?? this.addClassEntry(classKey);\n\n    if (!classEntry.baseClasses.find((entry) => entry.baseClassKey.matches(baseClassKey))) {\n      classEntry.baseClasses.push({ baseClassKey, isMixin });\n    }\n\n    if (!isMixin) {\n      this.addDerivedClass(baseClassKey, classKey);\n    }\n  }\n\n  private addDerivedClass(baseClassKey: SchemaItemKey, classKey: SchemaItemKey): void {\n    const baseClassEntry = this._hierarchy.get(baseClassKey.fullName) ?? this.addClassEntry(baseClassKey);\n    if (!baseClassEntry.derivedClasses.find((derivedKey) => derivedKey.matches(classKey))) {\n      baseClassEntry.derivedClasses.push(classKey);\n    }\n  }\n\n  public removeBaseClass(classKey: SchemaItemKey, baseClassKey: SchemaItemKey): void {\n    const classEntry = this._hierarchy.get(classKey.fullName);\n    if (!classEntry) {\n      return;\n    }\n    const index = classEntry.baseClasses.findIndex((entry) => entry.baseClassKey.matches(baseClassKey));\n    if (index !== -1) {\n      classEntry.baseClasses.splice(index, 1);\n    }\n\n    this.removedDerivedClass(baseClassKey, classKey);\n  }\n\n  private removedDerivedClass(baseClassKey: SchemaItemKey, classKey: SchemaItemKey): void {\n    const baseClassEntry = this._hierarchy.get(baseClassKey.fullName);\n    if (!baseClassEntry) {\n      return;\n    }\n    const derivedIndex = baseClassEntry.derivedClasses.findIndex((derivedKey) => derivedKey.matches(classKey));\n    if (derivedIndex !== -1) {\n      baseClassEntry.derivedClasses.splice(derivedIndex, 1);\n    }\n  }\n\n  public getBaseClassKeys(classKey: SchemaItemKey): ReadonlyArray<SchemaItemKey> {\n    const classEntry = this._hierarchy.get(classKey.fullName);\n    if (!classEntry) {\n      return [];\n    }\n\n    const baseClassKeys: SchemaItemKey[] = [];\n    for (const entry of classEntry.baseClasses) {\n      baseClassKeys.push(entry.baseClassKey);\n      baseClassKeys.push(...this.getBaseClassKeys(entry.baseClassKey));\n    }\n\n    return baseClassKeys;\n  }\n\n  public getDerivedClassKeys(classKey: SchemaItemKey): ReadonlyArray<SchemaItemKey> {\n    const classEntry = this._hierarchy.get(classKey.fullName);\n    if (!classEntry) {\n      return [];\n    }\n\n    const derivedClassKeys: SchemaItemKey[] = [...classEntry.derivedClasses];\n    for (const derivedClassKey of classEntry.derivedClasses) {\n      derivedClassKeys.push(...this.getDerivedClassKeys(derivedClassKey));\n    }\n    return derivedClassKeys;\n  }\n}\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"SchemaGraph.js","sourceRoot":"","sources":["../../../src/utils/SchemaGraph.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAG/F,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAc7D;;;GAGG;AACH,MAAM,OAAO,WAAW;IACd,QAAQ,GAAiB,EAAE,CAAC;IAEpC,gBAAwB,CAAC;IAEjB,IAAI,CAAC,SAAoB;QAC/B,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAgB,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7G,CAAC;IAED;;OAEG;IACI,aAAa;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACnC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,QAAQ,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxH,MAAM,IAAI,aAAa,CAAC,cAAc,CAAC,aAAa,EAAE,WAAW,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,2BAA2B,MAAM,EAAE,CAAC,CAAC;QACvI,CAAC;IACH,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,CAAC;YACnC,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC;gBAC5D,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;YAChD,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,eAAe,CAAC,MAAkB,EAAE,OAAY,EAAE,QAAa,EAAE,MAAwB;QAC/F,IAAI,UAAU,GAAG,KAAK,CAAC;QAEvB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACpC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YACtC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAEvC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;gBACvC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBAC9C,IAAI,SAAS,KAAK,SAAS;oBACzB,MAAM,IAAI,aAAa,CAAC,cAAc,CAAC,kBAAkB,EAAE,iDAAiD,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;gBACvL,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC;oBAClG,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;oBACnC,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;qBAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC3C,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;oBACnC,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,UAAU;YACb,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;QAE1C,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAkB,EAAE,OAAsB;QAC1E,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAEhC,MAAM,QAAQ,GAAG,KAAK,EAAE,CAAa,EAAE,EAAE;YACvC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;gBACzB,OAAO;YAET,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEvB,KAAK,MAAM,SAAS,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;gBACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;oBACrC,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,SAAS,EAAE,eAAe,CAAC,qBAAqB,CAAC,CAAC;oBACxG,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;wBAC1B,MAAM,IAAI,aAAa,CAAC,cAAc,CAAC,oBAAoB,EACzD,2CAA2C,SAAS,CAAC,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,SAAS,CAAC,IAAI,kCAAkC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;oBACpM,CAAC;oBACD,MAAM,QAAQ,CAAC,OAAO,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,MAAM,QAAQ,CAAC,MAAM,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAAc;QAC5C,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAEhC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE;YAC7B,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;gBACzB,OAAO;YAET,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEvB,KAAK,MAAM,SAAS,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;gBACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC;oBAClC,QAAQ,CAAC,SAAS,CAAC,CAAC;YACxB,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;CAEF","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 { SchemaContext } from \"../Context\";\r\nimport { SchemaMatchType } from \"../ECObjects\";\r\nimport { ECSchemaError, ECSchemaStatus } from \"../Exception\";\r\nimport { SchemaInfo } from \"../Interfaces\";\r\nimport { Schema } from \"../Metadata/Schema\";\r\nimport { SchemaKey } from \"../SchemaKey\";\r\n\r\n/**\r\n * A schema and it's reference that make up part of a schema cycle\r\n * @internal\r\n */\r\nexport interface ReferenceCycle {\r\n  schema: SchemaInfo;\r\n  refSchema: SchemaInfo;\r\n}\r\n\r\n/**\r\n * Utility class for detecting cyclic references in a Schema graph.\r\n * @internal\r\n */\r\nexport class SchemaGraph {\r\n  private _schemas: SchemaInfo[] = [];\r\n\r\n  private constructor() { }\r\n\r\n  private find(schemaKey: SchemaKey) {\r\n    return this._schemas.find((info: SchemaInfo) => info.schemaKey.matches(schemaKey, SchemaMatchType.Latest));\r\n  }\r\n\r\n  /**\r\n   * Detected cyclic references in a schema and throw an exception if a cycle is found.\r\n   */\r\n  public throwIfCycles() {\r\n    const cycles = this.detectCycles();\r\n    if (cycles) {\r\n      const result = cycles.map((cycle) => `${cycle.schema.schemaKey.name} --> ${cycle.refSchema.schemaKey.name}`).join(\", \");\r\n      throw new ECSchemaError(ECSchemaStatus.InvalidECJson, `Schema '${this._schemas[0].schemaKey.name}' has reference cycles: ${result}`);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Detected cyclic references in a schema.\r\n   * @returns An array describing the cycle if there is a cycle or undefined if no cycles 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: SchemaInfo, visited: any, recStack: any, cycles: ReferenceCycle[]): boolean {\r\n    let cycleFound = false;\r\n\r\n    if (!visited[schema.schemaKey.name]) {\r\n      visited[schema.schemaKey.name] = true;\r\n      recStack[schema.schemaKey.name] = true;\r\n\r\n      for (const refKey of schema.references) {\r\n        const refSchema = this.find(refKey.schemaKey);\r\n        if (undefined === refSchema)\r\n          throw new ECSchemaError(ECSchemaStatus.UnableToLoadSchema, `Could not find the schema info for ref schema ${refKey.schemaKey.toString()} for schema ${schema.schemaKey.toString()}`);\r\n        if (!visited[refKey.schemaKey.name] && this.detectCycleUtil(refSchema, visited, recStack, cycles)) {\r\n          cycles.push({ schema, refSchema });\r\n          cycleFound = true;\r\n        } else if (recStack[refKey.schemaKey.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.schemaKey.name] = false;\r\n\r\n    return cycleFound;\r\n  }\r\n\r\n  /**\r\n   * Generates a SchemaGraph for the input schema using the context to find info on referenced schemas.  Use the generateGraphSync if you have the fully loaded Schema.\r\n   * @param schema The SchemaInfo to build the graph from\r\n   * @param context The SchemaContext used to locate info on the referenced schemas\r\n   * @returns A SchemaGraph that can be used to detect schema cycles\r\n   */\r\n  public static async generateGraph(schema: SchemaInfo, context: SchemaContext): Promise<SchemaGraph> {\r\n    const graph = new SchemaGraph();\r\n\r\n    const genGraph = async (s: SchemaInfo) => {\r\n      if (graph.find(s.schemaKey))\r\n        return;\r\n\r\n      graph._schemas.push(s);\r\n\r\n      for (const refSchema of s.references) {\r\n        if (!graph.find(refSchema.schemaKey)) {\r\n          const refInfo = await context.getSchemaInfo(refSchema.schemaKey, SchemaMatchType.LatestWriteCompatible);\r\n          if (undefined === refInfo) {\r\n            throw new ECSchemaError(ECSchemaStatus.UnableToLocateSchema,\r\n              `Could not locate the referenced schema, ${refSchema.schemaKey.name}.${refSchema.schemaKey.version.toString()}, of ${s.schemaKey.name} when populating the graph for ${schema.schemaKey.name}`);\r\n          }\r\n          await genGraph(refInfo);\r\n        }\r\n      }\r\n    };\r\n\r\n    await genGraph(schema);\r\n    return graph;\r\n  }\r\n\r\n  /**\r\n   * Generates a SchemaGraph for the input schema.  Use the generateGraph if you just have schema info.\r\n   * @param schema The Schema to build the graph from.\r\n   * @returns A SchemaGraph that can be used to detect schema cycles\r\n   */\r\n  public static generateGraphSync(schema: Schema): SchemaGraph {\r\n    const graph = new SchemaGraph();\r\n\r\n    const genGraph = (s: Schema) => {\r\n      if (graph.find(s.schemaKey))\r\n        return;\r\n\r\n      graph._schemas.push(s);\r\n\r\n      for (const refSchema of s.references) {\r\n        if (!graph.find(refSchema.schemaKey))\r\n          genGraph(refSchema);\r\n      }\r\n    };\r\n\r\n    genGraph(schema);\r\n    return graph;\r\n  }\r\n\r\n}\r\n\r\n"]}
+{"version":3,"file":"SchemaGraph.js","sourceRoot":"","sources":["../../../src/utils/SchemaGraph.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAG/F,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAc7D;;;GAGG;AACH,MAAM,OAAO,WAAW;IACd,QAAQ,GAAiB,EAAE,CAAC;IAEpC,gBAAwB,CAAC;IAEjB,IAAI,CAAC,SAAoB;QAC/B,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAgB,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7G,CAAC;IAED;;OAEG;IACI,aAAa;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACnC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,QAAQ,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxH,MAAM,IAAI,aAAa,CAAC,cAAc,CAAC,aAAa,EAAE,WAAW,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,2BAA2B,MAAM,EAAE,CAAC,CAAC;QACvI,CAAC;IACH,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,CAAC;YACnC,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC;gBAC5D,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;YAChD,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,eAAe,CAAC,MAAkB,EAAE,OAAY,EAAE,QAAa,EAAE,MAAwB;QAC/F,IAAI,UAAU,GAAG,KAAK,CAAC;QAEvB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACpC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YACtC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YAEvC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;gBACvC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBAC9C,IAAI,SAAS,KAAK,SAAS;oBACzB,MAAM,IAAI,aAAa,CAAC,cAAc,CAAC,kBAAkB,EAAE,iDAAiD,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,eAAe,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;gBACvL,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC;oBAClG,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;oBACnC,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;qBAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC3C,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;oBACnC,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,UAAU;YACb,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;QAE1C,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAkB,EAAE,OAAsB;QAC1E,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAEhC,MAAM,QAAQ,GAAG,KAAK,EAAE,CAAa,EAAE,EAAE;YACvC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;gBACzB,OAAO;YAET,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEvB,KAAK,MAAM,SAAS,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;gBACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;oBACrC,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,SAAS,EAAE,eAAe,CAAC,qBAAqB,CAAC,CAAC;oBACxG,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;wBAC1B,MAAM,IAAI,aAAa,CAAC,cAAc,CAAC,oBAAoB,EACzD,2CAA2C,SAAS,CAAC,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,SAAS,CAAC,IAAI,kCAAkC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;oBACpM,CAAC;oBACD,MAAM,QAAQ,CAAC,OAAO,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,MAAM,QAAQ,CAAC,MAAM,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAAc;QAC5C,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAEhC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE;YAC7B,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;gBACzB,OAAO;YAET,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEvB,KAAK,MAAM,SAAS,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;gBACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC;oBAClC,QAAQ,CAAC,SAAS,CAAC,CAAC;YACxB,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;CAEF","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 { SchemaContext } from \"../Context\";\nimport { SchemaMatchType } from \"../ECObjects\";\nimport { ECSchemaError, ECSchemaStatus } from \"../Exception\";\nimport { SchemaInfo } from \"../Interfaces\";\nimport { Schema } from \"../Metadata/Schema\";\nimport { SchemaKey } from \"../SchemaKey\";\n\n/**\n * A schema and it's reference that make up part of a schema cycle\n * @internal\n */\nexport interface ReferenceCycle {\n  schema: SchemaInfo;\n  refSchema: SchemaInfo;\n}\n\n/**\n * Utility class for detecting cyclic references in a Schema graph.\n * @internal\n */\nexport class SchemaGraph {\n  private _schemas: SchemaInfo[] = [];\n\n  private constructor() { }\n\n  private find(schemaKey: SchemaKey) {\n    return this._schemas.find((info: SchemaInfo) => info.schemaKey.matches(schemaKey, SchemaMatchType.Latest));\n  }\n\n  /**\n   * Detected cyclic references in a schema and throw an exception if a cycle is found.\n   */\n  public throwIfCycles() {\n    const cycles = this.detectCycles();\n    if (cycles) {\n      const result = cycles.map((cycle) => `${cycle.schema.schemaKey.name} --> ${cycle.refSchema.schemaKey.name}`).join(\", \");\n      throw new ECSchemaError(ECSchemaStatus.InvalidECJson, `Schema '${this._schemas[0].schemaKey.name}' has reference cycles: ${result}`);\n    }\n  }\n\n  /**\n   * Detected cyclic references in a schema.\n   * @returns An array describing the cycle if there is a cycle or undefined if no cycles 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: SchemaInfo, visited: any, recStack: any, cycles: ReferenceCycle[]): boolean {\n    let cycleFound = false;\n\n    if (!visited[schema.schemaKey.name]) {\n      visited[schema.schemaKey.name] = true;\n      recStack[schema.schemaKey.name] = true;\n\n      for (const refKey of schema.references) {\n        const refSchema = this.find(refKey.schemaKey);\n        if (undefined === refSchema)\n          throw new ECSchemaError(ECSchemaStatus.UnableToLoadSchema, `Could not find the schema info for ref schema ${refKey.schemaKey.toString()} for schema ${schema.schemaKey.toString()}`);\n        if (!visited[refKey.schemaKey.name] && this.detectCycleUtil(refSchema, visited, recStack, cycles)) {\n          cycles.push({ schema, refSchema });\n          cycleFound = true;\n        } else if (recStack[refKey.schemaKey.name]) {\n          cycles.push({ schema, refSchema });\n          cycleFound = true;\n        }\n      }\n    }\n    if (!cycleFound)\n      recStack[schema.schemaKey.name] = false;\n\n    return cycleFound;\n  }\n\n  /**\n   * Generates a SchemaGraph for the input schema using the context to find info on referenced schemas.  Use the generateGraphSync if you have the fully loaded Schema.\n   * @param schema The SchemaInfo to build the graph from\n   * @param context The SchemaContext used to locate info on the referenced schemas\n   * @returns A SchemaGraph that can be used to detect schema cycles\n   */\n  public static async generateGraph(schema: SchemaInfo, context: SchemaContext): Promise<SchemaGraph> {\n    const graph = new SchemaGraph();\n\n    const genGraph = async (s: SchemaInfo) => {\n      if (graph.find(s.schemaKey))\n        return;\n\n      graph._schemas.push(s);\n\n      for (const refSchema of s.references) {\n        if (!graph.find(refSchema.schemaKey)) {\n          const refInfo = await context.getSchemaInfo(refSchema.schemaKey, SchemaMatchType.LatestWriteCompatible);\n          if (undefined === refInfo) {\n            throw new ECSchemaError(ECSchemaStatus.UnableToLocateSchema,\n              `Could not locate the referenced schema, ${refSchema.schemaKey.name}.${refSchema.schemaKey.version.toString()}, of ${s.schemaKey.name} when populating the graph for ${schema.schemaKey.name}`);\n          }\n          await genGraph(refInfo);\n        }\n      }\n    };\n\n    await genGraph(schema);\n    return graph;\n  }\n\n  /**\n   * Generates a SchemaGraph for the input schema.  Use the generateGraph if you just have schema info.\n   * @param schema The Schema to build the graph from.\n   * @returns A SchemaGraph that can be used to detect schema cycles\n   */\n  public static generateGraphSync(schema: Schema): SchemaGraph {\n    const graph = new SchemaGraph();\n\n    const genGraph = (s: Schema) => {\n      if (graph.find(s.schemaKey))\n        return;\n\n      graph._schemas.push(s);\n\n      for (const refSchema of s.references) {\n        if (!graph.find(refSchema.schemaKey))\n          genGraph(refSchema);\n      }\n    };\n\n    genGraph(schema);\n    return graph;\n  }\n\n}\n\n"]}

package/lib/esm/utils/SchemaLoadingController.js.map

@@ -1 +1 @@
-{"version":3,"file":"SchemaLoadingController.js","sourceRoot":"","sources":["../../../src/utils/SchemaLoadingController.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG;;;;GAIG;AACH,MAAM,OAAO,uBAAuB;IAC1B,SAAS,CAAC;IACV,WAAW,CAAC;IACZ,QAAQ,CAAiB;IAEjC;;OAEG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,IAAW,UAAU,CAAC,KAAc;QAClC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH;QACE,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,OAAsB;QACjC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE;YAChB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAC3B,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE;YACZ,8FAA8F;YAC9F,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAC3B,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,IAAI;QACf,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;CACF","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\n/**\r\n * Assists in tracking the loading progress of Schemas and SchemaItems. An instance of this\r\n * class is set in Schema and SchemaItem instances.\r\n * @internal\r\n */\r\nexport class SchemaLoadingController {\r\n  private _complete;\r\n  private _inProgress;\r\n  private _promise?: Promise<void>;\r\n\r\n  /**\r\n   * Indicates of the Schema or SchemaItem has been fully loaded.\r\n   */\r\n  public get isComplete() {\r\n    return this._complete;\r\n  }\r\n\r\n  /**\r\n   * Marks that a Schema or SchemaItem has been fully loaded.\r\n   */\r\n  public set isComplete(value: boolean) {\r\n    this._complete = value;\r\n  }\r\n\r\n  /**\r\n   * Indicates that the loading of a Schema or SchemaItem is still in progress\r\n   */\r\n  public get inProgress() {\r\n    return this._inProgress;\r\n  }\r\n\r\n  /**\r\n   * Initializes a new SchemaLoadingController instance.\r\n   */\r\n  constructor() {\r\n    this._complete = false;\r\n    this._inProgress = false;\r\n  }\r\n\r\n  /**\r\n   * Call this method when starting to load a Schema or SchemaItem\r\n   * @param promise The promise used to update the controller state when the promise is resolved.\r\n   */\r\n  public start(promise: Promise<void>) {\r\n    this._inProgress = true;\r\n    promise.then(() => {\r\n      this._complete = true;\r\n      this._inProgress = false;\r\n    }).catch(() => {\r\n      // Errors are handled when wait() is called. This catch prevents unhandled rejection warnings.\r\n      this._complete = false;\r\n      this._inProgress = false;\r\n    });\r\n    this._promise = promise;\r\n  }\r\n\r\n  /**\r\n   * Waits on the Promise given in SchemaLoadingController.start().\r\n   * @returns A Promised that can be awaited while the Schema or SchemaItem is being loaded.\r\n   */\r\n  public async wait(): Promise<void> {\r\n    if (!this._promise)\r\n      throw new Error(\"LoadingController 'start' must be called before 'wait'\");\r\n    return this._promise;\r\n  }\r\n}"]}
+{"version":3,"file":"SchemaLoadingController.js","sourceRoot":"","sources":["../../../src/utils/SchemaLoadingController.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG;;;;GAIG;AACH,MAAM,OAAO,uBAAuB;IAC1B,SAAS,CAAC;IACV,WAAW,CAAC;IACZ,QAAQ,CAAiB;IAEjC;;OAEG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,IAAW,UAAU,CAAC,KAAc;QAClC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH;QACE,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,OAAsB;QACjC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE;YAChB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAC3B,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE;YACZ,8FAA8F;YAC9F,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAC3B,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,IAAI;QACf,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;CACF","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\n/**\n * Assists in tracking the loading progress of Schemas and SchemaItems. An instance of this\n * class is set in Schema and SchemaItem instances.\n * @internal\n */\nexport class SchemaLoadingController {\n  private _complete;\n  private _inProgress;\n  private _promise?: Promise<void>;\n\n  /**\n   * Indicates of the Schema or SchemaItem has been fully loaded.\n   */\n  public get isComplete() {\n    return this._complete;\n  }\n\n  /**\n   * Marks that a Schema or SchemaItem has been fully loaded.\n   */\n  public set isComplete(value: boolean) {\n    this._complete = value;\n  }\n\n  /**\n   * Indicates that the loading of a Schema or SchemaItem is still in progress\n   */\n  public get inProgress() {\n    return this._inProgress;\n  }\n\n  /**\n   * Initializes a new SchemaLoadingController instance.\n   */\n  constructor() {\n    this._complete = false;\n    this._inProgress = false;\n  }\n\n  /**\n   * Call this method when starting to load a Schema or SchemaItem\n   * @param promise The promise used to update the controller state when the promise is resolved.\n   */\n  public start(promise: Promise<void>) {\n    this._inProgress = true;\n    promise.then(() => {\n      this._complete = true;\n      this._inProgress = false;\n    }).catch(() => {\n      // Errors are handled when wait() is called. This catch prevents unhandled rejection warnings.\n      this._complete = false;\n      this._inProgress = false;\n    });\n    this._promise = promise;\n  }\n\n  /**\n   * Waits on the Promise given in SchemaLoadingController.start().\n   * @returns A Promised that can be awaited while the Schema or SchemaItem is being loaded.\n   */\n  public async wait(): Promise<void> {\n    if (!this._promise)\n      throw new Error(\"LoadingController 'start' must be called before 'wait'\");\n    return this._promise;\n  }\n}"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@itwin/ecschema-metadata",
-  "version": "5.10.0-dev.1",
+  "version": "5.10.0-dev.4",
   "description": "ECObjects core concepts in typescript",
   "license": "MIT",
   "main": "lib/cjs/ecschema-metadata.js",
@@ -41,13 +41,13 @@
     "rimraf": "^6.0.1",
     "typescript": "~5.6.2",
     "vitest": "^3.0.6",
-    "@itwin/build-tools": "5.10.0-dev.1",
-    "@itwin/core-bentley": "5.10.0-dev.1",
-    "@itwin/core-quantity": "5.10.0-dev.1"
+    "@itwin/build-tools": "5.10.0-dev.4",
+    "@itwin/core-quantity": "5.10.0-dev.4",
+    "@itwin/core-bentley": "5.10.0-dev.4"
   },
   "peerDependencies": {
-    "@itwin/core-bentley": "5.10.0-dev.1",
-    "@itwin/core-quantity": "5.10.0-dev.1"
+    "@itwin/core-bentley": "5.10.0-dev.4",
+    "@itwin/core-quantity": "5.10.0-dev.4"
   },
   "scripts": {
     "build": "npm run -s build:cjs && npm run -s build:esm",

package/lib/cjs/UnitConversion/Graph.d.ts

@@ -1,35 +0,0 @@
-/** @internal */
-export declare class Graph<T> {
-    private _edgeKeyDelim;
-    private _label;
-    private _nodeCount;
-    private _edgeCount;
-    private _nodes;
-    private _edgeObjs;
-    private _edgeLabels;
-    private _outEdges;
-    constructor();
-    setGraph: (label: string) => Graph<T>;
-    graph: () => string;
-    nodeCount: () => number;
-    nodes: () => string[];
-    setNode: (nodeKey: string, nodeValue: T) => void;
-    node: (nodeKey: string) => T;
-    hasNode: (nodeKey: string) => boolean;
-    edgeCount: () => number;
-    edges: () => {
-        v: string;
-        w: string;
-    }[];
-    setEdge: (v: string, w: string, value: {
-        exponent: number;
-    }) => void;
-    edge: (v: string, w: string) => {
-        exponent: number;
-    };
-    outEdges: (v: string) => {
-        v: string;
-        w: string;
-    }[];
-}
-//# sourceMappingURL=Graph.d.ts.map

package/lib/cjs/UnitConversion/Graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../src/UnitConversion/Graph.ts"],"names":[],"mappings":"AA8CA,gBAAgB;AAChB,qBAAa,KAAK,CAAC,CAAC;IAClB,OAAO,CAAC,aAAa,CAAU;IAC/B,OAAO,CAAC,MAAM,CAAM;IACpB,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,SAAS,CAAc;IAC/B,OAAO,CAAC,WAAW,CAAgB;IACnC,OAAO,CAAC,SAAS,CAAc;;IASxB,QAAQ,UAAW,MAAM,KAAG,KAAK,CAAC,CAAC,CAAC,CAGzC;IAEK,KAAK,eAEV;IAEK,SAAS,eAEd;IAEK,KAAK,iBAEV;IAEK,OAAO,YAAa,MAAM,aAAa,CAAC,UAQ7C;IAEK,IAAI,YAAa,MAAM,OAE5B;IAEK,OAAO,YAAa,MAAM,aAE/B;IAEK,SAAS,eAEd;IAEK,KAAK;WAnFP,MAAM;WACN,MAAM;QAoFT;IAEK,OAAO,MAAO,MAAM,KAAK,MAAM,SAAS;QAAE,QAAQ,EAAE,MAAM,CAAA;KAAE,UAkBjE;IAEK,IAAI,MAAO,MAAM,KAAK,MAAM;kBAjGP,MAAM;MAoGhC;IAEK,QAAQ,MAAO,MAAM;WA5FrB,MAAM;WACN,MAAM;QA+FX;CACH"}

package/lib/cjs/UnitConversion/Graph.js

@@ -1,88 +0,0 @@
-"use strict";
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-// Following https://github.com/dagrejs/graphlib/blob/master/lib/graph.js
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Graph = void 0;
-/** @internal */
-class Graph {
-    _edgeKeyDelim = "\x01";
-    _label = "";
-    _nodeCount = 0;
-    _edgeCount = 0;
-    _nodes;
-    _edgeObjs;
-    _edgeLabels;
-    _outEdges;
-    constructor() {
-        this._nodes = {};
-        this._edgeObjs = {};
-        this._edgeLabels = {};
-        this._outEdges = {};
-    }
-    setGraph = (label) => {
-        this._label = label;
-        return this;
-    };
-    graph = () => {
-        return this._label;
-    };
-    nodeCount = () => {
-        return this._nodeCount;
-    };
-    nodes = () => {
-        return Object.keys(this._nodes);
-    };
-    setNode = (nodeKey, nodeValue) => {
-        if (nodeKey in this._nodes) {
-            this._nodes[nodeKey] = nodeValue;
-            return;
-        }
-        this._nodes[nodeKey] = nodeValue;
-        this._outEdges[nodeKey] = {};
-        ++this._nodeCount;
-    };
-    node = (nodeKey) => {
-        return this._nodes[nodeKey];
-    };
-    hasNode = (nodeKey) => {
-        return nodeKey in this._nodes;
-    };
-    edgeCount = () => {
-        return this._edgeCount;
-    };
-    edges = () => {
-        return Object.values(this._edgeObjs);
-    };
-    setEdge = (v, w, value) => {
-        const edgeId = v + this._edgeKeyDelim + w + this._edgeKeyDelim;
-        if (edgeId in this._edgeLabels) {
-            // this._edgeLabels[edgeId] = value;
-            // Update exponent, specific to this graph's use case
-            this._edgeLabels[edgeId].exponent += value.exponent;
-            return;
-        }
-        this._edgeLabels[edgeId] = value;
-        const edgeObj = {
-            v,
-            w,
-        };
-        this._edgeObjs[edgeId] = edgeObj;
-        // setNode should have ran first, so this.outEdges[v] shouldn't be undefined
-        this._outEdges[v][edgeId] = edgeObj;
-        this._edgeCount++;
-    };
-    edge = (v, w) => {
-        const edgeId = v + this._edgeKeyDelim + w + this._edgeKeyDelim;
-        return this._edgeLabels[edgeId];
-    };
-    outEdges = (v) => {
-        const outV = this._outEdges[v];
-        const edges = Object.values(outV);
-        return edges;
-    };
-}
-exports.Graph = Graph;
-//# sourceMappingURL=Graph.js.map

package/lib/cjs/UnitConversion/Graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../../../src/UnitConversion/Graph.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F,yEAAyE;;;AA0CzE,gBAAgB;AAChB,MAAa,KAAK;IACR,aAAa,GAAG,MAAM,CAAC;IACvB,MAAM,GAAG,EAAE,CAAC;IACZ,UAAU,GAAG,CAAC,CAAC;IACf,UAAU,GAAG,CAAC,CAAC;IACf,MAAM,CAAc;IACpB,SAAS,CAAc;IACvB,WAAW,CAAgB;IAC3B,SAAS,CAAc;IAE/B;QACE,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IAEM,QAAQ,GAAG,CAAC,KAAa,EAAY,EAAE;QAC5C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEK,KAAK,GAAG,GAAG,EAAE;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC,CAAC;IAEK,SAAS,GAAG,GAAG,EAAE;QACtB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC,CAAC;IAEK,KAAK,GAAG,GAAG,EAAE;QAClB,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC,CAAC;IAEK,OAAO,GAAG,CAAC,OAAe,EAAE,SAAY,EAAE,EAAE;QACjD,IAAI,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;YACjC,OAAO;QACT,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;QACjC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QAC7B,EAAE,IAAI,CAAC,UAAU,CAAC;IACpB,CAAC,CAAC;IAEK,IAAI,GAAG,CAAC,OAAe,EAAE,EAAE;QAChC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC,CAAC;IAEK,OAAO,GAAG,CAAC,OAAe,EAAE,EAAE;QACnC,OAAO,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC;IAChC,CAAC,CAAC;IAEK,SAAS,GAAG,GAAG,EAAE;QACtB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC,CAAC;IAEK,KAAK,GAAG,GAAG,EAAE;QAClB,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACvC,CAAC,CAAC;IAEK,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,KAA2B,EAAE,EAAE;QACrE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QAC/D,IAAI,MAAM,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAC/B,oCAAoC;YACpC,qDAAqD;YACrD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC;YACpD,OAAO;QACT,CAAC;QAED,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;QACjC,MAAM,OAAO,GAAG;YACd,CAAC;YACD,CAAC;SACF,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;QACjC,4EAA4E;QAC5E,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;QACpC,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC,CAAC;IAEK,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACrC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QAC/D,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC,CAAC;IAEK,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;CACH;AA1FD,sBA0FC","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// Following https://github.com/dagrejs/graphlib/blob/master/lib/graph.js\r\n\r\n/**\r\n * Using generics for nodes - T represents Unit | Constant in our use case\r\n * @internal\r\n */\r\ninterface NodesMap<T> {\r\n  [node: string]: T;\r\n}\r\n\r\n/**\r\n * Describe edges based on its node endpoints (v, w)\r\n * @internal\r\n */\r\ninterface EdgeObjsMap {\r\n  [edge: string]: {\r\n    v: string;\r\n    w: string;\r\n  };\r\n}\r\n\r\n/**\r\n * Describe edges based on the exponent they carry\r\n * @internal\r\n */\r\ninterface EdgeLabelsMap {\r\n  [edge: string]: { exponent: number };\r\n}\r\n\r\n/**\r\n * List each node with outgoing edges in outer map; describe each node's outgoing edges in inner map\r\n * @internal\r\n */\r\ninterface OutEdgesMap {\r\n  [node: string]: {\r\n    [edges: string]: {\r\n      v: string;\r\n      w: string;\r\n    };\r\n  };\r\n}\r\n\r\n/** @internal */\r\nexport class Graph<T> {\r\n  private _edgeKeyDelim = \"\\x01\";\r\n  private _label = \"\";\r\n  private _nodeCount = 0;\r\n  private _edgeCount = 0;\r\n  private _nodes: NodesMap<T>;\r\n  private _edgeObjs: EdgeObjsMap;\r\n  private _edgeLabels: EdgeLabelsMap;\r\n  private _outEdges: OutEdgesMap;\r\n\r\n  constructor() {\r\n    this._nodes = {};\r\n    this._edgeObjs = {};\r\n    this._edgeLabels = {};\r\n    this._outEdges = {};\r\n  }\r\n\r\n  public setGraph = (label: string): Graph<T> => {\r\n    this._label = label;\r\n    return this;\r\n  };\r\n\r\n  public graph = () => {\r\n    return this._label;\r\n  };\r\n\r\n  public nodeCount = () => {\r\n    return this._nodeCount;\r\n  };\r\n\r\n  public nodes = () => {\r\n    return Object.keys(this._nodes);\r\n  };\r\n\r\n  public setNode = (nodeKey: string, nodeValue: T) => {\r\n    if (nodeKey in this._nodes) {\r\n      this._nodes[nodeKey] = nodeValue;\r\n      return;\r\n    }\r\n    this._nodes[nodeKey] = nodeValue;\r\n    this._outEdges[nodeKey] = {};\r\n    ++this._nodeCount;\r\n  };\r\n\r\n  public node = (nodeKey: string) => {\r\n    return this._nodes[nodeKey];\r\n  };\r\n\r\n  public hasNode = (nodeKey: string) => {\r\n    return nodeKey in this._nodes;\r\n  };\r\n\r\n  public edgeCount = () => {\r\n    return this._edgeCount;\r\n  };\r\n\r\n  public edges = () => {\r\n    return Object.values(this._edgeObjs);\r\n  };\r\n\r\n  public setEdge = (v: string, w: string, value: { exponent: number }) => {\r\n    const edgeId = v + this._edgeKeyDelim + w + this._edgeKeyDelim;\r\n    if (edgeId in this._edgeLabels) {\r\n      // this._edgeLabels[edgeId] = value;\r\n      // Update exponent, specific to this graph's use case\r\n      this._edgeLabels[edgeId].exponent += value.exponent;\r\n      return;\r\n    }\r\n\r\n    this._edgeLabels[edgeId] = value;\r\n    const edgeObj = {\r\n      v,\r\n      w,\r\n    };\r\n    this._edgeObjs[edgeId] = edgeObj;\r\n    // setNode should have ran first, so this.outEdges[v] shouldn't be undefined\r\n    this._outEdges[v][edgeId] = edgeObj;\r\n    this._edgeCount++;\r\n  };\r\n\r\n  public edge = (v: string, w: string) => {\r\n    const edgeId = v + this._edgeKeyDelim + w + this._edgeKeyDelim;\r\n    return this._edgeLabels[edgeId];\r\n  };\r\n\r\n  public outEdges = (v: string) => {\r\n    const outV = this._outEdges[v];\r\n    const edges = Object.values(outV);\r\n    return edges;\r\n  };\r\n}\r\n"]}

package/lib/cjs/UnitConversion/Parser.d.ts

@@ -1,9 +0,0 @@
-/** @internal */
-export interface DefinitionFragment {
-    name: string;
-    exponent: number;
-    constant: boolean;
-}
-/** @internal */
-export declare function parseDefinition(definition: string): Map<string, DefinitionFragment>;
-//# sourceMappingURL=Parser.d.ts.map

package/lib/cjs/UnitConversion/Parser.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Parser.d.ts","sourceRoot":"","sources":["../../../src/UnitConversion/Parser.ts"],"names":[],"mappings":"AAeA,gBAAgB;AAChB,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,gBAAgB;AAChB,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAwBnF"}

package/lib/cjs/UnitConversion/Parser.js

@@ -1,44 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.parseDefinition = parseDefinition;
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-const expressionRgx = /^(([A-Z]\w*:)?([A-Z]\w*|\[([A-Z]\w*:)?[A-Z]\w*\])(\(-?\d+\))?(\*(?!$)|$))+$/i;
-const tokenRgx = /(?:(\[)?((?:[A-Z]\w*:)?[A-Z]\w*)\]?)(?:\((-?\d+)\))?/i;
-const sp = "*";
-/** @internal */
-var Tokens;
-(function (Tokens) {
-    Tokens[Tokens["Bracket"] = 1] = "Bracket";
-    Tokens[Tokens["Word"] = 2] = "Word";
-    Tokens[Tokens["Exponent"] = 3] = "Exponent";
-})(Tokens || (Tokens = {}));
-/** @internal */
-function parseDefinition(definition) {
-    const unitMap = new Map();
-    if (expressionRgx.test(definition)) {
-        for (const unit of definition.split(sp)) {
-            const tokens = unit.split(tokenRgx);
-            const name = tokens[Tokens.Word];
-            const exponent = tokens[Tokens.Exponent] ? Number(tokens[Tokens.Exponent]) : 1;
-            const constant = tokens[Tokens.Bracket] !== undefined;
-            if (unitMap.has(name)) {
-                const currentDefinition = unitMap.get(name);
-                if (currentDefinition) {
-                    currentDefinition.exponent += exponent;
-                    unitMap.set(name, currentDefinition);
-                }
-            }
-            else {
-                unitMap.set(name, { name, exponent, constant });
-            }
-        }
-        return unitMap;
-    }
-    else {
-        throw new Error("Invalid definition expression.");
-    }
-}
-//# sourceMappingURL=Parser.js.map

package/lib/cjs/UnitConversion/Parser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Parser.js","sourceRoot":"","sources":["../../../src/UnitConversion/Parser.ts"],"names":[],"mappings":";;AAuBA,0CAwBC;AA/CD;;;+FAG+F;AAC/F,MAAM,aAAa,GAAG,8EAA8E,CAAC;AACrG,MAAM,QAAQ,GAAG,uDAAuD,CAAC;AACzE,MAAM,EAAE,GAAG,GAAG,CAAC;AAEf,gBAAgB;AAChB,IAAK,MAIJ;AAJD,WAAK,MAAM;IACT,yCAAW,CAAA;IACX,mCAAQ,CAAA;IACR,2CAAY,CAAA;AACd,CAAC,EAJI,MAAM,KAAN,MAAM,QAIV;AASD,gBAAgB;AAChB,SAAgB,eAAe,CAAC,UAAkB;IAChD,MAAM,OAAO,GAAoC,IAAI,GAAG,EAAE,CAAC;IAE3D,IAAI,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/E,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;YACtD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtB,MAAM,iBAAiB,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC5C,IAAI,iBAAiB,EAAE,CAAC;oBACtB,iBAAiB,CAAC,QAAQ,IAAI,QAAQ,CAAC;oBACvC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACpD,CAAC;AACH,CAAC","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\nconst expressionRgx = /^(([A-Z]\\w*:)?([A-Z]\\w*|\\[([A-Z]\\w*:)?[A-Z]\\w*\\])(\\(-?\\d+\\))?(\\*(?!$)|$))+$/i;\r\nconst tokenRgx = /(?:(\\[)?((?:[A-Z]\\w*:)?[A-Z]\\w*)\\]?)(?:\\((-?\\d+)\\))?/i;\r\nconst sp = \"*\";\r\n\r\n/** @internal */\r\nenum Tokens {\r\n  Bracket = 1,\r\n  Word = 2,\r\n  Exponent = 3,\r\n}\r\n\r\n/** @internal */\r\nexport interface DefinitionFragment {\r\n  name: string;\r\n  exponent: number;\r\n  constant: boolean;\r\n}\r\n\r\n/** @internal */\r\nexport function parseDefinition(definition: string): Map<string, DefinitionFragment> {\r\n  const unitMap: Map<string, DefinitionFragment> = new Map();\r\n\r\n  if (expressionRgx.test(definition)) {\r\n    for (const unit of definition.split(sp)) {\r\n      const tokens = unit.split(tokenRgx);\r\n      const name = tokens[Tokens.Word];\r\n      const exponent = tokens[Tokens.Exponent] ? Number(tokens[Tokens.Exponent]) : 1;\r\n      const constant = tokens[Tokens.Bracket] !== undefined;\r\n      if (unitMap.has(name)) {\r\n        const currentDefinition = unitMap.get(name);\r\n        if (currentDefinition) {\r\n          currentDefinition.exponent += exponent;\r\n          unitMap.set(name, currentDefinition);\r\n        }\r\n      } else {\r\n        unitMap.set(name, { name, exponent, constant });\r\n      }\r\n    }\r\n\r\n    return unitMap;\r\n  } else {\r\n    throw new Error(\"Invalid definition expression.\");\r\n  }\r\n}\r\n"]}

package/lib/cjs/UnitConversion/UnitConversion.d.ts

@@ -1,46 +0,0 @@
-import { Constant } from "../Metadata/Constant";
-import { Unit } from "../Metadata/Unit";
-/**
- * Class used for storing calculated conversion between two Units [[UnitConverter.calculateConversion]] and converting values from one Unit to another [[UnitConverter.evaluate]]
- * @internal
- */
-export declare class UnitConversion {
-    readonly factor: number;
-    readonly offset: number;
-    constructor(factor?: number, offset?: number);
-    /**
-     * Converts x using UnitConversion
-     * @param x Input magnitude to be converted
-     * @returns Output magnitude after conversion
-     */
-    evaluate(x: number): number;
-    /**
-     * Used to invert source's UnitConversion so that it can be composed with target's UnitConversion cleanly
-     * @internal
-     */
-    inverse(): UnitConversion;
-    /**
-     * Combines two UnitConversions
-     * Used to combine source's UnitConversion and target's UnitConversion for a final UnitConversion that can be evaluated
-     * @internal
-     */
-    compose(conversion: UnitConversion): UnitConversion;
-    /**
-     * Multiples two UnitConversions together to calculate factor during reducing
-     * @internal
-     */
-    multiply(conversion: UnitConversion): UnitConversion;
-    /**
-     * Raise UnitConversion's factor with power exponent to calculate factor during reducing
-     * @internal
-     */
-    raise(power: number): UnitConversion;
-    /** @internal */
-    static identity: UnitConversion;
-    /**
-     * Returns UnitConversion with unit's numerator and denominator in factor and unit's offset in offset for reducing
-     * @internal
-     */
-    static from(unitOrConstant: Unit | Constant): UnitConversion;
-}
-//# sourceMappingURL=UnitConversion.d.ts.map

package/lib/cjs/UnitConversion/UnitConversion.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"UnitConversion.d.ts","sourceRoot":"","sources":["../../../src/UnitConversion/UnitConversion.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAGxC;;;GAGG;AACH,qBAAa,cAAc;aACG,MAAM,EAAE,MAAM;aAAwB,MAAM,EAAE,MAAM;gBAApD,MAAM,GAAE,MAAY,EAAkB,MAAM,GAAE,MAAY;IAEtF;;;;OAIG;IACI,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIlC;;;OAGG;IACI,OAAO,IAAI,cAAc;IAKhC;;;;OAIG;IACI,OAAO,CAAC,UAAU,EAAE,cAAc,GAAG,cAAc;IAO1D;;;OAGG;IACI,QAAQ,CAAC,UAAU,EAAE,cAAc,GAAG,cAAc;IAO3D;;;OAGG;IACI,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,cAAc;IAY3C,gBAAgB;IAChB,OAAc,QAAQ,iBAAwB;IAE9C;;;OAGG;WACW,IAAI,CAAC,cAAc,EAAE,IAAI,GAAG,QAAQ,GAAG,cAAc;CAMpE"}

package/lib/cjs/UnitConversion/UnitConversion.js

@@ -1,76 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.UnitConversion = void 0;
-const Unit_1 = require("../Metadata/Unit");
-const core_quantity_1 = require("@itwin/core-quantity");
-/**
- * Class used for storing calculated conversion between two Units [[UnitConverter.calculateConversion]] and converting values from one Unit to another [[UnitConverter.evaluate]]
- * @internal
- */
-class UnitConversion {
-    factor;
-    offset;
-    constructor(factor = 1.0, offset = 0.0) {
-        this.factor = factor;
-        this.offset = offset;
-    }
-    /**
-     * Converts x using UnitConversion
-     * @param x Input magnitude to be converted
-     * @returns Output magnitude after conversion
-     */
-    evaluate(x) {
-        return this.factor * x + this.offset;
-    }
-    /**
-     * Used to invert source's UnitConversion so that it can be composed with target's UnitConversion cleanly
-     * @internal
-     */
-    inverse() {
-        const inverseFactor = 1.0 / this.factor;
-        return new UnitConversion(inverseFactor, -this.offset * inverseFactor);
-    }
-    /**
-     * Combines two UnitConversions
-     * Used to combine source's UnitConversion and target's UnitConversion for a final UnitConversion that can be evaluated
-     * @internal
-     */
-    compose(conversion) {
-        return new UnitConversion(this.factor * conversion.factor, conversion.factor * this.offset + conversion.offset);
-    }
-    /**
-     * Multiples two UnitConversions together to calculate factor during reducing
-     * @internal
-     */
-    multiply(conversion) {
-        if ((0, core_quantity_1.almostEqual)(conversion.offset, 0.0) && (0, core_quantity_1.almostEqual)(this.offset, 0.0))
-            return new UnitConversion(this.factor * conversion.factor, 0.0);
-        throw new Error("Cannot multiply two maps with non-zero offsets");
-    }
-    /**
-     * Raise UnitConversion's factor with power exponent to calculate factor during reducing
-     * @internal
-     */
-    raise(power) {
-        if ((0, core_quantity_1.almostEqual)(power, 1.0))
-            return new UnitConversion(this.factor, this.offset);
-        else if ((0, core_quantity_1.almostEqual)(power, 0.0))
-            return new UnitConversion(1.0, 0.0);
-        if ((0, core_quantity_1.almostEqual)(this.offset, 0.0))
-            return new UnitConversion(this.factor ** power, 0.0);
-        throw new Error("Cannot raise map with non-zero offset");
-    }
-    /** @internal */
-    static identity = new UnitConversion();
-    /**
-     * Returns UnitConversion with unit's numerator and denominator in factor and unit's offset in offset for reducing
-     * @internal
-     */
-    static from(unitOrConstant) {
-        if (Unit_1.Unit.isUnit(unitOrConstant))
-            return new UnitConversion(unitOrConstant.denominator / unitOrConstant.numerator, -unitOrConstant.offset);
-        return new UnitConversion(unitOrConstant.denominator / unitOrConstant.numerator, 0.0);
-    }
-}
-exports.UnitConversion = UnitConversion;
-//# sourceMappingURL=UnitConversion.js.map

package/lib/cjs/UnitConversion/UnitConversion.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"UnitConversion.js","sourceRoot":"","sources":["../../../src/UnitConversion/UnitConversion.ts"],"names":[],"mappings":";;;AAKA,2CAAwC;AACxC,wDAAmD;AAEnD;;;GAGG;AACH,MAAa,cAAc;IACG;IAAsC;IAAlE,YAA4B,SAAiB,GAAG,EAAkB,SAAiB,GAAG;QAA1D,WAAM,GAAN,MAAM,CAAc;QAAkB,WAAM,GAAN,MAAM,CAAc;IAAG,CAAC;IAE1F;;;;OAIG;IACI,QAAQ,CAAC,CAAS;QACvB,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACvC,CAAC;IAED;;;OAGG;IACI,OAAO;QACZ,MAAM,aAAa,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxC,OAAO,IAAI,cAAc,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC;IACzE,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,UAA0B;QACvC,OAAO,IAAI,cAAc,CACvB,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,EAC/B,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CACpD,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,QAAQ,CAAC,UAA0B;QACxC,IAAI,IAAA,2BAAW,EAAC,UAAU,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,IAAA,2BAAW,EAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;YACtE,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAElE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IACpE,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,KAAa;QACxB,IAAI,IAAA,2BAAW,EAAC,KAAK,EAAE,GAAG,CAAC;YACzB,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;aACjD,IAAI,IAAA,2BAAW,EAAC,KAAK,EAAE,GAAG,CAAC;YAC9B,OAAO,IAAI,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEtC,IAAI,IAAA,2BAAW,EAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC;YAC/B,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE,GAAG,CAAC,CAAC;QAEvD,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC3D,CAAC;IAED,gBAAgB;IACT,MAAM,CAAC,QAAQ,GAAG,IAAI,cAAc,EAAE,CAAC;IAE9C;;;OAGG;IACI,MAAM,CAAC,IAAI,CAAC,cAA+B;QAChD,IAAI,WAAI,CAAC,MAAM,CAAC,cAAc,CAAC;YAC7B,OAAO,IAAI,cAAc,CAAC,cAAc,CAAC,WAAW,GAAG,cAAc,CAAC,SAAS,EAAE,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAE3G,OAAO,IAAI,cAAc,CAAC,cAAc,CAAC,WAAW,GAAG,cAAc,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IACxF,CAAC;;AAxEH,wCAyEC","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\nimport { Constant } from \"../Metadata/Constant\";\r\nimport { Unit } from \"../Metadata/Unit\";\r\nimport { almostEqual } from \"@itwin/core-quantity\";\r\n\r\n/**\r\n * Class used for storing calculated conversion between two Units [[UnitConverter.calculateConversion]] and converting values from one Unit to another [[UnitConverter.evaluate]]\r\n * @internal\r\n */\r\nexport class UnitConversion {\r\n  constructor(public readonly factor: number = 1.0, public readonly offset: number = 0.0) {}\r\n\r\n  /**\r\n   * Converts x using UnitConversion\r\n   * @param x Input magnitude to be converted\r\n   * @returns Output magnitude after conversion\r\n   */\r\n  public evaluate(x: number): number {\r\n    return this.factor * x + this.offset;\r\n  }\r\n\r\n  /**\r\n   * Used to invert source's UnitConversion so that it can be composed with target's UnitConversion cleanly\r\n   * @internal\r\n   */\r\n  public inverse(): UnitConversion {\r\n    const inverseFactor = 1.0 / this.factor;\r\n    return new UnitConversion(inverseFactor, -this.offset * inverseFactor);\r\n  }\r\n\r\n  /**\r\n   * Combines two UnitConversions\r\n   * Used to combine source's UnitConversion and target's UnitConversion for a final UnitConversion that can be evaluated\r\n   * @internal\r\n   */\r\n  public compose(conversion: UnitConversion): UnitConversion {\r\n    return new UnitConversion(\r\n      this.factor * conversion.factor,\r\n      conversion.factor * this.offset + conversion.offset,\r\n    );\r\n  }\r\n\r\n  /**\r\n   * Multiples two UnitConversions together to calculate factor during reducing\r\n   * @internal\r\n   */\r\n  public multiply(conversion: UnitConversion): UnitConversion {\r\n    if (almostEqual(conversion.offset, 0.0) && almostEqual(this.offset, 0.0))\r\n      return new UnitConversion(this.factor * conversion.factor, 0.0);\r\n\r\n    throw new Error(\"Cannot multiply two maps with non-zero offsets\");\r\n  }\r\n\r\n  /**\r\n   * Raise UnitConversion's factor with power exponent to calculate factor during reducing\r\n   * @internal\r\n   */\r\n  public raise(power: number): UnitConversion {\r\n    if (almostEqual(power, 1.0))\r\n      return new UnitConversion(this.factor, this.offset);\r\n    else if (almostEqual(power, 0.0))\r\n      return new UnitConversion(1.0, 0.0);\r\n\r\n    if (almostEqual(this.offset, 0.0))\r\n      return new UnitConversion(this.factor ** power, 0.0);\r\n\r\n    throw new Error(\"Cannot raise map with non-zero offset\");\r\n  }\r\n\r\n  /** @internal */\r\n  public static identity = new UnitConversion();\r\n\r\n  /**\r\n   * Returns UnitConversion with unit's numerator and denominator in factor and unit's offset in offset for reducing\r\n   * @internal\r\n   */\r\n  public static from(unitOrConstant: Unit | Constant): UnitConversion {\r\n    if (Unit.isUnit(unitOrConstant))\r\n      return new UnitConversion(unitOrConstant.denominator / unitOrConstant.numerator, -unitOrConstant.offset);\r\n\r\n    return new UnitConversion(unitOrConstant.denominator / unitOrConstant.numerator, 0.0);\r\n  }\r\n}\r\n"]}

package/lib/esm/UnitConversion/Graph.d.ts

@@ -1,35 +0,0 @@
-/** @internal */
-export declare class Graph<T> {
-    private _edgeKeyDelim;
-    private _label;
-    private _nodeCount;
-    private _edgeCount;
-    private _nodes;
-    private _edgeObjs;
-    private _edgeLabels;
-    private _outEdges;
-    constructor();
-    setGraph: (label: string) => Graph<T>;
-    graph: () => string;
-    nodeCount: () => number;
-    nodes: () => string[];
-    setNode: (nodeKey: string, nodeValue: T) => void;
-    node: (nodeKey: string) => T;
-    hasNode: (nodeKey: string) => boolean;
-    edgeCount: () => number;
-    edges: () => {
-        v: string;
-        w: string;
-    }[];
-    setEdge: (v: string, w: string, value: {
-        exponent: number;
-    }) => void;
-    edge: (v: string, w: string) => {
-        exponent: number;
-    };
-    outEdges: (v: string) => {
-        v: string;
-        w: string;
-    }[];
-}
-//# sourceMappingURL=Graph.d.ts.map

package/lib/esm/UnitConversion/Graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../src/UnitConversion/Graph.ts"],"names":[],"mappings":"AA8CA,gBAAgB;AAChB,qBAAa,KAAK,CAAC,CAAC;IAClB,OAAO,CAAC,aAAa,CAAU;IAC/B,OAAO,CAAC,MAAM,CAAM;IACpB,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,SAAS,CAAc;IAC/B,OAAO,CAAC,WAAW,CAAgB;IACnC,OAAO,CAAC,SAAS,CAAc;;IASxB,QAAQ,UAAW,MAAM,KAAG,KAAK,CAAC,CAAC,CAAC,CAGzC;IAEK,KAAK,eAEV;IAEK,SAAS,eAEd;IAEK,KAAK,iBAEV;IAEK,OAAO,YAAa,MAAM,aAAa,CAAC,UAQ7C;IAEK,IAAI,YAAa,MAAM,OAE5B;IAEK,OAAO,YAAa,MAAM,aAE/B;IAEK,SAAS,eAEd;IAEK,KAAK;WAnFP,MAAM;WACN,MAAM;QAoFT;IAEK,OAAO,MAAO,MAAM,KAAK,MAAM,SAAS;QAAE,QAAQ,EAAE,MAAM,CAAA;KAAE,UAkBjE;IAEK,IAAI,MAAO,MAAM,KAAK,MAAM;kBAjGP,MAAM;MAoGhC;IAEK,QAAQ,MAAO,MAAM;WA5FrB,MAAM;WACN,MAAM;QA+FX;CACH"}

package/lib/esm/UnitConversion/Graph.js

@@ -1,84 +0,0 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-// Following https://github.com/dagrejs/graphlib/blob/master/lib/graph.js
-/** @internal */
-export class Graph {
-    _edgeKeyDelim = "\x01";
-    _label = "";
-    _nodeCount = 0;
-    _edgeCount = 0;
-    _nodes;
-    _edgeObjs;
-    _edgeLabels;
-    _outEdges;
-    constructor() {
-        this._nodes = {};
-        this._edgeObjs = {};
-        this._edgeLabels = {};
-        this._outEdges = {};
-    }
-    setGraph = (label) => {
-        this._label = label;
-        return this;
-    };
-    graph = () => {
-        return this._label;
-    };
-    nodeCount = () => {
-        return this._nodeCount;
-    };
-    nodes = () => {
-        return Object.keys(this._nodes);
-    };
-    setNode = (nodeKey, nodeValue) => {
-        if (nodeKey in this._nodes) {
-            this._nodes[nodeKey] = nodeValue;
-            return;
-        }
-        this._nodes[nodeKey] = nodeValue;
-        this._outEdges[nodeKey] = {};
-        ++this._nodeCount;
-    };
-    node = (nodeKey) => {
-        return this._nodes[nodeKey];
-    };
-    hasNode = (nodeKey) => {
-        return nodeKey in this._nodes;
-    };
-    edgeCount = () => {
-        return this._edgeCount;
-    };
-    edges = () => {
-        return Object.values(this._edgeObjs);
-    };
-    setEdge = (v, w, value) => {
-        const edgeId = v + this._edgeKeyDelim + w + this._edgeKeyDelim;
-        if (edgeId in this._edgeLabels) {
-            // this._edgeLabels[edgeId] = value;
-            // Update exponent, specific to this graph's use case
-            this._edgeLabels[edgeId].exponent += value.exponent;
-            return;
-        }
-        this._edgeLabels[edgeId] = value;
-        const edgeObj = {
-            v,
-            w,
-        };
-        this._edgeObjs[edgeId] = edgeObj;
-        // setNode should have ran first, so this.outEdges[v] shouldn't be undefined
-        this._outEdges[v][edgeId] = edgeObj;
-        this._edgeCount++;
-    };
-    edge = (v, w) => {
-        const edgeId = v + this._edgeKeyDelim + w + this._edgeKeyDelim;
-        return this._edgeLabels[edgeId];
-    };
-    outEdges = (v) => {
-        const outV = this._outEdges[v];
-        const edges = Object.values(outV);
-        return edges;
-    };
-}
-//# sourceMappingURL=Graph.js.map

package/lib/esm/UnitConversion/Graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../../../src/UnitConversion/Graph.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,yEAAyE;AA0CzE,gBAAgB;AAChB,MAAM,OAAO,KAAK;IACR,aAAa,GAAG,MAAM,CAAC;IACvB,MAAM,GAAG,EAAE,CAAC;IACZ,UAAU,GAAG,CAAC,CAAC;IACf,UAAU,GAAG,CAAC,CAAC;IACf,MAAM,CAAc;IACpB,SAAS,CAAc;IACvB,WAAW,CAAgB;IAC3B,SAAS,CAAc;IAE/B;QACE,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IAEM,QAAQ,GAAG,CAAC,KAAa,EAAY,EAAE;QAC5C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEK,KAAK,GAAG,GAAG,EAAE;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC,CAAC;IAEK,SAAS,GAAG,GAAG,EAAE;QACtB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC,CAAC;IAEK,KAAK,GAAG,GAAG,EAAE;QAClB,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC,CAAC;IAEK,OAAO,GAAG,CAAC,OAAe,EAAE,SAAY,EAAE,EAAE;QACjD,IAAI,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;YACjC,OAAO;QACT,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;QACjC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QAC7B,EAAE,IAAI,CAAC,UAAU,CAAC;IACpB,CAAC,CAAC;IAEK,IAAI,GAAG,CAAC,OAAe,EAAE,EAAE;QAChC,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC,CAAC;IAEK,OAAO,GAAG,CAAC,OAAe,EAAE,EAAE;QACnC,OAAO,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC;IAChC,CAAC,CAAC;IAEK,SAAS,GAAG,GAAG,EAAE;QACtB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC,CAAC;IAEK,KAAK,GAAG,GAAG,EAAE;QAClB,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACvC,CAAC,CAAC;IAEK,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,KAA2B,EAAE,EAAE;QACrE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QAC/D,IAAI,MAAM,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAC/B,oCAAoC;YACpC,qDAAqD;YACrD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC;YACpD,OAAO;QACT,CAAC;QAED,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;QACjC,MAAM,OAAO,GAAG;YACd,CAAC;YACD,CAAC;SACF,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;QACjC,4EAA4E;QAC5E,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;QACpC,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC,CAAC;IAEK,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACrC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QAC/D,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC,CAAC;IAEK,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;CACH","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// Following https://github.com/dagrejs/graphlib/blob/master/lib/graph.js\r\n\r\n/**\r\n * Using generics for nodes - T represents Unit | Constant in our use case\r\n * @internal\r\n */\r\ninterface NodesMap<T> {\r\n  [node: string]: T;\r\n}\r\n\r\n/**\r\n * Describe edges based on its node endpoints (v, w)\r\n * @internal\r\n */\r\ninterface EdgeObjsMap {\r\n  [edge: string]: {\r\n    v: string;\r\n    w: string;\r\n  };\r\n}\r\n\r\n/**\r\n * Describe edges based on the exponent they carry\r\n * @internal\r\n */\r\ninterface EdgeLabelsMap {\r\n  [edge: string]: { exponent: number };\r\n}\r\n\r\n/**\r\n * List each node with outgoing edges in outer map; describe each node's outgoing edges in inner map\r\n * @internal\r\n */\r\ninterface OutEdgesMap {\r\n  [node: string]: {\r\n    [edges: string]: {\r\n      v: string;\r\n      w: string;\r\n    };\r\n  };\r\n}\r\n\r\n/** @internal */\r\nexport class Graph<T> {\r\n  private _edgeKeyDelim = \"\\x01\";\r\n  private _label = \"\";\r\n  private _nodeCount = 0;\r\n  private _edgeCount = 0;\r\n  private _nodes: NodesMap<T>;\r\n  private _edgeObjs: EdgeObjsMap;\r\n  private _edgeLabels: EdgeLabelsMap;\r\n  private _outEdges: OutEdgesMap;\r\n\r\n  constructor() {\r\n    this._nodes = {};\r\n    this._edgeObjs = {};\r\n    this._edgeLabels = {};\r\n    this._outEdges = {};\r\n  }\r\n\r\n  public setGraph = (label: string): Graph<T> => {\r\n    this._label = label;\r\n    return this;\r\n  };\r\n\r\n  public graph = () => {\r\n    return this._label;\r\n  };\r\n\r\n  public nodeCount = () => {\r\n    return this._nodeCount;\r\n  };\r\n\r\n  public nodes = () => {\r\n    return Object.keys(this._nodes);\r\n  };\r\n\r\n  public setNode = (nodeKey: string, nodeValue: T) => {\r\n    if (nodeKey in this._nodes) {\r\n      this._nodes[nodeKey] = nodeValue;\r\n      return;\r\n    }\r\n    this._nodes[nodeKey] = nodeValue;\r\n    this._outEdges[nodeKey] = {};\r\n    ++this._nodeCount;\r\n  };\r\n\r\n  public node = (nodeKey: string) => {\r\n    return this._nodes[nodeKey];\r\n  };\r\n\r\n  public hasNode = (nodeKey: string) => {\r\n    return nodeKey in this._nodes;\r\n  };\r\n\r\n  public edgeCount = () => {\r\n    return this._edgeCount;\r\n  };\r\n\r\n  public edges = () => {\r\n    return Object.values(this._edgeObjs);\r\n  };\r\n\r\n  public setEdge = (v: string, w: string, value: { exponent: number }) => {\r\n    const edgeId = v + this._edgeKeyDelim + w + this._edgeKeyDelim;\r\n    if (edgeId in this._edgeLabels) {\r\n      // this._edgeLabels[edgeId] = value;\r\n      // Update exponent, specific to this graph's use case\r\n      this._edgeLabels[edgeId].exponent += value.exponent;\r\n      return;\r\n    }\r\n\r\n    this._edgeLabels[edgeId] = value;\r\n    const edgeObj = {\r\n      v,\r\n      w,\r\n    };\r\n    this._edgeObjs[edgeId] = edgeObj;\r\n    // setNode should have ran first, so this.outEdges[v] shouldn't be undefined\r\n    this._outEdges[v][edgeId] = edgeObj;\r\n    this._edgeCount++;\r\n  };\r\n\r\n  public edge = (v: string, w: string) => {\r\n    const edgeId = v + this._edgeKeyDelim + w + this._edgeKeyDelim;\r\n    return this._edgeLabels[edgeId];\r\n  };\r\n\r\n  public outEdges = (v: string) => {\r\n    const outV = this._outEdges[v];\r\n    const edges = Object.values(outV);\r\n    return edges;\r\n  };\r\n}\r\n"]}