@itwin/core-bentley 4.10.0-dev.32 → 4.10.0-dev.34

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

@@ -1 +1 @@
-{"version":3,"file":"BeSQLite.d.ts","sourceRoot":"","sources":["../../src/BeSQLite.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;GAEG;AACH,oBAAY,QAAQ;IAClB,QAAQ,IAAa;IACrB,SAAS,IAAa;CACvB;AAED;;GAEG;AACH,oBAAY,QAAQ;IAClB,yBAAyB;IACzB,MAAM,IAAI;IACV,8BAA8B;IAC9B,MAAM,KAAK;IACX,oDAAoD;IACpD,MAAM,KAAK;CACZ;AAED;;GAEG;AAGH,oBAAY,QAAQ;IAClB,cAAc;IACd,YAAY,IAAI;IAChB,oCAAoC;IACpC,eAAe,IAAI;IACnB,2BAA2B;IAC3B,kBAAkB,IAAI;IACtB,+BAA+B;IAC/B,cAAc,IAAI;IAClB,0CAA0C;IAC1C,eAAe,IAAI;IACnB,kCAAkC;IAClC,cAAc,IAAI;IAClB,wCAAwC;IACxC,gBAAgB,IAAI;IACpB,wBAAwB;IACxB,eAAe,IAAI;IACnB,2CAA2C;IAC3C,kBAAkB,IAAI;IACtB,wCAAwC;IACxC,mBAAmB,IAAI;IACvB,2CAA2C;IAC3C,eAAe,KAAK;IACpB,2CAA2C;IAC3C,iBAAiB,KAAK;IACtB,0CAA0C;IAC1C,kBAAkB,KAAK;IACvB,+FAA+F;IAC/F,cAAc,KAAK;IACnB,uCAAuC;IACvC,kBAAkB,KAAK;IACvB,mCAAmC;IACnC,kBAAkB,KAAK;IACvB,wBAAwB;IACxB,eAAe,KAAK;IACpB,kCAAkC;IAClC,gBAAgB,KAAK;IACrB,wCAAwC;IACxC,gBAAgB,KAAK;IACrB,oEAAoE;IACpE,yBAAyB,KAAK;IAC9B,yBAAyB;IACzB,kBAAkB,KAAK;IACvB,+BAA+B;IAC/B,gBAAgB,KAAK;IACrB,6CAA6C;IAC7C,eAAe,KAAK;IACpB,2BAA2B;IAC3B,cAAc,KAAK;IACnB,sCAAsC;IACtC,gBAAgB,KAAK;IACrB,yCAAyC;IACzC,eAAe,KAAK;IACpB,8CAA8C;IAC9C,gBAAgB,KAAK;IACrB,mCAAmC;IACnC,aAAa,MAAM;IACnB,oCAAoC;IACpC,cAAc,MAAM;IAEpB,oBAAoB,MAA+B;IACnD,0BAA0B,MAA+B;IACzD,qBAAqB,MAA+B;IACpD,qBAAqB,OAA+B;IACpD,yBAAyB,OAA+B;IACxD,wBAAwB,OAA+B;IACvD,qBAAqB,OAA+B;IACpD,sBAAsB,OAA+B;IACrD,sBAAsB,OAA+B;IACrD,sBAAsB,OAAgC;IACtD,uBAAuB,OAAgC;IACvD,qBAAqB,OAAgC;IACrD,sBAAsB,OAAgC;IACtD,iCAAiC,OAAgC;IACjE,oBAAoB,OAAgC;IACpD,qBAAqB,OAAgC;IACrD,yBAAyB,OAAgC;IACzD,uBAAuB,OAAgC;IACvD,uBAAuB,OAAgC;IACvD,uBAAuB,OAAgC;IACvD,sBAAsB,OAAgC;IACtD,oBAAoB,OAAgC;IACpD,4BAA4B,OAAgC;IAE5D,2EAA2E;IAC3E,0BAA0B,WAAgC;IAC1D,uEAAuE;IACvE,2BAA2B,WAAgC;IAC3D,yEAAyE;IACzE,+BAA+B,WAAgC;IAC/D,uCAAuC;IACvC,4BAA4B,WAAgC;IAC5D,sGAAsG;IACtG,2BAA2B,WAAgC;IAC3D,qCAAqC;IACrC,4BAA4B,YAAgC;IAC5D,+CAA+C;IAC/C,qCAAqC,YAAgC;IACrE,yCAAyC;IACzC,oCAAoC,YAAgC;IACpE,+EAA+E;IAC/E,yCAAyC,YAAgC;IACzE,mEAAmE;IACnE,6BAA6B,YAAiC;IAC9D,qGAAqG;IACrG,yCAAyC,YAAiC;IAC1E,mEAAmE;IACnE,6BAA6B,YAAiC;IAC9D,gDAAgD;IAChD,gCAAgC,YAAiC;IACjE,6DAA6D;IAC7D,uCAAuC,YAAiC;IACxE,4DAA4D;IAC5D,qCAAqC,YAA+B;IACpE,+FAA+F;IAC/F,4BAA4B,YAA+B;IAC3D,yFAAyF;IACzF,4BAA4B,YAA+B;IAC3D,4DAA4D;IAC5D,gCAAgC,YAA+B;IAC/D,mDAAmD;IACnD,mCAAmC,YAA+B;IAClE,qDAAqD;IACrD,kCAAkC,YAA+B;IACjE,qCAAqC;IACrC,2CAA2C,YAA+B;IAC1E,qEAAqE;IACrE,wCAAwC,YAA+B;IACvE,2CAA2C;IAC3C,qCAAqC,YAAiC;IAEtE,4BAA4B,MAAgC;IAC5D,uBAAuB,MAA8B;IACrD,4BAA4B,MAAkC;IAC9D,wBAAwB,MAAkC;IAC1D,2BAA2B,MAAkC;IAC7D,sBAAsB,MAAiC;IACvD,2BAA2B,MAAkC;IAC7D,2BAA2B,MAAkC;IAC7D,2BAA2B,MAAkC;IAC7D,wBAAwB,MAA+B;IACvD,0BAA0B,MAAyC;IACnE,+BAA+B,MAAyC;IACxE,+BAA+B,MAAyC;IACxE,6BAA6B,OAAyC;IACtE,4BAA4B,OAAyC;IACrE,+BAA+B,OAAyC;IACxE,4BAA4B,OAAyC;IACrE,2BAA2B,OAAyC;IACpE,yBAAyB,OAAyC;CACnE"}
+{"version":3,"file":"BeSQLite.d.ts","sourceRoot":"","sources":["../../src/BeSQLite.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;GAEG;AACH,oBAAY,QAAQ;IAClB,QAAQ,IAAa;IACrB,SAAS,IAAa;CACvB;AAED;;GAEG;AACH,oBAAY,QAAQ;IAClB,yBAAyB;IACzB,MAAM,IAAI;IACV,8BAA8B;IAC9B,MAAM,KAAK;IACX,oDAAoD;IACpD,MAAM,KAAK;CACZ;AAED;;GAEG;AAEH,oBAAY,QAAQ;IAClB,cAAc;IACd,YAAY,IAAI;IAChB,oCAAoC;IACpC,eAAe,IAAI;IACnB,2BAA2B;IAC3B,kBAAkB,IAAI;IACtB,+BAA+B;IAC/B,cAAc,IAAI;IAClB,0CAA0C;IAC1C,eAAe,IAAI;IACnB,kCAAkC;IAClC,cAAc,IAAI;IAClB,wCAAwC;IACxC,gBAAgB,IAAI;IACpB,wBAAwB;IACxB,eAAe,IAAI;IACnB,2CAA2C;IAC3C,kBAAkB,IAAI;IACtB,wCAAwC;IACxC,mBAAmB,IAAI;IACvB,2CAA2C;IAC3C,eAAe,KAAK;IACpB,2CAA2C;IAC3C,iBAAiB,KAAK;IACtB,0CAA0C;IAC1C,kBAAkB,KAAK;IACvB,+FAA+F;IAC/F,cAAc,KAAK;IACnB,uCAAuC;IACvC,kBAAkB,KAAK;IACvB,mCAAmC;IACnC,kBAAkB,KAAK;IACvB,wBAAwB;IACxB,eAAe,KAAK;IACpB,kCAAkC;IAClC,gBAAgB,KAAK;IACrB,wCAAwC;IACxC,gBAAgB,KAAK;IACrB,oEAAoE;IACpE,yBAAyB,KAAK;IAC9B,yBAAyB;IACzB,kBAAkB,KAAK;IACvB,+BAA+B;IAC/B,gBAAgB,KAAK;IACrB,6CAA6C;IAC7C,eAAe,KAAK;IACpB,2BAA2B;IAC3B,cAAc,KAAK;IACnB,sCAAsC;IACtC,gBAAgB,KAAK;IACrB,yCAAyC;IACzC,eAAe,KAAK;IACpB,8CAA8C;IAC9C,gBAAgB,KAAK;IACrB,mCAAmC;IACnC,aAAa,MAAM;IACnB,oCAAoC;IACpC,cAAc,MAAM;IAEpB,oBAAoB,MAA+B;IACnD,0BAA0B,MAA+B;IACzD,qBAAqB,MAA+B;IACpD,qBAAqB,OAA+B;IACpD,yBAAyB,OAA+B;IACxD,wBAAwB,OAA+B;IACvD,qBAAqB,OAA+B;IACpD,sBAAsB,OAA+B;IACrD,sBAAsB,OAA+B;IACrD,sBAAsB,OAAgC;IACtD,uBAAuB,OAAgC;IACvD,qBAAqB,OAAgC;IACrD,sBAAsB,OAAgC;IACtD,iCAAiC,OAAgC;IACjE,oBAAoB,OAAgC;IACpD,qBAAqB,OAAgC;IACrD,yBAAyB,OAAgC;IACzD,uBAAuB,OAAgC;IACvD,uBAAuB,OAAgC;IACvD,uBAAuB,OAAgC;IACvD,sBAAsB,OAAgC;IACtD,oBAAoB,OAAgC;IACpD,4BAA4B,OAAgC;IAE5D,2EAA2E;IAC3E,0BAA0B,WAAgC;IAC1D,uEAAuE;IACvE,2BAA2B,WAAgC;IAC3D,yEAAyE;IACzE,+BAA+B,WAAgC;IAC/D,uCAAuC;IACvC,4BAA4B,WAAgC;IAC5D,sGAAsG;IACtG,2BAA2B,WAAgC;IAC3D,qCAAqC;IACrC,4BAA4B,YAAgC;IAC5D,+CAA+C;IAC/C,qCAAqC,YAAgC;IACrE,yCAAyC;IACzC,oCAAoC,YAAgC;IACpE,+EAA+E;IAC/E,yCAAyC,YAAgC;IACzE,mEAAmE;IACnE,6BAA6B,YAAiC;IAC9D,qGAAqG;IACrG,yCAAyC,YAAiC;IAC1E,mEAAmE;IACnE,6BAA6B,YAAiC;IAC9D,gDAAgD;IAChD,gCAAgC,YAAiC;IACjE,6DAA6D;IAC7D,uCAAuC,YAAiC;IACxE,4DAA4D;IAC5D,qCAAqC,YAA+B;IACpE,+FAA+F;IAC/F,4BAA4B,YAA+B;IAC3D,yFAAyF;IACzF,4BAA4B,YAA+B;IAC3D,4DAA4D;IAC5D,gCAAgC,YAA+B;IAC/D,mDAAmD;IACnD,mCAAmC,YAA+B;IAClE,qDAAqD;IACrD,kCAAkC,YAA+B;IACjE,qCAAqC;IACrC,2CAA2C,YAA+B;IAC1E,qEAAqE;IACrE,wCAAwC,YAA+B;IACvE,2CAA2C;IAC3C,qCAAqC,YAAiC;IAEtE,4BAA4B,MAAgC;IAC5D,uBAAuB,MAA8B;IACrD,4BAA4B,MAAkC;IAC9D,wBAAwB,MAAkC;IAC1D,2BAA2B,MAAkC;IAC7D,sBAAsB,MAAiC;IACvD,2BAA2B,MAAkC;IAC7D,2BAA2B,MAAkC;IAC7D,2BAA2B,MAAkC;IAC7D,wBAAwB,MAA+B;IACvD,0BAA0B,MAAyC;IACnE,+BAA+B,MAAyC;IACxE,+BAA+B,MAAyC;IACxE,6BAA6B,OAAyC;IACtE,4BAA4B,OAAyC;IACrE,+BAA+B,OAAyC;IACxE,4BAA4B,OAAyC;IACrE,2BAA2B,OAAyC;IACpE,yBAAyB,OAAyC;CACnE"}

package/lib/cjs/BeSQLite.js

@@ -31,7 +31,6 @@ var DbOpcode;
 /** Values for return codes from BeSQLite functions. Consult SQLite documentation for further explanations.
  * @public
  */
-/* eslint-disable @typescript-eslint/naming-convention */
 //  Disabling for the rest of the file since eslint does not correctly parse the entire enum, only parts of it
 var DbResult;
 (function (DbResult) {
@@ -182,5 +181,4 @@ var DbResult;
     DbResult[DbResult["BE_SQLITE_CONSTRAINT_UNIQUE"] = 2067] = "BE_SQLITE_CONSTRAINT_UNIQUE";
     DbResult[DbResult["BE_SQLITE_CONSTRAINT_VTAB"] = 2323] = "BE_SQLITE_CONSTRAINT_VTAB";
 })(DbResult || (exports.DbResult = DbResult = {}));
-/* eslint-enable @typescript-eslint/naming-convention */
 //# sourceMappingURL=BeSQLite.js.map

package/lib/cjs/BeSQLite.js.map

@@ -1 +1 @@
-{"version":3,"file":"BeSQLite.js","sourceRoot":"","sources":["../../src/BeSQLite.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;GAEG;AACH,IAAY,QAGX;AAHD,WAAY,QAAQ;IAClB,+CAAqB,CAAA;IACrB,iDAAsB,CAAA;AACxB,CAAC,EAHW,QAAQ,wBAAR,QAAQ,QAGnB;AAED;;GAEG;AACH,IAAY,QAOX;AAPD,WAAY,QAAQ;IAClB,yBAAyB;IACzB,2CAAU,CAAA;IACV,8BAA8B;IAC9B,4CAAW,CAAA;IACX,oDAAoD;IACpD,4CAAW,CAAA;AACb,CAAC,EAPW,QAAQ,wBAAR,QAAQ,QAOnB;AAED;;GAEG;AACH,yDAAyD;AACzD,8GAA8G;AAC9G,IAAY,QAsJX;AAtJD,WAAY,QAAQ;IAClB,cAAc;IACd,uDAAgB,CAAA;IAChB,oCAAoC;IACpC,6DAAmB,CAAA;IACnB,2BAA2B;IAC3B,mEAAsB,CAAA;IACtB,+BAA+B;IAC/B,2DAAkB,CAAA;IAClB,0CAA0C;IAC1C,6DAAmB,CAAA;IACnB,kCAAkC;IAClC,2DAAkB,CAAA;IAClB,wCAAwC;IACxC,+DAAoB,CAAA;IACpB,wBAAwB;IACxB,6DAAmB,CAAA;IACnB,2CAA2C;IAC3C,mEAAsB,CAAA;IACtB,wCAAwC;IACxC,qEAAuB,CAAA;IACvB,2CAA2C;IAC3C,8DAAoB,CAAA;IACpB,2CAA2C;IAC3C,kEAAsB,CAAA;IACtB,0CAA0C;IAC1C,oEAAuB,CAAA;IACvB,+FAA+F;IAC/F,4DAAmB,CAAA;IACnB,uCAAuC;IACvC,oEAAuB,CAAA;IACvB,mCAAmC;IACnC,oEAAuB,CAAA;IACvB,wBAAwB;IACxB,8DAAoB,CAAA;IACpB,kCAAkC;IAClC,gEAAqB,CAAA;IACrB,wCAAwC;IACxC,gEAAqB,CAAA;IACrB,oEAAoE;IACpE,kFAA8B,CAAA;IAC9B,yBAAyB;IACzB,oEAAuB,CAAA;IACvB,+BAA+B;IAC/B,gEAAqB,CAAA;IACrB,6CAA6C;IAC7C,8DAAoB,CAAA;IACpB,2BAA2B;IAC3B,4DAAmB,CAAA;IACnB,sCAAsC;IACtC,gEAAqB,CAAA;IACrB,yCAAyC;IACzC,8DAAoB,CAAA;IACpB,8CAA8C;IAC9C,gEAAqB,CAAA;IACrB,mCAAmC;IACnC,2DAAmB,CAAA;IACnB,oCAAoC;IACpC,6DAAoB,CAAA;IAEpB,yEAAmD,CAAA;IACnD,qFAAyD,CAAA;IACzD,2EAAoD,CAAA;IACpD,4EAAoD,CAAA;IACpD,oFAAwD,CAAA;IACxD,kFAAuD,CAAA;IACvD,4EAAoD,CAAA;IACpD,8EAAqD,CAAA;IACrD,8EAAqD,CAAA;IACrD,8EAAsD,CAAA;IACtD,gFAAuD,CAAA;IACvD,4EAAqD,CAAA;IACrD,8EAAsD,CAAA;IACtD,oGAAiE,CAAA;IACjE,0EAAoD,CAAA;IACpD,4EAAqD,CAAA;IACrD,oFAAyD,CAAA;IACzD,gFAAuD,CAAA;IACvD,gFAAuD,CAAA;IACvD,gFAAuD,CAAA;IACvD,8EAAsD,CAAA;IACtD,0EAAoD,CAAA;IACpD,0FAA4D,CAAA;IAE5D,2EAA2E;IAC3E,0FAA0D,CAAA;IAC1D,uEAAuE;IACvE,4FAA2D,CAAA;IAC3D,yEAAyE;IACzE,oGAA+D,CAAA;IAC/D,uCAAuC;IACvC,8FAA4D,CAAA;IAC5D,sGAAsG;IACtG,4FAA2D,CAAA;IAC3D,qCAAqC;IACrC,+FAA4D,CAAA;IAC5D,+CAA+C;IAC/C,iHAAqE,CAAA;IACrE,yCAAyC;IACzC,+GAAoE,CAAA;IACpE,+EAA+E;IAC/E,yHAAyE,CAAA;IACzE,mEAAmE;IACnE,iGAA8D,CAAA;IAC9D,qGAAqG;IACrG,yHAA0E,CAAA;IAC1E,mEAAmE;IACnE,iGAA8D,CAAA;IAC9D,gDAAgD;IAChD,uGAAiE,CAAA;IACjE,6DAA6D;IAC7D,qHAAwE,CAAA;IACxE,4DAA4D;IAC5D,iHAAoE,CAAA;IACpE,+FAA+F;IAC/F,+FAA2D,CAAA;IAC3D,yFAAyF;IACzF,+FAA2D,CAAA;IAC3D,4DAA4D;IAC5D,uGAA+D,CAAA;IAC/D,mDAAmD;IACnD,6GAAkE,CAAA;IAClE,qDAAqD;IACrD,2GAAiE,CAAA;IACjE,qCAAqC;IACrC,6HAA0E,CAAA;IAC1E,qEAAqE;IACrE,uHAAuE,CAAA;IACvE,2CAA2C;IAC3C,iHAAsE,CAAA;IAEtE,yFAA4D,CAAA;IAC5D,+EAAqD,CAAA;IACrD,yFAA8D,CAAA;IAC9D,iFAA0D,CAAA;IAC1D,uFAA6D,CAAA;IAC7D,6EAAuD,CAAA;IACvD,uFAA6D,CAAA;IAC7D,uFAA6D,CAAA;IAC7D,uFAA6D,CAAA;IAC7D,iFAAuD,CAAA;IACvD,qFAAmE,CAAA;IACnE,+FAAwE,CAAA;IACxE,+FAAwE,CAAA;IACxE,4FAAsE,CAAA;IACtE,0FAAqE,CAAA;IACrE,gGAAwE,CAAA;IACxE,0FAAqE,CAAA;IACrE,wFAAoE,CAAA;IACpE,oFAAkE,CAAA;AACpE,CAAC,EAtJW,QAAQ,wBAAR,QAAQ,QAsJnB;AACD,wDAAwD","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 BeSQLite\r\n */\r\n\r\n/** Whether to open a database readonly or writeable.\r\n * @public\r\n */\r\nexport enum OpenMode {\r\n  Readonly = 0x00000001,\r\n  ReadWrite = 0x00000002,\r\n}\r\n\r\n/** Values, stored in changesets, that indicate what operation was performed on the database.\r\n * @public\r\n */\r\nexport enum DbOpcode {\r\n  /** A row was deleted. */\r\n  Delete = 9,\r\n  /** A new row was inserted. */\r\n  Insert = 18,\r\n  /** Some columns of an existing row were updated. */\r\n  Update = 23,\r\n}\r\n\r\n/** Values for return codes from BeSQLite functions. Consult SQLite documentation for further explanations.\r\n * @public\r\n */\r\n/* eslint-disable @typescript-eslint/naming-convention */\r\n//  Disabling for the rest of the file since eslint does not correctly parse the entire enum, only parts of it\r\nexport enum DbResult {\r\n  /** Success */\r\n  BE_SQLITE_OK = 0,\r\n  /** SQL error or missing database */\r\n  BE_SQLITE_ERROR = 1,\r\n  /** Internal logic error */\r\n  BE_SQLITE_INTERNAL = 2,\r\n  /** Access permission denied */\r\n  BE_SQLITE_PERM = 3,\r\n  /** Callback routine requested an abort */\r\n  BE_SQLITE_ABORT = 4,\r\n  /** The database file is locked */\r\n  BE_SQLITE_BUSY = 5,\r\n  /** A table in the database is locked */\r\n  BE_SQLITE_LOCKED = 6,\r\n  /** A malloc() failed */\r\n  BE_SQLITE_NOMEM = 7,\r\n  /** Attempt to write a readonly database */\r\n  BE_SQLITE_READONLY = 8,\r\n  /** Operation terminated by interrupt */\r\n  BE_SQLITE_INTERRUPT = 9,\r\n  /** Some kind of disk I/O error occurred */\r\n  BE_SQLITE_IOERR = 10,\r\n  /** The database disk image is malformed */\r\n  BE_SQLITE_CORRUPT = 11,\r\n  /** NOT USED. Table or record not found */\r\n  BE_SQLITE_NOTFOUND = 12,\r\n  /** Insertion failed because database is full or write operation failed because disk is full */\r\n  BE_SQLITE_FULL = 13,\r\n  /** Unable to open the database file */\r\n  BE_SQLITE_CANTOPEN = 14,\r\n  /** Database lock protocol error */\r\n  BE_SQLITE_PROTOCOL = 15,\r\n  /** Database is empty */\r\n  BE_SQLITE_EMPTY = 16,\r\n  /** The database schema changed */\r\n  BE_SQLITE_SCHEMA = 17,\r\n  /** String or BLOB exceeds size limit */\r\n  BE_SQLITE_TOOBIG = 18,\r\n  /** Abort due to constraint violation. See extended error values. */\r\n  BE_SQLITE_CONSTRAINT_BASE = 19,\r\n  /** Data type mismatch */\r\n  BE_SQLITE_MISMATCH = 20,\r\n  /** Library used incorrectly */\r\n  BE_SQLITE_MISUSE = 21,\r\n  /** Uses OS features not supported on host */\r\n  BE_SQLITE_NOLFS = 22,\r\n  /** Authorization denied */\r\n  BE_SQLITE_AUTH = 23,\r\n  /** Auxiliary database format error */\r\n  BE_SQLITE_FORMAT = 24,\r\n  /** 2nd parameter to Bind out of range */\r\n  BE_SQLITE_RANGE = 25,\r\n  /** File opened that is not a database file */\r\n  BE_SQLITE_NOTADB = 26,\r\n  /** Step() has another row ready */\r\n  BE_SQLITE_ROW = 100,\r\n  /** Step() has finished executing */\r\n  BE_SQLITE_DONE = 101,\r\n\r\n  BE_SQLITE_IOERR_READ = (BE_SQLITE_IOERR | (1 << 8)),\r\n  BE_SQLITE_IOERR_SHORT_READ = (BE_SQLITE_IOERR | (2 << 8)),\r\n  BE_SQLITE_IOERR_WRITE = (BE_SQLITE_IOERR | (3 << 8)),\r\n  BE_SQLITE_IOERR_FSYNC = (BE_SQLITE_IOERR | (4 << 8)),\r\n  BE_SQLITE_IOERR_DIR_FSYNC = (BE_SQLITE_IOERR | (5 << 8)),\r\n  BE_SQLITE_IOERR_TRUNCATE = (BE_SQLITE_IOERR | (6 << 8)),\r\n  BE_SQLITE_IOERR_FSTAT = (BE_SQLITE_IOERR | (7 << 8)),\r\n  BE_SQLITE_IOERR_UNLOCK = (BE_SQLITE_IOERR | (8 << 8)),\r\n  BE_SQLITE_IOERR_RDLOCK = (BE_SQLITE_IOERR | (9 << 8)),\r\n  BE_SQLITE_IOERR_DELETE = (BE_SQLITE_IOERR | (10 << 8)),\r\n  BE_SQLITE_IOERR_BLOCKED = (BE_SQLITE_IOERR | (11 << 8)),\r\n  BE_SQLITE_IOERR_NOMEM = (BE_SQLITE_IOERR | (12 << 8)),\r\n  BE_SQLITE_IOERR_ACCESS = (BE_SQLITE_IOERR | (13 << 8)),\r\n  BE_SQLITE_IOERR_CHECKRESERVEDLOCK = (BE_SQLITE_IOERR | (14 << 8)),\r\n  BE_SQLITE_IOERR_LOCK = (BE_SQLITE_IOERR | (15 << 8)),\r\n  BE_SQLITE_IOERR_CLOSE = (BE_SQLITE_IOERR | (16 << 8)),\r\n  BE_SQLITE_IOERR_DIR_CLOSE = (BE_SQLITE_IOERR | (17 << 8)),\r\n  BE_SQLITE_IOERR_SHMOPEN = (BE_SQLITE_IOERR | (18 << 8)),\r\n  BE_SQLITE_IOERR_SHMSIZE = (BE_SQLITE_IOERR | (19 << 8)),\r\n  BE_SQLITE_IOERR_SHMLOCK = (BE_SQLITE_IOERR | (20 << 8)),\r\n  BE_SQLITE_IOERR_SHMMAP = (BE_SQLITE_IOERR | (21 << 8)),\r\n  BE_SQLITE_IOERR_SEEK = (BE_SQLITE_IOERR | (22 << 8)),\r\n  BE_SQLITE_IOERR_DELETE_NOENT = (BE_SQLITE_IOERR | (23 << 8)),\r\n\r\n  /** attempt to create a new file when a file by that name already exists */\r\n  BE_SQLITE_ERROR_FileExists = (BE_SQLITE_IOERR | (1 << 24)),\r\n  /** attempt to open a BeSQLite::Db that is already in use somewhere. */\r\n  BE_SQLITE_ERROR_AlreadyOpen = (BE_SQLITE_IOERR | (2 << 24)),\r\n  /** attempt to open a BeSQLite::Db that doesn't have a property table. */\r\n  BE_SQLITE_ERROR_NoPropertyTable = (BE_SQLITE_IOERR | (3 << 24)),\r\n  /** the database name is not a file. */\r\n  BE_SQLITE_ERROR_FileNotFound = (BE_SQLITE_IOERR | (4 << 24)),\r\n  /** there is no transaction active and the database was opened with AllowImplicitTransactions=false */\r\n  BE_SQLITE_ERROR_NoTxnActive = (BE_SQLITE_IOERR | (5 << 24)),\r\n  /** wrong BeSQLite profile version */\r\n  BE_SQLITE_ERROR_BadDbProfile = (BE_SQLITE_IOERR | (6 << 24)),\r\n  /** Profile of file could not be determined. */\r\n  BE_SQLITE_ERROR_InvalidProfileVersion = (BE_SQLITE_IOERR | (7 << 24)),\r\n  /** Upgrade of profile of file failed. */\r\n  BE_SQLITE_ERROR_ProfileUpgradeFailed = (BE_SQLITE_IOERR | (8 << 24)),\r\n  /** Profile of file is too old. Therefore file can only be opened read-only. */\r\n  BE_SQLITE_ERROR_ProfileTooOldForReadWrite = (BE_SQLITE_IOERR | (9 << 24)),\r\n  /** Profile of file is too old. Therefore file cannot be opened. */\r\n  BE_SQLITE_ERROR_ProfileTooOld = (BE_SQLITE_IOERR | (10 << 24)),\r\n  /** Profile of file is too new for read-write access. Therefore file can only be opened read-only. */\r\n  BE_SQLITE_ERROR_ProfileTooNewForReadWrite = (BE_SQLITE_IOERR | (11 << 24)),\r\n  /** Profile of file is too new. Therefore file cannot be opened. */\r\n  BE_SQLITE_ERROR_ProfileTooNew = (BE_SQLITE_IOERR | (12 << 24)),\r\n  /** attempt to commit with active changetrack */\r\n  BE_SQLITE_ERROR_ChangeTrackError = (BE_SQLITE_IOERR | (13 << 24)),\r\n  /** invalid version of the revision file is being imported */\r\n  BE_SQLITE_ERROR_InvalidChangeSetVersion = (BE_SQLITE_IOERR | (14 << 24)),\r\n  /** The schemas found in the database need to be upgraded */\r\n  BE_SQLITE_ERROR_SchemaUpgradeRequired = (BE_SQLITE_IOERR | 15 << 24),\r\n  /** The schemas found in the database are too new, and the application needs to be upgraded. */\r\n  BE_SQLITE_ERROR_SchemaTooNew = (BE_SQLITE_IOERR | 16 << 24),\r\n  /** The schemas found in the database are too old, and the DgnDb needs to be upgraded. */\r\n  BE_SQLITE_ERROR_SchemaTooOld = (BE_SQLITE_IOERR | 17 << 24),\r\n  /** Error acquiring a lock on the schemas before upgrade. */\r\n  BE_SQLITE_ERROR_SchemaLockFailed = (BE_SQLITE_IOERR | 18 << 24),\r\n  /** Error upgrading the schemas in the database. */\r\n  BE_SQLITE_ERROR_SchemaUpgradeFailed = (BE_SQLITE_IOERR | 19 << 24),\r\n  /** Error importing the schemas into the database. */\r\n  BE_SQLITE_ERROR_SchemaImportFailed = (BE_SQLITE_IOERR | 20 << 24),\r\n  /** Error acquiring locks or codes */\r\n  BE_SQLITE_ERROR_CouldNotAcquireLocksOrCodes = (BE_SQLITE_IOERR | 21 << 24),\r\n  /** Recommended that the schemas found in the database be upgraded */\r\n  BE_SQLITE_ERROR_SchemaUpgradeRecommended = (BE_SQLITE_IOERR | 22 << 24),\r\n  /** schema update require data transform */\r\n  BE_SQLITE_ERROR_DataTransformRequired = (BE_SQLITE_IOERR | (23 << 24)),\r\n\r\n  BE_SQLITE_LOCKED_SHAREDCACHE = (BE_SQLITE_LOCKED | (1 << 8)),\r\n  BE_SQLITE_BUSY_RECOVERY = (BE_SQLITE_BUSY | (1 << 8)),\r\n  BE_SQLITE_CANTOPEN_NOTEMPDIR = (BE_SQLITE_CANTOPEN | (1 << 8)),\r\n  BE_SQLITE_CANTOPEN_ISDIR = (BE_SQLITE_CANTOPEN | (2 << 8)),\r\n  BE_SQLITE_CANTOPEN_FULLPATH = (BE_SQLITE_CANTOPEN | (3 << 8)),\r\n  BE_SQLITE_CORRUPT_VTAB = (BE_SQLITE_CORRUPT | (1 << 8)),\r\n  BE_SQLITE_READONLY_RECOVERY = (BE_SQLITE_READONLY | (1 << 8)),\r\n  BE_SQLITE_READONLY_CANTLOCK = (BE_SQLITE_READONLY | (2 << 8)),\r\n  BE_SQLITE_READONLY_ROLLBACK = (BE_SQLITE_READONLY | (3 << 8)),\r\n  BE_SQLITE_ABORT_ROLLBACK = (BE_SQLITE_ABORT | (2 << 8)),\r\n  BE_SQLITE_CONSTRAINT_CHECK = (BE_SQLITE_CONSTRAINT_BASE | (1 << 8)),\r\n  BE_SQLITE_CONSTRAINT_COMMITHOOK = (BE_SQLITE_CONSTRAINT_BASE | (2 << 8)),\r\n  BE_SQLITE_CONSTRAINT_FOREIGNKEY = (BE_SQLITE_CONSTRAINT_BASE | (3 << 8)),\r\n  BE_SQLITE_CONSTRAINT_FUNCTION = (BE_SQLITE_CONSTRAINT_BASE | (4 << 8)),\r\n  BE_SQLITE_CONSTRAINT_NOTNULL = (BE_SQLITE_CONSTRAINT_BASE | (5 << 8)),\r\n  BE_SQLITE_CONSTRAINT_PRIMARYKEY = (BE_SQLITE_CONSTRAINT_BASE | (6 << 8)),\r\n  BE_SQLITE_CONSTRAINT_TRIGGER = (BE_SQLITE_CONSTRAINT_BASE | (7 << 8)),\r\n  BE_SQLITE_CONSTRAINT_UNIQUE = (BE_SQLITE_CONSTRAINT_BASE | (8 << 8)),\r\n  BE_SQLITE_CONSTRAINT_VTAB = (BE_SQLITE_CONSTRAINT_BASE | (9 << 8)),\r\n}\r\n/* eslint-enable @typescript-eslint/naming-convention */\r\n"]}
+{"version":3,"file":"BeSQLite.js","sourceRoot":"","sources":["../../src/BeSQLite.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;GAEG;AACH,IAAY,QAGX;AAHD,WAAY,QAAQ;IAClB,+CAAqB,CAAA;IACrB,iDAAsB,CAAA;AACxB,CAAC,EAHW,QAAQ,wBAAR,QAAQ,QAGnB;AAED;;GAEG;AACH,IAAY,QAOX;AAPD,WAAY,QAAQ;IAClB,yBAAyB;IACzB,2CAAU,CAAA;IACV,8BAA8B;IAC9B,4CAAW,CAAA;IACX,oDAAoD;IACpD,4CAAW,CAAA;AACb,CAAC,EAPW,QAAQ,wBAAR,QAAQ,QAOnB;AAED;;GAEG;AACH,8GAA8G;AAC9G,IAAY,QAsJX;AAtJD,WAAY,QAAQ;IAClB,cAAc;IACd,uDAAgB,CAAA;IAChB,oCAAoC;IACpC,6DAAmB,CAAA;IACnB,2BAA2B;IAC3B,mEAAsB,CAAA;IACtB,+BAA+B;IAC/B,2DAAkB,CAAA;IAClB,0CAA0C;IAC1C,6DAAmB,CAAA;IACnB,kCAAkC;IAClC,2DAAkB,CAAA;IAClB,wCAAwC;IACxC,+DAAoB,CAAA;IACpB,wBAAwB;IACxB,6DAAmB,CAAA;IACnB,2CAA2C;IAC3C,mEAAsB,CAAA;IACtB,wCAAwC;IACxC,qEAAuB,CAAA;IACvB,2CAA2C;IAC3C,8DAAoB,CAAA;IACpB,2CAA2C;IAC3C,kEAAsB,CAAA;IACtB,0CAA0C;IAC1C,oEAAuB,CAAA;IACvB,+FAA+F;IAC/F,4DAAmB,CAAA;IACnB,uCAAuC;IACvC,oEAAuB,CAAA;IACvB,mCAAmC;IACnC,oEAAuB,CAAA;IACvB,wBAAwB;IACxB,8DAAoB,CAAA;IACpB,kCAAkC;IAClC,gEAAqB,CAAA;IACrB,wCAAwC;IACxC,gEAAqB,CAAA;IACrB,oEAAoE;IACpE,kFAA8B,CAAA;IAC9B,yBAAyB;IACzB,oEAAuB,CAAA;IACvB,+BAA+B;IAC/B,gEAAqB,CAAA;IACrB,6CAA6C;IAC7C,8DAAoB,CAAA;IACpB,2BAA2B;IAC3B,4DAAmB,CAAA;IACnB,sCAAsC;IACtC,gEAAqB,CAAA;IACrB,yCAAyC;IACzC,8DAAoB,CAAA;IACpB,8CAA8C;IAC9C,gEAAqB,CAAA;IACrB,mCAAmC;IACnC,2DAAmB,CAAA;IACnB,oCAAoC;IACpC,6DAAoB,CAAA;IAEpB,yEAAmD,CAAA;IACnD,qFAAyD,CAAA;IACzD,2EAAoD,CAAA;IACpD,4EAAoD,CAAA;IACpD,oFAAwD,CAAA;IACxD,kFAAuD,CAAA;IACvD,4EAAoD,CAAA;IACpD,8EAAqD,CAAA;IACrD,8EAAqD,CAAA;IACrD,8EAAsD,CAAA;IACtD,gFAAuD,CAAA;IACvD,4EAAqD,CAAA;IACrD,8EAAsD,CAAA;IACtD,oGAAiE,CAAA;IACjE,0EAAoD,CAAA;IACpD,4EAAqD,CAAA;IACrD,oFAAyD,CAAA;IACzD,gFAAuD,CAAA;IACvD,gFAAuD,CAAA;IACvD,gFAAuD,CAAA;IACvD,8EAAsD,CAAA;IACtD,0EAAoD,CAAA;IACpD,0FAA4D,CAAA;IAE5D,2EAA2E;IAC3E,0FAA0D,CAAA;IAC1D,uEAAuE;IACvE,4FAA2D,CAAA;IAC3D,yEAAyE;IACzE,oGAA+D,CAAA;IAC/D,uCAAuC;IACvC,8FAA4D,CAAA;IAC5D,sGAAsG;IACtG,4FAA2D,CAAA;IAC3D,qCAAqC;IACrC,+FAA4D,CAAA;IAC5D,+CAA+C;IAC/C,iHAAqE,CAAA;IACrE,yCAAyC;IACzC,+GAAoE,CAAA;IACpE,+EAA+E;IAC/E,yHAAyE,CAAA;IACzE,mEAAmE;IACnE,iGAA8D,CAAA;IAC9D,qGAAqG;IACrG,yHAA0E,CAAA;IAC1E,mEAAmE;IACnE,iGAA8D,CAAA;IAC9D,gDAAgD;IAChD,uGAAiE,CAAA;IACjE,6DAA6D;IAC7D,qHAAwE,CAAA;IACxE,4DAA4D;IAC5D,iHAAoE,CAAA;IACpE,+FAA+F;IAC/F,+FAA2D,CAAA;IAC3D,yFAAyF;IACzF,+FAA2D,CAAA;IAC3D,4DAA4D;IAC5D,uGAA+D,CAAA;IAC/D,mDAAmD;IACnD,6GAAkE,CAAA;IAClE,qDAAqD;IACrD,2GAAiE,CAAA;IACjE,qCAAqC;IACrC,6HAA0E,CAAA;IAC1E,qEAAqE;IACrE,uHAAuE,CAAA;IACvE,2CAA2C;IAC3C,iHAAsE,CAAA;IAEtE,yFAA4D,CAAA;IAC5D,+EAAqD,CAAA;IACrD,yFAA8D,CAAA;IAC9D,iFAA0D,CAAA;IAC1D,uFAA6D,CAAA;IAC7D,6EAAuD,CAAA;IACvD,uFAA6D,CAAA;IAC7D,uFAA6D,CAAA;IAC7D,uFAA6D,CAAA;IAC7D,iFAAuD,CAAA;IACvD,qFAAmE,CAAA;IACnE,+FAAwE,CAAA;IACxE,+FAAwE,CAAA;IACxE,4FAAsE,CAAA;IACtE,0FAAqE,CAAA;IACrE,gGAAwE,CAAA;IACxE,0FAAqE,CAAA;IACrE,wFAAoE,CAAA;IACpE,oFAAkE,CAAA;AACpE,CAAC,EAtJW,QAAQ,wBAAR,QAAQ,QAsJnB","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 BeSQLite\r\n */\r\n\r\n/** Whether to open a database readonly or writeable.\r\n * @public\r\n */\r\nexport enum OpenMode {\r\n  Readonly = 0x00000001,\r\n  ReadWrite = 0x00000002,\r\n}\r\n\r\n/** Values, stored in changesets, that indicate what operation was performed on the database.\r\n * @public\r\n */\r\nexport enum DbOpcode {\r\n  /** A row was deleted. */\r\n  Delete = 9,\r\n  /** A new row was inserted. */\r\n  Insert = 18,\r\n  /** Some columns of an existing row were updated. */\r\n  Update = 23,\r\n}\r\n\r\n/** Values for return codes from BeSQLite functions. Consult SQLite documentation for further explanations.\r\n * @public\r\n */\r\n//  Disabling for the rest of the file since eslint does not correctly parse the entire enum, only parts of it\r\nexport enum DbResult {\r\n  /** Success */\r\n  BE_SQLITE_OK = 0,\r\n  /** SQL error or missing database */\r\n  BE_SQLITE_ERROR = 1,\r\n  /** Internal logic error */\r\n  BE_SQLITE_INTERNAL = 2,\r\n  /** Access permission denied */\r\n  BE_SQLITE_PERM = 3,\r\n  /** Callback routine requested an abort */\r\n  BE_SQLITE_ABORT = 4,\r\n  /** The database file is locked */\r\n  BE_SQLITE_BUSY = 5,\r\n  /** A table in the database is locked */\r\n  BE_SQLITE_LOCKED = 6,\r\n  /** A malloc() failed */\r\n  BE_SQLITE_NOMEM = 7,\r\n  /** Attempt to write a readonly database */\r\n  BE_SQLITE_READONLY = 8,\r\n  /** Operation terminated by interrupt */\r\n  BE_SQLITE_INTERRUPT = 9,\r\n  /** Some kind of disk I/O error occurred */\r\n  BE_SQLITE_IOERR = 10,\r\n  /** The database disk image is malformed */\r\n  BE_SQLITE_CORRUPT = 11,\r\n  /** NOT USED. Table or record not found */\r\n  BE_SQLITE_NOTFOUND = 12,\r\n  /** Insertion failed because database is full or write operation failed because disk is full */\r\n  BE_SQLITE_FULL = 13,\r\n  /** Unable to open the database file */\r\n  BE_SQLITE_CANTOPEN = 14,\r\n  /** Database lock protocol error */\r\n  BE_SQLITE_PROTOCOL = 15,\r\n  /** Database is empty */\r\n  BE_SQLITE_EMPTY = 16,\r\n  /** The database schema changed */\r\n  BE_SQLITE_SCHEMA = 17,\r\n  /** String or BLOB exceeds size limit */\r\n  BE_SQLITE_TOOBIG = 18,\r\n  /** Abort due to constraint violation. See extended error values. */\r\n  BE_SQLITE_CONSTRAINT_BASE = 19,\r\n  /** Data type mismatch */\r\n  BE_SQLITE_MISMATCH = 20,\r\n  /** Library used incorrectly */\r\n  BE_SQLITE_MISUSE = 21,\r\n  /** Uses OS features not supported on host */\r\n  BE_SQLITE_NOLFS = 22,\r\n  /** Authorization denied */\r\n  BE_SQLITE_AUTH = 23,\r\n  /** Auxiliary database format error */\r\n  BE_SQLITE_FORMAT = 24,\r\n  /** 2nd parameter to Bind out of range */\r\n  BE_SQLITE_RANGE = 25,\r\n  /** File opened that is not a database file */\r\n  BE_SQLITE_NOTADB = 26,\r\n  /** Step() has another row ready */\r\n  BE_SQLITE_ROW = 100,\r\n  /** Step() has finished executing */\r\n  BE_SQLITE_DONE = 101,\r\n\r\n  BE_SQLITE_IOERR_READ = (BE_SQLITE_IOERR | (1 << 8)),\r\n  BE_SQLITE_IOERR_SHORT_READ = (BE_SQLITE_IOERR | (2 << 8)),\r\n  BE_SQLITE_IOERR_WRITE = (BE_SQLITE_IOERR | (3 << 8)),\r\n  BE_SQLITE_IOERR_FSYNC = (BE_SQLITE_IOERR | (4 << 8)),\r\n  BE_SQLITE_IOERR_DIR_FSYNC = (BE_SQLITE_IOERR | (5 << 8)),\r\n  BE_SQLITE_IOERR_TRUNCATE = (BE_SQLITE_IOERR | (6 << 8)),\r\n  BE_SQLITE_IOERR_FSTAT = (BE_SQLITE_IOERR | (7 << 8)),\r\n  BE_SQLITE_IOERR_UNLOCK = (BE_SQLITE_IOERR | (8 << 8)),\r\n  BE_SQLITE_IOERR_RDLOCK = (BE_SQLITE_IOERR | (9 << 8)),\r\n  BE_SQLITE_IOERR_DELETE = (BE_SQLITE_IOERR | (10 << 8)),\r\n  BE_SQLITE_IOERR_BLOCKED = (BE_SQLITE_IOERR | (11 << 8)),\r\n  BE_SQLITE_IOERR_NOMEM = (BE_SQLITE_IOERR | (12 << 8)),\r\n  BE_SQLITE_IOERR_ACCESS = (BE_SQLITE_IOERR | (13 << 8)),\r\n  BE_SQLITE_IOERR_CHECKRESERVEDLOCK = (BE_SQLITE_IOERR | (14 << 8)),\r\n  BE_SQLITE_IOERR_LOCK = (BE_SQLITE_IOERR | (15 << 8)),\r\n  BE_SQLITE_IOERR_CLOSE = (BE_SQLITE_IOERR | (16 << 8)),\r\n  BE_SQLITE_IOERR_DIR_CLOSE = (BE_SQLITE_IOERR | (17 << 8)),\r\n  BE_SQLITE_IOERR_SHMOPEN = (BE_SQLITE_IOERR | (18 << 8)),\r\n  BE_SQLITE_IOERR_SHMSIZE = (BE_SQLITE_IOERR | (19 << 8)),\r\n  BE_SQLITE_IOERR_SHMLOCK = (BE_SQLITE_IOERR | (20 << 8)),\r\n  BE_SQLITE_IOERR_SHMMAP = (BE_SQLITE_IOERR | (21 << 8)),\r\n  BE_SQLITE_IOERR_SEEK = (BE_SQLITE_IOERR | (22 << 8)),\r\n  BE_SQLITE_IOERR_DELETE_NOENT = (BE_SQLITE_IOERR | (23 << 8)),\r\n\r\n  /** attempt to create a new file when a file by that name already exists */\r\n  BE_SQLITE_ERROR_FileExists = (BE_SQLITE_IOERR | (1 << 24)),\r\n  /** attempt to open a BeSQLite::Db that is already in use somewhere. */\r\n  BE_SQLITE_ERROR_AlreadyOpen = (BE_SQLITE_IOERR | (2 << 24)),\r\n  /** attempt to open a BeSQLite::Db that doesn't have a property table. */\r\n  BE_SQLITE_ERROR_NoPropertyTable = (BE_SQLITE_IOERR | (3 << 24)),\r\n  /** the database name is not a file. */\r\n  BE_SQLITE_ERROR_FileNotFound = (BE_SQLITE_IOERR | (4 << 24)),\r\n  /** there is no transaction active and the database was opened with AllowImplicitTransactions=false */\r\n  BE_SQLITE_ERROR_NoTxnActive = (BE_SQLITE_IOERR | (5 << 24)),\r\n  /** wrong BeSQLite profile version */\r\n  BE_SQLITE_ERROR_BadDbProfile = (BE_SQLITE_IOERR | (6 << 24)),\r\n  /** Profile of file could not be determined. */\r\n  BE_SQLITE_ERROR_InvalidProfileVersion = (BE_SQLITE_IOERR | (7 << 24)),\r\n  /** Upgrade of profile of file failed. */\r\n  BE_SQLITE_ERROR_ProfileUpgradeFailed = (BE_SQLITE_IOERR | (8 << 24)),\r\n  /** Profile of file is too old. Therefore file can only be opened read-only. */\r\n  BE_SQLITE_ERROR_ProfileTooOldForReadWrite = (BE_SQLITE_IOERR | (9 << 24)),\r\n  /** Profile of file is too old. Therefore file cannot be opened. */\r\n  BE_SQLITE_ERROR_ProfileTooOld = (BE_SQLITE_IOERR | (10 << 24)),\r\n  /** Profile of file is too new for read-write access. Therefore file can only be opened read-only. */\r\n  BE_SQLITE_ERROR_ProfileTooNewForReadWrite = (BE_SQLITE_IOERR | (11 << 24)),\r\n  /** Profile of file is too new. Therefore file cannot be opened. */\r\n  BE_SQLITE_ERROR_ProfileTooNew = (BE_SQLITE_IOERR | (12 << 24)),\r\n  /** attempt to commit with active changetrack */\r\n  BE_SQLITE_ERROR_ChangeTrackError = (BE_SQLITE_IOERR | (13 << 24)),\r\n  /** invalid version of the revision file is being imported */\r\n  BE_SQLITE_ERROR_InvalidChangeSetVersion = (BE_SQLITE_IOERR | (14 << 24)),\r\n  /** The schemas found in the database need to be upgraded */\r\n  BE_SQLITE_ERROR_SchemaUpgradeRequired = (BE_SQLITE_IOERR | 15 << 24),\r\n  /** The schemas found in the database are too new, and the application needs to be upgraded. */\r\n  BE_SQLITE_ERROR_SchemaTooNew = (BE_SQLITE_IOERR | 16 << 24),\r\n  /** The schemas found in the database are too old, and the DgnDb needs to be upgraded. */\r\n  BE_SQLITE_ERROR_SchemaTooOld = (BE_SQLITE_IOERR | 17 << 24),\r\n  /** Error acquiring a lock on the schemas before upgrade. */\r\n  BE_SQLITE_ERROR_SchemaLockFailed = (BE_SQLITE_IOERR | 18 << 24),\r\n  /** Error upgrading the schemas in the database. */\r\n  BE_SQLITE_ERROR_SchemaUpgradeFailed = (BE_SQLITE_IOERR | 19 << 24),\r\n  /** Error importing the schemas into the database. */\r\n  BE_SQLITE_ERROR_SchemaImportFailed = (BE_SQLITE_IOERR | 20 << 24),\r\n  /** Error acquiring locks or codes */\r\n  BE_SQLITE_ERROR_CouldNotAcquireLocksOrCodes = (BE_SQLITE_IOERR | 21 << 24),\r\n  /** Recommended that the schemas found in the database be upgraded */\r\n  BE_SQLITE_ERROR_SchemaUpgradeRecommended = (BE_SQLITE_IOERR | 22 << 24),\r\n  /** schema update require data transform */\r\n  BE_SQLITE_ERROR_DataTransformRequired = (BE_SQLITE_IOERR | (23 << 24)),\r\n\r\n  BE_SQLITE_LOCKED_SHAREDCACHE = (BE_SQLITE_LOCKED | (1 << 8)),\r\n  BE_SQLITE_BUSY_RECOVERY = (BE_SQLITE_BUSY | (1 << 8)),\r\n  BE_SQLITE_CANTOPEN_NOTEMPDIR = (BE_SQLITE_CANTOPEN | (1 << 8)),\r\n  BE_SQLITE_CANTOPEN_ISDIR = (BE_SQLITE_CANTOPEN | (2 << 8)),\r\n  BE_SQLITE_CANTOPEN_FULLPATH = (BE_SQLITE_CANTOPEN | (3 << 8)),\r\n  BE_SQLITE_CORRUPT_VTAB = (BE_SQLITE_CORRUPT | (1 << 8)),\r\n  BE_SQLITE_READONLY_RECOVERY = (BE_SQLITE_READONLY | (1 << 8)),\r\n  BE_SQLITE_READONLY_CANTLOCK = (BE_SQLITE_READONLY | (2 << 8)),\r\n  BE_SQLITE_READONLY_ROLLBACK = (BE_SQLITE_READONLY | (3 << 8)),\r\n  BE_SQLITE_ABORT_ROLLBACK = (BE_SQLITE_ABORT | (2 << 8)),\r\n  BE_SQLITE_CONSTRAINT_CHECK = (BE_SQLITE_CONSTRAINT_BASE | (1 << 8)),\r\n  BE_SQLITE_CONSTRAINT_COMMITHOOK = (BE_SQLITE_CONSTRAINT_BASE | (2 << 8)),\r\n  BE_SQLITE_CONSTRAINT_FOREIGNKEY = (BE_SQLITE_CONSTRAINT_BASE | (3 << 8)),\r\n  BE_SQLITE_CONSTRAINT_FUNCTION = (BE_SQLITE_CONSTRAINT_BASE | (4 << 8)),\r\n  BE_SQLITE_CONSTRAINT_NOTNULL = (BE_SQLITE_CONSTRAINT_BASE | (5 << 8)),\r\n  BE_SQLITE_CONSTRAINT_PRIMARYKEY = (BE_SQLITE_CONSTRAINT_BASE | (6 << 8)),\r\n  BE_SQLITE_CONSTRAINT_TRIGGER = (BE_SQLITE_CONSTRAINT_BASE | (7 << 8)),\r\n  BE_SQLITE_CONSTRAINT_UNIQUE = (BE_SQLITE_CONSTRAINT_BASE | (8 << 8)),\r\n  BE_SQLITE_CONSTRAINT_VTAB = (BE_SQLITE_CONSTRAINT_BASE | (9 << 8)),\r\n}\r\n"]}

package/lib/cjs/ByteStream.js

@@ -48,14 +48,14 @@ class ByteStream {
      */
     static fromUint8Array(bytes) {
         const { byteOffset, byteLength } = bytes;
-        return new ByteStream(bytes.buffer, { byteOffset, byteLength }); // eslint-disable-line deprecation/deprecation
+        return new ByteStream(bytes.buffer, { byteOffset, byteLength }); // eslint-disable-line @typescript-eslint/no-deprecated
     }
     /** Construct a new ByteStream with the read position set to the beginning.
      * @param buffer The underlying buffer from which data is to be extracted.
      * @param subView If defined, specifies the subset of the underlying buffer's data to use.
      */
     static fromArrayBuffer(buffer, subView) {
-        return new ByteStream(buffer, subView); // eslint-disable-line deprecation/deprecation
+        return new ByteStream(buffer, subView); // eslint-disable-line @typescript-eslint/no-deprecated
     }
     /** The number of bytes in this stream */
     get length() {

package/lib/cjs/ByteStream.js.map

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

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

@@ -1 +1 @@
-{"version":3,"file":"Disposable.d.ts","sourceRoot":"","sources":["../../src/Disposable.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,WAAW;IAC1B;;OAEG;IACH,OAAO,IAAI,IAAI,CAAC;CACjB;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,OAAO,GAAG,GAAG,IAAI,WAAW,CAG9D;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,OAAO,CAAC,UAAU,CAAC,EAAE,WAAW,GAAG,SAAS,CAI3D;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,CAAC,EAAE,WAAW,EAAE,GAAG,SAAS,CAS5D;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,OAAO,GAAG,OAAO,CAkB/G;AAED;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC;AAQrC;;GAEG;AACH,qBAAa,cAAe,YAAW,WAAW;IAChD,OAAO,CAAC,YAAY,CAAgB;IAEpC,iCAAiC;gBACrB,WAAW,GAAE,KAAK,CAAC,WAAW,GAAG,WAAW,CAAM;IAO9D,OAAO,CAAC,YAAY;IAIpB,uCAAuC;IAChC,GAAG,CAAC,UAAU,EAAE,WAAW,GAAG,WAAW;IAOhD,oCAAoC;IAC7B,MAAM,CAAC,UAAU,EAAE,WAAW,GAAG,IAAI;IAM5C,uCAAuC;IAChC,OAAO,IAAI,IAAI;CAIvB"}
+{"version":3,"file":"Disposable.d.ts","sourceRoot":"","sources":["../../src/Disposable.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,WAAW;IAC1B;;OAEG;IACH,OAAO,IAAI,IAAI,CAAC;CACjB;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,OAAO,GAAG,GAAG,IAAI,WAAW,CAE9D;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,OAAO,CAAC,UAAU,CAAC,EAAE,WAAW,GAAG,SAAS,CAI3D;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,CAAC,EAAE,WAAW,EAAE,GAAG,SAAS,CAS5D;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,CAAC,SAAS,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,OAAO,GAAG,OAAO,CAkB/G;AAED;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC;AAQrC;;GAEG;AACH,qBAAa,cAAe,YAAW,WAAW;IAChD,OAAO,CAAC,YAAY,CAAgB;IAEpC,iCAAiC;gBACrB,WAAW,GAAE,KAAK,CAAC,WAAW,GAAG,WAAW,CAAM;IAO9D,OAAO,CAAC,YAAY;IAIpB,uCAAuC;IAChC,GAAG,CAAC,UAAU,EAAE,WAAW,GAAG,WAAW;IAOhD,oCAAoC;IAC7B,MAAM,CAAC,UAAU,EAAE,WAAW,GAAG,IAAI;IAM5C,uCAAuC;IAChC,OAAO,IAAI,IAAI;CAIvB"}

package/lib/cjs/Disposable.js

@@ -17,7 +17,6 @@ exports.using = using;
  * @public
  */
 function isIDisposable(obj) {
-    // eslint-disable-next-line @typescript-eslint/unbound-method
     return !!obj && (obj instanceof Object) && !!obj.dispose && (typeof obj.dispose === "function");
 }
 /** Convenience function for disposing of a disposable object that may be undefined.

package/lib/cjs/Disposable.js.map

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

package/lib/cjs/Id.js.map

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

package/lib/cjs/JsonUtils.d.ts

@@ -69,7 +69,7 @@ export declare namespace JsonUtils {
      * @param value The value to test.
      * @returns true if `value` is an Object with at least one key.
      */
-    function isNonEmptyObject(value: any): value is Object;
+    function isNonEmptyObject(value: any): value is object;
     /**
      * Convert the input object into a "pure" JavaScript object, with only instances of "object" or primitives in the returned value.
      * Works recursively for object members, and over arrays entries. Calls "toJSON" on any members that implement it.

package/lib/cjs/JsonUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"JsonUtils.js","sourceRoot":"","sources":["../../src/JsonUtils.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;GAEG;AACH,IAAiB,SAAS,CA2IzB;AA3ID,WAAiB,SAAS;IACxB;;;;OAIG;IACH,SAAgB,MAAM,CAAC,IAAS,EAAE,UAAU,GAAG,KAAK;QAClD,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC;IAFe,gBAAM,SAErB,CAAA;IACD;;;;OAIG;IACH,SAAgB,KAAK,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC;QAC7C,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;IACpE,CAAC;IAFe,eAAK,QAEpB,CAAA;IACD;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC;QAChD,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;IACxD,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IACD;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,EAAE;QACjD,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAChE,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IAED;;;OAGG;IACH,SAAgB,OAAO,CAAC,IAAS;QAC/B,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IAChD,CAAC;IAFe,iBAAO,UAEtB,CAAA;IAED;;;OAGG;IACH,SAAgB,QAAQ,CAAC,IAAS;QAChC,OAAO,QAAQ,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACrD,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAW,EAAE,UAAkB;QACvF,IAAI,GAAG,KAAK,UAAU;YACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;YAEjB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IALe,2BAAiB,oBAKhC,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,kBAAkB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAY,EAAE,UAAmB;QAC1F,IAAI,GAAG,KAAK,UAAU;YACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;YAEjB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IALe,4BAAkB,qBAKjC,CAAA;IAED;;;OAGG;IACH,SAAgB,aAAa,CAAC,IAAS;QACrC,OAAO,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IACpE,CAAC;IAFe,uBAAa,gBAE5B,CAAA;IAED;;;OAGG;IACH,SAAgB,wBAAwB,CAAC,IAAS;QAChD,OAAO,SAAS,KAAK,IAAI,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC;IAFe,kCAAwB,2BAEvC,CAAA;IAED,SAAS,iBAAiB,CAAC,IAAS;QAClC,OAAO,IAAI,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,SAAgB,gBAAgB,CAAC,KAAU;QACzC,OAAO,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAFe,0BAAgB,mBAE/B,CAAA;IAED;;;OAGG;IACH,SAAgB,QAAQ,CAAC,GAAQ;QAC/B,IAAI,OAAO,GAAG,KAAK,SAAS,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,QAAQ;YAChF,OAAO,GAAG,CAAC;QAEb,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,OAAO,SAAS,CAAC;QAEnB,mDAAmD;QACnD,IAAI,OAAO,GAAG,CAAC,MAAM,KAAK,WAAW;YACnC,OAAO,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAEhC,yCAAyC;QACzC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC;QACb,CAAC;QAED,wBAAwB;QACxB,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,MAAM,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC/C,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YACzC,IAAI,YAAY,KAAK,SAAS;gBAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IA3Be,kBAAQ,WA2BvB,CAAA;AAEH,CAAC,EA3IgB,SAAS,yBAAT,SAAS,QA2IzB","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 Json\r\n */\r\n\r\n/** Utility functions for converting from JSON objects, with default values.\r\n * @public\r\n */\r\nexport namespace JsonUtils {\r\n  /** Get a value as a boolean.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to boolean\r\n   * @returns the value of json as a boolean, or default value\r\n   */\r\n  export function asBool(json: any, defaultVal = false): boolean {\r\n    return isNullOrUndefined(json) ? defaultVal : !!json;\r\n  }\r\n  /** Get a value as an integer.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to integer\r\n   * @returns the value of json as an integer, or default value\r\n   */\r\n  export function asInt(json: any, defaultVal = 0): number {\r\n    return (typeof json === \"number\") ? Math.trunc(json) : defaultVal;\r\n  }\r\n  /** Get a value as a double.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to double\r\n   * @returns the value of json as a double, or default value\r\n   */\r\n  export function asDouble(json: any, defaultVal = 0): number {\r\n    return (typeof json === \"number\") ? json : defaultVal;\r\n  }\r\n  /** Get a value as a string.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to string\r\n   * @returns the value of json as a string, or default value\r\n   */\r\n  export function asString(json: any, defaultVal = \"\"): string {\r\n    return isNullOrUndefined(json) ? defaultVal : json.toString();\r\n  }\r\n\r\n  /** Get a value as an array.\r\n   * @param json the input JSON object\r\n   * @returns the input JSON object if it is an array, otherwise undefined\r\n   */\r\n  export function asArray(json: any): any {\r\n    return Array.isArray(json) ? json : undefined;\r\n  }\r\n\r\n  /** Get a value as an object.\r\n   * @param json the input JSON object\r\n   * @returns the input JSON object if it is an object, otherwise undefined\r\n   */\r\n  export function asObject(json: any): any {\r\n    return \"object\" === typeof json ? json : undefined;\r\n  }\r\n\r\n  /** Set or remove a number on a json object, given a key name, a value, and a default value. Sets `json[key] = val` if val is *not* equal to the default,\r\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\r\n   * @param json the JSON object to affect\r\n   * @param key the name of the member to set or remove\r\n   * @param val the value to set\r\n   * @param defaultVal the default value.\r\n   */\r\n  export function setOrRemoveNumber(json: any, key: string, val: number, defaultVal: number) {\r\n    if (val === defaultVal)\r\n      delete json[key];\r\n    else\r\n      json[key] = val;\r\n  }\r\n\r\n  /** Set or remove a boolean on a json object, given a key name, a value, and a default value. Sets `json[key] = val` if val is *not* equal to the default,\r\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\r\n   * @param json the JSON object to affect\r\n   * @param key the name of the member to set or remove\r\n   * @param val the value to set\r\n   * @param defaultVal the default value.\r\n   */\r\n  export function setOrRemoveBoolean(json: any, key: string, val: boolean, defaultVal: boolean) {\r\n    if (val === defaultVal)\r\n      delete json[key];\r\n    else\r\n      json[key] = val;\r\n  }\r\n\r\n  /** Determine if a Javascript object is equivalent to `{}`.\r\n   * @param json The JSON object to test.\r\n   * @returns true if `json` is an Object with no keys.\r\n   */\r\n  export function isEmptyObject(json: any): boolean {\r\n    return \"object\" === typeof json && 0 === Object.keys(json).length;\r\n  }\r\n\r\n  /** Determine if the input is undefined or an empty Javascript object.\r\n   * @param json The JSON object to test.\r\n   * @returns true if `json` is undefined or is an Object with no keys (equivalent to `{}`).\r\n   */\r\n  export function isEmptyObjectOrUndefined(json: any): boolean {\r\n    return undefined === json || isEmptyObject(json);\r\n  }\r\n\r\n  function isNullOrUndefined(json: any): boolean {\r\n    return null === json || undefined === json;\r\n  }\r\n\r\n  /** Determine if the input is a non-empty Javascript object.\r\n   * @param value The value to test.\r\n   * @returns true if `value` is an Object with at least one key.\r\n   */\r\n  export function isNonEmptyObject(value: any): value is Object {\r\n    return !isEmptyObjectOrUndefined(value);\r\n  }\r\n\r\n  /**\r\n   * Convert the input object into a \"pure\" JavaScript object, with only instances of \"object\" or primitives in the returned value.\r\n   * Works recursively for object members, and over arrays entries. Calls \"toJSON\" on any members that implement it.\r\n   */\r\n  export function toObject(val: any): any {\r\n    if (typeof val === \"boolean\" || typeof val === \"number\" || typeof val === \"string\")\r\n      return val;\r\n\r\n    if (typeof val !== \"object\")\r\n      return undefined;\r\n\r\n    // See if the object has toJSON() function defined.\r\n    if (typeof val.toJSON !== \"undefined\")\r\n      return toObject(val.toJSON());\r\n\r\n    // if it's an array, convert each member.\r\n    if (Array.isArray(val)) {\r\n      const arr = new Array(val.length);\r\n      val.forEach((el, i) => arr[i] = toObject(el));\r\n      return arr;\r\n    }\r\n\r\n    // Convert each property\r\n    const out: any = {};\r\n    Object.getOwnPropertyNames(val).forEach((prop) => {\r\n      const transformVal = toObject(val[prop]);\r\n      if (transformVal !== undefined)\r\n        out[prop] = transformVal;\r\n    });\r\n\r\n    return out;\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"JsonUtils.js","sourceRoot":"","sources":["../../src/JsonUtils.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;GAEG;AACH,IAAiB,SAAS,CA2IzB;AA3ID,WAAiB,SAAS;IACxB;;;;OAIG;IACH,SAAgB,MAAM,CAAC,IAAS,EAAE,UAAU,GAAG,KAAK;QAClD,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC;IAFe,gBAAM,SAErB,CAAA;IACD;;;;OAIG;IACH,SAAgB,KAAK,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC;QAC7C,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;IACpE,CAAC;IAFe,eAAK,QAEpB,CAAA;IACD;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC;QAChD,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;IACxD,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IACD;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,EAAE;QACjD,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAChE,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IAED;;;OAGG;IACH,SAAgB,OAAO,CAAC,IAAS;QAC/B,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IAChD,CAAC;IAFe,iBAAO,UAEtB,CAAA;IAED;;;OAGG;IACH,SAAgB,QAAQ,CAAC,IAAS;QAChC,OAAO,QAAQ,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACrD,CAAC;IAFe,kBAAQ,WAEvB,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAW,EAAE,UAAkB;QACvF,IAAI,GAAG,KAAK,UAAU;YACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;YAEjB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IALe,2BAAiB,oBAKhC,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,kBAAkB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAY,EAAE,UAAmB;QAC1F,IAAI,GAAG,KAAK,UAAU;YACpB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;YAEjB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IALe,4BAAkB,qBAKjC,CAAA;IAED;;;OAGG;IACH,SAAgB,aAAa,CAAC,IAAS;QACrC,OAAO,QAAQ,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IACpE,CAAC;IAFe,uBAAa,gBAE5B,CAAA;IAED;;;OAGG;IACH,SAAgB,wBAAwB,CAAC,IAAS;QAChD,OAAO,SAAS,KAAK,IAAI,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC;IAFe,kCAAwB,2BAEvC,CAAA;IAED,SAAS,iBAAiB,CAAC,IAAS;QAClC,OAAO,IAAI,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,SAAgB,gBAAgB,CAAC,KAAU;QACzC,OAAO,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAFe,0BAAgB,mBAE/B,CAAA;IAED;;;OAGG;IACH,SAAgB,QAAQ,CAAC,GAAQ;QAC/B,IAAI,OAAO,GAAG,KAAK,SAAS,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,QAAQ;YAChF,OAAO,GAAG,CAAC;QAEb,IAAI,OAAO,GAAG,KAAK,QAAQ;YACzB,OAAO,SAAS,CAAC;QAEnB,mDAAmD;QACnD,IAAI,OAAO,GAAG,CAAC,MAAM,KAAK,WAAW;YACnC,OAAO,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAEhC,yCAAyC;QACzC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,OAAO,GAAG,CAAC;QACb,CAAC;QAED,wBAAwB;QACxB,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,MAAM,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC/C,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YACzC,IAAI,YAAY,KAAK,SAAS;gBAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,CAAC;IACb,CAAC;IA3Be,kBAAQ,WA2BvB,CAAA;AAEH,CAAC,EA3IgB,SAAS,yBAAT,SAAS,QA2IzB","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 Json\r\n */\r\n\r\n/** Utility functions for converting from JSON objects, with default values.\r\n * @public\r\n */\r\nexport namespace JsonUtils {\r\n  /** Get a value as a boolean.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to boolean\r\n   * @returns the value of json as a boolean, or default value\r\n   */\r\n  export function asBool(json: any, defaultVal = false): boolean {\r\n    return isNullOrUndefined(json) ? defaultVal : !!json;\r\n  }\r\n  /** Get a value as an integer.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to integer\r\n   * @returns the value of json as an integer, or default value\r\n   */\r\n  export function asInt(json: any, defaultVal = 0): number {\r\n    return (typeof json === \"number\") ? Math.trunc(json) : defaultVal;\r\n  }\r\n  /** Get a value as a double.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to double\r\n   * @returns the value of json as a double, or default value\r\n   */\r\n  export function asDouble(json: any, defaultVal = 0): number {\r\n    return (typeof json === \"number\") ? json : defaultVal;\r\n  }\r\n  /** Get a value as a string.\r\n   * @param json the input JSON object\r\n   * @param defaultVal default value if json cannot be converted to string\r\n   * @returns the value of json as a string, or default value\r\n   */\r\n  export function asString(json: any, defaultVal = \"\"): string {\r\n    return isNullOrUndefined(json) ? defaultVal : json.toString();\r\n  }\r\n\r\n  /** Get a value as an array.\r\n   * @param json the input JSON object\r\n   * @returns the input JSON object if it is an array, otherwise undefined\r\n   */\r\n  export function asArray(json: any): any {\r\n    return Array.isArray(json) ? json : undefined;\r\n  }\r\n\r\n  /** Get a value as an object.\r\n   * @param json the input JSON object\r\n   * @returns the input JSON object if it is an object, otherwise undefined\r\n   */\r\n  export function asObject(json: any): any {\r\n    return \"object\" === typeof json ? json : undefined;\r\n  }\r\n\r\n  /** Set or remove a number on a json object, given a key name, a value, and a default value. Sets `json[key] = val` if val is *not* equal to the default,\r\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\r\n   * @param json the JSON object to affect\r\n   * @param key the name of the member to set or remove\r\n   * @param val the value to set\r\n   * @param defaultVal the default value.\r\n   */\r\n  export function setOrRemoveNumber(json: any, key: string, val: number, defaultVal: number) {\r\n    if (val === defaultVal)\r\n      delete json[key];\r\n    else\r\n      json[key] = val;\r\n  }\r\n\r\n  /** Set or remove a boolean on a json object, given a key name, a value, and a default value. Sets `json[key] = val` if val is *not* equal to the default,\r\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\r\n   * @param json the JSON object to affect\r\n   * @param key the name of the member to set or remove\r\n   * @param val the value to set\r\n   * @param defaultVal the default value.\r\n   */\r\n  export function setOrRemoveBoolean(json: any, key: string, val: boolean, defaultVal: boolean) {\r\n    if (val === defaultVal)\r\n      delete json[key];\r\n    else\r\n      json[key] = val;\r\n  }\r\n\r\n  /** Determine if a Javascript object is equivalent to `{}`.\r\n   * @param json The JSON object to test.\r\n   * @returns true if `json` is an Object with no keys.\r\n   */\r\n  export function isEmptyObject(json: any): boolean {\r\n    return \"object\" === typeof json && 0 === Object.keys(json).length;\r\n  }\r\n\r\n  /** Determine if the input is undefined or an empty Javascript object.\r\n   * @param json The JSON object to test.\r\n   * @returns true if `json` is undefined or is an Object with no keys (equivalent to `{}`).\r\n   */\r\n  export function isEmptyObjectOrUndefined(json: any): boolean {\r\n    return undefined === json || isEmptyObject(json);\r\n  }\r\n\r\n  function isNullOrUndefined(json: any): boolean {\r\n    return null === json || undefined === json;\r\n  }\r\n\r\n  /** Determine if the input is a non-empty Javascript object.\r\n   * @param value The value to test.\r\n   * @returns true if `value` is an Object with at least one key.\r\n   */\r\n  export function isNonEmptyObject(value: any): value is object {\r\n    return !isEmptyObjectOrUndefined(value);\r\n  }\r\n\r\n  /**\r\n   * Convert the input object into a \"pure\" JavaScript object, with only instances of \"object\" or primitives in the returned value.\r\n   * Works recursively for object members, and over arrays entries. Calls \"toJSON\" on any members that implement it.\r\n   */\r\n  export function toObject(val: any): any {\r\n    if (typeof val === \"boolean\" || typeof val === \"number\" || typeof val === \"string\")\r\n      return val;\r\n\r\n    if (typeof val !== \"object\")\r\n      return undefined;\r\n\r\n    // See if the object has toJSON() function defined.\r\n    if (typeof val.toJSON !== \"undefined\")\r\n      return toObject(val.toJSON());\r\n\r\n    // if it's an array, convert each member.\r\n    if (Array.isArray(val)) {\r\n      const arr = new Array(val.length);\r\n      val.forEach((el, i) => arr[i] = toObject(el));\r\n      return arr;\r\n    }\r\n\r\n    // Convert each property\r\n    const out: any = {};\r\n    Object.getOwnPropertyNames(val).forEach((prop) => {\r\n      const transformVal = toObject(val[prop]);\r\n      if (transformVal !== undefined)\r\n        out[prop] = transformVal;\r\n    });\r\n\r\n    return out;\r\n  }\r\n\r\n}\r\n"]}

package/lib/cjs/ObservableSet.js.map

@@ -1 +1 @@
-{"version":3,"file":"ObservableSet.js","sourceRoot":"","sources":["../../src/ObservableSet.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,uCAAoC;AAEpC;;GAEG;AACH,MAAa,aAAiB,SAAQ,GAAM;IAQ1C;;OAEG;IACH,YAAmB,QAAkC;QACnD,4EAA4E;QAC5E,KAAK,CAAC,QAAQ,CAAC,CAAC;QAZlB,iDAAiD;QACjC,YAAO,GAAG,IAAI,iBAAO,EAAqB,CAAC;QAC3D,qDAAqD;QACrC,cAAS,GAAG,IAAI,iBAAO,EAAqB,CAAC;QAC7D,qDAAqD;QACrC,cAAS,GAAG,IAAI,iBAAO,EAAc,CAAC;QASpD,IAAI,CAAC,GAAG,GAAG,CAAC,IAAO,EAAE,EAAE;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;YAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBACxB,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAEhC,OAAO,GAAG,CAAC;QACb,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACa,MAAM,CAAC,IAAO;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG;YACL,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAElC,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACa,KAAK;QACnB,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;QAC9B,CAAC;IACH,CAAC;CACF;AA7CD,sCA6CC","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 { BeEvent } from \"./BeEvent\";\r\n\r\n/** A standard [Set<T>](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set) that emits events when its contents change.\r\n * @public\r\n */\r\nexport class ObservableSet<T> extends Set<T> {\r\n  /** Emitted after `item` is added to this set. */\r\n  public readonly onAdded = new BeEvent<(item: T) => void>();\r\n  /** Emitted after `item` is deleted from this set. */\r\n  public readonly onDeleted = new BeEvent<(item: T) => void>();\r\n  /** Emitted after this set's contents are cleared. */\r\n  public readonly onCleared = new BeEvent<() => void>();\r\n\r\n  /** Construct a new ObservableSet.\r\n   * @param elements Optional elements with which to populate the new set.\r\n   */\r\n  public constructor(elements?: Iterable<T> | undefined) {\r\n    // NB: Set constructor will invoke add(). Do not override until initialized.\r\n    super(elements);\r\n\r\n    this.add = (item: T) => { // eslint-disable-line @typescript-eslint/unbound-method\r\n      const prevSize = this.size;\r\n      const ret = super.add(item);\r\n      if (this.size !== prevSize)\r\n        this.onAdded.raiseEvent(item);\r\n\r\n      return ret;\r\n    };\r\n  }\r\n\r\n  /** Invokes [Set.delete](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/delete), raising\r\n   * the [[onDeleted]] event if the item was removed from the set.\r\n   */\r\n  public override delete(item: T): boolean {\r\n    const ret = super.delete(item);\r\n    if (ret)\r\n      this.onDeleted.raiseEvent(item);\r\n\r\n    return ret;\r\n  }\r\n\r\n  /** If this set is not already empty, invokes [Set.clear](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/clear)\r\n   * and raises the [[onCleared]] event.\r\n   */\r\n  public override clear(): void {\r\n    if (0 !== this.size) {\r\n      super.clear();\r\n      this.onCleared.raiseEvent();\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ObservableSet.js","sourceRoot":"","sources":["../../src/ObservableSet.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,uCAAoC;AAEpC;;GAEG;AACH,MAAa,aAAiB,SAAQ,GAAM;IAQ1C;;OAEG;IACH,YAAmB,QAAkC;QACnD,4EAA4E;QAC5E,KAAK,CAAC,QAAQ,CAAC,CAAC;QAZlB,iDAAiD;QACjC,YAAO,GAAG,IAAI,iBAAO,EAAqB,CAAC;QAC3D,qDAAqD;QACrC,cAAS,GAAG,IAAI,iBAAO,EAAqB,CAAC;QAC7D,qDAAqD;QACrC,cAAS,GAAG,IAAI,iBAAO,EAAc,CAAC;QASpD,IAAI,CAAC,GAAG,GAAG,CAAC,IAAO,EAAE,EAAE;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;YAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBACxB,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAEhC,OAAO,GAAG,CAAC;QACb,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACa,MAAM,CAAC,IAAO;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG;YACL,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAElC,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACa,KAAK;QACnB,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;QAC9B,CAAC;IACH,CAAC;CACF;AA7CD,sCA6CC","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 { BeEvent } from \"./BeEvent\";\r\n\r\n/** A standard [Set<T>](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set) that emits events when its contents change.\r\n * @public\r\n */\r\nexport class ObservableSet<T> extends Set<T> {\r\n  /** Emitted after `item` is added to this set. */\r\n  public readonly onAdded = new BeEvent<(item: T) => void>();\r\n  /** Emitted after `item` is deleted from this set. */\r\n  public readonly onDeleted = new BeEvent<(item: T) => void>();\r\n  /** Emitted after this set's contents are cleared. */\r\n  public readonly onCleared = new BeEvent<() => void>();\r\n\r\n  /** Construct a new ObservableSet.\r\n   * @param elements Optional elements with which to populate the new set.\r\n   */\r\n  public constructor(elements?: Iterable<T> | undefined) {\r\n    // NB: Set constructor will invoke add(). Do not override until initialized.\r\n    super(elements);\r\n\r\n    this.add = (item: T) => {\r\n      const prevSize = this.size;\r\n      const ret = super.add(item);\r\n      if (this.size !== prevSize)\r\n        this.onAdded.raiseEvent(item);\r\n\r\n      return ret;\r\n    };\r\n  }\r\n\r\n  /** Invokes [Set.delete](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/delete), raising\r\n   * the [[onDeleted]] event if the item was removed from the set.\r\n   */\r\n  public override delete(item: T): boolean {\r\n    const ret = super.delete(item);\r\n    if (ret)\r\n      this.onDeleted.raiseEvent(item);\r\n\r\n    return ret;\r\n  }\r\n\r\n  /** If this set is not already empty, invokes [Set.clear](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set/clear)\r\n   * and raises the [[onCleared]] event.\r\n   */\r\n  public override clear(): void {\r\n    if (0 !== this.size) {\r\n      super.clear();\r\n      this.onCleared.raiseEvent();\r\n    }\r\n  }\r\n}\r\n"]}