@itwin/core-bentley 5.0.0-dev.9 → 5.0.0-dev.92

package/lib/cjs/BentleyLoggerCategory.js.map

@@ -1 +1 @@
-{"version":3,"file":"BentleyLoggerCategory.js","sourceRoot":"","sources":["../../src/BentleyLoggerCategory.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;;GAGG;AACH,IAAY,qBAGX;AAHD,WAAY,qBAAqB;IAC/B,2EAA2E;IAC3E,oDAA2B,CAAA;AAC7B,CAAC,EAHW,qBAAqB,qCAArB,qBAAqB,QAGhC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Logging\r\n */\r\n\r\n/** Logger categories used by this package\r\n * @see [Logger]($bentley)\r\n * @public\r\n */\r\nexport enum BentleyLoggerCategory {\r\n  /** The logger category used by common classes relating to ElementProps. */\r\n  Performance = \"Performance\",\r\n}\r\n"]}
+{"version":3,"file":"BentleyLoggerCategory.js","sourceRoot":"","sources":["../../src/BentleyLoggerCategory.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;;GAGG;AACH,IAAY,qBAGX;AAHD,WAAY,qBAAqB;IAC/B,2EAA2E;IAC3E,oDAA2B,CAAA;AAC7B,CAAC,EAHW,qBAAqB,qCAArB,qBAAqB,QAGhC","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 Logging\n */\n\n/** Logger categories used by this package\n * @see [Logger]($bentley)\n * @public\n */\nexport enum BentleyLoggerCategory {\n  /** The logger category used by common classes relating to ElementProps. */\n  Performance = \"Performance\",\n}\n"]}

package/lib/cjs/ByteStream.d.ts

@@ -24,15 +24,12 @@ export declare class ByteStream {
      * ArrayBuffer. If `bytes` represents only a **sub-range** of the underlying buffer's data, the results will be unexpected unless the optional `subView`
      * argument is supplied, with correct offset and length.
      *
-     * For both of the above reasons, prefer to use [[fromUint8Array]].
-     * @deprecated in 3.x. Use [[fromUint8Array]] or [[fromArrayBuffer]].
+     * For both of the above reasons, this constructor is private, and [[fromUint8Array]] or [[fromArrayBuffer]] should be used to create a ByteStream.
      */
-    constructor(buffer: ArrayBuffer | SharedArrayBuffer, subView?: {
-        byteOffset: number;
-        byteLength: number;
-    });
+    private constructor();
     /** Construct a new ByteStream for the range of bytes represented by `bytes`, which may be a subset of the range of bytes
      * represented by the underlying ArrayBuffer. The read position will be set to the beginning of the range of bytes.
+     * @param bytes The Uint8Array from which data is to be extracted.
      */
     static fromUint8Array(bytes: Uint8Array): ByteStream;
     /** Construct a new ByteStream with the read position set to the beginning.
@@ -80,22 +77,6 @@ export declare class ByteStream {
     readId64(): Id64String;
     /** Read an unsigned 24-bit integer from the current read position and advance by 3 bytes. */
     readUint24(): number;
-    /** @deprecated in 3.x. use [[readUint8]]. */
-    get nextUint8(): number;
-    /** @deprecated in 3.x. use [[readUint16]]. */
-    get nextUint16(): number;
-    /** @deprecated in 3.x. use [[readUint32]]. */
-    get nextUint32(): number;
-    /** @deprecated in 3.x. use [[readInt32]]. */
-    get nextInt32(): number;
-    /** @deprecated in 3.x. use [[readFloat32]]. */
-    get nextFloat32(): number;
-    /** @deprecated in 3.x. use [[readFloat64]]. */
-    get nextFloat64(): number;
-    /** @deprecated in 3.x. use [[readId64]]. */
-    get nextId64(): Id64String;
-    /** @deprecated in 3.x. use [[readUint32]]. */
-    get nextUint24(): number;
     /** Read the specified number of bytes beginning at the current read position into a Uint8Array and advance by the specified number of byte.
      * @param numBytes The number of bytes to read.
      */

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

@@ -1 +1 @@
-{"version":3,"file":"ByteStream.d.ts","sourceRoot":"","sources":["../../src/ByteStream.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAQ,UAAU,EAAE,MAAM,MAAM,CAAC;AAExC;;;;;;GAMG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;IACjC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,OAAO,CAAa;IAE5B;;;;;;;;;;;;;OAaG;gBACgB,MAAM,EAAE,WAAW,GAAG,iBAAiB,EAAE,OAAO,CAAC,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE;IAUhH;;OAEG;WACW,cAAc,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU;IAK3D;;;OAGG;WACW,eAAe,CAAC,MAAM,EAAE,WAAW,GAAG,iBAAiB,EAAE,OAAO,CAAC,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,UAAU;IAIxI,yCAAyC;IACzC,IAAW,MAAM,IAAI,MAAM,CAE1B;IAED,0FAA0F;IAC1F,IAAW,eAAe,IAAI,MAAM,CAEnC;IAED;;OAEG;IACH,IAAW,YAAY,IAAI,OAAO,CAEjC;IAED;;OAEG;IACH,IAAW,UAAU,IAAI,OAAO,CAE/B;IAED,sEAAsE;IACtE,IAAW,MAAM,IAAI,MAAM,CAAyB;IACpD,IAAW,MAAM,CAAC,GAAG,EAAE,MAAM,EAG5B;IAED,sEAAsE;IAC/D,OAAO,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAKzC,6EAA6E;IACtE,MAAM,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAQxC,sEAAsE;IAC/D,KAAK,IAAI,IAAI;IAEpB,0FAA0F;IACnF,SAAS,IAAI,MAAM;IAC1B,6FAA6F;IACtF,UAAU,IAAI,MAAM;IAC3B,6FAA6F;IACtF,UAAU,IAAI,MAAM;IAC3B,0FAA0F;IACnF,SAAS,IAAI,MAAM;IAC1B,iGAAiG;IAC1F,WAAW,IAAI,MAAM;IAC5B,iGAAiG;IAC1F,WAAW,IAAI,MAAM;IAC5B,wIAAwI;IACjI,QAAQ,IAAI,UAAU;IAC7B,6FAA6F;IACtF,UAAU,IAAI,MAAM;IAE3B,6CAA6C;IAC7C,IAAW,SAAS,IAAI,MAAM,CAA6B;IAC3D,8CAA8C;IAC9C,IAAW,UAAU,IAAI,MAAM,CAA8B;IAC7D,8CAA8C;IAC9C,IAAW,UAAU,IAAI,MAAM,CAA8B;IAC7D,6CAA6C;IAC7C,IAAW,SAAS,IAAI,MAAM,CAA6B;IAC3D,+CAA+C;IAC/C,IAAW,WAAW,IAAI,MAAM,CAA+B;IAC/D,+CAA+C;IAC/C,IAAW,WAAW,IAAI,MAAM,CAA+B;IAC/D,4CAA4C;IAC5C,IAAW,QAAQ,IAAI,UAAU,CAA4B;IAC7D,8CAA8C;IAC9C,IAAW,UAAU,IAAI,MAAM,CAA8B;IAE7D;;OAEG;IACI,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,UAAU;IAM9C,qGAAqG;IAC9F,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,UAAU;IAI/D,0HAA0H;IACnH,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,WAAW;IAOnD,0CAA0C;IAC1C,IAAW,WAAW,IAAI,WAAW,GAAG,iBAAiB,CAA8B;IAEvF,OAAO,CAAC,IAAI;CAKb"}
+{"version":3,"file":"ByteStream.d.ts","sourceRoot":"","sources":["../../src/ByteStream.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAQ,UAAU,EAAE,MAAM,MAAM,CAAC;AAExC;;;;;;GAMG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;IACjC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,OAAO,CAAa;IAE5B;;;;;;;;;;;;OAYG;IACH,OAAO;IAUP;;;OAGG;WACW,cAAc,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU;IAK3D;;;OAGG;WACW,eAAe,CAAC,MAAM,EAAE,WAAW,GAAG,iBAAiB,EAAE,OAAO,CAAC,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,UAAU;IAIxI,yCAAyC;IACzC,IAAW,MAAM,IAAI,MAAM,CAE1B;IAED,0FAA0F;IAC1F,IAAW,eAAe,IAAI,MAAM,CAEnC;IAED;;OAEG;IACH,IAAW,YAAY,IAAI,OAAO,CAEjC;IAED;;OAEG;IACH,IAAW,UAAU,IAAI,OAAO,CAE/B;IAED,sEAAsE;IACtE,IAAW,MAAM,IAAI,MAAM,CAAyB;IACpD,IAAW,MAAM,CAAC,GAAG,EAAE,MAAM,EAG5B;IAED,sEAAsE;IAC/D,OAAO,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAKzC,6EAA6E;IACtE,MAAM,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAQxC,sEAAsE;IAC/D,KAAK,IAAI,IAAI;IAEpB,0FAA0F;IACnF,SAAS,IAAI,MAAM;IAC1B,6FAA6F;IACtF,UAAU,IAAI,MAAM;IAC3B,6FAA6F;IACtF,UAAU,IAAI,MAAM;IAC3B,0FAA0F;IACnF,SAAS,IAAI,MAAM;IAC1B,iGAAiG;IAC1F,WAAW,IAAI,MAAM;IAC5B,iGAAiG;IAC1F,WAAW,IAAI,MAAM;IAC5B,wIAAwI;IACjI,QAAQ,IAAI,UAAU;IAC7B,6FAA6F;IACtF,UAAU,IAAI,MAAM;IAE3B;;OAEG;IACI,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,UAAU;IAM9C,qGAAqG;IAC9F,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,UAAU;IAI/D,0HAA0H;IACnH,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,WAAW;IAOnD,0CAA0C;IAC1C,IAAW,WAAW,IAAI,WAAW,GAAG,iBAAiB,CAA8B;IAEvF,OAAO,CAAC,IAAI;CAKb"}

package/lib/cjs/ByteStream.js

@@ -18,6 +18,9 @@ const Id_1 = require("./Id");
  * @public
  */
 class ByteStream {
+    _view;
+    _byteOffset;
+    _curPos = 0;
     /** Construct a new ByteStream with the read position set to the beginning.
      * @param buffer The underlying buffer from which data is to be extracted.
      * @param subView If defined, specifies the subset of the underlying buffer's data to use.
@@ -29,11 +32,9 @@ class ByteStream {
      * ArrayBuffer. If `bytes` represents only a **sub-range** of the underlying buffer's data, the results will be unexpected unless the optional `subView`
      * argument is supplied, with correct offset and length.
      *
-     * For both of the above reasons, prefer to use [[fromUint8Array]].
-     * @deprecated in 3.x. Use [[fromUint8Array]] or [[fromArrayBuffer]].
+     * For both of the above reasons, this constructor is private, and [[fromUint8Array]] or [[fromArrayBuffer]] should be used to create a ByteStream.
      */
     constructor(buffer, subView) {
-        this._curPos = 0;
         if (undefined !== subView) {
             this._view = new DataView(buffer, subView.byteOffset, subView.byteLength);
             this._byteOffset = subView.byteOffset;
@@ -45,17 +46,18 @@ class ByteStream {
     }
     /** Construct a new ByteStream for the range of bytes represented by `bytes`, which may be a subset of the range of bytes
      * represented by the underlying ArrayBuffer. The read position will be set to the beginning of the range of bytes.
+     * @param bytes The Uint8Array from which data is to be extracted.
      */
     static fromUint8Array(bytes) {
         const { byteOffset, byteLength } = bytes;
-        return new ByteStream(bytes.buffer, { byteOffset, byteLength }); // eslint-disable-line @typescript-eslint/no-deprecated
+        return new ByteStream(bytes.buffer, { byteOffset, byteLength });
     }
     /** Construct a new ByteStream with the read position set to the beginning.
      * @param buffer The underlying buffer from which data is to be extracted.
      * @param subView If defined, specifies the subset of the underlying buffer's data to use.
      */
     static fromArrayBuffer(buffer, subView) {
-        return new ByteStream(buffer, subView); // eslint-disable-line @typescript-eslint/no-deprecated
+        return new ByteStream(buffer, subView);
     }
     /** The number of bytes in this stream */
     get length() {
@@ -113,22 +115,6 @@ class ByteStream {
     readId64() { return Id_1.Id64.fromUint32Pair(this.readUint32(), this.readUint32()); }
     /** Read an unsigned 24-bit integer from the current read position and advance by 3 bytes. */
     readUint24() { return this.readUint8() | (this.readUint8() << 8) | (this.readUint8() << 16); }
-    /** @deprecated in 3.x. use [[readUint8]]. */
-    get nextUint8() { return this.readUint8(); }
-    /** @deprecated in 3.x. use [[readUint16]]. */
-    get nextUint16() { return this.readUint16(); }
-    /** @deprecated in 3.x. use [[readUint32]]. */
-    get nextUint32() { return this.readUint32(); }
-    /** @deprecated in 3.x. use [[readInt32]]. */
-    get nextInt32() { return this.readInt32(); }
-    /** @deprecated in 3.x. use [[readFloat32]]. */
-    get nextFloat32() { return this.readFloat32(); }
-    /** @deprecated in 3.x. use [[readFloat64]]. */
-    get nextFloat64() { return this.readFloat64(); }
-    /** @deprecated in 3.x. use [[readId64]]. */
-    get nextId64() { return this.readId64(); }
-    /** @deprecated in 3.x. use [[readUint32]]. */
-    get nextUint24() { return this.readUint24(); }
     /** Read the specified number of bytes beginning at the current read position into a Uint8Array and advance by the specified number of byte.
      * @param numBytes The number of bytes to read.
      */

package/lib/cjs/ByteStream.js.map

@@ -1 +1 @@
-{"version":3,"file":"ByteStream.js","sourceRoot":"","sources":["../../src/ByteStream.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,qCAAkC;AAClC,6BAAwC;AAExC;;;;;;GAMG;AACH,MAAa,UAAU;IAKrB;;;;;;;;;;;;;OAaG;IACH,YAAmB,MAAuC,EAAE,OAAoD;QAhBxG,YAAO,GAAW,CAAC,CAAC;QAiB1B,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;YAC1E,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,UAAU,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,cAAc,CAAC,KAAiB;QAC5C,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;QACzC,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,uDAAuD;IAC1H,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,MAAuC,EAAE,OAAoD;QACzH,OAAO,IAAI,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,uDAAuD;IACjG,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC;IAC/B,CAAC;IAED,0FAA0F;IAC1F,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC;IACrC,CAAC;IAED,sEAAsE;IACtE,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACpD,IAAW,MAAM,CAAC,GAAW;QAC3B,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;QACnB,IAAA,eAAM,EAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC7B,CAAC;IAED,sEAAsE;IAC/D,OAAO,CAAC,QAAgB;QAC7B,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC;IAC5B,CAAC;IAED,6EAA6E;IACtE,MAAM,CAAC,QAAgB;QAC5B,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC;YAC5B,OAAO,KAAK,CAAC;QAEf,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sEAAsE;IAC/D,KAAK,KAAW,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEzC,0FAA0F;IACnF,SAAS,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,6FAA6F;IACtF,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjG,6FAA6F;IACtF,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjG,0FAA0F;IACnF,SAAS,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,iGAAiG;IAC1F,WAAW,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACnG,iGAAiG;IAC1F,WAAW,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACnG,wIAAwI;IACjI,QAAQ,KAAiB,OAAO,SAAI,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IACnG,6FAA6F;IACtF,UAAU,KAAa,OAAO,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAE7G,6CAA6C;IAC7C,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC3D,8CAA8C;IAC9C,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC7D,8CAA8C;IAC9C,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC7D,6CAA6C;IAC7C,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC3D,+CAA+C;IAC/C,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC/D,+CAA+C;IAC/C,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC/D,4CAA4C;IAC5C,IAAW,QAAQ,KAAiB,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC7D,8CAA8C;IAC9C,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAE7D;;OAEG;IACI,SAAS,CAAC,QAAgB;QAC/B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QACzF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,qGAAqG;IAC9F,SAAS,CAAC,OAAe,EAAE,QAAgB;QAChD,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IAChF,CAAC;IAED,0HAA0H;IACnH,WAAW,CAAC,UAAkB;QACnC,MAAM,QAAQ,GAAG,UAAU,GAAG,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QAC9F,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,0CAA0C;IAC1C,IAAW,WAAW,KAAsC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IAE/E,IAAI,CAAC,QAAgB,EAAE,IAAgC;QAC7D,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA9JD,gCA8JC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Utils\r\n */\r\n\r\nimport { assert } from \"./Assert\";\r\nimport { Id64, Id64String } from \"./Id\";\r\n\r\n/** Allows the contents of an [ArrayBuffer](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer)\r\n * to be consumed sequentially using methods to extract\r\n * data of a particular type from the bytes beginning at the current read position.\r\n * Methods and properties beginning with 'read' and taking no arguments consume data at the current read position and advance it\r\n * by the size of the data read. The read position can also be directly adjusted by the caller.\r\n * @public\r\n */\r\nexport class ByteStream {\r\n  private readonly _view: DataView;\r\n  private readonly _byteOffset: number;\r\n  private _curPos: number = 0;\r\n\r\n  /** Construct a new ByteStream with the read position set to the beginning.\r\n   * @param buffer The underlying buffer from which data is to be extracted.\r\n   * @param subView If defined, specifies the subset of the underlying buffer's data to use.\r\n   * This constructor is subject to two common mistakes:\r\n   *\r\n   * 1. Given `bytes: Uint8Array`, `new ByteStream(bytes)` will compile but at run-time will produce an error asserting that\r\n   * the DataView constructor requires an ArrayBuffer. The correct usage is `new ByteStream(bytes.buffer)`.\r\n   * 2. Given `bytes: Uint8Array`, `new ByteStream(bytes.buffer)` creates a stream for the entire range of bytes represented by the underlying\r\n   * ArrayBuffer. If `bytes` represents only a **sub-range** of the underlying buffer's data, the results will be unexpected unless the optional `subView`\r\n   * argument is supplied, with correct offset and length.\r\n   *\r\n   * For both of the above reasons, prefer to use [[fromUint8Array]].\r\n   * @deprecated in 3.x. Use [[fromUint8Array]] or [[fromArrayBuffer]].\r\n   */\r\n  public constructor(buffer: ArrayBuffer | SharedArrayBuffer, subView?: { byteOffset: number, byteLength: number }) {\r\n    if (undefined !== subView) {\r\n      this._view = new DataView(buffer, subView.byteOffset, subView.byteLength);\r\n      this._byteOffset = subView.byteOffset;\r\n    } else {\r\n      this._view = new DataView(buffer);\r\n      this._byteOffset = 0;\r\n    }\r\n  }\r\n\r\n  /** Construct a new ByteStream for the range of bytes represented by `bytes`, which may be a subset of the range of bytes\r\n   * represented by the underlying ArrayBuffer. The read position will be set to the beginning of the range of bytes.\r\n   */\r\n  public static fromUint8Array(bytes: Uint8Array): ByteStream {\r\n    const { byteOffset, byteLength } = bytes;\r\n    return new ByteStream(bytes.buffer, { byteOffset, byteLength }); // eslint-disable-line @typescript-eslint/no-deprecated\r\n  }\r\n\r\n  /** Construct a new ByteStream with the read position set to the beginning.\r\n   * @param buffer The underlying buffer from which data is to be extracted.\r\n   * @param subView If defined, specifies the subset of the underlying buffer's data to use.\r\n   */\r\n  public static fromArrayBuffer(buffer: ArrayBuffer | SharedArrayBuffer, subView?: { byteOffset: number, byteLength: number }): ByteStream {\r\n    return new ByteStream(buffer, subView); // eslint-disable-line @typescript-eslint/no-deprecated\r\n  }\r\n\r\n  /** The number of bytes in this stream */\r\n  public get length(): number {\r\n    return this._view.byteLength;\r\n  }\r\n\r\n  /** The number of bytes remaining to be read, from [[curPos]] to the end of the stream. */\r\n  public get remainingLength(): number {\r\n    return this.length - this.curPos;\r\n  }\r\n\r\n  /** Returns true if the current read position has been advanced past the end of the stream. This generally indicates that an attempt was made to read more data than is available.\r\n   * @see [[isAtTheEnd]]\r\n   */\r\n  public get isPastTheEnd(): boolean {\r\n    return this.curPos > this.length;\r\n  }\r\n\r\n  /** Returns true if the current read position has advanced precisely to the end of the stream, indicating all of the data has been consumed.\r\n   * @see [[isPastTheEnd]].\r\n   */\r\n  public get isAtTheEnd(): boolean {\r\n    return this.curPos === this.length;\r\n  }\r\n\r\n  /** The current read position as an index into the stream of bytes. */\r\n  public get curPos(): number { return this._curPos; }\r\n  public set curPos(pos: number) {\r\n    this._curPos = pos;\r\n    assert(!this.isPastTheEnd);\r\n  }\r\n\r\n  /** Adds the specified number of bytes to the current read position */\r\n  public advance(numBytes: number): boolean {\r\n    this.curPos = (this.curPos + numBytes);\r\n    return !this.isPastTheEnd;\r\n  }\r\n\r\n  /** Subtracts the specified number of bytes from the current read position */\r\n  public rewind(numBytes: number): boolean {\r\n    if (this.curPos - numBytes < 0)\r\n      return false;\r\n\r\n    this.curPos = this.curPos - numBytes;\r\n    return true;\r\n  }\r\n\r\n  /** Resets the current read position to the beginning of the stream */\r\n  public reset(): void { this.curPos = 0; }\r\n\r\n  /** Read a unsigned 8-bit integer from the current read position and advance by 1 byte. */\r\n  public readUint8(): number { return this.read(1, (view) => view.getUint8(this.curPos)); }\r\n  /** Read an unsigned 16-bit integer from the current read position and advance by 2 bytes. */\r\n  public readUint16(): number { return this.read(2, (view) => view.getUint16(this.curPos, true)); }\r\n  /** Read an unsigned 32-bit integer from the current read position and advance by 4 bytes. */\r\n  public readUint32(): number { return this.read(4, (view) => view.getUint32(this.curPos, true)); }\r\n  /** Read a signed 32-bit integer from the current read position and advance by 4 bytes. */\r\n  public readInt32(): number { return this.read(4, (view) => view.getInt32(this.curPos, true)); }\r\n  /** Read a 32-bit floating point number from the current read position and advance by 4 bytes. */\r\n  public readFloat32(): number { return this.read(4, (view) => view.getFloat32(this.curPos, true)); }\r\n  /** Read a 64-bit floating point number from the current read position and advance by 8 bytes. */\r\n  public readFloat64(): number { return this.read(8, (view) => view.getFloat64(this.curPos, true)); }\r\n  /** Read an unsigned 64-bit integer from the current read position, advance by 8 bytes, and return the 64-bit value as an Id64String. */\r\n  public readId64(): Id64String { return Id64.fromUint32Pair(this.readUint32(), this.readUint32()); }\r\n  /** Read an unsigned 24-bit integer from the current read position and advance by 3 bytes. */\r\n  public readUint24(): number { return this.readUint8() | (this.readUint8() << 8) | (this.readUint8() << 16); }\r\n\r\n  /** @deprecated in 3.x. use [[readUint8]]. */\r\n  public get nextUint8(): number { return this.readUint8(); }\r\n  /** @deprecated in 3.x. use [[readUint16]]. */\r\n  public get nextUint16(): number { return this.readUint16(); }\r\n  /** @deprecated in 3.x. use [[readUint32]]. */\r\n  public get nextUint32(): number { return this.readUint32(); }\r\n  /** @deprecated in 3.x. use [[readInt32]]. */\r\n  public get nextInt32(): number { return this.readInt32(); }\r\n  /** @deprecated in 3.x. use [[readFloat32]]. */\r\n  public get nextFloat32(): number { return this.readFloat32(); }\r\n  /** @deprecated in 3.x. use [[readFloat64]]. */\r\n  public get nextFloat64(): number { return this.readFloat64(); }\r\n  /** @deprecated in 3.x. use [[readId64]]. */\r\n  public get nextId64(): Id64String { return this.readId64(); }\r\n  /** @deprecated in 3.x. use [[readUint32]]. */\r\n  public get nextUint24(): number { return this.readUint24(); }\r\n\r\n  /** Read the specified number of bytes beginning at the current read position into a Uint8Array and advance by the specified number of byte.\r\n   * @param numBytes The number of bytes to read.\r\n   */\r\n  public nextBytes(numBytes: number): Uint8Array {\r\n    const bytes = new Uint8Array(this.arrayBuffer, this.curPos + this._byteOffset, numBytes);\r\n    this.advance(numBytes);\r\n    return bytes;\r\n  }\r\n\r\n  /** Read the specified number of bytes at the specified offset without changing the read position. */\r\n  public readBytes(readPos: number, numBytes: number): Uint8Array {\r\n    return new Uint8Array(this.arrayBuffer, readPos + this._byteOffset, numBytes);\r\n  }\r\n\r\n  /** Read the specified number of unsigned 32-bit integers from the current read position and advance the read position. */\r\n  public nextUint32s(numUint32s: number): Uint32Array {\r\n    const numBytes = numUint32s * 4;\r\n    const uint32s = new Uint32Array(this.arrayBuffer, this.curPos + this._byteOffset, numUint32s);\r\n    this.advance(numBytes);\r\n    return uint32s;\r\n  }\r\n\r\n  /** Returns the underlying array buffer */\r\n  public get arrayBuffer(): ArrayBuffer | SharedArrayBuffer { return this._view.buffer; }\r\n\r\n  private read(numBytes: number, read: (view: DataView) => number) {\r\n    const result = read(this._view);\r\n    this.advance(numBytes);\r\n    return result;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ByteStream.js","sourceRoot":"","sources":["../../src/ByteStream.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,qCAAkC;AAClC,6BAAwC;AAExC;;;;;;GAMG;AACH,MAAa,UAAU;IACJ,KAAK,CAAW;IAChB,WAAW,CAAS;IAC7B,OAAO,GAAW,CAAC,CAAC;IAE5B;;;;;;;;;;;;OAYG;IACH,YAAoB,MAAuC,EAAE,OAAoD;QAC/G,IAAI,SAAS,KAAK,OAAO,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;YAC1E,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,UAAU,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,cAAc,CAAC,KAAiB;QAC5C,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;QACzC,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC,CAAC;IAClE,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,MAAuC,EAAE,OAAoD;QACzH,OAAO,IAAI,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACzC,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC;IAC/B,CAAC;IAED,0FAA0F;IAC1F,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC;IACrC,CAAC;IAED,sEAAsE;IACtE,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACpD,IAAW,MAAM,CAAC,GAAW;QAC3B,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;QACnB,IAAA,eAAM,EAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC7B,CAAC;IAED,sEAAsE;IAC/D,OAAO,CAAC,QAAgB;QAC7B,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC;IAC5B,CAAC;IAED,6EAA6E;IACtE,MAAM,CAAC,QAAgB;QAC5B,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC;YAC5B,OAAO,KAAK,CAAC;QAEf,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sEAAsE;IAC/D,KAAK,KAAW,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEzC,0FAA0F;IACnF,SAAS,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,6FAA6F;IACtF,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjG,6FAA6F;IACtF,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjG,0FAA0F;IACnF,SAAS,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,iGAAiG;IAC1F,WAAW,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACnG,iGAAiG;IAC1F,WAAW,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACnG,wIAAwI;IACjI,QAAQ,KAAiB,OAAO,SAAI,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IACnG,6FAA6F;IACtF,UAAU,KAAa,OAAO,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAE7G;;OAEG;IACI,SAAS,CAAC,QAAgB;QAC/B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QACzF,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,qGAAqG;IAC9F,SAAS,CAAC,OAAe,EAAE,QAAgB;QAChD,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IAChF,CAAC;IAED,0HAA0H;IACnH,WAAW,CAAC,UAAkB;QACnC,MAAM,QAAQ,GAAG,UAAU,GAAG,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QAC9F,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,0CAA0C;IAC1C,IAAW,WAAW,KAAsC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IAE/E,IAAI,CAAC,QAAgB,EAAE,IAAgC;QAC7D,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA7ID,gCA6IC","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\nimport { assert } from \"./Assert\";\nimport { Id64, Id64String } from \"./Id\";\n\n/** Allows the contents of an [ArrayBuffer](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/ArrayBuffer)\n * to be consumed sequentially using methods to extract\n * data of a particular type from the bytes beginning at the current read position.\n * Methods and properties beginning with 'read' and taking no arguments consume data at the current read position and advance it\n * by the size of the data read. The read position can also be directly adjusted by the caller.\n * @public\n */\nexport class ByteStream {\n  private readonly _view: DataView;\n  private readonly _byteOffset: number;\n  private _curPos: number = 0;\n\n  /** Construct a new ByteStream with the read position set to the beginning.\n   * @param buffer The underlying buffer from which data is to be extracted.\n   * @param subView If defined, specifies the subset of the underlying buffer's data to use.\n   * This constructor is subject to two common mistakes:\n   *\n   * 1. Given `bytes: Uint8Array`, `new ByteStream(bytes)` will compile but at run-time will produce an error asserting that\n   * the DataView constructor requires an ArrayBuffer. The correct usage is `new ByteStream(bytes.buffer)`.\n   * 2. Given `bytes: Uint8Array`, `new ByteStream(bytes.buffer)` creates a stream for the entire range of bytes represented by the underlying\n   * ArrayBuffer. If `bytes` represents only a **sub-range** of the underlying buffer's data, the results will be unexpected unless the optional `subView`\n   * argument is supplied, with correct offset and length.\n   *\n   * For both of the above reasons, this constructor is private, and [[fromUint8Array]] or [[fromArrayBuffer]] should be used to create a ByteStream.\n   */\n  private constructor(buffer: ArrayBuffer | SharedArrayBuffer, subView?: { byteOffset: number, byteLength: number }) {\n    if (undefined !== subView) {\n      this._view = new DataView(buffer, subView.byteOffset, subView.byteLength);\n      this._byteOffset = subView.byteOffset;\n    } else {\n      this._view = new DataView(buffer);\n      this._byteOffset = 0;\n    }\n  }\n\n  /** Construct a new ByteStream for the range of bytes represented by `bytes`, which may be a subset of the range of bytes\n   * represented by the underlying ArrayBuffer. The read position will be set to the beginning of the range of bytes.\n   * @param bytes The Uint8Array from which data is to be extracted.\n   */\n  public static fromUint8Array(bytes: Uint8Array): ByteStream {\n    const { byteOffset, byteLength } = bytes;\n    return new ByteStream(bytes.buffer, { byteOffset, byteLength });  \n  }\n\n  /** Construct a new ByteStream with the read position set to the beginning.\n   * @param buffer The underlying buffer from which data is to be extracted.\n   * @param subView If defined, specifies the subset of the underlying buffer's data to use.\n   */\n  public static fromArrayBuffer(buffer: ArrayBuffer | SharedArrayBuffer, subView?: { byteOffset: number, byteLength: number }): ByteStream {\n    return new ByteStream(buffer, subView);  \n  }\n\n  /** The number of bytes in this stream */\n  public get length(): number {\n    return this._view.byteLength;\n  }\n\n  /** The number of bytes remaining to be read, from [[curPos]] to the end of the stream. */\n  public get remainingLength(): number {\n    return this.length - this.curPos;\n  }\n\n  /** Returns true if the current read position has been advanced past the end of the stream. This generally indicates that an attempt was made to read more data than is available.\n   * @see [[isAtTheEnd]]\n   */\n  public get isPastTheEnd(): boolean {\n    return this.curPos > this.length;\n  }\n\n  /** Returns true if the current read position has advanced precisely to the end of the stream, indicating all of the data has been consumed.\n   * @see [[isPastTheEnd]].\n   */\n  public get isAtTheEnd(): boolean {\n    return this.curPos === this.length;\n  }\n\n  /** The current read position as an index into the stream of bytes. */\n  public get curPos(): number { return this._curPos; }\n  public set curPos(pos: number) {\n    this._curPos = pos;\n    assert(!this.isPastTheEnd);\n  }\n\n  /** Adds the specified number of bytes to the current read position */\n  public advance(numBytes: number): boolean {\n    this.curPos = (this.curPos + numBytes);\n    return !this.isPastTheEnd;\n  }\n\n  /** Subtracts the specified number of bytes from the current read position */\n  public rewind(numBytes: number): boolean {\n    if (this.curPos - numBytes < 0)\n      return false;\n\n    this.curPos = this.curPos - numBytes;\n    return true;\n  }\n\n  /** Resets the current read position to the beginning of the stream */\n  public reset(): void { this.curPos = 0; }\n\n  /** Read a unsigned 8-bit integer from the current read position and advance by 1 byte. */\n  public readUint8(): number { return this.read(1, (view) => view.getUint8(this.curPos)); }\n  /** Read an unsigned 16-bit integer from the current read position and advance by 2 bytes. */\n  public readUint16(): number { return this.read(2, (view) => view.getUint16(this.curPos, true)); }\n  /** Read an unsigned 32-bit integer from the current read position and advance by 4 bytes. */\n  public readUint32(): number { return this.read(4, (view) => view.getUint32(this.curPos, true)); }\n  /** Read a signed 32-bit integer from the current read position and advance by 4 bytes. */\n  public readInt32(): number { return this.read(4, (view) => view.getInt32(this.curPos, true)); }\n  /** Read a 32-bit floating point number from the current read position and advance by 4 bytes. */\n  public readFloat32(): number { return this.read(4, (view) => view.getFloat32(this.curPos, true)); }\n  /** Read a 64-bit floating point number from the current read position and advance by 8 bytes. */\n  public readFloat64(): number { return this.read(8, (view) => view.getFloat64(this.curPos, true)); }\n  /** Read an unsigned 64-bit integer from the current read position, advance by 8 bytes, and return the 64-bit value as an Id64String. */\n  public readId64(): Id64String { return Id64.fromUint32Pair(this.readUint32(), this.readUint32()); }\n  /** Read an unsigned 24-bit integer from the current read position and advance by 3 bytes. */\n  public readUint24(): number { return this.readUint8() | (this.readUint8() << 8) | (this.readUint8() << 16); }\n\n  /** Read the specified number of bytes beginning at the current read position into a Uint8Array and advance by the specified number of byte.\n   * @param numBytes The number of bytes to read.\n   */\n  public nextBytes(numBytes: number): Uint8Array {\n    const bytes = new Uint8Array(this.arrayBuffer, this.curPos + this._byteOffset, numBytes);\n    this.advance(numBytes);\n    return bytes;\n  }\n\n  /** Read the specified number of bytes at the specified offset without changing the read position. */\n  public readBytes(readPos: number, numBytes: number): Uint8Array {\n    return new Uint8Array(this.arrayBuffer, readPos + this._byteOffset, numBytes);\n  }\n\n  /** Read the specified number of unsigned 32-bit integers from the current read position and advance the read position. */\n  public nextUint32s(numUint32s: number): Uint32Array {\n    const numBytes = numUint32s * 4;\n    const uint32s = new Uint32Array(this.arrayBuffer, this.curPos + this._byteOffset, numUint32s);\n    this.advance(numBytes);\n    return uint32s;\n  }\n\n  /** Returns the underlying array buffer */\n  public get arrayBuffer(): ArrayBuffer | SharedArrayBuffer { return this._view.buffer; }\n\n  private read(numBytes: number, read: (view: DataView) => number) {\n    const result = read(this._view);\n    this.advance(numBytes);\n    return result;\n  }\n}\n"]}

package/lib/cjs/ClassUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"ClassUtils.js","sourceRoot":"","sources":["../../src/ClassUtils.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;AASH,gDAMC;AASD,oCAMC;AA5BD;;;;;;GAMG;AACH,SAAgB,kBAAkB,CAIhC,QAAgC,EAAE,UAAsB;IACxD,OAAO,QAAQ,CAAC,SAAS,YAAY,UAAU,CAAC;AAClD,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,YAAY,CAI1B,QAA6C,EAAE,UAAsB;IACrE,OAAO,QAAQ,KAAK,UAAU,IAAI,kBAAkB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;AAC7E,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Utils\r\n */\r\n\r\n/** Check if class `subclass` is a different class from `superclass` but extends from `superclass`\r\n * @param subclass the class that may be a subclass of `superclass`\r\n * @param superclass the class that may be a base class of `subclass`\r\n * @note The constructors of all types must be `public`.\r\n * @returns whether `subclass` is a proper subclass of `superclass`\r\n * @public\r\n */\r\nexport function isProperSubclassOf<\r\n  SuperClass extends new (..._: any[]) => any,\r\n  NonSubClass extends new (..._: any[]) => any,\r\n  SubClass extends new (..._: any[]) => InstanceType<SuperClass>,\r\n>(subclass: SubClass | NonSubClass, superclass: SuperClass): subclass is SubClass {\r\n  return subclass.prototype instanceof superclass;\r\n}\r\n\r\n/** Check if class `subclass` is `superclass` or extends from `superclass`\r\n * @param subclass the class that may be a subclass of `superclass`.\r\n * @param superclass the class that may be a base class of `subclass`.\r\n * @note The constructors of all types must be `public`.\r\n * @returns whether `subclass` is a subclass of `superclass`\r\n * @public\r\n */\r\nexport function isSubclassOf<\r\n  SuperClass extends new (..._: any[]) => any,\r\n  NonSubClass extends new (..._: any[]) => any,\r\n  SubClass extends new (..._: any[]) => InstanceType<SuperClass>,\r\n>(subclass: SuperClass | SubClass | NonSubClass, superclass: SuperClass): subclass is SubClass | SuperClass {\r\n  return subclass === superclass || isProperSubclassOf(subclass, superclass);\r\n}\r\n"]}
+{"version":3,"file":"ClassUtils.js","sourceRoot":"","sources":["../../src/ClassUtils.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;AASH,gDAMC;AASD,oCAMC;AA5BD;;;;;;GAMG;AACH,SAAgB,kBAAkB,CAIhC,QAAgC,EAAE,UAAsB;IACxD,OAAO,QAAQ,CAAC,SAAS,YAAY,UAAU,CAAC;AAClD,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,YAAY,CAI1B,QAA6C,EAAE,UAAsB;IACrE,OAAO,QAAQ,KAAK,UAAU,IAAI,kBAAkB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;AAC7E,CAAC","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/** Check if class `subclass` is a different class from `superclass` but extends from `superclass`\n * @param subclass the class that may be a subclass of `superclass`\n * @param superclass the class that may be a base class of `subclass`\n * @note The constructors of all types must be `public`.\n * @returns whether `subclass` is a proper subclass of `superclass`\n * @public\n */\nexport function isProperSubclassOf<\n  SuperClass extends new (..._: any[]) => any,\n  NonSubClass extends new (..._: any[]) => any,\n  SubClass extends new (..._: any[]) => InstanceType<SuperClass>,\n>(subclass: SubClass | NonSubClass, superclass: SuperClass): subclass is SubClass {\n  return subclass.prototype instanceof superclass;\n}\n\n/** Check if class `subclass` is `superclass` or extends from `superclass`\n * @param subclass the class that may be a subclass of `superclass`.\n * @param superclass the class that may be a base class of `subclass`.\n * @note The constructors of all types must be `public`.\n * @returns whether `subclass` is a subclass of `superclass`\n * @public\n */\nexport function isSubclassOf<\n  SuperClass extends new (..._: any[]) => any,\n  NonSubClass extends new (..._: any[]) => any,\n  SubClass extends new (..._: any[]) => InstanceType<SuperClass>,\n>(subclass: SuperClass | SubClass | NonSubClass, superclass: SuperClass): subclass is SubClass | SuperClass {\n  return subclass === superclass || isProperSubclassOf(subclass, superclass);\n}\n"]}

package/lib/cjs/Compare.d.ts

@@ -45,4 +45,19 @@ export declare function compareBooleansOrUndefined(lhs?: boolean, rhs?: boolean)
  * @public
  */
 export declare function areEqualPossiblyUndefined<T, U>(t: T | undefined, u: U | undefined, areEqual: (t: T, u: U) => boolean): boolean;
+/**
+ * Compare two simples types (number, string, boolean)
+ * This essentially wraps the existing type-specific comparison functions
+ * @beta */
+export declare function compareSimpleTypes(lhs: number | string | boolean, rhs: number | string | boolean): number;
+/**
+ * An array of simple types (number, string, boolean)
+ * @beta
+ */
+export type SimpleTypesArray = number[] | string[] | boolean[];
+/**
+ * Compare two arrays of simple types (number, string, boolean)
+ * @beta
+ */
+export declare function compareSimpleArrays(lhs?: SimpleTypesArray, rhs?: SimpleTypesArray): number;
 //# sourceMappingURL=Compare.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"Compare.d.ts","sourceRoot":"","sources":["../../src/Compare.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,MAAM,iBAAiB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,MAAM,CAAC;AAErE;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,SAAM,GAAG,MAAM,CAOlF;AAED,cAAc;AACd,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED,cAAc;AACd,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAE9D;AAED,cAAc;AACd,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED,cAAc;AACd,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAOhH;AAED,cAAc;AACd,wBAAgB,yBAAyB,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAE5E;AAED,cAAc;AACd,wBAAgB,yBAAyB,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAE5E;AAED,cAAc;AACd,wBAAgB,0BAA0B,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,OAAO,GAAG,MAAM,CAE/E;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAO9H"}
+{"version":3,"file":"Compare.d.ts","sourceRoot":"","sources":["../../src/Compare.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,MAAM,iBAAiB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,MAAM,CAAC;AAErE;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,SAAM,GAAG,MAAM,CAOlF;AAED,cAAc;AACd,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED,cAAc;AACd,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAE9D;AAED,cAAc;AACd,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED,cAAc;AACd,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAOhH;AAED,cAAc;AACd,wBAAgB,yBAAyB,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAE5E;AAED,cAAc;AACd,wBAAgB,yBAAyB,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAE5E;AAED,cAAc;AACd,wBAAgB,0BAA0B,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,OAAO,GAAG,MAAM,CAE/E;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAO9H;AAED;;;WAGW;AACX,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,CAmBzG;AACD;;;GAGG;AACH,MAAM,MAAM,gBAAgB,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,OAAO,EAAE,CAAC;AAE/D;;;GAGG;AAEH,wBAAgB,mBAAmB,CAAE,GAAG,CAAC,EAAE,gBAAgB,EAAE,GAAG,CAAC,EAAE,gBAAgB,UAmBlF"}

package/lib/cjs/Compare.js

@@ -16,6 +16,8 @@ exports.compareStringsOrUndefined = compareStringsOrUndefined;
 exports.compareNumbersOrUndefined = compareNumbersOrUndefined;
 exports.compareBooleansOrUndefined = compareBooleansOrUndefined;
 exports.areEqualPossiblyUndefined = areEqualPossiblyUndefined;
+exports.compareSimpleTypes = compareSimpleTypes;
+exports.compareSimpleArrays = compareSimpleArrays;
 /**
  * An [[OrderedComparator]] for numbers that treats two numbers as equal if the absolute value of their difference is less than a specified tolerance.
  * @public
@@ -72,4 +74,50 @@ function areEqualPossiblyUndefined(t, u, areEqual) {
     else
         return areEqual(t, u);
 }
+/**
+ * Compare two simples types (number, string, boolean)
+ * This essentially wraps the existing type-specific comparison functions
+ * @beta */
+function compareSimpleTypes(lhs, rhs) {
+    let cmp = 0;
+    // Make sure the types are the same
+    cmp = compareStrings(typeof lhs, typeof rhs);
+    if (cmp !== 0) {
+        return cmp;
+    }
+    // Compare actual values
+    switch (typeof lhs) {
+        case "number":
+            return compareNumbers(lhs, rhs);
+        case "string":
+            return compareStrings(lhs, rhs);
+        case "boolean":
+            return compareBooleans(lhs, rhs);
+    }
+    return cmp;
+}
+/**
+ * Compare two arrays of simple types (number, string, boolean)
+ * @beta
+ */
+function compareSimpleArrays(lhs, rhs) {
+    if (undefined === lhs)
+        return undefined === rhs ? 0 : -1;
+    else if (undefined === rhs)
+        return 1;
+    else if (lhs.length === 0 && rhs.length === 0) {
+        return 0;
+    }
+    else if (lhs.length !== rhs.length) {
+        return lhs.length - rhs.length;
+    }
+    let cmp = 0;
+    for (let i = 0; i < lhs.length; i++) {
+        cmp = compareSimpleTypes(lhs[i], rhs[i]);
+        if (cmp !== 0) {
+            break;
+        }
+    }
+    return cmp;
+}
 //# sourceMappingURL=Compare.js.map

package/lib/cjs/Compare.js.map

@@ -1 +1 @@
-{"version":3,"file":"Compare.js","sourceRoot":"","sources":["../../src/Compare.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;AA4BH,oDAOC;AAGD,wCAEC;AAGD,0CAEC;AAGD,wCAEC;AAGD,4DAOC;AAGD,8DAEC;AAGD,8DAEC;AAGD,gEAEC;AAKD,8DAOC;AA/DD;;;GAGG;AACH,SAAgB,oBAAoB,CAAC,CAAS,EAAE,CAAS,EAAE,SAAS,GAAG,GAAG;IACxE,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS;QACnB,OAAO,CAAC,CAAC,CAAC;SACP,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS;QACxB,OAAO,CAAC,CAAC;;QAET,OAAO,CAAC,CAAC;AACb,CAAC;AAED,cAAc;AACd,SAAgB,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,OAAO,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AAED,cAAc;AACd,SAAgB,eAAe,CAAC,CAAU,EAAE,CAAU;IACpD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,cAAc;AACd,SAAgB,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,cAAc;AACd,SAAgB,wBAAwB,CAAI,cAA0C,EAAE,GAAO,EAAE,GAAO;IACtG,IAAI,SAAS,KAAK,GAAG;QACnB,OAAO,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC/B,IAAI,SAAS,KAAK,GAAG;QACxB,OAAO,CAAC,CAAC;;QAET,OAAO,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,cAAc;AACd,SAAgB,yBAAyB,CAAC,GAAY,EAAE,GAAY;IAClE,OAAO,wBAAwB,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC5D,CAAC;AAED,cAAc;AACd,SAAgB,yBAAyB,CAAC,GAAY,EAAE,GAAY;IAClE,OAAO,wBAAwB,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC5D,CAAC;AAED,cAAc;AACd,SAAgB,0BAA0B,CAAC,GAAa,EAAE,GAAa;IACrE,OAAO,wBAAwB,CAAC,eAAe,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC7D,CAAC;AAED;;GAEG;AACH,SAAgB,yBAAyB,CAAO,CAAgB,EAAE,CAAgB,EAAE,QAAiC;IACnH,IAAI,SAAS,KAAK,CAAC;QACjB,OAAO,SAAS,KAAK,CAAC,CAAC;SACpB,IAAI,SAAS,KAAK,CAAC;QACtB,OAAO,KAAK,CAAC;;QAEb,OAAO,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1B,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Utils\r\n */\r\n\r\n/**\r\n * A function that returns a numerical value indicating how two objects are ordered in relation to one another.\r\n * Such functions are used by various collection classes throughout the library.\r\n * Given values `lhs` and `rhs`, the function returns:\r\n *  - Zero if lhs == rhs\r\n *  - A negative number if lhs < rhs\r\n *  - A positive number if lhs > rhs\r\n *\r\n * An OrderedComparator `must` implement [strict weak ordering](https://en.wikipedia.org/wiki/Weak_ordering#Strict_weak_orderings), which can be summarized by the following rules:\r\n *  - `compare(x, x)` returns zero.\r\n *  - If `compare(x, y)` returns zero, then so does `compare(y, x)` (i.e., `x == y` implies `y == x`).\r\n *  - If `compare(x, y)` returns non-zero, then `compare(y, x)` returns a value with an opposite sign (i.e., `x < y` implies `y > x`).\r\n *  - If `compare(x, y)` and `compare(y, z)` return non-zero values with the same sign, then `compare(x, z)` returns a value with the same sign (i.e., `x < y < z` implies `x < z`).\r\n *\r\n * @see SortedArray\r\n * @see Dictionary\r\n * @see IndexMap\r\n * @see PriorityQueue\r\n * @public\r\n */\r\nexport type OrderedComparator<T, U = T> = (lhs: T, rhs: U) => number;\r\n\r\n/**\r\n * An [[OrderedComparator]] for numbers that treats two numbers as equal if the absolute value of their difference is less than a specified tolerance.\r\n * @public\r\n */\r\nexport function compareWithTolerance(a: number, b: number, tolerance = 0.1): number {\r\n  if (a < b - tolerance)\r\n    return -1;\r\n  else if (a > b + tolerance)\r\n    return 1;\r\n  else\r\n    return 0;\r\n}\r\n\r\n/** @public */\r\nexport function compareNumbers(a: number, b: number): number {\r\n  return a - b;\r\n}\r\n\r\n/** @public */\r\nexport function compareBooleans(a: boolean, b: boolean): number {\r\n  return a !== b ? (a < b ? -1 : 1) : 0;\r\n}\r\n\r\n/** @public */\r\nexport function compareStrings(a: string, b: string): number {\r\n  return a === b ? 0 : (a < b ? -1 : 1);\r\n}\r\n\r\n/** @public */\r\nexport function comparePossiblyUndefined<T>(compareDefined: (lhs: T, rhs: T) => number, lhs?: T, rhs?: T): number {\r\n  if (undefined === lhs)\r\n    return undefined === rhs ? 0 : -1;\r\n  else if (undefined === rhs)\r\n    return 1;\r\n  else\r\n    return compareDefined(lhs, rhs);\r\n}\r\n\r\n/** @public */\r\nexport function compareStringsOrUndefined(lhs?: string, rhs?: string): number {\r\n  return comparePossiblyUndefined(compareStrings, lhs, rhs);\r\n}\r\n\r\n/** @public */\r\nexport function compareNumbersOrUndefined(lhs?: number, rhs?: number): number {\r\n  return comparePossiblyUndefined(compareNumbers, lhs, rhs);\r\n}\r\n\r\n/** @public */\r\nexport function compareBooleansOrUndefined(lhs?: boolean, rhs?: boolean): number {\r\n  return comparePossiblyUndefined(compareBooleans, lhs, rhs);\r\n}\r\n\r\n/** Compare two possibly-undefined values for equality. If both are undefined, the comparison is performed by the supplied `areEqual` function.\r\n * @public\r\n */\r\nexport function areEqualPossiblyUndefined<T, U>(t: T | undefined, u: U | undefined, areEqual: (t: T, u: U) => boolean): boolean {\r\n  if (undefined === t)\r\n    return undefined === u;\r\n  else if (undefined === u)\r\n    return false;\r\n  else\r\n    return areEqual(t, u);\r\n}\r\n"]}
+{"version":3,"file":"Compare.js","sourceRoot":"","sources":["../../src/Compare.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;AA4BH,oDAOC;AAGD,wCAEC;AAGD,0CAEC;AAGD,wCAEC;AAGD,4DAOC;AAGD,8DAEC;AAGD,8DAEC;AAGD,gEAEC;AAKD,8DAOC;AAMD,gDAmBC;AAYD,kDAmBC;AAvHD;;;GAGG;AACH,SAAgB,oBAAoB,CAAC,CAAS,EAAE,CAAS,EAAE,SAAS,GAAG,GAAG;IACxE,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS;QACnB,OAAO,CAAC,CAAC,CAAC;SACP,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS;QACxB,OAAO,CAAC,CAAC;;QAET,OAAO,CAAC,CAAC;AACb,CAAC;AAED,cAAc;AACd,SAAgB,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,OAAO,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AAED,cAAc;AACd,SAAgB,eAAe,CAAC,CAAU,EAAE,CAAU;IACpD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,cAAc;AACd,SAAgB,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,cAAc;AACd,SAAgB,wBAAwB,CAAI,cAA0C,EAAE,GAAO,EAAE,GAAO;IACtG,IAAI,SAAS,KAAK,GAAG;QACnB,OAAO,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC/B,IAAI,SAAS,KAAK,GAAG;QACxB,OAAO,CAAC,CAAC;;QAET,OAAO,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,cAAc;AACd,SAAgB,yBAAyB,CAAC,GAAY,EAAE,GAAY;IAClE,OAAO,wBAAwB,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC5D,CAAC;AAED,cAAc;AACd,SAAgB,yBAAyB,CAAC,GAAY,EAAE,GAAY;IAClE,OAAO,wBAAwB,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC5D,CAAC;AAED,cAAc;AACd,SAAgB,0BAA0B,CAAC,GAAa,EAAE,GAAa;IACrE,OAAO,wBAAwB,CAAC,eAAe,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC7D,CAAC;AAED;;GAEG;AACH,SAAgB,yBAAyB,CAAO,CAAgB,EAAE,CAAgB,EAAE,QAAiC;IACnH,IAAI,SAAS,KAAK,CAAC;QACjB,OAAO,SAAS,KAAK,CAAC,CAAC;SACpB,IAAI,SAAS,KAAK,CAAC;QACtB,OAAO,KAAK,CAAC;;QAEb,OAAO,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED;;;WAGW;AACX,SAAgB,kBAAkB,CAAC,GAA8B,EAAE,GAA8B;IAC/F,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,mCAAmC;IACnC,GAAG,GAAG,cAAc,CAAC,OAAO,GAAG,EAAE,OAAO,GAAG,CAAC,CAAC;IAC7C,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;QACb,OAAO,GAAG,CAAC;IACd,CAAC;IAED,wBAAwB;IACxB,QAAQ,OAAO,GAAG,EAAE,CAAC;QACnB,KAAK,QAAQ;YACX,OAAO,cAAc,CAAC,GAAG,EAAE,GAAa,CAAC,CAAC;QAC5C,KAAK,QAAQ;YACX,OAAO,cAAc,CAAC,GAAG,EAAE,GAAa,CAAC,CAAC;QAC5C,KAAK,SAAS;YACZ,OAAO,eAAe,CAAC,GAAG,EAAE,GAAc,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAOD;;;GAGG;AAEH,SAAgB,mBAAmB,CAAE,GAAsB,EAAE,GAAsB;IACjF,IAAI,SAAS,KAAK,GAAG;QACnB,OAAO,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC/B,IAAI,SAAS,KAAK,GAAG;QACxB,OAAO,CAAC,CAAC;SACN,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9C,OAAO,CAAC,CAAC;IACX,CAAC;SAAM,IAAI,GAAG,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;QACrC,OAAO,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IACjC,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,GAAG,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC","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/**\n * A function that returns a numerical value indicating how two objects are ordered in relation to one another.\n * Such functions are used by various collection classes throughout the library.\n * Given values `lhs` and `rhs`, the function returns:\n *  - Zero if lhs == rhs\n *  - A negative number if lhs < rhs\n *  - A positive number if lhs > rhs\n *\n * An OrderedComparator `must` implement [strict weak ordering](https://en.wikipedia.org/wiki/Weak_ordering#Strict_weak_orderings), which can be summarized by the following rules:\n *  - `compare(x, x)` returns zero.\n *  - If `compare(x, y)` returns zero, then so does `compare(y, x)` (i.e., `x == y` implies `y == x`).\n *  - If `compare(x, y)` returns non-zero, then `compare(y, x)` returns a value with an opposite sign (i.e., `x < y` implies `y > x`).\n *  - If `compare(x, y)` and `compare(y, z)` return non-zero values with the same sign, then `compare(x, z)` returns a value with the same sign (i.e., `x < y < z` implies `x < z`).\n *\n * @see SortedArray\n * @see Dictionary\n * @see IndexMap\n * @see PriorityQueue\n * @public\n */\nexport type OrderedComparator<T, U = T> = (lhs: T, rhs: U) => number;\n\n/**\n * An [[OrderedComparator]] for numbers that treats two numbers as equal if the absolute value of their difference is less than a specified tolerance.\n * @public\n */\nexport function compareWithTolerance(a: number, b: number, tolerance = 0.1): number {\n  if (a < b - tolerance)\n    return -1;\n  else if (a > b + tolerance)\n    return 1;\n  else\n    return 0;\n}\n\n/** @public */\nexport function compareNumbers(a: number, b: number): number {\n  return a - b;\n}\n\n/** @public */\nexport function compareBooleans(a: boolean, b: boolean): number {\n  return a !== b ? (a < b ? -1 : 1) : 0;\n}\n\n/** @public */\nexport function compareStrings(a: string, b: string): number {\n  return a === b ? 0 : (a < b ? -1 : 1);\n}\n\n/** @public */\nexport function comparePossiblyUndefined<T>(compareDefined: (lhs: T, rhs: T) => number, lhs?: T, rhs?: T): number {\n  if (undefined === lhs)\n    return undefined === rhs ? 0 : -1;\n  else if (undefined === rhs)\n    return 1;\n  else\n    return compareDefined(lhs, rhs);\n}\n\n/** @public */\nexport function compareStringsOrUndefined(lhs?: string, rhs?: string): number {\n  return comparePossiblyUndefined(compareStrings, lhs, rhs);\n}\n\n/** @public */\nexport function compareNumbersOrUndefined(lhs?: number, rhs?: number): number {\n  return comparePossiblyUndefined(compareNumbers, lhs, rhs);\n}\n\n/** @public */\nexport function compareBooleansOrUndefined(lhs?: boolean, rhs?: boolean): number {\n  return comparePossiblyUndefined(compareBooleans, lhs, rhs);\n}\n\n/** Compare two possibly-undefined values for equality. If both are undefined, the comparison is performed by the supplied `areEqual` function.\n * @public\n */\nexport function areEqualPossiblyUndefined<T, U>(t: T | undefined, u: U | undefined, areEqual: (t: T, u: U) => boolean): boolean {\n  if (undefined === t)\n    return undefined === u;\n  else if (undefined === u)\n    return false;\n  else\n    return areEqual(t, u);\n}\n\n/**\n * Compare two simples types (number, string, boolean)\n * This essentially wraps the existing type-specific comparison functions\n * @beta */\nexport function compareSimpleTypes(lhs: number | string | boolean, rhs: number | string | boolean): number {\n  let cmp = 0;\n\n  // Make sure the types are the same\n  cmp = compareStrings(typeof lhs, typeof rhs);\n  if (cmp !== 0) {\n     return cmp;\n  }\n\n  // Compare actual values\n  switch (typeof lhs) {\n    case \"number\":\n      return compareNumbers(lhs, rhs as number);\n    case \"string\":\n      return compareStrings(lhs, rhs as string);\n    case \"boolean\":\n      return compareBooleans(lhs, rhs as boolean);\n  }\n  return cmp;\n}\n/**\n * An array of simple types (number, string, boolean)\n * @beta\n */\nexport type SimpleTypesArray = number[] | string[] | boolean[];\n\n/**\n * Compare two arrays of simple types (number, string, boolean)\n * @beta\n */\n\nexport function compareSimpleArrays (lhs?: SimpleTypesArray, rhs?: SimpleTypesArray ) {\n  if (undefined === lhs)\n    return undefined === rhs ? 0 : -1;\n  else if (undefined === rhs)\n    return 1;\n  else if (lhs.length === 0 && rhs.length === 0) {\n    return 0;\n  } else if (lhs.length !== rhs.length) {\n    return lhs.length - rhs.length;\n  }\n\n  let cmp = 0;\n  for (let i = 0; i < lhs.length; i++) {\n    cmp = compareSimpleTypes(lhs[i], rhs[i]);\n    if (cmp !== 0) {\n      break;\n    }\n  }\n  return cmp;\n}"]}

package/lib/cjs/CompressedId64Set.js

@@ -121,6 +121,9 @@ var CompressedId64Set;
     CompressedId64Set.compressIds = compressIds;
     /** This exists strictly for the purposes of compressed sets of 64-bit Ids, to avoid the overhead of BigInt for handling 64-bit integers. */
     class Uint64 {
+        lower;
+        upper;
+        static _base = 0x100000000;
         static assertUint32(num) {
             (0, Assert_1.assert)(num >= 0);
             (0, Assert_1.assert)(num < Uint64._base);
@@ -182,7 +185,6 @@ var CompressedId64Set;
             return Id_1.Id64.fromUint32Pair(this.lower, this.upper);
         }
     }
-    Uint64._base = 0x100000000;
     /** Supplies an iterator over the [[Id64String]]s in a [[CompressedId64Set]].
      * The Ids are iterated in ascending order based on their unsigned 64-bit integer values.
      */
@@ -327,10 +329,11 @@ exports.OrderedId64Array = OrderedId64Array;
  * @public
  */
 class MutableCompressedId64Set {
+    _ids;
+    _inserted = new OrderedId64Array();
+    _deleted = new OrderedId64Array();
     /** Construct a new set, optionally initialized to contain the Ids represented by `ids`. */
     constructor(ids) {
-        this._inserted = new OrderedId64Array();
-        this._deleted = new OrderedId64Array();
         this._ids = ids ?? "";
     }
     /** Obtain the compact string representation of the contents of this set. If any insertions or removals are pending, they will be applied and the string recomputed. */

package/lib/cjs/CompressedId64Set.js.map

@@ -1 +1 @@
-{"version":3,"file":"CompressedId64Set.js","sourceRoot":"","sources":["../../src/CompressedId64Set.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,qCAAkC;AAClC,6BAA4D;AAC5D,+DAA4D;AAC5D,+CAA4C;AAK5C;;;;;;;;GAQG;AACH,IAAiB,iBAAiB,CAoUjC;AApUD,WAAiB,iBAAiB;IAChC,SAAS,UAAU,CAAC,EAAU;QAC5B,gBAAgB;QAChB,WAAW;QACX,WAAW;QACX,WAAW;QACX,WAAW;QAEX,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,SAAS,YAAY,CAAC,SAAiB,EAAE,MAAc;QACrD,IAAA,eAAM,EAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,IAAI,CAAC;YACb,OAAO,GAAG,CAAC;QAEb,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC9C,OAAO,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACH,SAAgB,WAAW,CAAC,GAAY;QACtC,OAAO,eAAe,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAFe,6BAAW,cAE1B,CAAA;IAED;;OAEG;IACH,SAAgB,eAAe,CAAC,GAAyB;QACvD,0FAA0F;QAC1F,MAAM,GAAG,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9D,yCAAmB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IALe,iCAAe,kBAK9B,CAAA;IAED;;;;;;;;OAQG;IACH,SAAgB,aAAa,CAAC,GAAc;QAC1C,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAFe,+BAAa,gBAE5B,CAAA;IAED;;;;;;;;OAQG;IACH,SAAgB,WAAW,CAAC,GAAwB;QAClD,IAAI,QAAQ,KAAK,OAAO,GAAG;YACzB,OAAO,GAAG,CAAC;QAEb,IAAI,GAAG,GAAG,EAAE,CAAC;QAEb,MAAM,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,cAAc,GAAG,IAAI,MAAM,EAAE,CAAC;QACpC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,MAAM,KAAK,GAAG,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,IAAI,MAAM,EAAE,CAAC;QAClC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,SAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBACvB,SAAS,CAAC,uCAAuC;YAEnD,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACpB,YAAY,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAE9C,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK,GAAG;gBACX,SAAS,CAAC,oBAAoB;iBAC3B,IAAI,GAAG,GAAG,CAAC;gBACd,MAAM,IAAI,KAAK,CAAC,kEAAkE,CAAC,CAAC;YAEtF,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAEvB,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;gBACnB,cAAc,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBACtC,QAAQ,GAAG,CAAC,CAAC;YACf,CAAC;iBAAM,IAAI,YAAY,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC/C,EAAE,QAAQ,CAAC;YACb,CAAC;iBAAM,CAAC;gBACN,GAAG,IAAI,YAAY,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;gBAC9C,cAAc,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBACtC,QAAQ,GAAG,CAAC,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,QAAQ;YACd,GAAG,IAAI,YAAY,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QAEhD,OAAO,GAAG,CAAC;IACb,CAAC;IA3Ce,6BAAW,cA2C1B,CAAA;IAED,4IAA4I;IAC5I,MAAM,MAAM;QAGF,MAAM,CAAC,YAAY,CAAC,GAAW;YACrC,IAAA,eAAM,EAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACjB,IAAA,eAAM,EAAC,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAC3B,IAAA,eAAM,EAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;QAClC,CAAC;QAEO,iBAAiB;YACvB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC;QAED,YAAmB,QAAQ,CAAC,EAAS,QAAQ,CAAC;YAA3B,UAAK,GAAL,KAAK,CAAI;YAAS,UAAK,GAAL,KAAK,CAAI;YAC5C,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC3B,CAAC;QAEM,OAAO,CAAC,GAAW;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACpC,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;QACpD,CAAC;QAEM,MAAM,CAAC,GAAW,IAAa,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChE,UAAU,CAAC,GAAW,IAAa,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClE,aAAa,CAAC,GAAW,IAAa,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE5E,IAAW,MAAM,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAEtE,iBAAiB,CAAC,GAAW,EAAE,GAAW;YAC/C,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACnC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACnC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;gBAC3B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAEM,GAAG,CAAC,GAAW;YACpB,IAAI,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACtB,IAAI,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACtB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACvC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;gBACtB,KAAK,IAAI,CAAC,CAAC;YACb,CAAC;YAED,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC;YACpB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC;YACpB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC3B,CAAC;QAEM,SAAS,CAAC,EAAc;YAC7B,SAAI,CAAC,aAAa,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/B,CAAC;QAEM,QAAQ,CAAC,KAAa;YAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC3B,CAAC;QAEM,QAAQ;YACb,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;gBAClB,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;YAE/C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACvD,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;YAC3B,OAAO,GAAG,KAAK,GAAG,KAAK,EAAE,CAAC,WAAW,EAAE,CAAC;QAC1C,CAAC;QAEM,YAAY;YACjB,OAAO,SAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACrD,CAAC;;IAzEuB,YAAK,GAAG,WAAW,CAAC;IA4E9C;;OAEG;IACH,QAAe,CAAC,CAAC,QAAQ,CAAC,GAAsB;QAC9C,IAAI,CAAC,KAAK,GAAG,CAAC,MAAM;YAClB,OAAO,CAAC,aAAa;QAEvB,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;QAE/C,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,uBAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,MAAM,EAAE,CAAC;QAE3B,SAAS,WAAW;YAClB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,OAAO,QAAQ,GAAG,GAAG,CAAC,MAAM,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3C,EAAE,MAAM,CAAC;gBACT,MAAM,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBACpC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;oBACjB,MAAM,CAAC,sCAAsC;gBAE/C,KAAK,KAAK,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,4BAA4B;gBAC1E,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,iDAAiD;gBACtE,EAAE,QAAQ,CAAC;YACb,CAAC;YAED,OAAO,KAAK,CAAC;QACf,CAAC;QAED,SAAS,WAAW,CAAC,MAAc;YACjC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,KAAK,GAAG,CAAC,CAAC;YAEd,iCAAiC;YACjC,MAAM,UAAU,GAAG,QAAQ,CAAC;YAC5B,MAAM,KAAK,GAAG,WAAW,EAAE,CAAC;YAE5B,MAAM,YAAY,GAAG,QAAQ,GAAG,UAAU,CAAC;YAC3C,IAAA,eAAM,EAAC,YAAY,IAAI,CAAC,CAAC,CAAC;YAE1B,IAAI,CAAC,KAAK,YAAY,IAAI,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChG,0CAA0C;gBAC1C,MAAM,WAAW,GAAG,QAAQ,CAAC;gBAC7B,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;gBAE7B,8CAA8C;gBAC9C,MAAM,aAAa,GAAG,QAAQ,GAAG,WAAW,CAAC;gBAC7C,IAAA,eAAM,EAAC,aAAa,GAAG,CAAC,IAAI,aAAa,IAAI,CAAC,CAAC,CAAC;gBAEhD,MAAM,iBAAiB,GAAG,CAAC,GAAG,aAAa,CAAC;gBAC5C,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACpE,KAAK,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrE,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,KAAK,CAAC;YAChB,CAAC;YAED,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YACrB,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,MAAM,EAAE,CAAC;QAC/B,OAAO,QAAQ,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;YAC7B,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,WAAW,CAAC,SAAS,CAAC,CAAC;YACvB,IAAI,SAAS,CAAC,MAAM;gBAClB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAE/C,IAAI,QAAQ,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC1B,QAAQ,GAAG,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;oBACxB,KAAK,GAAG;wBACN,UAAU,GAAG,WAAW,EAAE,CAAC;wBAC3B,IAAI,CAAC,KAAK,UAAU;4BAClB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;wBAE/C,IAAI,QAAQ,KAAK,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC,KAAK,GAAG;4BACpD,OAAO;wBAET,MAAM;oBACR,KAAK,GAAG;wBACN,MAAM;oBACR;wBACE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACrB,MAAM,KAAK,CAAC,YAAY,EAAE,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IA1FgB,0BAAQ,WA0FxB,CAAA;IAED;;OAEG;IACH,SAAgB,QAAQ,CAAC,GAAsB;QAC7C,OAAO;YACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC;SACvC,CAAC;IACJ,CAAC;IAJe,0BAAQ,WAIvB,CAAA;IAED;;;;;;;;OAQG;IACH,SAAgB,aAAa,CAAC,aAAgC,EAAE,GAAa;QAC3E,MAAM,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,aAAa,CAAC;YACtC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEd,OAAO,GAAG,CAAC;IACb,CAAC;IANe,+BAAa,gBAM5B,CAAA;IAED;;;;;;;;;OASG;IACH,SAAgB,eAAe,CAAC,aAAgC,EAAE,GAAe;QAC/E,MAAM,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC;QACtB,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,aAAa,CAAC;YACtC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,OAAO,GAAG,CAAC;IACb,CAAC;IANe,iCAAe,kBAM9B,CAAA;AACH,CAAC,EApUgB,iBAAiB,iCAAjB,iBAAiB,QAoUjC;AAED;;;GAGG;AACH,MAAa,gBAAiB,SAAQ,yBAAuB;IAC3D,oCAAoC;IACpC;QACE,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,yCAAmB,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,8DAA8D;IAC9D,IAAW,GAAG,KAA0B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE7D,mCAAmC;IACnC,IAAW,KAAK,KAAgC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;CACtE;AAXD,4CAWC;AAED;;;;;GAKG;AACH,MAAa,wBAAwB;IAKnC,2FAA2F;IAC3F,YAAmB,GAAuB;QAJzB,cAAS,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACnC,aAAQ,GAAG,IAAI,gBAAgB,EAAE,CAAC;QAIjD,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;IACxB,CAAC;IAED,uKAAuK;IACvK,IAAW,GAAG;QACZ,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,EAAc;QACvB,IAAI,CAAC,SAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAE9D,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,EAAc;QAC1B,IAAI,CAAC,SAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QAEjE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,mCAAmC;IAC5B,KAAK;QACV,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAED,+DAA+D;IACxD,KAAK,CAAC,GAAuB;QAClC,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;IACxB,CAAC;IAED,0IAA0I;IACnI,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,OAAO,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC;IAED,yJAAyJ;IAClJ,YAAY,CAAC,GAAuE;QACzF,IAAI,IAAI,CAAC,OAAO;YACd,OAAO,iBAAiB,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;aACvC,IAAI,yCAAmB,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC9D,OAAO,IAAI,CAAC,GAAG,CAAC;QAElB,OAAO,iBAAiB,CAAC,WAAW,CAAC,yCAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7E,CAAC;IAED,2JAA2J;IACpJ,mBAAmB,CAAC,GAAuE;QAChG,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAClB,OAAO,IAAI,CAAC,GAAG,CAAC;aACb,IAAI,IAAI,CAAC,OAAO,IAAI,yCAAmB,CAAC,UAAU,CAAC,GAAG,CAAC;YAC1D,OAAO,EAAE,CAAC;QAEZ,OAAO,iBAAiB,CAAC,WAAW,CAAC,yCAAmB,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACpF,CAAC;IAED,yJAAyJ;IAClJ,iBAAiB,CAAC,GAAuE;QAC9F,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAClC,OAAO,EAAE,CAAC;QAEZ,OAAO,iBAAiB,CAAC,WAAW,CAAC,yCAAmB,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAClF,CAAC;IAED,+CAA+C;IAC/C,IAAW,OAAO;QAChB,OAAO,yCAAmB,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,KAAyE;QACrF,IAAI,KAAK,YAAY,wBAAwB,EAAE,CAAC;YAC9C,IAAI,KAAK,KAAK,IAAI;gBAChB,OAAO,IAAI,CAAC;YAEd,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAC3B,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC;QACtB,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,QAAQ;YAC3B,OAAO,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC;QAE5B,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,yCAAmB,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,IAAY,QAAQ;QAClB,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;IAC3D,CAAC;IAEO,SAAS;QACf,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO;QAET,MAAM,UAAU,GAAG,yCAAmB,CAAC,UAAU,CAAC,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC5G,MAAM,KAAK,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,yCAAmB,CAAC,aAAa,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7G,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAEjD,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;CACF;AA3HD,4DA2HC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Ids\r\n */\r\n\r\nimport { assert } from \"./Assert\";\r\nimport { Id64, Id64Array, Id64Set, Id64String } from \"./Id\";\r\nimport { OrderedId64Iterable } from \"./OrderedId64Iterable\";\r\nimport { SortedArray } from \"./SortedArray\";\r\n\r\n/** @public */\r\nexport type CompressedId64Set = string;\r\n\r\n/** A compact string representation of an [[Id64Set]]. Such a representation is useful when serializing potentially very large\r\n * sets of Ids.\r\n * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids represented by a compact string.\r\n * @see [[CompressedId64Set.compressSet]] and [[CompressedId64Set.compressArray]] to produce a compact string from a collection of Ids.\r\n * @see [[CompressedId64Set.decompressSet]] and [[CompressedId64Set.decompressArray]] to produce a collection of Ids from a compact string.\r\n * @see [[OrderedId64Iterable]] for a generic representation of an ordered set of Ids (compressed or otherwise).\r\n * @see [[MutableCompressedId64Set]] for a mutable version.\r\n * @public\r\n */\r\nexport namespace CompressedId64Set { // eslint-disable-line @typescript-eslint/no-redeclare\r\n  function isHexDigit(ch: number): boolean {\r\n    // ascii values:\r\n    // '0' = 48\r\n    // '9' = 57\r\n    // 'a' = 65\r\n    // 'f' = 70\r\n\r\n    return (ch >= 48 && ch <= 57) || (ch >= 65 && ch <= 70);\r\n  }\r\n\r\n  function compactRange(increment: Uint64, length: number): string {\r\n    assert(length > 0);\r\n    const inc = `+${increment.toString()}`;\r\n    if (length <= 1)\r\n      return inc;\r\n\r\n    const len = length.toString(16).toUpperCase();\r\n    return `${inc}*${len}`;\r\n  }\r\n\r\n  /** Given a set of [[Id64String]]s, produce a compact string representation. Useful when serializing potentially large sets of Ids.\r\n   * @note Invalid Ids are ignored.\r\n   * @see [[CompressedId64Set.sortAndCompress]] to compress any unordered collection of Ids.\r\n   * @see [[CompressedId64Set.compressArray]] to perform the same operation on an [[Id64Array]].\r\n   * @see [[CompressedId64Set.decompressSet]] to perform the inverse operation.\r\n   */\r\n  export function compressSet(ids: Id64Set): CompressedId64Set {\r\n    return sortAndCompress(ids);\r\n  }\r\n\r\n  /** Create a sorted array from `ids`, then return a compact string representation of those Ids.\r\n   * @see [[CompressedId64Set.compressIds]] if `ids` is known to already be sorted.\r\n   */\r\n  export function sortAndCompress(ids: Iterable<Id64String>): CompressedId64Set {\r\n    // `string` is an Iterable<string>. In that case assume caller passed a single Id64String.\r\n    const arr = typeof ids === \"string\" ? [ids] : Array.from(ids);\r\n    OrderedId64Iterable.sortArray(arr);\r\n    return compressArray(arr);\r\n  }\r\n\r\n  /** Give a **numerically-ordered** array of [[Id64String]]s, produce a compact string representation. Useful when serializing potentially large sets of Ids.\r\n   * Duplicate Ids are included only once in the string representation.\r\n   * @throws Error if two consecutive Ids `x` and `y` exist such that the numerical value of `x` is greater than that of `y` - i.e., the array is not properly sorted.\r\n   * @note The array must be sorted according to the 64-bit numerical value of each Id.\r\n   * @note Invalid Ids are ignored.\r\n   * @see [[CompressedId64Set.decompressArray]] to perform the inverse operation.\r\n   * @see [[OrderedId64Iterable.sortArray]] to ensure the Ids are properly sorted.\r\n   * @see [[CompressedId64Set.sortAndCompress]] to compress any unordered collection of Ids.\r\n   */\r\n  export function compressArray(ids: Id64Array): CompressedId64Set {\r\n    return compressIds(ids);\r\n  }\r\n\r\n  /** Give a **numerically-ordered** collection of [[Id64String]]s, produce a compact string representation. Useful when serializing potentially large sets of Ids.\r\n   * Duplicate Ids are included only once in the string representation.\r\n   * @throws Error if two consecutive Ids `x` and `y` exist such that the numerical value of `x` is greater than that of `y` - i.e., the collection is not properly sorted.\r\n   * @note The collection must be sorted according to the 64-bit numerical value of each Id.\r\n   * @note Invalid Ids are ignored.\r\n   * @see [[CompressedId64Set.iterable]] to perform the inverse operation.\r\n   * @see [[OrderedId64Iterable.sortArray]] or [[OrderedId64Iterable.compare]] to ensure the Ids are properly sorted.\r\n   * @see [[CompressedId64Set.sortAndCompress]] to compress any unordered collection of Ids.\r\n   */\r\n  export function compressIds(ids: OrderedId64Iterable): CompressedId64Set {\r\n    if (\"string\" === typeof ids)\r\n      return ids;\r\n\r\n    let str = \"\";\r\n\r\n    const prevId = new Uint64();\r\n    const rangeIncrement = new Uint64();\r\n    let rangeLen = 0;\r\n\r\n    const curId = new Uint64();\r\n    const curIncrement = new Uint64();\r\n    for (const id of ids) {\r\n      if (!Id64.isValidId64(id))\r\n        continue; // ignore garbage and invalid Ids (\"0\")\r\n\r\n      curId.setFromId(id);\r\n      curIncrement.setFromDifference(curId, prevId);\r\n\r\n      const cmp = prevId.compare(curId);\r\n      if (0 === cmp)\r\n        continue; // ignore duplicates\r\n      else if (cmp > 0)\r\n        throw new Error(\"CompressedId64Set.compressArray requires a sorted array as input\");\r\n\r\n      prevId.copyFrom(curId);\r\n\r\n      if (0 === rangeLen) {\r\n        rangeIncrement.copyFrom(curIncrement);\r\n        rangeLen = 1;\r\n      } else if (curIncrement.equals(rangeIncrement)) {\r\n        ++rangeLen;\r\n      } else {\r\n        str += compactRange(rangeIncrement, rangeLen);\r\n        rangeIncrement.copyFrom(curIncrement);\r\n        rangeLen = 1;\r\n      }\r\n    }\r\n\r\n    if (0 < rangeLen)\r\n      str += compactRange(rangeIncrement, rangeLen);\r\n\r\n    return str;\r\n  }\r\n\r\n  /** This exists strictly for the purposes of compressed sets of 64-bit Ids, to avoid the overhead of BigInt for handling 64-bit integers. */\r\n  class Uint64 implements Id64.Uint32Pair {\r\n    private static readonly _base = 0x100000000;\r\n\r\n    private static assertUint32(num: number): void {\r\n      assert(num >= 0);\r\n      assert(num < Uint64._base);\r\n      assert(Math.floor(num) === num);\r\n    }\r\n\r\n    private assertConstraints(): void {\r\n      Uint64.assertUint32(this.lower);\r\n      Uint64.assertUint32(this.upper);\r\n    }\r\n\r\n    constructor(public lower = 0, public upper = 0) {\r\n      this.assertConstraints();\r\n    }\r\n\r\n    public compare(rhs: Uint64): number {\r\n      const diff = this.upper - rhs.upper;\r\n      return 0 === diff ? this.lower - rhs.lower : diff;\r\n    }\r\n\r\n    public equals(rhs: Uint64): boolean { return 0 === this.compare(rhs); }\r\n    public isLessThan(rhs: Uint64): boolean { return this.compare(rhs) < 0; }\r\n    public isGreaterThan(rhs: Uint64): boolean { return this.compare(rhs) > 0; }\r\n\r\n    public get isZero(): boolean { return 0 === this.lower && 0 === this.upper; }\r\n\r\n    public setFromDifference(lhs: Uint64, rhs: Uint64): void {\r\n      assert(!rhs.isGreaterThan(lhs));\r\n\r\n      this.lower = lhs.lower - rhs.lower;\r\n      this.upper = lhs.upper - rhs.upper;\r\n      if (this.lower < 0) {\r\n        this.lower += Uint64._base;\r\n        this.upper -= 1;\r\n      }\r\n    }\r\n\r\n    public add(rhs: Uint64): void {\r\n      let lower = rhs.lower;\r\n      let upper = rhs.upper;\r\n      if (lower + this.lower >= Uint64._base) {\r\n        lower -= Uint64._base;\r\n        upper += 1;\r\n      }\r\n\r\n      this.lower += lower;\r\n      this.upper += upper;\r\n      this.assertConstraints();\r\n    }\r\n\r\n    public setFromId(id: Id64String): void {\r\n      Id64.getUint32Pair(id, this);\r\n    }\r\n\r\n    public copyFrom(other: Uint64): void {\r\n      this.lower = other.lower;\r\n      this.upper = other.upper;\r\n    }\r\n\r\n    public toString(): string {\r\n      if (0 === this.upper)\r\n        return this.lower.toString(16).toUpperCase();\r\n\r\n      const upper = this.upper.toString(16);\r\n      const lower = this.lower.toString(16).padStart(8, \"0\");\r\n      assert(lower.length === 8);\r\n      return `${upper}${lower}`.toUpperCase();\r\n    }\r\n\r\n    public toId64String(): string {\r\n      return Id64.fromUint32Pair(this.lower, this.upper);\r\n    }\r\n  }\r\n\r\n  /** Supplies an iterator over the [[Id64String]]s in a [[CompressedId64Set]].\r\n   * The Ids are iterated in ascending order based on their unsigned 64-bit integer values.\r\n   */\r\n  export function* iterator(ids: CompressedId64Set): Iterator<Id64String> {\r\n    if (0 === ids.length)\r\n      return; // empty set.\r\n\r\n    if (\"+\" !== ids[0])\r\n      throw new Error(\"Invalid CompressedId64Set\");\r\n\r\n    let curIndex = 1; // skip the leading '+'\r\n    const curId = new Uint64();\r\n\r\n    function parseUint32(): number {\r\n      let value = 0;\r\n      let nChars = 0;\r\n      while (curIndex < ids.length && nChars < 8) {\r\n        ++nChars;\r\n        const ch = ids.charCodeAt(curIndex);\r\n        if (!isHexDigit(ch))\r\n          break; // not a hex digit in [0..9] or [A..F]\r\n\r\n        value <<= 4;\r\n        value |= (ch >= 65 ? ch - 65 + 10 : ch - 48); // ch - 'A' + 10 or ch - '0'\r\n        value = value >>> 0; // restore unsignedness because silly javascript.\r\n        ++curIndex;\r\n      }\r\n\r\n      return value;\r\n    }\r\n\r\n    function parseUint64(uint64: Uint64): void {\r\n      let lower = 0;\r\n      let upper = 0;\r\n\r\n      // Read up to the first 8 digits.\r\n      const startIndex = curIndex;\r\n      const first = parseUint32();\r\n\r\n      const nFirstDigits = curIndex - startIndex;\r\n      assert(nFirstDigits <= 8);\r\n\r\n      if (8 === nFirstDigits && curIndex + 1 < ids.length && isHexDigit(ids.charCodeAt(curIndex + 1))) {\r\n        // We've got up to 8 more digits remaining\r\n        const secondIndex = curIndex;\r\n        const second = parseUint32();\r\n\r\n        // Transfer excess digits from upper to lower.\r\n        const nSecondDigits = curIndex - secondIndex;\r\n        assert(nSecondDigits > 0 && nSecondDigits <= 8);\r\n\r\n        const nDigitsToTransfer = 8 - nSecondDigits;\r\n        upper = first >>> (4 * nDigitsToTransfer);\r\n        const transfer = first - ((upper << (4 * nDigitsToTransfer)) >>> 0);\r\n        lower = (second | ((transfer << (4 * nSecondDigits)) >>> 0)) >>> 0;\r\n      } else {\r\n        lower = first;\r\n      }\r\n\r\n      uint64.lower = lower;\r\n      uint64.upper = upper;\r\n    }\r\n\r\n    const increment = new Uint64();\r\n    while (curIndex < ids.length) {\r\n      let multiplier = 1;\r\n      parseUint64(increment);\r\n      if (increment.isZero)\r\n        throw new Error(\"Invalid CompressedId64Set\");\r\n\r\n      if (curIndex < ids.length) {\r\n        switch (ids[curIndex++]) {\r\n          case \"*\":\r\n            multiplier = parseUint32();\r\n            if (0 === multiplier)\r\n              throw new Error(\"Invalid CompressedId64Set\");\r\n\r\n            if (curIndex !== ids.length && ids[curIndex++] !== \"+\")\r\n              return;\r\n\r\n            break;\r\n          case \"+\":\r\n            break;\r\n          default:\r\n            throw new Error(\"Invalid CompressedId64Set\");\r\n        }\r\n      }\r\n\r\n      for (let i = 0; i < multiplier; i++) {\r\n        curId.add(increment);\r\n        yield curId.toId64String();\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Supplies an iterable over the [[Id64String]]s in a [[CompressedId64Set]].\r\n   * The Ids are iterated in ascending order based on their unsigned 64-bit integer values.\r\n   */\r\n  export function iterable(ids: CompressedId64Set): OrderedId64Iterable {\r\n    return {\r\n      [Symbol.iterator]: () => iterator(ids),\r\n    };\r\n  }\r\n\r\n  /** Decompress the compact string representation of an [[Id64Set]] into an [[Id64Set]].\r\n   * @param compressedIds The compact string representation.\r\n   * @param out If supplied, the Ids will be inserted into this set rather than allocating and returning a new set.\r\n   * @returns The set containing the decompressed Ids.\r\n   * @throws Error if `compressedIds` is not a well-formed [[CompressedId64Set]].\r\n   * @see [[CompressedId64Set.compressSet]] to perform the inverse operation.\r\n   * @see [[CompressedId64Set.decompressArray]] to decompress as an [[Id64Array]] instead.\r\n   * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids.\r\n   */\r\n  export function decompressSet(compressedIds: CompressedId64Set, out?: Id64Set): Id64Set {\r\n    const set = out ?? new Set<string>();\r\n    for (const id of iterable(compressedIds))\r\n      set.add(id);\r\n\r\n    return set;\r\n  }\r\n\r\n  /** Decompress the compact string representation of an [[Id64Set]] into an [[Id64Array]].\r\n   * @param compressedIds The compact string representation.\r\n   * @param out If supplied, the Ids will be appended to this array rather than allocating and returning a new array.\r\n   * @returns The array containing the decompressed Ids.\r\n   * @throws Error if `compressedIds` is not a well-formed [[CompressedId64Set]].\r\n   * @note The Ids are decompressed and appended to the array in ascending order based on their 64-bit numerical values.\r\n   * @see [[CompressedId64Set.compressArray]] to perform the inverse operation.\r\n   * @see [[CompressedId64Set.decompressSet]] to decompress as an [[Id64Set]] instead.\r\n   * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids.\r\n   */\r\n  export function decompressArray(compressedIds: CompressedId64Set, out?: Id64Array): Id64Array {\r\n    const arr = out ?? [];\r\n    for (const id of iterable(compressedIds))\r\n      arr.push(id);\r\n\r\n    return arr;\r\n  }\r\n}\r\n\r\n/** A [[SortedArray]] of unique [[Id64String]]s sorted in ascending order by the 64-bit unsigned integer values of the Ids.\r\n * @see [[CompressedId64Set]] for an immutable compact string representation.\r\n * @public\r\n */\r\nexport class OrderedId64Array extends SortedArray<Id64String> {\r\n  /** Construct a new, empty array. */\r\n  public constructor() {\r\n    super((lhs, rhs) => OrderedId64Iterable.compare(lhs, rhs));\r\n  }\r\n\r\n  /** An iterable that iterates over the Ids in sorted order. */\r\n  public get ids(): OrderedId64Iterable { return this._array; }\r\n\r\n  /** The underlying array of Ids. */\r\n  public get array(): ReadonlyArray<Id64String> { return this._array; }\r\n}\r\n\r\n/** A mutable set of valid [[Id64String]]s sorted in ascending order by the 64-bit unsigned integer value of the Ids.\r\n * Internally the set of Ids is maintained as a [[CompressedId64Set]] string representation.\r\n * Insertions and removals are buffered until the string representation needs to be recomputed. The string representation is recomputed by every public method except [[add]] and [[delete]] -\r\n * therefore, if multiple removals and/or insertions are required, it is most efficient to perform them all before invoking other methods.\r\n * @public\r\n */\r\nexport class MutableCompressedId64Set implements OrderedId64Iterable {\r\n  private _ids: CompressedId64Set;\r\n  private readonly _inserted = new OrderedId64Array();\r\n  private readonly _deleted = new OrderedId64Array();\r\n\r\n  /** Construct a new set, optionally initialized to contain the Ids represented by `ids`. */\r\n  public constructor(ids?: CompressedId64Set) {\r\n    this._ids = ids ?? \"\";\r\n  }\r\n\r\n  /** Obtain the compact string representation of the contents of this set. If any insertions or removals are pending, they will be applied and the string recomputed. */\r\n  public get ids(): CompressedId64Set {\r\n    this.updateIds();\r\n    return this._ids;\r\n  }\r\n\r\n  /** Add the specified Id to the set.\r\n   * @throws Error if `id` is not a valid [[Id64String]].\r\n   */\r\n  public add(id: Id64String): void {\r\n    if (!Id64.isValidId64(id))\r\n      throw new Error(\"MutableCompressedId64Set.add: invalid Id\");\r\n\r\n    this._deleted.remove(id);\r\n    this._inserted.insert(id);\r\n  }\r\n\r\n  /** Remove the specified Id from the set.\r\n   * @throws Error if `id` is not a valid [[Id64String]].\r\n   */\r\n  public delete(id: Id64String): void {\r\n    if (!Id64.isValidId64(id))\r\n      throw new Error(\"MutableCompressedId64Set.delete: invalid Id\");\r\n\r\n    this._inserted.remove(id);\r\n    this._deleted.insert(id);\r\n  }\r\n\r\n  /** Remove all Ids from the set. */\r\n  public clear(): void {\r\n    this._ids = \"\";\r\n    this._inserted.clear();\r\n    this._deleted.clear();\r\n  }\r\n\r\n  /** Remove all Ids from the set, then add the specified Ids. */\r\n  public reset(ids?: CompressedId64Set): void {\r\n    this.clear();\r\n    this._ids = ids ?? \"\";\r\n  }\r\n\r\n  /** Obtain an iterator over the Ids in this set. The Ids are returned in ascending order based on their unsigned 64-bit integer values. */\r\n  public [Symbol.iterator]() {\r\n    return CompressedId64Set.iterator(this.ids);\r\n  }\r\n\r\n  /** Compute a compact string representation of the union of this and another set of Ids - i.e., those Ids present in either this and/or the other set. */\r\n  public computeUnion(ids: OrderedId64Iterable | CompressedId64Set | MutableCompressedId64Set): CompressedId64Set {\r\n    if (this.isEmpty)\r\n      return CompressedId64Set.compressIds(ids);\r\n    else if (OrderedId64Iterable.isEmptySet(ids) || this.equals(ids))\r\n      return this.ids;\r\n\r\n    return CompressedId64Set.compressIds(OrderedId64Iterable.union(this, ids));\r\n  }\r\n\r\n  /** Compute a compact string representation of the intersection of this and another set of Ids - i.e., those Ids present in both this and the other set. */\r\n  public computeIntersection(ids: OrderedId64Iterable | CompressedId64Set | MutableCompressedId64Set): CompressedId64Set {\r\n    if (this.equals(ids))\r\n      return this.ids;\r\n    else if (this.isEmpty || OrderedId64Iterable.isEmptySet(ids))\r\n      return \"\";\r\n\r\n    return CompressedId64Set.compressIds(OrderedId64Iterable.intersection(this, ids));\r\n  }\r\n\r\n  /** Compute a compact string representation of the difference between this and another set - i.e., those Ids present in this but not in the other set. */\r\n  public computeDifference(ids: OrderedId64Iterable | CompressedId64Set | MutableCompressedId64Set): CompressedId64Set {\r\n    if (this.isEmpty || this.equals(ids))\r\n      return \"\";\r\n\r\n    return CompressedId64Set.compressIds(OrderedId64Iterable.difference(this, ids));\r\n  }\r\n\r\n  /** Return true if this set contains no Ids. */\r\n  public get isEmpty(): boolean {\r\n    return OrderedId64Iterable.isEmptySet(this.ids);\r\n  }\r\n\r\n  /** Return true if the set of Ids represented by `other` is identical to those in this set.\r\n   * @note This considers only the **distinct** Ids in `other` - duplicates are ignored.\r\n   */\r\n  public equals(other: CompressedId64Set | MutableCompressedId64Set | OrderedId64Iterable): boolean {\r\n    if (other instanceof MutableCompressedId64Set) {\r\n      if (other === this)\r\n        return true;\r\n\r\n      if (typeof other !== \"string\")\r\n        other = other.ids;\r\n    }\r\n\r\n    if (typeof other === \"string\")\r\n      return other === this.ids;\r\n\r\n    this.updateIds();\r\n    return OrderedId64Iterable.areEqualSets(this, other);\r\n  }\r\n\r\n  private get _isDirty(): boolean {\r\n    return !this._inserted.isEmpty || !this._deleted.isEmpty;\r\n  }\r\n\r\n  private updateIds(): void {\r\n    if (!this._isDirty)\r\n      return;\r\n\r\n    const difference = OrderedId64Iterable.difference(CompressedId64Set.iterable(this._ids), this._deleted.ids);\r\n    const union = { [Symbol.iterator]: () => OrderedId64Iterable.unionIterator(difference, this._inserted.ids) };\r\n    this._ids = CompressedId64Set.compressIds(union);\r\n\r\n    this._inserted.clear();\r\n    this._deleted.clear();\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CompressedId64Set.js","sourceRoot":"","sources":["../../src/CompressedId64Set.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,qCAAkC;AAClC,6BAA4D;AAC5D,+DAA4D;AAC5D,+CAA4C;AAK5C;;;;;;;;GAQG;AACH,IAAiB,iBAAiB,CAoUjC;AApUD,WAAiB,iBAAiB;IAChC,SAAS,UAAU,CAAC,EAAU;QAC5B,gBAAgB;QAChB,WAAW;QACX,WAAW;QACX,WAAW;QACX,WAAW;QAEX,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,SAAS,YAAY,CAAC,SAAiB,EAAE,MAAc;QACrD,IAAA,eAAM,EAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,IAAI,CAAC;YACb,OAAO,GAAG,CAAC;QAEb,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QAC9C,OAAO,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACH,SAAgB,WAAW,CAAC,GAAY;QACtC,OAAO,eAAe,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAFe,6BAAW,cAE1B,CAAA;IAED;;OAEG;IACH,SAAgB,eAAe,CAAC,GAAyB;QACvD,0FAA0F;QAC1F,MAAM,GAAG,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9D,yCAAmB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IALe,iCAAe,kBAK9B,CAAA;IAED;;;;;;;;OAQG;IACH,SAAgB,aAAa,CAAC,GAAc;QAC1C,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAFe,+BAAa,gBAE5B,CAAA;IAED;;;;;;;;OAQG;IACH,SAAgB,WAAW,CAAC,GAAwB;QAClD,IAAI,QAAQ,KAAK,OAAO,GAAG;YACzB,OAAO,GAAG,CAAC;QAEb,IAAI,GAAG,GAAG,EAAE,CAAC;QAEb,MAAM,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,cAAc,GAAG,IAAI,MAAM,EAAE,CAAC;QACpC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,MAAM,KAAK,GAAG,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,IAAI,MAAM,EAAE,CAAC;QAClC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,SAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBACvB,SAAS,CAAC,uCAAuC;YAEnD,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACpB,YAAY,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAE9C,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK,GAAG;gBACX,SAAS,CAAC,oBAAoB;iBAC3B,IAAI,GAAG,GAAG,CAAC;gBACd,MAAM,IAAI,KAAK,CAAC,kEAAkE,CAAC,CAAC;YAEtF,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAEvB,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;gBACnB,cAAc,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBACtC,QAAQ,GAAG,CAAC,CAAC;YACf,CAAC;iBAAM,IAAI,YAAY,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC/C,EAAE,QAAQ,CAAC;YACb,CAAC;iBAAM,CAAC;gBACN,GAAG,IAAI,YAAY,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;gBAC9C,cAAc,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBACtC,QAAQ,GAAG,CAAC,CAAC;YACf,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,QAAQ;YACd,GAAG,IAAI,YAAY,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QAEhD,OAAO,GAAG,CAAC;IACb,CAAC;IA3Ce,6BAAW,cA2C1B,CAAA;IAED,4IAA4I;IAC5I,MAAM,MAAM;QAcS;QAAkB;QAb7B,MAAM,CAAU,KAAK,GAAG,WAAW,CAAC;QAEpC,MAAM,CAAC,YAAY,CAAC,GAAW;YACrC,IAAA,eAAM,EAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACjB,IAAA,eAAM,EAAC,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAC3B,IAAA,eAAM,EAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;QAClC,CAAC;QAEO,iBAAiB;YACvB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC;QAED,YAAmB,QAAQ,CAAC,EAAS,QAAQ,CAAC;YAA3B,UAAK,GAAL,KAAK,CAAI;YAAS,UAAK,GAAL,KAAK,CAAI;YAC5C,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC3B,CAAC;QAEM,OAAO,CAAC,GAAW;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACpC,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;QACpD,CAAC;QAEM,MAAM,CAAC,GAAW,IAAa,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChE,UAAU,CAAC,GAAW,IAAa,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClE,aAAa,CAAC,GAAW,IAAa,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAE5E,IAAW,MAAM,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAEtE,iBAAiB,CAAC,GAAW,EAAE,GAAW;YAC/C,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACnC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACnC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;gBAC3B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAEM,GAAG,CAAC,GAAW;YACpB,IAAI,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACtB,IAAI,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACtB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACvC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;gBACtB,KAAK,IAAI,CAAC,CAAC;YACb,CAAC;YAED,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC;YACpB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC;YACpB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC3B,CAAC;QAEM,SAAS,CAAC,EAAc;YAC7B,SAAI,CAAC,aAAa,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/B,CAAC;QAEM,QAAQ,CAAC,KAAa;YAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC3B,CAAC;QAEM,QAAQ;YACb,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK;gBAClB,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;YAE/C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACvD,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;YAC3B,OAAO,GAAG,KAAK,GAAG,KAAK,EAAE,CAAC,WAAW,EAAE,CAAC;QAC1C,CAAC;QAEM,YAAY;YACjB,OAAO,SAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACrD,CAAC;;IAGH;;OAEG;IACH,QAAe,CAAC,CAAC,QAAQ,CAAC,GAAsB;QAC9C,IAAI,CAAC,KAAK,GAAG,CAAC,MAAM;YAClB,OAAO,CAAC,aAAa;QAEvB,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;YAChB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;QAE/C,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,uBAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,MAAM,EAAE,CAAC;QAE3B,SAAS,WAAW;YAClB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,OAAO,QAAQ,GAAG,GAAG,CAAC,MAAM,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3C,EAAE,MAAM,CAAC;gBACT,MAAM,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBACpC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;oBACjB,MAAM,CAAC,sCAAsC;gBAE/C,KAAK,KAAK,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,4BAA4B;gBAC1E,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,iDAAiD;gBACtE,EAAE,QAAQ,CAAC;YACb,CAAC;YAED,OAAO,KAAK,CAAC;QACf,CAAC;QAED,SAAS,WAAW,CAAC,MAAc;YACjC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,KAAK,GAAG,CAAC,CAAC;YAEd,iCAAiC;YACjC,MAAM,UAAU,GAAG,QAAQ,CAAC;YAC5B,MAAM,KAAK,GAAG,WAAW,EAAE,CAAC;YAE5B,MAAM,YAAY,GAAG,QAAQ,GAAG,UAAU,CAAC;YAC3C,IAAA,eAAM,EAAC,YAAY,IAAI,CAAC,CAAC,CAAC;YAE1B,IAAI,CAAC,KAAK,YAAY,IAAI,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChG,0CAA0C;gBAC1C,MAAM,WAAW,GAAG,QAAQ,CAAC;gBAC7B,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;gBAE7B,8CAA8C;gBAC9C,MAAM,aAAa,GAAG,QAAQ,GAAG,WAAW,CAAC;gBAC7C,IAAA,eAAM,EAAC,aAAa,GAAG,CAAC,IAAI,aAAa,IAAI,CAAC,CAAC,CAAC;gBAEhD,MAAM,iBAAiB,GAAG,CAAC,GAAG,aAAa,CAAC;gBAC5C,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACpE,KAAK,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrE,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,KAAK,CAAC;YAChB,CAAC;YAED,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YACrB,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,MAAM,EAAE,CAAC;QAC/B,OAAO,QAAQ,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;YAC7B,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,WAAW,CAAC,SAAS,CAAC,CAAC;YACvB,IAAI,SAAS,CAAC,MAAM;gBAClB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAE/C,IAAI,QAAQ,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC1B,QAAQ,GAAG,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;oBACxB,KAAK,GAAG;wBACN,UAAU,GAAG,WAAW,EAAE,CAAC;wBAC3B,IAAI,CAAC,KAAK,UAAU;4BAClB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;wBAE/C,IAAI,QAAQ,KAAK,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC,KAAK,GAAG;4BACpD,OAAO;wBAET,MAAM;oBACR,KAAK,GAAG;wBACN,MAAM;oBACR;wBACE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACrB,MAAM,KAAK,CAAC,YAAY,EAAE,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IA1FgB,0BAAQ,WA0FxB,CAAA;IAED;;OAEG;IACH,SAAgB,QAAQ,CAAC,GAAsB;QAC7C,OAAO;YACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC;SACvC,CAAC;IACJ,CAAC;IAJe,0BAAQ,WAIvB,CAAA;IAED;;;;;;;;OAQG;IACH,SAAgB,aAAa,CAAC,aAAgC,EAAE,GAAa;QAC3E,MAAM,GAAG,GAAG,GAAG,IAAI,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,aAAa,CAAC;YACtC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEd,OAAO,GAAG,CAAC;IACb,CAAC;IANe,+BAAa,gBAM5B,CAAA;IAED;;;;;;;;;OASG;IACH,SAAgB,eAAe,CAAC,aAAgC,EAAE,GAAe;QAC/E,MAAM,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC;QACtB,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,aAAa,CAAC;YACtC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,OAAO,GAAG,CAAC;IACb,CAAC;IANe,iCAAe,kBAM9B,CAAA;AACH,CAAC,EApUgB,iBAAiB,iCAAjB,iBAAiB,QAoUjC;AAED;;;GAGG;AACH,MAAa,gBAAiB,SAAQ,yBAAuB;IAC3D,oCAAoC;IACpC;QACE,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,yCAAmB,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,8DAA8D;IAC9D,IAAW,GAAG,KAA0B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE7D,mCAAmC;IACnC,IAAW,KAAK,KAAgC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;CACtE;AAXD,4CAWC;AAED;;;;;GAKG;AACH,MAAa,wBAAwB;IAC3B,IAAI,CAAoB;IACf,SAAS,GAAG,IAAI,gBAAgB,EAAE,CAAC;IACnC,QAAQ,GAAG,IAAI,gBAAgB,EAAE,CAAC;IAEnD,2FAA2F;IAC3F,YAAmB,GAAuB;QACxC,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;IACxB,CAAC;IAED,uKAAuK;IACvK,IAAW,GAAG;QACZ,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,EAAc;QACvB,IAAI,CAAC,SAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAE9D,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,EAAc;QAC1B,IAAI,CAAC,SAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QAEjE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,mCAAmC;IAC5B,KAAK;QACV,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAED,+DAA+D;IACxD,KAAK,CAAC,GAAuB;QAClC,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;IACxB,CAAC;IAED,0IAA0I;IACnI,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,OAAO,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC;IAED,yJAAyJ;IAClJ,YAAY,CAAC,GAAuE;QACzF,IAAI,IAAI,CAAC,OAAO;YACd,OAAO,iBAAiB,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;aACvC,IAAI,yCAAmB,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAC9D,OAAO,IAAI,CAAC,GAAG,CAAC;QAElB,OAAO,iBAAiB,CAAC,WAAW,CAAC,yCAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7E,CAAC;IAED,2JAA2J;IACpJ,mBAAmB,CAAC,GAAuE;QAChG,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAClB,OAAO,IAAI,CAAC,GAAG,CAAC;aACb,IAAI,IAAI,CAAC,OAAO,IAAI,yCAAmB,CAAC,UAAU,CAAC,GAAG,CAAC;YAC1D,OAAO,EAAE,CAAC;QAEZ,OAAO,iBAAiB,CAAC,WAAW,CAAC,yCAAmB,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACpF,CAAC;IAED,yJAAyJ;IAClJ,iBAAiB,CAAC,GAAuE;QAC9F,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAClC,OAAO,EAAE,CAAC;QAEZ,OAAO,iBAAiB,CAAC,WAAW,CAAC,yCAAmB,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAClF,CAAC;IAED,+CAA+C;IAC/C,IAAW,OAAO;QAChB,OAAO,yCAAmB,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,KAAyE;QACrF,IAAI,KAAK,YAAY,wBAAwB,EAAE,CAAC;YAC9C,IAAI,KAAK,KAAK,IAAI;gBAChB,OAAO,IAAI,CAAC;YAEd,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAC3B,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC;QACtB,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,QAAQ;YAC3B,OAAO,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC;QAE5B,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,yCAAmB,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,IAAY,QAAQ;QAClB,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;IAC3D,CAAC;IAEO,SAAS;QACf,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO;QAET,MAAM,UAAU,GAAG,yCAAmB,CAAC,UAAU,CAAC,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC5G,MAAM,KAAK,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,yCAAmB,CAAC,aAAa,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7G,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAEjD,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;CACF;AA3HD,4DA2HC","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\nimport { assert } from \"./Assert\";\nimport { Id64, Id64Array, Id64Set, Id64String } from \"./Id\";\nimport { OrderedId64Iterable } from \"./OrderedId64Iterable\";\nimport { SortedArray } from \"./SortedArray\";\n\n/** @public */\nexport type CompressedId64Set = string;\n\n/** A compact string representation of an [[Id64Set]]. Such a representation is useful when serializing potentially very large\n * sets of Ids.\n * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids represented by a compact string.\n * @see [[CompressedId64Set.compressSet]] and [[CompressedId64Set.compressArray]] to produce a compact string from a collection of Ids.\n * @see [[CompressedId64Set.decompressSet]] and [[CompressedId64Set.decompressArray]] to produce a collection of Ids from a compact string.\n * @see [[OrderedId64Iterable]] for a generic representation of an ordered set of Ids (compressed or otherwise).\n * @see [[MutableCompressedId64Set]] for a mutable version.\n * @public\n */\nexport namespace CompressedId64Set { // eslint-disable-line @typescript-eslint/no-redeclare\n  function isHexDigit(ch: number): boolean {\n    // ascii values:\n    // '0' = 48\n    // '9' = 57\n    // 'a' = 65\n    // 'f' = 70\n\n    return (ch >= 48 && ch <= 57) || (ch >= 65 && ch <= 70);\n  }\n\n  function compactRange(increment: Uint64, length: number): string {\n    assert(length > 0);\n    const inc = `+${increment.toString()}`;\n    if (length <= 1)\n      return inc;\n\n    const len = length.toString(16).toUpperCase();\n    return `${inc}*${len}`;\n  }\n\n  /** Given a set of [[Id64String]]s, produce a compact string representation. Useful when serializing potentially large sets of Ids.\n   * @note Invalid Ids are ignored.\n   * @see [[CompressedId64Set.sortAndCompress]] to compress any unordered collection of Ids.\n   * @see [[CompressedId64Set.compressArray]] to perform the same operation on an [[Id64Array]].\n   * @see [[CompressedId64Set.decompressSet]] to perform the inverse operation.\n   */\n  export function compressSet(ids: Id64Set): CompressedId64Set {\n    return sortAndCompress(ids);\n  }\n\n  /** Create a sorted array from `ids`, then return a compact string representation of those Ids.\n   * @see [[CompressedId64Set.compressIds]] if `ids` is known to already be sorted.\n   */\n  export function sortAndCompress(ids: Iterable<Id64String>): CompressedId64Set {\n    // `string` is an Iterable<string>. In that case assume caller passed a single Id64String.\n    const arr = typeof ids === \"string\" ? [ids] : Array.from(ids);\n    OrderedId64Iterable.sortArray(arr);\n    return compressArray(arr);\n  }\n\n  /** Give a **numerically-ordered** array of [[Id64String]]s, produce a compact string representation. Useful when serializing potentially large sets of Ids.\n   * Duplicate Ids are included only once in the string representation.\n   * @throws Error if two consecutive Ids `x` and `y` exist such that the numerical value of `x` is greater than that of `y` - i.e., the array is not properly sorted.\n   * @note The array must be sorted according to the 64-bit numerical value of each Id.\n   * @note Invalid Ids are ignored.\n   * @see [[CompressedId64Set.decompressArray]] to perform the inverse operation.\n   * @see [[OrderedId64Iterable.sortArray]] to ensure the Ids are properly sorted.\n   * @see [[CompressedId64Set.sortAndCompress]] to compress any unordered collection of Ids.\n   */\n  export function compressArray(ids: Id64Array): CompressedId64Set {\n    return compressIds(ids);\n  }\n\n  /** Give a **numerically-ordered** collection of [[Id64String]]s, produce a compact string representation. Useful when serializing potentially large sets of Ids.\n   * Duplicate Ids are included only once in the string representation.\n   * @throws Error if two consecutive Ids `x` and `y` exist such that the numerical value of `x` is greater than that of `y` - i.e., the collection is not properly sorted.\n   * @note The collection must be sorted according to the 64-bit numerical value of each Id.\n   * @note Invalid Ids are ignored.\n   * @see [[CompressedId64Set.iterable]] to perform the inverse operation.\n   * @see [[OrderedId64Iterable.sortArray]] or [[OrderedId64Iterable.compare]] to ensure the Ids are properly sorted.\n   * @see [[CompressedId64Set.sortAndCompress]] to compress any unordered collection of Ids.\n   */\n  export function compressIds(ids: OrderedId64Iterable): CompressedId64Set {\n    if (\"string\" === typeof ids)\n      return ids;\n\n    let str = \"\";\n\n    const prevId = new Uint64();\n    const rangeIncrement = new Uint64();\n    let rangeLen = 0;\n\n    const curId = new Uint64();\n    const curIncrement = new Uint64();\n    for (const id of ids) {\n      if (!Id64.isValidId64(id))\n        continue; // ignore garbage and invalid Ids (\"0\")\n\n      curId.setFromId(id);\n      curIncrement.setFromDifference(curId, prevId);\n\n      const cmp = prevId.compare(curId);\n      if (0 === cmp)\n        continue; // ignore duplicates\n      else if (cmp > 0)\n        throw new Error(\"CompressedId64Set.compressArray requires a sorted array as input\");\n\n      prevId.copyFrom(curId);\n\n      if (0 === rangeLen) {\n        rangeIncrement.copyFrom(curIncrement);\n        rangeLen = 1;\n      } else if (curIncrement.equals(rangeIncrement)) {\n        ++rangeLen;\n      } else {\n        str += compactRange(rangeIncrement, rangeLen);\n        rangeIncrement.copyFrom(curIncrement);\n        rangeLen = 1;\n      }\n    }\n\n    if (0 < rangeLen)\n      str += compactRange(rangeIncrement, rangeLen);\n\n    return str;\n  }\n\n  /** This exists strictly for the purposes of compressed sets of 64-bit Ids, to avoid the overhead of BigInt for handling 64-bit integers. */\n  class Uint64 implements Id64.Uint32Pair {\n    private static readonly _base = 0x100000000;\n\n    private static assertUint32(num: number): void {\n      assert(num >= 0);\n      assert(num < Uint64._base);\n      assert(Math.floor(num) === num);\n    }\n\n    private assertConstraints(): void {\n      Uint64.assertUint32(this.lower);\n      Uint64.assertUint32(this.upper);\n    }\n\n    constructor(public lower = 0, public upper = 0) {\n      this.assertConstraints();\n    }\n\n    public compare(rhs: Uint64): number {\n      const diff = this.upper - rhs.upper;\n      return 0 === diff ? this.lower - rhs.lower : diff;\n    }\n\n    public equals(rhs: Uint64): boolean { return 0 === this.compare(rhs); }\n    public isLessThan(rhs: Uint64): boolean { return this.compare(rhs) < 0; }\n    public isGreaterThan(rhs: Uint64): boolean { return this.compare(rhs) > 0; }\n\n    public get isZero(): boolean { return 0 === this.lower && 0 === this.upper; }\n\n    public setFromDifference(lhs: Uint64, rhs: Uint64): void {\n      assert(!rhs.isGreaterThan(lhs));\n\n      this.lower = lhs.lower - rhs.lower;\n      this.upper = lhs.upper - rhs.upper;\n      if (this.lower < 0) {\n        this.lower += Uint64._base;\n        this.upper -= 1;\n      }\n    }\n\n    public add(rhs: Uint64): void {\n      let lower = rhs.lower;\n      let upper = rhs.upper;\n      if (lower + this.lower >= Uint64._base) {\n        lower -= Uint64._base;\n        upper += 1;\n      }\n\n      this.lower += lower;\n      this.upper += upper;\n      this.assertConstraints();\n    }\n\n    public setFromId(id: Id64String): void {\n      Id64.getUint32Pair(id, this);\n    }\n\n    public copyFrom(other: Uint64): void {\n      this.lower = other.lower;\n      this.upper = other.upper;\n    }\n\n    public toString(): string {\n      if (0 === this.upper)\n        return this.lower.toString(16).toUpperCase();\n\n      const upper = this.upper.toString(16);\n      const lower = this.lower.toString(16).padStart(8, \"0\");\n      assert(lower.length === 8);\n      return `${upper}${lower}`.toUpperCase();\n    }\n\n    public toId64String(): string {\n      return Id64.fromUint32Pair(this.lower, this.upper);\n    }\n  }\n\n  /** Supplies an iterator over the [[Id64String]]s in a [[CompressedId64Set]].\n   * The Ids are iterated in ascending order based on their unsigned 64-bit integer values.\n   */\n  export function* iterator(ids: CompressedId64Set): Iterator<Id64String> {\n    if (0 === ids.length)\n      return; // empty set.\n\n    if (\"+\" !== ids[0])\n      throw new Error(\"Invalid CompressedId64Set\");\n\n    let curIndex = 1; // skip the leading '+'\n    const curId = new Uint64();\n\n    function parseUint32(): number {\n      let value = 0;\n      let nChars = 0;\n      while (curIndex < ids.length && nChars < 8) {\n        ++nChars;\n        const ch = ids.charCodeAt(curIndex);\n        if (!isHexDigit(ch))\n          break; // not a hex digit in [0..9] or [A..F]\n\n        value <<= 4;\n        value |= (ch >= 65 ? ch - 65 + 10 : ch - 48); // ch - 'A' + 10 or ch - '0'\n        value = value >>> 0; // restore unsignedness because silly javascript.\n        ++curIndex;\n      }\n\n      return value;\n    }\n\n    function parseUint64(uint64: Uint64): void {\n      let lower = 0;\n      let upper = 0;\n\n      // Read up to the first 8 digits.\n      const startIndex = curIndex;\n      const first = parseUint32();\n\n      const nFirstDigits = curIndex - startIndex;\n      assert(nFirstDigits <= 8);\n\n      if (8 === nFirstDigits && curIndex + 1 < ids.length && isHexDigit(ids.charCodeAt(curIndex + 1))) {\n        // We've got up to 8 more digits remaining\n        const secondIndex = curIndex;\n        const second = parseUint32();\n\n        // Transfer excess digits from upper to lower.\n        const nSecondDigits = curIndex - secondIndex;\n        assert(nSecondDigits > 0 && nSecondDigits <= 8);\n\n        const nDigitsToTransfer = 8 - nSecondDigits;\n        upper = first >>> (4 * nDigitsToTransfer);\n        const transfer = first - ((upper << (4 * nDigitsToTransfer)) >>> 0);\n        lower = (second | ((transfer << (4 * nSecondDigits)) >>> 0)) >>> 0;\n      } else {\n        lower = first;\n      }\n\n      uint64.lower = lower;\n      uint64.upper = upper;\n    }\n\n    const increment = new Uint64();\n    while (curIndex < ids.length) {\n      let multiplier = 1;\n      parseUint64(increment);\n      if (increment.isZero)\n        throw new Error(\"Invalid CompressedId64Set\");\n\n      if (curIndex < ids.length) {\n        switch (ids[curIndex++]) {\n          case \"*\":\n            multiplier = parseUint32();\n            if (0 === multiplier)\n              throw new Error(\"Invalid CompressedId64Set\");\n\n            if (curIndex !== ids.length && ids[curIndex++] !== \"+\")\n              return;\n\n            break;\n          case \"+\":\n            break;\n          default:\n            throw new Error(\"Invalid CompressedId64Set\");\n        }\n      }\n\n      for (let i = 0; i < multiplier; i++) {\n        curId.add(increment);\n        yield curId.toId64String();\n      }\n    }\n  }\n\n  /** Supplies an iterable over the [[Id64String]]s in a [[CompressedId64Set]].\n   * The Ids are iterated in ascending order based on their unsigned 64-bit integer values.\n   */\n  export function iterable(ids: CompressedId64Set): OrderedId64Iterable {\n    return {\n      [Symbol.iterator]: () => iterator(ids),\n    };\n  }\n\n  /** Decompress the compact string representation of an [[Id64Set]] into an [[Id64Set]].\n   * @param compressedIds The compact string representation.\n   * @param out If supplied, the Ids will be inserted into this set rather than allocating and returning a new set.\n   * @returns The set containing the decompressed Ids.\n   * @throws Error if `compressedIds` is not a well-formed [[CompressedId64Set]].\n   * @see [[CompressedId64Set.compressSet]] to perform the inverse operation.\n   * @see [[CompressedId64Set.decompressArray]] to decompress as an [[Id64Array]] instead.\n   * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids.\n   */\n  export function decompressSet(compressedIds: CompressedId64Set, out?: Id64Set): Id64Set {\n    const set = out ?? new Set<string>();\n    for (const id of iterable(compressedIds))\n      set.add(id);\n\n    return set;\n  }\n\n  /** Decompress the compact string representation of an [[Id64Set]] into an [[Id64Array]].\n   * @param compressedIds The compact string representation.\n   * @param out If supplied, the Ids will be appended to this array rather than allocating and returning a new array.\n   * @returns The array containing the decompressed Ids.\n   * @throws Error if `compressedIds` is not a well-formed [[CompressedId64Set]].\n   * @note The Ids are decompressed and appended to the array in ascending order based on their 64-bit numerical values.\n   * @see [[CompressedId64Set.compressArray]] to perform the inverse operation.\n   * @see [[CompressedId64Set.decompressSet]] to decompress as an [[Id64Set]] instead.\n   * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids.\n   */\n  export function decompressArray(compressedIds: CompressedId64Set, out?: Id64Array): Id64Array {\n    const arr = out ?? [];\n    for (const id of iterable(compressedIds))\n      arr.push(id);\n\n    return arr;\n  }\n}\n\n/** A [[SortedArray]] of unique [[Id64String]]s sorted in ascending order by the 64-bit unsigned integer values of the Ids.\n * @see [[CompressedId64Set]] for an immutable compact string representation.\n * @public\n */\nexport class OrderedId64Array extends SortedArray<Id64String> {\n  /** Construct a new, empty array. */\n  public constructor() {\n    super((lhs, rhs) => OrderedId64Iterable.compare(lhs, rhs));\n  }\n\n  /** An iterable that iterates over the Ids in sorted order. */\n  public get ids(): OrderedId64Iterable { return this._array; }\n\n  /** The underlying array of Ids. */\n  public get array(): ReadonlyArray<Id64String> { return this._array; }\n}\n\n/** A mutable set of valid [[Id64String]]s sorted in ascending order by the 64-bit unsigned integer value of the Ids.\n * Internally the set of Ids is maintained as a [[CompressedId64Set]] string representation.\n * Insertions and removals are buffered until the string representation needs to be recomputed. The string representation is recomputed by every public method except [[add]] and [[delete]] -\n * therefore, if multiple removals and/or insertions are required, it is most efficient to perform them all before invoking other methods.\n * @public\n */\nexport class MutableCompressedId64Set implements OrderedId64Iterable {\n  private _ids: CompressedId64Set;\n  private readonly _inserted = new OrderedId64Array();\n  private readonly _deleted = new OrderedId64Array();\n\n  /** Construct a new set, optionally initialized to contain the Ids represented by `ids`. */\n  public constructor(ids?: CompressedId64Set) {\n    this._ids = ids ?? \"\";\n  }\n\n  /** Obtain the compact string representation of the contents of this set. If any insertions or removals are pending, they will be applied and the string recomputed. */\n  public get ids(): CompressedId64Set {\n    this.updateIds();\n    return this._ids;\n  }\n\n  /** Add the specified Id to the set.\n   * @throws Error if `id` is not a valid [[Id64String]].\n   */\n  public add(id: Id64String): void {\n    if (!Id64.isValidId64(id))\n      throw new Error(\"MutableCompressedId64Set.add: invalid Id\");\n\n    this._deleted.remove(id);\n    this._inserted.insert(id);\n  }\n\n  /** Remove the specified Id from the set.\n   * @throws Error if `id` is not a valid [[Id64String]].\n   */\n  public delete(id: Id64String): void {\n    if (!Id64.isValidId64(id))\n      throw new Error(\"MutableCompressedId64Set.delete: invalid Id\");\n\n    this._inserted.remove(id);\n    this._deleted.insert(id);\n  }\n\n  /** Remove all Ids from the set. */\n  public clear(): void {\n    this._ids = \"\";\n    this._inserted.clear();\n    this._deleted.clear();\n  }\n\n  /** Remove all Ids from the set, then add the specified Ids. */\n  public reset(ids?: CompressedId64Set): void {\n    this.clear();\n    this._ids = ids ?? \"\";\n  }\n\n  /** Obtain an iterator over the Ids in this set. The Ids are returned in ascending order based on their unsigned 64-bit integer values. */\n  public [Symbol.iterator]() {\n    return CompressedId64Set.iterator(this.ids);\n  }\n\n  /** Compute a compact string representation of the union of this and another set of Ids - i.e., those Ids present in either this and/or the other set. */\n  public computeUnion(ids: OrderedId64Iterable | CompressedId64Set | MutableCompressedId64Set): CompressedId64Set {\n    if (this.isEmpty)\n      return CompressedId64Set.compressIds(ids);\n    else if (OrderedId64Iterable.isEmptySet(ids) || this.equals(ids))\n      return this.ids;\n\n    return CompressedId64Set.compressIds(OrderedId64Iterable.union(this, ids));\n  }\n\n  /** Compute a compact string representation of the intersection of this and another set of Ids - i.e., those Ids present in both this and the other set. */\n  public computeIntersection(ids: OrderedId64Iterable | CompressedId64Set | MutableCompressedId64Set): CompressedId64Set {\n    if (this.equals(ids))\n      return this.ids;\n    else if (this.isEmpty || OrderedId64Iterable.isEmptySet(ids))\n      return \"\";\n\n    return CompressedId64Set.compressIds(OrderedId64Iterable.intersection(this, ids));\n  }\n\n  /** Compute a compact string representation of the difference between this and another set - i.e., those Ids present in this but not in the other set. */\n  public computeDifference(ids: OrderedId64Iterable | CompressedId64Set | MutableCompressedId64Set): CompressedId64Set {\n    if (this.isEmpty || this.equals(ids))\n      return \"\";\n\n    return CompressedId64Set.compressIds(OrderedId64Iterable.difference(this, ids));\n  }\n\n  /** Return true if this set contains no Ids. */\n  public get isEmpty(): boolean {\n    return OrderedId64Iterable.isEmptySet(this.ids);\n  }\n\n  /** Return true if the set of Ids represented by `other` is identical to those in this set.\n   * @note This considers only the **distinct** Ids in `other` - duplicates are ignored.\n   */\n  public equals(other: CompressedId64Set | MutableCompressedId64Set | OrderedId64Iterable): boolean {\n    if (other instanceof MutableCompressedId64Set) {\n      if (other === this)\n        return true;\n\n      if (typeof other !== \"string\")\n        other = other.ids;\n    }\n\n    if (typeof other === \"string\")\n      return other === this.ids;\n\n    this.updateIds();\n    return OrderedId64Iterable.areEqualSets(this, other);\n  }\n\n  private get _isDirty(): boolean {\n    return !this._inserted.isEmpty || !this._deleted.isEmpty;\n  }\n\n  private updateIds(): void {\n    if (!this._isDirty)\n      return;\n\n    const difference = OrderedId64Iterable.difference(CompressedId64Set.iterable(this._ids), this._deleted.ids);\n    const union = { [Symbol.iterator]: () => OrderedId64Iterable.unionIterator(difference, this._inserted.ids) };\n    this._ids = CompressedId64Set.compressIds(union);\n\n    this._inserted.clear();\n    this._deleted.clear();\n  }\n}\n"]}

package/lib/cjs/Dictionary.js

@@ -10,8 +10,10 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.Dictionary = void 0;
 const SortedArray_1 = require("./SortedArray");
 class DictionaryIterator {
+    _keys;
+    _values;
+    _curIndex = -1;
     constructor(keys, values) {
-        this._curIndex = -1;
         this._keys = keys;
         this._values = values;
     }
@@ -46,6 +48,11 @@ class DictionaryIterator {
  * @public
  */
 class Dictionary {
+    _keys = [];
+    _compareKeys;
+    _cloneKey;
+    _values = [];
+    _cloneValue;
     /**
      * Construct a new Dictionary<K, V>.
      * @param compareKeys The function used to compare keys within the dictionary.
@@ -53,8 +60,6 @@ class Dictionary {
      * @param cloneValue The function invoked to clone a value for insertion into the dictionary. The default implementation simply returns its input.
      */
     constructor(compareKeys, cloneKey = SortedArray_1.shallowClone, cloneValue = SortedArray_1.shallowClone) {
-        this._keys = [];
-        this._values = [];
         this._compareKeys = compareKeys;
         this._cloneKey = cloneKey;
         this._cloneValue = cloneValue;