@itwin/core-bentley 5.0.0-dev.8 → 5.0.0-dev.82

package/lib/cjs/Disposable.js

@@ -9,49 +9,46 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.DisposableList = void 0;
 exports.isIDisposable = isIDisposable;
+exports.isDisposable = isDisposable;
 exports.dispose = dispose;
 exports.disposeArray = disposeArray;
 exports.using = using;
+/* eslint-disable @typescript-eslint/no-deprecated */
+Symbol.dispose ??= Symbol("Symbol.dispose");
+Symbol.asyncDispose ??= Symbol("Symbol.asyncDispose");
 /**
  * A type guard that checks whether the given argument implements `IDisposable` interface
+ * @deprecated in 5.0 Use isDisposable instead.
  * @public
  */
 function isIDisposable(obj) {
     return !!obj && (obj instanceof Object) && !!obj.dispose && (typeof obj.dispose === "function");
 }
-/** Convenience function for disposing of a disposable object that may be undefined.
- * This is primarily used to simplify implementations of [[IDisposable.dispose]].
- * As a simple example:
- * ```ts
- *  class Disposable implements IDisposable {
- *    public member1?: DisposableType1;
- *    public member2?: DisposableType2;
- *
- *    public dispose() {
- *      this.member1 = dispose(this.member1); // If member1 is defined, dispose of it and set it to undefined.
- *      this.member2 = dispose(this.member2); // Likewise for member2.
- *    }
- *  }
- * ```
- * @param disposable The object to be disposed of.
- * @returns undefined
+/**
+ * A type guard that checks whether the given argument implements `Disposable` interface
  * @public
  */
+function isDisposable(obj) {
+    return !!obj && (obj instanceof Object) && !!obj[Symbol.dispose] && (typeof obj[Symbol.dispose] === "function");
+}
 function dispose(disposable) {
-    if (undefined !== disposable)
-        disposable.dispose();
+    if (undefined !== disposable) {
+        if (Symbol.dispose in disposable)
+            disposable[Symbol.dispose]();
+        else
+            disposable.dispose();
+    }
     return undefined;
 }
-/** Disposes of and empties a list of disposable objects.
- * @param list The list of disposable objects.
- * @returns undefined
- * @public
- */
 function disposeArray(list) {
     if (undefined === list)
         return undefined;
-    for (const entry of list)
-        dispose(entry);
+    for (const entry of list) {
+        if (Symbol.dispose in entry)
+            entry[Symbol.dispose]();
+        else
+            entry.dispose();
+    }
     list.length = 0;
     return undefined;
 }
@@ -60,6 +57,7 @@ function disposeArray(list) {
  * of this function is equal to return value of func. If func throws, this function also throws (after
  * disposing the resource).
  * @public
+ * @deprecated in 5.0 Use `using` declarations instead.
  */
 function using(resources, func) {
     if (!Array.isArray(resources))
@@ -80,6 +78,7 @@ function using(resources, func) {
     }
 }
 class FuncDisposable {
+    _disposeFunc;
     constructor(disposeFunc) { this._disposeFunc = disposeFunc; }
     dispose() { this._disposeFunc(); }
 }
@@ -87,6 +86,7 @@ class FuncDisposable {
  * @public
  */
 class DisposableList {
+    _disposables;
     /** Creates a disposable list. */
     constructor(disposables = []) {
         this._disposables = [];

package/lib/cjs/Disposable.js.map

@@ -1 +1 @@
-{"version":3,"file":"Disposable.js","sourceRoot":"","sources":["../../src/Disposable.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AA4BH,sCAEC;AAoBD,0BAIC;AAOD,oCASC;AAQD,sBAkBC;AAxED;;;GAGG;AACH,SAAgB,aAAa,CAAC,GAAY;IACxC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,YAAY,MAAM,CAAC,IAAI,CAAC,CAAE,GAAmB,CAAC,OAAO,IAAI,CAAC,OAAQ,GAAmB,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC;AACpI,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,OAAO,CAAC,UAAwB;IAC9C,IAAI,SAAS,KAAK,UAAU;QAC1B,UAAU,CAAC,OAAO,EAAE,CAAC;IACvB,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAAC,IAAoB;IAC/C,IAAI,SAAS,KAAK,IAAI;QACpB,OAAO,SAAS,CAAC;IAEnB,KAAK,MAAM,KAAK,IAAI,IAAI;QACtB,OAAO,CAAC,KAAK,CAAC,CAAC;IAEjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAChB,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,KAAK,CAAiC,SAAkB,EAAE,IAA4B;IACpG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;QAC3B,OAAO,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC;IAElC,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;IAChF,IAAI,wBAAwB,GAAG,IAAI,CAAC;IAEpC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QAClC,IAAI,MAAM,YAAY,OAAO,EAAE,CAAC;YAC9B,wBAAwB,GAAG,KAAK,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;YAAS,CAAC;QACT,IAAI,wBAAwB;YAC1B,SAAS,EAAE,CAAC;IAChB,CAAC;AACH,CAAC;AAOD,MAAM,cAAc;IAElB,YAAY,WAAuB,IAAI,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC;IAClE,OAAO,KAAK,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;CAC1C;AAED;;GAEG;AACH,MAAa,cAAc;IAGzB,iCAAiC;IACjC,YAAY,cAAgD,EAAE;QAC5D,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,WAAW,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,EAAE;YACjC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,YAAY,CAAC,CAA4B;QAC/C,OAAQ,CAAiB,CAAC,OAAO,KAAK,SAAS,CAAC;IAClD,CAAC;IAED,uCAAuC;IAChC,GAAG,CAAC,UAAqC;QAC9C,IAAI,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;;YAEnC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,oCAAoC;IAC7B,MAAM,CAAC,UAAuB;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,CAAC,CAAC,KAAK,GAAG;YACZ,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,uCAAuC;IAChC,OAAO;QACZ,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,YAAY;YACxC,UAAU,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;CACF;AAnCD,wCAmCC","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/** @packageDocumentation\n * @module Utils\n */\n\n/** Interface adopted by a type which has deterministic cleanup logic.\n * For example:\n *  - Most rendering-related types, such as [[RenderGraphic]] and [[Viewport]], own WebGL resources which must be explicitly released when no longer needed.\n *  - Some low-level objects like [[ECDb]] own native types defined in C++ code which must be explicitly released when no longer needed.\n *\n * A similar concept exists in languages like C++ (implemented as \"destructors\") and C# (\"IDisposable\").\n * However, because TypeScript and Javascript lack any built-in support for deterministic destruction, it is up to the programmer to ensure dispose() is called appropriately.\n * Failure to do so may result in memory leaks or leaking of other resources.\n *\n * IDisposable tends to be contagious; that is, if a type has members which implement IDisposable, that type should also implement IDisposable to dispose of those members.\n *\n * Implementations of IDisposable tend to be more \"low-level\" types. The disposal of such types is often handled on your behalf.\n * However, always consult the documentation for an IDisposable type to determine under what circumstances you are expected to explicitly dispose of it.\n * @public\n */\nexport interface IDisposable {\n  /** Disposes of any resources owned by this object.\n   * @note The object is generally considered unusable after it has been disposed of.\n   */\n  dispose(): void;\n}\n\n/**\n * A type guard that checks whether the given argument implements `IDisposable` interface\n * @public\n */\nexport function isIDisposable(obj: unknown): obj is IDisposable {\n  return !!obj && (obj instanceof Object) && !!(obj as IDisposable).dispose && (typeof (obj as IDisposable).dispose === \"function\");\n}\n\n/** Convenience function for disposing of a disposable object that may be undefined.\n * This is primarily used to simplify implementations of [[IDisposable.dispose]].\n * As a simple example:\n * ```ts\n *  class Disposable implements IDisposable {\n *    public member1?: DisposableType1;\n *    public member2?: DisposableType2;\n *\n *    public dispose() {\n *      this.member1 = dispose(this.member1); // If member1 is defined, dispose of it and set it to undefined.\n *      this.member2 = dispose(this.member2); // Likewise for member2.\n *    }\n *  }\n * ```\n * @param disposable The object to be disposed of.\n * @returns undefined\n * @public\n */\nexport function dispose(disposable?: IDisposable): undefined {\n  if (undefined !== disposable)\n    disposable.dispose();\n  return undefined;\n}\n\n/** Disposes of and empties a list of disposable objects.\n * @param list The list of disposable objects.\n * @returns undefined\n * @public\n */\nexport function disposeArray(list?: IDisposable[]): undefined {\n  if (undefined === list)\n    return undefined;\n\n  for (const entry of list)\n    dispose(entry);\n\n  list.length = 0;\n  return undefined;\n}\n\n/** A 'using' function which is a substitution for .NET's using statement. It makes sure that 'dispose'\n * is called on the resource no matter if the func returns or throws. If func returns, the return value\n * of this function is equal to return value of func. If func throws, this function also throws (after\n * disposing the resource).\n * @public\n */\nexport function using<T extends IDisposable, TResult>(resources: T | T[], func: (...r: T[]) => TResult): TResult {\n  if (!Array.isArray(resources))\n    return using([resources], func);\n\n  const doDispose = () => resources.forEach((disposable) => disposable.dispose());\n  let shouldDisposeImmediately = true;\n\n  try {\n    const result = func(...resources);\n    if (result instanceof Promise) {\n      shouldDisposeImmediately = false;\n      result.then(doDispose, doDispose);\n    }\n    return result;\n  } finally {\n    if (shouldDisposeImmediately)\n      doDispose();\n  }\n}\n\n/** A definition of function which may be called to dispose an object\n * @public\n */\nexport type DisposeFunc = () => void;\n\nclass FuncDisposable implements IDisposable {\n  private _disposeFunc: () => void;\n  constructor(disposeFunc: () => void) { this._disposeFunc = disposeFunc; }\n  public dispose() { this._disposeFunc(); }\n}\n\n/** A disposable container of disposable objects.\n * @public\n */\nexport class DisposableList implements IDisposable {\n  private _disposables: IDisposable[];\n\n  /** Creates a disposable list. */\n  constructor(disposables: Array<IDisposable | DisposeFunc> = []) {\n    this._disposables = [];\n    disposables.forEach((disposable) => {\n      this.add(disposable);\n    });\n  }\n\n  private isDisposable(x: IDisposable | DisposeFunc): x is IDisposable {\n    return (x as IDisposable).dispose !== undefined;\n  }\n\n  /** Register an object for disposal. */\n  public add(disposable: IDisposable | DisposeFunc) {\n    if (this.isDisposable(disposable))\n      this._disposables.push(disposable);\n    else\n      this._disposables.push(new FuncDisposable(disposable));\n  }\n\n  /** Unregister disposable object. */\n  public remove(disposable: IDisposable): void {\n    const idx = this._disposables.indexOf(disposable);\n    if (-1 !== idx)\n      this._disposables.splice(idx, 1);\n  }\n\n  /** Disposes all registered objects. */\n  public dispose(): void {\n    for (const disposable of this._disposables)\n      disposable.dispose();\n  }\n}\n"]}
+{"version":3,"file":"Disposable.js","sourceRoot":"","sources":["../../src/Disposable.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAkCH,sCAEC;AAMD,oCAEC;AA0BD,0BAQC;AAaD,oCAaC;AASD,sBAkBC;AAjID,qDAAqD;AACpD,MAAc,CAAC,OAAO,KAAK,MAAM,CAAC,gBAAgB,CAAC,CAAC;AACpD,MAAc,CAAC,YAAY,KAAK,MAAM,CAAC,qBAAqB,CAAC,CAAC;AAyB/D;;;;GAIG;AACH,SAAgB,aAAa,CAAC,GAAY;IACxC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,YAAY,MAAM,CAAC,IAAI,CAAC,CAAE,GAAmB,CAAC,OAAO,IAAI,CAAC,OAAQ,GAAmB,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC;AACpI,CAAC;AAED;;;GAGG;AACH,SAAgB,YAAY,CAAC,GAAY;IACvC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,YAAY,MAAM,CAAC,IAAI,CAAC,CAAE,GAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAQ,GAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,UAAU,CAAC,CAAC;AAClJ,CAAC;AA0BD,SAAgB,OAAO,CAAC,UAAqC;IAC3D,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;QAC7B,IAAI,MAAM,CAAC,OAAO,IAAI,UAAU;YAC9B,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;;YAE7B,UAAU,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAaD,SAAgB,YAAY,CAAC,IAAmC;IAC9D,IAAI,SAAS,KAAK,IAAI;QACpB,OAAO,SAAS,CAAC;IAEnB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,MAAM,CAAC,OAAO,IAAI,KAAK;YACzB,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;;YAExB,KAAK,CAAC,OAAO,EAAE,CAAC;IACpB,CAAC;IAED,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAChB,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,KAAK,CAAiC,SAAkB,EAAE,IAA4B;IACpG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;QAC3B,OAAO,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC;IAElC,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;IAChF,IAAI,wBAAwB,GAAG,IAAI,CAAC;IAEpC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QAClC,IAAI,MAAM,YAAY,OAAO,EAAE,CAAC;YAC9B,wBAAwB,GAAG,KAAK,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;YAAS,CAAC;QACT,IAAI,wBAAwB;YAC1B,SAAS,EAAE,CAAC;IAChB,CAAC;AACH,CAAC;AAOD,MAAM,cAAc;IACV,YAAY,CAAa;IACjC,YAAY,WAAuB,IAAI,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC;IAClE,OAAO,KAAK,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;CAC1C;AAED;;GAEG;AACH,MAAa,cAAc;IACjB,YAAY,CAAgB;IAEpC,iCAAiC;IACjC,YAAY,cAAgD,EAAE;QAC5D,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,WAAW,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,EAAE;YACjC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,YAAY,CAAC,CAA4B;QAC/C,OAAQ,CAAiB,CAAC,OAAO,KAAK,SAAS,CAAC;IAClD,CAAC;IAED,uCAAuC;IAChC,GAAG,CAAC,UAAqC;QAC9C,IAAI,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;;YAEnC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,oCAAoC;IAC7B,MAAM,CAAC,UAAuB;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,CAAC,CAAC,KAAK,GAAG;YACZ,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,uCAAuC;IAChC,OAAO;QACZ,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,YAAY;YACxC,UAAU,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;CACF;AAnCD,wCAmCC","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/** @packageDocumentation\n * @module Utils\n */\n\n/* eslint-disable @typescript-eslint/no-deprecated */\n(Symbol as any).dispose ??= Symbol(\"Symbol.dispose\");\n(Symbol as any).asyncDispose ??= Symbol(\"Symbol.asyncDispose\");\n\n/** Interface adopted by a type which has deterministic cleanup logic.\n * For example:\n *  - Most rendering-related types, such as [[RenderGraphic]] and [[Viewport]], own WebGL resources which must be explicitly released when no longer needed.\n *  - Some low-level objects like [[ECDb]] own native types defined in C++ code which must be explicitly released when no longer needed.\n *\n * A similar concept exists in languages like C++ (implemented as \"destructors\") and C# (\"IDisposable\").\n * However, because TypeScript and Javascript lack any built-in support for deterministic destruction, it is up to the programmer to ensure dispose() is called appropriately.\n * Failure to do so may result in memory leaks or leaking of other resources.\n *\n * IDisposable tends to be contagious; that is, if a type has members which implement IDisposable, that type should also implement IDisposable to dispose of those members.\n *\n * Implementations of IDisposable tend to be more \"low-level\" types. The disposal of such types is often handled on your behalf.\n * However, always consult the documentation for an IDisposable type to determine under what circumstances you are expected to explicitly dispose of it.\n * @deprecated in 5.0 Use builtin Disposable type instead.\n * @public\n */\nexport interface IDisposable {\n  /** Disposes of any resources owned by this object.\n   * @note The object is generally considered unusable after it has been disposed of.\n   */\n  dispose(): void;\n}\n\n/**\n * A type guard that checks whether the given argument implements `IDisposable` interface\n * @deprecated in 5.0 Use isDisposable instead.\n * @public\n */\nexport function isIDisposable(obj: unknown): obj is IDisposable {\n  return !!obj && (obj instanceof Object) && !!(obj as IDisposable).dispose && (typeof (obj as IDisposable).dispose === \"function\");\n}\n\n/**\n * A type guard that checks whether the given argument implements `Disposable` interface\n * @public\n */\nexport function isDisposable(obj: unknown): obj is Disposable {\n  return !!obj && (obj instanceof Object) && !!(obj as Disposable)[Symbol.dispose] && (typeof (obj as Disposable)[Symbol.dispose] === \"function\");\n}\n\n/** Convenience function for disposing of a disposable object that may be undefined.\n * This is primarily used to simplify implementations of [[IDisposable.dispose]].\n * As a simple example:\n * ```ts\n *  class Disposable implements IDisposable {\n *    public member1?: DisposableType1;\n *    public member2?: DisposableType2;\n *\n *    public dispose() {\n *      this.member1 = dispose(this.member1); // If member1 is defined, dispose of it and set it to undefined.\n *      this.member2 = dispose(this.member2); // Likewise for member2.\n *    }\n *  }\n * ```\n * @param disposable The object to be disposed of.\n * @returns undefined\n * @public\n */\nexport function dispose(disposable?: Disposable): undefined;\n/**\n * @deprecated in 5.0 Use builtin Disposable type instead.\n * @public\n */\nexport function dispose(disposable?: IDisposable): undefined; // eslint-disable-line @typescript-eslint/unified-signatures\nexport function dispose(disposable?: Disposable | IDisposable): undefined {\n  if (undefined !== disposable) {\n    if (Symbol.dispose in disposable)\n      disposable[Symbol.dispose]();\n    else\n      disposable.dispose();\n  }\n  return undefined;\n}\n\n/** Disposes of and empties a list of disposable objects.\n * @param list The list of disposable objects.\n * @returns undefined\n * @public\n */\nexport function disposeArray(list?: Disposable[]): undefined;\n/**\n * @deprecated in 5.0 Use builtin Disposable type instead.\n * @public\n */\nexport function disposeArray(list?: IDisposable[]): undefined; // eslint-disable-line @typescript-eslint/unified-signatures\nexport function disposeArray(list?: Disposable[] | IDisposable[]): undefined {\n  if (undefined === list)\n    return undefined;\n\n  for (const entry of list) {\n    if (Symbol.dispose in entry)\n      entry[Symbol.dispose]();\n    else\n      entry.dispose();\n  }\n\n  list.length = 0;\n  return undefined;\n}\n\n/** A 'using' function which is a substitution for .NET's using statement. It makes sure that 'dispose'\n * is called on the resource no matter if the func returns or throws. If func returns, the return value\n * of this function is equal to return value of func. If func throws, this function also throws (after\n * disposing the resource).\n * @public\n * @deprecated in 5.0 Use `using` declarations instead.\n */\nexport function using<T extends IDisposable, TResult>(resources: T | T[], func: (...r: T[]) => TResult): TResult {\n  if (!Array.isArray(resources))\n    return using([resources], func);\n\n  const doDispose = () => resources.forEach((disposable) => disposable.dispose());\n  let shouldDisposeImmediately = true;\n\n  try {\n    const result = func(...resources);\n    if (result instanceof Promise) {\n      shouldDisposeImmediately = false;\n      result.then(doDispose, doDispose);\n    }\n    return result;\n  } finally {\n    if (shouldDisposeImmediately)\n      doDispose();\n  }\n}\n\n/** A definition of function which may be called to dispose an object\n * @public\n */\nexport type DisposeFunc = () => void;\n\nclass FuncDisposable implements IDisposable {\n  private _disposeFunc: () => void;\n  constructor(disposeFunc: () => void) { this._disposeFunc = disposeFunc; }\n  public dispose() { this._disposeFunc(); }\n}\n\n/** A disposable container of disposable objects.\n * @public\n */\nexport class DisposableList implements IDisposable {\n  private _disposables: IDisposable[];\n\n  /** Creates a disposable list. */\n  constructor(disposables: Array<IDisposable | DisposeFunc> = []) {\n    this._disposables = [];\n    disposables.forEach((disposable) => {\n      this.add(disposable);\n    });\n  }\n\n  private isDisposable(x: IDisposable | DisposeFunc): x is IDisposable {\n    return (x as IDisposable).dispose !== undefined;\n  }\n\n  /** Register an object for disposal. */\n  public add(disposable: IDisposable | DisposeFunc) {\n    if (this.isDisposable(disposable))\n      this._disposables.push(disposable);\n    else\n      this._disposables.push(new FuncDisposable(disposable));\n  }\n\n  /** Unregister disposable object. */\n  public remove(disposable: IDisposable): void {\n    const idx = this._disposables.indexOf(disposable);\n    if (-1 !== idx)\n      this._disposables.splice(idx, 1);\n  }\n\n  /** Disposes all registered objects. */\n  public dispose(): void {\n    for (const disposable of this._disposables)\n      disposable.dispose();\n  }\n}\n"]}

package/lib/cjs/Id.d.ts

@@ -276,10 +276,6 @@ export declare class TransientIdSequence {
      * Each call to [[getNext]] increments this by 1 and uses it as the local Id of the generated [[Id64String]].
      */
     get currentLocalId(): number;
-    /** Generate and return the next transient Id64String in the sequence.
-     * @deprecated in 3.x. Use [[getNext]].
-     */
-    get next(): Id64String;
     /** Generate and return the next transient Id64String in the sequence. */
     getNext(): Id64String;
     /** Preview the transient Id64String that will be returned by the next call to [[getNext]].

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

@@ -1 +1 @@
-{"version":3,"file":"Id.d.ts","sourceRoot":"","sources":["../../src/Id.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;GAEG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;AAEtC;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,UAAU,EAAE,CAAC;AAErC;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG,UAAU,GAAG,OAAO,GAAG,SAAS,CAAC;AAiCvD;;;;;;;;GAQG;AACH,yBAAiB,IAAI,CAAC;IACpB,2GAA2G;IAC3G,SAAgB,UAAU,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAOjD;IAED,6GAA6G;IAC7G,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAMrD;IAED;;;;;OAKG;IACH,SAAgB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,UAAU,CAElD;IAED;;;;;;OAMG;IACH,SAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,CAyBlD;IAiBD;;;;;OAKG;IACH,SAAgB,wBAAwB,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,UAAU,CAYzF;IA+CD;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,UAAU,CA8B9E;IAED;;OAEG;IACH,SAAgB,oBAAoB,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAEjE;IAED;;OAEG;IACH,SAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAG9E;IAED;;;;;OAKG;IACH,UAAiB,UAAU;QACzB,+CAA+C;QAC/C,KAAK,EAAE,MAAM,CAAC;QACd,+CAA+C;QAC/C,KAAK,EAAE,MAAM,CAAC;KACf;IAED;;;;OAIG;IACH,SAAgB,aAAa,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,UAAU,CAO1E;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAOrD;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAMrD;IAED;;;;;;;;;;;;OAYG;IACH,SAAgB,OAAO,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,GAAE,OAAe,GAAG,OAAO,CAexE;IAED;;OAEG;IACH,SAAiB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAO5D;IAED;;;;;;OAMG;IACH,SAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAI3D;IAED,yDAAyD;IACzD,SAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,UAAU,CAEjD;IAED,0EAA0E;IAC1E,SAAgB,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAE3C;IAED,iEAAiE;IACjE,SAAgB,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,GAAG,OAAO,CAOzD;IAED,kDAAkD;IAC3C,MAAM,OAAO,MAAM,CAAC;IAE3B;;;;;;OAMG;IACH,SAAgB,WAAW,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAGnD;IAED;;;;OAIG;IACH,SAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAEnD;IAED;;;;OAIG;IACH,SAAgB,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAsC1C;IAED;;;;OAIG;IACH,SAAgB,OAAO,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAE/C;IAED;;;OAGG;IACH,SAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAE/C;IAED;;OAEG;IACH,SAAgB,SAAS,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAEjD;IAED;;;;;;;;;OASG;IACH,MAAa,SAAS;QACpB,SAAS,CAAC,QAAQ,CAAC,IAAI,2BAAkC;QAEzD;;WAEG;oBACgB,GAAG,CAAC,EAAE,OAAO;QAKhC,qEAAqE;QAC9D,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;QAyBxC,uCAAuC;QAChC,KAAK,IAAI,IAAI;QAIpB,4BAA4B;QACrB,KAAK,CAAC,EAAE,EAAE,UAAU,GAAG,IAAI;QAIlC,wCAAwC;QACjC,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;QAKjC,yDAAyD;QAClD,KAAK,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO;QAErC,4BAA4B;QACrB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;QAU3C,iCAAiC;QAC1B,QAAQ,CAAC,EAAE,EAAE,UAAU,GAAG,IAAI;QAIrC,6CAA6C;QACtC,SAAS,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;QAKpC,iCAAiC;QAC1B,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;QAM9C,yDAAyD;QAClD,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO;QAK9C,mEAAmE;QAC5D,OAAO,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO;QAIzC,+CAA+C;QAC/C,IAAW,OAAO,IAAI,OAAO,CAAiC;QAE9D,sDAAsD;QACtD,IAAW,IAAI,IAAI,MAAM,CAMxB;QAED,sEAAsE;QAC/D,WAAW,IAAI,SAAS;QAS/B,mEAAmE;QAC5D,SAAS,IAAI,OAAO;QAS3B,sDAAsD;QAC/C,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;KAK7D;IAED;;;OAGG;IACH,MAAa,SAAS,CAAC,CAAC;QACtB,SAAS,CAAC,QAAQ,CAAC,IAAI,8BAAqC;QAE5D,uCAAuC;QAChC,KAAK,IAAI,IAAI;QACpB,sCAAsC;QAC/B,OAAO,CAAC,EAAE,EAAE,UAAU,GAAG,CAAC,GAAG,SAAS;QAC7C,qCAAqC;QAC9B,OAAO,CAAC,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;QAE9C,gDAAgD;QACzC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;QAUrD,kDAAkD;QAC3C,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;QAKpD,mDAAmD;QACnD,IAAW,OAAO,IAAI,OAAO,CAAiC;QAC9D,gDAAgD;QAChD,IAAW,IAAI,IAAI,MAAM,CAMxB;QAED,yDAAyD;QAClD,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;KAKvE;CACF;AAED;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACvC,0EAA0E;IAC1E,cAAc,EAAE,MAAM,CAAC;IACvB;;;OAGG;IACH,cAAc,EAAE,MAAM,CAAC;CACxB;AAQD;;;;EAIE;AACF,MAAM,MAAM,qBAAqB,GAAG,CAAC,aAAa,EAAE,MAAM,KAAK,MAAM,CAAC;AAEtE;;;;;GAKG;AACH,qBAAa,mBAAmB;IAC9B,sGAAsG;IACtG,SAAgB,cAAc,EAAE,MAAM,CAAC;IACvC,OAAO,CAAC,QAAQ,CAAS;IAEzB;;OAEG;gBACgB,cAAc,SAAI;IAMrC;;;OAGG;IACH,IAAW,cAAc,IAAI,MAAM,CAElC;IAED;;OAEG;IACH,IAAW,IAAI,IAAI,UAAU,CAE5B;IAED,yEAAyE;IAClE,OAAO,IAAI,UAAU;IAI5B;;OAEG;IACI,QAAQ,IAAI,UAAU;IAI7B,wDAAwD;IACjD,MAAM,IAAI,wBAAwB;IAOzC,sDAAsD;WACxC,QAAQ,CAAC,KAAK,EAAE,wBAAwB,GAAG,mBAAmB;IAO5E;;;OAGG;IACI,IAAI,IAAI,wBAAwB;IAOvC;;;;;OAKG;IACI,KAAK,CAAC,MAAM,EAAE,wBAAwB,GAAG,CAAC,aAAa,EAAE,MAAM,KAAK,MAAM;CAyBlF;AAED;;;;;;GAMG;AACH,yBAAiB,IAAI,CAAC;IAGpB,qEAAqE;IAC9D,MAAM,KAAK,EAAE,UAAmD,CAAC;IAExE;;OAEG;IACH,SAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE7C;IAED,mEAAmE;IACnE,SAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE/C;IAED,iCAAiC;IACjC,SAAgB,WAAW,IAAI,UAAU,CAOxC;IAED;;;;;;;OAOG;IACH,SAAgB,SAAS,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU,CAkBvD;CACF"}
+{"version":3,"file":"Id.d.ts","sourceRoot":"","sources":["../../src/Id.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;GAEG;AACH,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC;AAEhC;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC;AAEtC;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,UAAU,EAAE,CAAC;AAErC;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG,UAAU,GAAG,OAAO,GAAG,SAAS,CAAC;AAiCvD;;;;;;;;GAQG;AACH,yBAAiB,IAAI,CAAC;IACpB,2GAA2G;IAC3G,SAAgB,UAAU,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAOjD;IAED,6GAA6G;IAC7G,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAMrD;IAED;;;;;OAKG;IACH,SAAgB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,UAAU,CAElD;IAED;;;;;;OAMG;IACH,SAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU,CAyBlD;IAiBD;;;;;OAKG;IACH,SAAgB,wBAAwB,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,UAAU,CAYzF;IA+CD;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,UAAU,CA8B9E;IAED;;OAEG;IACH,SAAgB,oBAAoB,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAEjE;IAED;;OAEG;IACH,SAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAG9E;IAED;;;;;OAKG;IACH,UAAiB,UAAU;QACzB,+CAA+C;QAC/C,KAAK,EAAE,MAAM,CAAC;QACd,+CAA+C;QAC/C,KAAK,EAAE,MAAM,CAAC;KACf;IAED;;;;OAIG;IACH,SAAgB,aAAa,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,UAAU,CAO1E;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAOrD;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAMrD;IAED;;;;;;;;;;;;OAYG;IACH,SAAgB,OAAO,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,GAAE,OAAe,GAAG,OAAO,CAexE;IAED;;OAEG;IACH,SAAiB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAO5D;IAED;;;;;;OAMG;IACH,SAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAI3D;IAED,yDAAyD;IACzD,SAAgB,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,UAAU,CAEjD;IAED,0EAA0E;IAC1E,SAAgB,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAE3C;IAED,iEAAiE;IACjE,SAAgB,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,GAAG,OAAO,CAOzD;IAED,kDAAkD;IAC3C,MAAM,OAAO,MAAM,CAAC;IAE3B;;;;;;OAMG;IACH,SAAgB,WAAW,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAGnD;IAED;;;;OAIG;IACH,SAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAEnD;IAED;;;;OAIG;IACH,SAAgB,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAsC1C;IAED;;;;OAIG;IACH,SAAgB,OAAO,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAE/C;IAED;;;OAGG;IACH,SAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAE/C;IAED;;OAEG;IACH,SAAgB,SAAS,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO,CAEjD;IAED;;;;;;;;;OASG;IACH,MAAa,SAAS;QACpB,SAAS,CAAC,QAAQ,CAAC,IAAI,2BAAkC;QAEzD;;WAEG;oBACgB,GAAG,CAAC,EAAE,OAAO;QAKhC,qEAAqE;QAC9D,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;QAyBxC,uCAAuC;QAChC,KAAK,IAAI,IAAI;QAIpB,4BAA4B;QACrB,KAAK,CAAC,EAAE,EAAE,UAAU,GAAG,IAAI;QAIlC,wCAAwC;QACjC,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;QAKjC,yDAAyD;QAClD,KAAK,CAAC,EAAE,EAAE,UAAU,GAAG,OAAO;QAErC,4BAA4B;QACrB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;QAU3C,iCAAiC;QAC1B,QAAQ,CAAC,EAAE,EAAE,UAAU,GAAG,IAAI;QAIrC,6CAA6C;QACtC,SAAS,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI;QAKpC,iCAAiC;QAC1B,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;QAS9C,yDAAyD;QAClD,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO;QAK9C,mEAAmE;QAC5D,OAAO,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO;QAIzC,+CAA+C;QAC/C,IAAW,OAAO,IAAI,OAAO,CAAiC;QAE9D,sDAAsD;QACtD,IAAW,IAAI,IAAI,MAAM,CAMxB;QAED,sEAAsE;QAC/D,WAAW,IAAI,SAAS;QAS/B,mEAAmE;QAC5D,SAAS,IAAI,OAAO;QAS3B,sDAAsD;QAC/C,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;KAK7D;IAED;;;OAGG;IACH,MAAa,SAAS,CAAC,CAAC;QACtB,SAAS,CAAC,QAAQ,CAAC,IAAI,8BAAqC;QAE5D,uCAAuC;QAChC,KAAK,IAAI,IAAI;QACpB,sCAAsC;QAC/B,OAAO,CAAC,EAAE,EAAE,UAAU,GAAG,CAAC,GAAG,SAAS;QAC7C,qCAAqC;QAC9B,OAAO,CAAC,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;QAE9C,gDAAgD;QACzC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;QAUrD,kDAAkD;QAC3C,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;QAKpD,mDAAmD;QACnD,IAAW,OAAO,IAAI,OAAO,CAAiC;QAC9D,gDAAgD;QAChD,IAAW,IAAI,IAAI,MAAM,CAMxB;QAED,yDAAyD;QAClD,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;KAKvE;CACF;AAED;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACvC,0EAA0E;IAC1E,cAAc,EAAE,MAAM,CAAC;IACvB;;;OAGG;IACH,cAAc,EAAE,MAAM,CAAC;CACxB;AAQD;;;;EAIE;AACF,MAAM,MAAM,qBAAqB,GAAG,CAAC,aAAa,EAAE,MAAM,KAAK,MAAM,CAAC;AAEtE;;;;;GAKG;AACH,qBAAa,mBAAmB;IAC9B,sGAAsG;IACtG,SAAgB,cAAc,EAAE,MAAM,CAAC;IACvC,OAAO,CAAC,QAAQ,CAAS;IAEzB;;OAEG;gBACgB,cAAc,SAAI;IAMrC;;;OAGG;IACH,IAAW,cAAc,IAAI,MAAM,CAElC;IAED,yEAAyE;IAClE,OAAO,IAAI,UAAU;IAI5B;;OAEG;IACI,QAAQ,IAAI,UAAU;IAI7B,wDAAwD;IACjD,MAAM,IAAI,wBAAwB;IAOzC,sDAAsD;WACxC,QAAQ,CAAC,KAAK,EAAE,wBAAwB,GAAG,mBAAmB;IAO5E;;;OAGG;IACI,IAAI,IAAI,wBAAwB;IAOvC;;;;;OAKG;IACI,KAAK,CAAC,MAAM,EAAE,wBAAwB,GAAG,CAAC,aAAa,EAAE,MAAM,KAAK,MAAM;CAyBlF;AAED;;;;;;GAMG;AACH,yBAAiB,IAAI,CAAC;IAGpB,qEAAqE;IAC9D,MAAM,KAAK,EAAE,UAAmD,CAAC;IAExE;;OAEG;IACH,SAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE7C;IAED,mEAAmE;IACnE,SAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE/C;IAED,iCAAiC;IACjC,SAAgB,WAAW,IAAI,UAAU,CAOxC;IAED;;;;;;;OAOG;IACH,SAAgB,SAAS,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU,CAkBvD;CACF"}

package/lib/cjs/Id.js

@@ -420,11 +420,11 @@ var Id64;
      * @public
      */
     class Uint32Set {
+        _map = new Map();
         /** Construct a new Uint32Set.
          * @param ids If supplied, all of the specified Ids will be added to the new set.
          */
         constructor(ids) {
-            this._map = new Map();
             if (undefined !== ids)
                 this.addIds(ids);
         }
@@ -485,8 +485,11 @@ var Id64;
         /** Remove an Id from the set. */
         delete(low, high) {
             const set = this._map.get(high);
-            if (undefined !== set)
+            if (undefined !== set) {
                 set.delete(low);
+                if (set.size === 0)
+                    this._map.delete(high);
+            }
         }
         /** Returns true if the set contains the specified Id. */
         has(low, high) {
@@ -535,9 +538,7 @@ var Id64;
      * @public
      */
     class Uint32Map {
-        constructor() {
-            this._map = new Map();
-        }
+        _map = new Map();
         /** Remove all entries from the map. */
         clear() { this._map.clear(); }
         /** Find an entry in the map by Id. */
@@ -588,6 +589,9 @@ function validateLocalId(num) {
  * @public
  */
 class TransientIdSequence {
+    /** The starting local Id provided to the constructor. The sequence begins at `initialLocalId + 1`. */
+    initialLocalId;
+    _localId;
     /** Constructor.
      * @param initialLocalId The starting local Id. The local Id of the first [[Id64String]] generated by [[getNext]] will be `initialLocalId + 1`.
      */
@@ -603,12 +607,6 @@ class TransientIdSequence {
     get currentLocalId() {
         return this._localId;
     }
-    /** Generate and return the next transient Id64String in the sequence.
-     * @deprecated in 3.x. Use [[getNext]].
-     */
-    get next() {
-        return this.getNext();
-    }
     /** Generate and return the next transient Id64String in the sequence. */
     getNext() {
         return Id64.fromLocalAndBriefcaseIds(++this._localId, 0xffffff);

package/lib/cjs/Id.js.map

@@ -1 +1 @@
-{"version":3,"file":"Id.js","sourceRoot":"","sources":["../../src/Id.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AA4BH,SAAS,KAAK,CAAC,GAAW;IACxB,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,0BAA0B,CAAC,GAAW,EAAE,KAAa;IAC5D,OAAO,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAW,EAAE,KAAa,EAAE,YAAqB,IAAI;IAChF,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACvC,MAAM,eAAe,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,gBAAgB;IACjE,OAAO,CAAC,QAAQ,IAAI,eAAe,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,oBAAoB;AAC1H,CAAC;AAED,SAAS,gBAAgB,CAAC,EAAU,EAAE,UAAkB,EAAE,GAAW;IACnE,IAAI,GAAG,KAAK,CAAC;QACX,OAAO,KAAK,CAAC;IAEf,uBAAuB;IACvB,IAAI,CAAC,0BAA0B,CAAC,EAAE,EAAE,UAAU,CAAC;QAC7C,OAAO,KAAK,CAAC;IAEf,qDAAqD;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,mBAAmB,CAAC,EAAE,EAAE,UAAU,GAAG,CAAC,CAAC;YAC1C,OAAO,KAAK,CAAC;IAEjB,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,IAAiB,IAAI,CA+lBpB;AA/lBD,WAAiB,IAAI;IACnB,2GAA2G;IAC3G,SAAgB,UAAU,CAAC,EAAc;QACvC,IAAI,SAAS,CAAC,EAAE,CAAC;YACf,OAAO,CAAC,CAAC;QAEX,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,OAAO,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IAChC,CAAC;IAPe,eAAU,aAOzB,CAAA;IAED,6GAA6G;IAC7G,SAAgB,cAAc,CAAC,EAAc;QAC3C,IAAI,SAAS,CAAC,EAAE,CAAC;YACf,OAAO,CAAC,CAAC;QAEX,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,OAAO,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IACxD,CAAC;IANe,mBAAc,iBAM7B,CAAA;IAED;;;;;OAKG;IACH,SAAgB,QAAQ,CAAC,IAAa;QACpC,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;IACzE,CAAC;IAFe,aAAQ,WAEvB,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,UAAU,CAAC,GAAW;QACpC,iFAAiF;QACjF,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,OAAO,KAAA,OAAO,CAAC;QAEjB,6EAA6E;QAC7E,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAClB,OAAO,GAAG,CAAC;QAEb,8DAA8D;QAC9D,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;QACvB,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG;YAC7C,OAAO,KAAA,OAAO,CAAC;QAEjB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;YACb,KAAK,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;YACnB,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;QACpC,CAAC;QAED,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAC9B,OAAO,wBAAwB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC7C,CAAC;IAzBe,eAAU,aAyBzB,CAAA;IAED,mFAAmF;IACnF,MAAM,6BAA6B,GAAG;QACpC,YAAY;QACZ,WAAW;QACX,UAAU;QACV,SAAS;QACT,QAAQ;QACR,OAAO;QACP,MAAM;QACN,KAAK;QACL,IAAI;QACJ,GAAG;QACH,EAAE;KACH,CAAC;IAEF;;;;;OAKG;IACH,SAAgB,wBAAwB,CAAC,OAAe,EAAE,WAAmB;QAC3E,8CAA8C;QAC9C,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,WAAW,KAAK,QAAQ;YAChE,OAAO,KAAA,OAAO,CAAC;QAEjB,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,OAAO;YACf,OAAO,KAAA,OAAO,CAAC;QAEjB,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACpC,OAAO,KAAK,CAAC,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,6BAA6B,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;IACpI,CAAC;IAZe,6BAAwB,2BAYvC,CAAA;IAED,qHAAqH;IACrH,MAAM,gBAAgB,GAAG;QACvB,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,MAAM;QACZ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;KACL,CAAC;IAEF,yFAAyF;IACzF,SAAS,eAAe,CAAC,KAAa;QACpC,OAAO,KAAK,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IAED,yFAAyF;IACzF,SAAS,eAAe,CAAC,IAAY;QACnC,OAAO,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IAED,qFAAqF;IACrF,SAAS,iBAAiB,CAAC,EAAc,EAAE,KAAa,EAAE,GAAW;QACnE,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,KAAK,IAAI,KAAK,CAAC;YAC5B,MAAM,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,6CAA6C;QAC/E,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,QAAgB,EAAE,SAAiB;QAChE,MAAM,UAAU,GAAG,QAAQ,KAAK,CAAC,CAAC;QAClC,MAAM,WAAW,GAAG,CAAC,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,+BAA+B;QAChG,MAAM,OAAO,GAAG,UAAU,GAAG,WAAW,CAAC,CAAC,+BAA+B;QACzE,IAAI,CAAC,KAAK,OAAO;YACf,OAAO,KAAA,OAAO,CAAC;QAEjB,6CAA6C;QAC7C,MAAM,MAAM,GAAG,gBAAgB,CAAC;QAChC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,IAAI,GAAG,GAAG,IAAI,KAAK,CAAC;YAC1B,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC;YAC3C,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK;gBAC1B,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,IAAI,GAAG,GAAG,IAAI,KAAK,CAAC;YAC1B,MAAM,KAAK,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC;YAC1C,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK;gBAC1B,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK;YACzB,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QAExB,OAAO,MAAM,CAAC,YAAY,CAAC,GAAG,gBAAgB,CAAC,CAAC;IAClD,CAAC;IA9Be,mBAAc,iBA8B7B,CAAA;IAED;;OAEG;IACH,SAAgB,oBAAoB,CAAC,IAAgB;QACnD,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAFe,yBAAoB,uBAEnC,CAAA;IAED;;OAEG;IACH,SAAgB,iBAAiB,CAAC,QAAgB,EAAE,SAAiB;QACnE,0BAA0B;QAC1B,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC;IAC1D,CAAC;IAHe,sBAAiB,oBAGhC,CAAA;IAeD;;;;OAIG;IACH,SAAgB,aAAa,CAAC,EAAc,EAAE,GAAgB;QAC5D,IAAI,CAAC,GAAG;YACN,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAE/B,GAAG,CAAC,KAAK,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAC/B,GAAG,CAAC,KAAK,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAC/B,OAAO,GAAG,CAAC;IACb,CAAC;IAPe,kBAAa,gBAO5B,CAAA;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAc;QAC3C,IAAI,SAAS,CAAC,EAAE,CAAC;YACf,OAAO,CAAC,CAAC;QAEX,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,MAAM,KAAK,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,OAAO,iBAAiB,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAC3C,CAAC;IAPe,mBAAc,iBAO7B,CAAA;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAc;QAC3C,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,IAAI,GAAG,IAAI,EAAE,IAAI,SAAS,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,CAAC;QAEX,OAAO,iBAAiB,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IANe,mBAAc,iBAM7B,CAAA;IAED;;;;;;;;;;;;OAYG;IACH,SAAgB,OAAO,CAAC,GAAY,EAAE,WAAoB,KAAK;QAC7D,IAAI,GAAG,YAAY,GAAG;YACpB,OAAO,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,CAAS,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAE/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAc,CAAC;QAClC,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aACV,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,EAAc,EAAE,EAAE;gBAC7B,IAAI,OAAO,EAAE,KAAK,QAAQ;oBACxB,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;IAfe,YAAO,UAetB,CAAA;IAED;;OAEG;IACH,QAAe,CAAC,CAAC,QAAQ,CAAC,GAAY;QACpC,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5B,MAAM,GAAG,CAAC;QACZ,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,EAAE,IAAI,GAAG;gBAClB,MAAM,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IAPgB,aAAQ,WAOxB,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,QAAQ,CAAC,GAAY;QACnC,OAAO;YACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC;SACvC,CAAC;IACJ,CAAC;IAJe,aAAQ,WAIvB,CAAA;IAED,yDAAyD;IACzD,SAAgB,QAAQ,CAAC,GAAY;QACnC,OAAO,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC;IACnH,CAAC;IAFe,aAAQ,WAEvB,CAAA;IAED,0EAA0E;IAC1E,SAAgB,MAAM,CAAC,GAAY;QACjC,OAAO,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpF,CAAC;IAFe,WAAM,SAErB,CAAA;IAED,iEAAiE;IACjE,SAAgB,GAAG,CAAC,GAAY,EAAE,EAAc;QAC9C,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,OAAO,GAAG,KAAK,EAAE,CAAC;QACpB,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YACpB,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAEhC,OAAO,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC;IAPe,QAAG,MAOlB,CAAA;IAED,kDAAkD;IACrC,YAAO,GAAG,GAAG,CAAC;IAE3B;;;;;;OAMG;IACH,SAAgB,WAAW,CAAC,EAAc;QACxC,oHAAoH;QACpH,OAAO,EAAE,KAAK,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IACvD,CAAC;IAHe,gBAAW,cAG1B,CAAA;IAED;;;;OAIG;IACH,SAAgB,eAAe,CAAC,EAAU;QACxC,OAAO,WAAW,CAAC,EAAE,CAAC,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IAFe,oBAAe,kBAE9B,CAAA;IAED;;;;OAIG;IACH,SAAgB,MAAM,CAAC,EAAU;QAC/B,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,EAAE,GAAG,GAAG;YACvB,OAAO,KAAK,CAAC;QAEf,IAAI,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;YACf,OAAO,KAAK,CAAC;QAEf,8BAA8B;QAC9B,IAAI,CAAC,KAAK,GAAG;YACX,OAAO,IAAI,CAAC;QAEd,mFAAmF;QACnF,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;YAC5B,OAAO,KAAK,CAAC;QAEf,iGAAiG;QACjG,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;YACb,YAAY,GAAG,GAAG,GAAG,EAAE,CAAC;YAExB,sBAAsB;YACtB,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;gBAC5C,OAAO,KAAK,CAAC;YAEf,kCAAkC;YAClC,KAAK,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,IAAI,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM;oBACnC,MAAM;;oBAEN,YAAY,EAAE,CAAC;YACnB,CAAC;YAED,IAAI,YAAY,IAAI,GAAG;gBACrB,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,OAAO,gBAAgB,CAAC,EAAE,EAAE,YAAY,EAAE,GAAG,GAAG,YAAY,CAAC,CAAC;IAChE,CAAC;IAtCe,WAAM,SAsCrB,CAAA;IAED;;;;OAIG;IACH,SAAgB,OAAO,CAAC,EAAc;QACpC,OAAO,IAAI,CAAC,OAAO,KAAK,EAAE,CAAC;IAC7B,CAAC;IAFe,YAAO,UAEtB,CAAA;IAED;;;OAGG;IACH,SAAgB,WAAW,CAAC,EAAU;QACpC,OAAO,IAAI,CAAC,OAAO,KAAK,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAChD,CAAC;IAFe,gBAAW,cAE1B,CAAA;IAED;;OAEG;IACH,SAAgB,SAAS,CAAC,EAAc;QACtC,OAAO,IAAI,CAAC,OAAO,KAAK,EAAE,CAAC;IAC7B,CAAC;IAFe,cAAS,YAExB,CAAA;IAED;;;;;;;;;OASG;IACH,MAAa,SAAS;QAGpB;;WAEG;QACH,YAAmB,GAAa;YALb,SAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;YAMvD,IAAI,SAAS,KAAK,GAAG;gBACnB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QAED,qEAAqE;QAC9D,MAAM,CAAC,KAAgB;YAC5B,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;gBACnB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC7B,OAAO,KAAK,CAAC;YACf,CAAC;YAED,KAAK,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACzC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACvC,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;oBACtD,OAAO,KAAK,CAAC;gBACf,CAAC;gBAED,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;oBAC9B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC3B,OAAO,KAAK,CAAC;oBACf,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;QAED,uCAAuC;QAChC,KAAK;YACV,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACpB,CAAC;QAED,4BAA4B;QACrB,KAAK,CAAC,EAAc;YACzB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC;QAED,wCAAwC;QACjC,MAAM,CAAC,GAAY;YACxB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBACjC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACnB,CAAC;QAED,yDAAyD;QAClD,KAAK,CAAC,EAAc,IAAa,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5G,4BAA4B;QACrB,GAAG,CAAC,GAAW,EAAE,IAAY;YAClC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;gBACtB,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YAED,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QAED,iCAAiC;QAC1B,QAAQ,CAAC,EAAc;YAC5B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,6CAA6C;QACtC,SAAS,CAAC,GAAY;YAC3B,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBACjC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;QAED,iCAAiC;QAC1B,MAAM,CAAC,GAAW,EAAE,IAAY;YACrC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,SAAS,KAAK,GAAG;gBACnB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;QAED,yDAAyD;QAClD,GAAG,CAAC,GAAW,EAAE,IAAY;YAClC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,SAAS,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC;QAED,mEAAmE;QAC5D,OAAO,CAAC,IAAgB;YAC7B,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;QAED,+CAA+C;QAC/C,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAE9D,sDAAsD;QACtD,IAAW,IAAI;YACb,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAExB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,sEAAsE;QAC/D,WAAW;YAChB,MAAM,GAAG,GAAc,EAAE,CAAC;YAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC;oBACxB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEjD,OAAO,GAAG,CAAC;QACb,CAAC;QAED,mEAAmE;QAC5D,SAAS;YACd,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;YAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC;oBACxB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEhD,OAAO,GAAG,CAAC;QACb,CAAC;QAED,sDAAsD;QAC/C,OAAO,CAAC,IAAsC;YACnD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC;oBACvB,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;KACF;IAtIY,cAAS,YAsIrB,CAAA;IAED;;;OAGG;IACH,MAAa,SAAS;QAAtB;YACqB,SAAI,GAAG,IAAI,GAAG,EAA0B,CAAC;QA2C9D,CAAC;QAzCC,uCAAuC;QAChC,KAAK,KAAW,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3C,sCAAsC;QAC/B,OAAO,CAAC,EAAc,IAAmB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpH,qCAAqC;QAC9B,OAAO,CAAC,EAAc,EAAE,KAAQ,IAAU,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAErH,gDAAgD;QACzC,GAAG,CAAC,GAAW,EAAE,IAAY,EAAE,KAAQ;YAC5C,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;gBACtB,GAAG,GAAG,IAAI,GAAG,EAAa,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YAED,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACtB,CAAC;QAED,kDAAkD;QAC3C,GAAG,CAAC,GAAW,EAAE,IAAY;YAClC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACtD,CAAC;QAED,mDAAmD;QACnD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9D,gDAAgD;QAChD,IAAW,IAAI;YACb,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAExB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,yDAAyD;QAClD,OAAO,CAAC,IAAgD;YAC7D,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,IAAI;gBAChC,KAAK,MAAM,UAAU,IAAI,UAAU,CAAC,CAAC,CAAC;oBACpC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;KACF;IA5CY,cAAS,YA4CrB,CAAA;AACH,CAAC,EA/lBgB,IAAI,oBAAJ,IAAI,QA+lBpB;AAgBD,SAAS,eAAe,CAAC,GAAW;IAClC,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC7D,CAAC;AACH,CAAC;AASD;;;;;GAKG;AACH,MAAa,mBAAmB;IAK9B;;OAEG;IACH,YAAmB,cAAc,GAAG,CAAC;QACnC,eAAe,CAAC,cAAc,CAAC,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,QAAQ,GAAG,cAAc,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAED,yEAAyE;IAClE,OAAO;QACZ,OAAO,IAAI,CAAC,wBAAwB,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,OAAO,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;IACpE,CAAC;IAED,wDAAwD;IACjD,MAAM;QACX,OAAO;YACL,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,cAAc,EAAE,IAAI,CAAC,cAAc;SACpC,CAAC;IACJ,CAAC;IAED,sDAAsD;IAC/C,MAAM,CAAC,QAAQ,CAAC,KAA+B;QACpD,eAAe,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QAC/D,QAAQ,CAAC,QAAQ,GAAG,KAAK,CAAC,cAAc,CAAC;QACzC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,IAAI;QACT,OAAO;YACL,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,cAAc,EAAE,IAAI,CAAC,cAAc;SACpC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,MAAgC;QAC3C,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,GAAG,MAAM,CAAC;QAElD,eAAe,CAAC,cAAc,CAAC,CAAC;QAChC,eAAe,CAAC,cAAc,CAAC,CAAC;QAEhC,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YACzC,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC7D,CAAC;QAED,IAAI,cAAc,GAAG,cAAc,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;QAC3E,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACnD,IAAI,CAAC,QAAQ,IAAI,cAAc,GAAG,cAAc,CAAC;QAEjD,OAAO,CAAC,aAAqB,EAAE,EAAE;YAC/B,IAAI,aAAa,GAAG,cAAc,IAAI,aAAa,IAAI,cAAc,EAAE,CAAC;gBACtE,OAAO,aAAa,GAAG,KAAK,CAAC;YAC/B,CAAC;YAED,OAAO,aAAa,CAAC;QACvB,CAAC,CAAC;IACJ,CAAC;CACF;AAnGD,kDAmGC;AAED;;;;;;GAMG;AACH,IAAiB,IAAI,CAuDpB;AAvDD,WAAiB,IAAI;IACnB,MAAM,WAAW,GAAG,IAAI,MAAM,CAAC,+EAA+E,CAAC,CAAC;IAEhH,qEAAqE;IACxD,UAAK,GAAe,sCAAsC,CAAC;IAExE;;OAEG;IACH,SAAgB,MAAM,CAAC,KAAa;QAClC,OAAO,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAFe,WAAM,SAErB,CAAA;IAED,mEAAmE;IACnE,SAAgB,QAAQ,CAAC,KAAa;QACpC,OAAO,wFAAwF,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9G,CAAC;IAFe,aAAQ,WAEvB,CAAA;IAED,iCAAiC;IACjC,SAAgB,WAAW;QACzB,4EAA4E;QAC5E,OAAO,sCAAsC,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE;YACnE,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;YAC1C,OAAO,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC,CAAC,CAAC;IACL,CAAC;IAPe,gBAAW,cAO1B,CAAA;IAED;;;;;;;OAOG;IACH,SAAgB,SAAS,CAAC,KAAiB;QACzC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;QAE9C,gDAAgD;QAChD,IAAI,MAAM,CAAC,UAAU,CAAC;YACpB,OAAO,UAAU,CAAC;QAEpB,gHAAgH;QAChH,MAAM,WAAW,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACjD,MAAM,aAAa,GAAG,sEAAsE,CAAC;QAC7F,IAAI,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YACpC,OAAO,WAAW,CAAC,OAAO,CAAC,aAAa,EACtC,CAAC,MAAc,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAE,CAC7E,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,8DAA8D;QAC9D,OAAO,KAAK,CAAC;IACf,CAAC;IAlBe,cAAS,YAkBxB,CAAA;AACH,CAAC,EAvDgB,IAAI,oBAAJ,IAAI,QAuDpB","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/** @packageDocumentation\n * @module Ids\n */\n\n/** A string containing a well-formed string representation of an [Id64]($core-bentley).\n * See [Working with Ids]($docs/learning/common/Id64.md).\n * @public\n */\nexport type Id64String = string;\n\n/** A string containing a well-formed string representation of a [Guid]($core-bentley).\n * @public\n */\nexport type GuidString = string;\n\n/** A set of [[Id64String]]s.\n * @public\n */\nexport type Id64Set = Set<Id64String>;\n\n/** An array of [[Id64String]]s.\n * @public\n */\nexport type Id64Array = Id64String[];\n\n/** Used as an argument to a function that can accept one or more [[Id64String]]s.\n * @public\n */\nexport type Id64Arg = Id64String | Id64Set | Id64Array;\n\nfunction toHex(str: string): number {\n  const v = parseInt(str, 16);\n  return Number.isNaN(v) ? 0 : v;\n}\n\nfunction isLowerCaseNonZeroHexDigit(str: string, index: number) {\n  return isLowerCaseHexDigit(str, index, false);\n}\n\nfunction isLowerCaseHexDigit(str: string, index: number, allowZero: boolean = true): boolean {\n  const charCode = str.charCodeAt(index);\n  const minDecimalDigit = allowZero ? 0x30 : 0x31; // '0' or '1'...\n  return (charCode >= minDecimalDigit && charCode <= 0x39) || (charCode >= 0x61 && charCode <= 0x66); //  '0'-'9, 'a' -'f'\n}\n\nfunction isValidHexString(id: string, startIndex: number, len: number) {\n  if (len === 0)\n    return false;\n\n  // No leading zeroes...\n  if (!isLowerCaseNonZeroHexDigit(id, startIndex))\n    return false;\n\n  // ...followed by len-1 lowercase hexadecimal digits.\n  for (let i = 1; i < len; i++)\n    if (!isLowerCaseHexDigit(id, startIndex + i))\n      return false;\n\n  return true;\n}\n\n/**\n * The Id64 namespace provides facilities for working with 64-bit identifiers. These Ids are stored as 64-bit integers inside an [[IModelDb]], but must be represented\n * as strings in JavaScript because JavaScript does not intrinsically support 64-bit integers.\n *\n * The [[Id64String]] type alias is used to indicate function arguments, return types, and variables which are known to contain a well-formed representation of a 64-bit Id.\n *\n * See [Working with Ids]($docs/learning/common/Id64.md) for a detailed description and code examples.\n * @public\n */\nexport namespace Id64 {\n  /** Extract the \"local\" Id portion of an Id64String, contained in the lower 40 bits of the 64-bit value. */\n  export function getLocalId(id: Id64String): number {\n    if (isInvalid(id))\n      return 0;\n\n    const len = id.length;\n    const start = (len > 12) ? (len - 10) : 2;\n    return toHex(id.slice(start));\n  }\n\n  /** Extract the briefcase Id portion of an Id64String, contained in the upper 24 bits of the 64-bit value. */\n  export function getBriefcaseId(id: Id64String): number {\n    if (isInvalid(id))\n      return 0;\n\n    const len = id.length;\n    return (len <= 12) ? 0 : toHex(id.slice(2, len - 10));\n  }\n\n  /** Create an Id64String from its JSON representation.\n   * @param prop The JSON representation of an Id.\n   * @returns A well-formed Id string.\n   * @note if the input is undefined, the result is \"0\", indicating an invalid Id.\n   * @note if the input is not undefined, the result is the same as that of [[Id64.fromString]].\n   */\n  export function fromJSON(prop?: string): Id64String {\n    return typeof prop === \"string\" ? Id64.fromString(prop) : Id64.invalid;\n  }\n\n  /** Given a string value, attempt to normalize it into a well-formed Id string.\n   * If the input is already a well-formed Id string, it is returned unmodified.\n   * Otherwise, the input is trimmed of leading and trailing whitespace, converted to lowercase, and an attempt is made to parse it as a 64-bit hexadecimal integer.\n   * If parsing succeeds the normalized result is returned; otherwise the result is \"0\", indicating an invalid Id.\n   *\n   * For a description of \"well-formed\", see [Working with Ids]($docs/learning/common/Id64.md).\n   */\n  export function fromString(val: string): Id64String {\n    // NB: in case this is called from JavaScript, we must check the run-time type...\n    if (typeof val !== \"string\")\n      return invalid;\n\n    // Skip the common case in which the input is already a well-formed Id string\n    if (Id64.isId64(val))\n      return val;\n\n    // Attempt to normalize the input into a well-formed Id string\n    val = val.toLowerCase().trim();\n    const len = val.length;\n    if (len < 2 || val[0] !== \"0\" || val[1] !== \"x\")\n      return invalid;\n\n    let low = 0;\n    let high = 0;\n    let start = 2;\n    if (len > 12) {\n      start = (len - 10);\n      high = toHex(val.slice(2, start));\n    }\n\n    low = toHex(val.slice(start));\n    return fromLocalAndBriefcaseIds(low, high);\n  }\n\n  // Used when constructing local ID portion of Id64String. Performance optimization.\n  const _localIdPrefixByLocalIdLength = [\n    \"0000000000\",\n    \"000000000\",\n    \"00000000\",\n    \"0000000\",\n    \"000000\",\n    \"00000\",\n    \"0000\",\n    \"000\",\n    \"00\",\n    \"0\",\n    \"\",\n  ];\n\n  /** Produce an Id string from a local and briefcase Id.\n   * @param localId The non-zero local Id as an unsigned 40-bit integer.\n   * @param briefcaseId The briefcase Id as an unsigned 24-bit integer.\n   * @returns an Id64String containing the hexadecimal string representation of the unsigned 64-bit integer which would result from the\n   * operation `localId | (briefcaseId << 40)`, or an invalid Id \"0\" if the inputs are invalid.\n   */\n  export function fromLocalAndBriefcaseIds(localId: number, briefcaseId: number): Id64String {\n    // NB: Yes, we must check the run-time type...\n    if (typeof localId !== \"number\" || typeof briefcaseId !== \"number\")\n      return invalid;\n\n    localId = Math.floor(localId);\n    if (0 === localId)\n      return invalid;\n\n    briefcaseId = Math.floor(briefcaseId);\n    const lowStr = localId.toString(16);\n    return `0x${(briefcaseId === 0) ? lowStr : (briefcaseId.toString(16) + (_localIdPrefixByLocalIdLength[lowStr.length] + lowStr))}`;\n  }\n\n  // Used as a buffer when converting a pair of 32-bit integers to an Id64String. Significant performance optimization.\n  const scratchCharCodes = [\n    0x30, // \"0\"\n    0x78, // \"x\"\n    0x30, // \"0\"\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n  ];\n\n  // Convert 4-bit unsigned integer to char code representing lower-case hexadecimal digit.\n  function uint4ToCharCode(uint4: number): number {\n    return uint4 + (uint4 < 10 ? 0x30 : 0x57);\n  }\n\n  // Convert char code representing lower-case hexadecimal digit to 4-bit unsigned integer.\n  function charCodeToUint4(char: number): number {\n    return char - (char >= 0x57 ? 0x57 : 0x30);\n  }\n\n  // Convert a substring to a uint32. This is twice as fast as using Number.parseInt().\n  function substringToUint32(id: Id64String, start: number, end: number): number {\n    let uint32 = 0;\n    for (let i = start; i < end; i++) {\n      const uint4 = charCodeToUint4(id.charCodeAt(i));\n      const shift = (end - i - 1) << 2;\n      const mask = uint4 << shift;\n      uint32 = (uint32 | mask) >>> 0; // >>> 0 to force unsigned because javascript\n    }\n\n    return uint32;\n  }\n\n  /** Create an Id64String from a pair of unsigned 32-bit integers.\n   * @param lowBytes The lower 4 bytes of the Id\n   * @param highBytes The upper 4 bytes of the Id\n   * @returns an Id64String containing the hexadecimal string representation of the unsigned 64-bit integer which would result from the\n   * operation `lowBytes | (highBytes << 32)`.\n   * @see [[Id64.fromUint32PairObject]] if you have a [[Id64.Uint32Pair]] object.\n   */\n  export function fromUint32Pair(lowBytes: number, highBytes: number): Id64String {\n    const localIdLow = lowBytes >>> 0;\n    const localIdHigh = (highBytes & 0x000000ff) * (0xffffffff + 1); // aka (highBytes & 0xff) << 32\n    const localId = localIdLow + localIdHigh; // aka localIdLow | localIdHigh\n    if (0 === localId)\n      return invalid;\n\n    // Need to omit or preserve leading zeroes...\n    const buffer = scratchCharCodes;\n    let index = 2;\n    for (let i = 7; i >= 0; i--) {\n      const shift = i << 2;\n      const mask = 0xf << shift;\n      const uint4 = (highBytes & mask) >>> shift;\n      if (index > 2 || 0 !== uint4)\n        buffer[index++] = uint4ToCharCode(uint4);\n    }\n\n    for (let i = 7; i >= 0; i--) {\n      const shift = i << 2;\n      const mask = 0xf << shift;\n      const uint4 = (lowBytes & mask) >>> shift;\n      if (index > 2 || 0 !== uint4)\n        buffer[index++] = uint4ToCharCode(uint4);\n    }\n\n    if (buffer.length !== index)\n      buffer.length = index;\n\n    return String.fromCharCode(...scratchCharCodes);\n  }\n\n  /** Create an Id64String from a [[Id64.Uint32Pair]].\n   * @see [[Id64.fromUint32Pair]].\n   */\n  export function fromUint32PairObject(pair: Uint32Pair): Id64String {\n    return fromUint32Pair(pair.lower, pair.upper);\n  }\n\n  /** Returns true if the inputs represent two halves of a valid 64-bit Id.\n   * @see [[Id64.Uint32Pair]].\n   */\n  export function isValidUint32Pair(lowBytes: number, highBytes: number): boolean {\n    // Detect local ID of zero\n    return 0 !== lowBytes || 0 !== (highBytes & 0x000000ff);\n  }\n\n  /** Represents an [[Id64]] as a pair of unsigned 32-bit integers. Because Javascript lacks efficient support for 64-bit integers,\n   * this representation can be useful in performance-sensitive code like the render loop.\n   * @see [[Id64.getUint32Pair]] to convert an [[Id64String]] to a Uint32Pair.\n   * @see [[Id64.fromUint32Pair]] to convert a Uint32Pair to an [[Id64String]].\n   * @see [[Id64.Uint32Set]] and [[Id64.Uint32Map]] for collections based on Uint32Pairs.\n   */\n  export interface Uint32Pair {\n    /** The lower 4 bytes of the 64-bit integer. */\n    lower: number;\n    /** The upper 4 bytes of the 64-bit integer. */\n    upper: number;\n  }\n\n  /** Convert an Id64String to a 64-bit unsigned integer represented as a pair of unsigned 32-bit integers.\n   * @param id The well-formed string representation of a 64-bit Id.\n   * @param out Used as the return value if supplied; otherwise a new object is returned.\n   * @returns An object containing the parsed lower and upper 32-bit integers comprising the 64-bit Id.\n   */\n  export function getUint32Pair(id: Id64String, out?: Uint32Pair): Uint32Pair {\n    if (!out)\n      out = { lower: 0, upper: 0 };\n\n    out.lower = getLowerUint32(id);\n    out.upper = getUpperUint32(id);\n    return out;\n  }\n\n  /** Extract an unsigned 32-bit integer from the lower 4 bytes of an Id64String. */\n  export function getLowerUint32(id: Id64String): number {\n    if (isInvalid(id))\n      return 0;\n\n    const end = id.length;\n    const start = end > 10 ? end - 8 : 2;\n    return substringToUint32(id, start, end);\n  }\n\n  /** Extract an unsigned 32-bit integer from the upper 4 bytes of an Id64String. */\n  export function getUpperUint32(id: Id64String): number {\n    const len = id.length;\n    if (len <= 10 || isInvalid(id))\n      return 0;\n\n    return substringToUint32(id, 2, len - 8);\n  }\n\n  /** Convert an [[Id64Arg]] into an [[Id64Set]].\n   *\n   * This method can be used by functions that accept an Id64Arg to conveniently process the value(s). For example:\n   * ```ts\n   *   public addCategories(arg: Id64Arg) { Id64.toIdSet(arg).forEach((id) => this.categories.add(id)); }\n   * ```\n   *\n   * Alternatively, to avoid allocating a new Id64Set, use [[Id64.iterable]].\n   *\n   * @param arg The Ids to convert to an Id64Set.\n   * @param makeCopy If true, and the input is already an Id64Set, returns a deep copy of the input.\n   * @returns An Id64Set containing the set of [[Id64String]]s represented by the Id64Arg.\n   */\n  export function toIdSet(arg: Id64Arg, makeCopy: boolean = false): Id64Set {\n    if (arg instanceof Set)\n      return makeCopy ? new Set<string>(arg) : arg;\n\n    const ids = new Set<Id64String>();\n    if (typeof arg === \"string\")\n      ids.add(arg);\n    else if (Array.isArray(arg)) {\n      arg.forEach((id: Id64String) => {\n        if (typeof id === \"string\")\n          ids.add(id);\n      });\n    }\n\n    return ids;\n  }\n\n  /** Obtain iterator over the specified Ids.\n   * @see [[Id64.iterable]].\n   */\n  export function* iterator(ids: Id64Arg): Iterator<Id64String> {\n    if (typeof ids === \"string\") {\n      yield ids;\n    } else {\n      for (const id of ids)\n        yield id;\n    }\n  }\n\n  /** Obtain an iterable over the specified Ids. Example usage:\n   * ```ts\n   *  const ids = [\"0x123\", \"0xfed\"];\n   *  for (const id of Id64.iterable(ids))\n   *    console.log(id);\n   * ```\n   */\n  export function iterable(ids: Id64Arg): Iterable<Id64String> {\n    return {\n      [Symbol.iterator]: () => iterator(ids),\n    };\n  }\n\n  /** Return the first [[Id64String]] of an [[Id64Arg]]. */\n  export function getFirst(arg: Id64Arg): Id64String {\n    return typeof arg === \"string\" ? arg : (Array.isArray(arg) ? arg[0] : arg.values().next().value) ?? Id64.invalid;\n  }\n\n  /** Return the number of [[Id64String]]s represented by an [[Id64Arg]]. */\n  export function sizeOf(arg: Id64Arg): number {\n    return typeof arg === \"string\" ? 1 : (Array.isArray(arg) ? arg.length : arg.size);\n  }\n\n  /** Returns true if the [[Id64Arg]] contains the specified Id. */\n  export function has(arg: Id64Arg, id: Id64String): boolean {\n    if (typeof arg === \"string\")\n      return arg === id;\n    if (Array.isArray(arg))\n      return -1 !== arg.indexOf(id);\n\n    return arg.has(id);\n  }\n\n  /** The string representation of an invalid Id. */\n  export const invalid = \"0\";\n\n  /** Determine if the supplied id string represents a transient Id.\n   * @param id A well-formed Id string.\n   * @returns true if the Id represents a transient Id.\n   * @note This method assumes the input is a well-formed Id string.\n   * @see [[Id64.isTransientId64]]\n   * @see [[TransientIdSequence]]\n   */\n  export function isTransient(id: Id64String): boolean {\n    // A transient Id is of the format \"0xffffffxxxxxxxxxx\" where the leading 6 digits indicate an invalid briefcase Id.\n    return 18 === id.length && id.startsWith(\"0xffffff\");\n  }\n\n  /** Determine if the input is a well-formed [[Id64String]] and represents a transient Id.\n   * @see [[Id64.isTransient]]\n   * @see [[Id64.isId64]]\n   * @see [[TransientIdSequence]]\n   */\n  export function isTransientId64(id: string): boolean {\n    return isValidId64(id) && isTransient(id);\n  }\n\n  /** Determine if the input is a well-formed [[Id64String]].\n   *\n   * For a description of \"well-formed\", see [Working with Ids]($docs/learning/common/Id64.md).\n   * @see [[Id64.isValidId64]]\n   */\n  export function isId64(id: string): boolean {\n    const len = id.length;\n    if (0 === len || 18 < len)\n      return false;\n\n    if (\"0\" !== id[0])\n      return false;\n\n    // Well-formed invalid Id: \"0\"\n    if (1 === len)\n      return true;\n\n    // Valid Ids begin with \"0x\" followed by at least one lower-case hexadecimal digit.\n    if (2 === len || \"x\" !== id[1])\n      return false;\n\n    // If briefcase Id is present, it occupies at least one digit, followed by 10 digits for local Id\n    let localIdStart = 2;\n    if (len > 12) {\n      localIdStart = len - 10;\n\n      // Verify briefcase Id\n      if (!isValidHexString(id, 2, localIdStart - 2))\n        return false;\n\n      // Skip leading zeroes in local Id\n      for (let i = localIdStart; i < len; i++) {\n        if (0x30 !== id.charCodeAt(i)) // '0'\n          break;\n        else\n          localIdStart++;\n      }\n\n      if (localIdStart >= len)\n        return false;\n    }\n\n    return isValidHexString(id, localIdStart, len - localIdStart);\n  }\n\n  /** Returns true if the input is not equal to the representation of an invalid Id.\n   * @note This method assumes the input is a well-formed Id string.\n   * @see [[Id64.isInvalid]]\n   * @see [[Id64.isValidId64]]\n   */\n  export function isValid(id: Id64String): boolean {\n    return Id64.invalid !== id;\n  }\n\n  /** Returns true if the input is a well-formed [[Id64String]] representing a valid Id.\n   * @see [[Id64.isValid]]\n   * @see [[Id64.isId64]]\n   */\n  export function isValidId64(id: string): boolean {\n    return Id64.invalid !== id && Id64.isId64(id);\n  }\n\n  /** Returns true if the input is a well-formed [[Id64String]] representing an invalid Id.\n   * @see [[Id64.isValid]]\n   */\n  export function isInvalid(id: Id64String): boolean {\n    return Id64.invalid === id;\n  }\n\n  /** A specialized replacement for Set<Id64String> optimized for performance-critical code which represents large sets of [[Id64]]s as pairs of\n   * 32-bit integers.\n   * The internal representation is a Map<number, Set<number>> where the Map key is the upper 4 bytes of the IDs and the Set elements are the lower 4 bytes of the IDs.\n   * Because the upper 4 bytes store the 24-bit briefcase ID plus the upper 8 bits of the local ID, there will be a very small distribution of unique Map keys.\n   * To further optimize this data type, the following assumptions are made regarding the { lower, upper } inputs, and no validation is performed to confirm them:\n   *  - The inputs are unsigned 32-bit integers;\n   *  - The inputs represent a valid Id64String (e.g., local ID is not zero).\n   * @see [[Id64.Uint32Map]] for a similarly-optimized replacement for Map<Id64String, T>\n   * @public\n   */\n  export class Uint32Set {\n    protected readonly _map = new Map<number, Set<number>>();\n\n    /** Construct a new Uint32Set.\n     * @param ids If supplied, all of the specified Ids will be added to the new set.\n     */\n    public constructor(ids?: Id64Arg) {\n      if (undefined !== ids)\n        this.addIds(ids);\n    }\n\n    /** Return true if `this` and `other` contain the same set of Ids. */\n    public equals(other: Uint32Set): boolean {\n      if (this === other) {\n        return true;\n      }\n\n      if (this.size !== other.size) {\n        return false;\n      }\n\n      for (const [key, thisValue] of this._map) {\n        const otherValue = other._map.get(key);\n        if (!otherValue || thisValue.size !== otherValue.size) {\n          return false;\n        }\n\n        for (const value of thisValue) {\n          if (!otherValue.has(value)) {\n            return false;\n          }\n        }\n      }\n\n      return true;\n    }\n\n    /** Remove all contents of this set. */\n    public clear(): void {\n      this._map.clear();\n    }\n\n    /** Add an Id to the set. */\n    public addId(id: Id64String): void {\n      this.add(Id64.getLowerUint32(id), Id64.getUpperUint32(id));\n    }\n\n    /** Add any number of Ids to the set. */\n    public addIds(ids: Id64Arg): void {\n      for (const id of Id64.iterable(ids))\n        this.addId(id);\n    }\n\n    /** Returns true if the set contains the specified Id. */\n    public hasId(id: Id64String): boolean { return this.has(Id64.getLowerUint32(id), Id64.getUpperUint32(id)); }\n\n    /** Add an Id to the set. */\n    public add(low: number, high: number): void {\n      let set = this._map.get(high);\n      if (undefined === set) {\n        set = new Set<number>();\n        this._map.set(high, set);\n      }\n\n      set.add(low);\n    }\n\n    /** Remove an Id from the set. */\n    public deleteId(id: Id64String): void {\n      this.delete(Id64.getLowerUint32(id), Id64.getUpperUint32(id));\n    }\n\n    /** Remove any number of Ids from the set. */\n    public deleteIds(ids: Id64Arg): void {\n      for (const id of Id64.iterable(ids))\n        this.deleteId(id);\n    }\n\n    /** Remove an Id from the set. */\n    public delete(low: number, high: number): void {\n      const set = this._map.get(high);\n      if (undefined !== set)\n        set.delete(low);\n    }\n\n    /** Returns true if the set contains the specified Id. */\n    public has(low: number, high: number): boolean {\n      const set = this._map.get(high);\n      return undefined !== set && set.has(low);\n    }\n\n    /** Returns true if the set contains the Id specified by `pair`. */\n    public hasPair(pair: Uint32Pair): boolean {\n      return this.has(pair.lower, pair.upper);\n    }\n\n    /** Returns true if the set contains no Ids. */\n    public get isEmpty(): boolean { return 0 === this._map.size; }\n\n    /** Returns the number of Ids contained in the set. */\n    public get size(): number {\n      let size = 0;\n      for (const entry of this._map)\n        size += entry[1].size;\n\n      return size;\n    }\n\n    /** Populates and returns an array of all Ids contained in the set. */\n    public toId64Array(): Id64Array {\n      const ids: Id64Array = [];\n      for (const entry of this._map)\n        for (const low of entry[1])\n          ids.push(Id64.fromUint32Pair(low, entry[0]));\n\n      return ids;\n    }\n\n    /** Populates and returns a set of all Ids contained in the set. */\n    public toId64Set(): Id64Set {\n      const ids = new Set<string>();\n      for (const entry of this._map)\n        for (const low of entry[1])\n          ids.add(Id64.fromUint32Pair(low, entry[0]));\n\n      return ids;\n    }\n\n    /** Execute a function against each Id in this set. */\n    public forEach(func: (lo: number, hi: number) => void): void {\n      for (const entry of this._map)\n        for (const lo of entry[1])\n          func(lo, entry[0]);\n    }\n  }\n\n  /** A specialized replacement for Map<Id64String, T> optimized for performance-critical code.\n   * @see [[Id64.Uint32Set]] for implementation details.\n   * @public\n   */\n  export class Uint32Map<T> {\n    protected readonly _map = new Map<number, Map<number, T>>();\n\n    /** Remove all entries from the map. */\n    public clear(): void { this._map.clear(); }\n    /** Find an entry in the map by Id. */\n    public getById(id: Id64String): T | undefined { return this.get(Id64.getLowerUint32(id), Id64.getUpperUint32(id)); }\n    /** Set an entry in the map by Id. */\n    public setById(id: Id64String, value: T): void { this.set(Id64.getLowerUint32(id), Id64.getUpperUint32(id), value); }\n\n    /** Set an entry in the map by Id components. */\n    public set(low: number, high: number, value: T): void {\n      let map = this._map.get(high);\n      if (undefined === map) {\n        map = new Map<number, T>();\n        this._map.set(high, map);\n      }\n\n      map.set(low, value);\n    }\n\n    /** Get an entry from the map by Id components. */\n    public get(low: number, high: number): T | undefined {\n      const map = this._map.get(high);\n      return undefined !== map ? map.get(low) : undefined;\n    }\n\n    /** Returns true if the map contains no entries. */\n    public get isEmpty(): boolean { return 0 === this._map.size; }\n    /** Returns the number of entries in the map. */\n    public get size(): number {\n      let size = 0;\n      for (const entry of this._map)\n        size += entry[1].size;\n\n      return size;\n    }\n\n    /** Execute a function against each entry in this map. */\n    public forEach(func: (lo: number, hi: number, value: T) => void): void {\n      for (const outerEntry of this._map)\n        for (const innerEntry of outerEntry[1])\n          func(innerEntry[0], outerEntry[0], innerEntry[1]);\n    }\n  }\n}\n\n/** JSON representation of a [[TransientIdSequence]], primarily useful for transferring sequences to and from a [Worker](https://developer.mozilla.org/en-US/docs/Web/API/Worker).\n * It stores two \"local\" 40-bit Ids describing the range of [Id64String]($docs/learning/common/Id64.md)s generated by the sequence.\n * @public\n */\nexport interface TransientIdSequenceProps {\n  /** The starting local Id. The sequence begins at `initialLocalId + 1`. */\n  initialLocalId: number;\n  /** The maximum local Id generated by the sequence thus far. It is never less than [[initialLocalId]]. If it is equal to [[initialLocalId]], then the sequence has\n   * not yet generated any Ids.\n   * The next local Id generated by the sequence will be `currentLocalId + 1`.\n   */\n  currentLocalId: number;\n}\n\nfunction validateLocalId(num: number): void {\n  if (num < 0 || Math.round(num) !== num) {\n    throw new Error(\"Local Id must be a non-negative integer\");\n  }\n}\n\n/** A function returned by [[TransientIdSequence.merge]] that remaps the local Id portion of an [Id64String]($docs/learning/common/Id64.md) generated by\n * the source sequence to the corresponding local Id in the target sequence.\n * It returns `sourceLocalId` if the input did not originate from the source sequence.\n* @public\n*/\nexport type RemapTransientLocalId = (sourceLocalId: number) => number;\n\n/**\n * Generates unique [[Id64String]] values in sequence, which are guaranteed not to conflict with Ids associated with persistent elements or models.\n * This is useful for associating stable, non-persistent identifiers with things like [Decorator]($frontend)s.\n * A TransientIdSequence can generate a maximum of (2^40)-2 unique Ids.\n * @public\n */\nexport class TransientIdSequence {\n  /** The starting local Id provided to the constructor. The sequence begins at `initialLocalId + 1`. */\n  public readonly initialLocalId: number;\n  private _localId: number;\n\n  /** Constructor.\n   * @param initialLocalId The starting local Id. The local Id of the first [[Id64String]] generated by [[getNext]] will be `initialLocalId + 1`.\n   */\n  public constructor(initialLocalId = 0) {\n    validateLocalId(initialLocalId);\n    this.initialLocalId = initialLocalId;\n    this._localId = initialLocalId;\n  }\n\n  /** The maximum local Id generated by the sequence thus far. It is never less than [[initialLocalId]]. If it is equal to [[initialLocalId]], then the sequence has\n   * not yet generated any Ids.\n   * Each call to [[getNext]] increments this by 1 and uses it as the local Id of the generated [[Id64String]].\n   */\n  public get currentLocalId(): number {\n    return this._localId;\n  }\n\n  /** Generate and return the next transient Id64String in the sequence.\n   * @deprecated in 3.x. Use [[getNext]].\n   */\n  public get next(): Id64String {\n    return this.getNext();\n  }\n\n  /** Generate and return the next transient Id64String in the sequence. */\n  public getNext(): Id64String {\n    return Id64.fromLocalAndBriefcaseIds(++this._localId, 0xffffff);\n  }\n\n  /** Preview the transient Id64String that will be returned by the next call to [[getNext]].\n   * This is primarily useful for tests.\n   */\n  public peekNext(): Id64String {\n    return Id64.fromLocalAndBriefcaseIds(this._localId + 1, 0xffffff);\n  }\n\n  /** Convert this sequence to its JSON representation. */\n  public toJSON(): TransientIdSequenceProps {\n    return {\n      initialLocalId: this.initialLocalId,\n      currentLocalId: this.currentLocalId,\n    };\n  }\n\n  /** Create a sequence from its JSON representation. */\n  public static fromJSON(props: TransientIdSequenceProps): TransientIdSequence {\n    validateLocalId(props.currentLocalId);\n    const sequence = new TransientIdSequence(props.initialLocalId);\n    sequence._localId = props.currentLocalId;\n    return sequence;\n  }\n\n  /** Obtain the JSON representation of a new sequence that diverges from this sequence, with its [[initialLocalId]] set to this sequence's [[currentLocalId]].\n   * The two sequences can generate Ids independently. Later, you can [[merge]] the sequences, resolving conflicts where the two sequences generated identical Ids.\n   * This is chiefly useful when generating transient Ids on a [Worker](https://developer.mozilla.org/en-US/docs/Web/API/Worker).\n   */\n  public fork(): TransientIdSequenceProps {\n    return {\n      initialLocalId: this.currentLocalId,\n      currentLocalId: this.currentLocalId,\n    };\n  }\n\n  /** Integrate the Ids generated by a [[fork]] of this sequence. All of the Ids generated by `source` will be remapped to Ids at the end of this sequence.\n   * This is chiefly useful when generating transient Ids on a [Worker](https://developer.mozilla.org/en-US/docs/Web/API/Worker).\n   * @param source The JSON representation of the [[fork]]ed sequence to be merged with this one.\n   * @returns a function that permits you to remap the local Ids generated by `source` into the corresponding local Ids assigned by this sequence.\n   * @throws Error if `source` is not a fork of this sequence or is malformed (e.g., contains negative and/or non-integer local Ids).\n   */\n  public merge(source: TransientIdSequenceProps): (sourceLocalId: number) => number {\n    const { initialLocalId, currentLocalId } = source;\n\n    validateLocalId(initialLocalId);\n    validateLocalId(currentLocalId);\n\n    if (initialLocalId > this.currentLocalId) {\n      throw new Error(\"Transient Id sequences do not intersect\");\n    }\n\n    if (initialLocalId > currentLocalId) {\n      throw new Error(\"Current local Id cannot be less than initial local Id\");\n    }\n\n    const delta = this.currentLocalId - initialLocalId;\n    this._localId += currentLocalId - initialLocalId;\n\n    return (sourceLocalId: number) => {\n      if (sourceLocalId > initialLocalId && sourceLocalId <= currentLocalId) {\n        return sourceLocalId + delta;\n      }\n\n      return sourceLocalId;\n    };\n  }\n}\n\n/**\n * The Guid namespace provides facilities for working with GUID strings using the \"8-4-4-4-12\" pattern.\n *\n * The [[GuidString]] type alias is used to indicate function arguments, return types, and variables which are known to\n * be in the GUID format.\n * @public\n */\nexport namespace Guid {\n  const uuidPattern = new RegExp(\"^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}$\");\n\n  /** Represents the empty Guid 00000000-0000-0000-0000-000000000000 */\n  export const empty: GuidString = \"00000000-0000-0000-0000-000000000000\";\n\n  /** Determine whether the input string is \"guid-like\". That is, it follows the 8-4-4-4-12 pattern. This does not enforce\n   *  that the string is actually in valid UUID format.\n   */\n  export function isGuid(value: string): boolean {\n    return uuidPattern.test(value);\n  }\n\n  /** Determine whether the input string is a valid V4 Guid string */\n  export function isV4Guid(value: string): boolean {\n    return /^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-4[0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$/.test(value);\n  }\n\n  /** Create a new V4 Guid value */\n  export function createValue(): GuidString {\n    // https://stackoverflow.com/questions/105034/create-guid-uuid-in-javascript\n    return \"xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx\".replace(/[xy]/g, (c) => {\n      const r = Math.random() * 16 | 0;\n      const v = c === \"x\" ? r : (r & 0x3 | 0x8);\n      return v.toString(16);\n    });\n  }\n\n  /**\n   * Normalize a Guid string if possible. Normalization consists of:\n   * - Convert all characters to lower case\n   * - Trim any leading or trailing whitespace\n   * - Convert to the standard Guid format \"8-4-4-4-12\", repositioning the '-' characters as necessary, presuming there are exactly 32 hexadecimal digits.\n   * @param value Input value that represents a Guid\n   * @returns Normalized representation of the Guid string. If the normalization fails, return the *original* value unmodified (Note: it is *not* a valid Guid)\n   */\n  export function normalize(value: GuidString): GuidString {\n    const lowerValue = value.toLowerCase().trim();\n\n    // Return if it's already formatted to be a Guid\n    if (isGuid(lowerValue))\n      return lowerValue;\n\n    // Remove any existing \"-\" characters and position them properly, if there remains exactly 32 hexadecimal digits\n    const noDashValue = lowerValue.replace(/-/g, \"\");\n    const noDashPattern = /^([0-9a-f]{8})([0-9a-f]{4})([0-9a-f]{4})([0-9a-f]{4})([0-9a-f]{12})$/;\n    if (noDashPattern.test(noDashValue)) {\n      return noDashValue.replace(noDashPattern,\n        (_match: string, p1: string, p2: string, p3: string, p4: string, p5: string) =>\n          `${p1}-${p2}-${p3}-${p4}-${p5}`);\n    }\n\n    // Return unmodified string - (note: it is *not* a valid Guid)\n    return value;\n  }\n}\n"]}
+{"version":3,"file":"Id.js","sourceRoot":"","sources":["../../src/Id.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AA4BH,SAAS,KAAK,CAAC,GAAW;IACxB,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,0BAA0B,CAAC,GAAW,EAAE,KAAa;IAC5D,OAAO,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAW,EAAE,KAAa,EAAE,YAAqB,IAAI;IAChF,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACvC,MAAM,eAAe,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,gBAAgB;IACjE,OAAO,CAAC,QAAQ,IAAI,eAAe,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,IAAI,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,oBAAoB;AAC1H,CAAC;AAED,SAAS,gBAAgB,CAAC,EAAU,EAAE,UAAkB,EAAE,GAAW;IACnE,IAAI,GAAG,KAAK,CAAC;QACX,OAAO,KAAK,CAAC;IAEf,uBAAuB;IACvB,IAAI,CAAC,0BAA0B,CAAC,EAAE,EAAE,UAAU,CAAC;QAC7C,OAAO,KAAK,CAAC;IAEf,qDAAqD;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC1B,IAAI,CAAC,mBAAmB,CAAC,EAAE,EAAE,UAAU,GAAG,CAAC,CAAC;YAC1C,OAAO,KAAK,CAAC;IAEjB,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,IAAiB,IAAI,CAkmBpB;AAlmBD,WAAiB,IAAI;IACnB,2GAA2G;IAC3G,SAAgB,UAAU,CAAC,EAAc;QACvC,IAAI,SAAS,CAAC,EAAE,CAAC;YACf,OAAO,CAAC,CAAC;QAEX,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,OAAO,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IAChC,CAAC;IAPe,eAAU,aAOzB,CAAA;IAED,6GAA6G;IAC7G,SAAgB,cAAc,CAAC,EAAc;QAC3C,IAAI,SAAS,CAAC,EAAE,CAAC;YACf,OAAO,CAAC,CAAC;QAEX,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,OAAO,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;IACxD,CAAC;IANe,mBAAc,iBAM7B,CAAA;IAED;;;;;OAKG;IACH,SAAgB,QAAQ,CAAC,IAAa;QACpC,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;IACzE,CAAC;IAFe,aAAQ,WAEvB,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,UAAU,CAAC,GAAW;QACpC,iFAAiF;QACjF,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,OAAO,KAAA,OAAO,CAAC;QAEjB,6EAA6E;QAC7E,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAClB,OAAO,GAAG,CAAC;QAEb,8DAA8D;QAC9D,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;QACvB,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG;YAC7C,OAAO,KAAA,OAAO,CAAC;QAEjB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;YACb,KAAK,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;YACnB,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;QACpC,CAAC;QAED,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAC9B,OAAO,wBAAwB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC7C,CAAC;IAzBe,eAAU,aAyBzB,CAAA;IAED,mFAAmF;IACnF,MAAM,6BAA6B,GAAG;QACpC,YAAY;QACZ,WAAW;QACX,UAAU;QACV,SAAS;QACT,QAAQ;QACR,OAAO;QACP,MAAM;QACN,KAAK;QACL,IAAI;QACJ,GAAG;QACH,EAAE;KACH,CAAC;IAEF;;;;;OAKG;IACH,SAAgB,wBAAwB,CAAC,OAAe,EAAE,WAAmB;QAC3E,8CAA8C;QAC9C,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,WAAW,KAAK,QAAQ;YAChE,OAAO,KAAA,OAAO,CAAC;QAEjB,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,OAAO;YACf,OAAO,KAAA,OAAO,CAAC;QAEjB,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACpC,OAAO,KAAK,CAAC,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,6BAA6B,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;IACpI,CAAC;IAZe,6BAAwB,2BAYvC,CAAA;IAED,qHAAqH;IACrH,MAAM,gBAAgB,GAAG;QACvB,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,MAAM;QACZ,IAAI,EAAE,MAAM;QACZ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;KACL,CAAC;IAEF,yFAAyF;IACzF,SAAS,eAAe,CAAC,KAAa;QACpC,OAAO,KAAK,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IAED,yFAAyF;IACzF,SAAS,eAAe,CAAC,IAAY;QACnC,OAAO,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IAED,qFAAqF;IACrF,SAAS,iBAAiB,CAAC,EAAc,EAAE,KAAa,EAAE,GAAW;QACnE,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,KAAK,IAAI,KAAK,CAAC;YAC5B,MAAM,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,6CAA6C;QAC/E,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,QAAgB,EAAE,SAAiB;QAChE,MAAM,UAAU,GAAG,QAAQ,KAAK,CAAC,CAAC;QAClC,MAAM,WAAW,GAAG,CAAC,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,+BAA+B;QAChG,MAAM,OAAO,GAAG,UAAU,GAAG,WAAW,CAAC,CAAC,+BAA+B;QACzE,IAAI,CAAC,KAAK,OAAO;YACf,OAAO,KAAA,OAAO,CAAC;QAEjB,6CAA6C;QAC7C,MAAM,MAAM,GAAG,gBAAgB,CAAC;QAChC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,IAAI,GAAG,GAAG,IAAI,KAAK,CAAC;YAC1B,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC;YAC3C,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK;gBAC1B,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,IAAI,GAAG,GAAG,IAAI,KAAK,CAAC;YAC1B,MAAM,KAAK,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC;YAC1C,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK;gBAC1B,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK;YACzB,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QAExB,OAAO,MAAM,CAAC,YAAY,CAAC,GAAG,gBAAgB,CAAC,CAAC;IAClD,CAAC;IA9Be,mBAAc,iBA8B7B,CAAA;IAED;;OAEG;IACH,SAAgB,oBAAoB,CAAC,IAAgB;QACnD,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAFe,yBAAoB,uBAEnC,CAAA;IAED;;OAEG;IACH,SAAgB,iBAAiB,CAAC,QAAgB,EAAE,SAAiB;QACnE,0BAA0B;QAC1B,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC;IAC1D,CAAC;IAHe,sBAAiB,oBAGhC,CAAA;IAeD;;;;OAIG;IACH,SAAgB,aAAa,CAAC,EAAc,EAAE,GAAgB;QAC5D,IAAI,CAAC,GAAG;YACN,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAE/B,GAAG,CAAC,KAAK,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAC/B,GAAG,CAAC,KAAK,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;QAC/B,OAAO,GAAG,CAAC;IACb,CAAC;IAPe,kBAAa,gBAO5B,CAAA;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAc;QAC3C,IAAI,SAAS,CAAC,EAAE,CAAC;YACf,OAAO,CAAC,CAAC;QAEX,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,MAAM,KAAK,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,OAAO,iBAAiB,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAC3C,CAAC;IAPe,mBAAc,iBAO7B,CAAA;IAED,kFAAkF;IAClF,SAAgB,cAAc,CAAC,EAAc;QAC3C,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,IAAI,GAAG,IAAI,EAAE,IAAI,SAAS,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,CAAC;QAEX,OAAO,iBAAiB,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IANe,mBAAc,iBAM7B,CAAA;IAED;;;;;;;;;;;;OAYG;IACH,SAAgB,OAAO,CAAC,GAAY,EAAE,WAAoB,KAAK;QAC7D,IAAI,GAAG,YAAY,GAAG;YACpB,OAAO,QAAQ,CAAC,CAAC,CAAC,IAAI,GAAG,CAAS,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAE/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAc,CAAC;QAClC,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;aACV,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,EAAc,EAAE,EAAE;gBAC7B,IAAI,OAAO,EAAE,KAAK,QAAQ;oBACxB,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;IAfe,YAAO,UAetB,CAAA;IAED;;OAEG;IACH,QAAe,CAAC,CAAC,QAAQ,CAAC,GAAY;QACpC,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5B,MAAM,GAAG,CAAC;QACZ,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,EAAE,IAAI,GAAG;gBAClB,MAAM,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IAPgB,aAAQ,WAOxB,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,QAAQ,CAAC,GAAY;QACnC,OAAO;YACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC;SACvC,CAAC;IACJ,CAAC;IAJe,aAAQ,WAIvB,CAAA;IAED,yDAAyD;IACzD,SAAgB,QAAQ,CAAC,GAAY;QACnC,OAAO,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC;IACnH,CAAC;IAFe,aAAQ,WAEvB,CAAA;IAED,0EAA0E;IAC1E,SAAgB,MAAM,CAAC,GAAY;QACjC,OAAO,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpF,CAAC;IAFe,WAAM,SAErB,CAAA;IAED,iEAAiE;IACjE,SAAgB,GAAG,CAAC,GAAY,EAAE,EAAc;QAC9C,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,OAAO,GAAG,KAAK,EAAE,CAAC;QACpB,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;YACpB,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAEhC,OAAO,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC;IAPe,QAAG,MAOlB,CAAA;IAED,kDAAkD;IACrC,YAAO,GAAG,GAAG,CAAC;IAE3B;;;;;;OAMG;IACH,SAAgB,WAAW,CAAC,EAAc;QACxC,oHAAoH;QACpH,OAAO,EAAE,KAAK,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IACvD,CAAC;IAHe,gBAAW,cAG1B,CAAA;IAED;;;;OAIG;IACH,SAAgB,eAAe,CAAC,EAAU;QACxC,OAAO,WAAW,CAAC,EAAE,CAAC,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IAFe,oBAAe,kBAE9B,CAAA;IAED;;;;OAIG;IACH,SAAgB,MAAM,CAAC,EAAU;QAC/B,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,EAAE,GAAG,GAAG;YACvB,OAAO,KAAK,CAAC;QAEf,IAAI,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;YACf,OAAO,KAAK,CAAC;QAEf,8BAA8B;QAC9B,IAAI,CAAC,KAAK,GAAG;YACX,OAAO,IAAI,CAAC;QAEd,mFAAmF;QACnF,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;YAC5B,OAAO,KAAK,CAAC;QAEf,iGAAiG;QACjG,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;YACb,YAAY,GAAG,GAAG,GAAG,EAAE,CAAC;YAExB,sBAAsB;YACtB,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC;gBAC5C,OAAO,KAAK,CAAC;YAEf,kCAAkC;YAClC,KAAK,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,IAAI,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM;oBACnC,MAAM;;oBAEN,YAAY,EAAE,CAAC;YACnB,CAAC;YAED,IAAI,YAAY,IAAI,GAAG;gBACrB,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,OAAO,gBAAgB,CAAC,EAAE,EAAE,YAAY,EAAE,GAAG,GAAG,YAAY,CAAC,CAAC;IAChE,CAAC;IAtCe,WAAM,SAsCrB,CAAA;IAED;;;;OAIG;IACH,SAAgB,OAAO,CAAC,EAAc;QACpC,OAAO,IAAI,CAAC,OAAO,KAAK,EAAE,CAAC;IAC7B,CAAC;IAFe,YAAO,UAEtB,CAAA;IAED;;;OAGG;IACH,SAAgB,WAAW,CAAC,EAAU;QACpC,OAAO,IAAI,CAAC,OAAO,KAAK,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAChD,CAAC;IAFe,gBAAW,cAE1B,CAAA;IAED;;OAEG;IACH,SAAgB,SAAS,CAAC,EAAc;QACtC,OAAO,IAAI,CAAC,OAAO,KAAK,EAAE,CAAC;IAC7B,CAAC;IAFe,cAAS,YAExB,CAAA;IAED;;;;;;;;;OASG;IACH,MAAa,SAAS;QACD,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;QAEzD;;WAEG;QACH,YAAmB,GAAa;YAC9B,IAAI,SAAS,KAAK,GAAG;gBACnB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QAED,qEAAqE;QAC9D,MAAM,CAAC,KAAgB;YAC5B,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;gBACnB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;gBAC7B,OAAO,KAAK,CAAC;YACf,CAAC;YAED,KAAK,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACzC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACvC,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;oBACtD,OAAO,KAAK,CAAC;gBACf,CAAC;gBAED,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;oBAC9B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC3B,OAAO,KAAK,CAAC;oBACf,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;QAED,uCAAuC;QAChC,KAAK;YACV,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACpB,CAAC;QAED,4BAA4B;QACrB,KAAK,CAAC,EAAc;YACzB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC;QAED,wCAAwC;QACjC,MAAM,CAAC,GAAY;YACxB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBACjC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACnB,CAAC;QAED,yDAAyD;QAClD,KAAK,CAAC,EAAc,IAAa,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5G,4BAA4B;QACrB,GAAG,CAAC,GAAW,EAAE,IAAY;YAClC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;gBACtB,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YAED,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QAED,iCAAiC;QAC1B,QAAQ,CAAC,EAAc;YAC5B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,6CAA6C;QACtC,SAAS,CAAC,GAAY;YAC3B,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBACjC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;QAED,iCAAiC;QAC1B,MAAM,CAAC,GAAW,EAAE,IAAY;YACrC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;gBACtB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAChB,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;oBAChB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,yDAAyD;QAClD,GAAG,CAAC,GAAW,EAAE,IAAY;YAClC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,SAAS,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC;QAED,mEAAmE;QAC5D,OAAO,CAAC,IAAgB;YAC7B,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;QAED,+CAA+C;QAC/C,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAE9D,sDAAsD;QACtD,IAAW,IAAI;YACb,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAExB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,sEAAsE;QAC/D,WAAW;YAChB,MAAM,GAAG,GAAc,EAAE,CAAC;YAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC;oBACxB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEjD,OAAO,GAAG,CAAC;QACb,CAAC;QAED,mEAAmE;QAC5D,SAAS;YACd,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;YAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC;oBACxB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEhD,OAAO,GAAG,CAAC;QACb,CAAC;QAED,sDAAsD;QAC/C,OAAO,CAAC,IAAsC;YACnD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC;oBACvB,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;KACF;IAzIY,cAAS,YAyIrB,CAAA;IAED;;;OAGG;IACH,MAAa,SAAS;QACD,IAAI,GAAG,IAAI,GAAG,EAA0B,CAAC;QAE5D,uCAAuC;QAChC,KAAK,KAAW,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3C,sCAAsC;QAC/B,OAAO,CAAC,EAAc,IAAmB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpH,qCAAqC;QAC9B,OAAO,CAAC,EAAc,EAAE,KAAQ,IAAU,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAErH,gDAAgD;QACzC,GAAG,CAAC,GAAW,EAAE,IAAY,EAAE,KAAQ;YAC5C,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;gBACtB,GAAG,GAAG,IAAI,GAAG,EAAa,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YAED,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACtB,CAAC;QAED,kDAAkD;QAC3C,GAAG,CAAC,GAAW,EAAE,IAAY;YAClC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,OAAO,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACtD,CAAC;QAED,mDAAmD;QACnD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9D,gDAAgD;QAChD,IAAW,IAAI;YACb,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI;gBAC3B,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAExB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,yDAAyD;QAClD,OAAO,CAAC,IAAgD;YAC7D,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,IAAI;gBAChC,KAAK,MAAM,UAAU,IAAI,UAAU,CAAC,CAAC,CAAC;oBACpC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;KACF;IA5CY,cAAS,YA4CrB,CAAA;AACH,CAAC,EAlmBgB,IAAI,oBAAJ,IAAI,QAkmBpB;AAgBD,SAAS,eAAe,CAAC,GAAW;IAClC,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC7D,CAAC;AACH,CAAC;AASD;;;;;GAKG;AACH,MAAa,mBAAmB;IAC9B,sGAAsG;IACtF,cAAc,CAAS;IAC/B,QAAQ,CAAS;IAEzB;;OAEG;IACH,YAAmB,cAAc,GAAG,CAAC;QACnC,eAAe,CAAC,cAAc,CAAC,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,QAAQ,GAAG,cAAc,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,yEAAyE;IAClE,OAAO;QACZ,OAAO,IAAI,CAAC,wBAAwB,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,OAAO,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;IACpE,CAAC;IAED,wDAAwD;IACjD,MAAM;QACX,OAAO;YACL,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,cAAc,EAAE,IAAI,CAAC,cAAc;SACpC,CAAC;IACJ,CAAC;IAED,sDAAsD;IAC/C,MAAM,CAAC,QAAQ,CAAC,KAA+B;QACpD,eAAe,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QAC/D,QAAQ,CAAC,QAAQ,GAAG,KAAK,CAAC,cAAc,CAAC;QACzC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,IAAI;QACT,OAAO;YACL,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,cAAc,EAAE,IAAI,CAAC,cAAc;SACpC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,MAAgC;QAC3C,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,GAAG,MAAM,CAAC;QAElD,eAAe,CAAC,cAAc,CAAC,CAAC;QAChC,eAAe,CAAC,cAAc,CAAC,CAAC;QAEhC,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YACzC,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC7D,CAAC;QAED,IAAI,cAAc,GAAG,cAAc,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAC;QAC3E,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACnD,IAAI,CAAC,QAAQ,IAAI,cAAc,GAAG,cAAc,CAAC;QAEjD,OAAO,CAAC,aAAqB,EAAE,EAAE;YAC/B,IAAI,aAAa,GAAG,cAAc,IAAI,aAAa,IAAI,cAAc,EAAE,CAAC;gBACtE,OAAO,aAAa,GAAG,KAAK,CAAC;YAC/B,CAAC;YAED,OAAO,aAAa,CAAC;QACvB,CAAC,CAAC;IACJ,CAAC;CACF;AA5FD,kDA4FC;AAED;;;;;;GAMG;AACH,IAAiB,IAAI,CAuDpB;AAvDD,WAAiB,IAAI;IACnB,MAAM,WAAW,GAAG,IAAI,MAAM,CAAC,+EAA+E,CAAC,CAAC;IAEhH,qEAAqE;IACxD,UAAK,GAAe,sCAAsC,CAAC;IAExE;;OAEG;IACH,SAAgB,MAAM,CAAC,KAAa;QAClC,OAAO,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAFe,WAAM,SAErB,CAAA;IAED,mEAAmE;IACnE,SAAgB,QAAQ,CAAC,KAAa;QACpC,OAAO,wFAAwF,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9G,CAAC;IAFe,aAAQ,WAEvB,CAAA;IAED,iCAAiC;IACjC,SAAgB,WAAW;QACzB,4EAA4E;QAC5E,OAAO,sCAAsC,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE;YACnE,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;YAC1C,OAAO,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC,CAAC,CAAC;IACL,CAAC;IAPe,gBAAW,cAO1B,CAAA;IAED;;;;;;;OAOG;IACH,SAAgB,SAAS,CAAC,KAAiB;QACzC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;QAE9C,gDAAgD;QAChD,IAAI,MAAM,CAAC,UAAU,CAAC;YACpB,OAAO,UAAU,CAAC;QAEpB,gHAAgH;QAChH,MAAM,WAAW,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACjD,MAAM,aAAa,GAAG,sEAAsE,CAAC;QAC7F,IAAI,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YACpC,OAAO,WAAW,CAAC,OAAO,CAAC,aAAa,EACtC,CAAC,MAAc,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAE,CAC7E,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,8DAA8D;QAC9D,OAAO,KAAK,CAAC;IACf,CAAC;IAlBe,cAAS,YAkBxB,CAAA;AACH,CAAC,EAvDgB,IAAI,oBAAJ,IAAI,QAuDpB","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/** @packageDocumentation\n * @module Ids\n */\n\n/** A string containing a well-formed string representation of an [Id64]($core-bentley).\n * See [Working with Ids]($docs/learning/common/Id64.md).\n * @public\n */\nexport type Id64String = string;\n\n/** A string containing a well-formed string representation of a [Guid]($core-bentley).\n * @public\n */\nexport type GuidString = string;\n\n/** A set of [[Id64String]]s.\n * @public\n */\nexport type Id64Set = Set<Id64String>;\n\n/** An array of [[Id64String]]s.\n * @public\n */\nexport type Id64Array = Id64String[];\n\n/** Used as an argument to a function that can accept one or more [[Id64String]]s.\n * @public\n */\nexport type Id64Arg = Id64String | Id64Set | Id64Array;\n\nfunction toHex(str: string): number {\n  const v = parseInt(str, 16);\n  return Number.isNaN(v) ? 0 : v;\n}\n\nfunction isLowerCaseNonZeroHexDigit(str: string, index: number) {\n  return isLowerCaseHexDigit(str, index, false);\n}\n\nfunction isLowerCaseHexDigit(str: string, index: number, allowZero: boolean = true): boolean {\n  const charCode = str.charCodeAt(index);\n  const minDecimalDigit = allowZero ? 0x30 : 0x31; // '0' or '1'...\n  return (charCode >= minDecimalDigit && charCode <= 0x39) || (charCode >= 0x61 && charCode <= 0x66); //  '0'-'9, 'a' -'f'\n}\n\nfunction isValidHexString(id: string, startIndex: number, len: number) {\n  if (len === 0)\n    return false;\n\n  // No leading zeroes...\n  if (!isLowerCaseNonZeroHexDigit(id, startIndex))\n    return false;\n\n  // ...followed by len-1 lowercase hexadecimal digits.\n  for (let i = 1; i < len; i++)\n    if (!isLowerCaseHexDigit(id, startIndex + i))\n      return false;\n\n  return true;\n}\n\n/**\n * The Id64 namespace provides facilities for working with 64-bit identifiers. These Ids are stored as 64-bit integers inside an [[IModelDb]], but must be represented\n * as strings in JavaScript because JavaScript does not intrinsically support 64-bit integers.\n *\n * The [[Id64String]] type alias is used to indicate function arguments, return types, and variables which are known to contain a well-formed representation of a 64-bit Id.\n *\n * See [Working with Ids]($docs/learning/common/Id64.md) for a detailed description and code examples.\n * @public\n */\nexport namespace Id64 {\n  /** Extract the \"local\" Id portion of an Id64String, contained in the lower 40 bits of the 64-bit value. */\n  export function getLocalId(id: Id64String): number {\n    if (isInvalid(id))\n      return 0;\n\n    const len = id.length;\n    const start = (len > 12) ? (len - 10) : 2;\n    return toHex(id.slice(start));\n  }\n\n  /** Extract the briefcase Id portion of an Id64String, contained in the upper 24 bits of the 64-bit value. */\n  export function getBriefcaseId(id: Id64String): number {\n    if (isInvalid(id))\n      return 0;\n\n    const len = id.length;\n    return (len <= 12) ? 0 : toHex(id.slice(2, len - 10));\n  }\n\n  /** Create an Id64String from its JSON representation.\n   * @param prop The JSON representation of an Id.\n   * @returns A well-formed Id string.\n   * @note if the input is undefined, the result is \"0\", indicating an invalid Id.\n   * @note if the input is not undefined, the result is the same as that of [[Id64.fromString]].\n   */\n  export function fromJSON(prop?: string): Id64String {\n    return typeof prop === \"string\" ? Id64.fromString(prop) : Id64.invalid;\n  }\n\n  /** Given a string value, attempt to normalize it into a well-formed Id string.\n   * If the input is already a well-formed Id string, it is returned unmodified.\n   * Otherwise, the input is trimmed of leading and trailing whitespace, converted to lowercase, and an attempt is made to parse it as a 64-bit hexadecimal integer.\n   * If parsing succeeds the normalized result is returned; otherwise the result is \"0\", indicating an invalid Id.\n   *\n   * For a description of \"well-formed\", see [Working with Ids]($docs/learning/common/Id64.md).\n   */\n  export function fromString(val: string): Id64String {\n    // NB: in case this is called from JavaScript, we must check the run-time type...\n    if (typeof val !== \"string\")\n      return invalid;\n\n    // Skip the common case in which the input is already a well-formed Id string\n    if (Id64.isId64(val))\n      return val;\n\n    // Attempt to normalize the input into a well-formed Id string\n    val = val.toLowerCase().trim();\n    const len = val.length;\n    if (len < 2 || val[0] !== \"0\" || val[1] !== \"x\")\n      return invalid;\n\n    let low = 0;\n    let high = 0;\n    let start = 2;\n    if (len > 12) {\n      start = (len - 10);\n      high = toHex(val.slice(2, start));\n    }\n\n    low = toHex(val.slice(start));\n    return fromLocalAndBriefcaseIds(low, high);\n  }\n\n  // Used when constructing local ID portion of Id64String. Performance optimization.\n  const _localIdPrefixByLocalIdLength = [\n    \"0000000000\",\n    \"000000000\",\n    \"00000000\",\n    \"0000000\",\n    \"000000\",\n    \"00000\",\n    \"0000\",\n    \"000\",\n    \"00\",\n    \"0\",\n    \"\",\n  ];\n\n  /** Produce an Id string from a local and briefcase Id.\n   * @param localId The non-zero local Id as an unsigned 40-bit integer.\n   * @param briefcaseId The briefcase Id as an unsigned 24-bit integer.\n   * @returns an Id64String containing the hexadecimal string representation of the unsigned 64-bit integer which would result from the\n   * operation `localId | (briefcaseId << 40)`, or an invalid Id \"0\" if the inputs are invalid.\n   */\n  export function fromLocalAndBriefcaseIds(localId: number, briefcaseId: number): Id64String {\n    // NB: Yes, we must check the run-time type...\n    if (typeof localId !== \"number\" || typeof briefcaseId !== \"number\")\n      return invalid;\n\n    localId = Math.floor(localId);\n    if (0 === localId)\n      return invalid;\n\n    briefcaseId = Math.floor(briefcaseId);\n    const lowStr = localId.toString(16);\n    return `0x${(briefcaseId === 0) ? lowStr : (briefcaseId.toString(16) + (_localIdPrefixByLocalIdLength[lowStr.length] + lowStr))}`;\n  }\n\n  // Used as a buffer when converting a pair of 32-bit integers to an Id64String. Significant performance optimization.\n  const scratchCharCodes = [\n    0x30, // \"0\"\n    0x78, // \"x\"\n    0x30, // \"0\"\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n    0x30,\n  ];\n\n  // Convert 4-bit unsigned integer to char code representing lower-case hexadecimal digit.\n  function uint4ToCharCode(uint4: number): number {\n    return uint4 + (uint4 < 10 ? 0x30 : 0x57);\n  }\n\n  // Convert char code representing lower-case hexadecimal digit to 4-bit unsigned integer.\n  function charCodeToUint4(char: number): number {\n    return char - (char >= 0x57 ? 0x57 : 0x30);\n  }\n\n  // Convert a substring to a uint32. This is twice as fast as using Number.parseInt().\n  function substringToUint32(id: Id64String, start: number, end: number): number {\n    let uint32 = 0;\n    for (let i = start; i < end; i++) {\n      const uint4 = charCodeToUint4(id.charCodeAt(i));\n      const shift = (end - i - 1) << 2;\n      const mask = uint4 << shift;\n      uint32 = (uint32 | mask) >>> 0; // >>> 0 to force unsigned because javascript\n    }\n\n    return uint32;\n  }\n\n  /** Create an Id64String from a pair of unsigned 32-bit integers.\n   * @param lowBytes The lower 4 bytes of the Id\n   * @param highBytes The upper 4 bytes of the Id\n   * @returns an Id64String containing the hexadecimal string representation of the unsigned 64-bit integer which would result from the\n   * operation `lowBytes | (highBytes << 32)`.\n   * @see [[Id64.fromUint32PairObject]] if you have a [[Id64.Uint32Pair]] object.\n   */\n  export function fromUint32Pair(lowBytes: number, highBytes: number): Id64String {\n    const localIdLow = lowBytes >>> 0;\n    const localIdHigh = (highBytes & 0x000000ff) * (0xffffffff + 1); // aka (highBytes & 0xff) << 32\n    const localId = localIdLow + localIdHigh; // aka localIdLow | localIdHigh\n    if (0 === localId)\n      return invalid;\n\n    // Need to omit or preserve leading zeroes...\n    const buffer = scratchCharCodes;\n    let index = 2;\n    for (let i = 7; i >= 0; i--) {\n      const shift = i << 2;\n      const mask = 0xf << shift;\n      const uint4 = (highBytes & mask) >>> shift;\n      if (index > 2 || 0 !== uint4)\n        buffer[index++] = uint4ToCharCode(uint4);\n    }\n\n    for (let i = 7; i >= 0; i--) {\n      const shift = i << 2;\n      const mask = 0xf << shift;\n      const uint4 = (lowBytes & mask) >>> shift;\n      if (index > 2 || 0 !== uint4)\n        buffer[index++] = uint4ToCharCode(uint4);\n    }\n\n    if (buffer.length !== index)\n      buffer.length = index;\n\n    return String.fromCharCode(...scratchCharCodes);\n  }\n\n  /** Create an Id64String from a [[Id64.Uint32Pair]].\n   * @see [[Id64.fromUint32Pair]].\n   */\n  export function fromUint32PairObject(pair: Uint32Pair): Id64String {\n    return fromUint32Pair(pair.lower, pair.upper);\n  }\n\n  /** Returns true if the inputs represent two halves of a valid 64-bit Id.\n   * @see [[Id64.Uint32Pair]].\n   */\n  export function isValidUint32Pair(lowBytes: number, highBytes: number): boolean {\n    // Detect local ID of zero\n    return 0 !== lowBytes || 0 !== (highBytes & 0x000000ff);\n  }\n\n  /** Represents an [[Id64]] as a pair of unsigned 32-bit integers. Because Javascript lacks efficient support for 64-bit integers,\n   * this representation can be useful in performance-sensitive code like the render loop.\n   * @see [[Id64.getUint32Pair]] to convert an [[Id64String]] to a Uint32Pair.\n   * @see [[Id64.fromUint32Pair]] to convert a Uint32Pair to an [[Id64String]].\n   * @see [[Id64.Uint32Set]] and [[Id64.Uint32Map]] for collections based on Uint32Pairs.\n   */\n  export interface Uint32Pair {\n    /** The lower 4 bytes of the 64-bit integer. */\n    lower: number;\n    /** The upper 4 bytes of the 64-bit integer. */\n    upper: number;\n  }\n\n  /** Convert an Id64String to a 64-bit unsigned integer represented as a pair of unsigned 32-bit integers.\n   * @param id The well-formed string representation of a 64-bit Id.\n   * @param out Used as the return value if supplied; otherwise a new object is returned.\n   * @returns An object containing the parsed lower and upper 32-bit integers comprising the 64-bit Id.\n   */\n  export function getUint32Pair(id: Id64String, out?: Uint32Pair): Uint32Pair {\n    if (!out)\n      out = { lower: 0, upper: 0 };\n\n    out.lower = getLowerUint32(id);\n    out.upper = getUpperUint32(id);\n    return out;\n  }\n\n  /** Extract an unsigned 32-bit integer from the lower 4 bytes of an Id64String. */\n  export function getLowerUint32(id: Id64String): number {\n    if (isInvalid(id))\n      return 0;\n\n    const end = id.length;\n    const start = end > 10 ? end - 8 : 2;\n    return substringToUint32(id, start, end);\n  }\n\n  /** Extract an unsigned 32-bit integer from the upper 4 bytes of an Id64String. */\n  export function getUpperUint32(id: Id64String): number {\n    const len = id.length;\n    if (len <= 10 || isInvalid(id))\n      return 0;\n\n    return substringToUint32(id, 2, len - 8);\n  }\n\n  /** Convert an [[Id64Arg]] into an [[Id64Set]].\n   *\n   * This method can be used by functions that accept an Id64Arg to conveniently process the value(s). For example:\n   * ```ts\n   *   public addCategories(arg: Id64Arg) { Id64.toIdSet(arg).forEach((id) => this.categories.add(id)); }\n   * ```\n   *\n   * Alternatively, to avoid allocating a new Id64Set, use [[Id64.iterable]].\n   *\n   * @param arg The Ids to convert to an Id64Set.\n   * @param makeCopy If true, and the input is already an Id64Set, returns a deep copy of the input.\n   * @returns An Id64Set containing the set of [[Id64String]]s represented by the Id64Arg.\n   */\n  export function toIdSet(arg: Id64Arg, makeCopy: boolean = false): Id64Set {\n    if (arg instanceof Set)\n      return makeCopy ? new Set<string>(arg) : arg;\n\n    const ids = new Set<Id64String>();\n    if (typeof arg === \"string\")\n      ids.add(arg);\n    else if (Array.isArray(arg)) {\n      arg.forEach((id: Id64String) => {\n        if (typeof id === \"string\")\n          ids.add(id);\n      });\n    }\n\n    return ids;\n  }\n\n  /** Obtain iterator over the specified Ids.\n   * @see [[Id64.iterable]].\n   */\n  export function* iterator(ids: Id64Arg): Iterator<Id64String> {\n    if (typeof ids === \"string\") {\n      yield ids;\n    } else {\n      for (const id of ids)\n        yield id;\n    }\n  }\n\n  /** Obtain an iterable over the specified Ids. Example usage:\n   * ```ts\n   *  const ids = [\"0x123\", \"0xfed\"];\n   *  for (const id of Id64.iterable(ids))\n   *    console.log(id);\n   * ```\n   */\n  export function iterable(ids: Id64Arg): Iterable<Id64String> {\n    return {\n      [Symbol.iterator]: () => iterator(ids),\n    };\n  }\n\n  /** Return the first [[Id64String]] of an [[Id64Arg]]. */\n  export function getFirst(arg: Id64Arg): Id64String {\n    return typeof arg === \"string\" ? arg : (Array.isArray(arg) ? arg[0] : arg.values().next().value) ?? Id64.invalid;\n  }\n\n  /** Return the number of [[Id64String]]s represented by an [[Id64Arg]]. */\n  export function sizeOf(arg: Id64Arg): number {\n    return typeof arg === \"string\" ? 1 : (Array.isArray(arg) ? arg.length : arg.size);\n  }\n\n  /** Returns true if the [[Id64Arg]] contains the specified Id. */\n  export function has(arg: Id64Arg, id: Id64String): boolean {\n    if (typeof arg === \"string\")\n      return arg === id;\n    if (Array.isArray(arg))\n      return -1 !== arg.indexOf(id);\n\n    return arg.has(id);\n  }\n\n  /** The string representation of an invalid Id. */\n  export const invalid = \"0\";\n\n  /** Determine if the supplied id string represents a transient Id.\n   * @param id A well-formed Id string.\n   * @returns true if the Id represents a transient Id.\n   * @note This method assumes the input is a well-formed Id string.\n   * @see [[Id64.isTransientId64]]\n   * @see [[TransientIdSequence]]\n   */\n  export function isTransient(id: Id64String): boolean {\n    // A transient Id is of the format \"0xffffffxxxxxxxxxx\" where the leading 6 digits indicate an invalid briefcase Id.\n    return 18 === id.length && id.startsWith(\"0xffffff\");\n  }\n\n  /** Determine if the input is a well-formed [[Id64String]] and represents a transient Id.\n   * @see [[Id64.isTransient]]\n   * @see [[Id64.isId64]]\n   * @see [[TransientIdSequence]]\n   */\n  export function isTransientId64(id: string): boolean {\n    return isValidId64(id) && isTransient(id);\n  }\n\n  /** Determine if the input is a well-formed [[Id64String]].\n   *\n   * For a description of \"well-formed\", see [Working with Ids]($docs/learning/common/Id64.md).\n   * @see [[Id64.isValidId64]]\n   */\n  export function isId64(id: string): boolean {\n    const len = id.length;\n    if (0 === len || 18 < len)\n      return false;\n\n    if (\"0\" !== id[0])\n      return false;\n\n    // Well-formed invalid Id: \"0\"\n    if (1 === len)\n      return true;\n\n    // Valid Ids begin with \"0x\" followed by at least one lower-case hexadecimal digit.\n    if (2 === len || \"x\" !== id[1])\n      return false;\n\n    // If briefcase Id is present, it occupies at least one digit, followed by 10 digits for local Id\n    let localIdStart = 2;\n    if (len > 12) {\n      localIdStart = len - 10;\n\n      // Verify briefcase Id\n      if (!isValidHexString(id, 2, localIdStart - 2))\n        return false;\n\n      // Skip leading zeroes in local Id\n      for (let i = localIdStart; i < len; i++) {\n        if (0x30 !== id.charCodeAt(i)) // '0'\n          break;\n        else\n          localIdStart++;\n      }\n\n      if (localIdStart >= len)\n        return false;\n    }\n\n    return isValidHexString(id, localIdStart, len - localIdStart);\n  }\n\n  /** Returns true if the input is not equal to the representation of an invalid Id.\n   * @note This method assumes the input is a well-formed Id string.\n   * @see [[Id64.isInvalid]]\n   * @see [[Id64.isValidId64]]\n   */\n  export function isValid(id: Id64String): boolean {\n    return Id64.invalid !== id;\n  }\n\n  /** Returns true if the input is a well-formed [[Id64String]] representing a valid Id.\n   * @see [[Id64.isValid]]\n   * @see [[Id64.isId64]]\n   */\n  export function isValidId64(id: string): boolean {\n    return Id64.invalid !== id && Id64.isId64(id);\n  }\n\n  /** Returns true if the input is a well-formed [[Id64String]] representing an invalid Id.\n   * @see [[Id64.isValid]]\n   */\n  export function isInvalid(id: Id64String): boolean {\n    return Id64.invalid === id;\n  }\n\n  /** A specialized replacement for Set<Id64String> optimized for performance-critical code which represents large sets of [[Id64]]s as pairs of\n   * 32-bit integers.\n   * The internal representation is a Map<number, Set<number>> where the Map key is the upper 4 bytes of the IDs and the Set elements are the lower 4 bytes of the IDs.\n   * Because the upper 4 bytes store the 24-bit briefcase ID plus the upper 8 bits of the local ID, there will be a very small distribution of unique Map keys.\n   * To further optimize this data type, the following assumptions are made regarding the { lower, upper } inputs, and no validation is performed to confirm them:\n   *  - The inputs are unsigned 32-bit integers;\n   *  - The inputs represent a valid Id64String (e.g., local ID is not zero).\n   * @see [[Id64.Uint32Map]] for a similarly-optimized replacement for Map<Id64String, T>\n   * @public\n   */\n  export class Uint32Set {\n    protected readonly _map = new Map<number, Set<number>>();\n\n    /** Construct a new Uint32Set.\n     * @param ids If supplied, all of the specified Ids will be added to the new set.\n     */\n    public constructor(ids?: Id64Arg) {\n      if (undefined !== ids)\n        this.addIds(ids);\n    }\n\n    /** Return true if `this` and `other` contain the same set of Ids. */\n    public equals(other: Uint32Set): boolean {\n      if (this === other) {\n        return true;\n      }\n\n      if (this.size !== other.size) {\n        return false;\n      }\n\n      for (const [key, thisValue] of this._map) {\n        const otherValue = other._map.get(key);\n        if (!otherValue || thisValue.size !== otherValue.size) {\n          return false;\n        }\n\n        for (const value of thisValue) {\n          if (!otherValue.has(value)) {\n            return false;\n          }\n        }\n      }\n\n      return true;\n    }\n\n    /** Remove all contents of this set. */\n    public clear(): void {\n      this._map.clear();\n    }\n\n    /** Add an Id to the set. */\n    public addId(id: Id64String): void {\n      this.add(Id64.getLowerUint32(id), Id64.getUpperUint32(id));\n    }\n\n    /** Add any number of Ids to the set. */\n    public addIds(ids: Id64Arg): void {\n      for (const id of Id64.iterable(ids))\n        this.addId(id);\n    }\n\n    /** Returns true if the set contains the specified Id. */\n    public hasId(id: Id64String): boolean { return this.has(Id64.getLowerUint32(id), Id64.getUpperUint32(id)); }\n\n    /** Add an Id to the set. */\n    public add(low: number, high: number): void {\n      let set = this._map.get(high);\n      if (undefined === set) {\n        set = new Set<number>();\n        this._map.set(high, set);\n      }\n\n      set.add(low);\n    }\n\n    /** Remove an Id from the set. */\n    public deleteId(id: Id64String): void {\n      this.delete(Id64.getLowerUint32(id), Id64.getUpperUint32(id));\n    }\n\n    /** Remove any number of Ids from the set. */\n    public deleteIds(ids: Id64Arg): void {\n      for (const id of Id64.iterable(ids))\n        this.deleteId(id);\n    }\n\n    /** Remove an Id from the set. */\n    public delete(low: number, high: number): void {\n      const set = this._map.get(high);\n      if (undefined !== set) {\n        set.delete(low);\n        if (set.size === 0)\n          this._map.delete(high);\n      }\n    }\n\n    /** Returns true if the set contains the specified Id. */\n    public has(low: number, high: number): boolean {\n      const set = this._map.get(high);\n      return undefined !== set && set.has(low);\n    }\n\n    /** Returns true if the set contains the Id specified by `pair`. */\n    public hasPair(pair: Uint32Pair): boolean {\n      return this.has(pair.lower, pair.upper);\n    }\n\n    /** Returns true if the set contains no Ids. */\n    public get isEmpty(): boolean { return 0 === this._map.size; }\n\n    /** Returns the number of Ids contained in the set. */\n    public get size(): number {\n      let size = 0;\n      for (const entry of this._map)\n        size += entry[1].size;\n\n      return size;\n    }\n\n    /** Populates and returns an array of all Ids contained in the set. */\n    public toId64Array(): Id64Array {\n      const ids: Id64Array = [];\n      for (const entry of this._map)\n        for (const low of entry[1])\n          ids.push(Id64.fromUint32Pair(low, entry[0]));\n\n      return ids;\n    }\n\n    /** Populates and returns a set of all Ids contained in the set. */\n    public toId64Set(): Id64Set {\n      const ids = new Set<string>();\n      for (const entry of this._map)\n        for (const low of entry[1])\n          ids.add(Id64.fromUint32Pair(low, entry[0]));\n\n      return ids;\n    }\n\n    /** Execute a function against each Id in this set. */\n    public forEach(func: (lo: number, hi: number) => void): void {\n      for (const entry of this._map)\n        for (const lo of entry[1])\n          func(lo, entry[0]);\n    }\n  }\n\n  /** A specialized replacement for Map<Id64String, T> optimized for performance-critical code.\n   * @see [[Id64.Uint32Set]] for implementation details.\n   * @public\n   */\n  export class Uint32Map<T> {\n    protected readonly _map = new Map<number, Map<number, T>>();\n\n    /** Remove all entries from the map. */\n    public clear(): void { this._map.clear(); }\n    /** Find an entry in the map by Id. */\n    public getById(id: Id64String): T | undefined { return this.get(Id64.getLowerUint32(id), Id64.getUpperUint32(id)); }\n    /** Set an entry in the map by Id. */\n    public setById(id: Id64String, value: T): void { this.set(Id64.getLowerUint32(id), Id64.getUpperUint32(id), value); }\n\n    /** Set an entry in the map by Id components. */\n    public set(low: number, high: number, value: T): void {\n      let map = this._map.get(high);\n      if (undefined === map) {\n        map = new Map<number, T>();\n        this._map.set(high, map);\n      }\n\n      map.set(low, value);\n    }\n\n    /** Get an entry from the map by Id components. */\n    public get(low: number, high: number): T | undefined {\n      const map = this._map.get(high);\n      return undefined !== map ? map.get(low) : undefined;\n    }\n\n    /** Returns true if the map contains no entries. */\n    public get isEmpty(): boolean { return 0 === this._map.size; }\n    /** Returns the number of entries in the map. */\n    public get size(): number {\n      let size = 0;\n      for (const entry of this._map)\n        size += entry[1].size;\n\n      return size;\n    }\n\n    /** Execute a function against each entry in this map. */\n    public forEach(func: (lo: number, hi: number, value: T) => void): void {\n      for (const outerEntry of this._map)\n        for (const innerEntry of outerEntry[1])\n          func(innerEntry[0], outerEntry[0], innerEntry[1]);\n    }\n  }\n}\n\n/** JSON representation of a [[TransientIdSequence]], primarily useful for transferring sequences to and from a [Worker](https://developer.mozilla.org/en-US/docs/Web/API/Worker).\n * It stores two \"local\" 40-bit Ids describing the range of [Id64String]($docs/learning/common/Id64.md)s generated by the sequence.\n * @public\n */\nexport interface TransientIdSequenceProps {\n  /** The starting local Id. The sequence begins at `initialLocalId + 1`. */\n  initialLocalId: number;\n  /** The maximum local Id generated by the sequence thus far. It is never less than [[initialLocalId]]. If it is equal to [[initialLocalId]], then the sequence has\n   * not yet generated any Ids.\n   * The next local Id generated by the sequence will be `currentLocalId + 1`.\n   */\n  currentLocalId: number;\n}\n\nfunction validateLocalId(num: number): void {\n  if (num < 0 || Math.round(num) !== num) {\n    throw new Error(\"Local Id must be a non-negative integer\");\n  }\n}\n\n/** A function returned by [[TransientIdSequence.merge]] that remaps the local Id portion of an [Id64String]($docs/learning/common/Id64.md) generated by\n * the source sequence to the corresponding local Id in the target sequence.\n * It returns `sourceLocalId` if the input did not originate from the source sequence.\n* @public\n*/\nexport type RemapTransientLocalId = (sourceLocalId: number) => number;\n\n/**\n * Generates unique [[Id64String]] values in sequence, which are guaranteed not to conflict with Ids associated with persistent elements or models.\n * This is useful for associating stable, non-persistent identifiers with things like [Decorator]($frontend)s.\n * A TransientIdSequence can generate a maximum of (2^40)-2 unique Ids.\n * @public\n */\nexport class TransientIdSequence {\n  /** The starting local Id provided to the constructor. The sequence begins at `initialLocalId + 1`. */\n  public readonly initialLocalId: number;\n  private _localId: number;\n\n  /** Constructor.\n   * @param initialLocalId The starting local Id. The local Id of the first [[Id64String]] generated by [[getNext]] will be `initialLocalId + 1`.\n   */\n  public constructor(initialLocalId = 0) {\n    validateLocalId(initialLocalId);\n    this.initialLocalId = initialLocalId;\n    this._localId = initialLocalId;\n  }\n\n  /** The maximum local Id generated by the sequence thus far. It is never less than [[initialLocalId]]. If it is equal to [[initialLocalId]], then the sequence has\n   * not yet generated any Ids.\n   * Each call to [[getNext]] increments this by 1 and uses it as the local Id of the generated [[Id64String]].\n   */\n  public get currentLocalId(): number {\n    return this._localId;\n  }\n\n  /** Generate and return the next transient Id64String in the sequence. */\n  public getNext(): Id64String {\n    return Id64.fromLocalAndBriefcaseIds(++this._localId, 0xffffff);\n  }\n\n  /** Preview the transient Id64String that will be returned by the next call to [[getNext]].\n   * This is primarily useful for tests.\n   */\n  public peekNext(): Id64String {\n    return Id64.fromLocalAndBriefcaseIds(this._localId + 1, 0xffffff);\n  }\n\n  /** Convert this sequence to its JSON representation. */\n  public toJSON(): TransientIdSequenceProps {\n    return {\n      initialLocalId: this.initialLocalId,\n      currentLocalId: this.currentLocalId,\n    };\n  }\n\n  /** Create a sequence from its JSON representation. */\n  public static fromJSON(props: TransientIdSequenceProps): TransientIdSequence {\n    validateLocalId(props.currentLocalId);\n    const sequence = new TransientIdSequence(props.initialLocalId);\n    sequence._localId = props.currentLocalId;\n    return sequence;\n  }\n\n  /** Obtain the JSON representation of a new sequence that diverges from this sequence, with its [[initialLocalId]] set to this sequence's [[currentLocalId]].\n   * The two sequences can generate Ids independently. Later, you can [[merge]] the sequences, resolving conflicts where the two sequences generated identical Ids.\n   * This is chiefly useful when generating transient Ids on a [Worker](https://developer.mozilla.org/en-US/docs/Web/API/Worker).\n   */\n  public fork(): TransientIdSequenceProps {\n    return {\n      initialLocalId: this.currentLocalId,\n      currentLocalId: this.currentLocalId,\n    };\n  }\n\n  /** Integrate the Ids generated by a [[fork]] of this sequence. All of the Ids generated by `source` will be remapped to Ids at the end of this sequence.\n   * This is chiefly useful when generating transient Ids on a [Worker](https://developer.mozilla.org/en-US/docs/Web/API/Worker).\n   * @param source The JSON representation of the [[fork]]ed sequence to be merged with this one.\n   * @returns a function that permits you to remap the local Ids generated by `source` into the corresponding local Ids assigned by this sequence.\n   * @throws Error if `source` is not a fork of this sequence or is malformed (e.g., contains negative and/or non-integer local Ids).\n   */\n  public merge(source: TransientIdSequenceProps): (sourceLocalId: number) => number {\n    const { initialLocalId, currentLocalId } = source;\n\n    validateLocalId(initialLocalId);\n    validateLocalId(currentLocalId);\n\n    if (initialLocalId > this.currentLocalId) {\n      throw new Error(\"Transient Id sequences do not intersect\");\n    }\n\n    if (initialLocalId > currentLocalId) {\n      throw new Error(\"Current local Id cannot be less than initial local Id\");\n    }\n\n    const delta = this.currentLocalId - initialLocalId;\n    this._localId += currentLocalId - initialLocalId;\n\n    return (sourceLocalId: number) => {\n      if (sourceLocalId > initialLocalId && sourceLocalId <= currentLocalId) {\n        return sourceLocalId + delta;\n      }\n\n      return sourceLocalId;\n    };\n  }\n}\n\n/**\n * The Guid namespace provides facilities for working with GUID strings using the \"8-4-4-4-12\" pattern.\n *\n * The [[GuidString]] type alias is used to indicate function arguments, return types, and variables which are known to\n * be in the GUID format.\n * @public\n */\nexport namespace Guid {\n  const uuidPattern = new RegExp(\"^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}$\");\n\n  /** Represents the empty Guid 00000000-0000-0000-0000-000000000000 */\n  export const empty: GuidString = \"00000000-0000-0000-0000-000000000000\";\n\n  /** Determine whether the input string is \"guid-like\". That is, it follows the 8-4-4-4-12 pattern. This does not enforce\n   *  that the string is actually in valid UUID format.\n   */\n  export function isGuid(value: string): boolean {\n    return uuidPattern.test(value);\n  }\n\n  /** Determine whether the input string is a valid V4 Guid string */\n  export function isV4Guid(value: string): boolean {\n    return /^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-4[0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$/.test(value);\n  }\n\n  /** Create a new V4 Guid value */\n  export function createValue(): GuidString {\n    // https://stackoverflow.com/questions/105034/create-guid-uuid-in-javascript\n    return \"xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx\".replace(/[xy]/g, (c) => {\n      const r = Math.random() * 16 | 0;\n      const v = c === \"x\" ? r : (r & 0x3 | 0x8);\n      return v.toString(16);\n    });\n  }\n\n  /**\n   * Normalize a Guid string if possible. Normalization consists of:\n   * - Convert all characters to lower case\n   * - Trim any leading or trailing whitespace\n   * - Convert to the standard Guid format \"8-4-4-4-12\", repositioning the '-' characters as necessary, presuming there are exactly 32 hexadecimal digits.\n   * @param value Input value that represents a Guid\n   * @returns Normalized representation of the Guid string. If the normalization fails, return the *original* value unmodified (Note: it is *not* a valid Guid)\n   */\n  export function normalize(value: GuidString): GuidString {\n    const lowerValue = value.toLowerCase().trim();\n\n    // Return if it's already formatted to be a Guid\n    if (isGuid(lowerValue))\n      return lowerValue;\n\n    // Remove any existing \"-\" characters and position them properly, if there remains exactly 32 hexadecimal digits\n    const noDashValue = lowerValue.replace(/-/g, \"\");\n    const noDashPattern = /^([0-9a-f]{8})([0-9a-f]{4})([0-9a-f]{4})([0-9a-f]{4})([0-9a-f]{12})$/;\n    if (noDashPattern.test(noDashValue)) {\n      return noDashValue.replace(noDashPattern,\n        (_match: string, p1: string, p2: string, p3: string, p4: string, p5: string) =>\n          `${p1}-${p2}-${p3}-${p4}-${p5}`);\n    }\n\n    // Return unmodified string - (note: it is *not* a valid Guid)\n    return value;\n  }\n}\n"]}

package/lib/cjs/IndexMap.js

@@ -13,6 +13,8 @@ const SortedArray_1 = require("./SortedArray");
  * @public
  */
 class IndexedValue {
+    value;
+    index;
     constructor(value, index) {
         this.value = value;
         this.index = index;
@@ -26,6 +28,10 @@ exports.IndexedValue = IndexedValue;
  * @public
  */
 class IndexMap {
+    _array = [];
+    _compareValues;
+    _clone;
+    _maximumSize;
     /**
      * Construct a new IndexMap<T>.
      * @param compare The function used to compare elements within the map.
@@ -33,7 +39,6 @@ class IndexMap {
      * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.
      */
     constructor(compare, maximumSize = Number.MAX_SAFE_INTEGER, clone = SortedArray_1.shallowClone) {
-        this._array = [];
         this._compareValues = compare;
         this._clone = clone;
         this._maximumSize = maximumSize;

package/lib/cjs/IndexMap.js.map

@@ -1 +1 @@
-{"version":3,"file":"IndexMap.js","sourceRoot":"","sources":["../../src/IndexMap.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,+CAAwE;AAExE;;GAEG;AACH,MAAa,YAAY;IAIvB,YAAmB,KAAQ,EAAE,KAAa;QACxC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AARD,oCAQC;AAED;;;;;GAKG;AACH,MAAa,QAAQ;IAMnB;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,cAAsB,MAAM,CAAC,gBAAgB,EAAE,QAA0B,0BAAY;QAX7H,WAAM,GAA2B,EAAE,CAAC;QAY5C,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,yEAAyE;IACzE,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IAEzE,oDAAoD;IACpD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,yCAAyC;IAClC,KAAK,KAAW,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;IAE1C;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,KAAQ,EAAE,QAA4B;QAClD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,KAAK,CAAC,KAAK;YACb,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC;aACnC,IAAI,IAAI,CAAC,MAAM;YAClB,OAAO,CAAC,CAAC,CAAC;QAEZ,MAAM,KAAK,GAAG,IAAI,YAAY,CAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAE1E,IAAI,SAAS,KAAK,QAAQ;YACxB,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAExB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC1C,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,KAAQ;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IAES,UAAU,CAAC,KAAQ,IAAuC,OAAO,IAAA,wBAAU,EAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,GAAM,EAAE,GAAoB,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnL,+IAA+I;IACxI,OAAO;QACZ,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAC7B,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QAEnC,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA9ED,4BA8EC","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/** @packageDocumentation\n * @module Collections\n */\n\nimport { OrderedComparator } from \"./Compare\";\nimport { CloneFunction, lowerBound, shallowClone } from \"./SortedArray\";\n\n/** Associates a value of type T with an index representing its insertion order in an IndexMap<T>\n * @public\n */\nexport class IndexedValue<T> {\n  public readonly value: T;\n  public readonly index: number;\n\n  public constructor(value: T, index: number) {\n    this.value = value;\n    this.index = index;\n  }\n}\n\n/**\n * Maintains a set of unique elements in sorted order and retains the insertion order of each.\n * The uniqueness of the elements is determined by a comparison routine supplied by the user.\n * The user may also supply a maximum size, beyond which insertions will fail.\n * @public\n */\nexport class IndexMap<T> {\n  protected _array: Array<IndexedValue<T>> = [];\n  protected readonly _compareValues: OrderedComparator<T>;\n  protected readonly _clone: CloneFunction<T>;\n  protected readonly _maximumSize: number;\n\n  /**\n   * Construct a new IndexMap<T>.\n   * @param compare The function used to compare elements within the map.\n   * @param maximumSize The maximum number of elements permitted in the IndexMap. The maximum index of an element is maximumSize-1.\n   * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\n   */\n  public constructor(compare: OrderedComparator<T>, maximumSize: number = Number.MAX_SAFE_INTEGER, clone: CloneFunction<T> = shallowClone) {\n    this._compareValues = compare;\n    this._clone = clone;\n    this._maximumSize = maximumSize;\n  }\n\n  /** The number of elements in the map. */\n  public get length(): number { return this._array.length; }\n\n  /** Returns true if the maximum number of elements have been inserted. */\n  public get isFull(): boolean { return this.length >= this._maximumSize; }\n\n  /** Returns true if the map contains no elements. */\n  public get isEmpty(): boolean { return 0 === this.length; }\n\n  /** Removes all elements from the map. */\n  public clear(): void { this._array = []; }\n\n  /** Attempt to insert a new value into the map.\n   * If an equivalent element already exists in the map, the corresponding index is returned.\n   * If the map is full, nothing is inserted and -1 is returned.\n   * Otherwise:\n   *  The new element is mapped to the next-available index (that is, the length of the map prior to insertion of this new element);\n   *  the value is cloned using the function supplied to the IndexMap constructor;\n   *  the cloned result is inserted into the map; and\n   *  the index of the new element is returned.\n   * @param value The value to insert\n   * @param onInsert The optional callback method to call if insertion occurs with the inserted value\n   * @returns the index of the equivalent element in the map, or -1 if the map is full and no equivalent element exists.\n   */\n  public insert(value: T, onInsert?: (value: T) => any): number {\n    const bound = this.lowerBound(value);\n    if (bound.equal)\n      return this._array[bound.index].index;\n    else if (this.isFull)\n      return -1;\n\n    const entry = new IndexedValue<T>(this._clone(value), this._array.length);\n\n    if (undefined !== onInsert)\n      onInsert(entry.value);\n\n    this._array.splice(bound.index, 0, entry);\n    return entry.index;\n  }\n\n  /**\n   * Finds the index of an element equivalent to the supplied value.\n   * @param value the value to find\n   * @returns the index of an equivalent element in the map, or -1 if no such element exists.\n   */\n  public indexOf(value: T): number {\n    const bound = this.lowerBound(value);\n    return bound.equal ? this._array[bound.index].index : -1;\n  }\n\n  protected lowerBound(value: T): { index: number, equal: boolean } { return lowerBound(value, this._array, (lhs: T, rhs: IndexedValue<T>) => this._compareValues(lhs, rhs.value)); }\n\n  /** Return an array of the elements in this map in which the array index of each element corresponds to the index assigned to it by the map. */\n  public toArray(): T[] {\n    const array: T[] = [];\n    for (const entry of this._array)\n      array[entry.index] = entry.value;\n\n    return array;\n  }\n}\n"]}
+{"version":3,"file":"IndexMap.js","sourceRoot":"","sources":["../../src/IndexMap.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,+CAAwE;AAExE;;GAEG;AACH,MAAa,YAAY;IACP,KAAK,CAAI;IACT,KAAK,CAAS;IAE9B,YAAmB,KAAQ,EAAE,KAAa;QACxC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AARD,oCAQC;AAED;;;;;GAKG;AACH,MAAa,QAAQ;IACT,MAAM,GAA2B,EAAE,CAAC;IAC3B,cAAc,CAAuB;IACrC,MAAM,CAAmB;IACzB,YAAY,CAAS;IAExC;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,cAAsB,MAAM,CAAC,gBAAgB,EAAE,QAA0B,0BAAY;QACrI,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,yEAAyE;IACzE,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IAEzE,oDAAoD;IACpD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,yCAAyC;IAClC,KAAK,KAAW,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;IAE1C;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,KAAQ,EAAE,QAA4B;QAClD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,KAAK,CAAC,KAAK;YACb,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC;aACnC,IAAI,IAAI,CAAC,MAAM;YAClB,OAAO,CAAC,CAAC,CAAC;QAEZ,MAAM,KAAK,GAAG,IAAI,YAAY,CAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAE1E,IAAI,SAAS,KAAK,QAAQ;YACxB,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAExB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC1C,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,KAAQ;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IAES,UAAU,CAAC,KAAQ,IAAuC,OAAO,IAAA,wBAAU,EAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,GAAM,EAAE,GAAoB,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnL,+IAA+I;IACxI,OAAO;QACZ,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAC7B,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QAEnC,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA9ED,4BA8EC","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/** @packageDocumentation\n * @module Collections\n */\n\nimport { OrderedComparator } from \"./Compare\";\nimport { CloneFunction, lowerBound, shallowClone } from \"./SortedArray\";\n\n/** Associates a value of type T with an index representing its insertion order in an IndexMap<T>\n * @public\n */\nexport class IndexedValue<T> {\n  public readonly value: T;\n  public readonly index: number;\n\n  public constructor(value: T, index: number) {\n    this.value = value;\n    this.index = index;\n  }\n}\n\n/**\n * Maintains a set of unique elements in sorted order and retains the insertion order of each.\n * The uniqueness of the elements is determined by a comparison routine supplied by the user.\n * The user may also supply a maximum size, beyond which insertions will fail.\n * @public\n */\nexport class IndexMap<T> {\n  protected _array: Array<IndexedValue<T>> = [];\n  protected readonly _compareValues: OrderedComparator<T>;\n  protected readonly _clone: CloneFunction<T>;\n  protected readonly _maximumSize: number;\n\n  /**\n   * Construct a new IndexMap<T>.\n   * @param compare The function used to compare elements within the map.\n   * @param maximumSize The maximum number of elements permitted in the IndexMap. The maximum index of an element is maximumSize-1.\n   * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\n   */\n  public constructor(compare: OrderedComparator<T>, maximumSize: number = Number.MAX_SAFE_INTEGER, clone: CloneFunction<T> = shallowClone) {\n    this._compareValues = compare;\n    this._clone = clone;\n    this._maximumSize = maximumSize;\n  }\n\n  /** The number of elements in the map. */\n  public get length(): number { return this._array.length; }\n\n  /** Returns true if the maximum number of elements have been inserted. */\n  public get isFull(): boolean { return this.length >= this._maximumSize; }\n\n  /** Returns true if the map contains no elements. */\n  public get isEmpty(): boolean { return 0 === this.length; }\n\n  /** Removes all elements from the map. */\n  public clear(): void { this._array = []; }\n\n  /** Attempt to insert a new value into the map.\n   * If an equivalent element already exists in the map, the corresponding index is returned.\n   * If the map is full, nothing is inserted and -1 is returned.\n   * Otherwise:\n   *  The new element is mapped to the next-available index (that is, the length of the map prior to insertion of this new element);\n   *  the value is cloned using the function supplied to the IndexMap constructor;\n   *  the cloned result is inserted into the map; and\n   *  the index of the new element is returned.\n   * @param value The value to insert\n   * @param onInsert The optional callback method to call if insertion occurs with the inserted value\n   * @returns the index of the equivalent element in the map, or -1 if the map is full and no equivalent element exists.\n   */\n  public insert(value: T, onInsert?: (value: T) => any): number {\n    const bound = this.lowerBound(value);\n    if (bound.equal)\n      return this._array[bound.index].index;\n    else if (this.isFull)\n      return -1;\n\n    const entry = new IndexedValue<T>(this._clone(value), this._array.length);\n\n    if (undefined !== onInsert)\n      onInsert(entry.value);\n\n    this._array.splice(bound.index, 0, entry);\n    return entry.index;\n  }\n\n  /**\n   * Finds the index of an element equivalent to the supplied value.\n   * @param value the value to find\n   * @returns the index of an equivalent element in the map, or -1 if no such element exists.\n   */\n  public indexOf(value: T): number {\n    const bound = this.lowerBound(value);\n    return bound.equal ? this._array[bound.index].index : -1;\n  }\n\n  protected lowerBound(value: T): { index: number, equal: boolean } { return lowerBound(value, this._array, (lhs: T, rhs: IndexedValue<T>) => this._compareValues(lhs, rhs.value)); }\n\n  /** Return an array of the elements in this map in which the array index of each element corresponds to the index assigned to it by the map. */\n  public toArray(): T[] {\n    const array: T[] = [];\n    for (const entry of this._array)\n      array[entry.index] = entry.value;\n\n    return array;\n  }\n}\n"]}

package/lib/cjs/LRUMap.js

@@ -18,6 +18,10 @@ const Dictionary_1 = require("./Dictionary");
  * @public
  */
 class Entry {
+    key;
+    value;
+    newer;
+    older;
     constructor(key, value) {
         this.key = key;
         this.value = value;
@@ -25,6 +29,7 @@ class Entry {
 }
 exports.Entry = Entry;
 class EntryIterator {
+    _entry;
     constructor(oldestEntry) {
         this._entry = oldestEntry;
     }
@@ -38,6 +43,7 @@ class EntryIterator {
     }
 }
 class KeyIterator {
+    _entry;
     constructor(oldestEntry) {
         this._entry = oldestEntry;
     }
@@ -50,6 +56,7 @@ class KeyIterator {
     }
 }
 class ValueIterator {
+    _entry;
     constructor(oldestEntry) {
         this._entry = oldestEntry;
     }
@@ -82,6 +89,15 @@ class ValueIterator {
  * @public
  */
 class LRUCache {
+    _container;
+    /** Current number of items */
+    size;
+    /** Maximum number of items this cache can hold */
+    limit;
+    /** Least recently-used entry. Invalidated when cache is modified. */
+    oldest;
+    /** Most recently-used entry. Invalidated when cache is modified. */
+    newest;
     /**
      * Construct a new LRUCache to hold up to `limit` entries.
      */