@itwin/core-bentley 3.0.0-dev.84 → 3.0.0-dev.88

package/lib/esm/IndexMap.js.map

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

package/lib/esm/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,MAAM,KAAW,SAAS,CAmHzB;AAnHD,WAAiB,SAAS;IACxB;;;;OAIG;IACH,SAAgB,MAAM,CAAC,IAAS,EAAE,UAAU,GAAG,KAAK,IAAa,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAAxG,gBAAM,SAAkG,CAAA;IACxH;;;;OAIG;IACH,SAAgB,KAAK,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC,IAAY,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAA/G,eAAK,QAA0G,CAAA;IAC/H;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC,IAAY,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAAtG,kBAAQ,WAA8F,CAAA;IACtH;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,EAAE,IAAY,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAA/G,kBAAQ,WAAuG,CAAA;IAE/H;;;OAGG;IACH,SAAgB,OAAO,CAAC,IAAS,IAAS,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAA1E,iBAAO,UAAmE,CAAA;IAE1F;;;OAGG;IACH,SAAgB,QAAQ,CAAC,IAAS,IAAS,OAAO,QAAQ,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAAhF,kBAAQ,WAAwE,CAAA;IAEhG;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAW,EAAE,UAAkB,IAAI,IAAI,GAAG,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;QAAM,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAA9I,2BAAiB,oBAA6H,CAAA;IAE9J;;;;;;OAMG;IACH,SAAgB,kBAAkB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAY,EAAE,UAAmB,IAAI,IAAI,GAAG,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;QAAM,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAAjJ,4BAAkB,qBAA+H,CAAA;IAEjK;;;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,IAAa,OAAO,IAAI,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC;IAE9F;;;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;YACtB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,GAAG,CAAC;SACZ;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,EAnHgB,SAAS,KAAT,SAAS,QAmHzB","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Utils\n */\n\n/** Utility functions for converting from JSON objects, with default values.\n * @public\n */\nexport namespace JsonUtils {\n  /** Get a value as a boolean.\n   * @param json the input JSON object\n   * @param defaultVal default value if json cannot be converted to boolean\n   * @returns the value of json as a boolean, or default value\n   */\n  export function asBool(json: any, defaultVal = false): boolean { return isNullOrUndefined(json) ? defaultVal : !!json; }\n  /** Get a value as an integer.\n   * @param json the input JSON object\n   * @param defaultVal default value if json cannot be converted to integer\n   * @returns the value of json as an integer, or default value\n   */\n  export function asInt(json: any, defaultVal = 0): number { return (typeof json === \"number\") ? Math.trunc(json) : defaultVal; }\n  /** Get a value as a double.\n   * @param json the input JSON object\n   * @param defaultVal default value if json cannot be converted to double\n   * @returns the value of json as a double, or default value\n   */\n  export function asDouble(json: any, defaultVal = 0): number { return (typeof json === \"number\") ? json : defaultVal; }\n  /** Get a value as a string.\n   * @param json the input JSON object\n   * @param defaultVal default value if json cannot be converted to string\n   * @returns the value of json as a string, or default value\n   */\n  export function asString(json: any, defaultVal = \"\"): string { return isNullOrUndefined(json) ? defaultVal : json.toString(); }\n\n  /** Get a value as an array.\n   * @param json the input JSON object\n   * @returns the input JSON object if it is an array, otherwise undefined\n   */\n  export function asArray(json: any): any { return Array.isArray(json) ? json : undefined; }\n\n  /** Get a value as an object.\n   * @param json the input JSON object\n   * @returns the input JSON object if it is an object, otherwise undefined\n   */\n  export function asObject(json: any): any { return \"object\" === typeof json ? json : undefined; }\n\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,\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\n   * @param json the JSON object to affect\n   * @param key the name of the member to set or remove\n   * @param val the value to set\n   * @param defaultVal the default value.\n   */\n  export function setOrRemoveNumber(json: any, key: string, val: number, defaultVal: number) { if (val === defaultVal) delete json[key]; else json[key] = val; }\n\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,\n   * otherwise `delete json[key]`. This is used to omit values from JSON strings that are of known defaults.\n   * @param json the JSON object to affect\n   * @param key the name of the member to set or remove\n   * @param val the value to set\n   * @param defaultVal the default value.\n   */\n  export function setOrRemoveBoolean(json: any, key: string, val: boolean, defaultVal: boolean) { if (val === defaultVal) delete json[key]; else json[key] = val; }\n\n  /** Determine if a Javascript object is equivalent to `{}`.\n   * @param json The JSON object to test.\n   * @returns true if `json` is an Object with no keys.\n   */\n  export function isEmptyObject(json: any): boolean {\n    return \"object\" === typeof json && 0 === Object.keys(json).length;\n  }\n\n  /** Determine if the input is undefined or an empty Javascript object.\n   * @param json The JSON object to test.\n   * @returns true if `json` is undefined or is an Object with no keys (equivalent to `{}`).\n   */\n  export function isEmptyObjectOrUndefined(json: any): boolean {\n    return undefined === json || isEmptyObject(json);\n  }\n\n  function isNullOrUndefined(json: any): boolean { return null === json || undefined === json; }\n\n  /** Determine if the input is a non-empty Javascript object.\n   * @param value The value to test.\n   * @returns true if `value` is an Object with at least one key.\n   */\n  export function isNonEmptyObject(value: any): value is Object {\n    return !isEmptyObjectOrUndefined(value);\n  }\n\n  /**\n   * Convert the input object into a \"pure\" JavaScript object, with only instances of \"object\" or primitives in the returned value.\n   * Works recursively for object members, and over arrays entries. Calls \"toJSON\" on any members that implement it.\n   */\n  export function toObject(val: any): any {\n    if (typeof val === \"boolean\" || typeof val === \"number\" || typeof val === \"string\")\n      return val;\n\n    if (typeof val !== \"object\")\n      return undefined;\n\n    // See if the object has toJSON() function defined.\n    if (typeof val.toJSON !== \"undefined\")\n      return toObject(val.toJSON());\n\n    // if it's an array, convert each member.\n    if (Array.isArray(val)) {\n      const arr = new Array(val.length);\n      val.forEach((el, i) => { arr[i] = toObject(el); });\n      return arr;\n    }\n\n    // Convert each property\n    const out: any = {};\n    Object.getOwnPropertyNames(val).forEach((prop) => {\n      const transformVal = toObject(val[prop]);\n      if (transformVal !== undefined)\n        out[prop] = transformVal;\n    });\n\n    return out;\n  }\n\n}\n"]}
+{"version":3,"file":"JsonUtils.js","sourceRoot":"","sources":["../../src/JsonUtils.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;GAEG;AACH,MAAM,KAAW,SAAS,CAmHzB;AAnHD,WAAiB,SAAS;IACxB;;;;OAIG;IACH,SAAgB,MAAM,CAAC,IAAS,EAAE,UAAU,GAAG,KAAK,IAAa,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAAxG,gBAAM,SAAkG,CAAA;IACxH;;;;OAIG;IACH,SAAgB,KAAK,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC,IAAY,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAA/G,eAAK,QAA0G,CAAA;IAC/H;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,CAAC,IAAY,OAAO,CAAC,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAAtG,kBAAQ,WAA8F,CAAA;IACtH;;;;OAIG;IACH,SAAgB,QAAQ,CAAC,IAAS,EAAE,UAAU,GAAG,EAAE,IAAY,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAA/G,kBAAQ,WAAuG,CAAA;IAE/H;;;OAGG;IACH,SAAgB,OAAO,CAAC,IAAS,IAAS,OAAO,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAA1E,iBAAO,UAAmE,CAAA;IAE1F;;;OAGG;IACH,SAAgB,QAAQ,CAAC,IAAS,IAAS,OAAO,QAAQ,KAAK,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAAhF,kBAAQ,WAAwE,CAAA;IAEhG;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAW,EAAE,UAAkB,IAAI,IAAI,GAAG,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;QAAM,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAA9I,2BAAiB,oBAA6H,CAAA;IAE9J;;;;;;OAMG;IACH,SAAgB,kBAAkB,CAAC,IAAS,EAAE,GAAW,EAAE,GAAY,EAAE,UAAmB,IAAI,IAAI,GAAG,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;;QAAM,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAAjJ,4BAAkB,qBAA+H,CAAA;IAEjK;;;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,IAAa,OAAO,IAAI,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC;IAE9F;;;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;YACtB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,GAAG,CAAC;SACZ;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,EAnHgB,SAAS,KAAT,SAAS,QAmHzB","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/** 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 { return isNullOrUndefined(json) ? defaultVal : !!json; }\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 { return (typeof json === \"number\") ? Math.trunc(json) : defaultVal; }\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 { return (typeof json === \"number\") ? json : defaultVal; }\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 { return isNullOrUndefined(json) ? defaultVal : json.toString(); }\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 { return Array.isArray(json) ? json : undefined; }\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 { return \"object\" === typeof json ? json : undefined; }\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) { if (val === defaultVal) delete json[key]; else json[key] = val; }\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) { if (val === defaultVal) delete json[key]; else json[key] = val; }\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 { return null === json || undefined === json; }\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/esm/LRUMap.js.map

@@ -1 +1 @@
-{"version":3,"file":"LRUMap.js","sourceRoot":"","sources":["../../src/LRUMap.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;;GAIG;AAEH;;GAEG;AACH,MAAM,OAAO,KAAK;IAGhB,YAAmB,GAAM,EAAS,KAAQ;QAAvB,QAAG,GAAH,GAAG,CAAG;QAAS,UAAK,GAAL,KAAK,CAAG;IAAI,CAAC;CAChD;AAED,MAAM,aAAa;IAEjB,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,MAAM,GAAG,GAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IACrC,CAAC;CACF;AAED,MAAM,WAAW;IAEf,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACzC,CAAC;CACF;AAED,MAAM,aAAa;IAEjB,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;IAC3C,CAAC;CACF;AAeD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,QAAQ;IAenB;;OAEG;IACH,YAAmB,KAAa,EAAE,SAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAEO,eAAe,CAAC,KAAkB;QACxC,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM;YACvB,OAAO,CAAC,sEAAsE;QAEhF,yBAAyB;QACzB,sBAAsB;QACtB,yBAAyB;QACzB,oBAAoB;QACpB,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE;gBACzB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;aAC3B;YACD,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;SAC7C;QACD,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;SAC7C;QACD,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,QAAQ;QACjC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW;QACtC,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,WAAW;SACvC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,wGAAwG;IACjG,MAAM,CAAC,OAAyB;QACrC,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,CAAC;QAC3C,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtC,KAAK,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE;YACpD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,EAAE;gBACV,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;aACjB;iBAAM;gBACL,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;gBAChB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;aACjB;YACD,KAAK,GAAG,CAAC,CAAC;YACV,IAAI,KAAK,EAAE,KAAK,CAAC,EAAE;gBACjB,MAAM,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC;aAC7B;SACF;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IACnC,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM;QACf,8BAA8B;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO,CAAC,qBAAqB;QAC/B,2EAA2E;QAC3E,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM,EAAE,KAAQ;QACzB,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,KAAK,EAAE;YACT,kBAAkB;YAClB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;SACb;QAED,YAAY;QACZ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAE1D,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC1B,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;SAC3B;aAAM;YACL,iBAAiB;YACjB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;SACrB;QAED,+EAA+E;QAC/E,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,EAAE,IAAI,CAAC,IAAI,CAAC;QACZ,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE;YAC1B,sCAAsC;YACtC,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,KAAK;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,KAAK,EAAE;YACT,IAAI,KAAK,CAAC,KAAK,EAAE;gBACf,mBAAmB;gBACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;aAC/B;iBAAM;gBACL,yBAAyB;gBACzB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACxB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;aACzB;YACD,2EAA2E;YAC3E,wBAAwB;YACxB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClC,EAAE,IAAI,CAAC,IAAI,CAAC;YACZ,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;SACjC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,GAAM;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IACjC,CAAC;IAED,oFAAoF;IAC7E,GAAG,CAAC,GAAM;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,GAAM;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE;YAC9B,+CAA+C;YAC/C,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YAChC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACjC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE;YACtB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;SAC3B;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE;YACtB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;SAC3B;aAAM,EAAE,+DAA+D;YACtE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;SACvC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,2BAA2B;IACpB,KAAK;QACV,6EAA6E;QAC7E,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,mEAAmE;IAC5D,IAAI;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAED,qEAAqE;IAC9D,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,kEAAkE;IAC3D,OAAO,CAAC,GAAkD,EAAE,OAAa;QAC9E,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;YAC/B,OAAO,GAAG,IAAI,CAAC;SAChB;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE;YACZ,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACrB;IACH,CAAC;IAED,4CAA4C;IACrC,MAAM;QACX,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE;YACZ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACrB;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sCAAsC;IAC/B,QAAQ;QACb,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE;YACZ,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3C,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YACpB,IAAI,KAAK,EAAE;gBACT,CAAC,IAAI,KAAK,CAAC;aACZ;SACF;QACD,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,MAAa,SAAQ,QAAc;IAC9C;;OAEG;IACH,YAAY,KAAa;QACvB,KAAK,CAAC,KAAK,EAAE,IAAI,GAAG,EAAkB,CAAC,CAAC;IAC1C,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,aAAoB,SAAQ,QAAc;IACrD;;;;OAIG;IACH,YAAY,KAAa,EAAE,WAAiC;QAC1D,KAAK,CAAC,KAAK,EAAE,IAAI,UAAU,CAAiB,WAAW,CAAC,CAAC,CAAC;IAC5D,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Collections\n */\n\nimport { OrderedComparator } from \"./Compare\";\nimport { Dictionary } from \"./Dictionary\";\n\n/**\n * Derived from:\n * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>\n * See README.md at https://github.com/rsms/js-lru for details.\n */\n\n/** An entry holds the key and value, and pointers to any older and newer entries.\n * @public\n */\nexport class Entry<K, V> {\n  public newer?: Entry<K, V>;\n  public older?: Entry<K, V>;\n  constructor(public key: K, public value: V) { }\n}\n\nclass EntryIterator<K, V> implements Iterator<[K, V] | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    const val: [K, V] = [ent.key, ent.value];\n    return { done: false, value: val };\n  }\n}\n\nclass KeyIterator<K, V> implements Iterator<K | undefined>  {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.key };\n  }\n}\n\nclass ValueIterator<K, V> implements Iterator<V | undefined> {\n  private _entry: Entry<K, V> | undefined;\n  constructor(oldestEntry: Entry<K, V>) {\n    this._entry = oldestEntry;\n  }\n  public next() {\n    const ent = this._entry;\n    if (!ent)\n      return { done: true, value: undefined };\n    this._entry = ent.newer;\n    return { done: false, value: ent.value };\n  }\n}\n\n/** The interface that must be satisfied by the underlying container type used by a LRUCache.\n * Compatible with a [[Dictionary]] or a standard Map.\n * @public\n */\nexport interface EntryContainer<K, V> {\n  readonly size: number;\n  clear(): void;\n  get(key: K): Entry<K, V> | undefined;\n  set(key: K, value: Entry<K, V>): void;\n  has(key: K): boolean;\n  delete(key: K): void;\n}\n\n/**\n * A mapping of a key/value pairs, where the size of the cache can be limited.\n *\n * When entries are inserted, if the cache is \"full\", the\n * least-recently-used (LRU) value is dropped. When entries are retrieved, they are moved to the front of the LRU list.\n *\n * Illustration of the design:\n *\n * ```\n *\n *       entry             entry             entry             entry\n *       ______            ______            ______            ______\n *      | head |.newer => |      |.newer => |      |.newer => | tail |\n *      |  A   |          |  B   |          |  C   |          |  D   |\n *      |______| <= older.|______| <= older.|______| <= older.|______|\n *\n *  removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added\n * ```\n * @public\n */\nexport class LRUCache<K, V> {\n  private _container: EntryContainer<K, V>;\n\n  /** Current number of items */\n  public size: number;\n\n  /** Maximum number of items this cache can hold */\n  public limit: number;\n\n  /** Least recently-used entry. Invalidated when cache is modified. */\n  public oldest?: Entry<K, V>;\n\n  /** Most recently-used entry. Invalidated when cache is modified. */\n  public newest?: Entry<K, V>;\n\n  /**\n   * Construct a new LRUCache to hold up to `limit` entries.\n   */\n  public constructor(limit: number, container: EntryContainer<K, V>) {\n    this.size = 0;\n    this.limit = limit;\n    this.oldest = this.newest = undefined;\n    this._container = container;\n  }\n\n  private markEntryAsUsed(entry: Entry<K, V>) {\n    if (entry === this.newest)\n      return; // Already the most recently used entry, so no need to update the list\n\n    // HEAD--------------TAIL\n    //   <.older   .newer>\n    //  <--- add direction --\n    //   A  B  C  <D>  E\n    if (entry.newer) {\n      if (entry === this.oldest) {\n        this.oldest = entry.newer;\n      }\n      entry.newer.older = entry.older; // C <-- E.\n    }\n    if (entry.older) {\n      entry.older.newer = entry.newer; // C. --> E\n    }\n    entry.newer = undefined; // D --x\n    entry.older = this.newest; // D. --> E\n    if (this.newest) {\n      this.newest.newer = entry; // E. <-- D\n    }\n    this.newest = entry;\n  }\n\n  /**  Replace all values in this cache with key-value pairs (2-element Arrays) from provided iterable. */\n  public assign(entries: Iterable<[K, V]>): void {\n    let entry;\n    let limit = this.limit || Number.MAX_VALUE;\n    this._container.clear();\n    const it = entries[Symbol.iterator]();\n    for (let itv = it.next(); !itv.done; itv = it.next()) {\n      const e = new Entry(itv.value[0], itv.value[1]);\n      this._container.set(e.key, e);\n      if (!entry) {\n        this.oldest = e;\n      } else {\n        entry.newer = e;\n        e.older = entry;\n      }\n      entry = e;\n      if (limit-- === 0) {\n        throw new Error(\"overflow\");\n      }\n    }\n    this.newest = entry;\n    this.size = this._container.size;\n  }\n\n  /** Get and register recent use of <key>.\n   *  Returns the value associated with <key> or undefined if not in cache.\n   */\n  public get(key: K): V | undefined {\n    // First, find our cache entry\n    const entry = this._container.get(key);\n    if (!entry)\n      return; // Not cached. Sorry.\n    // As <key> was found in the cache, register it as being requested recently\n    this.markEntryAsUsed(entry);\n    return entry.value;\n  }\n\n  /** Put <value> into the cache associated with <key>. Replaces any existing entry with the same key.\n   *  @returns `this`.\n   */\n  public set(key: K, value: V): LRUCache<K, V> {\n    let entry = this._container.get(key);\n    if (entry) {\n      // update existing\n      entry.value = value;\n      this.markEntryAsUsed(entry);\n      return this;\n    }\n\n    // new entry\n    this._container.set(key, (entry = new Entry(key, value)));\n\n    if (this.newest) {\n      // link previous tail to the new tail (entry)\n      this.newest.newer = entry;\n      entry.older = this.newest;\n    } else {\n      // we're first in\n      this.oldest = entry;\n    }\n\n    // add new entry to the end of the linked list -- it is now the freshest entry.\n    this.newest = entry;\n    ++this.size;\n    if (this.size > this.limit) {\n      // we hit the limit -- remove the head\n      this.shift();\n    }\n    return this;\n  }\n\n  /**  Purge the least recently used (oldest) entry from the cache.\n   *  @returns The removed entry or undefined if the cache was empty.\n   */\n  public shift(): [K, V] | undefined {\n    const entry = this.oldest;\n    if (entry) {\n      if (entry.newer) {\n        // advance the list\n        this.oldest = entry.newer;\n        this.oldest.older = undefined;\n      } else {\n        // the cache is exhausted\n        this.oldest = undefined;\n        this.newest = undefined;\n      }\n      // Remove last strong reference to <entry> and remove links from the purged\n      // entry being returned:\n      entry.newer = entry.older = undefined;\n      this._container.delete(entry.key);\n      --this.size;\n      return [entry.key, entry.value];\n    }\n    return undefined;\n  }\n\n  /** Access value for `key` without registering recent use. Useful if you do not\n   *  want to change the state of the cache, but only \"peek\" at it.\n   *  @returns The value associated with `key` if found, or undefined if not found.\n   */\n  public find(key: K): V | undefined {\n    const e = this._container.get(key);\n    return e ? e.value : undefined;\n  }\n\n  /** Check if there's a value for key in the cache without registering recent use. */\n  public has(key: K): boolean {\n    return this._container.has(key);\n  }\n\n  /**  Remove entry `key` from cache and return its value.\n   *  @returns The removed value, or undefined if not found.\n   */\n  public delete(key: K): V | undefined {\n    const entry = this._container.get(key);\n    if (!entry) return;\n    this._container.delete(entry.key);\n    if (entry.newer && entry.older) {\n      // re-link the older entry with the newer entry\n      entry.older.newer = entry.newer;\n      entry.newer.older = entry.older;\n    } else if (entry.newer) {\n      // remove the link to us\n      entry.newer.older = undefined;\n      // link the newer entry to head\n      this.oldest = entry.newer;\n    } else if (entry.older) {\n      // remove the link to us\n      entry.older.newer = undefined;\n      // link the newer entry to head\n      this.newest = entry.older;\n    } else { // if(entry.older === undefined && entry.newer === undefined) {\n      this.oldest = this.newest = undefined;\n    }\n\n    this.size--;\n    return entry.value;\n  }\n\n  /**  Removes all entries */\n  public clear(): void {\n    // Note: clearing links should be safe, as we don't expose live links to user\n    this.oldest = this.newest = undefined;\n    this.size = 0;\n    this._container.clear();\n  }\n\n  /** Returns an iterator over all keys, starting with the oldest. */\n  public keys(): Iterator<K | undefined> | undefined {\n    return this.oldest ? new KeyIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all values, starting with the oldest. */\n  public values(): Iterator<V | undefined> | undefined {\n    return this.oldest ? new ValueIterator(this.oldest) : undefined;\n  }\n\n  /** Returns an iterator over all entries, starting with the oldest. */\n  public entries(): Iterator<[K, V] | undefined> | undefined {\n    return this.oldest ? new EntryIterator(this.oldest) : undefined;\n  }\n\n  /**  Call `fun` for each entry, starting with the oldest entry. */\n  public forEach(fun: (value: V, key: K, m: LRUCache<K, V>) => void, thisObj?: any): void {\n    if (typeof thisObj !== \"object\") {\n      thisObj = this;\n    }\n    let entry = this.oldest;\n    while (entry) {\n      fun.call(thisObj, entry.value, entry.key, this);\n      entry = entry.newer;\n    }\n  }\n\n  /** Returns a JSON (array) representation */\n  public toJSON(): Array<{ key: K, value: V }> {\n    const s = new Array(this.size);\n    let i = 0;\n    let entry = this.oldest;\n    while (entry) {\n      s[i++] = { key: entry.key, value: entry.value };\n      entry = entry.newer;\n    }\n    return s;\n  }\n\n  /** Returns a String representation */\n  public toString(): string {\n    let s = \"\";\n    let entry = this.oldest;\n    while (entry) {\n      s += `${String(entry.key)}:${entry.value}`;\n      entry = entry.newer;\n      if (entry) {\n        s += \" < \";\n      }\n    }\n    return s;\n  }\n}\n\n/** A [[LRUCache]] using a standard Map as its internal storage.\n * @public\n */\nexport class LRUMap<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUMap to hold up to `limit` entries.\n   */\n  constructor(limit: number) {\n    super(limit, new Map<K, Entry<K, V>>());\n  }\n}\n\n/** A [[LRUCache]] using a [[Dictionary]] as its internal storage, permitting custom key comparison logic.\n * @public\n */\nexport class LRUDictionary<K, V> extends LRUCache<K, V> {\n  /**\n   * Construct a new LRUDictionary to hold up to `limit` entries.\n   * @param limit The maximum number of entries permitted in the dictionary.\n   * @param compareKeys The function used to compare keys within the dictionary.\n   */\n  constructor(limit: number, compareKeys: OrderedComparator<K>) {\n    super(limit, new Dictionary<K, Entry<K, V>>(compareKeys));\n  }\n}\n"]}
+{"version":3,"file":"LRUMap.js","sourceRoot":"","sources":["../../src/LRUMap.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;;GAIG;AAEH;;GAEG;AACH,MAAM,OAAO,KAAK;IAGhB,YAAmB,GAAM,EAAS,KAAQ;QAAvB,QAAG,GAAH,GAAG,CAAG;QAAS,UAAK,GAAL,KAAK,CAAG;IAAI,CAAC;CAChD;AAED,MAAM,aAAa;IAEjB,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,MAAM,GAAG,GAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IACrC,CAAC;CACF;AAED,MAAM,WAAW;IAEf,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACzC,CAAC;CACF;AAED,MAAM,aAAa;IAEjB,YAAY,WAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;IACM,IAAI;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;IAC3C,CAAC;CACF;AAeD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,QAAQ;IAenB;;OAEG;IACH,YAAmB,KAAa,EAAE,SAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAEO,eAAe,CAAC,KAAkB;QACxC,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM;YACvB,OAAO,CAAC,sEAAsE;QAEhF,yBAAyB;QACzB,sBAAsB;QACtB,yBAAyB;QACzB,oBAAoB;QACpB,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE;gBACzB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;aAC3B;YACD,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;SAC7C;QACD,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW;SAC7C;QACD,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,QAAQ;QACjC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW;QACtC,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,WAAW;SACvC;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,wGAAwG;IACjG,MAAM,CAAC,OAAyB;QACrC,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,CAAC;QAC3C,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtC,KAAK,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE;YACpD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,EAAE;gBACV,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;aACjB;iBAAM;gBACL,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;gBAChB,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;aACjB;YACD,KAAK,GAAG,CAAC,CAAC;YACV,IAAI,KAAK,EAAE,KAAK,CAAC,EAAE;gBACjB,MAAM,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC;aAC7B;SACF;QACD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IACnC,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM;QACf,8BAA8B;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YACR,OAAO,CAAC,qBAAqB;QAC/B,2EAA2E;QAC3E,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,GAAG,CAAC,GAAM,EAAE,KAAQ;QACzB,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,KAAK,EAAE;YACT,kBAAkB;YAClB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;SACb;QAED,YAAY;QACZ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAE1D,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;YAC1B,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;SAC3B;aAAM;YACL,iBAAiB;YACjB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;SACrB;QAED,+EAA+E;QAC/E,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,EAAE,IAAI,CAAC,IAAI,CAAC;QACZ,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE;YAC1B,sCAAsC;YACtC,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,KAAK;QACV,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,KAAK,EAAE;YACT,IAAI,KAAK,CAAC,KAAK,EAAE;gBACf,mBAAmB;gBACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;aAC/B;iBAAM;gBACL,yBAAyB;gBACzB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACxB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;aACzB;YACD,2EAA2E;YAC3E,wBAAwB;YACxB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClC,EAAE,IAAI,CAAC,IAAI,CAAC;YACZ,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;SACjC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,GAAM;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IACjC,CAAC;IAED,oFAAoF;IAC7E,GAAG,CAAC,GAAM;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,GAAM;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE;YAC9B,+CAA+C;YAC/C,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YAChC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACjC;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE;YACtB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;SAC3B;aAAM,IAAI,KAAK,CAAC,KAAK,EAAE;YACtB,wBAAwB;YACxB,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,SAAS,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;SAC3B;aAAM,EAAE,+DAA+D;YACtE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;SACvC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED,2BAA2B;IACpB,KAAK;QACV,6EAA6E;QAC7E,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,mEAAmE;IAC5D,IAAI;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAED,qEAAqE;IAC9D,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,kEAAkE;IAC3D,OAAO,CAAC,GAAkD,EAAE,OAAa;QAC9E,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;YAC/B,OAAO,GAAG,IAAI,CAAC;SAChB;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE;YACZ,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACrB;IACH,CAAC;IAED,4CAA4C;IACrC,MAAM;QACX,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE;YACZ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;YAChD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACrB;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sCAAsC;IAC/B,QAAQ;QACb,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,KAAK,EAAE;YACZ,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3C,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YACpB,IAAI,KAAK,EAAE;gBACT,CAAC,IAAI,KAAK,CAAC;aACZ;SACF;QACD,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,MAAa,SAAQ,QAAc;IAC9C;;OAEG;IACH,YAAY,KAAa;QACvB,KAAK,CAAC,KAAK,EAAE,IAAI,GAAG,EAAkB,CAAC,CAAC;IAC1C,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,aAAoB,SAAQ,QAAc;IACrD;;;;OAIG;IACH,YAAY,KAAa,EAAE,WAAiC;QAC1D,KAAK,CAAC,KAAK,EAAE,IAAI,UAAU,CAAiB,WAAW,CAAC,CAAC,CAAC;IAC5D,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Collections\r\n */\r\n\r\nimport { OrderedComparator } from \"./Compare\";\r\nimport { Dictionary } from \"./Dictionary\";\r\n\r\n/**\r\n * Derived from:\r\n * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>\r\n * See README.md at https://github.com/rsms/js-lru for details.\r\n */\r\n\r\n/** An entry holds the key and value, and pointers to any older and newer entries.\r\n * @public\r\n */\r\nexport class Entry<K, V> {\r\n  public newer?: Entry<K, V>;\r\n  public older?: Entry<K, V>;\r\n  constructor(public key: K, public value: V) { }\r\n}\r\n\r\nclass EntryIterator<K, V> implements Iterator<[K, V] | undefined> {\r\n  private _entry: Entry<K, V> | undefined;\r\n  constructor(oldestEntry: Entry<K, V>) {\r\n    this._entry = oldestEntry;\r\n  }\r\n  public next() {\r\n    const ent = this._entry;\r\n    if (!ent)\r\n      return { done: true, value: undefined };\r\n    this._entry = ent.newer;\r\n    const val: [K, V] = [ent.key, ent.value];\r\n    return { done: false, value: val };\r\n  }\r\n}\r\n\r\nclass KeyIterator<K, V> implements Iterator<K | undefined>  {\r\n  private _entry: Entry<K, V> | undefined;\r\n  constructor(oldestEntry: Entry<K, V>) {\r\n    this._entry = oldestEntry;\r\n  }\r\n  public next() {\r\n    const ent = this._entry;\r\n    if (!ent)\r\n      return { done: true, value: undefined };\r\n    this._entry = ent.newer;\r\n    return { done: false, value: ent.key };\r\n  }\r\n}\r\n\r\nclass ValueIterator<K, V> implements Iterator<V | undefined> {\r\n  private _entry: Entry<K, V> | undefined;\r\n  constructor(oldestEntry: Entry<K, V>) {\r\n    this._entry = oldestEntry;\r\n  }\r\n  public next() {\r\n    const ent = this._entry;\r\n    if (!ent)\r\n      return { done: true, value: undefined };\r\n    this._entry = ent.newer;\r\n    return { done: false, value: ent.value };\r\n  }\r\n}\r\n\r\n/** The interface that must be satisfied by the underlying container type used by a LRUCache.\r\n * Compatible with a [[Dictionary]] or a standard Map.\r\n * @public\r\n */\r\nexport interface EntryContainer<K, V> {\r\n  readonly size: number;\r\n  clear(): void;\r\n  get(key: K): Entry<K, V> | undefined;\r\n  set(key: K, value: Entry<K, V>): void;\r\n  has(key: K): boolean;\r\n  delete(key: K): void;\r\n}\r\n\r\n/**\r\n * A mapping of a key/value pairs, where the size of the cache can be limited.\r\n *\r\n * When entries are inserted, if the cache is \"full\", the\r\n * least-recently-used (LRU) value is dropped. When entries are retrieved, they are moved to the front of the LRU list.\r\n *\r\n * Illustration of the design:\r\n *\r\n * ```\r\n *\r\n *       entry             entry             entry             entry\r\n *       ______            ______            ______            ______\r\n *      | head |.newer => |      |.newer => |      |.newer => | tail |\r\n *      |  A   |          |  B   |          |  C   |          |  D   |\r\n *      |______| <= older.|______| <= older.|______| <= older.|______|\r\n *\r\n *  removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added\r\n * ```\r\n * @public\r\n */\r\nexport class LRUCache<K, V> {\r\n  private _container: EntryContainer<K, V>;\r\n\r\n  /** Current number of items */\r\n  public size: number;\r\n\r\n  /** Maximum number of items this cache can hold */\r\n  public limit: number;\r\n\r\n  /** Least recently-used entry. Invalidated when cache is modified. */\r\n  public oldest?: Entry<K, V>;\r\n\r\n  /** Most recently-used entry. Invalidated when cache is modified. */\r\n  public newest?: Entry<K, V>;\r\n\r\n  /**\r\n   * Construct a new LRUCache to hold up to `limit` entries.\r\n   */\r\n  public constructor(limit: number, container: EntryContainer<K, V>) {\r\n    this.size = 0;\r\n    this.limit = limit;\r\n    this.oldest = this.newest = undefined;\r\n    this._container = container;\r\n  }\r\n\r\n  private markEntryAsUsed(entry: Entry<K, V>) {\r\n    if (entry === this.newest)\r\n      return; // Already the most recently used entry, so no need to update the list\r\n\r\n    // HEAD--------------TAIL\r\n    //   <.older   .newer>\r\n    //  <--- add direction --\r\n    //   A  B  C  <D>  E\r\n    if (entry.newer) {\r\n      if (entry === this.oldest) {\r\n        this.oldest = entry.newer;\r\n      }\r\n      entry.newer.older = entry.older; // C <-- E.\r\n    }\r\n    if (entry.older) {\r\n      entry.older.newer = entry.newer; // C. --> E\r\n    }\r\n    entry.newer = undefined; // D --x\r\n    entry.older = this.newest; // D. --> E\r\n    if (this.newest) {\r\n      this.newest.newer = entry; // E. <-- D\r\n    }\r\n    this.newest = entry;\r\n  }\r\n\r\n  /**  Replace all values in this cache with key-value pairs (2-element Arrays) from provided iterable. */\r\n  public assign(entries: Iterable<[K, V]>): void {\r\n    let entry;\r\n    let limit = this.limit || Number.MAX_VALUE;\r\n    this._container.clear();\r\n    const it = entries[Symbol.iterator]();\r\n    for (let itv = it.next(); !itv.done; itv = it.next()) {\r\n      const e = new Entry(itv.value[0], itv.value[1]);\r\n      this._container.set(e.key, e);\r\n      if (!entry) {\r\n        this.oldest = e;\r\n      } else {\r\n        entry.newer = e;\r\n        e.older = entry;\r\n      }\r\n      entry = e;\r\n      if (limit-- === 0) {\r\n        throw new Error(\"overflow\");\r\n      }\r\n    }\r\n    this.newest = entry;\r\n    this.size = this._container.size;\r\n  }\r\n\r\n  /** Get and register recent use of <key>.\r\n   *  Returns the value associated with <key> or undefined if not in cache.\r\n   */\r\n  public get(key: K): V | undefined {\r\n    // First, find our cache entry\r\n    const entry = this._container.get(key);\r\n    if (!entry)\r\n      return; // Not cached. Sorry.\r\n    // As <key> was found in the cache, register it as being requested recently\r\n    this.markEntryAsUsed(entry);\r\n    return entry.value;\r\n  }\r\n\r\n  /** Put <value> into the cache associated with <key>. Replaces any existing entry with the same key.\r\n   *  @returns `this`.\r\n   */\r\n  public set(key: K, value: V): LRUCache<K, V> {\r\n    let entry = this._container.get(key);\r\n    if (entry) {\r\n      // update existing\r\n      entry.value = value;\r\n      this.markEntryAsUsed(entry);\r\n      return this;\r\n    }\r\n\r\n    // new entry\r\n    this._container.set(key, (entry = new Entry(key, value)));\r\n\r\n    if (this.newest) {\r\n      // link previous tail to the new tail (entry)\r\n      this.newest.newer = entry;\r\n      entry.older = this.newest;\r\n    } else {\r\n      // we're first in\r\n      this.oldest = entry;\r\n    }\r\n\r\n    // add new entry to the end of the linked list -- it is now the freshest entry.\r\n    this.newest = entry;\r\n    ++this.size;\r\n    if (this.size > this.limit) {\r\n      // we hit the limit -- remove the head\r\n      this.shift();\r\n    }\r\n    return this;\r\n  }\r\n\r\n  /**  Purge the least recently used (oldest) entry from the cache.\r\n   *  @returns The removed entry or undefined if the cache was empty.\r\n   */\r\n  public shift(): [K, V] | undefined {\r\n    const entry = this.oldest;\r\n    if (entry) {\r\n      if (entry.newer) {\r\n        // advance the list\r\n        this.oldest = entry.newer;\r\n        this.oldest.older = undefined;\r\n      } else {\r\n        // the cache is exhausted\r\n        this.oldest = undefined;\r\n        this.newest = undefined;\r\n      }\r\n      // Remove last strong reference to <entry> and remove links from the purged\r\n      // entry being returned:\r\n      entry.newer = entry.older = undefined;\r\n      this._container.delete(entry.key);\r\n      --this.size;\r\n      return [entry.key, entry.value];\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /** Access value for `key` without registering recent use. Useful if you do not\r\n   *  want to change the state of the cache, but only \"peek\" at it.\r\n   *  @returns The value associated with `key` if found, or undefined if not found.\r\n   */\r\n  public find(key: K): V | undefined {\r\n    const e = this._container.get(key);\r\n    return e ? e.value : undefined;\r\n  }\r\n\r\n  /** Check if there's a value for key in the cache without registering recent use. */\r\n  public has(key: K): boolean {\r\n    return this._container.has(key);\r\n  }\r\n\r\n  /**  Remove entry `key` from cache and return its value.\r\n   *  @returns The removed value, or undefined if not found.\r\n   */\r\n  public delete(key: K): V | undefined {\r\n    const entry = this._container.get(key);\r\n    if (!entry) return;\r\n    this._container.delete(entry.key);\r\n    if (entry.newer && entry.older) {\r\n      // re-link the older entry with the newer entry\r\n      entry.older.newer = entry.newer;\r\n      entry.newer.older = entry.older;\r\n    } else if (entry.newer) {\r\n      // remove the link to us\r\n      entry.newer.older = undefined;\r\n      // link the newer entry to head\r\n      this.oldest = entry.newer;\r\n    } else if (entry.older) {\r\n      // remove the link to us\r\n      entry.older.newer = undefined;\r\n      // link the newer entry to head\r\n      this.newest = entry.older;\r\n    } else { // if(entry.older === undefined && entry.newer === undefined) {\r\n      this.oldest = this.newest = undefined;\r\n    }\r\n\r\n    this.size--;\r\n    return entry.value;\r\n  }\r\n\r\n  /**  Removes all entries */\r\n  public clear(): void {\r\n    // Note: clearing links should be safe, as we don't expose live links to user\r\n    this.oldest = this.newest = undefined;\r\n    this.size = 0;\r\n    this._container.clear();\r\n  }\r\n\r\n  /** Returns an iterator over all keys, starting with the oldest. */\r\n  public keys(): Iterator<K | undefined> | undefined {\r\n    return this.oldest ? new KeyIterator(this.oldest) : undefined;\r\n  }\r\n\r\n  /** Returns an iterator over all values, starting with the oldest. */\r\n  public values(): Iterator<V | undefined> | undefined {\r\n    return this.oldest ? new ValueIterator(this.oldest) : undefined;\r\n  }\r\n\r\n  /** Returns an iterator over all entries, starting with the oldest. */\r\n  public entries(): Iterator<[K, V] | undefined> | undefined {\r\n    return this.oldest ? new EntryIterator(this.oldest) : undefined;\r\n  }\r\n\r\n  /**  Call `fun` for each entry, starting with the oldest entry. */\r\n  public forEach(fun: (value: V, key: K, m: LRUCache<K, V>) => void, thisObj?: any): void {\r\n    if (typeof thisObj !== \"object\") {\r\n      thisObj = this;\r\n    }\r\n    let entry = this.oldest;\r\n    while (entry) {\r\n      fun.call(thisObj, entry.value, entry.key, this);\r\n      entry = entry.newer;\r\n    }\r\n  }\r\n\r\n  /** Returns a JSON (array) representation */\r\n  public toJSON(): Array<{ key: K, value: V }> {\r\n    const s = new Array(this.size);\r\n    let i = 0;\r\n    let entry = this.oldest;\r\n    while (entry) {\r\n      s[i++] = { key: entry.key, value: entry.value };\r\n      entry = entry.newer;\r\n    }\r\n    return s;\r\n  }\r\n\r\n  /** Returns a String representation */\r\n  public toString(): string {\r\n    let s = \"\";\r\n    let entry = this.oldest;\r\n    while (entry) {\r\n      s += `${String(entry.key)}:${entry.value}`;\r\n      entry = entry.newer;\r\n      if (entry) {\r\n        s += \" < \";\r\n      }\r\n    }\r\n    return s;\r\n  }\r\n}\r\n\r\n/** A [[LRUCache]] using a standard Map as its internal storage.\r\n * @public\r\n */\r\nexport class LRUMap<K, V> extends LRUCache<K, V> {\r\n  /**\r\n   * Construct a new LRUMap to hold up to `limit` entries.\r\n   */\r\n  constructor(limit: number) {\r\n    super(limit, new Map<K, Entry<K, V>>());\r\n  }\r\n}\r\n\r\n/** A [[LRUCache]] using a [[Dictionary]] as its internal storage, permitting custom key comparison logic.\r\n * @public\r\n */\r\nexport class LRUDictionary<K, V> extends LRUCache<K, V> {\r\n  /**\r\n   * Construct a new LRUDictionary to hold up to `limit` entries.\r\n   * @param limit The maximum number of entries permitted in the dictionary.\r\n   * @param compareKeys The function used to compare keys within the dictionary.\r\n   */\r\n  constructor(limit: number, compareKeys: OrderedComparator<K>) {\r\n    super(limit, new Dictionary<K, Entry<K, V>>(compareKeys));\r\n  }\r\n}\r\n"]}

package/lib/esm/Logger.js.map

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

package/lib/esm/OrderedSet.js.map

@@ -1 +1 @@
-{"version":3,"file":"OrderedSet.js","sourceRoot":"","sources":["../../src/OrderedSet.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAiB,YAAY,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAEzE;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IAG7B;;;OAGG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QACtF,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAI,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC1D,CAAC;IAED,yCAAyC;IACzC,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,qDAAqD;IAC9C,GAAG,CAAC,KAAQ;QACjB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED,6HAA6H;IACtH,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,UAAc,SAAQ,kBAAqB;IACtD;;;OAGG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QACtF,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,wCAAwC;IACjC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,8DAA8D;IACvD,GAAG,CAAC,KAAQ;QACjB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6FAA6F;IACtF,MAAM,CAAC,KAAQ;QACpB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Collections\n */\n\nimport { OrderedComparator } from \"./Compare\";\nimport { CloneFunction, shallowClone, SortedArray } from \"./SortedArray\";\n\n/** A read-only equivalent of `Set<T>` that maintains its elements in sorted order as specified by a comparison function.\n * Iteration returns elements in the order specified by the comparison function, as opposed to `Set` which returns elements in insertion order.\n * Implemented in terms of [[SortedArray]].\n * @public\n */\nexport class ReadonlyOrderedSet<T> implements Iterable<T> {\n  protected readonly _array: SortedArray<T>;\n\n  /** Construct a new ReadonlyOrderedSet<T>.\n   * @param compare The function used to compare elements within the set, determining their ordering.\n   * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.\n   */\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\n    this._array = new SortedArray<T>(compare, false, clone);\n  }\n\n  /** The number of elements in the set. */\n  public get size(): number {\n    return this._array.length;\n  }\n\n  /** Returns true if `value` is present in the set. */\n  public has(value: T): boolean {\n    return -1 !== this._array.indexOf(value);\n  }\n\n  /** Iterate over the elements in sorted order (as opposed to `Set`'s iterator, which returns elements in insertion order). */\n  public [Symbol.iterator](): Iterator<T> {\n    return this._array[Symbol.iterator]();\n  }\n}\n\n/** A mutable [[ReadonlyOrderedSet]].\n * @public\n */\nexport class OrderedSet<T> extends ReadonlyOrderedSet<T> {\n  /** Construct a new OrderedSet<T>.\n   * @param compare The function used to compare elements within the set, determining their ordering.\n   * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.\n   */\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\n    super(compare, clone);\n  }\n\n  /** Remove all elements from the set. */\n  public clear(): void {\n    this._array.clear();\n  }\n\n  /** Add the specified element to the set. Returns this set. */\n  public add(value: T): this {\n    this._array.insert(value);\n    return this;\n  }\n\n  /** Removes the specified element from the set. Returns `true` if the element was present. */\n  public delete(value: T): boolean {\n    return -1 !== this._array.remove(value);\n  }\n}\n"]}
+{"version":3,"file":"OrderedSet.js","sourceRoot":"","sources":["../../src/OrderedSet.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAiB,YAAY,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAEzE;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IAG7B;;;OAGG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QACtF,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAI,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC1D,CAAC;IAED,yCAAyC;IACzC,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,qDAAqD;IAC9C,GAAG,CAAC,KAAQ;QACjB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED,6HAA6H;IACtH,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,UAAc,SAAQ,kBAAqB;IACtD;;;OAGG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QACtF,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,wCAAwC;IACjC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,8DAA8D;IACvD,GAAG,CAAC,KAAQ;QACjB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6FAA6F;IACtF,MAAM,CAAC,KAAQ;QACpB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Collections\r\n */\r\n\r\nimport { OrderedComparator } from \"./Compare\";\r\nimport { CloneFunction, shallowClone, SortedArray } from \"./SortedArray\";\r\n\r\n/** A read-only equivalent of `Set<T>` that maintains its elements in sorted order as specified by a comparison function.\r\n * Iteration returns elements in the order specified by the comparison function, as opposed to `Set` which returns elements in insertion order.\r\n * Implemented in terms of [[SortedArray]].\r\n * @public\r\n */\r\nexport class ReadonlyOrderedSet<T> implements Iterable<T> {\r\n  protected readonly _array: SortedArray<T>;\r\n\r\n  /** Construct a new ReadonlyOrderedSet<T>.\r\n   * @param compare The function used to compare elements within the set, determining their ordering.\r\n   * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.\r\n   */\r\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\r\n    this._array = new SortedArray<T>(compare, false, clone);\r\n  }\r\n\r\n  /** The number of elements in the set. */\r\n  public get size(): number {\r\n    return this._array.length;\r\n  }\r\n\r\n  /** Returns true if `value` is present in the set. */\r\n  public has(value: T): boolean {\r\n    return -1 !== this._array.indexOf(value);\r\n  }\r\n\r\n  /** Iterate over the elements in sorted order (as opposed to `Set`'s iterator, which returns elements in insertion order). */\r\n  public [Symbol.iterator](): Iterator<T> {\r\n    return this._array[Symbol.iterator]();\r\n  }\r\n}\r\n\r\n/** A mutable [[ReadonlyOrderedSet]].\r\n * @public\r\n */\r\nexport class OrderedSet<T> extends ReadonlyOrderedSet<T> {\r\n  /** Construct a new OrderedSet<T>.\r\n   * @param compare The function used to compare elements within the set, determining their ordering.\r\n   * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.\r\n   */\r\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\r\n    super(compare, clone);\r\n  }\r\n\r\n  /** Remove all elements from the set. */\r\n  public clear(): void {\r\n    this._array.clear();\r\n  }\r\n\r\n  /** Add the specified element to the set. Returns this set. */\r\n  public add(value: T): this {\r\n    this._array.insert(value);\r\n    return this;\r\n  }\r\n\r\n  /** Removes the specified element from the set. Returns `true` if the element was present. */\r\n  public delete(value: T): boolean {\r\n    return -1 !== this._array.remove(value);\r\n  }\r\n}\r\n"]}

package/lib/esm/PriorityQueue.js.map

@@ -1 +1 @@
-{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../src/PriorityQueue.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAiB,YAAY,EAAE,MAAM,eAAe,CAAC;AAK5D;;;;GAIG;AACH,MAAM,OAAO,aAAa;IAKxB;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QAV9E,WAAM,GAAQ,EAAE,CAAC;QAWzB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,oDAAoD;IACpD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,4FAA4F;IACrF,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAkB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAExE,KAAK,CAAC,CAAS,EAAE,CAAS;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACxB,CAAC;IAES,QAAQ,CAAC,KAAa;QAC9B,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,OAAO,IAAI,EAAE;YACX,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;YACvB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;gBAChF,SAAS,GAAG,IAAI,CAAC;;gBAEjB,SAAS,GAAG,KAAK,CAAC;YAEpB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC;gBACtF,SAAS,GAAG,KAAK,CAAC;YAEpB,IAAI,SAAS,KAAK,KAAK,EAAE;gBACvB,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBAC7B,KAAK,GAAG,SAAS,CAAC;aACnB;iBAAM;gBACL,MAAM;aACP;SACF;IACH,CAAC;IAED;;;OAGG;IACI,IAAI;QACT,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAClD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,KAAQ;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAExB,OAAO,KAAK,KAAK,CAAC,EAAE;YAClB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE;gBAC9D,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC1B,KAAK,GAAG,MAAM,CAAC;aAChB;iBAAM;gBACL,MAAM;aACP;SACF;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAQ;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2FAA2F;IAC3F,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;;OAGG;IACI,GAAG;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,yCAAyC;IAClC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACO,IAAI,CAAC,KAAa;QAC1B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YACnC,OAAO,SAAS,CAAC;QAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QAErB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACO,KAAK,CAAC,KAAa;QAC3B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YACnC,OAAO,SAAS,CAAC;;YAEjB,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Collections\n */\n\nimport { OrderedComparator } from \"./Compare\";\nimport { CloneFunction, shallowClone } from \"./SortedArray\";\n\n/** @public */\nexport type ComputePriorityFunction<T> = (value: T) => number;\n\n/**\n * A [priority queue](https://en.wikipedia.org/wiki/Priority_queue) implemented as a heap array.\n * The queue is ordered by an [[OrderedComparator]] function supplied by the user such that the value in the queue that compares less than all other values is always located at the front of the queue.\n * @public\n */\nexport class PriorityQueue<T> implements Iterable<T> {\n  protected _array: T[] = [];\n  protected readonly _compare: OrderedComparator<T>;\n  protected readonly _clone: CloneFunction<T>;\n\n  /**\n   * Constructor\n   * @param compare The function used to compare values in the queue. If `compare(x, y)` returns a negative value, then x is placed before y in the queue.\n   * @param clone The function used to clone a value for insertion onto the queue. The default implementation simply returns its input.\n   * @note If the criterion which control the result of the `compare` function changes, then [[PriorityQueue.sort]] should be used to reorder the queue according to the new criterion.\n   */\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\n    this._compare = compare;\n    this._clone = clone;\n  }\n\n  /** The number of values in the queue. */\n  public get length(): number { return this._array.length; }\n\n  /** Returns true if the queue contains no values. */\n  public get isEmpty(): boolean { return 0 === this.length; }\n\n  /** Returns an iterator over the contents of the heap suitable for use in `for-of` loops. */\n  public [Symbol.iterator](): Iterator<T> { return this._array[Symbol.iterator](); }\n\n  protected _swap(a: number, b: number) {\n    const temp = this._array[a];\n    this._array[a] = this._array[b];\n    this._array[b] = temp;\n  }\n\n  protected _heapify(index: number): void {\n    let candidate = -1;\n    while (true) {\n      const right = 2 * (index + 1);\n      const left = right - 1;\n      if (left < this.length && this._compare(this._array[left], this._array[index]) < 0)\n        candidate = left;\n      else\n        candidate = index;\n\n      if (right < this.length && this._compare(this._array[right], this._array[candidate]) < 0)\n        candidate = right;\n\n      if (candidate !== index) {\n        this._swap(candidate, index);\n        index = candidate;\n      } else {\n        break;\n      }\n    }\n  }\n\n  /**\n   * Reorders the queue. This function should only (and *always*) be called when the criteria governing the ordering of items on the queue have changed.\n   * For example, a priority queue containing graphics sorted by their distance from the camera would need to be reordered when the position of the camera changes.\n   */\n  public sort(): void {\n    for (let i = Math.ceil(this.length / 2); i >= 0; i--)\n      this._heapify(i);\n  }\n\n  /**\n   * Pushes a value onto the queue according to the sorting criterion.\n   * @param value The value to insert\n   * @returns The inserted value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.\n   */\n  public push(value: T): T {\n    const clone = this._clone(value);\n\n    let index = this.length;\n    this._array.push(clone);\n\n    while (index !== 0) {\n      const parent = Math.floor((index - 1) / 2);\n      if (this._compare(this._array[index], this._array[parent]) < 0) {\n        this._swap(index, parent);\n        index = parent;\n      } else {\n        break;\n      }\n    }\n\n    return clone;\n  }\n\n  /** Pushes a value onto the back of the queue without making any attempt to enforce ordering.\n   * After using this function, you must manually invoke sort() to ensure the queue is sorted again.\n   * @param value The value to append\n   * @returns The appended value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.\n   */\n  public append(value: T): T {\n    const clone = this._clone(value);\n    this._array.push(clone);\n    return clone;\n  }\n\n  /** Returns the element at the front of the queue, or `undefined` if the queue is empty. */\n  public get front(): T | undefined {\n    return this._peek(0);\n  }\n\n  /**\n   * Removes the front-most element off of the queue and returns it.\n   * @returns The front-most element, or undefined if the queue is empty.\n   */\n  public pop(): T | undefined {\n    return this._pop(0);\n  }\n\n  /** Removes all values from the queue. */\n  public clear(): void {\n    this._array.length = 0;\n  }\n\n  /**\n   * Removes the value at the specified index from the queue and reorders the queue.\n   * @param index The index of the value to remove\n   * @returns the value at the specified index, or undefined if the index is out of range.\n   */\n  protected _pop(index: number): T | undefined {\n    if (index < 0 || index >= this.length)\n      return undefined;\n\n    const root = this._array[index];\n    this._swap(index, this.length - 1);\n    this._array.length--;\n\n    this._heapify(index);\n    return root;\n  }\n\n  /**\n   * Returns the value at the specified index in the queue.\n   * @param index The index of the value to retrieve\n   * @returns the value at the specified index, or undefined if the index is out of range.\n   */\n  protected _peek(index: number): T | undefined {\n    if (index < 0 || index >= this.length)\n      return undefined;\n    else\n      return this._array[index];\n  }\n}\n"]}
+{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../src/PriorityQueue.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAiB,YAAY,EAAE,MAAM,eAAe,CAAC;AAK5D;;;;GAIG;AACH,MAAM,OAAO,aAAa;IAKxB;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QAV9E,WAAM,GAAQ,EAAE,CAAC;QAWzB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,oDAAoD;IACpD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,4FAA4F;IACrF,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAkB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAExE,KAAK,CAAC,CAAS,EAAE,CAAS;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACxB,CAAC;IAES,QAAQ,CAAC,KAAa;QAC9B,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,OAAO,IAAI,EAAE;YACX,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;YACvB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;gBAChF,SAAS,GAAG,IAAI,CAAC;;gBAEjB,SAAS,GAAG,KAAK,CAAC;YAEpB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC;gBACtF,SAAS,GAAG,KAAK,CAAC;YAEpB,IAAI,SAAS,KAAK,KAAK,EAAE;gBACvB,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBAC7B,KAAK,GAAG,SAAS,CAAC;aACnB;iBAAM;gBACL,MAAM;aACP;SACF;IACH,CAAC;IAED;;;OAGG;IACI,IAAI;QACT,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAClD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,KAAQ;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAExB,OAAO,KAAK,KAAK,CAAC,EAAE;YAClB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE;gBAC9D,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC1B,KAAK,GAAG,MAAM,CAAC;aAChB;iBAAM;gBACL,MAAM;aACP;SACF;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAQ;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2FAA2F;IAC3F,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;;OAGG;IACI,GAAG;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,yCAAyC;IAClC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACO,IAAI,CAAC,KAAa;QAC1B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YACnC,OAAO,SAAS,CAAC;QAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QAErB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACO,KAAK,CAAC,KAAa;QAC3B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YACnC,OAAO,SAAS,CAAC;;YAEjB,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Collections\r\n */\r\n\r\nimport { OrderedComparator } from \"./Compare\";\r\nimport { CloneFunction, shallowClone } from \"./SortedArray\";\r\n\r\n/** @public */\r\nexport type ComputePriorityFunction<T> = (value: T) => number;\r\n\r\n/**\r\n * A [priority queue](https://en.wikipedia.org/wiki/Priority_queue) implemented as a heap array.\r\n * The queue is ordered by an [[OrderedComparator]] function supplied by the user such that the value in the queue that compares less than all other values is always located at the front of the queue.\r\n * @public\r\n */\r\nexport class PriorityQueue<T> implements Iterable<T> {\r\n  protected _array: T[] = [];\r\n  protected readonly _compare: OrderedComparator<T>;\r\n  protected readonly _clone: CloneFunction<T>;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param compare The function used to compare values in the queue. If `compare(x, y)` returns a negative value, then x is placed before y in the queue.\r\n   * @param clone The function used to clone a value for insertion onto the queue. The default implementation simply returns its input.\r\n   * @note If the criterion which control the result of the `compare` function changes, then [[PriorityQueue.sort]] should be used to reorder the queue according to the new criterion.\r\n   */\r\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\r\n    this._compare = compare;\r\n    this._clone = clone;\r\n  }\r\n\r\n  /** The number of values in the queue. */\r\n  public get length(): number { return this._array.length; }\r\n\r\n  /** Returns true if the queue contains no values. */\r\n  public get isEmpty(): boolean { return 0 === this.length; }\r\n\r\n  /** Returns an iterator over the contents of the heap suitable for use in `for-of` loops. */\r\n  public [Symbol.iterator](): Iterator<T> { return this._array[Symbol.iterator](); }\r\n\r\n  protected _swap(a: number, b: number) {\r\n    const temp = this._array[a];\r\n    this._array[a] = this._array[b];\r\n    this._array[b] = temp;\r\n  }\r\n\r\n  protected _heapify(index: number): void {\r\n    let candidate = -1;\r\n    while (true) {\r\n      const right = 2 * (index + 1);\r\n      const left = right - 1;\r\n      if (left < this.length && this._compare(this._array[left], this._array[index]) < 0)\r\n        candidate = left;\r\n      else\r\n        candidate = index;\r\n\r\n      if (right < this.length && this._compare(this._array[right], this._array[candidate]) < 0)\r\n        candidate = right;\r\n\r\n      if (candidate !== index) {\r\n        this._swap(candidate, index);\r\n        index = candidate;\r\n      } else {\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Reorders the queue. This function should only (and *always*) be called when the criteria governing the ordering of items on the queue have changed.\r\n   * For example, a priority queue containing graphics sorted by their distance from the camera would need to be reordered when the position of the camera changes.\r\n   */\r\n  public sort(): void {\r\n    for (let i = Math.ceil(this.length / 2); i >= 0; i--)\r\n      this._heapify(i);\r\n  }\r\n\r\n  /**\r\n   * Pushes a value onto the queue according to the sorting criterion.\r\n   * @param value The value to insert\r\n   * @returns The inserted value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.\r\n   */\r\n  public push(value: T): T {\r\n    const clone = this._clone(value);\r\n\r\n    let index = this.length;\r\n    this._array.push(clone);\r\n\r\n    while (index !== 0) {\r\n      const parent = Math.floor((index - 1) / 2);\r\n      if (this._compare(this._array[index], this._array[parent]) < 0) {\r\n        this._swap(index, parent);\r\n        index = parent;\r\n      } else {\r\n        break;\r\n      }\r\n    }\r\n\r\n    return clone;\r\n  }\r\n\r\n  /** Pushes a value onto the back of the queue without making any attempt to enforce ordering.\r\n   * After using this function, you must manually invoke sort() to ensure the queue is sorted again.\r\n   * @param value The value to append\r\n   * @returns The appended value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.\r\n   */\r\n  public append(value: T): T {\r\n    const clone = this._clone(value);\r\n    this._array.push(clone);\r\n    return clone;\r\n  }\r\n\r\n  /** Returns the element at the front of the queue, or `undefined` if the queue is empty. */\r\n  public get front(): T | undefined {\r\n    return this._peek(0);\r\n  }\r\n\r\n  /**\r\n   * Removes the front-most element off of the queue and returns it.\r\n   * @returns The front-most element, or undefined if the queue is empty.\r\n   */\r\n  public pop(): T | undefined {\r\n    return this._pop(0);\r\n  }\r\n\r\n  /** Removes all values from the queue. */\r\n  public clear(): void {\r\n    this._array.length = 0;\r\n  }\r\n\r\n  /**\r\n   * Removes the value at the specified index from the queue and reorders the queue.\r\n   * @param index The index of the value to remove\r\n   * @returns the value at the specified index, or undefined if the index is out of range.\r\n   */\r\n  protected _pop(index: number): T | undefined {\r\n    if (index < 0 || index >= this.length)\r\n      return undefined;\r\n\r\n    const root = this._array[index];\r\n    this._swap(index, this.length - 1);\r\n    this._array.length--;\r\n\r\n    this._heapify(index);\r\n    return root;\r\n  }\r\n\r\n  /**\r\n   * Returns the value at the specified index in the queue.\r\n   * @param index The index of the value to retrieve\r\n   * @returns the value at the specified index, or undefined if the index is out of range.\r\n   */\r\n  protected _peek(index: number): T | undefined {\r\n    if (index < 0 || index >= this.length)\r\n      return undefined;\r\n    else\r\n      return this._array[index];\r\n  }\r\n}\r\n"]}

package/lib/esm/StringUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"StringUtils.js","sourceRoot":"","sources":["../../src/StringUtils.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,oFAAoF;AACpF,0GAA0G;AAC1G,8EAA8E;AAC9E,gBAAgB;AAChB,IAAU,YAAY,CAuGrB;AAvGD,WAAU,YAAY;IACpB,SAAS,OAAO,CAAC,CAAS,EAAE,GAAW,EAAE,GAAW,IAAa,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IAE/F,SAAS,WAAW,CAAC,KAAiB;QACpC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,aAAa,GAAG,IAAI,CAAC;QACzB,IAAI,aAAa,GAAG,IAAI,CAAC;QAEzB,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/B,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAE7B,2DAA2D;YAC3D,IAAI,CAAC,KAAK,WAAW,EAAE;gBACrB,yBAAyB;gBACzB,IAAI,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;oBACpC,2CAA2C;oBAC3C,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;oBAC7B,SAAS;iBACV;gBAED,mBAAmB;gBACnB,IAAI,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;oBACpC,WAAW,GAAG,CAAC,CAAC;oBAChB,SAAS,GAAG,WAAW,GAAG,IAAI,CAAC;oBAC/B,SAAS;iBACV;gBAED,mBAAmB;gBACnB,IAAI,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;oBACpC,IAAI,IAAI,KAAK,WAAW;wBACtB,aAAa,GAAG,IAAI,CAAC;yBAClB,IAAI,IAAI,KAAK,WAAW;wBAC3B,aAAa,GAAG,IAAI,CAAC;oBAEvB,WAAW,GAAG,CAAC,CAAC;oBAChB,SAAS,GAAG,WAAW,GAAG,GAAG,CAAC;oBAC9B,SAAS;iBACV;gBAED,mBAAmB;gBACnB,IAAI,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;oBACpC,IAAI,IAAI,KAAK,WAAW;wBACtB,aAAa,GAAG,IAAI,CAAC;yBAClB,IAAI,IAAI,KAAK,WAAW;wBAC3B,aAAa,GAAG,IAAI,CAAC;oBAEvB,WAAW,GAAG,CAAC,CAAC;oBAChB,SAAS,GAAG,WAAW,GAAG,GAAG,CAAC;oBAC9B,SAAS;iBACV;gBAED,gBAAgB;gBAChB,OAAO,SAAS,CAAC;aAClB;YAED,mGAAmG;YACnG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,aAAa,EAAE,aAAa,CAAC,EAAE;gBACvD,SAAS,GAAG,WAAW,GAAG,SAAS,GAAG,CAAC,CAAC;gBACxC,aAAa,GAAG,IAAI,CAAC;gBACrB,aAAa,GAAG,IAAI,CAAC;gBACrB,EAAE,CAAC,CAAC;gBACJ,SAAS;aACV;YAED,4FAA4F;YAC5F,aAAa,GAAG,IAAI,CAAC;YACrB,aAAa,GAAG,IAAI,CAAC;YAErB,yBAAyB;YACzB,SAAS,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;YAEpD,4EAA4E;YAC5E,EAAE,SAAS,CAAC;YACZ,IAAI,SAAS,KAAK,WAAW,EAAE;gBAC7B,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC3B,SAAS,GAAG,WAAW,GAAG,SAAS,GAAG,CAAC,CAAC;aACzC;SACF;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,SAAgB,sBAAsB,CAAC,IAAgB;QACrD,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,SAAS,KAAK,UAAU;YAC1B,OAAO,SAAS,CAAC;QAEnB,KAAK,IAAI,EAAE,IAAI,UAAU,EAAE;YACzB,IAAI,EAAE,IAAI,MAAM,EAAE;gBAChB,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;aACnC;iBAAM;gBACL,EAAE,IAAI,OAAO,CAAC;gBACd,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC;aAC3E;SACF;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAhBe,mCAAsB,yBAgBrC,CAAA;AACH,CAAC,EAvGS,YAAY,KAAZ,YAAY,QAuGrB;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAgB;IACnD,OAAO,YAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;AACnD,CAAC;AAED,sDAAsD;AACtD,IAAI,oBAAoB,GAAG,IAAI,CAAC;AAEhC;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,IAAgB;IAC3C,IAAI,OAAgC,CAAC;IACrC,IAAI,oBAAoB,EAAE;QACxB,IAAI;YACF,OAAO,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;SACpC;QAAC,OAAO,GAAG,EAAE;YACZ,oBAAoB,GAAG,KAAK,CAAC;SAC9B;KACF;IAED,IAAI,SAAS,KAAK,OAAO;QACvB,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;;QAE5B,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CAAC,MAAc;IACrD,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,8CAA8C;AAC3H,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Utils\n */\n\n// TextDecoder is not supported on all platforms - this is an alternative for utf-8.\n// From https://github.com/AnalyticalGraphicsInc/cesium/blob/master/Source/Core/getStringFromTypedArray.js\n// which is itself inspired by https://github.com/inexorabletash/text-encoding\n/** @internal */\nnamespace Utf8ToString {\n  function inRange(a: number, min: number, max: number): boolean { return min <= a && a <= max; }\n\n  function utf8Handler(bytes: Uint8Array): number[] | undefined {\n    let codePoint = 0;\n    let bytesSeen = 0;\n    let bytesNeeded = 0;\n    let lowerBoundary = 0x80;\n    let upperBoundary = 0xbf;\n\n    const codePoints: number[] = [];\n    const length = bytes.length;\n    for (let i = 0; i < length; i++) {\n      const currentByte = bytes[i];\n\n      // If bytesNeeded = 0, then we are starting a new character\n      if (0 === bytesNeeded) {\n        // 1 byte ascii character\n        if (inRange(currentByte, 0x00, 0x7f)) {\n          // return a code point whose value is byte.\n          codePoints.push(currentByte);\n          continue;\n        }\n\n        // 2 byte character\n        if (inRange(currentByte, 0xc2, 0xdf)) {\n          bytesNeeded = 1;\n          codePoint = currentByte & 0x1f;\n          continue;\n        }\n\n        // 3 byte character\n        if (inRange(currentByte, 0xe0, 0xef)) {\n          if (0xe0 === currentByte)\n            lowerBoundary = 0xa0;\n          else if (0xed === currentByte)\n            upperBoundary = 0x9f;\n\n          bytesNeeded = 2;\n          codePoint = currentByte & 0xf;\n          continue;\n        }\n\n        // 4 byte character\n        if (inRange(currentByte, 0xf0, 0xf4)) {\n          if (0xf0 === currentByte)\n            lowerBoundary = 0x90;\n          else if (0xf4 === currentByte)\n            upperBoundary = 0x8f;\n\n          bytesNeeded = 3;\n          codePoint = currentByte & 0x7;\n          continue;\n        }\n\n        // invalid utf-8\n        return undefined;\n      }\n\n      // out of range so ignore the first part(s) of the character and continue with this byte on its own\n      if (!inRange(currentByte, lowerBoundary, upperBoundary)) {\n        codePoint = bytesNeeded = bytesSeen = 0;\n        lowerBoundary = 0x80;\n        upperBoundary = 0xbf;\n        --i;\n        continue;\n      }\n\n      // set appropriate boundaries since we've now checked byte 2 of a potential longer character\n      lowerBoundary = 0x80;\n      upperBoundary = 0xbf;\n\n      // add byte to code point\n      codePoint = (codePoint << 6) | (currentByte & 0x3f);\n\n      // We have the correct number of bytes, so push and reset for next character\n      ++bytesSeen;\n      if (bytesSeen === bytesNeeded) {\n        codePoints.push(codePoint);\n        codePoint = bytesNeeded = bytesSeen = 0;\n      }\n    }\n\n    return codePoints;\n  }\n\n  export function decodeWithFromCharCode(view: Uint8Array): string | undefined {\n    let result = \"\";\n    const codePoints = utf8Handler(view);\n    if (undefined === codePoints)\n      return undefined;\n\n    for (let cp of codePoints) {\n      if (cp <= 0xffff) {\n        result += String.fromCharCode(cp);\n      } else {\n        cp -= 0x10000;\n        result += String.fromCharCode((cp >> 10) + 0xd800, (cp & 0x3ff) + 0xdc00);\n      }\n    }\n\n    return result;\n  }\n}\n\n/** Exposed only for testing the fall-back used when TextDecoder is unsupported.\n * @internal\n */\nexport function utf8ToStringPolyfill(utf8: Uint8Array): string | undefined {\n  return Utf8ToString.decodeWithFromCharCode(utf8);\n}\n\n// TextDecoder unsupported in Edge at time of writing.\nlet textDecoderSupported = true;\n\n/** Given an array of bytes containing a utf-8 string, convert to a string.\n * @param utf8: An array of utf-8 characters as a byte array\n * @returns An equivalent string, or undefined if the array does not contain a valid utf-8 string.\n * @note This function uses Javascript's TextDecoder if supported by the browser; otherwise, it\n * falls back to a less efficient polyfill.\n * @public\n */\nexport function utf8ToString(utf8: Uint8Array): string | undefined {\n  let decoder: TextDecoder | undefined;\n  if (textDecoderSupported) {\n    try {\n      decoder = new TextDecoder(\"utf-8\");\n    } catch (_ex) {\n      textDecoderSupported = false;\n    }\n  }\n\n  if (undefined !== decoder)\n    return decoder.decode(utf8);\n  else\n    return utf8ToStringPolyfill(utf8);\n}\n\n/** Given a base-64-encoded string, decode it into an array of bytes.\n * @param base64 The base-64-encoded string.\n * @returns the decoded byte array.\n * @throws DOMException if the length of the input string is not a multiple of 4.\n * @public\n */\nexport function base64StringToUint8Array(base64: string): Uint8Array {\n  return new Uint8Array(atob(base64).split(\"\").map((c) => c.charCodeAt(0))); // eslint-disable-line deprecation/deprecation\n}\n"]}
+{"version":3,"file":"StringUtils.js","sourceRoot":"","sources":["../../src/StringUtils.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,oFAAoF;AACpF,0GAA0G;AAC1G,8EAA8E;AAC9E,gBAAgB;AAChB,IAAU,YAAY,CAuGrB;AAvGD,WAAU,YAAY;IACpB,SAAS,OAAO,CAAC,CAAS,EAAE,GAAW,EAAE,GAAW,IAAa,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IAE/F,SAAS,WAAW,CAAC,KAAiB;QACpC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,aAAa,GAAG,IAAI,CAAC;QACzB,IAAI,aAAa,GAAG,IAAI,CAAC;QAEzB,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/B,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAE7B,2DAA2D;YAC3D,IAAI,CAAC,KAAK,WAAW,EAAE;gBACrB,yBAAyB;gBACzB,IAAI,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;oBACpC,2CAA2C;oBAC3C,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;oBAC7B,SAAS;iBACV;gBAED,mBAAmB;gBACnB,IAAI,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;oBACpC,WAAW,GAAG,CAAC,CAAC;oBAChB,SAAS,GAAG,WAAW,GAAG,IAAI,CAAC;oBAC/B,SAAS;iBACV;gBAED,mBAAmB;gBACnB,IAAI,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;oBACpC,IAAI,IAAI,KAAK,WAAW;wBACtB,aAAa,GAAG,IAAI,CAAC;yBAClB,IAAI,IAAI,KAAK,WAAW;wBAC3B,aAAa,GAAG,IAAI,CAAC;oBAEvB,WAAW,GAAG,CAAC,CAAC;oBAChB,SAAS,GAAG,WAAW,GAAG,GAAG,CAAC;oBAC9B,SAAS;iBACV;gBAED,mBAAmB;gBACnB,IAAI,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;oBACpC,IAAI,IAAI,KAAK,WAAW;wBACtB,aAAa,GAAG,IAAI,CAAC;yBAClB,IAAI,IAAI,KAAK,WAAW;wBAC3B,aAAa,GAAG,IAAI,CAAC;oBAEvB,WAAW,GAAG,CAAC,CAAC;oBAChB,SAAS,GAAG,WAAW,GAAG,GAAG,CAAC;oBAC9B,SAAS;iBACV;gBAED,gBAAgB;gBAChB,OAAO,SAAS,CAAC;aAClB;YAED,mGAAmG;YACnG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,aAAa,EAAE,aAAa,CAAC,EAAE;gBACvD,SAAS,GAAG,WAAW,GAAG,SAAS,GAAG,CAAC,CAAC;gBACxC,aAAa,GAAG,IAAI,CAAC;gBACrB,aAAa,GAAG,IAAI,CAAC;gBACrB,EAAE,CAAC,CAAC;gBACJ,SAAS;aACV;YAED,4FAA4F;YAC5F,aAAa,GAAG,IAAI,CAAC;YACrB,aAAa,GAAG,IAAI,CAAC;YAErB,yBAAyB;YACzB,SAAS,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;YAEpD,4EAA4E;YAC5E,EAAE,SAAS,CAAC;YACZ,IAAI,SAAS,KAAK,WAAW,EAAE;gBAC7B,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC3B,SAAS,GAAG,WAAW,GAAG,SAAS,GAAG,CAAC,CAAC;aACzC;SACF;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,SAAgB,sBAAsB,CAAC,IAAgB;QACrD,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,SAAS,KAAK,UAAU;YAC1B,OAAO,SAAS,CAAC;QAEnB,KAAK,IAAI,EAAE,IAAI,UAAU,EAAE;YACzB,IAAI,EAAE,IAAI,MAAM,EAAE;gBAChB,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;aACnC;iBAAM;gBACL,EAAE,IAAI,OAAO,CAAC;gBACd,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC;aAC3E;SACF;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAhBe,mCAAsB,yBAgBrC,CAAA;AACH,CAAC,EAvGS,YAAY,KAAZ,YAAY,QAuGrB;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAgB;IACnD,OAAO,YAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;AACnD,CAAC;AAED,sDAAsD;AACtD,IAAI,oBAAoB,GAAG,IAAI,CAAC;AAEhC;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,IAAgB;IAC3C,IAAI,OAAgC,CAAC;IACrC,IAAI,oBAAoB,EAAE;QACxB,IAAI;YACF,OAAO,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;SACpC;QAAC,OAAO,GAAG,EAAE;YACZ,oBAAoB,GAAG,KAAK,CAAC;SAC9B;KACF;IAED,IAAI,SAAS,KAAK,OAAO;QACvB,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;;QAE5B,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CAAC,MAAc;IACrD,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,8CAA8C;AAC3H,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Utils\r\n */\r\n\r\n// TextDecoder is not supported on all platforms - this is an alternative for utf-8.\r\n// From https://github.com/AnalyticalGraphicsInc/cesium/blob/master/Source/Core/getStringFromTypedArray.js\r\n// which is itself inspired by https://github.com/inexorabletash/text-encoding\r\n/** @internal */\r\nnamespace Utf8ToString {\r\n  function inRange(a: number, min: number, max: number): boolean { return min <= a && a <= max; }\r\n\r\n  function utf8Handler(bytes: Uint8Array): number[] | undefined {\r\n    let codePoint = 0;\r\n    let bytesSeen = 0;\r\n    let bytesNeeded = 0;\r\n    let lowerBoundary = 0x80;\r\n    let upperBoundary = 0xbf;\r\n\r\n    const codePoints: number[] = [];\r\n    const length = bytes.length;\r\n    for (let i = 0; i < length; i++) {\r\n      const currentByte = bytes[i];\r\n\r\n      // If bytesNeeded = 0, then we are starting a new character\r\n      if (0 === bytesNeeded) {\r\n        // 1 byte ascii character\r\n        if (inRange(currentByte, 0x00, 0x7f)) {\r\n          // return a code point whose value is byte.\r\n          codePoints.push(currentByte);\r\n          continue;\r\n        }\r\n\r\n        // 2 byte character\r\n        if (inRange(currentByte, 0xc2, 0xdf)) {\r\n          bytesNeeded = 1;\r\n          codePoint = currentByte & 0x1f;\r\n          continue;\r\n        }\r\n\r\n        // 3 byte character\r\n        if (inRange(currentByte, 0xe0, 0xef)) {\r\n          if (0xe0 === currentByte)\r\n            lowerBoundary = 0xa0;\r\n          else if (0xed === currentByte)\r\n            upperBoundary = 0x9f;\r\n\r\n          bytesNeeded = 2;\r\n          codePoint = currentByte & 0xf;\r\n          continue;\r\n        }\r\n\r\n        // 4 byte character\r\n        if (inRange(currentByte, 0xf0, 0xf4)) {\r\n          if (0xf0 === currentByte)\r\n            lowerBoundary = 0x90;\r\n          else if (0xf4 === currentByte)\r\n            upperBoundary = 0x8f;\r\n\r\n          bytesNeeded = 3;\r\n          codePoint = currentByte & 0x7;\r\n          continue;\r\n        }\r\n\r\n        // invalid utf-8\r\n        return undefined;\r\n      }\r\n\r\n      // out of range so ignore the first part(s) of the character and continue with this byte on its own\r\n      if (!inRange(currentByte, lowerBoundary, upperBoundary)) {\r\n        codePoint = bytesNeeded = bytesSeen = 0;\r\n        lowerBoundary = 0x80;\r\n        upperBoundary = 0xbf;\r\n        --i;\r\n        continue;\r\n      }\r\n\r\n      // set appropriate boundaries since we've now checked byte 2 of a potential longer character\r\n      lowerBoundary = 0x80;\r\n      upperBoundary = 0xbf;\r\n\r\n      // add byte to code point\r\n      codePoint = (codePoint << 6) | (currentByte & 0x3f);\r\n\r\n      // We have the correct number of bytes, so push and reset for next character\r\n      ++bytesSeen;\r\n      if (bytesSeen === bytesNeeded) {\r\n        codePoints.push(codePoint);\r\n        codePoint = bytesNeeded = bytesSeen = 0;\r\n      }\r\n    }\r\n\r\n    return codePoints;\r\n  }\r\n\r\n  export function decodeWithFromCharCode(view: Uint8Array): string | undefined {\r\n    let result = \"\";\r\n    const codePoints = utf8Handler(view);\r\n    if (undefined === codePoints)\r\n      return undefined;\r\n\r\n    for (let cp of codePoints) {\r\n      if (cp <= 0xffff) {\r\n        result += String.fromCharCode(cp);\r\n      } else {\r\n        cp -= 0x10000;\r\n        result += String.fromCharCode((cp >> 10) + 0xd800, (cp & 0x3ff) + 0xdc00);\r\n      }\r\n    }\r\n\r\n    return result;\r\n  }\r\n}\r\n\r\n/** Exposed only for testing the fall-back used when TextDecoder is unsupported.\r\n * @internal\r\n */\r\nexport function utf8ToStringPolyfill(utf8: Uint8Array): string | undefined {\r\n  return Utf8ToString.decodeWithFromCharCode(utf8);\r\n}\r\n\r\n// TextDecoder unsupported in Edge at time of writing.\r\nlet textDecoderSupported = true;\r\n\r\n/** Given an array of bytes containing a utf-8 string, convert to a string.\r\n * @param utf8: An array of utf-8 characters as a byte array\r\n * @returns An equivalent string, or undefined if the array does not contain a valid utf-8 string.\r\n * @note This function uses Javascript's TextDecoder if supported by the browser; otherwise, it\r\n * falls back to a less efficient polyfill.\r\n * @public\r\n */\r\nexport function utf8ToString(utf8: Uint8Array): string | undefined {\r\n  let decoder: TextDecoder | undefined;\r\n  if (textDecoderSupported) {\r\n    try {\r\n      decoder = new TextDecoder(\"utf-8\");\r\n    } catch (_ex) {\r\n      textDecoderSupported = false;\r\n    }\r\n  }\r\n\r\n  if (undefined !== decoder)\r\n    return decoder.decode(utf8);\r\n  else\r\n    return utf8ToStringPolyfill(utf8);\r\n}\r\n\r\n/** Given a base-64-encoded string, decode it into an array of bytes.\r\n * @param base64 The base-64-encoded string.\r\n * @returns the decoded byte array.\r\n * @throws DOMException if the length of the input string is not a multiple of 4.\r\n * @public\r\n */\r\nexport function base64StringToUint8Array(base64: string): Uint8Array {\r\n  return new Uint8Array(atob(base64).split(\"\").map((c) => c.charCodeAt(0))); // eslint-disable-line deprecation/deprecation\r\n}\r\n"]}

package/lib/esm/Time.js.map

@@ -1 +1 @@
-{"version":3,"file":"Time.js","sourceRoot":"","sources":["../../src/Time.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;GAGG;AACH,MAAM,OAAO,UAAU;IAErB,YAAoB,eAAuB,CAAC,IAAI,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC;IAEpF,mCAAmC;IACnC,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACxD,IAAW,OAAO,KAAK,OAAO,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACI,MAAM,CAAC,WAAW,CAAC,OAAe,IAAI,OAAO,IAAI,UAAU,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrF;;OAEG;IACI,MAAM,CAAC,gBAAgB,CAAC,YAAoB,IAAI,OAAO,IAAI,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC7F,qDAAqD;IACrD,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC;IACxD,8DAA8D;IAC9D,IAAW,eAAe,KAAc,OAAO,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC;IACxE,4DAA4D;IAC5D,IAAW,aAAa,KAAc,OAAO,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,8EAA8E;IACvE,KAAK,CAAC,KAAiB,IAAgB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAChH,sEAAsE;IAC/D,IAAI,CAAC,KAAiB,IAAgB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAE/G;;;OAGG;IACI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAU;QACjC,OAAO,IAAI,OAAO,CAAO,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAI,EAAU,EAAE,OAAuB;QAC7D,IAAI,OAAY,CAAC;QACjB,MAAM,WAAW,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YAChD,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;YACvD,IAAI,OAAO;gBACT,YAAY,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,IAAI;QACf,OAAO,IAAI,OAAO,CAAO,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACtF,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,YAAY,CAAI,EAAyB,EAAE,KAAW,EAAE,GAAG,IAAW;QACjF,OAAO,IAAI,OAAO,CAAI,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAChH,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,WAAW;IAItB,YAAoB,YAAoB,IAAI,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC;IAFhF,gGAAgG;IAChG,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAGxD,2CAA2C;IACpC,MAAM,CAAC,GAAG,KAAK,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAE3D;;OAEG;IACI,MAAM,CAAC,OAAO,CAAC,GAAe,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEjG;;OAEG;IACI,MAAM,CAAC,SAAS,CAAC,GAAe,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEnG,uHAAuH;IACvH,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAE5E,mIAAmI;IACnI,IAAW,QAAQ,KAAc,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAE1E;;OAEG;IACI,MAAM,CAAC,KAAkB,IAAa,OAAO,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAE/F;;OAEG;IACI,KAAK,CAAC,KAAkB,IAAa,OAAO,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAE9F;;OAEG;IACI,KAAK,CAAC,QAAoB,IAAiB,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEvH;;OAEG;IACI,IAAI,CAAC,QAAoB,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;CAC1G;AAED;;GAEG;AACH,MAAM,OAAO,SAAS;IAWpB;;;OAGG;IACH,YAAmB,WAAoB,EAAE,gBAAgB,GAAG,KAAK;QAA9C,gBAAW,GAAX,WAAW,CAAS;QAA8B,IAAI,gBAAgB;YAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IAAC,CAAC;IAZ1G,6DAA6D;IAC7D,IAAW,OAAO,KAAiB,OAAO,UAAU,CAAC,gBAAgB,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzJ,0EAA0E;IAC1E,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE,qEAAqE;IACrE,IAAW,OAAO,KAAiB,OAAO,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpM,mFAAmF;IACnF,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IAMpE,yFAAyF;IAClF,KAAK,KAAW,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACvE,mEAAmE;IAC5D,IAAI,KAAiB,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAClF,0BAA0B;IACnB,KAAK,KAAW,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;CAC/D","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Utils\n */\n\n/** A duration of time. Can be either positive (towards future) or negative (in the past).\n * BeDurations are immutable.\n * @public\n */\nexport class BeDuration {\n  private readonly _milliseconds: number;\n  private constructor(milliseconds: number = 0) { this._milliseconds = milliseconds; }\n\n  /** The duration in milliseconds */\n  public get milliseconds() { return this._milliseconds; }\n  public get seconds() { return this._milliseconds / 1000; }\n\n  /** Create a BeDuration from seconds.\n   * @param seconds the number of seconds for this BeDuration\n   */\n  public static fromSeconds(seconds: number) { return new BeDuration(seconds * 1000); }\n  /** Create a BeDuration from milliseconds.\n   * @param milliseconds the number of milliseconds for this BeDuration\n   */\n  public static fromMilliseconds(milliseconds: number) { return new BeDuration(milliseconds); }\n  /** Determine whether this BeDuration is 0 seconds */\n  public get isZero() { return this._milliseconds === 0; }\n  /** Determine whether this BeDuration is towards the future */\n  public get isTowardsFuture(): boolean { return this._milliseconds > 0; }\n  /** Determine whether this BeDuration is towards the past */\n  public get isTowardsPast(): boolean { return this._milliseconds < 0; }\n  /** Subtract a BeDuration from this BeDuration, returning a new BeDuration. */\n  public minus(other: BeDuration): BeDuration { return new BeDuration(this._milliseconds - other._milliseconds); }\n  /** Add a BeDuration to this BeDuration, returning a new BeDuration */\n  public plus(other: BeDuration): BeDuration { return new BeDuration(this._milliseconds + other._milliseconds); }\n\n  /** Utility function to just wait for the specified time\n   * @param ms Duration in milliseconds to wait\n   * @return Promise that resolves after the specified wait period\n   */\n  public static async wait(ms: number): Promise<void> {\n    return new Promise<void>((resolve: any) => setTimeout(resolve, ms));\n  }\n\n  /** Utility function to wait for either the specified time or a promise, whichever resolves first\n   * @param ms Maximum duration in milliseconds to wait\n   * @param promise A pending promise to wait for\n   * @return Promise that resolves after the specified wait period or the provided promise resolves, whichever comes first\n   */\n  public static async race<T>(ms: number, promise: PromiseLike<T>): Promise<T | void> {\n    let timeout: any;\n    const waitPromise = new Promise<void>((resolve) => {\n      timeout = setTimeout(resolve, ms);\n    });\n    return Promise.race([waitPromise, promise]).finally(() => {\n      if (timeout)\n        clearTimeout(timeout);\n    });\n  }\n\n  /** Utility function to just wait for the specified time\n   * @return Promise that resolves after the specified wait period\n   */\n  public async wait(): Promise<void> {\n    return new Promise<void>((resolve: any) => setTimeout(resolve, this._milliseconds));\n  }\n\n  /** Execute a function after delaying by this duration.\n   * @param fn the function to execute after the delay\n   * @param scope An optional object scope to serve as the 'this' pointer when `fn` is invoked.\n   * @param args optional arguments to `fn`\n   * @return Promise resolved by `fn`\n   */\n  public async executeAfter<T>(fn: (...args: any[]) => T, scope?: any, ...args: any[]): Promise<T> {\n    return new Promise<T>((resolve: any) => setTimeout(() => resolve(fn.apply(scope, args)), this._milliseconds));\n  }\n}\n\n/** A specific point in time relative to the current time.\n * BeTimePoints are used for timing operations. They are created from a BeDuration relative to the \"now\".\n * BeTimePoints are immutable.\n * @public\n */\nexport class BeTimePoint {\n  private readonly _milliseconds: number;\n  /** the time in milliseconds, of this BeTimePoint (relative to January 1, 1970 00:00:00 UTC.) */\n  public get milliseconds() { return this._milliseconds; }\n  private constructor(milliseconds: number) { this._milliseconds = milliseconds; }\n\n  /** Create a BeTimePoint from Date.now() */\n  public static now() { return new BeTimePoint(Date.now()); }\n\n  /** Create a BeTimePoint at a specified duration in the future from now\n   *  @param val the duration from now\n   */\n  public static fromNow(val: BeDuration) { return new BeTimePoint(Date.now() + val.milliseconds); }\n\n  /** Create a BeTimePoint at a specified duration in the past before now\n   * @param val the duration before now\n   */\n  public static beforeNow(val: BeDuration) { return new BeTimePoint(Date.now() - val.milliseconds); }\n\n  /** Determine whether this BeTimePoint is a time in the future from the time this method is called (it calls now()!) */\n  public get isInFuture(): boolean { return Date.now() < this._milliseconds; }\n\n  /** Determine whether this BeTimePoint is a time that has already passed before the time this method is called (it calls now()!) */\n  public get isInPast(): boolean { return Date.now() > this._milliseconds; }\n\n  /** Determine whether this BeTimePoint happens before another one.\n   * @param other the other BeTimePoint.\n   */\n  public before(other: BeTimePoint): boolean { return this._milliseconds < other._milliseconds; }\n\n  /** Determine whether this BeTimePoint happens after another one.\n   * @param other the other BeTimePoint.\n   */\n  public after(other: BeTimePoint): boolean { return this._milliseconds > other._milliseconds; }\n\n  /** Subtract a BeDuration from this BeTimePoint, returning a new BeTimePoint. This moves this BeTimePoint backwards in time if BeDuration.isTowardsFuture() === true\n   * @param duration the duration to subtract.\n   */\n  public minus(duration: BeDuration): BeTimePoint { return new BeTimePoint(this._milliseconds - duration.milliseconds); }\n\n  /** Subtract a BeDuration from this BeTimePoint, returning a new BeTimePoint. This moves this BeTimePoint backwards in time if BeDuration.isTowardsFuture() === true\n   * @param duration the duration to subtract.\n   */\n  public plus(duration: BeDuration) { return new BeTimePoint(this._milliseconds + duration.milliseconds); }\n}\n\n/** A StopWatch for timing operations.\n * @public\n */\nexport class StopWatch {\n  private _start?: BeTimePoint;\n  private _stop?: BeTimePoint;\n  /** Get the elapsed time since start() on a running timer. */\n  public get current(): BeDuration { return BeDuration.fromMilliseconds(BeTimePoint.now().milliseconds - (!!this._start ? this._start.milliseconds : 0)); }\n  /** Get the elapsed time, in seconds, since start() on a running timer. */\n  public get currentSeconds(): number { return this.current.seconds; }\n  /** Get the elapsed time between start() and stop() on this timer. */\n  public get elapsed(): BeDuration { return BeDuration.fromMilliseconds((!!this._stop ? this._stop.milliseconds : BeTimePoint.now().milliseconds) - (!!this._start ? this._start.milliseconds : 0)); }\n  /** Get the elapsed time, in seconds, between start() and stop() on this  timer. */\n  public get elapsedSeconds(): number { return this.elapsed.seconds; }\n  /** ctor for StopWatch\n   * @param description optional string stored with the StopWatch\n   * @param startImmediately if true, StopWatch is started when created. Otherwise, call start() explicitly.\n   */\n  constructor(public description?: string, startImmediately = false) { if (startImmediately) this.start(); }\n  /** Start the stopwatch. Any future time measurements will be based on this new value. */\n  public start(): void { this.reset(); this._start = BeTimePoint.now(); }\n  /** Stop the stopwatch so that the duration can be viewed later. */\n  public stop(): BeDuration { this._stop = BeTimePoint.now(); return this.elapsed; }\n  /** Clear the StopWatch */\n  public reset(): void { this._start = this._stop = undefined; }\n}\n"]}
+{"version":3,"file":"Time.js","sourceRoot":"","sources":["../../src/Time.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;GAGG;AACH,MAAM,OAAO,UAAU;IAErB,YAAoB,eAAuB,CAAC,IAAI,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC;IAEpF,mCAAmC;IACnC,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACxD,IAAW,OAAO,KAAK,OAAO,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC;IAE1D;;OAEG;IACI,MAAM,CAAC,WAAW,CAAC,OAAe,IAAI,OAAO,IAAI,UAAU,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACrF;;OAEG;IACI,MAAM,CAAC,gBAAgB,CAAC,YAAoB,IAAI,OAAO,IAAI,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC7F,qDAAqD;IACrD,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC;IACxD,8DAA8D;IAC9D,IAAW,eAAe,KAAc,OAAO,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC;IACxE,4DAA4D;IAC5D,IAAW,aAAa,KAAc,OAAO,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC;IACtE,8EAA8E;IACvE,KAAK,CAAC,KAAiB,IAAgB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAChH,sEAAsE;IAC/D,IAAI,CAAC,KAAiB,IAAgB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAE/G;;;OAGG;IACI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAU;QACjC,OAAO,IAAI,OAAO,CAAO,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAI,EAAU,EAAE,OAAuB;QAC7D,IAAI,OAAY,CAAC;QACjB,MAAM,WAAW,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;YAChD,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;YACvD,IAAI,OAAO;gBACT,YAAY,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,IAAI;QACf,OAAO,IAAI,OAAO,CAAO,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACtF,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,YAAY,CAAI,EAAyB,EAAE,KAAW,EAAE,GAAG,IAAW;QACjF,OAAO,IAAI,OAAO,CAAI,CAAC,OAAY,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAChH,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,WAAW;IAItB,YAAoB,YAAoB,IAAI,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC;IAFhF,gGAAgG;IAChG,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAGxD,2CAA2C;IACpC,MAAM,CAAC,GAAG,KAAK,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAE3D;;OAEG;IACI,MAAM,CAAC,OAAO,CAAC,GAAe,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEjG;;OAEG;IACI,MAAM,CAAC,SAAS,CAAC,GAAe,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEnG,uHAAuH;IACvH,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAE5E,mIAAmI;IACnI,IAAW,QAAQ,KAAc,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAE1E;;OAEG;IACI,MAAM,CAAC,KAAkB,IAAa,OAAO,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAE/F;;OAEG;IACI,KAAK,CAAC,KAAkB,IAAa,OAAO,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAE9F;;OAEG;IACI,KAAK,CAAC,QAAoB,IAAiB,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAEvH;;OAEG;IACI,IAAI,CAAC,QAAoB,IAAI,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;CAC1G;AAED;;GAEG;AACH,MAAM,OAAO,SAAS;IAWpB;;;OAGG;IACH,YAAmB,WAAoB,EAAE,gBAAgB,GAAG,KAAK;QAA9C,gBAAW,GAAX,WAAW,CAAS;QAA8B,IAAI,gBAAgB;YAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IAAC,CAAC;IAZ1G,6DAA6D;IAC7D,IAAW,OAAO,KAAiB,OAAO,UAAU,CAAC,gBAAgB,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzJ,0EAA0E;IAC1E,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE,qEAAqE;IACrE,IAAW,OAAO,KAAiB,OAAO,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpM,mFAAmF;IACnF,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IAMpE,yFAAyF;IAClF,KAAK,KAAW,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACvE,mEAAmE;IAC5D,IAAI,KAAiB,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAClF,0BAA0B;IACnB,KAAK,KAAW,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;CAC/D","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/** A duration of time. Can be either positive (towards future) or negative (in the past).\r\n * BeDurations are immutable.\r\n * @public\r\n */\r\nexport class BeDuration {\r\n  private readonly _milliseconds: number;\r\n  private constructor(milliseconds: number = 0) { this._milliseconds = milliseconds; }\r\n\r\n  /** The duration in milliseconds */\r\n  public get milliseconds() { return this._milliseconds; }\r\n  public get seconds() { return this._milliseconds / 1000; }\r\n\r\n  /** Create a BeDuration from seconds.\r\n   * @param seconds the number of seconds for this BeDuration\r\n   */\r\n  public static fromSeconds(seconds: number) { return new BeDuration(seconds * 1000); }\r\n  /** Create a BeDuration from milliseconds.\r\n   * @param milliseconds the number of milliseconds for this BeDuration\r\n   */\r\n  public static fromMilliseconds(milliseconds: number) { return new BeDuration(milliseconds); }\r\n  /** Determine whether this BeDuration is 0 seconds */\r\n  public get isZero() { return this._milliseconds === 0; }\r\n  /** Determine whether this BeDuration is towards the future */\r\n  public get isTowardsFuture(): boolean { return this._milliseconds > 0; }\r\n  /** Determine whether this BeDuration is towards the past */\r\n  public get isTowardsPast(): boolean { return this._milliseconds < 0; }\r\n  /** Subtract a BeDuration from this BeDuration, returning a new BeDuration. */\r\n  public minus(other: BeDuration): BeDuration { return new BeDuration(this._milliseconds - other._milliseconds); }\r\n  /** Add a BeDuration to this BeDuration, returning a new BeDuration */\r\n  public plus(other: BeDuration): BeDuration { return new BeDuration(this._milliseconds + other._milliseconds); }\r\n\r\n  /** Utility function to just wait for the specified time\r\n   * @param ms Duration in milliseconds to wait\r\n   * @return Promise that resolves after the specified wait period\r\n   */\r\n  public static async wait(ms: number): Promise<void> {\r\n    return new Promise<void>((resolve: any) => setTimeout(resolve, ms));\r\n  }\r\n\r\n  /** Utility function to wait for either the specified time or a promise, whichever resolves first\r\n   * @param ms Maximum duration in milliseconds to wait\r\n   * @param promise A pending promise to wait for\r\n   * @return Promise that resolves after the specified wait period or the provided promise resolves, whichever comes first\r\n   */\r\n  public static async race<T>(ms: number, promise: PromiseLike<T>): Promise<T | void> {\r\n    let timeout: any;\r\n    const waitPromise = new Promise<void>((resolve) => {\r\n      timeout = setTimeout(resolve, ms);\r\n    });\r\n    return Promise.race([waitPromise, promise]).finally(() => {\r\n      if (timeout)\r\n        clearTimeout(timeout);\r\n    });\r\n  }\r\n\r\n  /** Utility function to just wait for the specified time\r\n   * @return Promise that resolves after the specified wait period\r\n   */\r\n  public async wait(): Promise<void> {\r\n    return new Promise<void>((resolve: any) => setTimeout(resolve, this._milliseconds));\r\n  }\r\n\r\n  /** Execute a function after delaying by this duration.\r\n   * @param fn the function to execute after the delay\r\n   * @param scope An optional object scope to serve as the 'this' pointer when `fn` is invoked.\r\n   * @param args optional arguments to `fn`\r\n   * @return Promise resolved by `fn`\r\n   */\r\n  public async executeAfter<T>(fn: (...args: any[]) => T, scope?: any, ...args: any[]): Promise<T> {\r\n    return new Promise<T>((resolve: any) => setTimeout(() => resolve(fn.apply(scope, args)), this._milliseconds));\r\n  }\r\n}\r\n\r\n/** A specific point in time relative to the current time.\r\n * BeTimePoints are used for timing operations. They are created from a BeDuration relative to the \"now\".\r\n * BeTimePoints are immutable.\r\n * @public\r\n */\r\nexport class BeTimePoint {\r\n  private readonly _milliseconds: number;\r\n  /** the time in milliseconds, of this BeTimePoint (relative to January 1, 1970 00:00:00 UTC.) */\r\n  public get milliseconds() { return this._milliseconds; }\r\n  private constructor(milliseconds: number) { this._milliseconds = milliseconds; }\r\n\r\n  /** Create a BeTimePoint from Date.now() */\r\n  public static now() { return new BeTimePoint(Date.now()); }\r\n\r\n  /** Create a BeTimePoint at a specified duration in the future from now\r\n   *  @param val the duration from now\r\n   */\r\n  public static fromNow(val: BeDuration) { return new BeTimePoint(Date.now() + val.milliseconds); }\r\n\r\n  /** Create a BeTimePoint at a specified duration in the past before now\r\n   * @param val the duration before now\r\n   */\r\n  public static beforeNow(val: BeDuration) { return new BeTimePoint(Date.now() - val.milliseconds); }\r\n\r\n  /** Determine whether this BeTimePoint is a time in the future from the time this method is called (it calls now()!) */\r\n  public get isInFuture(): boolean { return Date.now() < this._milliseconds; }\r\n\r\n  /** Determine whether this BeTimePoint is a time that has already passed before the time this method is called (it calls now()!) */\r\n  public get isInPast(): boolean { return Date.now() > this._milliseconds; }\r\n\r\n  /** Determine whether this BeTimePoint happens before another one.\r\n   * @param other the other BeTimePoint.\r\n   */\r\n  public before(other: BeTimePoint): boolean { return this._milliseconds < other._milliseconds; }\r\n\r\n  /** Determine whether this BeTimePoint happens after another one.\r\n   * @param other the other BeTimePoint.\r\n   */\r\n  public after(other: BeTimePoint): boolean { return this._milliseconds > other._milliseconds; }\r\n\r\n  /** Subtract a BeDuration from this BeTimePoint, returning a new BeTimePoint. This moves this BeTimePoint backwards in time if BeDuration.isTowardsFuture() === true\r\n   * @param duration the duration to subtract.\r\n   */\r\n  public minus(duration: BeDuration): BeTimePoint { return new BeTimePoint(this._milliseconds - duration.milliseconds); }\r\n\r\n  /** Subtract a BeDuration from this BeTimePoint, returning a new BeTimePoint. This moves this BeTimePoint backwards in time if BeDuration.isTowardsFuture() === true\r\n   * @param duration the duration to subtract.\r\n   */\r\n  public plus(duration: BeDuration) { return new BeTimePoint(this._milliseconds + duration.milliseconds); }\r\n}\r\n\r\n/** A StopWatch for timing operations.\r\n * @public\r\n */\r\nexport class StopWatch {\r\n  private _start?: BeTimePoint;\r\n  private _stop?: BeTimePoint;\r\n  /** Get the elapsed time since start() on a running timer. */\r\n  public get current(): BeDuration { return BeDuration.fromMilliseconds(BeTimePoint.now().milliseconds - (!!this._start ? this._start.milliseconds : 0)); }\r\n  /** Get the elapsed time, in seconds, since start() on a running timer. */\r\n  public get currentSeconds(): number { return this.current.seconds; }\r\n  /** Get the elapsed time between start() and stop() on this timer. */\r\n  public get elapsed(): BeDuration { return BeDuration.fromMilliseconds((!!this._stop ? this._stop.milliseconds : BeTimePoint.now().milliseconds) - (!!this._start ? this._start.milliseconds : 0)); }\r\n  /** Get the elapsed time, in seconds, between start() and stop() on this  timer. */\r\n  public get elapsedSeconds(): number { return this.elapsed.seconds; }\r\n  /** ctor for StopWatch\r\n   * @param description optional string stored with the StopWatch\r\n   * @param startImmediately if true, StopWatch is started when created. Otherwise, call start() explicitly.\r\n   */\r\n  constructor(public description?: string, startImmediately = false) { if (startImmediately) this.start(); }\r\n  /** Start the stopwatch. Any future time measurements will be based on this new value. */\r\n  public start(): void { this.reset(); this._start = BeTimePoint.now(); }\r\n  /** Stop the stopwatch so that the duration can be viewed later. */\r\n  public stop(): BeDuration { this._stop = BeTimePoint.now(); return this.elapsed; }\r\n  /** Clear the StopWatch */\r\n  public reset(): void { this._start = this._stop = undefined; }\r\n}\r\n"]}

package/lib/esm/UnexpectedErrors.d.ts

@@ -0,0 +1,44 @@
+/** @packageDocumentation
+ * @module Errors
+ */
+/// <reference types="node" />
+/** A function to be notified when an unexpected error happens
+ * @public
+ */
+export declare type OnUnexpectedError = (error: any) => void;
+/**
+ * Utility for handling/reporting unexpected runtime errors. This class establishes a global handler for
+ * unexpected errors, and programmers should use its `handle` method when they occur. Generally, unexpected
+ * errors should not cause program termination, and should instead be logged and swallowed. However, for
+ * development/debugging, it can be helpful to re-throw exceptions so they are not missed.
+ * @public
+ */
+export declare class UnexpectedErrors {
+    /** handler for re-throwing exceptions directly */
+    static readonly reThrowImmediate: (e: any) => never;
+    /** handler for re-throwing exceptions from an asynchronous interval (so the current call stack is not aborted) */
+    static readonly reThrowDeferred: (e: any) => NodeJS.Timeout;
+    /** handler for logging exception to console */
+    static readonly consoleLog: (e: any) => void;
+    /** handler for logging exception with [[Logger]] */
+    static readonly errorLog: (e: any) => void;
+    private static _telemetry;
+    private static _handler;
+    private constructor();
+    /** Add a "telemetry tracker" for unexpected errors. Useful for tracking/reporting errors without changing handler.
+     * @returns a method to remove the tracker
+     */
+    static addTelemetry(tracker: OnUnexpectedError): () => void;
+    /** call this method when an unexpected error happens so the global handler can process it.
+     * @param error the unexpected error
+     * @param notifyTelemetry if false, don't notify telemetry trackers. Use this for exceptions from third-party code, for example.
+     */
+    static handle(error: any, notifyTelemetry?: boolean): void;
+    /** establish a new global *unexpected error* handler.
+     * @param handler the new global handler. You may provide your own function or use one of the static members of this class.
+     * The default is [[errorLog]].
+     * @returns the previous handler. Useful to temporarily change the handler.
+     */
+    static setHandler(handler: OnUnexpectedError): OnUnexpectedError;
+}
+//# sourceMappingURL=UnexpectedErrors.d.ts.map

package/lib/esm/UnexpectedErrors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnexpectedErrors.d.ts","sourceRoot":"","sources":["../../src/UnexpectedErrors.ts"],"names":[],"mappings":"AAIA;;GAEG;;AAIH;;GAEG;AACH,oBAAY,iBAAiB,GAAG,CAAC,KAAK,EAAE,GAAG,KAAK,IAAI,CAAC;AAErD;;;;;;GAMG;AACH,qBAAa,gBAAgB;IAC3B,kDAAkD;IAClD,gBAAuB,gBAAgB,MAAO,GAAG,WAAkB;IACnE,kHAAkH;IAClH,gBAAuB,eAAe,MAAO,GAAG,oBAAuC;IACvF,+CAA+C;IAC/C,gBAAuB,UAAU,MAAO,GAAG,UAAsB;IACjE,oDAAoD;IACpD,gBAAuB,QAAQ,MAAO,GAAG,UAAyC;IAElF,OAAO,CAAC,MAAM,CAAC,UAAU,CAA2B;IACpD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAiB;IACxC,OAAO;IAEP;;OAEG;WACW,YAAY,CAAC,OAAO,EAAE,iBAAiB,GAAG,MAAM,IAAI;IAKlE;;;OAGG;WACW,MAAM,CAAC,KAAK,EAAE,GAAG,EAAE,eAAe,UAAO,GAAG,IAAI;IAQ9D;;;;OAIG;WACW,UAAU,CAAC,OAAO,EAAE,iBAAiB,GAAG,iBAAiB;CAKxE"}

package/lib/esm/UnexpectedErrors.js

@@ -0,0 +1,62 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Errors
+ */
+var _a;
+import { Logger } from "./Logger";
+/**
+ * Utility for handling/reporting unexpected runtime errors. This class establishes a global handler for
+ * unexpected errors, and programmers should use its `handle` method when they occur. Generally, unexpected
+ * errors should not cause program termination, and should instead be logged and swallowed. However, for
+ * development/debugging, it can be helpful to re-throw exceptions so they are not missed.
+ * @public
+ */
+export class UnexpectedErrors {
+    constructor() { } // this is a singleton
+    /** Add a "telemetry tracker" for unexpected errors. Useful for tracking/reporting errors without changing handler.
+     * @returns a method to remove the tracker
+     */
+    static addTelemetry(tracker) {
+        this._telemetry.push(tracker);
+        return () => this._telemetry.splice(this._telemetry.indexOf(tracker), 1);
+    }
+    /** call this method when an unexpected error happens so the global handler can process it.
+     * @param error the unexpected error
+     * @param notifyTelemetry if false, don't notify telemetry trackers. Use this for exceptions from third-party code, for example.
+     */
+    static handle(error, notifyTelemetry = true) {
+        this._handler(error);
+        if (notifyTelemetry)
+            this._telemetry.forEach((telemetry) => {
+                try {
+                    telemetry(error);
+                }
+                catch (_) { } // ignore errors from telemetry trackers
+            });
+    }
+    /** establish a new global *unexpected error* handler.
+     * @param handler the new global handler. You may provide your own function or use one of the static members of this class.
+     * The default is [[errorLog]].
+     * @returns the previous handler. Useful to temporarily change the handler.
+     */
+    static setHandler(handler) {
+        const oldHandler = this._handler;
+        this._handler = handler;
+        return oldHandler;
+    }
+}
+_a = UnexpectedErrors;
+/** handler for re-throwing exceptions directly */
+UnexpectedErrors.reThrowImmediate = (e) => { throw e; };
+/** handler for re-throwing exceptions from an asynchronous interval (so the current call stack is not aborted) */
+UnexpectedErrors.reThrowDeferred = (e) => setTimeout(() => { throw e; }, 0);
+/** handler for logging exception to console */
+UnexpectedErrors.consoleLog = (e) => console.error(e); // eslint-disable-line no-console
+/** handler for logging exception with [[Logger]] */
+UnexpectedErrors.errorLog = (e) => Logger.logException("unhandled", e);
+UnexpectedErrors._telemetry = [];
+UnexpectedErrors._handler = _a.errorLog; // default to error logging
+//# sourceMappingURL=UnexpectedErrors.js.map