@itwin/core-bentley 4.0.0-dev.4 → 4.0.0-dev.40

package/lib/cjs/CompressedId64Set.js

@@ -281,7 +281,7 @@ var CompressedId64Set;
      * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids.
      */
     function decompressSet(compressedIds, out) {
-        const set = out !== null && out !== void 0 ? out : new Set();
+        const set = out ?? new Set();
         for (const id of iterable(compressedIds))
             set.add(id);
         return set;
@@ -298,7 +298,7 @@ var CompressedId64Set;
      * @see [[CompressedId64Set.iterable]] to efficiently iterate the Ids.
      */
     function decompressArray(compressedIds, out) {
-        const arr = out !== null && out !== void 0 ? out : [];
+        const arr = out ?? [];
         for (const id of iterable(compressedIds))
             arr.push(id);
         return arr;
@@ -331,7 +331,7 @@ class MutableCompressedId64Set {
     constructor(ids) {
         this._inserted = new OrderedId64Array();
         this._deleted = new OrderedId64Array();
-        this._ids = ids !== null && ids !== void 0 ? ids : "";
+        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. */
     get ids() {
@@ -365,7 +365,7 @@ class MutableCompressedId64Set {
     /** Remove all Ids from the set, then add the specified Ids. */
     reset(ids) {
         this.clear();
-        this._ids = ids !== null && ids !== void 0 ? ids : "";
+        this._ids = ids ?? "";
     }
     /** Obtain an iterator over the Ids in this set. The Ids are returned in ascending order based on their unsigned 64-bit integer values. */
     [Symbol.iterator]() {

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;YACpB,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;gBAClB,cAAc,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBACtC,QAAQ,GAAG,CAAC,CAAC;aACd;iBAAM,IAAI,YAAY,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE;gBAC9C,EAAE,QAAQ,CAAC;aACZ;iBAAM;gBACL,GAAG,IAAI,YAAY,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;gBAC9C,cAAc,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBACtC,QAAQ,GAAG,CAAC,CAAC;aACd;SACF;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;QAcV,YAAmB,QAAQ,CAAC,EAAS,QAAQ,CAAC;YAA3B,UAAK,GAAL,KAAK,CAAI;YAAS,UAAK,GAAL,KAAK,CAAI;YAC5C,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC3B,CAAC;QAbO,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;QAMM,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;gBAClB,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;gBAC3B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;aACjB;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;gBACtC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;gBACtB,KAAK,IAAI,CAAC,CAAC;aACZ;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;gBAC1C,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;aACZ;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;gBAC/F,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;aACpE;iBAAM;gBACL,KAAK,GAAG,KAAK,CAAC;aACf;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;YAC5B,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;gBACzB,QAAQ,GAAG,CAAC,QAAQ,EAAE,CAAC,EAAE;oBACvB,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;iBAChD;aACF;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;gBACnC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACrB,MAAM,KAAK,CAAC,YAAY,EAAE,CAAC;aAC5B;SACF;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,aAAH,GAAG,cAAH,GAAG,GAAI,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,aAAH,GAAG,cAAH,GAAG,GAAI,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,GAAjB,yBAAiB,KAAjB,yBAAiB,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,aAAH,GAAG,cAAH,GAAG,GAAI,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,aAAH,GAAG,cAAH,GAAG,GAAI,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;YAC7C,IAAI,KAAK,KAAK,IAAI;gBAChB,OAAO,IAAI,CAAC;YAEd,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAC3B,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC;SACrB;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 [[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;YACpB,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;gBAClB,cAAc,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBACtC,QAAQ,GAAG,CAAC,CAAC;aACd;iBAAM,IAAI,YAAY,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE;gBAC9C,EAAE,QAAQ,CAAC;aACZ;iBAAM;gBACL,GAAG,IAAI,YAAY,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;gBAC9C,cAAc,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;gBACtC,QAAQ,GAAG,CAAC,CAAC;aACd;SACF;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;QAcV,YAAmB,QAAQ,CAAC,EAAS,QAAQ,CAAC;YAA3B,UAAK,GAAL,KAAK,CAAI;YAAS,UAAK,GAAL,KAAK,CAAI;YAC5C,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC3B,CAAC;QAbO,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;QAMM,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;gBAClB,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;gBAC3B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;aACjB;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;gBACtC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC;gBACtB,KAAK,IAAI,CAAC,CAAC;aACZ;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;gBAC1C,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;aACZ;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;gBAC/F,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;aACpE;iBAAM;gBACL,KAAK,GAAG,KAAK,CAAC;aACf;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;YAC5B,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;gBACzB,QAAQ,GAAG,CAAC,QAAQ,EAAE,CAAC,EAAE;oBACvB,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;iBAChD;aACF;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;gBACnC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACrB,MAAM,KAAK,CAAC,YAAY,EAAE,CAAC;aAC5B;SACF;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,GAAjB,yBAAiB,KAAjB,yBAAiB,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;YAC7C,IAAI,KAAK,KAAK,IAAI;gBAChB,OAAO,IAAI,CAAC;YAEd,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAC3B,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC;SACrB;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 [[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"]}

package/lib/cjs/Logger.js

@@ -63,17 +63,15 @@ class Logger {
     }
     /** Set the least severe level at which messages should be displayed by default. Call setLevel to override this default setting for specific categories. */
     static setLevelDefault(minLevel) {
-        var _a;
         this._minLevel = minLevel;
-        (_a = this.logLevelChangedFn) === null || _a === void 0 ? void 0 : _a.call(this);
+        this.logLevelChangedFn?.();
     }
     /** Set the minimum logging level for the specified category. The minimum level is least severe level at which messages in the
      * specified category should be displayed.
      */
     static setLevel(category, minLevel) {
-        var _a;
         Logger._categoryFilter.set(category, minLevel);
-        (_a = this.logLevelChangedFn) === null || _a === void 0 ? void 0 : _a.call(this);
+        this.logLevelChangedFn?.();
     }
     /** Interpret a string as the name of a LogLevel */
     static parseLogLevel(str) {

package/lib/cjs/Logger.js.map

@@ -1 +1 @@
-{"version":3,"file":"Logger.js","sourceRoot":"","sources":["../../src/Logger.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,iDAA6E;AAC7E,mEAAgE;AAQhE;;GAEG;AACH,IAAY,QAWX;AAXD,WAAY,QAAQ;IAClB,wCAAwC;IACxC,yCAAK,CAAA;IACL,8BAA8B;IAC9B,uCAAI,CAAA;IACJ,4BAA4B;IAC5B,6CAAO,CAAA;IACP,6BAA6B;IAC7B,yCAAK,CAAA;IACL,+EAA+E;IAC/E,uCAAI,CAAA;AACN,CAAC,EAXW,QAAQ,GAAR,gBAAQ,KAAR,gBAAQ,QAWnB;AAkBD;;;GAGG;AACH,MAAa,MAAM;IAmBjB,0FAA0F;IACnF,MAAM,CAAC,UAAU,CAAC,QAAsB,EAAE,UAAwB,EAAE,OAAqB,EAAE,QAAsB;QACtH,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC5B,MAAM,CAAC,WAAW,GAAG,UAAU,CAAC;QAChC,MAAM,CAAC,QAAQ,GAAG,OAAO,CAAC;QAC1B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC5B,MAAM,CAAC,mBAAmB,EAAE,CAAC;QAC7B,MAAM,CAAC,iBAAiB,EAAE,CAAC;IAC7B,CAAC;IAED,sDAAsD;IAC/C,MAAM,CAAC,mBAAmB;QAC/B,MAAM,UAAU,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,CAAC,QAAgB,EAAE,OAAe,EAAE,QAAyB,EAAE,EAAE,CACrG,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,MAAM,QAAQ,MAAM,OAAO,IAAI,MAAM,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,iCAAiC;QAE7H,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,UAAU,CAAC,SAAS,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;IACzG,CAAC;IAED,2EAA2E;IACpE,MAAM,CAAC,WAAW,CAAC,QAA0B;QAClD,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,cAAc,EAAE;YACxC,MAAM,GAAG,GAAG,2BAAY,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,IAAI,GAAG;gBACL,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;SAC/B;QACD,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,2BAAY,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,uDAAuD;QACnH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,0JAA0J;IACnJ,MAAM,CAAC,iBAAiB,CAAC,QAA0B;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,2JAA2J;IACpJ,MAAM,CAAC,eAAe,CAAC,QAAkB;;QAC9C,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,MAAA,IAAI,CAAC,iBAAiB,+CAAtB,IAAI,CAAsB,CAAC;IAC7B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,QAAQ,CAAC,QAAgB,EAAE,QAAkB;;QACzD,MAAM,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC/C,MAAA,IAAI,CAAC,iBAAiB,+CAAtB,IAAI,CAAsB,CAAC;IAC7B,CAAC;IAED,mDAAmD;IAC5C,MAAM,CAAC,aAAa,CAAC,GAAW;QACrC,QAAQ,GAAG,CAAC,WAAW,EAAE,EAAE;YACzB,KAAK,WAAW,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;YACxC,KAAK,OAAO,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;YACpC,KAAK,OAAO,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;YACpC,KAAK,SAAS,CAAC,CAAC,OAAO,QAAQ,CAAC,OAAO,CAAC;YACxC,KAAK,MAAM,CAAC,CAAC,OAAO,QAAQ,CAAC,IAAI,CAAC;YAClC,KAAK,OAAO,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;YACpC,KAAK,OAAO,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;SACrC;QACD,OAAO,QAAQ,CAAC,IAAI,CAAC;IACvB,CAAC;IAED,oFAAoF;IAC7E,MAAM,CAAC,eAAe,CAAC,GAAuB;QACnD,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,GAAG,CAAC,YAAY,KAAK,SAAS,EAAE;YAClC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;SAC9D;QACD,IAAI,GAAG,CAAC,cAAc,KAAK,SAAS,EAAE;YACpC,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,cAAc,EAAE;gBACnC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;aAC/D;SACF;IACH,CAAC;IAEO,MAAM,CAAC,UAAU,CAAC,CAAS;QACjC,OAAO,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,6HAA6H;IACtH,MAAM,CAAC,aAAa,CAAC,MAAW;QACrC,MAAM,UAAU,GAAG,CAAC,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACtD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YACtC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC5B,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,+CAA+C,IAAI,EAAE,CAAC,CAAC;YACrG,IAAI,IAAI,KAAK,cAAc,EAAE;gBAC3B,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,YAAY,CAAC;oBACzC,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,sEAAsE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;aAC5J;iBAAM,IAAI,IAAI,KAAK,gBAAgB,EAAE;gBACpC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACvB,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,sEAAsE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC7I,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;oBAC/B,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC;wBACtE,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,wHAAwH,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC9L,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC;wBACnC,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,wGAAwG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;iBACxL;aACF;SACF;IACH,CAAC;IAED,gEAAgE;IACzD,MAAM,CAAC,QAAQ,CAAC,QAAgB;QACrC,sDAAsD;QACtD,MAAM,uBAAuB,GAAG,MAAM,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACrE,IAAI,uBAAuB,KAAK,SAAS;YACvC,OAAO,uBAAuB,CAAC;QAEjC,8DAA8D;QAC9D,MAAM,MAAM,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,MAAM,KAAK,CAAC,CAAC;YACf,OAAO,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QAEpD,kCAAkC;QAClC,OAAO,MAAM,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,mBAAmB;QAC/B,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC;IAC/B,CAAC;IAED;OACG;IACI,MAAM,CAAC,iBAAiB;QAC7B,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;IACjC,CAAC;IAED,iGAAiG;IAC1F,MAAM,CAAC,SAAS,CAAC,QAAgB,EAAE,KAAe;QACvD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC3C,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC;IACzD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,QAAQ,CAAC,QAAgB,EAAE,OAAe,EAAE,QAA0B;QAClF,IAAI,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC;YAChE,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClD,CAAC;IAEO,MAAM,CAAC,mBAAmB,CAAC,GAAY;QAC7C,MAAM,KAAK,GAAG,MAAM,CAAC,sBAAsB,CAAC,CAAC,CAAC,KAAK,2BAAY,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1F,OAAO,2BAAY,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACnD,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,YAAY,CAAC,QAAgB,EAAE,GAAQ,EAAE,MAAmB,MAAM,CAAC,QAAQ;QACvF,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE;YAClD,OAAO,EAAE,GAAG,2BAAY,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QACxF,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,UAAU,CAAC,QAAgB,EAAE,OAAe,EAAE,QAA0B;QACpF,IAAI,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,OAAO,CAAC;YACpE,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,OAAO,CAAC,QAAgB,EAAE,OAAe,EAAE,QAA0B;QACjF,IAAI,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC;YAC9D,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,QAAQ,CAAC,QAAgB,EAAE,OAAe,EAAE,QAA0B;QAClF,IAAI,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC;YAChE,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClD,CAAC;;AAvNH,wBAwNC;AAjNgB,sBAAe,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,mFAAmF;AAClI,gBAAS,GAAyB,SAAS,CAAC,CAAC,mFAAmF;AAE/I,sEAAsE;AACxD,6BAAsB,GAAG,KAAK,CAAC;AAE7C;;;eAGe;AACD,qBAAc,GAAG,IAAI,GAAG,EAA2B,CAAC;AAyMpE;;;;;;;;GAQG;AACH,MAAa,UAAU;IAOrB,YAAmB,SAAiB,EAAE,QAA0B;QAC9D,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAE1B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,6CAAqB,CAAC,WAAW,EAAE,UAAU,CAAC,SAAS,CAAC,EAAE;YAC9E,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;YACzB,OAAO;SACR;QAED,MAAM,CAAC,OAAO,CAAC,6CAAqB,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,UAAU,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9F,IAAI,CAAC,eAAe,GAAG,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,iBAAiB;IAChE,CAAC;IAEO,UAAU;QAChB,MAAM,YAAY,GAAW,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,6CAAqB,CAAC,WAAW,EAAE,UAAU,CAAC,SAAS,CAAC;YAC5E,OAAO;QAET,MAAM,CAAC,OAAO,CAAC,6CAAqB,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,UAAU,MAAM,EAAE,GAAG,EAAE;YAC/E,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,2BAAY,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7E,OAAO;gBACL,GAAG,KAAK,EAAE,WAAW,EAAE,YAAY,GAAG,IAAI,CAAC,eAAe,EAAE,2DAA2D;aACxH,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,OAAO;QACZ,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;;AAnCH,gCAoCC;AAnCgB,oBAAS,GAAa,QAAQ,CAAC,IAAI,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 Logging\r\n */\r\n\r\nimport { BentleyError, IModelStatus, LoggingMetaData } from \"./BentleyError\";\r\nimport { BentleyLoggerCategory } from \"./BentleyLoggerCategory\";\r\nimport { IDisposable } from \"./Disposable\";\r\n\r\n/** Defines the *signature* for a log function.\r\n * @public\r\n */\r\nexport type LogFunction = (category: string, message: string, metaData: LoggingMetaData) => void;\r\n\r\n/** Use to categorize logging messages by severity.\r\n * @public\r\n */\r\nexport enum LogLevel {\r\n  /** Tracing and debugging - low level */\r\n  Trace,\r\n  /** Information - mid level */\r\n  Info,\r\n  /** Warnings - high level */\r\n  Warning,\r\n  /** Errors - highest level */\r\n  Error,\r\n  /** Higher than any real logging level. This is used to turn a category off. */\r\n  None,\r\n}\r\n\r\n/** Identifies a logging category and the LogLevel that should be used for it. The LogLevel is specified by its string name.\r\n * @public\r\n */\r\nexport interface LoggerCategoryAndLevel {\r\n  category: string;\r\n  logLevel: string;\r\n}\r\n\r\n/** Specifies logging levels, including the default logging level and a set of categories and levels for them.\r\n * @public\r\n */\r\nexport interface LoggerLevelsConfig {\r\n  defaultLevel?: string;\r\n  categoryLevels?: LoggerCategoryAndLevel[];\r\n}\r\n\r\n/** Logger allows libraries and apps to report potentially useful information about operations, and it allows apps and users to control\r\n * how or if the logged information is displayed or collected. See [Learning about Logging]($docs/learning/common/Logging.md).\r\n * @public\r\n */\r\nexport class Logger {\r\n  protected static _logError: LogFunction | undefined;\r\n  protected static _logWarning: LogFunction | undefined;\r\n  protected static _logInfo: LogFunction | undefined;\r\n  protected static _logTrace: LogFunction | undefined;\r\n  /** @internal */\r\n  public static logLevelChangedFn?: VoidFunction;\r\n  private static _categoryFilter = new Map<string, LogLevel>(); // do not change the name of this member, it is referenced directly from node addon\r\n  private static _minLevel: LogLevel | undefined = undefined; // do not change the name of this member, it is referenced directly from node addon\r\n\r\n  /** Should the call stack be included when an exception is logged?  */\r\n  public static logExceptionCallstacks = false;\r\n\r\n  /** All static metadata is combined with per-call metadata and stringified in every log message.\r\n   * Static metadata can either be an object or a function that returns an object.\r\n   * Use a key to identify entries in the map so the can be removed individually.\r\n   * @internal */\r\n  public static staticMetaData = new Map<string, LoggingMetaData>();\r\n\r\n  /** Initialize the logger streams. Should be called at application initialization time. */\r\n  public static initialize(logError?: LogFunction, logWarning?: LogFunction, logInfo?: LogFunction, logTrace?: LogFunction): void {\r\n    Logger._logError = logError;\r\n    Logger._logWarning = logWarning;\r\n    Logger._logInfo = logInfo;\r\n    Logger._logTrace = logTrace;\r\n    Logger.turnOffLevelDefault();\r\n    Logger.turnOffCategories();\r\n  }\r\n\r\n  /** Initialize the logger to output to the console. */\r\n  public static initializeToConsole(): void {\r\n    const logConsole = (level: string) => (category: string, message: string, metaData: LoggingMetaData) =>\r\n      console.log(`${level} | ${category} | ${message} ${Logger.stringifyMetaData(metaData)}`); // eslint-disable-line no-console\r\n\r\n    Logger.initialize(logConsole(\"Error\"), logConsole(\"Warning\"), logConsole(\"Info\"), logConsole(\"Trace\"));\r\n  }\r\n\r\n  /** merge the supplied metadata with all static metadata into one object */\r\n  public static getMetaData(metaData?: LoggingMetaData): object {\r\n    const metaObj = {};\r\n    for (const meta of Logger.staticMetaData) {\r\n      const val = BentleyError.getMetaData(meta[1]);\r\n      if (val)\r\n        Object.assign(metaObj, val);\r\n    }\r\n    Object.assign(metaObj, BentleyError.getMetaData(metaData)); // do this last so user supplied values take precedence\r\n    return metaObj;\r\n  }\r\n\r\n  /** stringify the metadata for a log message by merging the supplied metadata with all static metadata into one object that is then `JSON.stringify`ed. */\r\n  public static stringifyMetaData(metaData?: LoggingMetaData): string {\r\n    const metaObj = this.getMetaData(metaData);\r\n    return Object.keys(metaObj).length > 0 ? JSON.stringify(metaObj) : \"\";\r\n  }\r\n\r\n  /** Set the least severe level at which messages should be displayed by default. Call setLevel to override this default setting for specific categories. */\r\n  public static setLevelDefault(minLevel: LogLevel): void {\r\n    this._minLevel = minLevel;\r\n    this.logLevelChangedFn?.();\r\n  }\r\n\r\n  /** Set the minimum logging level for the specified category. The minimum level is least severe level at which messages in the\r\n   * specified category should be displayed.\r\n   */\r\n  public static setLevel(category: string, minLevel: LogLevel) {\r\n    Logger._categoryFilter.set(category, minLevel);\r\n    this.logLevelChangedFn?.();\r\n  }\r\n\r\n  /** Interpret a string as the name of a LogLevel */\r\n  public static parseLogLevel(str: string): LogLevel {\r\n    switch (str.toUpperCase()) {\r\n      case \"EXCEPTION\": return LogLevel.Error;\r\n      case \"FATAL\": return LogLevel.Error;\r\n      case \"ERROR\": return LogLevel.Error;\r\n      case \"WARNING\": return LogLevel.Warning;\r\n      case \"INFO\": return LogLevel.Info;\r\n      case \"TRACE\": return LogLevel.Trace;\r\n      case \"DEBUG\": return LogLevel.Trace;\r\n    }\r\n    return LogLevel.None;\r\n  }\r\n\r\n  /** Set the log level for multiple categories at once. Also see [[validateProps]] */\r\n  public static configureLevels(cfg: LoggerLevelsConfig) {\r\n    Logger.validateProps(cfg);\r\n    if (cfg.defaultLevel !== undefined) {\r\n      this.setLevelDefault(Logger.parseLogLevel(cfg.defaultLevel));\r\n    }\r\n    if (cfg.categoryLevels !== undefined) {\r\n      for (const cl of cfg.categoryLevels) {\r\n        this.setLevel(cl.category, Logger.parseLogLevel(cl.logLevel));\r\n      }\r\n    }\r\n  }\r\n\r\n  private static isLogLevel(v: string) {\r\n    return LogLevel.hasOwnProperty(v);\r\n  }\r\n\r\n  /** Check that the specified object is a valid LoggerLevelsConfig. This is useful when reading a config from a .json file. */\r\n  public static validateProps(config: any) {\r\n    const validProps = [\"defaultLevel\", \"categoryLevels\"];\r\n    for (const prop of Object.keys(config)) {\r\n      if (!validProps.includes(prop))\r\n        throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig - unrecognized property: ${prop}`);\r\n      if (prop === \"defaultLevel\") {\r\n        if (!Logger.isLogLevel(config.defaultLevel))\r\n          throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig.defaultLevel must be a LogLevel. Invalid value: ${JSON.stringify(config.defaultLevel)}`);\r\n      } else if (prop === \"categoryLevels\") {\r\n        const value = config[prop];\r\n        if (!Array.isArray(value))\r\n          throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig.categoryLevels must be an array. Invalid value: ${JSON.stringify(value)}`);\r\n        for (const item of config[prop]) {\r\n          if (!item.hasOwnProperty(\"category\") || !item.hasOwnProperty(\"logLevel\"))\r\n            throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig.categoryLevels - each item must be a LoggerCategoryAndLevel {category: logLevel:}. Invalid value: ${JSON.stringify(item)}`);\r\n          if (!Logger.isLogLevel(item.logLevel))\r\n            throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig.categoryLevels - each item's logLevel property must be a LogLevel. Invalid value: ${JSON.stringify(item.logLevel)}`);\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Get the minimum logging level for the specified category. */\r\n  public static getLevel(category: string): LogLevel | undefined {\r\n    // Prefer the level set for this category specifically\r\n    const minLevelForThisCategory = Logger._categoryFilter.get(category);\r\n    if (minLevelForThisCategory !== undefined)\r\n      return minLevelForThisCategory;\r\n\r\n    // Fall back on the level set for the parent of this category.\r\n    const parent = category.lastIndexOf(\".\");\r\n    if (parent !== -1)\r\n      return Logger.getLevel(category.slice(0, parent));\r\n\r\n    // Fall back on the default level.\r\n    return Logger._minLevel;\r\n  }\r\n\r\n  /** Turns off the least severe level at which messages should be displayed by default.\r\n   * This turns off logging for all messages for which no category minimum level is defined.\r\n   */\r\n  public static turnOffLevelDefault(): void {\r\n    Logger._minLevel = undefined;\r\n  }\r\n\r\n  /** Turns off all category level filters previously defined with [[Logger.setLevel]].\r\n   */\r\n  public static turnOffCategories(): void {\r\n    Logger._categoryFilter.clear();\r\n  }\r\n\r\n  /** Check if messages in the specified category should be displayed at this level of severity. */\r\n  public static isEnabled(category: string, level: LogLevel): boolean {\r\n    const minLevel = Logger.getLevel(category);\r\n    return (minLevel !== undefined) && (level >= minLevel);\r\n  }\r\n\r\n  /** Log the specified message to the **error** stream.\r\n   * @param category  The category of the message.\r\n   * @param message  The message.\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logError(category: string, message: string, metaData?: LoggingMetaData): void {\r\n    if (Logger._logError && Logger.isEnabled(category, LogLevel.Error))\r\n      Logger._logError(category, message, metaData);\r\n  }\r\n\r\n  private static getExceptionMessage(err: unknown): string {\r\n    const stack = Logger.logExceptionCallstacks ? `\\n${BentleyError.getErrorStack(err)}` : \"\";\r\n    return BentleyError.getErrorMessage(err) + stack;\r\n  }\r\n\r\n  /** Log the specified exception. The special \"ExceptionType\" property will be added as metadata,\r\n   * in addition to any other metadata that may be supplied by the caller, unless the\r\n   * metadata supplied by the caller already includes this property.\r\n   * @param category  The category of the message.\r\n   * @param err  The exception object.\r\n   * @param log The logger output function to use - defaults to Logger.logError\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logException(category: string, err: any, log: LogFunction = Logger.logError): void {\r\n    log(category, Logger.getExceptionMessage(err), () => {\r\n      return { ...BentleyError.getErrorMetadata(err), exceptionType: err.constructor.name };\r\n    });\r\n  }\r\n\r\n  /** Log the specified message to the **warning** stream.\r\n   * @param category  The category of the message.\r\n   * @param message  The message.\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logWarning(category: string, message: string, metaData?: LoggingMetaData): void {\r\n    if (Logger._logWarning && Logger.isEnabled(category, LogLevel.Warning))\r\n      Logger._logWarning(category, message, metaData);\r\n  }\r\n\r\n  /** Log the specified message to the **info** stream.\r\n   * @param category  The category of the message.\r\n   * @param message  The message.\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logInfo(category: string, message: string, metaData?: LoggingMetaData): void {\r\n    if (Logger._logInfo && Logger.isEnabled(category, LogLevel.Info))\r\n      Logger._logInfo(category, message, metaData);\r\n  }\r\n\r\n  /** Log the specified message to the **trace** stream.\r\n   * @param category  The category of the message.\r\n   * @param message  The message.\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logTrace(category: string, message: string, metaData?: LoggingMetaData): void {\r\n    if (Logger._logTrace && Logger.isEnabled(category, LogLevel.Trace))\r\n      Logger._logTrace(category, message, metaData);\r\n  }\r\n}\r\n\r\n/** Simple performance diagnostics utility.\r\n * It measures the time from construction to disposal. On disposal it logs the routine name along with\r\n * the duration in milliseconds.\r\n * It also logs the routine name at construction time so that nested calls can be disambiguated.\r\n *\r\n * The timings are logged using the log category **Performance** and log severity [[LogLevel.INFO]].\r\n * Enable those, if you want to capture timings.\r\n * @public\r\n */\r\nexport class PerfLogger implements IDisposable {\r\n  private static _severity: LogLevel = LogLevel.Info;\r\n\r\n  private _operation: string;\r\n  private _metaData?: LoggingMetaData;\r\n  private _startTimeStamp: number;\r\n\r\n  public constructor(operation: string, metaData?: LoggingMetaData) {\r\n    this._operation = operation;\r\n    this._metaData = metaData;\r\n\r\n    if (!Logger.isEnabled(BentleyLoggerCategory.Performance, PerfLogger._severity)) {\r\n      this._startTimeStamp = 0;\r\n      return;\r\n    }\r\n\r\n    Logger.logInfo(BentleyLoggerCategory.Performance, `${this._operation},START`, this._metaData);\r\n    this._startTimeStamp = new Date().getTime(); // take timestamp\r\n  }\r\n\r\n  private logMessage(): void {\r\n    const endTimeStamp: number = new Date().getTime();\r\n    if (!Logger.isEnabled(BentleyLoggerCategory.Performance, PerfLogger._severity))\r\n      return;\r\n\r\n    Logger.logInfo(BentleyLoggerCategory.Performance, `${this._operation},END`, () => {\r\n      const mdata = this._metaData ? BentleyError.getMetaData(this._metaData) : {};\r\n      return {\r\n        ...mdata, TimeElapsed: endTimeStamp - this._startTimeStamp, // eslint-disable-line @typescript-eslint/naming-convention\r\n      };\r\n    });\r\n  }\r\n\r\n  public dispose(): void {\r\n    this.logMessage();\r\n  }\r\n}\r\n\r\n"]}
+{"version":3,"file":"Logger.js","sourceRoot":"","sources":["../../src/Logger.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,iDAA6E;AAC7E,mEAAgE;AAQhE;;GAEG;AACH,IAAY,QAWX;AAXD,WAAY,QAAQ;IAClB,wCAAwC;IACxC,yCAAK,CAAA;IACL,8BAA8B;IAC9B,uCAAI,CAAA;IACJ,4BAA4B;IAC5B,6CAAO,CAAA;IACP,6BAA6B;IAC7B,yCAAK,CAAA;IACL,+EAA+E;IAC/E,uCAAI,CAAA;AACN,CAAC,EAXW,QAAQ,GAAR,gBAAQ,KAAR,gBAAQ,QAWnB;AAkBD;;;GAGG;AACH,MAAa,MAAM;IAmBjB,0FAA0F;IACnF,MAAM,CAAC,UAAU,CAAC,QAAsB,EAAE,UAAwB,EAAE,OAAqB,EAAE,QAAsB;QACtH,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC5B,MAAM,CAAC,WAAW,GAAG,UAAU,CAAC;QAChC,MAAM,CAAC,QAAQ,GAAG,OAAO,CAAC;QAC1B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC5B,MAAM,CAAC,mBAAmB,EAAE,CAAC;QAC7B,MAAM,CAAC,iBAAiB,EAAE,CAAC;IAC7B,CAAC;IAED,sDAAsD;IAC/C,MAAM,CAAC,mBAAmB;QAC/B,MAAM,UAAU,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,CAAC,QAAgB,EAAE,OAAe,EAAE,QAAyB,EAAE,EAAE,CACrG,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,MAAM,QAAQ,MAAM,OAAO,IAAI,MAAM,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,iCAAiC;QAE7H,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,UAAU,CAAC,SAAS,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;IACzG,CAAC;IAED,2EAA2E;IACpE,MAAM,CAAC,WAAW,CAAC,QAA0B;QAClD,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,cAAc,EAAE;YACxC,MAAM,GAAG,GAAG,2BAAY,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,IAAI,GAAG;gBACL,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;SAC/B;QACD,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,2BAAY,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,uDAAuD;QACnH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,0JAA0J;IACnJ,MAAM,CAAC,iBAAiB,CAAC,QAA0B;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,2JAA2J;IACpJ,MAAM,CAAC,eAAe,CAAC,QAAkB;QAC9C,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,iBAAiB,EAAE,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,QAAQ,CAAC,QAAgB,EAAE,QAAkB;QACzD,MAAM,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,iBAAiB,EAAE,EAAE,CAAC;IAC7B,CAAC;IAED,mDAAmD;IAC5C,MAAM,CAAC,aAAa,CAAC,GAAW;QACrC,QAAQ,GAAG,CAAC,WAAW,EAAE,EAAE;YACzB,KAAK,WAAW,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;YACxC,KAAK,OAAO,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;YACpC,KAAK,OAAO,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;YACpC,KAAK,SAAS,CAAC,CAAC,OAAO,QAAQ,CAAC,OAAO,CAAC;YACxC,KAAK,MAAM,CAAC,CAAC,OAAO,QAAQ,CAAC,IAAI,CAAC;YAClC,KAAK,OAAO,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;YACpC,KAAK,OAAO,CAAC,CAAC,OAAO,QAAQ,CAAC,KAAK,CAAC;SACrC;QACD,OAAO,QAAQ,CAAC,IAAI,CAAC;IACvB,CAAC;IAED,oFAAoF;IAC7E,MAAM,CAAC,eAAe,CAAC,GAAuB;QACnD,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,GAAG,CAAC,YAAY,KAAK,SAAS,EAAE;YAClC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;SAC9D;QACD,IAAI,GAAG,CAAC,cAAc,KAAK,SAAS,EAAE;YACpC,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,cAAc,EAAE;gBACnC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;aAC/D;SACF;IACH,CAAC;IAEO,MAAM,CAAC,UAAU,CAAC,CAAS;QACjC,OAAO,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,6HAA6H;IACtH,MAAM,CAAC,aAAa,CAAC,MAAW;QACrC,MAAM,UAAU,GAAG,CAAC,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACtD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YACtC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC5B,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,+CAA+C,IAAI,EAAE,CAAC,CAAC;YACrG,IAAI,IAAI,KAAK,cAAc,EAAE;gBAC3B,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,YAAY,CAAC;oBACzC,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,sEAAsE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;aAC5J;iBAAM,IAAI,IAAI,KAAK,gBAAgB,EAAE;gBACpC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACvB,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,sEAAsE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC7I,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;oBAC/B,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC;wBACtE,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,wHAAwH,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC9L,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC;wBACnC,MAAM,IAAI,2BAAY,CAAC,2BAAY,CAAC,MAAM,EAAE,wGAAwG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;iBACxL;aACF;SACF;IACH,CAAC;IAED,gEAAgE;IACzD,MAAM,CAAC,QAAQ,CAAC,QAAgB;QACrC,sDAAsD;QACtD,MAAM,uBAAuB,GAAG,MAAM,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACrE,IAAI,uBAAuB,KAAK,SAAS;YACvC,OAAO,uBAAuB,CAAC;QAEjC,8DAA8D;QAC9D,MAAM,MAAM,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,MAAM,KAAK,CAAC,CAAC;YACf,OAAO,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QAEpD,kCAAkC;QAClC,OAAO,MAAM,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,mBAAmB;QAC/B,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC;IAC/B,CAAC;IAED;OACG;IACI,MAAM,CAAC,iBAAiB;QAC7B,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;IACjC,CAAC;IAED,iGAAiG;IAC1F,MAAM,CAAC,SAAS,CAAC,QAAgB,EAAE,KAAe;QACvD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC3C,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC;IACzD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,QAAQ,CAAC,QAAgB,EAAE,OAAe,EAAE,QAA0B;QAClF,IAAI,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC;YAChE,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClD,CAAC;IAEO,MAAM,CAAC,mBAAmB,CAAC,GAAY;QAC7C,MAAM,KAAK,GAAG,MAAM,CAAC,sBAAsB,CAAC,CAAC,CAAC,KAAK,2BAAY,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1F,OAAO,2BAAY,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACnD,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,YAAY,CAAC,QAAgB,EAAE,GAAQ,EAAE,MAAmB,MAAM,CAAC,QAAQ;QACvF,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE;YAClD,OAAO,EAAE,GAAG,2BAAY,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QACxF,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,UAAU,CAAC,QAAgB,EAAE,OAAe,EAAE,QAA0B;QACpF,IAAI,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,OAAO,CAAC;YACpE,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,OAAO,CAAC,QAAgB,EAAE,OAAe,EAAE,QAA0B;QACjF,IAAI,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC;YAC9D,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,QAAQ,CAAC,QAAgB,EAAE,OAAe,EAAE,QAA0B;QAClF,IAAI,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC;YAChE,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClD,CAAC;;AAvNH,wBAwNC;AAjNgB,sBAAe,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,mFAAmF;AAClI,gBAAS,GAAyB,SAAS,CAAC,CAAC,mFAAmF;AAE/I,sEAAsE;AACxD,6BAAsB,GAAG,KAAK,CAAC;AAE7C;;;eAGe;AACD,qBAAc,GAAG,IAAI,GAAG,EAA2B,CAAC;AAyMpE;;;;;;;;GAQG;AACH,MAAa,UAAU;IAOrB,YAAmB,SAAiB,EAAE,QAA0B;QAC9D,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAE1B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,6CAAqB,CAAC,WAAW,EAAE,UAAU,CAAC,SAAS,CAAC,EAAE;YAC9E,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;YACzB,OAAO;SACR;QAED,MAAM,CAAC,OAAO,CAAC,6CAAqB,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,UAAU,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9F,IAAI,CAAC,eAAe,GAAG,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,iBAAiB;IAChE,CAAC;IAEO,UAAU;QAChB,MAAM,YAAY,GAAW,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,6CAAqB,CAAC,WAAW,EAAE,UAAU,CAAC,SAAS,CAAC;YAC5E,OAAO;QAET,MAAM,CAAC,OAAO,CAAC,6CAAqB,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,UAAU,MAAM,EAAE,GAAG,EAAE;YAC/E,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,2BAAY,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7E,OAAO;gBACL,GAAG,KAAK,EAAE,WAAW,EAAE,YAAY,GAAG,IAAI,CAAC,eAAe,EAAE,2DAA2D;aACxH,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAEM,OAAO;QACZ,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;;AAnCH,gCAoCC;AAnCgB,oBAAS,GAAa,QAAQ,CAAC,IAAI,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 Logging\r\n */\r\n\r\nimport { BentleyError, IModelStatus, LoggingMetaData } from \"./BentleyError\";\r\nimport { BentleyLoggerCategory } from \"./BentleyLoggerCategory\";\r\nimport { IDisposable } from \"./Disposable\";\r\n\r\n/** Defines the *signature* for a log function.\r\n * @public\r\n */\r\nexport type LogFunction = (category: string, message: string, metaData: LoggingMetaData) => void;\r\n\r\n/** Use to categorize logging messages by severity.\r\n * @public\r\n */\r\nexport enum LogLevel {\r\n  /** Tracing and debugging - low level */\r\n  Trace,\r\n  /** Information - mid level */\r\n  Info,\r\n  /** Warnings - high level */\r\n  Warning,\r\n  /** Errors - highest level */\r\n  Error,\r\n  /** Higher than any real logging level. This is used to turn a category off. */\r\n  None,\r\n}\r\n\r\n/** Identifies a logging category and the LogLevel that should be used for it. The LogLevel is specified by its string name.\r\n * @public\r\n */\r\nexport interface LoggerCategoryAndLevel {\r\n  category: string;\r\n  logLevel: string;\r\n}\r\n\r\n/** Specifies logging levels, including the default logging level and a set of categories and levels for them.\r\n * @public\r\n */\r\nexport interface LoggerLevelsConfig {\r\n  defaultLevel?: string;\r\n  categoryLevels?: LoggerCategoryAndLevel[];\r\n}\r\n\r\n/** Logger allows libraries and apps to report potentially useful information about operations, and it allows apps and users to control\r\n * how or if the logged information is displayed or collected. See [Learning about Logging]($docs/learning/common/Logging.md).\r\n * @public\r\n */\r\nexport class Logger {\r\n  protected static _logError: LogFunction | undefined;\r\n  protected static _logWarning: LogFunction | undefined;\r\n  protected static _logInfo: LogFunction | undefined;\r\n  protected static _logTrace: LogFunction | undefined;\r\n  /** @internal */\r\n  public static logLevelChangedFn?: VoidFunction;\r\n  private static _categoryFilter = new Map<string, LogLevel>(); // do not change the name of this member, it is referenced directly from node addon\r\n  private static _minLevel: LogLevel | undefined = undefined; // do not change the name of this member, it is referenced directly from node addon\r\n\r\n  /** Should the call stack be included when an exception is logged?  */\r\n  public static logExceptionCallstacks = false;\r\n\r\n  /** All static metadata is combined with per-call metadata and stringified in every log message.\r\n   * Static metadata can either be an object or a function that returns an object.\r\n   * Use a key to identify entries in the map so the can be removed individually.\r\n   * @internal */\r\n  public static staticMetaData = new Map<string, LoggingMetaData>();\r\n\r\n  /** Initialize the logger streams. Should be called at application initialization time. */\r\n  public static initialize(logError?: LogFunction, logWarning?: LogFunction, logInfo?: LogFunction, logTrace?: LogFunction): void {\r\n    Logger._logError = logError;\r\n    Logger._logWarning = logWarning;\r\n    Logger._logInfo = logInfo;\r\n    Logger._logTrace = logTrace;\r\n    Logger.turnOffLevelDefault();\r\n    Logger.turnOffCategories();\r\n  }\r\n\r\n  /** Initialize the logger to output to the console. */\r\n  public static initializeToConsole(): void {\r\n    const logConsole = (level: string) => (category: string, message: string, metaData: LoggingMetaData) =>\r\n      console.log(`${level} | ${category} | ${message} ${Logger.stringifyMetaData(metaData)}`); // eslint-disable-line no-console\r\n\r\n    Logger.initialize(logConsole(\"Error\"), logConsole(\"Warning\"), logConsole(\"Info\"), logConsole(\"Trace\"));\r\n  }\r\n\r\n  /** merge the supplied metadata with all static metadata into one object */\r\n  public static getMetaData(metaData?: LoggingMetaData): object {\r\n    const metaObj = {};\r\n    for (const meta of Logger.staticMetaData) {\r\n      const val = BentleyError.getMetaData(meta[1]);\r\n      if (val)\r\n        Object.assign(metaObj, val);\r\n    }\r\n    Object.assign(metaObj, BentleyError.getMetaData(metaData)); // do this last so user supplied values take precedence\r\n    return metaObj;\r\n  }\r\n\r\n  /** stringify the metadata for a log message by merging the supplied metadata with all static metadata into one object that is then `JSON.stringify`ed. */\r\n  public static stringifyMetaData(metaData?: LoggingMetaData): string {\r\n    const metaObj = this.getMetaData(metaData);\r\n    return Object.keys(metaObj).length > 0 ? JSON.stringify(metaObj) : \"\";\r\n  }\r\n\r\n  /** Set the least severe level at which messages should be displayed by default. Call setLevel to override this default setting for specific categories. */\r\n  public static setLevelDefault(minLevel: LogLevel): void {\r\n    this._minLevel = minLevel;\r\n    this.logLevelChangedFn?.();\r\n  }\r\n\r\n  /** Set the minimum logging level for the specified category. The minimum level is least severe level at which messages in the\r\n   * specified category should be displayed.\r\n   */\r\n  public static setLevel(category: string, minLevel: LogLevel) {\r\n    Logger._categoryFilter.set(category, minLevel);\r\n    this.logLevelChangedFn?.();\r\n  }\r\n\r\n  /** Interpret a string as the name of a LogLevel */\r\n  public static parseLogLevel(str: string): LogLevel {\r\n    switch (str.toUpperCase()) {\r\n      case \"EXCEPTION\": return LogLevel.Error;\r\n      case \"FATAL\": return LogLevel.Error;\r\n      case \"ERROR\": return LogLevel.Error;\r\n      case \"WARNING\": return LogLevel.Warning;\r\n      case \"INFO\": return LogLevel.Info;\r\n      case \"TRACE\": return LogLevel.Trace;\r\n      case \"DEBUG\": return LogLevel.Trace;\r\n    }\r\n    return LogLevel.None;\r\n  }\r\n\r\n  /** Set the log level for multiple categories at once. Also see [[validateProps]] */\r\n  public static configureLevels(cfg: LoggerLevelsConfig) {\r\n    Logger.validateProps(cfg);\r\n    if (cfg.defaultLevel !== undefined) {\r\n      this.setLevelDefault(Logger.parseLogLevel(cfg.defaultLevel));\r\n    }\r\n    if (cfg.categoryLevels !== undefined) {\r\n      for (const cl of cfg.categoryLevels) {\r\n        this.setLevel(cl.category, Logger.parseLogLevel(cl.logLevel));\r\n      }\r\n    }\r\n  }\r\n\r\n  private static isLogLevel(v: string) {\r\n    return LogLevel.hasOwnProperty(v);\r\n  }\r\n\r\n  /** Check that the specified object is a valid LoggerLevelsConfig. This is useful when reading a config from a .json file. */\r\n  public static validateProps(config: any) {\r\n    const validProps = [\"defaultLevel\", \"categoryLevels\"];\r\n    for (const prop of Object.keys(config)) {\r\n      if (!validProps.includes(prop))\r\n        throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig - unrecognized property: ${prop}`);\r\n      if (prop === \"defaultLevel\") {\r\n        if (!Logger.isLogLevel(config.defaultLevel))\r\n          throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig.defaultLevel must be a LogLevel. Invalid value: ${JSON.stringify(config.defaultLevel)}`);\r\n      } else if (prop === \"categoryLevels\") {\r\n        const value = config[prop];\r\n        if (!Array.isArray(value))\r\n          throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig.categoryLevels must be an array. Invalid value: ${JSON.stringify(value)}`);\r\n        for (const item of config[prop]) {\r\n          if (!item.hasOwnProperty(\"category\") || !item.hasOwnProperty(\"logLevel\"))\r\n            throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig.categoryLevels - each item must be a LoggerCategoryAndLevel {category: logLevel:}. Invalid value: ${JSON.stringify(item)}`);\r\n          if (!Logger.isLogLevel(item.logLevel))\r\n            throw new BentleyError(IModelStatus.BadArg, `LoggerLevelsConfig.categoryLevels - each item's logLevel property must be a LogLevel. Invalid value: ${JSON.stringify(item.logLevel)}`);\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Get the minimum logging level for the specified category. */\r\n  public static getLevel(category: string): LogLevel | undefined {\r\n    // Prefer the level set for this category specifically\r\n    const minLevelForThisCategory = Logger._categoryFilter.get(category);\r\n    if (minLevelForThisCategory !== undefined)\r\n      return minLevelForThisCategory;\r\n\r\n    // Fall back on the level set for the parent of this category.\r\n    const parent = category.lastIndexOf(\".\");\r\n    if (parent !== -1)\r\n      return Logger.getLevel(category.slice(0, parent));\r\n\r\n    // Fall back on the default level.\r\n    return Logger._minLevel;\r\n  }\r\n\r\n  /** Turns off the least severe level at which messages should be displayed by default.\r\n   * This turns off logging for all messages for which no category minimum level is defined.\r\n   */\r\n  public static turnOffLevelDefault(): void {\r\n    Logger._minLevel = undefined;\r\n  }\r\n\r\n  /** Turns off all category level filters previously defined with [[Logger.setLevel]].\r\n   */\r\n  public static turnOffCategories(): void {\r\n    Logger._categoryFilter.clear();\r\n  }\r\n\r\n  /** Check if messages in the specified category should be displayed at this level of severity. */\r\n  public static isEnabled(category: string, level: LogLevel): boolean {\r\n    const minLevel = Logger.getLevel(category);\r\n    return (minLevel !== undefined) && (level >= minLevel);\r\n  }\r\n\r\n  /** Log the specified message to the **error** stream.\r\n   * @param category  The category of the message.\r\n   * @param message  The message.\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logError(category: string, message: string, metaData?: LoggingMetaData): void {\r\n    if (Logger._logError && Logger.isEnabled(category, LogLevel.Error))\r\n      Logger._logError(category, message, metaData);\r\n  }\r\n\r\n  private static getExceptionMessage(err: unknown): string {\r\n    const stack = Logger.logExceptionCallstacks ? `\\n${BentleyError.getErrorStack(err)}` : \"\";\r\n    return BentleyError.getErrorMessage(err) + stack;\r\n  }\r\n\r\n  /** Log the specified exception. The special \"ExceptionType\" property will be added as metadata,\r\n   * in addition to any other metadata that may be supplied by the caller, unless the\r\n   * metadata supplied by the caller already includes this property.\r\n   * @param category  The category of the message.\r\n   * @param err  The exception object.\r\n   * @param log The logger output function to use - defaults to Logger.logError\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logException(category: string, err: any, log: LogFunction = Logger.logError): void {\r\n    log(category, Logger.getExceptionMessage(err), () => {\r\n      return { ...BentleyError.getErrorMetadata(err), exceptionType: err.constructor.name };\r\n    });\r\n  }\r\n\r\n  /** Log the specified message to the **warning** stream.\r\n   * @param category  The category of the message.\r\n   * @param message  The message.\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logWarning(category: string, message: string, metaData?: LoggingMetaData): void {\r\n    if (Logger._logWarning && Logger.isEnabled(category, LogLevel.Warning))\r\n      Logger._logWarning(category, message, metaData);\r\n  }\r\n\r\n  /** Log the specified message to the **info** stream.\r\n   * @param category  The category of the message.\r\n   * @param message  The message.\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logInfo(category: string, message: string, metaData?: LoggingMetaData): void {\r\n    if (Logger._logInfo && Logger.isEnabled(category, LogLevel.Info))\r\n      Logger._logInfo(category, message, metaData);\r\n  }\r\n\r\n  /** Log the specified message to the **trace** stream.\r\n   * @param category  The category of the message.\r\n   * @param message  The message.\r\n   * @param metaData  Optional data for the message\r\n   */\r\n  public static logTrace(category: string, message: string, metaData?: LoggingMetaData): void {\r\n    if (Logger._logTrace && Logger.isEnabled(category, LogLevel.Trace))\r\n      Logger._logTrace(category, message, metaData);\r\n  }\r\n}\r\n\r\n/** Simple performance diagnostics utility.\r\n * It measures the time from construction to disposal. On disposal it logs the routine name along with\r\n * the duration in milliseconds.\r\n * It also logs the routine name at construction time so that nested calls can be disambiguated.\r\n *\r\n * The timings are logged using the log category **Performance** and log severity [[LogLevel.INFO]].\r\n * Enable those, if you want to capture timings.\r\n * @public\r\n */\r\nexport class PerfLogger implements IDisposable {\r\n  private static _severity: LogLevel = LogLevel.Info;\r\n\r\n  private _operation: string;\r\n  private _metaData?: LoggingMetaData;\r\n  private _startTimeStamp: number;\r\n\r\n  public constructor(operation: string, metaData?: LoggingMetaData) {\r\n    this._operation = operation;\r\n    this._metaData = metaData;\r\n\r\n    if (!Logger.isEnabled(BentleyLoggerCategory.Performance, PerfLogger._severity)) {\r\n      this._startTimeStamp = 0;\r\n      return;\r\n    }\r\n\r\n    Logger.logInfo(BentleyLoggerCategory.Performance, `${this._operation},START`, this._metaData);\r\n    this._startTimeStamp = new Date().getTime(); // take timestamp\r\n  }\r\n\r\n  private logMessage(): void {\r\n    const endTimeStamp: number = new Date().getTime();\r\n    if (!Logger.isEnabled(BentleyLoggerCategory.Performance, PerfLogger._severity))\r\n      return;\r\n\r\n    Logger.logInfo(BentleyLoggerCategory.Performance, `${this._operation},END`, () => {\r\n      const mdata = this._metaData ? BentleyError.getMetaData(this._metaData) : {};\r\n      return {\r\n        ...mdata, TimeElapsed: endTimeStamp - this._startTimeStamp, // eslint-disable-line @typescript-eslint/naming-convention\r\n      };\r\n    });\r\n  }\r\n\r\n  public dispose(): void {\r\n    this.logMessage();\r\n  }\r\n}\r\n\r\n"]}

package/lib/cjs/OneAtATimeAction.js

@@ -31,7 +31,7 @@ class PromiseWithAbandon {
     /** Create a Promise that is chained to the underlying Promise, but is connected to the abandon method. */
     async init(msg) {
         return new Promise((resolve, reject) => {
-            this.abandon = (message) => reject(new AbandonedError(message !== null && message !== void 0 ? message : msg));
+            this.abandon = (message) => reject(new AbandonedError(message ?? msg));
             this._resolve = resolve;
         });
     }

package/lib/cjs/OneAtATimeAction.js.map

@@ -1 +1 @@
-{"version":3,"file":"OneAtATimeAction.js","sourceRoot":"","sources":["../../src/OneAtATimeAction.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,iDAA8C;AAE9C,YAAY;AACZ,MAAa,cAAe,SAAQ,KAAK;CAAI;AAA7C,wCAA6C;AAE7C;;;;;GAKG;AACH,MAAM,kBAAkB;IAKtB;;;OAGG;IACH,YAAoB,IAAoC,EAAU,KAAY;QAA1D,SAAI,GAAJ,IAAI,CAAgC;QAAU,UAAK,GAAL,KAAK,CAAO;IAAI,CAAC;IAEnF,0GAA0G;IACnG,KAAK,CAAC,IAAI,CAAC,GAAW;QAC3B,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACxC,IAAI,CAAC,OAAO,GAAG,CAAC,OAAgB,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,cAAc,CAAC,OAAO,aAAP,OAAO,cAAP,OAAO,GAAI,GAAG,CAAC,CAAC,CAAC;YAChF,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED,oFAAoF;IAC7E,KAAK,CAAC,KAAK;QAChB,IAAI;YACF,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;SAC/C;QAAC,OAAO,GAAG,EAAE;YACZ,IAAI,CAAC,OAAO,CAAC,2BAAY,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,6EAA6E;SAC/H;IACH,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAa,gBAAgB;IAM3B;;OAEG;IACH,YAAY,GAAmC,EAAE,GAAG,GAAG,WAAW;QAChE,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,OAAO,CAAC,GAAG,IAAW;QACjC,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAI,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,0CAA0C;QACpG,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,8FAA8F;QAEpI,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,EAAE,8BAA8B;YAC9D,IAAI,IAAI,CAAC,QAAQ,EAAE,8FAA8F;gBAC/G,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,iEAAiE;YAC5F,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;SACvB;aAAM;YACL,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC,uCAAuC;YAC7D,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,8DAA8D;SAC9E;QAED,IAAI;YACF,OAAO,MAAM,OAAO,CAAC;SACtB;gBAAS;YACR,2DAA2D;YAC3D,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,2CAA2C;YACzE,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,gBAAgB;YAC3C,IAAI,IAAI,CAAC,OAAO;gBACd,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,8DAA8D;SACvF;IACH,CAAC;CACF;AAxCD,4CAwCC","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 { BentleyError } from \"./BentleyError\";\r\n\r\n/** @beta */\r\nexport class AbandonedError extends Error { }\r\n\r\n/**\r\n * An object that returns a Promise when you call [[init]], but supplies a way to abandon the promise if it is no longer relevant.\r\n * When you call abandon, the promise will be rejected. You must supply a [[run]] method to the constructor that\r\n * creates the real Promise for the underlying action. Notice that to use this class there are really two\r\n * Promises involved that are chained together. That makes this class less efficient than just using a Promise directly.\r\n */\r\nclass PromiseWithAbandon<T> {\r\n  /** Method to abandon the Promise created by [[init]] while it is outstanding. The promise will be rejected. */\r\n  public abandon!: (msg?: string) => void;\r\n  private _resolve!: (val: any) => void;\r\n\r\n  /** Create a PromiseWithAbandon. After this call you must call [[init]] to create the underlying Promise.\r\n   * @param _run The method that creates the underlying Promise.\r\n   * @param _args An array of args to be passed to run when [[start]] is called.\r\n   */\r\n  constructor(private _run: (...args: any[]) => Promise<T>, private _args: any[]) { }\r\n\r\n  /** Create a Promise that is chained to the underlying Promise, but is connected to the abandon method. */\r\n  public async init(msg: string): Promise<T> {\r\n    return new Promise<T>((resolve, reject) => {\r\n      this.abandon = (message?: string) => reject(new AbandonedError(message ?? msg));\r\n      this._resolve = resolve;\r\n    });\r\n  }\r\n\r\n  /** Call the [[run]] method supplied to the ctor to start the underlying Promise. */\r\n  public async start() {\r\n    try {\r\n      this._resolve(await this._run(...this._args));\r\n    } catch (err) {\r\n      this.abandon(BentleyError.getErrorMessage(err)); // turn all errors from execution into abandoned errors, but keep the message\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Orchestrator of a one-at-a-time activity. This concept is useful only for *replaceable* operations (that is, operations where subsequent requests replace and obviate\r\n * the need for previous requests. E.g. over slow HTTP connections, without this class, the stream of requests can overwhelm the connection, and cause the HTTP\r\n * request queue to grow such that the delay to service new requests is unbounded.\r\n *\r\n * With this class, we issue the initial request immediately. When the second request arrives before the first one completes, it becomes *pending*. If subsequent\r\n * requests arrive with a pending request, the current pending request is *abandoned* (its Promise is rejected) and the new request becomes pending.\r\n * When the active request completes, the pending request (if present) is started. In this manner there will only ever be one outstanding HTTP request for this type\r\n * of operation, but the first and last request will always eventually complete.\r\n * @beta\r\n */\r\nexport class OneAtATimeAction<T> {\r\n  private _active?: PromiseWithAbandon<T>;\r\n  private _pending?: PromiseWithAbandon<T>;\r\n  private _run: (...args: any[]) => Promise<T>;\r\n  public msg: string;\r\n\r\n  /** Ctor for OneAtATimePromise.\r\n   * @param run The method that performs an action that creates the Promise.\r\n   */\r\n  constructor(run: (...args: any[]) => Promise<T>, msg = \"abandoned\") {\r\n    this._run = run;\r\n    this.msg = msg;\r\n  }\r\n\r\n  /** Add a new request to this OneAtATimePromise. The request will only run when no other outstanding requests are active.\r\n   * @note Callers of this method *must* handle AbandonedError rejections.\r\n   */\r\n  public async request(...args: any[]): Promise<T> {\r\n    const entry = new PromiseWithAbandon<T>(this._run, args); // create an \"abandon-able promise\" object\r\n    const promise = entry.init(this.msg); // create the Promise from PromiseWithAbandon. Note: this must be called before we call start.\r\n\r\n    if (this._active !== undefined) { // is there an active request?\r\n      if (this._pending) // yes. If there is also a pending request, this one replaces it and previous one is abandoned\r\n        this._pending.abandon(); // rejects previous call to this method, throwing AbandonedError.\r\n      this._pending = entry;\r\n    } else {\r\n      this._active = entry; // this is the first request, start it.\r\n      entry.start(); // eslint-disable-line @typescript-eslint/no-floating-promises\r\n    }\r\n\r\n    try {\r\n      return await promise;\r\n    } finally {\r\n      // do all of this whether promise was fulfilled or rejected\r\n      this._active = this._pending; // see if there's a pending request waiting\r\n      this._pending = undefined; // clear pending\r\n      if (this._active)\r\n        this._active.start(); // eslint-disable-line @typescript-eslint/no-floating-promises\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"OneAtATimeAction.js","sourceRoot":"","sources":["../../src/OneAtATimeAction.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,iDAA8C;AAE9C,YAAY;AACZ,MAAa,cAAe,SAAQ,KAAK;CAAI;AAA7C,wCAA6C;AAE7C;;;;;GAKG;AACH,MAAM,kBAAkB;IAKtB;;;OAGG;IACH,YAAoB,IAAoC,EAAU,KAAY;QAA1D,SAAI,GAAJ,IAAI,CAAgC;QAAU,UAAK,GAAL,KAAK,CAAO;IAAI,CAAC;IAEnF,0GAA0G;IACnG,KAAK,CAAC,IAAI,CAAC,GAAW;QAC3B,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACxC,IAAI,CAAC,OAAO,GAAG,CAAC,OAAgB,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,cAAc,CAAC,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC;YAChF,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED,oFAAoF;IAC7E,KAAK,CAAC,KAAK;QAChB,IAAI;YACF,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;SAC/C;QAAC,OAAO,GAAG,EAAE;YACZ,IAAI,CAAC,OAAO,CAAC,2BAAY,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,6EAA6E;SAC/H;IACH,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAa,gBAAgB;IAM3B;;OAEG;IACH,YAAY,GAAmC,EAAE,GAAG,GAAG,WAAW;QAChE,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,OAAO,CAAC,GAAG,IAAW;QACjC,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAI,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,0CAA0C;QACpG,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,8FAA8F;QAEpI,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,EAAE,8BAA8B;YAC9D,IAAI,IAAI,CAAC,QAAQ,EAAE,8FAA8F;gBAC/G,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,iEAAiE;YAC5F,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;SACvB;aAAM;YACL,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC,uCAAuC;YAC7D,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,8DAA8D;SAC9E;QAED,IAAI;YACF,OAAO,MAAM,OAAO,CAAC;SACtB;gBAAS;YACR,2DAA2D;YAC3D,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,2CAA2C;YACzE,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC,gBAAgB;YAC3C,IAAI,IAAI,CAAC,OAAO;gBACd,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,8DAA8D;SACvF;IACH,CAAC;CACF;AAxCD,4CAwCC","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 { BentleyError } from \"./BentleyError\";\r\n\r\n/** @beta */\r\nexport class AbandonedError extends Error { }\r\n\r\n/**\r\n * An object that returns a Promise when you call [[init]], but supplies a way to abandon the promise if it is no longer relevant.\r\n * When you call abandon, the promise will be rejected. You must supply a [[run]] method to the constructor that\r\n * creates the real Promise for the underlying action. Notice that to use this class there are really two\r\n * Promises involved that are chained together. That makes this class less efficient than just using a Promise directly.\r\n */\r\nclass PromiseWithAbandon<T> {\r\n  /** Method to abandon the Promise created by [[init]] while it is outstanding. The promise will be rejected. */\r\n  public abandon!: (msg?: string) => void;\r\n  private _resolve!: (val: any) => void;\r\n\r\n  /** Create a PromiseWithAbandon. After this call you must call [[init]] to create the underlying Promise.\r\n   * @param _run The method that creates the underlying Promise.\r\n   * @param _args An array of args to be passed to run when [[start]] is called.\r\n   */\r\n  constructor(private _run: (...args: any[]) => Promise<T>, private _args: any[]) { }\r\n\r\n  /** Create a Promise that is chained to the underlying Promise, but is connected to the abandon method. */\r\n  public async init(msg: string): Promise<T> {\r\n    return new Promise<T>((resolve, reject) => {\r\n      this.abandon = (message?: string) => reject(new AbandonedError(message ?? msg));\r\n      this._resolve = resolve;\r\n    });\r\n  }\r\n\r\n  /** Call the [[run]] method supplied to the ctor to start the underlying Promise. */\r\n  public async start() {\r\n    try {\r\n      this._resolve(await this._run(...this._args));\r\n    } catch (err) {\r\n      this.abandon(BentleyError.getErrorMessage(err)); // turn all errors from execution into abandoned errors, but keep the message\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Orchestrator of a one-at-a-time activity. This concept is useful only for *replaceable* operations (that is, operations where subsequent requests replace and obviate\r\n * the need for previous requests. E.g. over slow HTTP connections, without this class, the stream of requests can overwhelm the connection, and cause the HTTP\r\n * request queue to grow such that the delay to service new requests is unbounded.\r\n *\r\n * With this class, we issue the initial request immediately. When the second request arrives before the first one completes, it becomes *pending*. If subsequent\r\n * requests arrive with a pending request, the current pending request is *abandoned* (its Promise is rejected) and the new request becomes pending.\r\n * When the active request completes, the pending request (if present) is started. In this manner there will only ever be one outstanding HTTP request for this type\r\n * of operation, but the first and last request will always eventually complete.\r\n * @beta\r\n */\r\nexport class OneAtATimeAction<T> {\r\n  private _active?: PromiseWithAbandon<T>;\r\n  private _pending?: PromiseWithAbandon<T>;\r\n  private _run: (...args: any[]) => Promise<T>;\r\n  public msg: string;\r\n\r\n  /** Ctor for OneAtATimePromise.\r\n   * @param run The method that performs an action that creates the Promise.\r\n   */\r\n  constructor(run: (...args: any[]) => Promise<T>, msg = \"abandoned\") {\r\n    this._run = run;\r\n    this.msg = msg;\r\n  }\r\n\r\n  /** Add a new request to this OneAtATimePromise. The request will only run when no other outstanding requests are active.\r\n   * @note Callers of this method *must* handle AbandonedError rejections.\r\n   */\r\n  public async request(...args: any[]): Promise<T> {\r\n    const entry = new PromiseWithAbandon<T>(this._run, args); // create an \"abandon-able promise\" object\r\n    const promise = entry.init(this.msg); // create the Promise from PromiseWithAbandon. Note: this must be called before we call start.\r\n\r\n    if (this._active !== undefined) { // is there an active request?\r\n      if (this._pending) // yes. If there is also a pending request, this one replaces it and previous one is abandoned\r\n        this._pending.abandon(); // rejects previous call to this method, throwing AbandonedError.\r\n      this._pending = entry;\r\n    } else {\r\n      this._active = entry; // this is the first request, start it.\r\n      entry.start(); // eslint-disable-line @typescript-eslint/no-floating-promises\r\n    }\r\n\r\n    try {\r\n      return await promise;\r\n    } finally {\r\n      // do all of this whether promise was fulfilled or rejected\r\n      this._active = this._pending; // see if there's a pending request waiting\r\n      this._pending = undefined; // clear pending\r\n      if (this._active)\r\n        this._active.start(); // eslint-disable-line @typescript-eslint/no-floating-promises\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/cjs/SortedArray.d.ts

@@ -128,6 +128,8 @@ export declare class ReadonlySortedArray<T> implements Iterable<T> {
      * @param func The function to be applied.
      */
     forEach(func: (value: T) => void): void;
+    /** The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). */
+    slice(start?: number, end?: number): ReadonlySortedArray<T>;
     /**
      * Computes the position at which the specified value should be inserted to maintain sorted order.
      * @param value The value whose position is to be computed.
@@ -229,5 +231,7 @@ export declare class SortedArray<T> extends ReadonlySortedArray<T> {
      * @returns the index of the deleted value, or -1 if no such element exists.
      */
     remove(value: T): number;
+    /** The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). */
+    slice(start?: number, end?: number): SortedArray<T>;
 }
 //# sourceMappingURL=SortedArray.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"SortedArray.d.ts","sourceRoot":"","sources":["../../src/SortedArray.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAE9C;;;;GAIG;AACH,oBAAY,aAAa,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;AAE/C;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,KAEvC;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAE7H;AAmBD;;;GAGG;AACH,oBAAY,eAAe;IACzB;;OAEG;IACH,KAAK,IAAA;IACL,mJAAmJ;IACnJ,MAAM,IAAA;IACN;;OAEG;IACH,OAAO,IAAA;CACR;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,mBAAmB,CAAC,CAAC,CAAE,YAAW,QAAQ,CAAC,CAAC,CAAC;IACxD,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,CAAM;IAC3B,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAClD,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAC5C,SAAS,CAAC,QAAQ,CAAC,gBAAgB,EAAE,eAAe,CAAC;IAErD;;;;;OAKG;IACH,SAAS,aAAa,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,eAAe,GAAE,eAAe,GAAG,OAAe,EAAE,KAAK,GAAE,aAAa,CAAC,CAAC,CAAgB;IAS/I,0CAA0C;IAC1C,IAAW,MAAM,IAAI,MAAM,CAA+B;IAE1D,sDAAsD;IACtD,IAAW,OAAO,IAAI,OAAO,CAA8B;IAE3D,8GAA8G;IACvG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAEvC;;;;OAIG;IACI,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;IAKhC;;;;OAIG;IACI,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAIlC;;;;OAIG;IACI,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAKzC;;;;;;;OAOG;IACI,cAAc,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,SAAS;IAKvE;;;;;;OAMG;IACI,iBAAiB,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM;IAMnE;;;;OAIG;IACI,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAExC;;OAEG;IACI,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAK9C;;;;OAIG;IACH,SAAS,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,CAAA;KAAE;IAEjE,+CAA+C;IAC/C,SAAS,CAAC,MAAM,IAAI,IAAI;IAExB;;OAEG;IACH,SAAS,CAAC,aAAa,IAAI,CAAC,EAAE;IAM9B;;;;;;;;;;;;;;;;OAgBG;IACH,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,GAAG,GAAG,MAAM;IAuBjE;;;;OAIG;IACH,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;CASpC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,qBAAa,WAAW,CAAC,CAAC,CAAE,SAAQ,mBAAmB,CAAC,CAAC,CAAC;IACxD;;;;;OAKG;gBACgB,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,eAAe,GAAE,eAAe,GAAG,OAAe,EAAE,KAAK,GAAE,aAAa,CAAC,CAAC,CAAgB;IAI5I,+CAA+C;IACxC,KAAK,IAAI,IAAI;IAEpB;;OAEG;IACI,YAAY,IAAI,CAAC,EAAE;IAE1B;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,GAAG,GAAG,MAAM;IAE7D;;;;OAIG;IACI,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;CAChC"}
+{"version":3,"file":"SortedArray.d.ts","sourceRoot":"","sources":["../../src/SortedArray.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAE9C;;;;GAIG;AACH,oBAAY,aAAa,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;AAE/C;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,KAEvC;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAE7H;AAmBD;;;GAGG;AACH,oBAAY,eAAe;IACzB;;OAEG;IACH,KAAK,IAAA;IACL,mJAAmJ;IACnJ,MAAM,IAAA;IACN;;OAEG;IACH,OAAO,IAAA;CACR;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,mBAAmB,CAAC,CAAC,CAAE,YAAW,QAAQ,CAAC,CAAC,CAAC;IACxD,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,CAAM;IAC3B,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAClD,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IAC5C,SAAS,CAAC,QAAQ,CAAC,gBAAgB,EAAE,eAAe,CAAC;IAErD;;;;;OAKG;IACH,SAAS,aAAa,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,eAAe,GAAE,eAAe,GAAG,OAAe,EAAE,KAAK,GAAE,aAAa,CAAC,CAAC,CAAgB;IAS/I,0CAA0C;IAC1C,IAAW,MAAM,IAAI,MAAM,CAA+B;IAE1D,sDAAsD;IACtD,IAAW,OAAO,IAAI,OAAO,CAA8B;IAE3D,8GAA8G;IACvG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAEvC;;;;OAIG;IACI,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;IAKhC;;;;OAIG;IACI,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAIlC;;;;OAIG;IACI,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAKzC;;;;;;;OAOG;IACI,cAAc,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,SAAS;IAKvE;;;;;;OAMG;IACI,iBAAiB,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM;IAMnE;;;;OAIG;IACI,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAExC;;OAEG;IACI,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAK9C,qIAAqI;IAC9H,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,mBAAmB,CAAC,CAAC,CAAC;IAMlE;;;;OAIG;IACH,SAAS,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,CAAA;KAAE;IAEjE,+CAA+C;IAC/C,SAAS,CAAC,MAAM,IAAI,IAAI;IAExB;;OAEG;IACH,SAAS,CAAC,aAAa,IAAI,CAAC,EAAE;IAM9B;;;;;;;;;;;;;;;;OAgBG;IACH,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,GAAG,GAAG,MAAM;IAuBjE;;;;OAIG;IACH,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;CASpC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,qBAAa,WAAW,CAAC,CAAC,CAAE,SAAQ,mBAAmB,CAAC,CAAC,CAAC;IACxD;;;;;OAKG;gBACgB,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,eAAe,GAAE,eAAe,GAAG,OAAe,EAAE,KAAK,GAAE,aAAa,CAAC,CAAC,CAAgB;IAI5I,+CAA+C;IACxC,KAAK,IAAI,IAAI;IAEpB;;OAEG;IACI,YAAY,IAAI,CAAC,EAAE;IAE1B;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,GAAG,GAAG,MAAM;IAE7D;;;;OAIG;IACI,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;IAE/B,qIAAqI;IACrH,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC;CAKpE"}

package/lib/cjs/SortedArray.js

@@ -168,6 +168,12 @@ class ReadonlySortedArray {
         for (let i = 0; i < this.length; i++)
             func(this._array[i]);
     }
+    /** The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). */
+    slice(start, end) {
+        const slice = new ReadonlySortedArray(this._compare, this._duplicatePolicy, this._clone);
+        slice._array = this._array.slice(start, end);
+        return slice;
+    }
     /**
      * Computes the position at which the specified value should be inserted to maintain sorted order.
      * @param value The value whose position is to be computed.
@@ -299,6 +305,12 @@ class SortedArray extends ReadonlySortedArray {
      * @returns the index of the deleted value, or -1 if no such element exists.
      */
     remove(value) { return this._remove(value); }
+    /** The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). */
+    slice(start, end) {
+        const slice = new SortedArray(this._compare, this._duplicatePolicy, this._clone);
+        slice._array = this._array.slice(start, end);
+        return slice;
+    }
 }
 exports.SortedArray = SortedArray;
 //# sourceMappingURL=SortedArray.js.map

package/lib/cjs/SortedArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"SortedArray.js","sourceRoot":"","sources":["../../src/SortedArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAWH;;;;;;GAMG;AACH,SAAgB,YAAY,CAAI,KAAQ;IACtC,OAAO,KAAK,CAAC;AACf,CAAC;AAFD,oCAEC;AAED;;;;;;;GAOG;AACH,SAAgB,UAAU,CAAW,KAAQ,EAAE,IAAS,EAAE,OAAgC;IACxF,OAAO,sBAAsB,CAAC,IAAI,EAAE,CAAC,OAAU,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;AAC/E,CAAC;AAFD,gCAEC;AAED,SAAS,sBAAsB,CAAI,IAAS,EAAE,SAAiC;IAC7E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IACvB,OAAO,GAAG,GAAG,IAAI,EAAE;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,IAAI;YACZ,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;aAChC,IAAI,IAAI,GAAG,CAAC;YACf,IAAI,GAAG,GAAG,CAAC;;YAEX,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;KACjB;IAED,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,IAAY,eAWX;AAXD,WAAY,eAAe;IACzB;;OAEG;IACH,uDAAK,CAAA;IACL,mJAAmJ;IACnJ,yDAAM,CAAA;IACN;;OAEG;IACH,2DAAO,CAAA;AACT,CAAC,EAXW,eAAe,GAAf,uBAAe,KAAf,uBAAe,QAW1B;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,mBAAmB;IAM9B;;;;;OAKG;IACH,YAAsB,OAA6B,EAAE,kBAA6C,KAAK,EAAE,QAA0B,YAAY;QAXrI,WAAM,GAAQ,EAAE,CAAC;QAYzB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,OAAO,eAAe,KAAK,SAAS;YACtC,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC;QAErF,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;IAC1C,CAAC;IAED,0CAA0C;IAC1C,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,sDAAsD;IACtD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,8GAA8G;IACvG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAkB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAElF;;;;OAIG;IACI,OAAO,CAAC,KAAQ;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,KAAQ;QACtB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACI,SAAS,CAAC,KAAQ;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED;;;;;;;OAOG;IACI,cAAc,CAAC,SAAiC;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAChD,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED;;;;;;OAMG;IACI,iBAAiB,CAAC,SAAiC;QACxD,gCAAgC;QAChC,MAAM,KAAK,GAAG,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAO,EAAE,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACpF,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,KAAa,IAAmB,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAEzG;;OAEG;IACI,OAAO,CAAC,IAAwB;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACO,UAAU,CAAC,KAAQ,IAAuC,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAE3H,+CAA+C;IACrC,MAAM,KAAW,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEpD;;OAEG;IACO,aAAa;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACO,OAAO,CAAC,KAAQ,EAAE,QAA4B;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAErC,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,QAAQ,IAAI,CAAC,gBAAgB,EAAE;gBAC7B,KAAK,eAAe,CAAC,MAAM;oBACzB,OAAO,KAAK,CAAC,KAAK,CAAC;gBACrB,KAAK,eAAe,CAAC,OAAO;oBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBAC9C,IAAI,QAAQ;wBACV,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAElB,OAAO,KAAK,CAAC,KAAK,CAAC;aACtB;SACF;QAED,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACvD,IAAI,SAAS,KAAK,QAAQ;YACxB,QAAQ,CAAC,KAAK,CAAC,CAAC;QAElB,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACO,OAAO,CAAC,KAAQ;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACnC,OAAO,KAAK,CAAC,KAAK,CAAC;SACpB;aAAM;YACL,OAAO,CAAC,CAAC,CAAC;SACX;IACH,CAAC;CACF;AA7KD,kDA6KC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAa,WAAe,SAAQ,mBAAsB;IACxD;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,kBAA6C,KAAK,EAAE,QAA0B,YAAY;QAC1I,KAAK,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,+CAA+C;IACxC,KAAK,KAAW,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAEvC;;OAEG;IACI,YAAY,KAAU,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAE3D;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,KAAQ,EAAE,QAA4B,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEvG;;;;OAIG;IACI,MAAM,CAAC,KAAQ,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;CAChE;AA1CD,kCA0CC","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 Collections\r\n */\r\n\r\nimport { OrderedComparator } from \"./Compare\";\r\n\r\n/**\r\n * A function that, given a value of type T, returns a copy of that value. Such functions are used by various collection classes.\r\n * It is up to the function to decide how deeply or shallowly the value is cloned. For example, [[shallowClone]] simply returns the input.\r\n * @public\r\n */\r\nexport type CloneFunction<T> = (value: T) => T;\r\n\r\n/**\r\n * A [[CloneFunction]] that, given a value of type T, returns the same value.\r\n * Useful as a default argument for functions that can alternatively accept custom logic for cloning values of object type.\r\n * @param value The value to clone.\r\n * @returns the input value.\r\n * @public\r\n */\r\nexport function shallowClone<T>(value: T) {\r\n  return value;\r\n}\r\n\r\n/**\r\n * Given a sorted array, computes the position at which the specified value should be inserted into the array so that the array remains sorted.\r\n * @param value The value whose position is to be computed.\r\n * @param list An array of U already sorted according to the comparison criterion.\r\n * @param compare The function used to compare the value with elements in `list`.\r\n * @returns an object with 'index' corresponding to the computed position and 'equal' set to true if an equivalent element already exists at that index.\r\n * @public\r\n */\r\nexport function lowerBound<T, U = T>(value: T, list: U[], compare: OrderedComparator<T, U>): { index: number, equal: boolean } {\r\n  return lowerBoundOfEquivalent(list, (element: U) => compare(value, element));\r\n}\r\n\r\nfunction lowerBoundOfEquivalent<T>(list: T[], criterion: (element: T) => number): { index: number, equal: boolean } {\r\n  let low = 0;\r\n  let high = list.length;\r\n  while (low < high) {\r\n    const mid = Math.floor((low + high) / 2);\r\n    const comp = criterion(list[mid]);\r\n    if (0 === comp)\r\n      return { index: mid, equal: true };\r\n    else if (comp < 0)\r\n      high = mid;\r\n    else\r\n      low = mid + 1;\r\n  }\r\n\r\n  return { index: low, equal: false };\r\n}\r\n\r\n/** Describes how duplicate values are handled when inserting into a [[SortedArray]].\r\n * A \"duplicate\" value is one that compares equal to a value already present in the array, per the array's comparison function.\r\n * @public\r\n */\r\nexport enum DuplicatePolicy {\r\n  /** The array allows duplicate values to be inserted. All duplicate values will be adjacent in the array, but the ordering between duplicate values is unspecified.\r\n   * @note In the presence of duplicate values, functions like [[SortedArray.indexOf]] and [[SortedArray.findEqual]] will return one of the values - exactly which one is unspecified.\r\n   */\r\n  Allow,\r\n  /** Duplicate values are forbidden - when attempting to insert a value equivalent to one already present, the already-present value is retained. */\r\n  Retain,\r\n  /** Duplicate values are forbidden - when attempting to insert a value equivalent to one already present, the already-present value is replaced by the new value.\r\n   * This can be useful when the value type carries additional data that is not evaluated by the comparison function.\r\n   */\r\n  Replace,\r\n}\r\n\r\n/**\r\n * A read-only view of an array of some type T sorted according to some user-supplied criterion.\r\n * Duplicate elements may be present, though sub-types may enforce uniqueness of elements.\r\n * In the absence of duplicates, a ReadonlySortedArray<T> can behave like a Set<T> where T is an object and equality is determined\r\n * by some criterion other than object identity.\r\n *\r\n * Because the array is always sorted, querying for the presence of an element is performed using binary\r\n * search, which is more efficient than a linear search for reasonably large arrays.\r\n *\r\n * The comparison function must meet the following criteria, given 'lhs' and 'rhs' of type T:\r\n *  - If lhs is equal to rhs, returns 0\r\n *  - If lhs is less than rhs, returns a negative value\r\n *  - If lhs is greater than rhs, returns a positive value\r\n *  - If compare(lhs, rhs) returns 0, then compare(rhs, lhs) must also return 0\r\n *  - If compare(lhs, rhs) returns a negative value, then compare(rhs, lhs) must return a positive value, and vice versa.\r\n *\r\n * Note that the array is read-only only from the perspective of its public interface. Mutation methods are defined for internal use by sub-types.\r\n *\r\n * @see [[SortedArray]] for a general-purpose mutable sorted array.\r\n * @public\r\n */\r\nexport class ReadonlySortedArray<T> implements Iterable<T> {\r\n  protected _array: T[] = [];\r\n  protected readonly _compare: OrderedComparator<T>;\r\n  protected readonly _clone: CloneFunction<T>;\r\n  protected readonly _duplicatePolicy: DuplicatePolicy;\r\n\r\n  /**\r\n   * Construct a new ReadonlySortedArray<T>.\r\n   * @param compare The function used to compare elements within the array.\r\n   * @param duplicatePolicy Policy for handling attempts to insert a value when an equivalent value already exists. If the input is a boolean, then `true` indicates [[DuplicatePolicy.Allow]], and `false` indicates [[DuplicatePolicy.Retain]].\r\n   * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\r\n   */\r\n  protected constructor(compare: OrderedComparator<T>, duplicatePolicy: DuplicatePolicy | boolean = false, clone: CloneFunction<T> = shallowClone) {\r\n    this._compare = compare;\r\n    this._clone = clone;\r\n    if (typeof duplicatePolicy === \"boolean\")\r\n      duplicatePolicy = duplicatePolicy ? DuplicatePolicy.Allow : DuplicatePolicy.Retain;\r\n\r\n    this._duplicatePolicy = duplicatePolicy;\r\n  }\r\n\r\n  /** The number of elements in the array */\r\n  public get length(): number { return this._array.length; }\r\n\r\n  /** Returns true if the array contains no elements. */\r\n  public get isEmpty(): boolean { return 0 === this.length; }\r\n\r\n  /** Returns an iterator over the contents of the array in sorted order, suitable for use in `for-of` loops. */\r\n  public [Symbol.iterator](): Iterator<T> { return this._array[Symbol.iterator](); }\r\n\r\n  /**\r\n   * Looks up the index of an element comparing equal to the specified value using binary search.\r\n   * @param value The value to search for\r\n   * @returns the index of the first equivalent element found in the array, or -1 if no such element exists.\r\n   */\r\n  public indexOf(value: T): number {\r\n    const bound = this.lowerBound(value);\r\n    return bound.equal ? bound.index : -1;\r\n  }\r\n\r\n  /**\r\n   * Returns true if this array contains at least one value comparing equal to the specified value.\r\n   * @param value The value to search for\r\n   * @returns true if an equivalent element exists in the array.\r\n   */\r\n  public contains(value: T): boolean {\r\n    return -1 !== this.indexOf(value);\r\n  }\r\n\r\n  /**\r\n   * Looks up an element comparing equal to the specified value using binary search.\r\n   * @param value The value to search for\r\n   * @returns the first equivalent element found in the array, or undefined if no such element exists.\r\n   */\r\n  public findEqual(value: T): T | undefined {\r\n    const index = this.indexOf(value);\r\n    return -1 !== index ? this._array[index] : undefined;\r\n  }\r\n\r\n  /** Find an element that compares as equivalent based on some criterion. If multiple elements are equivalent, the specific one returned is unspecified.\r\n   * As an example, consider a `SortedArray<ModelState>` which uses `ModelState.id` as its ordering criterion. To find a model by its Id,\r\n   * use `sortedArray.findEquivalent((element) => compareStrings(element.id, modelId))` where `modelId` is an [[Id64String]].\r\n   * @param criterion A function accepting an element and returning 0 if it compares as equivalent, a negative number if it compares as \"less-than\", or a positive value if it compares as \"greater-than\".\r\n   * @returns The first element found that meets the criterion, or `undefined` if no elements meet the criterion.\r\n   * @see [[indexOfEquivalent]].\r\n   * @public\r\n   */\r\n  public findEquivalent(criterion: (element: T) => number): T | undefined {\r\n    const index = this.indexOfEquivalent(criterion);\r\n    return -1 !== index ? this._array[index] : undefined;\r\n  }\r\n\r\n  /** Find the index of an element that compares as equivalent based on some criterion. If multiple elements are equivalent, the specific one returned is unspecified.\r\n   * As an example, consider a `SortedArray<ModelState>` which uses `ModelState.id` as its ordering criterion. To find the index of a model by its Id,\r\n   * use `sortedArray.indexOfEquivalent((element) => compareStrings(element.id, modelId))` where `modelId` is an [[Id64String]].\r\n   * @param criterion A function accepting an element and returning 0 if it compares as equivalent, a negative number if the element compares as \"less-than\", or a positive value if the element compares as \"greater-than\".\r\n   * @returns The index of the first element found that meets the criterion, or -1 if no elements meet the criterion.\r\n   * @public\r\n   */\r\n  public indexOfEquivalent(criterion: (element: T) => number): number {\r\n    // NB: Must invert the ordering.\r\n    const bound = lowerBoundOfEquivalent(this._array, (elem: T) => 0 - criterion(elem));\r\n    return bound.equal ? bound.index : -1;\r\n  }\r\n\r\n  /**\r\n   * Looks up an element by its index in the array.\r\n   * @param index The array index\r\n   * @returns the element corresponding to that position in the array, or undefined if the supplied index exceeds the length of the array.\r\n   */\r\n  public get(index: number): T | undefined { return index < this.length ? this._array[index] : undefined; }\r\n\r\n  /** Apply a function to each element in the array, in sorted order.\r\n   * @param func The function to be applied.\r\n   */\r\n  public forEach(func: (value: T) => void): void {\r\n    for (let i = 0; i < this.length; i++)\r\n      func(this._array[i]);\r\n  }\r\n\r\n  /**\r\n   * Computes the position at which the specified value should be inserted to maintain sorted order.\r\n   * @param value The value whose position is to be computed.\r\n   * @returns an object with 'index' corresponding to the computed position and 'equal' set to true if an equivalent element already exists at that index.\r\n   */\r\n  protected lowerBound(value: T): { index: number, equal: boolean } { return lowerBound(value, this._array, this._compare); }\r\n\r\n  /** Clears the contents of the sorted array. */\r\n  protected _clear(): void { this._array.length = 0; }\r\n\r\n  /** Extracts the sorted array as a T[] and empties the contents of this ReadonlySortedArray.\r\n   * @returns the contents of this ReadonlySortedArray as a T[].\r\n   */\r\n  protected _extractArray(): T[] {\r\n    const result = this._array;\r\n    this._array = [];\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Attempts to insert a new value into the array at a position determined by the ordering.\r\n   * The behavior differs based on the array's [[DuplicatePolicy]]:\r\n   * If duplicates are **not** permitted, then:\r\n   *  - If an equivalent element already exists in the array:\r\n   *    - [[DuplicatePolicy.Retain]]: nothing will be inserted and the index of the existing element will be returned.\r\n   *    - [[DuplicatePolicy.Replace]]: the input value will overwrite the existing element at the same index and that index will be returned.\r\n   *  - Otherwise, the element is inserted and its index is returned.\r\n   * If duplicates **are** permitted, then:\r\n   *  - The element will be inserted in a correct position based on the sorting criterion;\r\n   *  - The position of the element relative to other elements comparing as equal to it is unspecified; and\r\n   *  - The actual index of the newly-inserted element is returned.\r\n   * If the element is to be inserted, then the supplied value will be passed to the clone function supplied to the constructor and the result will be inserted into the array.\r\n   * @param value The value to insert\r\n   * @param onInsert The optional callback method to call if insertion occurs with the inserted value\r\n   * @returns the index in the array of the newly-inserted value, or, if duplicates are not permitted and an equivalent value already exists, the index of the equivalent value.\r\n   */\r\n  protected _insert(value: T, onInsert?: (value: T) => any): number {\r\n    const bound = this.lowerBound(value);\r\n\r\n    if (bound.equal) {\r\n      switch (this._duplicatePolicy) {\r\n        case DuplicatePolicy.Retain:\r\n          return bound.index;\r\n        case DuplicatePolicy.Replace:\r\n          this._array[bound.index] = this._clone(value);\r\n          if (onInsert)\r\n            onInsert(value);\r\n\r\n          return bound.index;\r\n      }\r\n    }\r\n\r\n    this._array.splice(bound.index, 0, this._clone(value));\r\n    if (undefined !== onInsert)\r\n      onInsert(value);\r\n\r\n    return bound.index;\r\n  }\r\n\r\n  /**\r\n   * Removes the first occurrence of a value comparing equal to the specified value from the array.\r\n   * @param value The value of the element to delete\r\n   * @returns the index of the deleted value, or -1 if no such element exists.\r\n   */\r\n  protected _remove(value: T): number {\r\n    const bound = this.lowerBound(value);\r\n    if (bound.equal) {\r\n      this._array.splice(bound.index, 1);\r\n      return bound.index;\r\n    } else {\r\n      return -1;\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Maintains an array of some type T in sorted order. The ordering is specified by a function supplied\r\n * by the user.\r\n * By default, only unique elements are permitted; attempting to insert a new element that compares\r\n * as equal to an element already in the array will not modify the contents of the array.\r\n *\r\n * This allows a SortedArray<T> to behave like a Set<T> where T is an object and equality is determined\r\n * by some criterion other than object identity.\r\n *\r\n * Because the array is always sorted, querying for the presence of an element is performed using binary\r\n * search, which is more efficient than a linear search for reasonably large arrays.\r\n *\r\n * The user can also specify how the SortedArray takes ownership of inserted values, e.g., by cloning them.\r\n *\r\n * The comparison function must meet the following criteria, given 'lhs' and 'rhs' of type T:\r\n *  - If lhs is equal to rhs, returns 0\r\n *  - If lhs is less than rhs, returns a negative value\r\n *  - If lhs is greater than rhs, returns a positive value\r\n *  - If compare(lhs, rhs) returns 0, then compare(rhs, lhs) must also return 0\r\n *  - If compare(lhs, rhs) returns a negative value, then compare(rhs, lhs) must return a positive value, and vice versa.\r\n *\r\n * Modifying an element in a way that affects the comparison function will produce unpredictable results, the\r\n * most likely of which is that the array will cease to be sorted.\r\n * @public\r\n */\r\nexport class SortedArray<T> extends ReadonlySortedArray<T> {\r\n  /**\r\n   * Construct a new SortedArray<T>.\r\n   * @param compare The function used to compare elements within the array.\r\n   * @param duplicatePolicy Policy for handling attempts to insert a value when an equivalent value already exists. If the input is a boolean, then `true` indicates [[DuplicatePolicy.Allow]], and `false` indicates [[DuplicatePolicy.Retain]].\r\n   * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\r\n   */\r\n  public constructor(compare: OrderedComparator<T>, duplicatePolicy: DuplicatePolicy | boolean = false, clone: CloneFunction<T> = shallowClone) {\r\n    super(compare, duplicatePolicy, clone);\r\n  }\r\n\r\n  /** Clears the contents of the sorted array. */\r\n  public clear(): void { this._clear(); }\r\n\r\n  /** Extracts the sorted array as a T[] and empties the contents of this SortedArray.\r\n   * @returns the contents of this SortedArray as a T[].\r\n   */\r\n  public extractArray(): T[] { return this._extractArray(); }\r\n\r\n  /**\r\n   * Attempts to insert a new value into the array at a position determined by the ordering.\r\n   * The behavior differs based on whether or not duplicate elements are permitted.\r\n   * If duplicates are **not** permitted, then:\r\n   *  - If an equivalent element already exists in the array, nothing will be inserted and the index of the existing element will be returned.\r\n   *  - Otherwise, the element is inserted and its index is returned.\r\n   * If duplicates **are** permitted, then:\r\n   *  - The element will be inserted in a correct position based on the sorting criterion;\r\n   *  - The position of the element relative to other elements comparing as equal to it is unspecified; and\r\n   *  - The actual index of the newly-inserted element is returned.\r\n   * If the element is to be inserted, then the supplied value will be passed to the clone function supplied to the constructor and the result will be inserted into the array.\r\n   * @param value The value to insert\r\n   * @param onInsert The optional callback method to call if insertion occurs with the inserted value\r\n   * @returns the index in the array of the newly-inserted value, or, if duplicates are not permitted and an equivalent value already exists, the index of the equivalent value.\r\n   */\r\n  public insert(value: T, onInsert?: (value: T) => any): number { return this._insert(value, onInsert); }\r\n\r\n  /**\r\n   * Removes the first occurrence of a value comparing equal to the specified value from the array.\r\n   * @param value The value of the element to delete\r\n   * @returns the index of the deleted value, or -1 if no such element exists.\r\n   */\r\n  public remove(value: T): number { return this._remove(value); }\r\n}\r\n"]}
+{"version":3,"file":"SortedArray.js","sourceRoot":"","sources":["../../src/SortedArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAWH;;;;;;GAMG;AACH,SAAgB,YAAY,CAAI,KAAQ;IACtC,OAAO,KAAK,CAAC;AACf,CAAC;AAFD,oCAEC;AAED;;;;;;;GAOG;AACH,SAAgB,UAAU,CAAW,KAAQ,EAAE,IAAS,EAAE,OAAgC;IACxF,OAAO,sBAAsB,CAAC,IAAI,EAAE,CAAC,OAAU,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;AAC/E,CAAC;AAFD,gCAEC;AAED,SAAS,sBAAsB,CAAI,IAAS,EAAE,SAAiC;IAC7E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IACvB,OAAO,GAAG,GAAG,IAAI,EAAE;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,IAAI;YACZ,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;aAChC,IAAI,IAAI,GAAG,CAAC;YACf,IAAI,GAAG,GAAG,CAAC;;YAEX,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;KACjB;IAED,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,IAAY,eAWX;AAXD,WAAY,eAAe;IACzB;;OAEG;IACH,uDAAK,CAAA;IACL,mJAAmJ;IACnJ,yDAAM,CAAA;IACN;;OAEG;IACH,2DAAO,CAAA;AACT,CAAC,EAXW,eAAe,GAAf,uBAAe,KAAf,uBAAe,QAW1B;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,mBAAmB;IAM9B;;;;;OAKG;IACH,YAAsB,OAA6B,EAAE,kBAA6C,KAAK,EAAE,QAA0B,YAAY;QAXrI,WAAM,GAAQ,EAAE,CAAC;QAYzB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,OAAO,eAAe,KAAK,SAAS;YACtC,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC;QAErF,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;IAC1C,CAAC;IAED,0CAA0C;IAC1C,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,sDAAsD;IACtD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,8GAA8G;IACvG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAkB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAElF;;;;OAIG;IACI,OAAO,CAAC,KAAQ;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,KAAQ;QACtB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACI,SAAS,CAAC,KAAQ;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED;;;;;;;OAOG;IACI,cAAc,CAAC,SAAiC;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAChD,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED;;;;;;OAMG;IACI,iBAAiB,CAAC,SAAiC;QACxD,gCAAgC;QAChC,MAAM,KAAK,GAAG,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAO,EAAE,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QACpF,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,KAAa,IAAmB,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAEzG;;OAEG;IACI,OAAO,CAAC,IAAwB;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAED,qIAAqI;IAC9H,KAAK,CAAC,KAAc,EAAE,GAAY;QACvC,MAAM,KAAK,GAAG,IAAI,mBAAmB,CAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5F,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACO,UAAU,CAAC,KAAQ,IAAuC,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAE3H,+CAA+C;IACrC,MAAM,KAAW,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEpD;;OAEG;IACO,aAAa;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACO,OAAO,CAAC,KAAQ,EAAE,QAA4B;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAErC,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,QAAQ,IAAI,CAAC,gBAAgB,EAAE;gBAC7B,KAAK,eAAe,CAAC,MAAM;oBACzB,OAAO,KAAK,CAAC,KAAK,CAAC;gBACrB,KAAK,eAAe,CAAC,OAAO;oBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBAC9C,IAAI,QAAQ;wBACV,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAElB,OAAO,KAAK,CAAC,KAAK,CAAC;aACtB;SACF;QAED,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACvD,IAAI,SAAS,KAAK,QAAQ;YACxB,QAAQ,CAAC,KAAK,CAAC,CAAC;QAElB,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACO,OAAO,CAAC,KAAQ;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACnC,OAAO,KAAK,CAAC,KAAK,CAAC;SACpB;aAAM;YACL,OAAO,CAAC,CAAC,CAAC;SACX;IACH,CAAC;CACF;AApLD,kDAoLC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAa,WAAe,SAAQ,mBAAsB;IACxD;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,kBAA6C,KAAK,EAAE,QAA0B,YAAY;QAC1I,KAAK,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,+CAA+C;IACxC,KAAK,KAAW,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAEvC;;OAEG;IACI,YAAY,KAAU,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAE3D;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,KAAQ,EAAE,QAA4B,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEvG;;;;OAIG;IACI,MAAM,CAAC,KAAQ,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE/D,qIAAqI;IACrH,KAAK,CAAC,KAAc,EAAE,GAAY;QAChD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACpF,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAjDD,kCAiDC","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 Collections\r\n */\r\n\r\nimport { OrderedComparator } from \"./Compare\";\r\n\r\n/**\r\n * A function that, given a value of type T, returns a copy of that value. Such functions are used by various collection classes.\r\n * It is up to the function to decide how deeply or shallowly the value is cloned. For example, [[shallowClone]] simply returns the input.\r\n * @public\r\n */\r\nexport type CloneFunction<T> = (value: T) => T;\r\n\r\n/**\r\n * A [[CloneFunction]] that, given a value of type T, returns the same value.\r\n * Useful as a default argument for functions that can alternatively accept custom logic for cloning values of object type.\r\n * @param value The value to clone.\r\n * @returns the input value.\r\n * @public\r\n */\r\nexport function shallowClone<T>(value: T) {\r\n  return value;\r\n}\r\n\r\n/**\r\n * Given a sorted array, computes the position at which the specified value should be inserted into the array so that the array remains sorted.\r\n * @param value The value whose position is to be computed.\r\n * @param list An array of U already sorted according to the comparison criterion.\r\n * @param compare The function used to compare the value with elements in `list`.\r\n * @returns an object with 'index' corresponding to the computed position and 'equal' set to true if an equivalent element already exists at that index.\r\n * @public\r\n */\r\nexport function lowerBound<T, U = T>(value: T, list: U[], compare: OrderedComparator<T, U>): { index: number, equal: boolean } {\r\n  return lowerBoundOfEquivalent(list, (element: U) => compare(value, element));\r\n}\r\n\r\nfunction lowerBoundOfEquivalent<T>(list: T[], criterion: (element: T) => number): { index: number, equal: boolean } {\r\n  let low = 0;\r\n  let high = list.length;\r\n  while (low < high) {\r\n    const mid = Math.floor((low + high) / 2);\r\n    const comp = criterion(list[mid]);\r\n    if (0 === comp)\r\n      return { index: mid, equal: true };\r\n    else if (comp < 0)\r\n      high = mid;\r\n    else\r\n      low = mid + 1;\r\n  }\r\n\r\n  return { index: low, equal: false };\r\n}\r\n\r\n/** Describes how duplicate values are handled when inserting into a [[SortedArray]].\r\n * A \"duplicate\" value is one that compares equal to a value already present in the array, per the array's comparison function.\r\n * @public\r\n */\r\nexport enum DuplicatePolicy {\r\n  /** The array allows duplicate values to be inserted. All duplicate values will be adjacent in the array, but the ordering between duplicate values is unspecified.\r\n   * @note In the presence of duplicate values, functions like [[SortedArray.indexOf]] and [[SortedArray.findEqual]] will return one of the values - exactly which one is unspecified.\r\n   */\r\n  Allow,\r\n  /** Duplicate values are forbidden - when attempting to insert a value equivalent to one already present, the already-present value is retained. */\r\n  Retain,\r\n  /** Duplicate values are forbidden - when attempting to insert a value equivalent to one already present, the already-present value is replaced by the new value.\r\n   * This can be useful when the value type carries additional data that is not evaluated by the comparison function.\r\n   */\r\n  Replace,\r\n}\r\n\r\n/**\r\n * A read-only view of an array of some type T sorted according to some user-supplied criterion.\r\n * Duplicate elements may be present, though sub-types may enforce uniqueness of elements.\r\n * In the absence of duplicates, a ReadonlySortedArray<T> can behave like a Set<T> where T is an object and equality is determined\r\n * by some criterion other than object identity.\r\n *\r\n * Because the array is always sorted, querying for the presence of an element is performed using binary\r\n * search, which is more efficient than a linear search for reasonably large arrays.\r\n *\r\n * The comparison function must meet the following criteria, given 'lhs' and 'rhs' of type T:\r\n *  - If lhs is equal to rhs, returns 0\r\n *  - If lhs is less than rhs, returns a negative value\r\n *  - If lhs is greater than rhs, returns a positive value\r\n *  - If compare(lhs, rhs) returns 0, then compare(rhs, lhs) must also return 0\r\n *  - If compare(lhs, rhs) returns a negative value, then compare(rhs, lhs) must return a positive value, and vice versa.\r\n *\r\n * Note that the array is read-only only from the perspective of its public interface. Mutation methods are defined for internal use by sub-types.\r\n *\r\n * @see [[SortedArray]] for a general-purpose mutable sorted array.\r\n * @public\r\n */\r\nexport class ReadonlySortedArray<T> implements Iterable<T> {\r\n  protected _array: T[] = [];\r\n  protected readonly _compare: OrderedComparator<T>;\r\n  protected readonly _clone: CloneFunction<T>;\r\n  protected readonly _duplicatePolicy: DuplicatePolicy;\r\n\r\n  /**\r\n   * Construct a new ReadonlySortedArray<T>.\r\n   * @param compare The function used to compare elements within the array.\r\n   * @param duplicatePolicy Policy for handling attempts to insert a value when an equivalent value already exists. If the input is a boolean, then `true` indicates [[DuplicatePolicy.Allow]], and `false` indicates [[DuplicatePolicy.Retain]].\r\n   * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\r\n   */\r\n  protected constructor(compare: OrderedComparator<T>, duplicatePolicy: DuplicatePolicy | boolean = false, clone: CloneFunction<T> = shallowClone) {\r\n    this._compare = compare;\r\n    this._clone = clone;\r\n    if (typeof duplicatePolicy === \"boolean\")\r\n      duplicatePolicy = duplicatePolicy ? DuplicatePolicy.Allow : DuplicatePolicy.Retain;\r\n\r\n    this._duplicatePolicy = duplicatePolicy;\r\n  }\r\n\r\n  /** The number of elements in the array */\r\n  public get length(): number { return this._array.length; }\r\n\r\n  /** Returns true if the array contains no elements. */\r\n  public get isEmpty(): boolean { return 0 === this.length; }\r\n\r\n  /** Returns an iterator over the contents of the array in sorted order, suitable for use in `for-of` loops. */\r\n  public [Symbol.iterator](): Iterator<T> { return this._array[Symbol.iterator](); }\r\n\r\n  /**\r\n   * Looks up the index of an element comparing equal to the specified value using binary search.\r\n   * @param value The value to search for\r\n   * @returns the index of the first equivalent element found in the array, or -1 if no such element exists.\r\n   */\r\n  public indexOf(value: T): number {\r\n    const bound = this.lowerBound(value);\r\n    return bound.equal ? bound.index : -1;\r\n  }\r\n\r\n  /**\r\n   * Returns true if this array contains at least one value comparing equal to the specified value.\r\n   * @param value The value to search for\r\n   * @returns true if an equivalent element exists in the array.\r\n   */\r\n  public contains(value: T): boolean {\r\n    return -1 !== this.indexOf(value);\r\n  }\r\n\r\n  /**\r\n   * Looks up an element comparing equal to the specified value using binary search.\r\n   * @param value The value to search for\r\n   * @returns the first equivalent element found in the array, or undefined if no such element exists.\r\n   */\r\n  public findEqual(value: T): T | undefined {\r\n    const index = this.indexOf(value);\r\n    return -1 !== index ? this._array[index] : undefined;\r\n  }\r\n\r\n  /** Find an element that compares as equivalent based on some criterion. If multiple elements are equivalent, the specific one returned is unspecified.\r\n   * As an example, consider a `SortedArray<ModelState>` which uses `ModelState.id` as its ordering criterion. To find a model by its Id,\r\n   * use `sortedArray.findEquivalent((element) => compareStrings(element.id, modelId))` where `modelId` is an [[Id64String]].\r\n   * @param criterion A function accepting an element and returning 0 if it compares as equivalent, a negative number if it compares as \"less-than\", or a positive value if it compares as \"greater-than\".\r\n   * @returns The first element found that meets the criterion, or `undefined` if no elements meet the criterion.\r\n   * @see [[indexOfEquivalent]].\r\n   * @public\r\n   */\r\n  public findEquivalent(criterion: (element: T) => number): T | undefined {\r\n    const index = this.indexOfEquivalent(criterion);\r\n    return -1 !== index ? this._array[index] : undefined;\r\n  }\r\n\r\n  /** Find the index of an element that compares as equivalent based on some criterion. If multiple elements are equivalent, the specific one returned is unspecified.\r\n   * As an example, consider a `SortedArray<ModelState>` which uses `ModelState.id` as its ordering criterion. To find the index of a model by its Id,\r\n   * use `sortedArray.indexOfEquivalent((element) => compareStrings(element.id, modelId))` where `modelId` is an [[Id64String]].\r\n   * @param criterion A function accepting an element and returning 0 if it compares as equivalent, a negative number if the element compares as \"less-than\", or a positive value if the element compares as \"greater-than\".\r\n   * @returns The index of the first element found that meets the criterion, or -1 if no elements meet the criterion.\r\n   * @public\r\n   */\r\n  public indexOfEquivalent(criterion: (element: T) => number): number {\r\n    // NB: Must invert the ordering.\r\n    const bound = lowerBoundOfEquivalent(this._array, (elem: T) => 0 - criterion(elem));\r\n    return bound.equal ? bound.index : -1;\r\n  }\r\n\r\n  /**\r\n   * Looks up an element by its index in the array.\r\n   * @param index The array index\r\n   * @returns the element corresponding to that position in the array, or undefined if the supplied index exceeds the length of the array.\r\n   */\r\n  public get(index: number): T | undefined { return index < this.length ? this._array[index] : undefined; }\r\n\r\n  /** Apply a function to each element in the array, in sorted order.\r\n   * @param func The function to be applied.\r\n   */\r\n  public forEach(func: (value: T) => void): void {\r\n    for (let i = 0; i < this.length; i++)\r\n      func(this._array[i]);\r\n  }\r\n\r\n  /** The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). */\r\n  public slice(start?: number, end?: number): ReadonlySortedArray<T> {\r\n    const slice = new ReadonlySortedArray<T>(this._compare, this._duplicatePolicy, this._clone);\r\n    slice._array = this._array.slice(start, end);\r\n    return slice;\r\n  }\r\n\r\n  /**\r\n   * Computes the position at which the specified value should be inserted to maintain sorted order.\r\n   * @param value The value whose position is to be computed.\r\n   * @returns an object with 'index' corresponding to the computed position and 'equal' set to true if an equivalent element already exists at that index.\r\n   */\r\n  protected lowerBound(value: T): { index: number, equal: boolean } { return lowerBound(value, this._array, this._compare); }\r\n\r\n  /** Clears the contents of the sorted array. */\r\n  protected _clear(): void { this._array.length = 0; }\r\n\r\n  /** Extracts the sorted array as a T[] and empties the contents of this ReadonlySortedArray.\r\n   * @returns the contents of this ReadonlySortedArray as a T[].\r\n   */\r\n  protected _extractArray(): T[] {\r\n    const result = this._array;\r\n    this._array = [];\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Attempts to insert a new value into the array at a position determined by the ordering.\r\n   * The behavior differs based on the array's [[DuplicatePolicy]]:\r\n   * If duplicates are **not** permitted, then:\r\n   *  - If an equivalent element already exists in the array:\r\n   *    - [[DuplicatePolicy.Retain]]: nothing will be inserted and the index of the existing element will be returned.\r\n   *    - [[DuplicatePolicy.Replace]]: the input value will overwrite the existing element at the same index and that index will be returned.\r\n   *  - Otherwise, the element is inserted and its index is returned.\r\n   * If duplicates **are** permitted, then:\r\n   *  - The element will be inserted in a correct position based on the sorting criterion;\r\n   *  - The position of the element relative to other elements comparing as equal to it is unspecified; and\r\n   *  - The actual index of the newly-inserted element is returned.\r\n   * If the element is to be inserted, then the supplied value will be passed to the clone function supplied to the constructor and the result will be inserted into the array.\r\n   * @param value The value to insert\r\n   * @param onInsert The optional callback method to call if insertion occurs with the inserted value\r\n   * @returns the index in the array of the newly-inserted value, or, if duplicates are not permitted and an equivalent value already exists, the index of the equivalent value.\r\n   */\r\n  protected _insert(value: T, onInsert?: (value: T) => any): number {\r\n    const bound = this.lowerBound(value);\r\n\r\n    if (bound.equal) {\r\n      switch (this._duplicatePolicy) {\r\n        case DuplicatePolicy.Retain:\r\n          return bound.index;\r\n        case DuplicatePolicy.Replace:\r\n          this._array[bound.index] = this._clone(value);\r\n          if (onInsert)\r\n            onInsert(value);\r\n\r\n          return bound.index;\r\n      }\r\n    }\r\n\r\n    this._array.splice(bound.index, 0, this._clone(value));\r\n    if (undefined !== onInsert)\r\n      onInsert(value);\r\n\r\n    return bound.index;\r\n  }\r\n\r\n  /**\r\n   * Removes the first occurrence of a value comparing equal to the specified value from the array.\r\n   * @param value The value of the element to delete\r\n   * @returns the index of the deleted value, or -1 if no such element exists.\r\n   */\r\n  protected _remove(value: T): number {\r\n    const bound = this.lowerBound(value);\r\n    if (bound.equal) {\r\n      this._array.splice(bound.index, 1);\r\n      return bound.index;\r\n    } else {\r\n      return -1;\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Maintains an array of some type T in sorted order. The ordering is specified by a function supplied\r\n * by the user.\r\n * By default, only unique elements are permitted; attempting to insert a new element that compares\r\n * as equal to an element already in the array will not modify the contents of the array.\r\n *\r\n * This allows a SortedArray<T> to behave like a Set<T> where T is an object and equality is determined\r\n * by some criterion other than object identity.\r\n *\r\n * Because the array is always sorted, querying for the presence of an element is performed using binary\r\n * search, which is more efficient than a linear search for reasonably large arrays.\r\n *\r\n * The user can also specify how the SortedArray takes ownership of inserted values, e.g., by cloning them.\r\n *\r\n * The comparison function must meet the following criteria, given 'lhs' and 'rhs' of type T:\r\n *  - If lhs is equal to rhs, returns 0\r\n *  - If lhs is less than rhs, returns a negative value\r\n *  - If lhs is greater than rhs, returns a positive value\r\n *  - If compare(lhs, rhs) returns 0, then compare(rhs, lhs) must also return 0\r\n *  - If compare(lhs, rhs) returns a negative value, then compare(rhs, lhs) must return a positive value, and vice versa.\r\n *\r\n * Modifying an element in a way that affects the comparison function will produce unpredictable results, the\r\n * most likely of which is that the array will cease to be sorted.\r\n * @public\r\n */\r\nexport class SortedArray<T> extends ReadonlySortedArray<T> {\r\n  /**\r\n   * Construct a new SortedArray<T>.\r\n   * @param compare The function used to compare elements within the array.\r\n   * @param duplicatePolicy Policy for handling attempts to insert a value when an equivalent value already exists. If the input is a boolean, then `true` indicates [[DuplicatePolicy.Allow]], and `false` indicates [[DuplicatePolicy.Retain]].\r\n   * @param clone The function invoked to clone a new element for insertion into the array. The default implementation simply returns its input.\r\n   */\r\n  public constructor(compare: OrderedComparator<T>, duplicatePolicy: DuplicatePolicy | boolean = false, clone: CloneFunction<T> = shallowClone) {\r\n    super(compare, duplicatePolicy, clone);\r\n  }\r\n\r\n  /** Clears the contents of the sorted array. */\r\n  public clear(): void { this._clear(); }\r\n\r\n  /** Extracts the sorted array as a T[] and empties the contents of this SortedArray.\r\n   * @returns the contents of this SortedArray as a T[].\r\n   */\r\n  public extractArray(): T[] { return this._extractArray(); }\r\n\r\n  /**\r\n   * Attempts to insert a new value into the array at a position determined by the ordering.\r\n   * The behavior differs based on whether or not duplicate elements are permitted.\r\n   * If duplicates are **not** permitted, then:\r\n   *  - If an equivalent element already exists in the array, nothing will be inserted and the index of the existing element will be returned.\r\n   *  - Otherwise, the element is inserted and its index is returned.\r\n   * If duplicates **are** permitted, then:\r\n   *  - The element will be inserted in a correct position based on the sorting criterion;\r\n   *  - The position of the element relative to other elements comparing as equal to it is unspecified; and\r\n   *  - The actual index of the newly-inserted element is returned.\r\n   * If the element is to be inserted, then the supplied value will be passed to the clone function supplied to the constructor and the result will be inserted into the array.\r\n   * @param value The value to insert\r\n   * @param onInsert The optional callback method to call if insertion occurs with the inserted value\r\n   * @returns the index in the array of the newly-inserted value, or, if duplicates are not permitted and an equivalent value already exists, the index of the equivalent value.\r\n   */\r\n  public insert(value: T, onInsert?: (value: T) => any): number { return this._insert(value, onInsert); }\r\n\r\n  /**\r\n   * Removes the first occurrence of a value comparing equal to the specified value from the array.\r\n   * @param value The value of the element to delete\r\n   * @returns the index of the deleted value, or -1 if no such element exists.\r\n   */\r\n  public remove(value: T): number { return this._remove(value); }\r\n\r\n  /** The equivalent of [Array.slice](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice). */\r\n  public override slice(start?: number, end?: number): SortedArray<T> {\r\n    const slice = new SortedArray<T>(this._compare, this._duplicatePolicy, this._clone);\r\n    slice._array = this._array.slice(start, end);\r\n    return slice;\r\n  }\r\n}\r\n"]}

package/lib/cjs/Tracing.js

@@ -82,17 +82,16 @@ class Tracing {
             ? Tracing._openTelemetry.context.active()
             : Tracing._openTelemetry.trace.setSpanContext(Tracing._openTelemetry.context.active(), parentContext);
         return Tracing._openTelemetry.context.with(Tracing._openTelemetry.trace.setSpan(parent, Tracing._tracer.startSpan(name, options, Tracing._openTelemetry.context.active())), async () => {
-            var _a, _b, _c, _d;
             try {
                 return await fn();
             }
             catch (err) {
                 if (err instanceof Error) // ignore non-Error throws, such as RpcControlResponse
-                    (_b = (_a = Tracing._openTelemetry) === null || _a === void 0 ? void 0 : _a.trace.getSpan(Tracing._openTelemetry.context.active())) === null || _b === void 0 ? void 0 : _b.setAttribute("error", true);
+                    Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.setAttribute("error", true);
                 throw err;
             }
             finally {
-                (_d = (_c = Tracing._openTelemetry) === null || _c === void 0 ? void 0 : _c.trace.getSpan(Tracing._openTelemetry.context.active())) === null || _d === void 0 ? void 0 : _d.end();
+                Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.end();
             }
         });
     }
@@ -111,9 +110,8 @@ class Tracing {
     }
     static withOpenTelemetry(base, isError = false) {
         return (category, message, metaData) => {
-            var _a, _b;
             try {
-                (_b = (_a = Tracing._openTelemetry) === null || _a === void 0 ? void 0 : _a.trace.getSpan(Tracing._openTelemetry.context.active())) === null || _b === void 0 ? void 0 : _b.addEvent(message, { ...flattenObject(Logger_1.Logger.getMetaData(metaData)), error: isError });
+                Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.addEvent(message, { ...flattenObject(Logger_1.Logger.getMetaData(metaData)), error: isError });
             }
             catch (_e) { } // avoid throwing random errors (with stack trace mangled by async hooks) when openTelemetry collector doesn't work
             base(category, message, metaData);
@@ -123,8 +121,7 @@ class Tracing {
      * @param attributes  The attributes to set
      */
     static setAttributes(attributes) {
-        var _a, _b;
-        (_b = (_a = Tracing._openTelemetry) === null || _a === void 0 ? void 0 : _a.trace.getSpan(Tracing._openTelemetry.context.active())) === null || _b === void 0 ? void 0 : _b.setAttributes(attributes);
+        Tracing._openTelemetry?.trace.getSpan(Tracing._openTelemetry.context.active())?.setAttributes(attributes);
     }
 }
 exports.Tracing = Tracing;