@itwin/core-bentley 4.0.0-dev.7 → 4.0.0-dev.72

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;YACR,OAAO;QAET,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)\r\n      return;\r\n\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"]}
+{"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;YACR,OAAO;QAET,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,CAAC,uDAAuD;SACxE;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)\r\n      return;\r\n\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; // eslint-disable-line @typescript-eslint/no-this-alias\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.d.ts

@@ -1,144 +1,144 @@
-/** @packageDocumentation
- * @module Logging
- */
-import { LoggingMetaData } from "./BentleyError";
-import { IDisposable } from "./Disposable";
-/** Defines the *signature* for a log function.
- * @public
- */
-export declare type LogFunction = (category: string, message: string, metaData: LoggingMetaData) => void;
-/** Use to categorize logging messages by severity.
- * @public
- */
-export declare enum LogLevel {
-    /** Tracing and debugging - low level */
-    Trace = 0,
-    /** Information - mid level */
-    Info = 1,
-    /** Warnings - high level */
-    Warning = 2,
-    /** Errors - highest level */
-    Error = 3,
-    /** Higher than any real logging level. This is used to turn a category off. */
-    None = 4
-}
-/** Identifies a logging category and the LogLevel that should be used for it. The LogLevel is specified by its string name.
- * @public
- */
-export interface LoggerCategoryAndLevel {
-    category: string;
-    logLevel: string;
-}
-/** Specifies logging levels, including the default logging level and a set of categories and levels for them.
- * @public
- */
-export interface LoggerLevelsConfig {
-    defaultLevel?: string;
-    categoryLevels?: LoggerCategoryAndLevel[];
-}
-/** Logger allows libraries and apps to report potentially useful information about operations, and it allows apps and users to control
- * how or if the logged information is displayed or collected. See [Learning about Logging]($docs/learning/common/Logging.md).
- * @public
- */
-export declare class Logger {
-    protected static _logError: LogFunction | undefined;
-    protected static _logWarning: LogFunction | undefined;
-    protected static _logInfo: LogFunction | undefined;
-    protected static _logTrace: LogFunction | undefined;
-    /** @internal */
-    static logLevelChangedFn?: VoidFunction;
-    private static _categoryFilter;
-    private static _minLevel;
-    /** Should the call stack be included when an exception is logged?  */
-    static logExceptionCallstacks: boolean;
-    /** All static metadata is combined with per-call metadata and stringified in every log message.
-     * Static metadata can either be an object or a function that returns an object.
-     * Use a key to identify entries in the map so the can be removed individually.
-     * @internal */
-    static staticMetaData: Map<string, LoggingMetaData>;
-    /** Initialize the logger streams. Should be called at application initialization time. */
-    static initialize(logError?: LogFunction, logWarning?: LogFunction, logInfo?: LogFunction, logTrace?: LogFunction): void;
-    /** Initialize the logger to output to the console. */
-    static initializeToConsole(): void;
-    /** merge the supplied metadata with all static metadata into one object */
-    static getMetaData(metaData?: LoggingMetaData): object;
-    /** 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. */
-    static stringifyMetaData(metaData?: LoggingMetaData): string;
-    /** Set the least severe level at which messages should be displayed by default. Call setLevel to override this default setting for specific categories. */
-    static setLevelDefault(minLevel: LogLevel): void;
-    /** Set the minimum logging level for the specified category. The minimum level is least severe level at which messages in the
-     * specified category should be displayed.
-     */
-    static setLevel(category: string, minLevel: LogLevel): void;
-    /** Interpret a string as the name of a LogLevel */
-    static parseLogLevel(str: string): LogLevel;
-    /** Set the log level for multiple categories at once. Also see [[validateProps]] */
-    static configureLevels(cfg: LoggerLevelsConfig): void;
-    private static isLogLevel;
-    /** Check that the specified object is a valid LoggerLevelsConfig. This is useful when reading a config from a .json file. */
-    static validateProps(config: any): void;
-    /** Get the minimum logging level for the specified category. */
-    static getLevel(category: string): LogLevel | undefined;
-    /** Turns off the least severe level at which messages should be displayed by default.
-     * This turns off logging for all messages for which no category minimum level is defined.
-     */
-    static turnOffLevelDefault(): void;
-    /** Turns off all category level filters previously defined with [[Logger.setLevel]].
-     */
-    static turnOffCategories(): void;
-    /** Check if messages in the specified category should be displayed at this level of severity. */
-    static isEnabled(category: string, level: LogLevel): boolean;
-    /** Log the specified message to the **error** stream.
-     * @param category  The category of the message.
-     * @param message  The message.
-     * @param metaData  Optional data for the message
-     */
-    static logError(category: string, message: string, metaData?: LoggingMetaData): void;
-    private static getExceptionMessage;
-    /** Log the specified exception. The special "ExceptionType" property will be added as metadata,
-     * in addition to any other metadata that may be supplied by the caller, unless the
-     * metadata supplied by the caller already includes this property.
-     * @param category  The category of the message.
-     * @param err  The exception object.
-     * @param log The logger output function to use - defaults to Logger.logError
-     * @param metaData  Optional data for the message
-     */
-    static logException(category: string, err: any, log?: LogFunction): void;
-    /** Log the specified message to the **warning** stream.
-     * @param category  The category of the message.
-     * @param message  The message.
-     * @param metaData  Optional data for the message
-     */
-    static logWarning(category: string, message: string, metaData?: LoggingMetaData): void;
-    /** Log the specified message to the **info** stream.
-     * @param category  The category of the message.
-     * @param message  The message.
-     * @param metaData  Optional data for the message
-     */
-    static logInfo(category: string, message: string, metaData?: LoggingMetaData): void;
-    /** Log the specified message to the **trace** stream.
-     * @param category  The category of the message.
-     * @param message  The message.
-     * @param metaData  Optional data for the message
-     */
-    static logTrace(category: string, message: string, metaData?: LoggingMetaData): void;
-}
-/** Simple performance diagnostics utility.
- * It measures the time from construction to disposal. On disposal it logs the routine name along with
- * the duration in milliseconds.
- * It also logs the routine name at construction time so that nested calls can be disambiguated.
- *
- * The timings are logged using the log category **Performance** and log severity [[LogLevel.INFO]].
- * Enable those, if you want to capture timings.
- * @public
- */
-export declare class PerfLogger implements IDisposable {
-    private static _severity;
-    private _operation;
-    private _metaData?;
-    private _startTimeStamp;
-    constructor(operation: string, metaData?: LoggingMetaData);
-    private logMessage;
-    dispose(): void;
-}
+/** @packageDocumentation
+ * @module Logging
+ */
+import { LoggingMetaData } from "./BentleyError";
+import { IDisposable } from "./Disposable";
+/** Defines the *signature* for a log function.
+ * @public
+ */
+export type LogFunction = (category: string, message: string, metaData: LoggingMetaData) => void;
+/** Use to categorize logging messages by severity.
+ * @public
+ */
+export declare enum LogLevel {
+    /** Tracing and debugging - low level */
+    Trace = 0,
+    /** Information - mid level */
+    Info = 1,
+    /** Warnings - high level */
+    Warning = 2,
+    /** Errors - highest level */
+    Error = 3,
+    /** Higher than any real logging level. This is used to turn a category off. */
+    None = 4
+}
+/** Identifies a logging category and the LogLevel that should be used for it. The LogLevel is specified by its string name.
+ * @public
+ */
+export interface LoggerCategoryAndLevel {
+    category: string;
+    logLevel: string;
+}
+/** Specifies logging levels, including the default logging level and a set of categories and levels for them.
+ * @public
+ */
+export interface LoggerLevelsConfig {
+    defaultLevel?: string;
+    categoryLevels?: LoggerCategoryAndLevel[];
+}
+/** Logger allows libraries and apps to report potentially useful information about operations, and it allows apps and users to control
+ * how or if the logged information is displayed or collected. See [Learning about Logging]($docs/learning/common/Logging.md).
+ * @public
+ */
+export declare class Logger {
+    protected static _logError: LogFunction | undefined;
+    protected static _logWarning: LogFunction | undefined;
+    protected static _logInfo: LogFunction | undefined;
+    protected static _logTrace: LogFunction | undefined;
+    /** @internal */
+    static logLevelChangedFn?: VoidFunction;
+    private static _categoryFilter;
+    private static _minLevel;
+    /** Should the call stack be included when an exception is logged?  */
+    static logExceptionCallstacks: boolean;
+    /** All static metadata is combined with per-call metadata and stringified in every log message.
+     * Static metadata can either be an object or a function that returns an object.
+     * Use a key to identify entries in the map so the can be removed individually.
+     * @internal */
+    static staticMetaData: Map<string, LoggingMetaData>;
+    /** Initialize the logger streams. Should be called at application initialization time. */
+    static initialize(logError?: LogFunction, logWarning?: LogFunction, logInfo?: LogFunction, logTrace?: LogFunction): void;
+    /** Initialize the logger to output to the console. */
+    static initializeToConsole(): void;
+    /** merge the supplied metadata with all static metadata into one object */
+    static getMetaData(metaData?: LoggingMetaData): object;
+    /** 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. */
+    static stringifyMetaData(metaData?: LoggingMetaData): string;
+    /** Set the least severe level at which messages should be displayed by default. Call setLevel to override this default setting for specific categories. */
+    static setLevelDefault(minLevel: LogLevel): void;
+    /** Set the minimum logging level for the specified category. The minimum level is least severe level at which messages in the
+     * specified category should be displayed.
+     */
+    static setLevel(category: string, minLevel: LogLevel): void;
+    /** Interpret a string as the name of a LogLevel */
+    static parseLogLevel(str: string): LogLevel;
+    /** Set the log level for multiple categories at once. Also see [[validateProps]] */
+    static configureLevels(cfg: LoggerLevelsConfig): void;
+    private static isLogLevel;
+    /** Check that the specified object is a valid LoggerLevelsConfig. This is useful when reading a config from a .json file. */
+    static validateProps(config: any): void;
+    /** Get the minimum logging level for the specified category. */
+    static getLevel(category: string): LogLevel | undefined;
+    /** Turns off the least severe level at which messages should be displayed by default.
+     * This turns off logging for all messages for which no category minimum level is defined.
+     */
+    static turnOffLevelDefault(): void;
+    /** Turns off all category level filters previously defined with [[Logger.setLevel]].
+     */
+    static turnOffCategories(): void;
+    /** Check if messages in the specified category should be displayed at this level of severity. */
+    static isEnabled(category: string, level: LogLevel): boolean;
+    /** Log the specified message to the **error** stream.
+     * @param category  The category of the message.
+     * @param message  The message.
+     * @param metaData  Optional data for the message
+     */
+    static logError(category: string, message: string, metaData?: LoggingMetaData): void;
+    private static getExceptionMessage;
+    /** Log the specified exception. The special "ExceptionType" property will be added as metadata,
+     * in addition to any other metadata that may be supplied by the caller, unless the
+     * metadata supplied by the caller already includes this property.
+     * @param category  The category of the message.
+     * @param err  The exception object.
+     * @param log The logger output function to use - defaults to Logger.logError
+     * @param metaData  Optional data for the message
+     */
+    static logException(category: string, err: any, log?: LogFunction): void;
+    /** Log the specified message to the **warning** stream.
+     * @param category  The category of the message.
+     * @param message  The message.
+     * @param metaData  Optional data for the message
+     */
+    static logWarning(category: string, message: string, metaData?: LoggingMetaData): void;
+    /** Log the specified message to the **info** stream.
+     * @param category  The category of the message.
+     * @param message  The message.
+     * @param metaData  Optional data for the message
+     */
+    static logInfo(category: string, message: string, metaData?: LoggingMetaData): void;
+    /** Log the specified message to the **trace** stream.
+     * @param category  The category of the message.
+     * @param message  The message.
+     * @param metaData  Optional data for the message
+     */
+    static logTrace(category: string, message: string, metaData?: LoggingMetaData): void;
+}
+/** Simple performance diagnostics utility.
+ * It measures the time from construction to disposal. On disposal it logs the routine name along with
+ * the duration in milliseconds.
+ * It also logs the routine name at construction time so that nested calls can be disambiguated.
+ *
+ * The timings are logged using the log category **Performance** and log severity [[LogLevel.INFO]].
+ * Enable those, if you want to capture timings.
+ * @public
+ */
+export declare class PerfLogger implements IDisposable {
+    private static _severity;
+    private _operation;
+    private _metaData?;
+    private _startTimeStamp;
+    constructor(operation: string, metaData?: LoggingMetaData);
+    private logMessage;
+    dispose(): void;
+}
 //# sourceMappingURL=Logger.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"Logger.d.ts","sourceRoot":"","sources":["../../src/Logger.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAA8B,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAE7E,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C;;GAEG;AACH,oBAAY,WAAW,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,eAAe,KAAK,IAAI,CAAC;AAEjG;;GAEG;AACH,oBAAY,QAAQ;IAClB,wCAAwC;IACxC,KAAK,IAAA;IACL,8BAA8B;IAC9B,IAAI,IAAA;IACJ,4BAA4B;IAC5B,OAAO,IAAA;IACP,6BAA6B;IAC7B,KAAK,IAAA;IACL,+EAA+E;IAC/E,IAAI,IAAA;CACL;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,cAAc,CAAC,EAAE,sBAAsB,EAAE,CAAC;CAC3C;AAED;;;GAGG;AACH,qBAAa,MAAM;IACjB,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,WAAW,GAAG,SAAS,CAAC;IACpD,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,WAAW,GAAG,SAAS,CAAC;IACtD,SAAS,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,GAAG,SAAS,CAAC;IACnD,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,WAAW,GAAG,SAAS,CAAC;IACpD,gBAAgB;IAChB,OAAc,iBAAiB,CAAC,EAAE,YAAY,CAAC;IAC/C,OAAO,CAAC,MAAM,CAAC,eAAe,CAA+B;IAC7D,OAAO,CAAC,MAAM,CAAC,SAAS,CAAmC;IAE3D,sEAAsE;IACtE,OAAc,sBAAsB,UAAS;IAE7C;;;mBAGe;IACf,OAAc,cAAc,+BAAsC;IAElE,0FAA0F;WAC5E,UAAU,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,UAAU,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,EAAE,WAAW,EAAE,QAAQ,CAAC,EAAE,WAAW,GAAG,IAAI;IAS/H,sDAAsD;WACxC,mBAAmB,IAAI,IAAI;IAOzC,2EAA2E;WAC7D,WAAW,CAAC,QAAQ,CAAC,EAAE,eAAe,GAAG,MAAM;IAW7D,0JAA0J;WAC5I,iBAAiB,CAAC,QAAQ,CAAC,EAAE,eAAe,GAAG,MAAM;IAKnE,2JAA2J;WAC7I,eAAe,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI;IAKvD;;OAEG;WACW,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ;IAK3D,mDAAmD;WACrC,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ;IAalD,oFAAoF;WACtE,eAAe,CAAC,GAAG,EAAE,kBAAkB;IAYrD,OAAO,CAAC,MAAM,CAAC,UAAU;IAIzB,6HAA6H;WAC/G,aAAa,CAAC,MAAM,EAAE,GAAG;IAsBvC,gEAAgE;WAClD,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAe9D;;OAEG;WACW,mBAAmB,IAAI,IAAI;IAIzC;OACG;WACW,iBAAiB,IAAI,IAAI;IAIvC,iGAAiG;WACnF,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,OAAO;IAKnE;;;;OAIG;WACW,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe,GAAG,IAAI;IAK3F,OAAO,CAAC,MAAM,CAAC,mBAAmB;IAKlC;;;;;;;OAOG;WACW,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAE,WAA6B,GAAG,IAAI;IAMhG;;;;OAIG;WACW,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe,GAAG,IAAI;IAK7F;;;;OAIG;WACW,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe,GAAG,IAAI;IAK1F;;;;OAIG;WACW,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe,GAAG,IAAI;CAI5F;AAED;;;;;;;;GAQG;AACH,qBAAa,UAAW,YAAW,WAAW;IAC5C,OAAO,CAAC,MAAM,CAAC,SAAS,CAA2B;IAEnD,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,SAAS,CAAC,CAAkB;IACpC,OAAO,CAAC,eAAe,CAAS;gBAEb,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe;IAahE,OAAO,CAAC,UAAU;IAaX,OAAO,IAAI,IAAI;CAGvB"}
+{"version":3,"file":"Logger.d.ts","sourceRoot":"","sources":["../../src/Logger.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAA8B,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAE7E,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,eAAe,KAAK,IAAI,CAAC;AAEjG;;GAEG;AACH,oBAAY,QAAQ;IAClB,wCAAwC;IACxC,KAAK,IAAA;IACL,8BAA8B;IAC9B,IAAI,IAAA;IACJ,4BAA4B;IAC5B,OAAO,IAAA;IACP,6BAA6B;IAC7B,KAAK,IAAA;IACL,+EAA+E;IAC/E,IAAI,IAAA;CACL;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,cAAc,CAAC,EAAE,sBAAsB,EAAE,CAAC;CAC3C;AAED;;;GAGG;AACH,qBAAa,MAAM;IACjB,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,WAAW,GAAG,SAAS,CAAC;IACpD,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,WAAW,GAAG,SAAS,CAAC;IACtD,SAAS,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,GAAG,SAAS,CAAC;IACnD,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,WAAW,GAAG,SAAS,CAAC;IACpD,gBAAgB;IAChB,OAAc,iBAAiB,CAAC,EAAE,YAAY,CAAC;IAC/C,OAAO,CAAC,MAAM,CAAC,eAAe,CAA+B;IAC7D,OAAO,CAAC,MAAM,CAAC,SAAS,CAAmC;IAE3D,sEAAsE;IACtE,OAAc,sBAAsB,UAAS;IAE7C;;;mBAGe;IACf,OAAc,cAAc,+BAAsC;IAElE,0FAA0F;WAC5E,UAAU,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,UAAU,CAAC,EAAE,WAAW,EAAE,OAAO,CAAC,EAAE,WAAW,EAAE,QAAQ,CAAC,EAAE,WAAW,GAAG,IAAI;IAS/H,sDAAsD;WACxC,mBAAmB,IAAI,IAAI;IAOzC,2EAA2E;WAC7D,WAAW,CAAC,QAAQ,CAAC,EAAE,eAAe,GAAG,MAAM;IAW7D,0JAA0J;WAC5I,iBAAiB,CAAC,QAAQ,CAAC,EAAE,eAAe,GAAG,MAAM;IAKnE,2JAA2J;WAC7I,eAAe,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI;IAKvD;;OAEG;WACW,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ;IAK3D,mDAAmD;WACrC,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ;IAalD,oFAAoF;WACtE,eAAe,CAAC,GAAG,EAAE,kBAAkB;IAYrD,OAAO,CAAC,MAAM,CAAC,UAAU;IAIzB,6HAA6H;WAC/G,aAAa,CAAC,MAAM,EAAE,GAAG;IAsBvC,gEAAgE;WAClD,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAe9D;;OAEG;WACW,mBAAmB,IAAI,IAAI;IAIzC;OACG;WACW,iBAAiB,IAAI,IAAI;IAIvC,iGAAiG;WACnF,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,OAAO;IAKnE;;;;OAIG;WACW,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe,GAAG,IAAI;IAK3F,OAAO,CAAC,MAAM,CAAC,mBAAmB;IAKlC;;;;;;;OAOG;WACW,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAE,WAA6B,GAAG,IAAI;IAMhG;;;;OAIG;WACW,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe,GAAG,IAAI;IAK7F;;;;OAIG;WACW,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe,GAAG,IAAI;IAK1F;;;;OAIG;WACW,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe,GAAG,IAAI;CAI5F;AAED;;;;;;;;GAQG;AACH,qBAAa,UAAW,YAAW,WAAW;IAC5C,OAAO,CAAC,MAAM,CAAC,SAAS,CAA2B;IAEnD,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,SAAS,CAAC,CAAkB;IACpC,OAAO,CAAC,eAAe,CAAS;gBAEb,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,eAAe;IAahE,OAAO,CAAC,UAAU;IAaX,OAAO,IAAI,IAAI;CAGvB"}