@slicemachine/init 2.10.40-beta.5 → 2.10.40-beta.6

package/dist/_node_modules/lru-cache/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/lru-cache/index.js"],"sourcesContent":["'use strict'\n\n// A linked list to keep track of recently-used-ness\nconst Yallist = require('yallist')\n\nconst MAX = Symbol('max')\nconst LENGTH = Symbol('length')\nconst LENGTH_CALCULATOR = Symbol('lengthCalculator')\nconst ALLOW_STALE = Symbol('allowStale')\nconst MAX_AGE = Symbol('maxAge')\nconst DISPOSE = Symbol('dispose')\nconst NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet')\nconst LRU_LIST = Symbol('lruList')\nconst CACHE = Symbol('cache')\nconst UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet')\n\nconst naiveLength = () => 1\n\n// lruList is a yallist where the head is the youngest\n// item, and the tail is the oldest.  the list contains the Hit\n// objects as the entries.\n// Each Hit object has a reference to its Yallist.Node.  This\n// never changes.\n//\n// cache is a Map (or PseudoMap) that matches the keys to\n// the Yallist.Node object.\nclass LRUCache {\n  constructor (options) {\n    if (typeof options === 'number')\n      options = { max: options }\n\n    if (!options)\n      options = {}\n\n    if (options.max && (typeof options.max !== 'number' || options.max < 0))\n      throw new TypeError('max must be a non-negative number')\n    // Kind of weird to have a default max of Infinity, but oh well.\n    const max = this[MAX] = options.max || Infinity\n\n    const lc = options.length || naiveLength\n    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc\n    this[ALLOW_STALE] = options.stale || false\n    if (options.maxAge && typeof options.maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n    this[MAX_AGE] = options.maxAge || 0\n    this[DISPOSE] = options.dispose\n    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false\n    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false\n    this.reset()\n  }\n\n  // resize the cache when the max changes.\n  set max (mL) {\n    if (typeof mL !== 'number' || mL < 0)\n      throw new TypeError('max must be a non-negative number')\n\n    this[MAX] = mL || Infinity\n    trim(this)\n  }\n  get max () {\n    return this[MAX]\n  }\n\n  set allowStale (allowStale) {\n    this[ALLOW_STALE] = !!allowStale\n  }\n  get allowStale () {\n    return this[ALLOW_STALE]\n  }\n\n  set maxAge (mA) {\n    if (typeof mA !== 'number')\n      throw new TypeError('maxAge must be a non-negative number')\n\n    this[MAX_AGE] = mA\n    trim(this)\n  }\n  get maxAge () {\n    return this[MAX_AGE]\n  }\n\n  // resize the cache when the lengthCalculator changes.\n  set lengthCalculator (lC) {\n    if (typeof lC !== 'function')\n      lC = naiveLength\n\n    if (lC !== this[LENGTH_CALCULATOR]) {\n      this[LENGTH_CALCULATOR] = lC\n      this[LENGTH] = 0\n      this[LRU_LIST].forEach(hit => {\n        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key)\n        this[LENGTH] += hit.length\n      })\n    }\n    trim(this)\n  }\n  get lengthCalculator () { return this[LENGTH_CALCULATOR] }\n\n  get length () { return this[LENGTH] }\n  get itemCount () { return this[LRU_LIST].length }\n\n  rforEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].tail; walker !== null;) {\n      const prev = walker.prev\n      forEachStep(this, fn, walker, thisp)\n      walker = prev\n    }\n  }\n\n  forEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].head; walker !== null;) {\n      const next = walker.next\n      forEachStep(this, fn, walker, thisp)\n      walker = next\n    }\n  }\n\n  keys () {\n    return this[LRU_LIST].toArray().map(k => k.key)\n  }\n\n  values () {\n    return this[LRU_LIST].toArray().map(k => k.value)\n  }\n\n  reset () {\n    if (this[DISPOSE] &&\n        this[LRU_LIST] &&\n        this[LRU_LIST].length) {\n      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value))\n    }\n\n    this[CACHE] = new Map() // hash of items by key\n    this[LRU_LIST] = new Yallist() // list of items in order of use recency\n    this[LENGTH] = 0 // length of items in the list\n  }\n\n  dump () {\n    return this[LRU_LIST].map(hit =>\n      isStale(this, hit) ? false : {\n        k: hit.key,\n        v: hit.value,\n        e: hit.now + (hit.maxAge || 0)\n      }).toArray().filter(h => h)\n  }\n\n  dumpLru () {\n    return this[LRU_LIST]\n  }\n\n  set (key, value, maxAge) {\n    maxAge = maxAge || this[MAX_AGE]\n\n    if (maxAge && typeof maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n\n    const now = maxAge ? Date.now() : 0\n    const len = this[LENGTH_CALCULATOR](value, key)\n\n    if (this[CACHE].has(key)) {\n      if (len > this[MAX]) {\n        del(this, this[CACHE].get(key))\n        return false\n      }\n\n      const node = this[CACHE].get(key)\n      const item = node.value\n\n      // dispose of the old one before overwriting\n      // split out into 2 ifs for better coverage tracking\n      if (this[DISPOSE]) {\n        if (!this[NO_DISPOSE_ON_SET])\n          this[DISPOSE](key, item.value)\n      }\n\n      item.now = now\n      item.maxAge = maxAge\n      item.value = value\n      this[LENGTH] += len - item.length\n      item.length = len\n      this.get(key)\n      trim(this)\n      return true\n    }\n\n    const hit = new Entry(key, value, len, now, maxAge)\n\n    // oversized objects fall out of cache automatically.\n    if (hit.length > this[MAX]) {\n      if (this[DISPOSE])\n        this[DISPOSE](key, value)\n\n      return false\n    }\n\n    this[LENGTH] += hit.length\n    this[LRU_LIST].unshift(hit)\n    this[CACHE].set(key, this[LRU_LIST].head)\n    trim(this)\n    return true\n  }\n\n  has (key) {\n    if (!this[CACHE].has(key)) return false\n    const hit = this[CACHE].get(key).value\n    return !isStale(this, hit)\n  }\n\n  get (key) {\n    return get(this, key, true)\n  }\n\n  peek (key) {\n    return get(this, key, false)\n  }\n\n  pop () {\n    const node = this[LRU_LIST].tail\n    if (!node)\n      return null\n\n    del(this, node)\n    return node.value\n  }\n\n  del (key) {\n    del(this, this[CACHE].get(key))\n  }\n\n  load (arr) {\n    // reset the cache\n    this.reset()\n\n    const now = Date.now()\n    // A previous serialized cache has the most recent items first\n    for (let l = arr.length - 1; l >= 0; l--) {\n      const hit = arr[l]\n      const expiresAt = hit.e || 0\n      if (expiresAt === 0)\n        // the item was created without expiration in a non aged cache\n        this.set(hit.k, hit.v)\n      else {\n        const maxAge = expiresAt - now\n        // dont add already expired items\n        if (maxAge > 0) {\n          this.set(hit.k, hit.v, maxAge)\n        }\n      }\n    }\n  }\n\n  prune () {\n    this[CACHE].forEach((value, key) => get(this, key, false))\n  }\n}\n\nconst get = (self, key, doUse) => {\n  const node = self[CACHE].get(key)\n  if (node) {\n    const hit = node.value\n    if (isStale(self, hit)) {\n      del(self, node)\n      if (!self[ALLOW_STALE])\n        return undefined\n    } else {\n      if (doUse) {\n        if (self[UPDATE_AGE_ON_GET])\n          node.value.now = Date.now()\n        self[LRU_LIST].unshiftNode(node)\n      }\n    }\n    return hit.value\n  }\n}\n\nconst isStale = (self, hit) => {\n  if (!hit || (!hit.maxAge && !self[MAX_AGE]))\n    return false\n\n  const diff = Date.now() - hit.now\n  return hit.maxAge ? diff > hit.maxAge\n    : self[MAX_AGE] && (diff > self[MAX_AGE])\n}\n\nconst trim = self => {\n  if (self[LENGTH] > self[MAX]) {\n    for (let walker = self[LRU_LIST].tail;\n      self[LENGTH] > self[MAX] && walker !== null;) {\n      // We know that we're about to delete this one, and also\n      // what the next least recently used key will be, so just\n      // go ahead and set it now.\n      const prev = walker.prev\n      del(self, walker)\n      walker = prev\n    }\n  }\n}\n\nconst del = (self, node) => {\n  if (node) {\n    const hit = node.value\n    if (self[DISPOSE])\n      self[DISPOSE](hit.key, hit.value)\n\n    self[LENGTH] -= hit.length\n    self[CACHE].delete(hit.key)\n    self[LRU_LIST].removeNode(node)\n  }\n}\n\nclass Entry {\n  constructor (key, value, length, now, maxAge) {\n    this.key = key\n    this.value = value\n    this.length = length\n    this.now = now\n    this.maxAge = maxAge || 0\n  }\n}\n\nconst forEachStep = (self, fn, node, thisp) => {\n  let hit = node.value\n  if (isStale(self, hit)) {\n    del(self, node)\n    if (!self[ALLOW_STALE])\n      hit = undefined\n  }\n  if (hit)\n    fn.call(thisp, hit.value, hit.key, self)\n}\n\nmodule.exports = LRUCache\n"],"names":["require$$0"],"mappings":";;;AAGA,MAAM,UAAUA,QAAkB;AAElC,MAAM,MAAM,OAAO,KAAK;AACxB,MAAM,SAAS,OAAO,QAAQ;AAC9B,MAAM,oBAAoB,OAAO,kBAAkB;AACnD,MAAM,cAAc,OAAO,YAAY;AACvC,MAAM,UAAU,OAAO,QAAQ;AAC/B,MAAM,UAAU,OAAO,SAAS;AAChC,MAAM,oBAAoB,OAAO,gBAAgB;AACjD,MAAM,WAAW,OAAO,SAAS;AACjC,MAAM,QAAQ,OAAO,OAAO;AAC5B,MAAM,oBAAoB,OAAO,gBAAgB;AAEjD,MAAM,cAAc,MAAM;AAU1B,MAAM,SAAS;AAAA,EACb,YAAa,SAAS;AACpB,QAAI,OAAO,YAAY;AACrB,gBAAU,EAAE,KAAK,QAAS;AAE5B,QAAI,CAAC;AACH,gBAAU,CAAE;AAEd,QAAI,QAAQ,QAAQ,OAAO,QAAQ,QAAQ,YAAY,QAAQ,MAAM;AACnE,YAAM,IAAI,UAAU,mCAAmC;AAE7C,SAAK,GAAG,IAAI,QAAQ,OAAO;AAEvC,UAAM,KAAK,QAAQ,UAAU;AAC7B,SAAK,iBAAiB,IAAK,OAAO,OAAO,aAAc,cAAc;AACrE,SAAK,WAAW,IAAI,QAAQ,SAAS;AACrC,QAAI,QAAQ,UAAU,OAAO,QAAQ,WAAW;AAC9C,YAAM,IAAI,UAAU,yBAAyB;AAC/C,SAAK,OAAO,IAAI,QAAQ,UAAU;AAClC,SAAK,OAAO,IAAI,QAAQ;AACxB,SAAK,iBAAiB,IAAI,QAAQ,kBAAkB;AACpD,SAAK,iBAAiB,IAAI,QAAQ,kBAAkB;AACpD,SAAK,MAAO;AAAA,EACb;AAAA;AAAA,EAGD,IAAI,IAAK,IAAI;AACX,QAAI,OAAO,OAAO,YAAY,KAAK;AACjC,YAAM,IAAI,UAAU,mCAAmC;AAEzD,SAAK,GAAG,IAAI,MAAM;AAClB,SAAK,IAAI;AAAA,EACV;AAAA,EACD,IAAI,MAAO;AACT,WAAO,KAAK,GAAG;AAAA,EAChB;AAAA,EAED,IAAI,WAAY,YAAY;AAC1B,SAAK,WAAW,IAAI,CAAC,CAAC;AAAA,EACvB;AAAA,EACD,IAAI,aAAc;AAChB,WAAO,KAAK,WAAW;AAAA,EACxB;AAAA,EAED,IAAI,OAAQ,IAAI;AACd,QAAI,OAAO,OAAO;AAChB,YAAM,IAAI,UAAU,sCAAsC;AAE5D,SAAK,OAAO,IAAI;AAChB,SAAK,IAAI;AAAA,EACV;AAAA,EACD,IAAI,SAAU;AACZ,WAAO,KAAK,OAAO;AAAA,EACpB;AAAA;AAAA,EAGD,IAAI,iBAAkB,IAAI;AACxB,QAAI,OAAO,OAAO;AAChB,WAAK;AAEP,QAAI,OAAO,KAAK,iBAAiB,GAAG;AAClC,WAAK,iBAAiB,IAAI;AAC1B,WAAK,MAAM,IAAI;AACf,WAAK,QAAQ,EAAE,QAAQ,SAAO;AAC5B,YAAI,SAAS,KAAK,iBAAiB,EAAE,IAAI,OAAO,IAAI,GAAG;AACvD,aAAK,MAAM,KAAK,IAAI;AAAA,MAC5B,CAAO;AAAA,IACF;AACD,SAAK,IAAI;AAAA,EACV;AAAA,EACD,IAAI,mBAAoB;AAAE,WAAO,KAAK,iBAAiB;AAAA,EAAG;AAAA,EAE1D,IAAI,SAAU;AAAE,WAAO,KAAK,MAAM;AAAA,EAAG;AAAA,EACrC,IAAI,YAAa;AAAE,WAAO,KAAK,QAAQ,EAAE;AAAA,EAAQ;AAAA,EAEjD,SAAU,IAAI,OAAO;AACnB,YAAQ,SAAS;AACjB,aAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,WAAW,QAAO;AACvD,YAAM,OAAO,OAAO;AACpB,kBAAY,MAAM,IAAI,QAAQ,KAAK;AACnC,eAAS;AAAA,IACV;AAAA,EACF;AAAA,EAED,QAAS,IAAI,OAAO;AAClB,YAAQ,SAAS;AACjB,aAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,WAAW,QAAO;AACvD,YAAM,OAAO,OAAO;AACpB,kBAAY,MAAM,IAAI,QAAQ,KAAK;AACnC,eAAS;AAAA,IACV;AAAA,EACF;AAAA,EAED,OAAQ;AACN,WAAO,KAAK,QAAQ,EAAE,QAAO,EAAG,IAAI,OAAK,EAAE,GAAG;AAAA,EAC/C;AAAA,EAED,SAAU;AACR,WAAO,KAAK,QAAQ,EAAE,QAAO,EAAG,IAAI,OAAK,EAAE,KAAK;AAAA,EACjD;AAAA,EAED,QAAS;AACP,QAAI,KAAK,OAAO,KACZ,KAAK,QAAQ,KACb,KAAK,QAAQ,EAAE,QAAQ;AACzB,WAAK,QAAQ,EAAE,QAAQ,SAAO,KAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK,CAAC;AAAA,IAChE;AAED,SAAK,KAAK,IAAI,oBAAI,IAAK;AACvB,SAAK,QAAQ,IAAI,IAAI,QAAS;AAC9B,SAAK,MAAM,IAAI;AAAA,EAChB;AAAA,EAED,OAAQ;AACN,WAAO,KAAK,QAAQ,EAAE,IAAI,SACxB,QAAQ,MAAM,GAAG,IAAI,QAAQ;AAAA,MAC3B,GAAG,IAAI;AAAA,MACP,GAAG,IAAI;AAAA,MACP,GAAG,IAAI,OAAO,IAAI,UAAU;AAAA,IAC7B,CAAA,EAAE,QAAS,EAAC,OAAO,OAAK,CAAC;AAAA,EAC7B;AAAA,EAED,UAAW;AACT,WAAO,KAAK,QAAQ;AAAA,EACrB;AAAA,EAED,IAAK,KAAK,OAAO,QAAQ;AACvB,aAAS,UAAU,KAAK,OAAO;AAE/B,QAAI,UAAU,OAAO,WAAW;AAC9B,YAAM,IAAI,UAAU,yBAAyB;AAE/C,UAAM,MAAM,SAAS,KAAK,IAAK,IAAG;AAClC,UAAM,MAAM,KAAK,iBAAiB,EAAE,OAAO,GAAG;AAE9C,QAAI,KAAK,KAAK,EAAE,IAAI,GAAG,GAAG;AACxB,UAAI,MAAM,KAAK,GAAG,GAAG;AACnB,YAAI,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,CAAC;AAC9B,eAAO;AAAA,MACR;AAED,YAAM,OAAO,KAAK,KAAK,EAAE,IAAI,GAAG;AAChC,YAAM,OAAO,KAAK;AAIlB,UAAI,KAAK,OAAO,GAAG;AACjB,YAAI,CAAC,KAAK,iBAAiB;AACzB,eAAK,OAAO,EAAE,KAAK,KAAK,KAAK;AAAA,MAChC;AAED,WAAK,MAAM;AACX,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,WAAK,MAAM,KAAK,MAAM,KAAK;AAC3B,WAAK,SAAS;AACd,WAAK,IAAI,GAAG;AACZ,WAAK,IAAI;AACT,aAAO;AAAA,IACR;AAED,UAAM,MAAM,IAAI,MAAM,KAAK,OAAO,KAAK,KAAK,MAAM;AAGlD,QAAI,IAAI,SAAS,KAAK,GAAG,GAAG;AAC1B,UAAI,KAAK,OAAO;AACd,aAAK,OAAO,EAAE,KAAK,KAAK;AAE1B,aAAO;AAAA,IACR;AAED,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,QAAQ,EAAE,QAAQ,GAAG;AAC1B,SAAK,KAAK,EAAE,IAAI,KAAK,KAAK,QAAQ,EAAE,IAAI;AACxC,SAAK,IAAI;AACT,WAAO;AAAA,EACR;AAAA,EAED,IAAK,KAAK;AACR,QAAI,CAAC,KAAK,KAAK,EAAE,IAAI,GAAG;AAAG,aAAO;AAClC,UAAM,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,EAAE;AACjC,WAAO,CAAC,QAAQ,MAAM,GAAG;AAAA,EAC1B;AAAA,EAED,IAAK,KAAK;AACR,WAAO,IAAI,MAAM,KAAK,IAAI;AAAA,EAC3B;AAAA,EAED,KAAM,KAAK;AACT,WAAO,IAAI,MAAM,KAAK,KAAK;AAAA,EAC5B;AAAA,EAED,MAAO;AACL,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,QAAI,CAAC;AACH,aAAO;AAET,QAAI,MAAM,IAAI;AACd,WAAO,KAAK;AAAA,EACb;AAAA,EAED,IAAK,KAAK;AACR,QAAI,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,CAAC;AAAA,EAC/B;AAAA,EAED,KAAM,KAAK;AAET,SAAK,MAAO;AAEZ,UAAM,MAAM,KAAK,IAAK;AAEtB,aAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,MAAM,IAAI,CAAC;AACjB,YAAM,YAAY,IAAI,KAAK;AAC3B,UAAI,cAAc;AAEhB,aAAK,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,WAClB;AACH,cAAM,SAAS,YAAY;AAE3B,YAAI,SAAS,GAAG;AACd,eAAK,IAAI,IAAI,GAAG,IAAI,GAAG,MAAM;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAED,QAAS;AACP,SAAK,KAAK,EAAE,QAAQ,CAAC,OAAO,QAAQ,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA,EAC1D;AACH;AAEA,MAAM,MAAM,CAAC,MAAM,KAAK,UAAU;AAChC,QAAM,OAAO,KAAK,KAAK,EAAE,IAAI,GAAG;AAChC,MAAI,MAAM;AACR,UAAM,MAAM,KAAK;AACjB,QAAI,QAAQ,MAAM,GAAG,GAAG;AACtB,UAAI,MAAM,IAAI;AACd,UAAI,CAAC,KAAK,WAAW;AACnB,eAAO;AAAA,IACf,OAAW;AACL,UAAI,OAAO;AACT,YAAI,KAAK,iBAAiB;AACxB,eAAK,MAAM,MAAM,KAAK,IAAK;AAC7B,aAAK,QAAQ,EAAE,YAAY,IAAI;AAAA,MAChC;AAAA,IACF;AACD,WAAO,IAAI;AAAA,EACZ;AACH;AAEA,MAAM,UAAU,CAAC,MAAM,QAAQ;AAC7B,MAAI,CAAC,OAAQ,CAAC,IAAI,UAAU,CAAC,KAAK,OAAO;AACvC,WAAO;AAET,QAAM,OAAO,KAAK,IAAK,IAAG,IAAI;AAC9B,SAAO,IAAI,SAAS,OAAO,IAAI,SAC3B,KAAK,OAAO,KAAM,OAAO,KAAK,OAAO;AAC3C;AAEA,MAAM,OAAO,UAAQ;AACnB,MAAI,KAAK,MAAM,IAAI,KAAK,GAAG,GAAG;AAC5B,aAAS,SAAS,KAAK,QAAQ,EAAE,MAC/B,KAAK,MAAM,IAAI,KAAK,GAAG,KAAK,WAAW,QAAO;AAI9C,YAAM,OAAO,OAAO;AACpB,UAAI,MAAM,MAAM;AAChB,eAAS;AAAA,IACV;AAAA,EACF;AACH;AAEA,MAAM,MAAM,CAAC,MAAM,SAAS;AAC1B,MAAI,MAAM;AACR,UAAM,MAAM,KAAK;AACjB,QAAI,KAAK,OAAO;AACd,WAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK;AAElC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,KAAK,EAAE,OAAO,IAAI,GAAG;AAC1B,SAAK,QAAQ,EAAE,WAAW,IAAI;AAAA,EAC/B;AACH;AAEA,MAAM,MAAM;AAAA,EACV,YAAa,KAAK,OAAO,QAAQ,KAAK,QAAQ;AAC5C,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,SAAK,MAAM;AACX,SAAK,SAAS,UAAU;AAAA,EACzB;AACH;AAEA,MAAM,cAAc,CAAC,MAAM,IAAI,MAAM,UAAU;AAC7C,MAAI,MAAM,KAAK;AACf,MAAI,QAAQ,MAAM,GAAG,GAAG;AACtB,QAAI,MAAM,IAAI;AACd,QAAI,CAAC,KAAK,WAAW;AACnB,YAAM;AAAA,EACT;AACD,MAAI;AACF,OAAG,KAAK,OAAO,IAAI,OAAO,IAAI,KAAK,IAAI;AAC3C;AAEA,IAAA,WAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/lru-cache/index.js"],"sourcesContent":["'use strict'\n\n// A linked list to keep track of recently-used-ness\nconst Yallist = require('yallist')\n\nconst MAX = Symbol('max')\nconst LENGTH = Symbol('length')\nconst LENGTH_CALCULATOR = Symbol('lengthCalculator')\nconst ALLOW_STALE = Symbol('allowStale')\nconst MAX_AGE = Symbol('maxAge')\nconst DISPOSE = Symbol('dispose')\nconst NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet')\nconst LRU_LIST = Symbol('lruList')\nconst CACHE = Symbol('cache')\nconst UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet')\n\nconst naiveLength = () => 1\n\n// lruList is a yallist where the head is the youngest\n// item, and the tail is the oldest.  the list contains the Hit\n// objects as the entries.\n// Each Hit object has a reference to its Yallist.Node.  This\n// never changes.\n//\n// cache is a Map (or PseudoMap) that matches the keys to\n// the Yallist.Node object.\nclass LRUCache {\n  constructor (options) {\n    if (typeof options === 'number')\n      options = { max: options }\n\n    if (!options)\n      options = {}\n\n    if (options.max && (typeof options.max !== 'number' || options.max < 0))\n      throw new TypeError('max must be a non-negative number')\n    // Kind of weird to have a default max of Infinity, but oh well.\n    const max = this[MAX] = options.max || Infinity\n\n    const lc = options.length || naiveLength\n    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc\n    this[ALLOW_STALE] = options.stale || false\n    if (options.maxAge && typeof options.maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n    this[MAX_AGE] = options.maxAge || 0\n    this[DISPOSE] = options.dispose\n    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false\n    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false\n    this.reset()\n  }\n\n  // resize the cache when the max changes.\n  set max (mL) {\n    if (typeof mL !== 'number' || mL < 0)\n      throw new TypeError('max must be a non-negative number')\n\n    this[MAX] = mL || Infinity\n    trim(this)\n  }\n  get max () {\n    return this[MAX]\n  }\n\n  set allowStale (allowStale) {\n    this[ALLOW_STALE] = !!allowStale\n  }\n  get allowStale () {\n    return this[ALLOW_STALE]\n  }\n\n  set maxAge (mA) {\n    if (typeof mA !== 'number')\n      throw new TypeError('maxAge must be a non-negative number')\n\n    this[MAX_AGE] = mA\n    trim(this)\n  }\n  get maxAge () {\n    return this[MAX_AGE]\n  }\n\n  // resize the cache when the lengthCalculator changes.\n  set lengthCalculator (lC) {\n    if (typeof lC !== 'function')\n      lC = naiveLength\n\n    if (lC !== this[LENGTH_CALCULATOR]) {\n      this[LENGTH_CALCULATOR] = lC\n      this[LENGTH] = 0\n      this[LRU_LIST].forEach(hit => {\n        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key)\n        this[LENGTH] += hit.length\n      })\n    }\n    trim(this)\n  }\n  get lengthCalculator () { return this[LENGTH_CALCULATOR] }\n\n  get length () { return this[LENGTH] }\n  get itemCount () { return this[LRU_LIST].length }\n\n  rforEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].tail; walker !== null;) {\n      const prev = walker.prev\n      forEachStep(this, fn, walker, thisp)\n      walker = prev\n    }\n  }\n\n  forEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].head; walker !== null;) {\n      const next = walker.next\n      forEachStep(this, fn, walker, thisp)\n      walker = next\n    }\n  }\n\n  keys () {\n    return this[LRU_LIST].toArray().map(k => k.key)\n  }\n\n  values () {\n    return this[LRU_LIST].toArray().map(k => k.value)\n  }\n\n  reset () {\n    if (this[DISPOSE] &&\n        this[LRU_LIST] &&\n        this[LRU_LIST].length) {\n      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value))\n    }\n\n    this[CACHE] = new Map() // hash of items by key\n    this[LRU_LIST] = new Yallist() // list of items in order of use recency\n    this[LENGTH] = 0 // length of items in the list\n  }\n\n  dump () {\n    return this[LRU_LIST].map(hit =>\n      isStale(this, hit) ? false : {\n        k: hit.key,\n        v: hit.value,\n        e: hit.now + (hit.maxAge || 0)\n      }).toArray().filter(h => h)\n  }\n\n  dumpLru () {\n    return this[LRU_LIST]\n  }\n\n  set (key, value, maxAge) {\n    maxAge = maxAge || this[MAX_AGE]\n\n    if (maxAge && typeof maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n\n    const now = maxAge ? Date.now() : 0\n    const len = this[LENGTH_CALCULATOR](value, key)\n\n    if (this[CACHE].has(key)) {\n      if (len > this[MAX]) {\n        del(this, this[CACHE].get(key))\n        return false\n      }\n\n      const node = this[CACHE].get(key)\n      const item = node.value\n\n      // dispose of the old one before overwriting\n      // split out into 2 ifs for better coverage tracking\n      if (this[DISPOSE]) {\n        if (!this[NO_DISPOSE_ON_SET])\n          this[DISPOSE](key, item.value)\n      }\n\n      item.now = now\n      item.maxAge = maxAge\n      item.value = value\n      this[LENGTH] += len - item.length\n      item.length = len\n      this.get(key)\n      trim(this)\n      return true\n    }\n\n    const hit = new Entry(key, value, len, now, maxAge)\n\n    // oversized objects fall out of cache automatically.\n    if (hit.length > this[MAX]) {\n      if (this[DISPOSE])\n        this[DISPOSE](key, value)\n\n      return false\n    }\n\n    this[LENGTH] += hit.length\n    this[LRU_LIST].unshift(hit)\n    this[CACHE].set(key, this[LRU_LIST].head)\n    trim(this)\n    return true\n  }\n\n  has (key) {\n    if (!this[CACHE].has(key)) return false\n    const hit = this[CACHE].get(key).value\n    return !isStale(this, hit)\n  }\n\n  get (key) {\n    return get(this, key, true)\n  }\n\n  peek (key) {\n    return get(this, key, false)\n  }\n\n  pop () {\n    const node = this[LRU_LIST].tail\n    if (!node)\n      return null\n\n    del(this, node)\n    return node.value\n  }\n\n  del (key) {\n    del(this, this[CACHE].get(key))\n  }\n\n  load (arr) {\n    // reset the cache\n    this.reset()\n\n    const now = Date.now()\n    // A previous serialized cache has the most recent items first\n    for (let l = arr.length - 1; l >= 0; l--) {\n      const hit = arr[l]\n      const expiresAt = hit.e || 0\n      if (expiresAt === 0)\n        // the item was created without expiration in a non aged cache\n        this.set(hit.k, hit.v)\n      else {\n        const maxAge = expiresAt - now\n        // dont add already expired items\n        if (maxAge > 0) {\n          this.set(hit.k, hit.v, maxAge)\n        }\n      }\n    }\n  }\n\n  prune () {\n    this[CACHE].forEach((value, key) => get(this, key, false))\n  }\n}\n\nconst get = (self, key, doUse) => {\n  const node = self[CACHE].get(key)\n  if (node) {\n    const hit = node.value\n    if (isStale(self, hit)) {\n      del(self, node)\n      if (!self[ALLOW_STALE])\n        return undefined\n    } else {\n      if (doUse) {\n        if (self[UPDATE_AGE_ON_GET])\n          node.value.now = Date.now()\n        self[LRU_LIST].unshiftNode(node)\n      }\n    }\n    return hit.value\n  }\n}\n\nconst isStale = (self, hit) => {\n  if (!hit || (!hit.maxAge && !self[MAX_AGE]))\n    return false\n\n  const diff = Date.now() - hit.now\n  return hit.maxAge ? diff > hit.maxAge\n    : self[MAX_AGE] && (diff > self[MAX_AGE])\n}\n\nconst trim = self => {\n  if (self[LENGTH] > self[MAX]) {\n    for (let walker = self[LRU_LIST].tail;\n      self[LENGTH] > self[MAX] && walker !== null;) {\n      // We know that we're about to delete this one, and also\n      // what the next least recently used key will be, so just\n      // go ahead and set it now.\n      const prev = walker.prev\n      del(self, walker)\n      walker = prev\n    }\n  }\n}\n\nconst del = (self, node) => {\n  if (node) {\n    const hit = node.value\n    if (self[DISPOSE])\n      self[DISPOSE](hit.key, hit.value)\n\n    self[LENGTH] -= hit.length\n    self[CACHE].delete(hit.key)\n    self[LRU_LIST].removeNode(node)\n  }\n}\n\nclass Entry {\n  constructor (key, value, length, now, maxAge) {\n    this.key = key\n    this.value = value\n    this.length = length\n    this.now = now\n    this.maxAge = maxAge || 0\n  }\n}\n\nconst forEachStep = (self, fn, node, thisp) => {\n  let hit = node.value\n  if (isStale(self, hit)) {\n    del(self, node)\n    if (!self[ALLOW_STALE])\n      hit = undefined\n  }\n  if (hit)\n    fn.call(thisp, hit.value, hit.key, self)\n}\n\nmodule.exports = LRUCache\n"],"names":["require$$0"],"mappings":";;;AAGA,MAAM,UAAUA,QAAAA;AAEhB,MAAM,MAAM,OAAO,KAAK;AACxB,MAAM,SAAS,OAAO,QAAQ;AAC9B,MAAM,oBAAoB,OAAO,kBAAkB;AACnD,MAAM,cAAc,OAAO,YAAY;AACvC,MAAM,UAAU,OAAO,QAAQ;AAC/B,MAAM,UAAU,OAAO,SAAS;AAChC,MAAM,oBAAoB,OAAO,gBAAgB;AACjD,MAAM,WAAW,OAAO,SAAS;AACjC,MAAM,QAAQ,OAAO,OAAO;AAC5B,MAAM,oBAAoB,OAAO,gBAAgB;AAEjD,MAAM,cAAc,MAAM;AAU1B,MAAM,SAAS;AAAA,EACb,YAAa,SAAS;AACpB,QAAI,OAAO,YAAY;AACrB,gBAAU,EAAE,KAAK,QAAO;AAE1B,QAAI,CAAC;AACH,gBAAU,CAAA;AAEZ,QAAI,QAAQ,QAAQ,OAAO,QAAQ,QAAQ,YAAY,QAAQ,MAAM;AACnE,YAAM,IAAI,UAAU,mCAAmC;AAE7C,SAAK,GAAG,IAAI,QAAQ,OAAO;AAEvC,UAAM,KAAK,QAAQ,UAAU;AAC7B,SAAK,iBAAiB,IAAK,OAAO,OAAO,aAAc,cAAc;AACrE,SAAK,WAAW,IAAI,QAAQ,SAAS;AACrC,QAAI,QAAQ,UAAU,OAAO,QAAQ,WAAW;AAC9C,YAAM,IAAI,UAAU,yBAAyB;AAC/C,SAAK,OAAO,IAAI,QAAQ,UAAU;AAClC,SAAK,OAAO,IAAI,QAAQ;AACxB,SAAK,iBAAiB,IAAI,QAAQ,kBAAkB;AACpD,SAAK,iBAAiB,IAAI,QAAQ,kBAAkB;AACpD,SAAK,MAAK;AAAA,EACd;AAAA;AAAA,EAGE,IAAI,IAAK,IAAI;AACX,QAAI,OAAO,OAAO,YAAY,KAAK;AACjC,YAAM,IAAI,UAAU,mCAAmC;AAEzD,SAAK,GAAG,IAAI,MAAM;AAClB,SAAK,IAAI;AAAA,EACb;AAAA,EACE,IAAI,MAAO;AACT,WAAO,KAAK,GAAG;AAAA,EACnB;AAAA,EAEE,IAAI,WAAY,YAAY;AAC1B,SAAK,WAAW,IAAI,CAAC,CAAC;AAAA,EAC1B;AAAA,EACE,IAAI,aAAc;AAChB,WAAO,KAAK,WAAW;AAAA,EAC3B;AAAA,EAEE,IAAI,OAAQ,IAAI;AACd,QAAI,OAAO,OAAO;AAChB,YAAM,IAAI,UAAU,sCAAsC;AAE5D,SAAK,OAAO,IAAI;AAChB,SAAK,IAAI;AAAA,EACb;AAAA,EACE,IAAI,SAAU;AACZ,WAAO,KAAK,OAAO;AAAA,EACvB;AAAA;AAAA,EAGE,IAAI,iBAAkB,IAAI;AACxB,QAAI,OAAO,OAAO;AAChB,WAAK;AAEP,QAAI,OAAO,KAAK,iBAAiB,GAAG;AAClC,WAAK,iBAAiB,IAAI;AAC1B,WAAK,MAAM,IAAI;AACf,WAAK,QAAQ,EAAE,QAAQ,SAAO;AAC5B,YAAI,SAAS,KAAK,iBAAiB,EAAE,IAAI,OAAO,IAAI,GAAG;AACvD,aAAK,MAAM,KAAK,IAAI;AAAA,MAC5B,CAAO;AAAA,IACP;AACI,SAAK,IAAI;AAAA,EACb;AAAA,EACE,IAAI,mBAAoB;AAAE,WAAO,KAAK,iBAAiB;AAAA,EAAC;AAAA,EAExD,IAAI,SAAU;AAAE,WAAO,KAAK,MAAM;AAAA,EAAC;AAAA,EACnC,IAAI,YAAa;AAAE,WAAO,KAAK,QAAQ,EAAE;AAAA,EAAM;AAAA,EAE/C,SAAU,IAAI,OAAO;AACnB,YAAQ,SAAS;AACjB,aAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,WAAW,QAAO;AACvD,YAAM,OAAO,OAAO;AACpB,kBAAY,MAAM,IAAI,QAAQ,KAAK;AACnC,eAAS;AAAA,IACf;AAAA,EACA;AAAA,EAEE,QAAS,IAAI,OAAO;AAClB,YAAQ,SAAS;AACjB,aAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,WAAW,QAAO;AACvD,YAAM,OAAO,OAAO;AACpB,kBAAY,MAAM,IAAI,QAAQ,KAAK;AACnC,eAAS;AAAA,IACf;AAAA,EACA;AAAA,EAEE,OAAQ;AACN,WAAO,KAAK,QAAQ,EAAE,QAAO,EAAG,IAAI,OAAK,EAAE,GAAG;AAAA,EAClD;AAAA,EAEE,SAAU;AACR,WAAO,KAAK,QAAQ,EAAE,QAAO,EAAG,IAAI,OAAK,EAAE,KAAK;AAAA,EACpD;AAAA,EAEE,QAAS;AACP,QAAI,KAAK,OAAO,KACZ,KAAK,QAAQ,KACb,KAAK,QAAQ,EAAE,QAAQ;AACzB,WAAK,QAAQ,EAAE,QAAQ,SAAO,KAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK,CAAC;AAAA,IACrE;AAEI,SAAK,KAAK,IAAI,oBAAI,IAAG;AACrB,SAAK,QAAQ,IAAI,IAAI,QAAO;AAC5B,SAAK,MAAM,IAAI;AAAA,EACnB;AAAA,EAEE,OAAQ;AACN,WAAO,KAAK,QAAQ,EAAE,IAAI,SACxB,QAAQ,MAAM,GAAG,IAAI,QAAQ;AAAA,MAC3B,GAAG,IAAI;AAAA,MACP,GAAG,IAAI;AAAA,MACP,GAAG,IAAI,OAAO,IAAI,UAAU;AAAA,IACpC,CAAO,EAAE,QAAO,EAAG,OAAO,OAAK,CAAC;AAAA,EAChC;AAAA,EAEE,UAAW;AACT,WAAO,KAAK,QAAQ;AAAA,EACxB;AAAA,EAEE,IAAK,KAAK,OAAO,QAAQ;AACvB,aAAS,UAAU,KAAK,OAAO;AAE/B,QAAI,UAAU,OAAO,WAAW;AAC9B,YAAM,IAAI,UAAU,yBAAyB;AAE/C,UAAM,MAAM,SAAS,KAAK,IAAG,IAAK;AAClC,UAAM,MAAM,KAAK,iBAAiB,EAAE,OAAO,GAAG;AAE9C,QAAI,KAAK,KAAK,EAAE,IAAI,GAAG,GAAG;AACxB,UAAI,MAAM,KAAK,GAAG,GAAG;AACnB,YAAI,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,CAAC;AAC9B,eAAO;AAAA,MACf;AAEM,YAAM,OAAO,KAAK,KAAK,EAAE,IAAI,GAAG;AAChC,YAAM,OAAO,KAAK;AAIlB,UAAI,KAAK,OAAO,GAAG;AACjB,YAAI,CAAC,KAAK,iBAAiB;AACzB,eAAK,OAAO,EAAE,KAAK,KAAK,KAAK;AAAA,MACvC;AAEM,WAAK,MAAM;AACX,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,WAAK,MAAM,KAAK,MAAM,KAAK;AAC3B,WAAK,SAAS;AACd,WAAK,IAAI,GAAG;AACZ,WAAK,IAAI;AACT,aAAO;AAAA,IACb;AAEI,UAAM,MAAM,IAAI,MAAM,KAAK,OAAO,KAAK,KAAK,MAAM;AAGlD,QAAI,IAAI,SAAS,KAAK,GAAG,GAAG;AAC1B,UAAI,KAAK,OAAO;AACd,aAAK,OAAO,EAAE,KAAK,KAAK;AAE1B,aAAO;AAAA,IACb;AAEI,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,QAAQ,EAAE,QAAQ,GAAG;AAC1B,SAAK,KAAK,EAAE,IAAI,KAAK,KAAK,QAAQ,EAAE,IAAI;AACxC,SAAK,IAAI;AACT,WAAO;AAAA,EACX;AAAA,EAEE,IAAK,KAAK;AACR,QAAI,CAAC,KAAK,KAAK,EAAE,IAAI,GAAG,EAAG,QAAO;AAClC,UAAM,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,EAAE;AACjC,WAAO,CAAC,QAAQ,MAAM,GAAG;AAAA,EAC7B;AAAA,EAEE,IAAK,KAAK;AACR,WAAO,IAAI,MAAM,KAAK,IAAI;AAAA,EAC9B;AAAA,EAEE,KAAM,KAAK;AACT,WAAO,IAAI,MAAM,KAAK,KAAK;AAAA,EAC/B;AAAA,EAEE,MAAO;AACL,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,QAAI,CAAC;AACH,aAAO;AAET,QAAI,MAAM,IAAI;AACd,WAAO,KAAK;AAAA,EAChB;AAAA,EAEE,IAAK,KAAK;AACR,QAAI,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,CAAC;AAAA,EAClC;AAAA,EAEE,KAAM,KAAK;AAET,SAAK,MAAK;AAEV,UAAM,MAAM,KAAK,IAAG;AAEpB,aAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,MAAM,IAAI,CAAC;AACjB,YAAM,YAAY,IAAI,KAAK;AAC3B,UAAI,cAAc;AAEhB,aAAK,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,WAClB;AACH,cAAM,SAAS,YAAY;AAE3B,YAAI,SAAS,GAAG;AACd,eAAK,IAAI,IAAI,GAAG,IAAI,GAAG,MAAM;AAAA,QACvC;AAAA,MACA;AAAA,IACA;AAAA,EACA;AAAA,EAEE,QAAS;AACP,SAAK,KAAK,EAAE,QAAQ,CAAC,OAAO,QAAQ,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA,EAC7D;AACA;AAEA,MAAM,MAAM,CAAC,MAAM,KAAK,UAAU;AAChC,QAAM,OAAO,KAAK,KAAK,EAAE,IAAI,GAAG;AAChC,MAAI,MAAM;AACR,UAAM,MAAM,KAAK;AACjB,QAAI,QAAQ,MAAM,GAAG,GAAG;AACtB,UAAI,MAAM,IAAI;AACd,UAAI,CAAC,KAAK,WAAW;AACnB,eAAO;AAAA,IACf,OAAW;AACL,UAAI,OAAO;AACT,YAAI,KAAK,iBAAiB;AACxB,eAAK,MAAM,MAAM,KAAK,IAAG;AAC3B,aAAK,QAAQ,EAAE,YAAY,IAAI;AAAA,MACvC;AAAA,IACA;AACI,WAAO,IAAI;AAAA,EACf;AACA;AAEA,MAAM,UAAU,CAAC,MAAM,QAAQ;AAC7B,MAAI,CAAC,OAAQ,CAAC,IAAI,UAAU,CAAC,KAAK,OAAO;AACvC,WAAO;AAET,QAAM,OAAO,KAAK,IAAG,IAAK,IAAI;AAC9B,SAAO,IAAI,SAAS,OAAO,IAAI,SAC3B,KAAK,OAAO,KAAM,OAAO,KAAK,OAAO;AAC3C;AAEA,MAAM,OAAO,UAAQ;AACnB,MAAI,KAAK,MAAM,IAAI,KAAK,GAAG,GAAG;AAC5B,aAAS,SAAS,KAAK,QAAQ,EAAE,MAC/B,KAAK,MAAM,IAAI,KAAK,GAAG,KAAK,WAAW,QAAO;AAI9C,YAAM,OAAO,OAAO;AACpB,UAAI,MAAM,MAAM;AAChB,eAAS;AAAA,IACf;AAAA,EACA;AACA;AAEA,MAAM,MAAM,CAAC,MAAM,SAAS;AAC1B,MAAI,MAAM;AACR,UAAM,MAAM,KAAK;AACjB,QAAI,KAAK,OAAO;AACd,WAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK;AAElC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,KAAK,EAAE,OAAO,IAAI,GAAG;AAC1B,SAAK,QAAQ,EAAE,WAAW,IAAI;AAAA,EAClC;AACA;AAEA,MAAM,MAAM;AAAA,EACV,YAAa,KAAK,OAAO,QAAQ,KAAK,QAAQ;AAC5C,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,SAAK,MAAM;AACX,SAAK,SAAS,UAAU;AAAA,EAC5B;AACA;AAEA,MAAM,cAAc,CAAC,MAAM,IAAI,MAAM,UAAU;AAC7C,MAAI,MAAM,KAAK;AACf,MAAI,QAAQ,MAAM,GAAG,GAAG;AACtB,QAAI,MAAM,IAAI;AACd,QAAI,CAAC,KAAK,WAAW;AACnB,YAAM;AAAA,EACZ;AACE,MAAI;AACF,OAAG,KAAK,OAAO,IAAI,OAAO,IAAI,KAAK,IAAI;AAC3C;AAEA,IAAA,WAAiB;;","x_google_ignoreList":[0]}

package/dist/_node_modules/lru-cache/index.js

@@ -158,8 +158,7 @@ class LRUCache {
     return true;
   }
   has(key) {
-    if (!this[CACHE].has(key))
-      return false;
+    if (!this[CACHE].has(key)) return false;
     const hit = this[CACHE].get(key).value;
     return !isStale(this, hit);
   }

package/dist/_node_modules/lru-cache/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/lru-cache/index.js"],"sourcesContent":["'use strict'\n\n// A linked list to keep track of recently-used-ness\nconst Yallist = require('yallist')\n\nconst MAX = Symbol('max')\nconst LENGTH = Symbol('length')\nconst LENGTH_CALCULATOR = Symbol('lengthCalculator')\nconst ALLOW_STALE = Symbol('allowStale')\nconst MAX_AGE = Symbol('maxAge')\nconst DISPOSE = Symbol('dispose')\nconst NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet')\nconst LRU_LIST = Symbol('lruList')\nconst CACHE = Symbol('cache')\nconst UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet')\n\nconst naiveLength = () => 1\n\n// lruList is a yallist where the head is the youngest\n// item, and the tail is the oldest.  the list contains the Hit\n// objects as the entries.\n// Each Hit object has a reference to its Yallist.Node.  This\n// never changes.\n//\n// cache is a Map (or PseudoMap) that matches the keys to\n// the Yallist.Node object.\nclass LRUCache {\n  constructor (options) {\n    if (typeof options === 'number')\n      options = { max: options }\n\n    if (!options)\n      options = {}\n\n    if (options.max && (typeof options.max !== 'number' || options.max < 0))\n      throw new TypeError('max must be a non-negative number')\n    // Kind of weird to have a default max of Infinity, but oh well.\n    const max = this[MAX] = options.max || Infinity\n\n    const lc = options.length || naiveLength\n    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc\n    this[ALLOW_STALE] = options.stale || false\n    if (options.maxAge && typeof options.maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n    this[MAX_AGE] = options.maxAge || 0\n    this[DISPOSE] = options.dispose\n    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false\n    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false\n    this.reset()\n  }\n\n  // resize the cache when the max changes.\n  set max (mL) {\n    if (typeof mL !== 'number' || mL < 0)\n      throw new TypeError('max must be a non-negative number')\n\n    this[MAX] = mL || Infinity\n    trim(this)\n  }\n  get max () {\n    return this[MAX]\n  }\n\n  set allowStale (allowStale) {\n    this[ALLOW_STALE] = !!allowStale\n  }\n  get allowStale () {\n    return this[ALLOW_STALE]\n  }\n\n  set maxAge (mA) {\n    if (typeof mA !== 'number')\n      throw new TypeError('maxAge must be a non-negative number')\n\n    this[MAX_AGE] = mA\n    trim(this)\n  }\n  get maxAge () {\n    return this[MAX_AGE]\n  }\n\n  // resize the cache when the lengthCalculator changes.\n  set lengthCalculator (lC) {\n    if (typeof lC !== 'function')\n      lC = naiveLength\n\n    if (lC !== this[LENGTH_CALCULATOR]) {\n      this[LENGTH_CALCULATOR] = lC\n      this[LENGTH] = 0\n      this[LRU_LIST].forEach(hit => {\n        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key)\n        this[LENGTH] += hit.length\n      })\n    }\n    trim(this)\n  }\n  get lengthCalculator () { return this[LENGTH_CALCULATOR] }\n\n  get length () { return this[LENGTH] }\n  get itemCount () { return this[LRU_LIST].length }\n\n  rforEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].tail; walker !== null;) {\n      const prev = walker.prev\n      forEachStep(this, fn, walker, thisp)\n      walker = prev\n    }\n  }\n\n  forEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].head; walker !== null;) {\n      const next = walker.next\n      forEachStep(this, fn, walker, thisp)\n      walker = next\n    }\n  }\n\n  keys () {\n    return this[LRU_LIST].toArray().map(k => k.key)\n  }\n\n  values () {\n    return this[LRU_LIST].toArray().map(k => k.value)\n  }\n\n  reset () {\n    if (this[DISPOSE] &&\n        this[LRU_LIST] &&\n        this[LRU_LIST].length) {\n      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value))\n    }\n\n    this[CACHE] = new Map() // hash of items by key\n    this[LRU_LIST] = new Yallist() // list of items in order of use recency\n    this[LENGTH] = 0 // length of items in the list\n  }\n\n  dump () {\n    return this[LRU_LIST].map(hit =>\n      isStale(this, hit) ? false : {\n        k: hit.key,\n        v: hit.value,\n        e: hit.now + (hit.maxAge || 0)\n      }).toArray().filter(h => h)\n  }\n\n  dumpLru () {\n    return this[LRU_LIST]\n  }\n\n  set (key, value, maxAge) {\n    maxAge = maxAge || this[MAX_AGE]\n\n    if (maxAge && typeof maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n\n    const now = maxAge ? Date.now() : 0\n    const len = this[LENGTH_CALCULATOR](value, key)\n\n    if (this[CACHE].has(key)) {\n      if (len > this[MAX]) {\n        del(this, this[CACHE].get(key))\n        return false\n      }\n\n      const node = this[CACHE].get(key)\n      const item = node.value\n\n      // dispose of the old one before overwriting\n      // split out into 2 ifs for better coverage tracking\n      if (this[DISPOSE]) {\n        if (!this[NO_DISPOSE_ON_SET])\n          this[DISPOSE](key, item.value)\n      }\n\n      item.now = now\n      item.maxAge = maxAge\n      item.value = value\n      this[LENGTH] += len - item.length\n      item.length = len\n      this.get(key)\n      trim(this)\n      return true\n    }\n\n    const hit = new Entry(key, value, len, now, maxAge)\n\n    // oversized objects fall out of cache automatically.\n    if (hit.length > this[MAX]) {\n      if (this[DISPOSE])\n        this[DISPOSE](key, value)\n\n      return false\n    }\n\n    this[LENGTH] += hit.length\n    this[LRU_LIST].unshift(hit)\n    this[CACHE].set(key, this[LRU_LIST].head)\n    trim(this)\n    return true\n  }\n\n  has (key) {\n    if (!this[CACHE].has(key)) return false\n    const hit = this[CACHE].get(key).value\n    return !isStale(this, hit)\n  }\n\n  get (key) {\n    return get(this, key, true)\n  }\n\n  peek (key) {\n    return get(this, key, false)\n  }\n\n  pop () {\n    const node = this[LRU_LIST].tail\n    if (!node)\n      return null\n\n    del(this, node)\n    return node.value\n  }\n\n  del (key) {\n    del(this, this[CACHE].get(key))\n  }\n\n  load (arr) {\n    // reset the cache\n    this.reset()\n\n    const now = Date.now()\n    // A previous serialized cache has the most recent items first\n    for (let l = arr.length - 1; l >= 0; l--) {\n      const hit = arr[l]\n      const expiresAt = hit.e || 0\n      if (expiresAt === 0)\n        // the item was created without expiration in a non aged cache\n        this.set(hit.k, hit.v)\n      else {\n        const maxAge = expiresAt - now\n        // dont add already expired items\n        if (maxAge > 0) {\n          this.set(hit.k, hit.v, maxAge)\n        }\n      }\n    }\n  }\n\n  prune () {\n    this[CACHE].forEach((value, key) => get(this, key, false))\n  }\n}\n\nconst get = (self, key, doUse) => {\n  const node = self[CACHE].get(key)\n  if (node) {\n    const hit = node.value\n    if (isStale(self, hit)) {\n      del(self, node)\n      if (!self[ALLOW_STALE])\n        return undefined\n    } else {\n      if (doUse) {\n        if (self[UPDATE_AGE_ON_GET])\n          node.value.now = Date.now()\n        self[LRU_LIST].unshiftNode(node)\n      }\n    }\n    return hit.value\n  }\n}\n\nconst isStale = (self, hit) => {\n  if (!hit || (!hit.maxAge && !self[MAX_AGE]))\n    return false\n\n  const diff = Date.now() - hit.now\n  return hit.maxAge ? diff > hit.maxAge\n    : self[MAX_AGE] && (diff > self[MAX_AGE])\n}\n\nconst trim = self => {\n  if (self[LENGTH] > self[MAX]) {\n    for (let walker = self[LRU_LIST].tail;\n      self[LENGTH] > self[MAX] && walker !== null;) {\n      // We know that we're about to delete this one, and also\n      // what the next least recently used key will be, so just\n      // go ahead and set it now.\n      const prev = walker.prev\n      del(self, walker)\n      walker = prev\n    }\n  }\n}\n\nconst del = (self, node) => {\n  if (node) {\n    const hit = node.value\n    if (self[DISPOSE])\n      self[DISPOSE](hit.key, hit.value)\n\n    self[LENGTH] -= hit.length\n    self[CACHE].delete(hit.key)\n    self[LRU_LIST].removeNode(node)\n  }\n}\n\nclass Entry {\n  constructor (key, value, length, now, maxAge) {\n    this.key = key\n    this.value = value\n    this.length = length\n    this.now = now\n    this.maxAge = maxAge || 0\n  }\n}\n\nconst forEachStep = (self, fn, node, thisp) => {\n  let hit = node.value\n  if (isStale(self, hit)) {\n    del(self, node)\n    if (!self[ALLOW_STALE])\n      hit = undefined\n  }\n  if (hit)\n    fn.call(thisp, hit.value, hit.key, self)\n}\n\nmodule.exports = LRUCache\n"],"names":["require$$0"],"mappings":";AAGA,MAAM,UAAUA;AAEhB,MAAM,MAAM,OAAO,KAAK;AACxB,MAAM,SAAS,OAAO,QAAQ;AAC9B,MAAM,oBAAoB,OAAO,kBAAkB;AACnD,MAAM,cAAc,OAAO,YAAY;AACvC,MAAM,UAAU,OAAO,QAAQ;AAC/B,MAAM,UAAU,OAAO,SAAS;AAChC,MAAM,oBAAoB,OAAO,gBAAgB;AACjD,MAAM,WAAW,OAAO,SAAS;AACjC,MAAM,QAAQ,OAAO,OAAO;AAC5B,MAAM,oBAAoB,OAAO,gBAAgB;AAEjD,MAAM,cAAc,MAAM;AAU1B,MAAM,SAAS;AAAA,EACb,YAAa,SAAS;AACpB,QAAI,OAAO,YAAY;AACrB,gBAAU,EAAE,KAAK,QAAS;AAE5B,QAAI,CAAC;AACH,gBAAU,CAAE;AAEd,QAAI,QAAQ,QAAQ,OAAO,QAAQ,QAAQ,YAAY,QAAQ,MAAM;AACnE,YAAM,IAAI,UAAU,mCAAmC;AAE7C,SAAK,GAAG,IAAI,QAAQ,OAAO;AAEvC,UAAM,KAAK,QAAQ,UAAU;AAC7B,SAAK,iBAAiB,IAAK,OAAO,OAAO,aAAc,cAAc;AACrE,SAAK,WAAW,IAAI,QAAQ,SAAS;AACrC,QAAI,QAAQ,UAAU,OAAO,QAAQ,WAAW;AAC9C,YAAM,IAAI,UAAU,yBAAyB;AAC/C,SAAK,OAAO,IAAI,QAAQ,UAAU;AAClC,SAAK,OAAO,IAAI,QAAQ;AACxB,SAAK,iBAAiB,IAAI,QAAQ,kBAAkB;AACpD,SAAK,iBAAiB,IAAI,QAAQ,kBAAkB;AACpD,SAAK,MAAO;AAAA,EACb;AAAA;AAAA,EAGD,IAAI,IAAK,IAAI;AACX,QAAI,OAAO,OAAO,YAAY,KAAK;AACjC,YAAM,IAAI,UAAU,mCAAmC;AAEzD,SAAK,GAAG,IAAI,MAAM;AAClB,SAAK,IAAI;AAAA,EACV;AAAA,EACD,IAAI,MAAO;AACT,WAAO,KAAK,GAAG;AAAA,EAChB;AAAA,EAED,IAAI,WAAY,YAAY;AAC1B,SAAK,WAAW,IAAI,CAAC,CAAC;AAAA,EACvB;AAAA,EACD,IAAI,aAAc;AAChB,WAAO,KAAK,WAAW;AAAA,EACxB;AAAA,EAED,IAAI,OAAQ,IAAI;AACd,QAAI,OAAO,OAAO;AAChB,YAAM,IAAI,UAAU,sCAAsC;AAE5D,SAAK,OAAO,IAAI;AAChB,SAAK,IAAI;AAAA,EACV;AAAA,EACD,IAAI,SAAU;AACZ,WAAO,KAAK,OAAO;AAAA,EACpB;AAAA;AAAA,EAGD,IAAI,iBAAkB,IAAI;AACxB,QAAI,OAAO,OAAO;AAChB,WAAK;AAEP,QAAI,OAAO,KAAK,iBAAiB,GAAG;AAClC,WAAK,iBAAiB,IAAI;AAC1B,WAAK,MAAM,IAAI;AACf,WAAK,QAAQ,EAAE,QAAQ,SAAO;AAC5B,YAAI,SAAS,KAAK,iBAAiB,EAAE,IAAI,OAAO,IAAI,GAAG;AACvD,aAAK,MAAM,KAAK,IAAI;AAAA,MAC5B,CAAO;AAAA,IACF;AACD,SAAK,IAAI;AAAA,EACV;AAAA,EACD,IAAI,mBAAoB;AAAE,WAAO,KAAK,iBAAiB;AAAA,EAAG;AAAA,EAE1D,IAAI,SAAU;AAAE,WAAO,KAAK,MAAM;AAAA,EAAG;AAAA,EACrC,IAAI,YAAa;AAAE,WAAO,KAAK,QAAQ,EAAE;AAAA,EAAQ;AAAA,EAEjD,SAAU,IAAI,OAAO;AACnB,YAAQ,SAAS;AACjB,aAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,WAAW,QAAO;AACvD,YAAM,OAAO,OAAO;AACpB,kBAAY,MAAM,IAAI,QAAQ,KAAK;AACnC,eAAS;AAAA,IACV;AAAA,EACF;AAAA,EAED,QAAS,IAAI,OAAO;AAClB,YAAQ,SAAS;AACjB,aAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,WAAW,QAAO;AACvD,YAAM,OAAO,OAAO;AACpB,kBAAY,MAAM,IAAI,QAAQ,KAAK;AACnC,eAAS;AAAA,IACV;AAAA,EACF;AAAA,EAED,OAAQ;AACN,WAAO,KAAK,QAAQ,EAAE,QAAO,EAAG,IAAI,OAAK,EAAE,GAAG;AAAA,EAC/C;AAAA,EAED,SAAU;AACR,WAAO,KAAK,QAAQ,EAAE,QAAO,EAAG,IAAI,OAAK,EAAE,KAAK;AAAA,EACjD;AAAA,EAED,QAAS;AACP,QAAI,KAAK,OAAO,KACZ,KAAK,QAAQ,KACb,KAAK,QAAQ,EAAE,QAAQ;AACzB,WAAK,QAAQ,EAAE,QAAQ,SAAO,KAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK,CAAC;AAAA,IAChE;AAED,SAAK,KAAK,IAAI,oBAAI,IAAK;AACvB,SAAK,QAAQ,IAAI,IAAI,QAAS;AAC9B,SAAK,MAAM,IAAI;AAAA,EAChB;AAAA,EAED,OAAQ;AACN,WAAO,KAAK,QAAQ,EAAE,IAAI,SACxB,QAAQ,MAAM,GAAG,IAAI,QAAQ;AAAA,MAC3B,GAAG,IAAI;AAAA,MACP,GAAG,IAAI;AAAA,MACP,GAAG,IAAI,OAAO,IAAI,UAAU;AAAA,IAC7B,CAAA,EAAE,QAAS,EAAC,OAAO,OAAK,CAAC;AAAA,EAC7B;AAAA,EAED,UAAW;AACT,WAAO,KAAK,QAAQ;AAAA,EACrB;AAAA,EAED,IAAK,KAAK,OAAO,QAAQ;AACvB,aAAS,UAAU,KAAK,OAAO;AAE/B,QAAI,UAAU,OAAO,WAAW;AAC9B,YAAM,IAAI,UAAU,yBAAyB;AAE/C,UAAM,MAAM,SAAS,KAAK,IAAK,IAAG;AAClC,UAAM,MAAM,KAAK,iBAAiB,EAAE,OAAO,GAAG;AAE9C,QAAI,KAAK,KAAK,EAAE,IAAI,GAAG,GAAG;AACxB,UAAI,MAAM,KAAK,GAAG,GAAG;AACnB,YAAI,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,CAAC;AAC9B,eAAO;AAAA,MACR;AAED,YAAM,OAAO,KAAK,KAAK,EAAE,IAAI,GAAG;AAChC,YAAM,OAAO,KAAK;AAIlB,UAAI,KAAK,OAAO,GAAG;AACjB,YAAI,CAAC,KAAK,iBAAiB;AACzB,eAAK,OAAO,EAAE,KAAK,KAAK,KAAK;AAAA,MAChC;AAED,WAAK,MAAM;AACX,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,WAAK,MAAM,KAAK,MAAM,KAAK;AAC3B,WAAK,SAAS;AACd,WAAK,IAAI,GAAG;AACZ,WAAK,IAAI;AACT,aAAO;AAAA,IACR;AAED,UAAM,MAAM,IAAI,MAAM,KAAK,OAAO,KAAK,KAAK,MAAM;AAGlD,QAAI,IAAI,SAAS,KAAK,GAAG,GAAG;AAC1B,UAAI,KAAK,OAAO;AACd,aAAK,OAAO,EAAE,KAAK,KAAK;AAE1B,aAAO;AAAA,IACR;AAED,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,QAAQ,EAAE,QAAQ,GAAG;AAC1B,SAAK,KAAK,EAAE,IAAI,KAAK,KAAK,QAAQ,EAAE,IAAI;AACxC,SAAK,IAAI;AACT,WAAO;AAAA,EACR;AAAA,EAED,IAAK,KAAK;AACR,QAAI,CAAC,KAAK,KAAK,EAAE,IAAI,GAAG;AAAG,aAAO;AAClC,UAAM,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,EAAE;AACjC,WAAO,CAAC,QAAQ,MAAM,GAAG;AAAA,EAC1B;AAAA,EAED,IAAK,KAAK;AACR,WAAO,IAAI,MAAM,KAAK,IAAI;AAAA,EAC3B;AAAA,EAED,KAAM,KAAK;AACT,WAAO,IAAI,MAAM,KAAK,KAAK;AAAA,EAC5B;AAAA,EAED,MAAO;AACL,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,QAAI,CAAC;AACH,aAAO;AAET,QAAI,MAAM,IAAI;AACd,WAAO,KAAK;AAAA,EACb;AAAA,EAED,IAAK,KAAK;AACR,QAAI,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,CAAC;AAAA,EAC/B;AAAA,EAED,KAAM,KAAK;AAET,SAAK,MAAO;AAEZ,UAAM,MAAM,KAAK,IAAK;AAEtB,aAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,MAAM,IAAI,CAAC;AACjB,YAAM,YAAY,IAAI,KAAK;AAC3B,UAAI,cAAc;AAEhB,aAAK,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,WAClB;AACH,cAAM,SAAS,YAAY;AAE3B,YAAI,SAAS,GAAG;AACd,eAAK,IAAI,IAAI,GAAG,IAAI,GAAG,MAAM;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAED,QAAS;AACP,SAAK,KAAK,EAAE,QAAQ,CAAC,OAAO,QAAQ,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA,EAC1D;AACH;AAEA,MAAM,MAAM,CAAC,MAAM,KAAK,UAAU;AAChC,QAAM,OAAO,KAAK,KAAK,EAAE,IAAI,GAAG;AAChC,MAAI,MAAM;AACR,UAAM,MAAM,KAAK;AACjB,QAAI,QAAQ,MAAM,GAAG,GAAG;AACtB,UAAI,MAAM,IAAI;AACd,UAAI,CAAC,KAAK,WAAW;AACnB,eAAO;AAAA,IACf,OAAW;AACL,UAAI,OAAO;AACT,YAAI,KAAK,iBAAiB;AACxB,eAAK,MAAM,MAAM,KAAK,IAAK;AAC7B,aAAK,QAAQ,EAAE,YAAY,IAAI;AAAA,MAChC;AAAA,IACF;AACD,WAAO,IAAI;AAAA,EACZ;AACH;AAEA,MAAM,UAAU,CAAC,MAAM,QAAQ;AAC7B,MAAI,CAAC,OAAQ,CAAC,IAAI,UAAU,CAAC,KAAK,OAAO;AACvC,WAAO;AAET,QAAM,OAAO,KAAK,IAAK,IAAG,IAAI;AAC9B,SAAO,IAAI,SAAS,OAAO,IAAI,SAC3B,KAAK,OAAO,KAAM,OAAO,KAAK,OAAO;AAC3C;AAEA,MAAM,OAAO,UAAQ;AACnB,MAAI,KAAK,MAAM,IAAI,KAAK,GAAG,GAAG;AAC5B,aAAS,SAAS,KAAK,QAAQ,EAAE,MAC/B,KAAK,MAAM,IAAI,KAAK,GAAG,KAAK,WAAW,QAAO;AAI9C,YAAM,OAAO,OAAO;AACpB,UAAI,MAAM,MAAM;AAChB,eAAS;AAAA,IACV;AAAA,EACF;AACH;AAEA,MAAM,MAAM,CAAC,MAAM,SAAS;AAC1B,MAAI,MAAM;AACR,UAAM,MAAM,KAAK;AACjB,QAAI,KAAK,OAAO;AACd,WAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK;AAElC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,KAAK,EAAE,OAAO,IAAI,GAAG;AAC1B,SAAK,QAAQ,EAAE,WAAW,IAAI;AAAA,EAC/B;AACH;AAEA,MAAM,MAAM;AAAA,EACV,YAAa,KAAK,OAAO,QAAQ,KAAK,QAAQ;AAC5C,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,SAAK,MAAM;AACX,SAAK,SAAS,UAAU;AAAA,EACzB;AACH;AAEA,MAAM,cAAc,CAAC,MAAM,IAAI,MAAM,UAAU;AAC7C,MAAI,MAAM,KAAK;AACf,MAAI,QAAQ,MAAM,GAAG,GAAG;AACtB,QAAI,MAAM,IAAI;AACd,QAAI,CAAC,KAAK,WAAW;AACnB,YAAM;AAAA,EACT;AACD,MAAI;AACF,OAAG,KAAK,OAAO,IAAI,OAAO,IAAI,KAAK,IAAI;AAC3C;AAEA,IAAA,WAAiB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/lru-cache/index.js"],"sourcesContent":["'use strict'\n\n// A linked list to keep track of recently-used-ness\nconst Yallist = require('yallist')\n\nconst MAX = Symbol('max')\nconst LENGTH = Symbol('length')\nconst LENGTH_CALCULATOR = Symbol('lengthCalculator')\nconst ALLOW_STALE = Symbol('allowStale')\nconst MAX_AGE = Symbol('maxAge')\nconst DISPOSE = Symbol('dispose')\nconst NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet')\nconst LRU_LIST = Symbol('lruList')\nconst CACHE = Symbol('cache')\nconst UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet')\n\nconst naiveLength = () => 1\n\n// lruList is a yallist where the head is the youngest\n// item, and the tail is the oldest.  the list contains the Hit\n// objects as the entries.\n// Each Hit object has a reference to its Yallist.Node.  This\n// never changes.\n//\n// cache is a Map (or PseudoMap) that matches the keys to\n// the Yallist.Node object.\nclass LRUCache {\n  constructor (options) {\n    if (typeof options === 'number')\n      options = { max: options }\n\n    if (!options)\n      options = {}\n\n    if (options.max && (typeof options.max !== 'number' || options.max < 0))\n      throw new TypeError('max must be a non-negative number')\n    // Kind of weird to have a default max of Infinity, but oh well.\n    const max = this[MAX] = options.max || Infinity\n\n    const lc = options.length || naiveLength\n    this[LENGTH_CALCULATOR] = (typeof lc !== 'function') ? naiveLength : lc\n    this[ALLOW_STALE] = options.stale || false\n    if (options.maxAge && typeof options.maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n    this[MAX_AGE] = options.maxAge || 0\n    this[DISPOSE] = options.dispose\n    this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false\n    this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false\n    this.reset()\n  }\n\n  // resize the cache when the max changes.\n  set max (mL) {\n    if (typeof mL !== 'number' || mL < 0)\n      throw new TypeError('max must be a non-negative number')\n\n    this[MAX] = mL || Infinity\n    trim(this)\n  }\n  get max () {\n    return this[MAX]\n  }\n\n  set allowStale (allowStale) {\n    this[ALLOW_STALE] = !!allowStale\n  }\n  get allowStale () {\n    return this[ALLOW_STALE]\n  }\n\n  set maxAge (mA) {\n    if (typeof mA !== 'number')\n      throw new TypeError('maxAge must be a non-negative number')\n\n    this[MAX_AGE] = mA\n    trim(this)\n  }\n  get maxAge () {\n    return this[MAX_AGE]\n  }\n\n  // resize the cache when the lengthCalculator changes.\n  set lengthCalculator (lC) {\n    if (typeof lC !== 'function')\n      lC = naiveLength\n\n    if (lC !== this[LENGTH_CALCULATOR]) {\n      this[LENGTH_CALCULATOR] = lC\n      this[LENGTH] = 0\n      this[LRU_LIST].forEach(hit => {\n        hit.length = this[LENGTH_CALCULATOR](hit.value, hit.key)\n        this[LENGTH] += hit.length\n      })\n    }\n    trim(this)\n  }\n  get lengthCalculator () { return this[LENGTH_CALCULATOR] }\n\n  get length () { return this[LENGTH] }\n  get itemCount () { return this[LRU_LIST].length }\n\n  rforEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].tail; walker !== null;) {\n      const prev = walker.prev\n      forEachStep(this, fn, walker, thisp)\n      walker = prev\n    }\n  }\n\n  forEach (fn, thisp) {\n    thisp = thisp || this\n    for (let walker = this[LRU_LIST].head; walker !== null;) {\n      const next = walker.next\n      forEachStep(this, fn, walker, thisp)\n      walker = next\n    }\n  }\n\n  keys () {\n    return this[LRU_LIST].toArray().map(k => k.key)\n  }\n\n  values () {\n    return this[LRU_LIST].toArray().map(k => k.value)\n  }\n\n  reset () {\n    if (this[DISPOSE] &&\n        this[LRU_LIST] &&\n        this[LRU_LIST].length) {\n      this[LRU_LIST].forEach(hit => this[DISPOSE](hit.key, hit.value))\n    }\n\n    this[CACHE] = new Map() // hash of items by key\n    this[LRU_LIST] = new Yallist() // list of items in order of use recency\n    this[LENGTH] = 0 // length of items in the list\n  }\n\n  dump () {\n    return this[LRU_LIST].map(hit =>\n      isStale(this, hit) ? false : {\n        k: hit.key,\n        v: hit.value,\n        e: hit.now + (hit.maxAge || 0)\n      }).toArray().filter(h => h)\n  }\n\n  dumpLru () {\n    return this[LRU_LIST]\n  }\n\n  set (key, value, maxAge) {\n    maxAge = maxAge || this[MAX_AGE]\n\n    if (maxAge && typeof maxAge !== 'number')\n      throw new TypeError('maxAge must be a number')\n\n    const now = maxAge ? Date.now() : 0\n    const len = this[LENGTH_CALCULATOR](value, key)\n\n    if (this[CACHE].has(key)) {\n      if (len > this[MAX]) {\n        del(this, this[CACHE].get(key))\n        return false\n      }\n\n      const node = this[CACHE].get(key)\n      const item = node.value\n\n      // dispose of the old one before overwriting\n      // split out into 2 ifs for better coverage tracking\n      if (this[DISPOSE]) {\n        if (!this[NO_DISPOSE_ON_SET])\n          this[DISPOSE](key, item.value)\n      }\n\n      item.now = now\n      item.maxAge = maxAge\n      item.value = value\n      this[LENGTH] += len - item.length\n      item.length = len\n      this.get(key)\n      trim(this)\n      return true\n    }\n\n    const hit = new Entry(key, value, len, now, maxAge)\n\n    // oversized objects fall out of cache automatically.\n    if (hit.length > this[MAX]) {\n      if (this[DISPOSE])\n        this[DISPOSE](key, value)\n\n      return false\n    }\n\n    this[LENGTH] += hit.length\n    this[LRU_LIST].unshift(hit)\n    this[CACHE].set(key, this[LRU_LIST].head)\n    trim(this)\n    return true\n  }\n\n  has (key) {\n    if (!this[CACHE].has(key)) return false\n    const hit = this[CACHE].get(key).value\n    return !isStale(this, hit)\n  }\n\n  get (key) {\n    return get(this, key, true)\n  }\n\n  peek (key) {\n    return get(this, key, false)\n  }\n\n  pop () {\n    const node = this[LRU_LIST].tail\n    if (!node)\n      return null\n\n    del(this, node)\n    return node.value\n  }\n\n  del (key) {\n    del(this, this[CACHE].get(key))\n  }\n\n  load (arr) {\n    // reset the cache\n    this.reset()\n\n    const now = Date.now()\n    // A previous serialized cache has the most recent items first\n    for (let l = arr.length - 1; l >= 0; l--) {\n      const hit = arr[l]\n      const expiresAt = hit.e || 0\n      if (expiresAt === 0)\n        // the item was created without expiration in a non aged cache\n        this.set(hit.k, hit.v)\n      else {\n        const maxAge = expiresAt - now\n        // dont add already expired items\n        if (maxAge > 0) {\n          this.set(hit.k, hit.v, maxAge)\n        }\n      }\n    }\n  }\n\n  prune () {\n    this[CACHE].forEach((value, key) => get(this, key, false))\n  }\n}\n\nconst get = (self, key, doUse) => {\n  const node = self[CACHE].get(key)\n  if (node) {\n    const hit = node.value\n    if (isStale(self, hit)) {\n      del(self, node)\n      if (!self[ALLOW_STALE])\n        return undefined\n    } else {\n      if (doUse) {\n        if (self[UPDATE_AGE_ON_GET])\n          node.value.now = Date.now()\n        self[LRU_LIST].unshiftNode(node)\n      }\n    }\n    return hit.value\n  }\n}\n\nconst isStale = (self, hit) => {\n  if (!hit || (!hit.maxAge && !self[MAX_AGE]))\n    return false\n\n  const diff = Date.now() - hit.now\n  return hit.maxAge ? diff > hit.maxAge\n    : self[MAX_AGE] && (diff > self[MAX_AGE])\n}\n\nconst trim = self => {\n  if (self[LENGTH] > self[MAX]) {\n    for (let walker = self[LRU_LIST].tail;\n      self[LENGTH] > self[MAX] && walker !== null;) {\n      // We know that we're about to delete this one, and also\n      // what the next least recently used key will be, so just\n      // go ahead and set it now.\n      const prev = walker.prev\n      del(self, walker)\n      walker = prev\n    }\n  }\n}\n\nconst del = (self, node) => {\n  if (node) {\n    const hit = node.value\n    if (self[DISPOSE])\n      self[DISPOSE](hit.key, hit.value)\n\n    self[LENGTH] -= hit.length\n    self[CACHE].delete(hit.key)\n    self[LRU_LIST].removeNode(node)\n  }\n}\n\nclass Entry {\n  constructor (key, value, length, now, maxAge) {\n    this.key = key\n    this.value = value\n    this.length = length\n    this.now = now\n    this.maxAge = maxAge || 0\n  }\n}\n\nconst forEachStep = (self, fn, node, thisp) => {\n  let hit = node.value\n  if (isStale(self, hit)) {\n    del(self, node)\n    if (!self[ALLOW_STALE])\n      hit = undefined\n  }\n  if (hit)\n    fn.call(thisp, hit.value, hit.key, self)\n}\n\nmodule.exports = LRUCache\n"],"names":["require$$0"],"mappings":";AAGA,MAAM,UAAUA;AAEhB,MAAM,MAAM,OAAO,KAAK;AACxB,MAAM,SAAS,OAAO,QAAQ;AAC9B,MAAM,oBAAoB,OAAO,kBAAkB;AACnD,MAAM,cAAc,OAAO,YAAY;AACvC,MAAM,UAAU,OAAO,QAAQ;AAC/B,MAAM,UAAU,OAAO,SAAS;AAChC,MAAM,oBAAoB,OAAO,gBAAgB;AACjD,MAAM,WAAW,OAAO,SAAS;AACjC,MAAM,QAAQ,OAAO,OAAO;AAC5B,MAAM,oBAAoB,OAAO,gBAAgB;AAEjD,MAAM,cAAc,MAAM;AAU1B,MAAM,SAAS;AAAA,EACb,YAAa,SAAS;AACpB,QAAI,OAAO,YAAY;AACrB,gBAAU,EAAE,KAAK,QAAO;AAE1B,QAAI,CAAC;AACH,gBAAU,CAAA;AAEZ,QAAI,QAAQ,QAAQ,OAAO,QAAQ,QAAQ,YAAY,QAAQ,MAAM;AACnE,YAAM,IAAI,UAAU,mCAAmC;AAE7C,SAAK,GAAG,IAAI,QAAQ,OAAO;AAEvC,UAAM,KAAK,QAAQ,UAAU;AAC7B,SAAK,iBAAiB,IAAK,OAAO,OAAO,aAAc,cAAc;AACrE,SAAK,WAAW,IAAI,QAAQ,SAAS;AACrC,QAAI,QAAQ,UAAU,OAAO,QAAQ,WAAW;AAC9C,YAAM,IAAI,UAAU,yBAAyB;AAC/C,SAAK,OAAO,IAAI,QAAQ,UAAU;AAClC,SAAK,OAAO,IAAI,QAAQ;AACxB,SAAK,iBAAiB,IAAI,QAAQ,kBAAkB;AACpD,SAAK,iBAAiB,IAAI,QAAQ,kBAAkB;AACpD,SAAK,MAAK;AAAA,EACd;AAAA;AAAA,EAGE,IAAI,IAAK,IAAI;AACX,QAAI,OAAO,OAAO,YAAY,KAAK;AACjC,YAAM,IAAI,UAAU,mCAAmC;AAEzD,SAAK,GAAG,IAAI,MAAM;AAClB,SAAK,IAAI;AAAA,EACb;AAAA,EACE,IAAI,MAAO;AACT,WAAO,KAAK,GAAG;AAAA,EACnB;AAAA,EAEE,IAAI,WAAY,YAAY;AAC1B,SAAK,WAAW,IAAI,CAAC,CAAC;AAAA,EAC1B;AAAA,EACE,IAAI,aAAc;AAChB,WAAO,KAAK,WAAW;AAAA,EAC3B;AAAA,EAEE,IAAI,OAAQ,IAAI;AACd,QAAI,OAAO,OAAO;AAChB,YAAM,IAAI,UAAU,sCAAsC;AAE5D,SAAK,OAAO,IAAI;AAChB,SAAK,IAAI;AAAA,EACb;AAAA,EACE,IAAI,SAAU;AACZ,WAAO,KAAK,OAAO;AAAA,EACvB;AAAA;AAAA,EAGE,IAAI,iBAAkB,IAAI;AACxB,QAAI,OAAO,OAAO;AAChB,WAAK;AAEP,QAAI,OAAO,KAAK,iBAAiB,GAAG;AAClC,WAAK,iBAAiB,IAAI;AAC1B,WAAK,MAAM,IAAI;AACf,WAAK,QAAQ,EAAE,QAAQ,SAAO;AAC5B,YAAI,SAAS,KAAK,iBAAiB,EAAE,IAAI,OAAO,IAAI,GAAG;AACvD,aAAK,MAAM,KAAK,IAAI;AAAA,MAC5B,CAAO;AAAA,IACP;AACI,SAAK,IAAI;AAAA,EACb;AAAA,EACE,IAAI,mBAAoB;AAAE,WAAO,KAAK,iBAAiB;AAAA,EAAC;AAAA,EAExD,IAAI,SAAU;AAAE,WAAO,KAAK,MAAM;AAAA,EAAC;AAAA,EACnC,IAAI,YAAa;AAAE,WAAO,KAAK,QAAQ,EAAE;AAAA,EAAM;AAAA,EAE/C,SAAU,IAAI,OAAO;AACnB,YAAQ,SAAS;AACjB,aAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,WAAW,QAAO;AACvD,YAAM,OAAO,OAAO;AACpB,kBAAY,MAAM,IAAI,QAAQ,KAAK;AACnC,eAAS;AAAA,IACf;AAAA,EACA;AAAA,EAEE,QAAS,IAAI,OAAO;AAClB,YAAQ,SAAS;AACjB,aAAS,SAAS,KAAK,QAAQ,EAAE,MAAM,WAAW,QAAO;AACvD,YAAM,OAAO,OAAO;AACpB,kBAAY,MAAM,IAAI,QAAQ,KAAK;AACnC,eAAS;AAAA,IACf;AAAA,EACA;AAAA,EAEE,OAAQ;AACN,WAAO,KAAK,QAAQ,EAAE,QAAO,EAAG,IAAI,OAAK,EAAE,GAAG;AAAA,EAClD;AAAA,EAEE,SAAU;AACR,WAAO,KAAK,QAAQ,EAAE,QAAO,EAAG,IAAI,OAAK,EAAE,KAAK;AAAA,EACpD;AAAA,EAEE,QAAS;AACP,QAAI,KAAK,OAAO,KACZ,KAAK,QAAQ,KACb,KAAK,QAAQ,EAAE,QAAQ;AACzB,WAAK,QAAQ,EAAE,QAAQ,SAAO,KAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK,CAAC;AAAA,IACrE;AAEI,SAAK,KAAK,IAAI,oBAAI,IAAG;AACrB,SAAK,QAAQ,IAAI,IAAI,QAAO;AAC5B,SAAK,MAAM,IAAI;AAAA,EACnB;AAAA,EAEE,OAAQ;AACN,WAAO,KAAK,QAAQ,EAAE,IAAI,SACxB,QAAQ,MAAM,GAAG,IAAI,QAAQ;AAAA,MAC3B,GAAG,IAAI;AAAA,MACP,GAAG,IAAI;AAAA,MACP,GAAG,IAAI,OAAO,IAAI,UAAU;AAAA,IACpC,CAAO,EAAE,QAAO,EAAG,OAAO,OAAK,CAAC;AAAA,EAChC;AAAA,EAEE,UAAW;AACT,WAAO,KAAK,QAAQ;AAAA,EACxB;AAAA,EAEE,IAAK,KAAK,OAAO,QAAQ;AACvB,aAAS,UAAU,KAAK,OAAO;AAE/B,QAAI,UAAU,OAAO,WAAW;AAC9B,YAAM,IAAI,UAAU,yBAAyB;AAE/C,UAAM,MAAM,SAAS,KAAK,IAAG,IAAK;AAClC,UAAM,MAAM,KAAK,iBAAiB,EAAE,OAAO,GAAG;AAE9C,QAAI,KAAK,KAAK,EAAE,IAAI,GAAG,GAAG;AACxB,UAAI,MAAM,KAAK,GAAG,GAAG;AACnB,YAAI,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,CAAC;AAC9B,eAAO;AAAA,MACf;AAEM,YAAM,OAAO,KAAK,KAAK,EAAE,IAAI,GAAG;AAChC,YAAM,OAAO,KAAK;AAIlB,UAAI,KAAK,OAAO,GAAG;AACjB,YAAI,CAAC,KAAK,iBAAiB;AACzB,eAAK,OAAO,EAAE,KAAK,KAAK,KAAK;AAAA,MACvC;AAEM,WAAK,MAAM;AACX,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,WAAK,MAAM,KAAK,MAAM,KAAK;AAC3B,WAAK,SAAS;AACd,WAAK,IAAI,GAAG;AACZ,WAAK,IAAI;AACT,aAAO;AAAA,IACb;AAEI,UAAM,MAAM,IAAI,MAAM,KAAK,OAAO,KAAK,KAAK,MAAM;AAGlD,QAAI,IAAI,SAAS,KAAK,GAAG,GAAG;AAC1B,UAAI,KAAK,OAAO;AACd,aAAK,OAAO,EAAE,KAAK,KAAK;AAE1B,aAAO;AAAA,IACb;AAEI,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,QAAQ,EAAE,QAAQ,GAAG;AAC1B,SAAK,KAAK,EAAE,IAAI,KAAK,KAAK,QAAQ,EAAE,IAAI;AACxC,SAAK,IAAI;AACT,WAAO;AAAA,EACX;AAAA,EAEE,IAAK,KAAK;AACR,QAAI,CAAC,KAAK,KAAK,EAAE,IAAI,GAAG,EAAG,QAAO;AAClC,UAAM,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,EAAE;AACjC,WAAO,CAAC,QAAQ,MAAM,GAAG;AAAA,EAC7B;AAAA,EAEE,IAAK,KAAK;AACR,WAAO,IAAI,MAAM,KAAK,IAAI;AAAA,EAC9B;AAAA,EAEE,KAAM,KAAK;AACT,WAAO,IAAI,MAAM,KAAK,KAAK;AAAA,EAC/B;AAAA,EAEE,MAAO;AACL,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,QAAI,CAAC;AACH,aAAO;AAET,QAAI,MAAM,IAAI;AACd,WAAO,KAAK;AAAA,EAChB;AAAA,EAEE,IAAK,KAAK;AACR,QAAI,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG,CAAC;AAAA,EAClC;AAAA,EAEE,KAAM,KAAK;AAET,SAAK,MAAK;AAEV,UAAM,MAAM,KAAK,IAAG;AAEpB,aAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,YAAM,MAAM,IAAI,CAAC;AACjB,YAAM,YAAY,IAAI,KAAK;AAC3B,UAAI,cAAc;AAEhB,aAAK,IAAI,IAAI,GAAG,IAAI,CAAC;AAAA,WAClB;AACH,cAAM,SAAS,YAAY;AAE3B,YAAI,SAAS,GAAG;AACd,eAAK,IAAI,IAAI,GAAG,IAAI,GAAG,MAAM;AAAA,QACvC;AAAA,MACA;AAAA,IACA;AAAA,EACA;AAAA,EAEE,QAAS;AACP,SAAK,KAAK,EAAE,QAAQ,CAAC,OAAO,QAAQ,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA,EAC7D;AACA;AAEA,MAAM,MAAM,CAAC,MAAM,KAAK,UAAU;AAChC,QAAM,OAAO,KAAK,KAAK,EAAE,IAAI,GAAG;AAChC,MAAI,MAAM;AACR,UAAM,MAAM,KAAK;AACjB,QAAI,QAAQ,MAAM,GAAG,GAAG;AACtB,UAAI,MAAM,IAAI;AACd,UAAI,CAAC,KAAK,WAAW;AACnB,eAAO;AAAA,IACf,OAAW;AACL,UAAI,OAAO;AACT,YAAI,KAAK,iBAAiB;AACxB,eAAK,MAAM,MAAM,KAAK,IAAG;AAC3B,aAAK,QAAQ,EAAE,YAAY,IAAI;AAAA,MACvC;AAAA,IACA;AACI,WAAO,IAAI;AAAA,EACf;AACA;AAEA,MAAM,UAAU,CAAC,MAAM,QAAQ;AAC7B,MAAI,CAAC,OAAQ,CAAC,IAAI,UAAU,CAAC,KAAK,OAAO;AACvC,WAAO;AAET,QAAM,OAAO,KAAK,IAAG,IAAK,IAAI;AAC9B,SAAO,IAAI,SAAS,OAAO,IAAI,SAC3B,KAAK,OAAO,KAAM,OAAO,KAAK,OAAO;AAC3C;AAEA,MAAM,OAAO,UAAQ;AACnB,MAAI,KAAK,MAAM,IAAI,KAAK,GAAG,GAAG;AAC5B,aAAS,SAAS,KAAK,QAAQ,EAAE,MAC/B,KAAK,MAAM,IAAI,KAAK,GAAG,KAAK,WAAW,QAAO;AAI9C,YAAM,OAAO,OAAO;AACpB,UAAI,MAAM,MAAM;AAChB,eAAS;AAAA,IACf;AAAA,EACA;AACA;AAEA,MAAM,MAAM,CAAC,MAAM,SAAS;AAC1B,MAAI,MAAM;AACR,UAAM,MAAM,KAAK;AACjB,QAAI,KAAK,OAAO;AACd,WAAK,OAAO,EAAE,IAAI,KAAK,IAAI,KAAK;AAElC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,KAAK,EAAE,OAAO,IAAI,GAAG;AAC1B,SAAK,QAAQ,EAAE,WAAW,IAAI;AAAA,EAClC;AACA;AAEA,MAAM,MAAM;AAAA,EACV,YAAa,KAAK,OAAO,QAAQ,KAAK,QAAQ;AAC5C,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,SAAK,MAAM;AACX,SAAK,SAAS,UAAU;AAAA,EAC5B;AACA;AAEA,MAAM,cAAc,CAAC,MAAM,IAAI,MAAM,UAAU;AAC7C,MAAI,MAAM,KAAK;AACf,MAAI,QAAQ,MAAM,GAAG,GAAG;AACtB,QAAI,MAAM,IAAI;AACd,QAAI,CAAC,KAAK,WAAW;AACnB,YAAM;AAAA,EACZ;AACE,MAAI;AACF,OAAG,KAAK,OAAO,IAAI,OAAO,IAAI,KAAK,IAAI;AAC3C;AAEA,IAAA,WAAiB;","x_google_ignoreList":[0]}

package/dist/_node_modules/map-obj/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/map-obj/index.js"],"sourcesContent":["'use strict';\n\nconst isObject = value => typeof value === 'object' && value !== null;\nconst mapObjectSkip = Symbol('skip');\n\n// Customized for this use-case\nconst isObjectCustom = value =>\n\tisObject(value) &&\n\t!(value instanceof RegExp) &&\n\t!(value instanceof Error) &&\n\t!(value instanceof Date);\n\nconst mapObject = (object, mapper, options, isSeen = new WeakMap()) => {\n\toptions = {\n\t\tdeep: false,\n\t\ttarget: {},\n\t\t...options\n\t};\n\n\tif (isSeen.has(object)) {\n\t\treturn isSeen.get(object);\n\t}\n\n\tisSeen.set(object, options.target);\n\n\tconst {target} = options;\n\tdelete options.target;\n\n\tconst mapArray = array => array.map(element => isObjectCustom(element) ? mapObject(element, mapper, options, isSeen) : element);\n\tif (Array.isArray(object)) {\n\t\treturn mapArray(object);\n\t}\n\n\tfor (const [key, value] of Object.entries(object)) {\n\t\tconst mapResult = mapper(key, value, object);\n\n\t\tif (mapResult === mapObjectSkip) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tlet [newKey, newValue, {shouldRecurse = true} = {}] = mapResult;\n\n\t\t// Drop `__proto__` keys.\n\t\tif (newKey === '__proto__') {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (options.deep && shouldRecurse && isObjectCustom(newValue)) {\n\t\t\tnewValue = Array.isArray(newValue) ?\n\t\t\t\tmapArray(newValue) :\n\t\t\t\tmapObject(newValue, mapper, options, isSeen);\n\t\t}\n\n\t\ttarget[newKey] = newValue;\n\t}\n\n\treturn target;\n};\n\nmodule.exports = (object, mapper, options) => {\n\tif (!isObject(object)) {\n\t\tthrow new TypeError(`Expected an object, got \\`${object}\\` (${typeof object})`);\n\t}\n\n\treturn mapObject(object, mapper, options);\n};\n\nmodule.exports.mapObjectSkip = mapObjectSkip;\n"],"names":["mapObjModule"],"mappings":";;;AAEA,MAAM,WAAW,WAAS,OAAO,UAAU,YAAY,UAAU;AACjE,MAAM,gBAAgB,OAAO,MAAM;AAGnC,MAAM,iBAAiB,WACtB,SAAS,KAAK,KACd,EAAE,iBAAiB,WACnB,EAAE,iBAAiB,UACnB,EAAE,iBAAiB;AAEpB,MAAM,YAAY,CAAC,QAAQ,QAAQ,SAAS,SAAS,oBAAI,cAAc;AACtE,YAAU;AAAA,IACT,MAAM;AAAA,IACN,QAAQ,CAAE;AAAA,IACV,GAAG;AAAA,EACL;AAEC,MAAI,OAAO,IAAI,MAAM,GAAG;AACvB,WAAO,OAAO,IAAI,MAAM;AAAA,EACxB;AAED,SAAO,IAAI,QAAQ,QAAQ,MAAM;AAEjC,QAAM,EAAC,OAAM,IAAI;AACjB,SAAO,QAAQ;AAEf,QAAM,WAAW,WAAS,MAAM,IAAI,aAAW,eAAe,OAAO,IAAI,UAAU,SAAS,QAAQ,SAAS,MAAM,IAAI,OAAO;AAC9H,MAAI,MAAM,QAAQ,MAAM,GAAG;AAC1B,WAAO,SAAS,MAAM;AAAA,EACtB;AAED,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AAClD,UAAM,YAAY,OAAO,KAAK,OAAO,MAAM;AAE3C,QAAI,cAAc,eAAe;AAChC;AAAA,IACA;AAED,QAAI,CAAC,QAAQ,UAAU,EAAC,gBAAgB,KAAI,IAAI,CAAA,CAAE,IAAI;AAGtD,QAAI,WAAW,aAAa;AAC3B;AAAA,IACA;AAED,QAAI,QAAQ,QAAQ,iBAAiB,eAAe,QAAQ,GAAG;AAC9D,iBAAW,MAAM,QAAQ,QAAQ,IAChC,SAAS,QAAQ,IACjB,UAAU,UAAU,QAAQ,SAAS,MAAM;AAAA,IAC5C;AAED,WAAO,MAAM,IAAI;AAAA,EACjB;AAED,SAAO;AACR;AAEAA,MAAA,SAAA,UAAiB,CAAC,QAAQ,QAAQ,YAAY;AAC7C,MAAI,CAAC,SAAS,MAAM,GAAG;AACtB,UAAM,IAAI,UAAU,6BAA6B,MAAM,OAAO,OAAO,MAAM,GAAG;AAAA,EAC9E;AAED,SAAO,UAAU,QAAQ,QAAQ,OAAO;AACzC;AAEAA,MAAAA,SAAA,QAAA,gBAA+B;;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/map-obj/index.js"],"sourcesContent":["'use strict';\n\nconst isObject = value => typeof value === 'object' && value !== null;\nconst mapObjectSkip = Symbol('skip');\n\n// Customized for this use-case\nconst isObjectCustom = value =>\n\tisObject(value) &&\n\t!(value instanceof RegExp) &&\n\t!(value instanceof Error) &&\n\t!(value instanceof Date);\n\nconst mapObject = (object, mapper, options, isSeen = new WeakMap()) => {\n\toptions = {\n\t\tdeep: false,\n\t\ttarget: {},\n\t\t...options\n\t};\n\n\tif (isSeen.has(object)) {\n\t\treturn isSeen.get(object);\n\t}\n\n\tisSeen.set(object, options.target);\n\n\tconst {target} = options;\n\tdelete options.target;\n\n\tconst mapArray = array => array.map(element => isObjectCustom(element) ? mapObject(element, mapper, options, isSeen) : element);\n\tif (Array.isArray(object)) {\n\t\treturn mapArray(object);\n\t}\n\n\tfor (const [key, value] of Object.entries(object)) {\n\t\tconst mapResult = mapper(key, value, object);\n\n\t\tif (mapResult === mapObjectSkip) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tlet [newKey, newValue, {shouldRecurse = true} = {}] = mapResult;\n\n\t\t// Drop `__proto__` keys.\n\t\tif (newKey === '__proto__') {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (options.deep && shouldRecurse && isObjectCustom(newValue)) {\n\t\t\tnewValue = Array.isArray(newValue) ?\n\t\t\t\tmapArray(newValue) :\n\t\t\t\tmapObject(newValue, mapper, options, isSeen);\n\t\t}\n\n\t\ttarget[newKey] = newValue;\n\t}\n\n\treturn target;\n};\n\nmodule.exports = (object, mapper, options) => {\n\tif (!isObject(object)) {\n\t\tthrow new TypeError(`Expected an object, got \\`${object}\\` (${typeof object})`);\n\t}\n\n\treturn mapObject(object, mapper, options);\n};\n\nmodule.exports.mapObjectSkip = mapObjectSkip;\n"],"names":["mapObjModule"],"mappings":";;;AAEA,MAAM,WAAW,WAAS,OAAO,UAAU,YAAY,UAAU;AACjE,MAAM,gBAAgB,OAAO,MAAM;AAGnC,MAAM,iBAAiB,WACtB,SAAS,KAAK,KACd,EAAE,iBAAiB,WACnB,EAAE,iBAAiB,UACnB,EAAE,iBAAiB;AAEpB,MAAM,YAAY,CAAC,QAAQ,QAAQ,SAAS,SAAS,oBAAI,cAAc;AACtE,YAAU;AAAA,IACT,MAAM;AAAA,IACN,QAAQ,CAAA;AAAA,IACR,GAAG;AAAA,EACL;AAEC,MAAI,OAAO,IAAI,MAAM,GAAG;AACvB,WAAO,OAAO,IAAI,MAAM;AAAA,EAC1B;AAEC,SAAO,IAAI,QAAQ,QAAQ,MAAM;AAEjC,QAAM,EAAC,OAAM,IAAI;AACjB,SAAO,QAAQ;AAEf,QAAM,WAAW,WAAS,MAAM,IAAI,aAAW,eAAe,OAAO,IAAI,UAAU,SAAS,QAAQ,SAAS,MAAM,IAAI,OAAO;AAC9H,MAAI,MAAM,QAAQ,MAAM,GAAG;AAC1B,WAAO,SAAS,MAAM;AAAA,EACxB;AAEC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AAClD,UAAM,YAAY,OAAO,KAAK,OAAO,MAAM;AAE3C,QAAI,cAAc,eAAe;AAChC;AAAA,IACH;AAEE,QAAI,CAAC,QAAQ,UAAU,EAAC,gBAAgB,KAAI,IAAI,CAAA,CAAE,IAAI;AAGtD,QAAI,WAAW,aAAa;AAC3B;AAAA,IACH;AAEE,QAAI,QAAQ,QAAQ,iBAAiB,eAAe,QAAQ,GAAG;AAC9D,iBAAW,MAAM,QAAQ,QAAQ,IAChC,SAAS,QAAQ,IACjB,UAAU,UAAU,QAAQ,SAAS,MAAM;AAAA,IAC/C;AAEE,WAAO,MAAM,IAAI;AAAA,EACnB;AAEC,SAAO;AACR;AAEAA,MAAAA,SAAA,UAAiB,CAAC,QAAQ,QAAQ,YAAY;AAC7C,MAAI,CAAC,SAAS,MAAM,GAAG;AACtB,UAAM,IAAI,UAAU,6BAA6B,MAAM,OAAO,OAAO,MAAM,GAAG;AAAA,EAChF;AAEC,SAAO,UAAU,QAAQ,QAAQ,OAAO;AACzC;AAEAA,MAAAA,SAAA,QAAA,gBAA+B;;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/map-obj/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/map-obj/index.js"],"sourcesContent":["'use strict';\n\nconst isObject = value => typeof value === 'object' && value !== null;\nconst mapObjectSkip = Symbol('skip');\n\n// Customized for this use-case\nconst isObjectCustom = value =>\n\tisObject(value) &&\n\t!(value instanceof RegExp) &&\n\t!(value instanceof Error) &&\n\t!(value instanceof Date);\n\nconst mapObject = (object, mapper, options, isSeen = new WeakMap()) => {\n\toptions = {\n\t\tdeep: false,\n\t\ttarget: {},\n\t\t...options\n\t};\n\n\tif (isSeen.has(object)) {\n\t\treturn isSeen.get(object);\n\t}\n\n\tisSeen.set(object, options.target);\n\n\tconst {target} = options;\n\tdelete options.target;\n\n\tconst mapArray = array => array.map(element => isObjectCustom(element) ? mapObject(element, mapper, options, isSeen) : element);\n\tif (Array.isArray(object)) {\n\t\treturn mapArray(object);\n\t}\n\n\tfor (const [key, value] of Object.entries(object)) {\n\t\tconst mapResult = mapper(key, value, object);\n\n\t\tif (mapResult === mapObjectSkip) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tlet [newKey, newValue, {shouldRecurse = true} = {}] = mapResult;\n\n\t\t// Drop `__proto__` keys.\n\t\tif (newKey === '__proto__') {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (options.deep && shouldRecurse && isObjectCustom(newValue)) {\n\t\t\tnewValue = Array.isArray(newValue) ?\n\t\t\t\tmapArray(newValue) :\n\t\t\t\tmapObject(newValue, mapper, options, isSeen);\n\t\t}\n\n\t\ttarget[newKey] = newValue;\n\t}\n\n\treturn target;\n};\n\nmodule.exports = (object, mapper, options) => {\n\tif (!isObject(object)) {\n\t\tthrow new TypeError(`Expected an object, got \\`${object}\\` (${typeof object})`);\n\t}\n\n\treturn mapObject(object, mapper, options);\n};\n\nmodule.exports.mapObjectSkip = mapObjectSkip;\n"],"names":["mapObjModule"],"mappings":";;AAEA,MAAM,WAAW,WAAS,OAAO,UAAU,YAAY,UAAU;AACjE,MAAM,gBAAgB,OAAO,MAAM;AAGnC,MAAM,iBAAiB,WACtB,SAAS,KAAK,KACd,EAAE,iBAAiB,WACnB,EAAE,iBAAiB,UACnB,EAAE,iBAAiB;AAEpB,MAAM,YAAY,CAAC,QAAQ,QAAQ,SAAS,SAAS,oBAAI,cAAc;AACtE,YAAU;AAAA,IACT,MAAM;AAAA,IACN,QAAQ,CAAE;AAAA,IACV,GAAG;AAAA,EACL;AAEC,MAAI,OAAO,IAAI,MAAM,GAAG;AACvB,WAAO,OAAO,IAAI,MAAM;AAAA,EACxB;AAED,SAAO,IAAI,QAAQ,QAAQ,MAAM;AAEjC,QAAM,EAAC,OAAM,IAAI;AACjB,SAAO,QAAQ;AAEf,QAAM,WAAW,WAAS,MAAM,IAAI,aAAW,eAAe,OAAO,IAAI,UAAU,SAAS,QAAQ,SAAS,MAAM,IAAI,OAAO;AAC9H,MAAI,MAAM,QAAQ,MAAM,GAAG;AAC1B,WAAO,SAAS,MAAM;AAAA,EACtB;AAED,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AAClD,UAAM,YAAY,OAAO,KAAK,OAAO,MAAM;AAE3C,QAAI,cAAc,eAAe;AAChC;AAAA,IACA;AAED,QAAI,CAAC,QAAQ,UAAU,EAAC,gBAAgB,KAAI,IAAI,CAAA,CAAE,IAAI;AAGtD,QAAI,WAAW,aAAa;AAC3B;AAAA,IACA;AAED,QAAI,QAAQ,QAAQ,iBAAiB,eAAe,QAAQ,GAAG;AAC9D,iBAAW,MAAM,QAAQ,QAAQ,IAChC,SAAS,QAAQ,IACjB,UAAU,UAAU,QAAQ,SAAS,MAAM;AAAA,IAC5C;AAED,WAAO,MAAM,IAAI;AAAA,EACjB;AAED,SAAO;AACR;AAEAA,OAAA,UAAiB,CAAC,QAAQ,QAAQ,YAAY;AAC7C,MAAI,CAAC,SAAS,MAAM,GAAG;AACtB,UAAM,IAAI,UAAU,6BAA6B,MAAM,OAAO,OAAO,MAAM,GAAG;AAAA,EAC9E;AAED,SAAO,UAAU,QAAQ,QAAQ,OAAO;AACzC;AAEAA,OAAA,QAAA,gBAA+B;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/map-obj/index.js"],"sourcesContent":["'use strict';\n\nconst isObject = value => typeof value === 'object' && value !== null;\nconst mapObjectSkip = Symbol('skip');\n\n// Customized for this use-case\nconst isObjectCustom = value =>\n\tisObject(value) &&\n\t!(value instanceof RegExp) &&\n\t!(value instanceof Error) &&\n\t!(value instanceof Date);\n\nconst mapObject = (object, mapper, options, isSeen = new WeakMap()) => {\n\toptions = {\n\t\tdeep: false,\n\t\ttarget: {},\n\t\t...options\n\t};\n\n\tif (isSeen.has(object)) {\n\t\treturn isSeen.get(object);\n\t}\n\n\tisSeen.set(object, options.target);\n\n\tconst {target} = options;\n\tdelete options.target;\n\n\tconst mapArray = array => array.map(element => isObjectCustom(element) ? mapObject(element, mapper, options, isSeen) : element);\n\tif (Array.isArray(object)) {\n\t\treturn mapArray(object);\n\t}\n\n\tfor (const [key, value] of Object.entries(object)) {\n\t\tconst mapResult = mapper(key, value, object);\n\n\t\tif (mapResult === mapObjectSkip) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tlet [newKey, newValue, {shouldRecurse = true} = {}] = mapResult;\n\n\t\t// Drop `__proto__` keys.\n\t\tif (newKey === '__proto__') {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (options.deep && shouldRecurse && isObjectCustom(newValue)) {\n\t\t\tnewValue = Array.isArray(newValue) ?\n\t\t\t\tmapArray(newValue) :\n\t\t\t\tmapObject(newValue, mapper, options, isSeen);\n\t\t}\n\n\t\ttarget[newKey] = newValue;\n\t}\n\n\treturn target;\n};\n\nmodule.exports = (object, mapper, options) => {\n\tif (!isObject(object)) {\n\t\tthrow new TypeError(`Expected an object, got \\`${object}\\` (${typeof object})`);\n\t}\n\n\treturn mapObject(object, mapper, options);\n};\n\nmodule.exports.mapObjectSkip = mapObjectSkip;\n"],"names":["mapObjModule"],"mappings":";;AAEA,MAAM,WAAW,WAAS,OAAO,UAAU,YAAY,UAAU;AACjE,MAAM,gBAAgB,OAAO,MAAM;AAGnC,MAAM,iBAAiB,WACtB,SAAS,KAAK,KACd,EAAE,iBAAiB,WACnB,EAAE,iBAAiB,UACnB,EAAE,iBAAiB;AAEpB,MAAM,YAAY,CAAC,QAAQ,QAAQ,SAAS,SAAS,oBAAI,cAAc;AACtE,YAAU;AAAA,IACT,MAAM;AAAA,IACN,QAAQ,CAAA;AAAA,IACR,GAAG;AAAA,EACL;AAEC,MAAI,OAAO,IAAI,MAAM,GAAG;AACvB,WAAO,OAAO,IAAI,MAAM;AAAA,EAC1B;AAEC,SAAO,IAAI,QAAQ,QAAQ,MAAM;AAEjC,QAAM,EAAC,OAAM,IAAI;AACjB,SAAO,QAAQ;AAEf,QAAM,WAAW,WAAS,MAAM,IAAI,aAAW,eAAe,OAAO,IAAI,UAAU,SAAS,QAAQ,SAAS,MAAM,IAAI,OAAO;AAC9H,MAAI,MAAM,QAAQ,MAAM,GAAG;AAC1B,WAAO,SAAS,MAAM;AAAA,EACxB;AAEC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AAClD,UAAM,YAAY,OAAO,KAAK,OAAO,MAAM;AAE3C,QAAI,cAAc,eAAe;AAChC;AAAA,IACH;AAEE,QAAI,CAAC,QAAQ,UAAU,EAAC,gBAAgB,KAAI,IAAI,CAAA,CAAE,IAAI;AAGtD,QAAI,WAAW,aAAa;AAC3B;AAAA,IACH;AAEE,QAAI,QAAQ,QAAQ,iBAAiB,eAAe,QAAQ,GAAG;AAC9D,iBAAW,MAAM,QAAQ,QAAQ,IAChC,SAAS,QAAQ,IACjB,UAAU,UAAU,QAAQ,SAAS,MAAM;AAAA,IAC/C;AAEE,WAAO,MAAM,IAAI;AAAA,EACnB;AAEC,SAAO;AACR;AAEAA,OAAA,UAAiB,CAAC,QAAQ,QAAQ,YAAY;AAC7C,MAAI,CAAC,SAAS,MAAM,GAAG;AACtB,UAAM,IAAI,UAAU,6BAA6B,MAAM,OAAO,OAAO,MAAM,GAAG;AAAA,EAChF;AAEC,SAAO,UAAU,QAAQ,QAAQ,OAAO;AACzC;AAEAA,OAAA,QAAA,gBAA+B;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/meow/_node_modules/decamelize-keys/_node_modules/decamelize/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../../../../../node_modules/meow/node_modules/decamelize-keys/node_modules/decamelize/index.js"],"sourcesContent":["'use strict';\nmodule.exports = function (str, sep) {\n\tif (typeof str !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\tsep = typeof sep === 'undefined' ? '_' : sep;\n\n\treturn str\n\t\t.replace(/([a-z\\d])([A-Z])/g, '$1' + sep + '$2')\n\t\t.replace(/([A-Z]+)([A-Z][a-z\\d]+)/g, '$1' + sep + '$2')\n\t\t.toLowerCase();\n};\n"],"names":[],"mappings":";;AACA,IAAA,aAAiB,SAAU,KAAK,KAAK;AACpC,MAAI,OAAO,QAAQ,UAAU;AAC5B,UAAM,IAAI,UAAU,mBAAmB;AAAA,EACvC;AAED,QAAM,OAAO,QAAQ,cAAc,MAAM;AAEzC,SAAO,IACL,QAAQ,qBAAqB,OAAO,MAAM,IAAI,EAC9C,QAAQ,4BAA4B,OAAO,MAAM,IAAI,EACrD;AACH;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../../../../../node_modules/meow/node_modules/decamelize-keys/node_modules/decamelize/index.js"],"sourcesContent":["'use strict';\nmodule.exports = function (str, sep) {\n\tif (typeof str !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\tsep = typeof sep === 'undefined' ? '_' : sep;\n\n\treturn str\n\t\t.replace(/([a-z\\d])([A-Z])/g, '$1' + sep + '$2')\n\t\t.replace(/([A-Z]+)([A-Z][a-z\\d]+)/g, '$1' + sep + '$2')\n\t\t.toLowerCase();\n};\n"],"names":[],"mappings":";;AACA,IAAA,aAAiB,SAAU,KAAK,KAAK;AACpC,MAAI,OAAO,QAAQ,UAAU;AAC5B,UAAM,IAAI,UAAU,mBAAmB;AAAA,EACzC;AAEC,QAAM,OAAO,QAAQ,cAAc,MAAM;AAEzC,SAAO,IACL,QAAQ,qBAAqB,OAAO,MAAM,IAAI,EAC9C,QAAQ,4BAA4B,OAAO,MAAM,IAAI,EACrD,YAAW;AACd;;","x_google_ignoreList":[0]}

package/dist/_node_modules/meow/_node_modules/decamelize-keys/_node_modules/decamelize/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/meow/node_modules/decamelize-keys/node_modules/decamelize/index.js"],"sourcesContent":["'use strict';\nmodule.exports = function (str, sep) {\n\tif (typeof str !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\tsep = typeof sep === 'undefined' ? '_' : sep;\n\n\treturn str\n\t\t.replace(/([a-z\\d])([A-Z])/g, '$1' + sep + '$2')\n\t\t.replace(/([A-Z]+)([A-Z][a-z\\d]+)/g, '$1' + sep + '$2')\n\t\t.toLowerCase();\n};\n"],"names":[],"mappings":"AACA,IAAA,aAAiB,SAAU,KAAK,KAAK;AACpC,MAAI,OAAO,QAAQ,UAAU;AAC5B,UAAM,IAAI,UAAU,mBAAmB;AAAA,EACvC;AAED,QAAM,OAAO,QAAQ,cAAc,MAAM;AAEzC,SAAO,IACL,QAAQ,qBAAqB,OAAO,MAAM,IAAI,EAC9C,QAAQ,4BAA4B,OAAO,MAAM,IAAI,EACrD;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../../../../../node_modules/meow/node_modules/decamelize-keys/node_modules/decamelize/index.js"],"sourcesContent":["'use strict';\nmodule.exports = function (str, sep) {\n\tif (typeof str !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\tsep = typeof sep === 'undefined' ? '_' : sep;\n\n\treturn str\n\t\t.replace(/([a-z\\d])([A-Z])/g, '$1' + sep + '$2')\n\t\t.replace(/([A-Z]+)([A-Z][a-z\\d]+)/g, '$1' + sep + '$2')\n\t\t.toLowerCase();\n};\n"],"names":[],"mappings":"AACA,IAAA,aAAiB,SAAU,KAAK,KAAK;AACpC,MAAI,OAAO,QAAQ,UAAU;AAC5B,UAAM,IAAI,UAAU,mBAAmB;AAAA,EACzC;AAEC,QAAM,OAAO,QAAQ,cAAc,MAAM;AAEzC,SAAO,IACL,QAAQ,qBAAqB,OAAO,MAAM,IAAI,EAC9C,QAAQ,4BAA4B,OAAO,MAAM,IAAI,EACrD,YAAW;AACd;","x_google_ignoreList":[0]}

package/dist/_node_modules/meow/_node_modules/decamelize-keys/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../../../node_modules/meow/node_modules/decamelize-keys/index.js"],"sourcesContent":["'use strict';\nvar mapObj = require('map-obj');\nvar decamelize = require('decamelize');\n\nmodule.exports = function (input, separator, options) {\n\tif (typeof separator !== 'string') {\n\t\toptions = separator;\n\t\tseparator = null;\n\t}\n\n\toptions = options || {};\n\tseparator = separator || options.separator;\n\tvar exclude = options.exclude || [];\n\n\treturn mapObj(input, function (key, val) {\n\t\tkey = exclude.indexOf(key) === -1 ? decamelize(key, separator) : key;\n\t\treturn [key, val];\n\t});\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;;AACA,IAAI,SAASA,MAAAA;AACb,IAAI,aAAaC,QAAAA;AAEjB,IAAA,iBAAiB,SAAU,OAAO,WAAW,SAAS;AACrD,MAAI,OAAO,cAAc,UAAU;AAClC,cAAU;AACV,gBAAY;AAAA,EACZ;AAED,YAAU,WAAW;AACrB,cAAY,aAAa,QAAQ;AACjC,MAAI,UAAU,QAAQ,WAAW;AAEjC,SAAO,OAAO,OAAO,SAAU,KAAK,KAAK;AACxC,UAAM,QAAQ,QAAQ,GAAG,MAAM,KAAK,WAAW,KAAK,SAAS,IAAI;AACjE,WAAO,CAAC,KAAK,GAAG;AAAA,EAClB,CAAE;AACF;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../../../node_modules/meow/node_modules/decamelize-keys/index.js"],"sourcesContent":["'use strict';\nvar mapObj = require('map-obj');\nvar decamelize = require('decamelize');\n\nmodule.exports = function (input, separator, options) {\n\tif (typeof separator !== 'string') {\n\t\toptions = separator;\n\t\tseparator = null;\n\t}\n\n\toptions = options || {};\n\tseparator = separator || options.separator;\n\tvar exclude = options.exclude || [];\n\n\treturn mapObj(input, function (key, val) {\n\t\tkey = exclude.indexOf(key) === -1 ? decamelize(key, separator) : key;\n\t\treturn [key, val];\n\t});\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;;AACA,IAAI,SAASA,MAAAA;AACb,IAAI,aAAaC,QAAAA;AAEjB,IAAA,iBAAiB,SAAU,OAAO,WAAW,SAAS;AACrD,MAAI,OAAO,cAAc,UAAU;AAClC,cAAU;AACV,gBAAY;AAAA,EACd;AAEC,YAAU,WAAW,CAAA;AACrB,cAAY,aAAa,QAAQ;AACjC,MAAI,UAAU,QAAQ,WAAW,CAAA;AAEjC,SAAO,OAAO,OAAO,SAAU,KAAK,KAAK;AACxC,UAAM,QAAQ,QAAQ,GAAG,MAAM,KAAK,WAAW,KAAK,SAAS,IAAI;AACjE,WAAO,CAAC,KAAK,GAAG;AAAA,EAClB,CAAE;AACF;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/meow/_node_modules/decamelize-keys/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/meow/node_modules/decamelize-keys/index.js"],"sourcesContent":["'use strict';\nvar mapObj = require('map-obj');\nvar decamelize = require('decamelize');\n\nmodule.exports = function (input, separator, options) {\n\tif (typeof separator !== 'string') {\n\t\toptions = separator;\n\t\tseparator = null;\n\t}\n\n\toptions = options || {};\n\tseparator = separator || options.separator;\n\tvar exclude = options.exclude || [];\n\n\treturn mapObj(input, function (key, val) {\n\t\tkey = exclude.indexOf(key) === -1 ? decamelize(key, separator) : key;\n\t\treturn [key, val];\n\t});\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;AACA,IAAI,SAASA;AACb,IAAI,aAAaC;AAEjB,IAAA,iBAAiB,SAAU,OAAO,WAAW,SAAS;AACrD,MAAI,OAAO,cAAc,UAAU;AAClC,cAAU;AACV,gBAAY;AAAA,EACZ;AAED,YAAU,WAAW;AACrB,cAAY,aAAa,QAAQ;AACjC,MAAI,UAAU,QAAQ,WAAW;AAEjC,SAAO,OAAO,OAAO,SAAU,KAAK,KAAK;AACxC,UAAM,QAAQ,QAAQ,GAAG,MAAM,KAAK,WAAW,KAAK,SAAS,IAAI;AACjE,WAAO,CAAC,KAAK,GAAG;AAAA,EAClB,CAAE;AACF;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/meow/node_modules/decamelize-keys/index.js"],"sourcesContent":["'use strict';\nvar mapObj = require('map-obj');\nvar decamelize = require('decamelize');\n\nmodule.exports = function (input, separator, options) {\n\tif (typeof separator !== 'string') {\n\t\toptions = separator;\n\t\tseparator = null;\n\t}\n\n\toptions = options || {};\n\tseparator = separator || options.separator;\n\tvar exclude = options.exclude || [];\n\n\treturn mapObj(input, function (key, val) {\n\t\tkey = exclude.indexOf(key) === -1 ? decamelize(key, separator) : key;\n\t\treturn [key, val];\n\t});\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;AACA,IAAI,SAASA;AACb,IAAI,aAAaC;AAEjB,IAAA,iBAAiB,SAAU,OAAO,WAAW,SAAS;AACrD,MAAI,OAAO,cAAc,UAAU;AAClC,cAAU;AACV,gBAAY;AAAA,EACd;AAEC,YAAU,WAAW,CAAA;AACrB,cAAY,aAAa,QAAQ;AACjC,MAAI,UAAU,QAAQ,WAAW,CAAA;AAEjC,SAAO,OAAO,OAAO,SAAU,KAAK,KAAK;AACxC,UAAM,QAAQ,QAAQ,GAAG,MAAM,KAAK,WAAW,KAAK,SAAS,IAAI;AACjE,WAAO,CAAC,KAAK,GAAG;AAAA,EAClB,CAAE;AACF;;","x_google_ignoreList":[0]}

package/dist/_node_modules/meow/_node_modules/find-up/index.cjs

@@ -13,14 +13,9 @@ function findUpMultipleSync(name, options = {}) {
   const limit = options.limit || Number.POSITIVE_INFINITY;
   const paths = [name].flat();
   const runMatcher = (locateOptions) => {
-    if (typeof name !== "function") {
+    {
       return index.locatePathSync(paths, locateOptions);
     }
-    const foundPath = name(locateOptions.cwd);
-    if (typeof foundPath === "string") {
-      return index.locatePathSync([foundPath], locateOptions);
-    }
-    return foundPath;
   };
   const matches = [];
   while (true) {

package/dist/_node_modules/meow/_node_modules/find-up/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../../../node_modules/meow/node_modules/find-up/index.js"],"sourcesContent":["import path from 'node:path';\nimport {fileURLToPath} from 'node:url';\nimport {locatePath, locatePathSync} from 'locate-path';\n\nconst toPath = urlOrPath => urlOrPath instanceof URL ? fileURLToPath(urlOrPath) : urlOrPath;\n\nexport const findUpStop = Symbol('findUpStop');\n\nexport async function findUpMultiple(name, options = {}) {\n\tlet directory = path.resolve(toPath(options.cwd) || '');\n\tconst {root} = path.parse(directory);\n\tconst stopAt = path.resolve(directory, options.stopAt || root);\n\tconst limit = options.limit || Number.POSITIVE_INFINITY;\n\tconst paths = [name].flat();\n\n\tconst runMatcher = async locateOptions => {\n\t\tif (typeof name !== 'function') {\n\t\t\treturn locatePath(paths, locateOptions);\n\t\t}\n\n\t\tconst foundPath = await name(locateOptions.cwd);\n\t\tif (typeof foundPath === 'string') {\n\t\t\treturn locatePath([foundPath], locateOptions);\n\t\t}\n\n\t\treturn foundPath;\n\t};\n\n\tconst matches = [];\n\t// eslint-disable-next-line no-constant-condition\n\twhile (true) {\n\t\t// eslint-disable-next-line no-await-in-loop\n\t\tconst foundPath = await runMatcher({...options, cwd: directory});\n\n\t\tif (foundPath === findUpStop) {\n\t\t\tbreak;\n\t\t}\n\n\t\tif (foundPath) {\n\t\t\tmatches.push(path.resolve(directory, foundPath));\n\t\t}\n\n\t\tif (directory === stopAt || matches.length >= limit) {\n\t\t\tbreak;\n\t\t}\n\n\t\tdirectory = path.dirname(directory);\n\t}\n\n\treturn matches;\n}\n\nexport function findUpMultipleSync(name, options = {}) {\n\tlet directory = path.resolve(toPath(options.cwd) || '');\n\tconst {root} = path.parse(directory);\n\tconst stopAt = options.stopAt || root;\n\tconst limit = options.limit || Number.POSITIVE_INFINITY;\n\tconst paths = [name].flat();\n\n\tconst runMatcher = locateOptions => {\n\t\tif (typeof name !== 'function') {\n\t\t\treturn locatePathSync(paths, locateOptions);\n\t\t}\n\n\t\tconst foundPath = name(locateOptions.cwd);\n\t\tif (typeof foundPath === 'string') {\n\t\t\treturn locatePathSync([foundPath], locateOptions);\n\t\t}\n\n\t\treturn foundPath;\n\t};\n\n\tconst matches = [];\n\t// eslint-disable-next-line no-constant-condition\n\twhile (true) {\n\t\tconst foundPath = runMatcher({...options, cwd: directory});\n\n\t\tif (foundPath === findUpStop) {\n\t\t\tbreak;\n\t\t}\n\n\t\tif (foundPath) {\n\t\t\tmatches.push(path.resolve(directory, foundPath));\n\t\t}\n\n\t\tif (directory === stopAt || matches.length >= limit) {\n\t\t\tbreak;\n\t\t}\n\n\t\tdirectory = path.dirname(directory);\n\t}\n\n\treturn matches;\n}\n\nexport async function findUp(name, options = {}) {\n\tconst matches = await findUpMultiple(name, {...options, limit: 1});\n\treturn matches[0];\n}\n\nexport function findUpSync(name, options = {}) {\n\tconst matches = findUpMultipleSync(name, {...options, limit: 1});\n\treturn matches[0];\n}\n\nexport {\n\tpathExists,\n\tpathExistsSync,\n} from 'path-exists';\n"],"names":["fileURLToPath","locatePathSync"],"mappings":";;;;;;AAIA,MAAM,SAAS,eAAa,qBAAqB,MAAMA,IAAAA,cAAc,SAAS,IAAI;AAEtE,MAAC,aAAa,OAAO,YAAY;AA8CtC,SAAS,mBAAmB,MAAM,UAAU,IAAI;AACtD,MAAI,YAAY,KAAK,QAAQ,OAAO,QAAQ,GAAG,KAAK,EAAE;AACtD,QAAM,EAAC,KAAI,IAAI,KAAK,MAAM,SAAS;AACnC,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,QAAQ,QAAQ,SAAS,OAAO;AACtC,QAAM,QAAQ,CAAC,IAAI,EAAE,KAAI;AAEzB,QAAM,aAAa,mBAAiB;AACnC,QAAI,OAAO,SAAS,YAAY;AAC/B,aAAOC,MAAc,eAAC,OAAO,aAAa;AAAA,IAC1C;AAED,UAAM,YAAY,KAAK,cAAc,GAAG;AACxC,QAAI,OAAO,cAAc,UAAU;AAClC,aAAOA,qBAAe,CAAC,SAAS,GAAG,aAAa;AAAA,IAChD;AAED,WAAO;AAAA,EACT;AAEC,QAAM,UAAU,CAAA;AAEhB,SAAO,MAAM;AACZ,UAAM,YAAY,WAAW,EAAC,GAAG,SAAS,KAAK,UAAS,CAAC;AAEzD,QAAI,cAAc,YAAY;AAC7B;AAAA,IACA;AAED,QAAI,WAAW;AACd,cAAQ,KAAK,KAAK,QAAQ,WAAW,SAAS,CAAC;AAAA,IAC/C;AAED,QAAI,cAAc,UAAU,QAAQ,UAAU,OAAO;AACpD;AAAA,IACA;AAED,gBAAY,KAAK,QAAQ,SAAS;AAAA,EAClC;AAED,SAAO;AACR;AAOO,SAAS,WAAW,MAAM,UAAU,IAAI;AAC9C,QAAM,UAAU,mBAAmB,MAAM,EAAC,GAAG,SAAS,OAAO,EAAC,CAAC;AAC/D,SAAO,QAAQ,CAAC;AACjB;;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../../../node_modules/meow/node_modules/find-up/index.js"],"sourcesContent":["import path from 'node:path';\nimport {fileURLToPath} from 'node:url';\nimport {locatePath, locatePathSync} from 'locate-path';\n\nconst toPath = urlOrPath => urlOrPath instanceof URL ? fileURLToPath(urlOrPath) : urlOrPath;\n\nexport const findUpStop = Symbol('findUpStop');\n\nexport async function findUpMultiple(name, options = {}) {\n\tlet directory = path.resolve(toPath(options.cwd) || '');\n\tconst {root} = path.parse(directory);\n\tconst stopAt = path.resolve(directory, options.stopAt || root);\n\tconst limit = options.limit || Number.POSITIVE_INFINITY;\n\tconst paths = [name].flat();\n\n\tconst runMatcher = async locateOptions => {\n\t\tif (typeof name !== 'function') {\n\t\t\treturn locatePath(paths, locateOptions);\n\t\t}\n\n\t\tconst foundPath = await name(locateOptions.cwd);\n\t\tif (typeof foundPath === 'string') {\n\t\t\treturn locatePath([foundPath], locateOptions);\n\t\t}\n\n\t\treturn foundPath;\n\t};\n\n\tconst matches = [];\n\t// eslint-disable-next-line no-constant-condition\n\twhile (true) {\n\t\t// eslint-disable-next-line no-await-in-loop\n\t\tconst foundPath = await runMatcher({...options, cwd: directory});\n\n\t\tif (foundPath === findUpStop) {\n\t\t\tbreak;\n\t\t}\n\n\t\tif (foundPath) {\n\t\t\tmatches.push(path.resolve(directory, foundPath));\n\t\t}\n\n\t\tif (directory === stopAt || matches.length >= limit) {\n\t\t\tbreak;\n\t\t}\n\n\t\tdirectory = path.dirname(directory);\n\t}\n\n\treturn matches;\n}\n\nexport function findUpMultipleSync(name, options = {}) {\n\tlet directory = path.resolve(toPath(options.cwd) || '');\n\tconst {root} = path.parse(directory);\n\tconst stopAt = options.stopAt || root;\n\tconst limit = options.limit || Number.POSITIVE_INFINITY;\n\tconst paths = [name].flat();\n\n\tconst runMatcher = locateOptions => {\n\t\tif (typeof name !== 'function') {\n\t\t\treturn locatePathSync(paths, locateOptions);\n\t\t}\n\n\t\tconst foundPath = name(locateOptions.cwd);\n\t\tif (typeof foundPath === 'string') {\n\t\t\treturn locatePathSync([foundPath], locateOptions);\n\t\t}\n\n\t\treturn foundPath;\n\t};\n\n\tconst matches = [];\n\t// eslint-disable-next-line no-constant-condition\n\twhile (true) {\n\t\tconst foundPath = runMatcher({...options, cwd: directory});\n\n\t\tif (foundPath === findUpStop) {\n\t\t\tbreak;\n\t\t}\n\n\t\tif (foundPath) {\n\t\t\tmatches.push(path.resolve(directory, foundPath));\n\t\t}\n\n\t\tif (directory === stopAt || matches.length >= limit) {\n\t\t\tbreak;\n\t\t}\n\n\t\tdirectory = path.dirname(directory);\n\t}\n\n\treturn matches;\n}\n\nexport async function findUp(name, options = {}) {\n\tconst matches = await findUpMultiple(name, {...options, limit: 1});\n\treturn matches[0];\n}\n\nexport function findUpSync(name, options = {}) {\n\tconst matches = findUpMultipleSync(name, {...options, limit: 1});\n\treturn matches[0];\n}\n\nexport {\n\tpathExists,\n\tpathExistsSync,\n} from 'path-exists';\n"],"names":["fileURLToPath","locatePathSync"],"mappings":";;;;;;AAIA,MAAM,SAAS,eAAa,qBAAqB,MAAMA,IAAAA,cAAc,SAAS,IAAI;AAEtE,MAAC,aAAa,OAAO,YAAY;AA8CtC,SAAS,mBAAmB,MAAM,UAAU,IAAI;AACtD,MAAI,YAAY,KAAK,QAAQ,OAAO,QAAQ,GAAG,KAAK,EAAE;AACtD,QAAM,EAAC,KAAI,IAAI,KAAK,MAAM,SAAS;AACnC,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,QAAQ,QAAQ,SAAS,OAAO;AACtC,QAAM,QAAQ,CAAC,IAAI,EAAE,KAAI;AAEzB,QAAM,aAAa,mBAAiB;AACH;AAC/B,aAAOC,MAAAA,eAAe,OAAO,aAAa;AAAA,IAC3C;AAAA,EAQD;AAEA,QAAM,UAAU,CAAA;AAEhB,SAAO,MAAM;AACZ,UAAM,YAAY,WAAW,EAAC,GAAG,SAAS,KAAK,UAAS,CAAC;AAEzD,QAAI,cAAc,YAAY;AAC7B;AAAA,IACD;AAEA,QAAI,WAAW;AACd,cAAQ,KAAK,KAAK,QAAQ,WAAW,SAAS,CAAC;AAAA,IAChD;AAEA,QAAI,cAAc,UAAU,QAAQ,UAAU,OAAO;AACpD;AAAA,IACD;AAEA,gBAAY,KAAK,QAAQ,SAAS;AAAA,EACnC;AAEA,SAAO;AACR;AAOO,SAAS,WAAW,MAAM,UAAU,IAAI;AAC9C,QAAM,UAAU,mBAAmB,MAAM,EAAC,GAAG,SAAS,OAAO,EAAC,CAAC;AAC/D,SAAO,QAAQ,CAAC;AACjB;;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/meow/_node_modules/find-up/index.js

@@ -11,14 +11,9 @@ function findUpMultipleSync(name, options = {}) {
   const limit = options.limit || Number.POSITIVE_INFINITY;
   const paths = [name].flat();
   const runMatcher = (locateOptions) => {
-    if (typeof name !== "function") {
+    {
       return locatePathSync(paths, locateOptions);
     }
-    const foundPath = name(locateOptions.cwd);
-    if (typeof foundPath === "string") {
-      return locatePathSync([foundPath], locateOptions);
-    }
-    return foundPath;
   };
   const matches = [];
   while (true) {

package/dist/_node_modules/meow/_node_modules/find-up/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/meow/node_modules/find-up/index.js"],"sourcesContent":["import path from 'node:path';\nimport {fileURLToPath} from 'node:url';\nimport {locatePath, locatePathSync} from 'locate-path';\n\nconst toPath = urlOrPath => urlOrPath instanceof URL ? fileURLToPath(urlOrPath) : urlOrPath;\n\nexport const findUpStop = Symbol('findUpStop');\n\nexport async function findUpMultiple(name, options = {}) {\n\tlet directory = path.resolve(toPath(options.cwd) || '');\n\tconst {root} = path.parse(directory);\n\tconst stopAt = path.resolve(directory, options.stopAt || root);\n\tconst limit = options.limit || Number.POSITIVE_INFINITY;\n\tconst paths = [name].flat();\n\n\tconst runMatcher = async locateOptions => {\n\t\tif (typeof name !== 'function') {\n\t\t\treturn locatePath(paths, locateOptions);\n\t\t}\n\n\t\tconst foundPath = await name(locateOptions.cwd);\n\t\tif (typeof foundPath === 'string') {\n\t\t\treturn locatePath([foundPath], locateOptions);\n\t\t}\n\n\t\treturn foundPath;\n\t};\n\n\tconst matches = [];\n\t// eslint-disable-next-line no-constant-condition\n\twhile (true) {\n\t\t// eslint-disable-next-line no-await-in-loop\n\t\tconst foundPath = await runMatcher({...options, cwd: directory});\n\n\t\tif (foundPath === findUpStop) {\n\t\t\tbreak;\n\t\t}\n\n\t\tif (foundPath) {\n\t\t\tmatches.push(path.resolve(directory, foundPath));\n\t\t}\n\n\t\tif (directory === stopAt || matches.length >= limit) {\n\t\t\tbreak;\n\t\t}\n\n\t\tdirectory = path.dirname(directory);\n\t}\n\n\treturn matches;\n}\n\nexport function findUpMultipleSync(name, options = {}) {\n\tlet directory = path.resolve(toPath(options.cwd) || '');\n\tconst {root} = path.parse(directory);\n\tconst stopAt = options.stopAt || root;\n\tconst limit = options.limit || Number.POSITIVE_INFINITY;\n\tconst paths = [name].flat();\n\n\tconst runMatcher = locateOptions => {\n\t\tif (typeof name !== 'function') {\n\t\t\treturn locatePathSync(paths, locateOptions);\n\t\t}\n\n\t\tconst foundPath = name(locateOptions.cwd);\n\t\tif (typeof foundPath === 'string') {\n\t\t\treturn locatePathSync([foundPath], locateOptions);\n\t\t}\n\n\t\treturn foundPath;\n\t};\n\n\tconst matches = [];\n\t// eslint-disable-next-line no-constant-condition\n\twhile (true) {\n\t\tconst foundPath = runMatcher({...options, cwd: directory});\n\n\t\tif (foundPath === findUpStop) {\n\t\t\tbreak;\n\t\t}\n\n\t\tif (foundPath) {\n\t\t\tmatches.push(path.resolve(directory, foundPath));\n\t\t}\n\n\t\tif (directory === stopAt || matches.length >= limit) {\n\t\t\tbreak;\n\t\t}\n\n\t\tdirectory = path.dirname(directory);\n\t}\n\n\treturn matches;\n}\n\nexport async function findUp(name, options = {}) {\n\tconst matches = await findUpMultiple(name, {...options, limit: 1});\n\treturn matches[0];\n}\n\nexport function findUpSync(name, options = {}) {\n\tconst matches = findUpMultipleSync(name, {...options, limit: 1});\n\treturn matches[0];\n}\n\nexport {\n\tpathExists,\n\tpathExistsSync,\n} from 'path-exists';\n"],"names":["path"],"mappings":";;;;AAIA,MAAM,SAAS,eAAa,qBAAqB,MAAM,cAAc,SAAS,IAAI;AAEtE,MAAC,aAAa,OAAO,YAAY;AA8CtC,SAAS,mBAAmB,MAAM,UAAU,IAAI;AACtD,MAAI,YAAYA,cAAK,QAAQ,OAAO,QAAQ,GAAG,KAAK,EAAE;AACtD,QAAM,EAAC,KAAI,IAAIA,cAAK,MAAM,SAAS;AACnC,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,QAAQ,QAAQ,SAAS,OAAO;AACtC,QAAM,QAAQ,CAAC,IAAI,EAAE,KAAI;AAEzB,QAAM,aAAa,mBAAiB;AACnC,QAAI,OAAO,SAAS,YAAY;AAC/B,aAAO,eAAe,OAAO,aAAa;AAAA,IAC1C;AAED,UAAM,YAAY,KAAK,cAAc,GAAG;AACxC,QAAI,OAAO,cAAc,UAAU;AAClC,aAAO,eAAe,CAAC,SAAS,GAAG,aAAa;AAAA,IAChD;AAED,WAAO;AAAA,EACT;AAEC,QAAM,UAAU,CAAA;AAEhB,SAAO,MAAM;AACZ,UAAM,YAAY,WAAW,EAAC,GAAG,SAAS,KAAK,UAAS,CAAC;AAEzD,QAAI,cAAc,YAAY;AAC7B;AAAA,IACA;AAED,QAAI,WAAW;AACd,cAAQ,KAAKA,cAAK,QAAQ,WAAW,SAAS,CAAC;AAAA,IAC/C;AAED,QAAI,cAAc,UAAU,QAAQ,UAAU,OAAO;AACpD;AAAA,IACA;AAED,gBAAYA,cAAK,QAAQ,SAAS;AAAA,EAClC;AAED,SAAO;AACR;AAOO,SAAS,WAAW,MAAM,UAAU,IAAI;AAC9C,QAAM,UAAU,mBAAmB,MAAM,EAAC,GAAG,SAAS,OAAO,EAAC,CAAC;AAC/D,SAAO,QAAQ,CAAC;AACjB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/meow/node_modules/find-up/index.js"],"sourcesContent":["import path from 'node:path';\nimport {fileURLToPath} from 'node:url';\nimport {locatePath, locatePathSync} from 'locate-path';\n\nconst toPath = urlOrPath => urlOrPath instanceof URL ? fileURLToPath(urlOrPath) : urlOrPath;\n\nexport const findUpStop = Symbol('findUpStop');\n\nexport async function findUpMultiple(name, options = {}) {\n\tlet directory = path.resolve(toPath(options.cwd) || '');\n\tconst {root} = path.parse(directory);\n\tconst stopAt = path.resolve(directory, options.stopAt || root);\n\tconst limit = options.limit || Number.POSITIVE_INFINITY;\n\tconst paths = [name].flat();\n\n\tconst runMatcher = async locateOptions => {\n\t\tif (typeof name !== 'function') {\n\t\t\treturn locatePath(paths, locateOptions);\n\t\t}\n\n\t\tconst foundPath = await name(locateOptions.cwd);\n\t\tif (typeof foundPath === 'string') {\n\t\t\treturn locatePath([foundPath], locateOptions);\n\t\t}\n\n\t\treturn foundPath;\n\t};\n\n\tconst matches = [];\n\t// eslint-disable-next-line no-constant-condition\n\twhile (true) {\n\t\t// eslint-disable-next-line no-await-in-loop\n\t\tconst foundPath = await runMatcher({...options, cwd: directory});\n\n\t\tif (foundPath === findUpStop) {\n\t\t\tbreak;\n\t\t}\n\n\t\tif (foundPath) {\n\t\t\tmatches.push(path.resolve(directory, foundPath));\n\t\t}\n\n\t\tif (directory === stopAt || matches.length >= limit) {\n\t\t\tbreak;\n\t\t}\n\n\t\tdirectory = path.dirname(directory);\n\t}\n\n\treturn matches;\n}\n\nexport function findUpMultipleSync(name, options = {}) {\n\tlet directory = path.resolve(toPath(options.cwd) || '');\n\tconst {root} = path.parse(directory);\n\tconst stopAt = options.stopAt || root;\n\tconst limit = options.limit || Number.POSITIVE_INFINITY;\n\tconst paths = [name].flat();\n\n\tconst runMatcher = locateOptions => {\n\t\tif (typeof name !== 'function') {\n\t\t\treturn locatePathSync(paths, locateOptions);\n\t\t}\n\n\t\tconst foundPath = name(locateOptions.cwd);\n\t\tif (typeof foundPath === 'string') {\n\t\t\treturn locatePathSync([foundPath], locateOptions);\n\t\t}\n\n\t\treturn foundPath;\n\t};\n\n\tconst matches = [];\n\t// eslint-disable-next-line no-constant-condition\n\twhile (true) {\n\t\tconst foundPath = runMatcher({...options, cwd: directory});\n\n\t\tif (foundPath === findUpStop) {\n\t\t\tbreak;\n\t\t}\n\n\t\tif (foundPath) {\n\t\t\tmatches.push(path.resolve(directory, foundPath));\n\t\t}\n\n\t\tif (directory === stopAt || matches.length >= limit) {\n\t\t\tbreak;\n\t\t}\n\n\t\tdirectory = path.dirname(directory);\n\t}\n\n\treturn matches;\n}\n\nexport async function findUp(name, options = {}) {\n\tconst matches = await findUpMultiple(name, {...options, limit: 1});\n\treturn matches[0];\n}\n\nexport function findUpSync(name, options = {}) {\n\tconst matches = findUpMultipleSync(name, {...options, limit: 1});\n\treturn matches[0];\n}\n\nexport {\n\tpathExists,\n\tpathExistsSync,\n} from 'path-exists';\n"],"names":["path"],"mappings":";;;;AAIA,MAAM,SAAS,eAAa,qBAAqB,MAAM,cAAc,SAAS,IAAI;AAEtE,MAAC,aAAa,OAAO,YAAY;AA8CtC,SAAS,mBAAmB,MAAM,UAAU,IAAI;AACtD,MAAI,YAAYA,cAAK,QAAQ,OAAO,QAAQ,GAAG,KAAK,EAAE;AACtD,QAAM,EAAC,KAAI,IAAIA,cAAK,MAAM,SAAS;AACnC,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,QAAQ,QAAQ,SAAS,OAAO;AACtC,QAAM,QAAQ,CAAC,IAAI,EAAE,KAAI;AAEzB,QAAM,aAAa,mBAAiB;AACH;AAC/B,aAAO,eAAe,OAAO,aAAa;AAAA,IAC3C;AAAA,EAQD;AAEA,QAAM,UAAU,CAAA;AAEhB,SAAO,MAAM;AACZ,UAAM,YAAY,WAAW,EAAC,GAAG,SAAS,KAAK,UAAS,CAAC;AAEzD,QAAI,cAAc,YAAY;AAC7B;AAAA,IACD;AAEA,QAAI,WAAW;AACd,cAAQ,KAAKA,cAAK,QAAQ,WAAW,SAAS,CAAC;AAAA,IAChD;AAEA,QAAI,cAAc,UAAU,QAAQ,UAAU,OAAO;AACpD;AAAA,IACD;AAEA,gBAAYA,cAAK,QAAQ,SAAS;AAAA,EACnC;AAEA,SAAO;AACR;AAOO,SAAS,WAAW,MAAM,UAAU,IAAI;AAC9C,QAAM,UAAU,mBAAmB,MAAM,EAAC,GAAG,SAAS,OAAO,EAAC,CAAC;AAC/D,SAAO,QAAQ,CAAC;AACjB;","x_google_ignoreList":[0]}

package/dist/_node_modules/meow/_node_modules/hosted-git-info/_node_modules/lru-cache/index.cjs

@@ -445,8 +445,7 @@ class LRUCache {
     for (const i of this.indexes()) {
       const v = this.valList[i];
       const value = this.isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-      if (value === void 0)
-        continue;
+      if (value === void 0) continue;
       if (fn(value, this.keyList[i], this)) {
         return this.get(this.keyList[i], getOptions);
       }
@@ -456,8 +455,7 @@ class LRUCache {
     for (const i of this.indexes()) {
       const v = this.valList[i];
       const value = this.isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-      if (value === void 0)
-        continue;
+      if (value === void 0) continue;
       fn.call(thisp, value, this.keyList[i], this);
     }
   }
@@ -465,8 +463,7 @@ class LRUCache {
     for (const i of this.rindexes()) {
       const v = this.valList[i];
       const value = this.isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-      if (value === void 0)
-        continue;
+      if (value === void 0) continue;
       fn.call(thisp, value, this.keyList[i], this);
     }
   }
@@ -490,8 +487,7 @@ class LRUCache {
       const key = this.keyList[i];
       const v = this.valList[i];
       const value = this.isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-      if (value === void 0)
-        continue;
+      if (value === void 0) continue;
       const entry = { value };
       if (this.ttls) {
         entry.ttl = this.ttls[i];
@@ -570,8 +566,7 @@ class LRUCache {
         if (status) {
           status.set = "replace";
           const oldValue = oldVal && this.isBackgroundFetch(oldVal) ? oldVal.__staleWhileFetching : oldVal;
-          if (oldValue !== void 0)
-            status.oldValue = oldValue;
+          if (oldValue !== void 0) status.oldValue = oldValue;
         }
       } else if (status) {
         status.set = "update";
@@ -640,8 +635,7 @@ class LRUCache {
         if (updateAgeOnHas) {
           this.updateItemAge(index);
         }
-        if (status)
-          status.has = "hit";
+        if (status) status.has = "hit";
         this.statusTTL(status, index);
         return true;
       } else if (status) {
@@ -685,8 +679,7 @@ class LRUCache {
         if (aborted && !updateCache) {
           options.status.fetchAborted = true;
           options.status.fetchError = ac.signal.reason;
-          if (ignoreAbort)
-            options.status.fetchAbortIgnored = true;
+          if (ignoreAbort) options.status.fetchAbortIgnored = true;
         } else {
           options.status.fetchResolved = true;
         }
@@ -702,8 +695,7 @@ class LRUCache {
             this.delete(k);
           }
         } else {
-          if (options.status)
-            options.status.fetchUpdated = true;
+          if (options.status) options.status.fetchUpdated = true;
           this.set(k, v2, fetchOpts.options);
         }
       }
@@ -749,8 +741,7 @@ class LRUCache {
         }
       });
     };
-    if (options.status)
-      options.status.fetchDispatched = true;
+    if (options.status) options.status.fetchDispatched = true;
     const p = new Promise(pcall).then(cb, eb);
     p.__abortController = ac;
     p.__staleWhileFetching = v;
@@ -792,8 +783,7 @@ class LRUCache {
     signal
   } = {}) {
     if (!this.fetchMethod) {
-      if (status)
-        status.fetch = "get";
+      if (status) status.fetch = "get";
       return this.get(k, {
         allowStale,
         updateAgeOnGet,
@@ -819,8 +809,7 @@ class LRUCache {
     };
     let index = this.keyMap.get(k);
     if (index === void 0) {
-      if (status)
-        status.fetch = "miss";
+      if (status) status.fetch = "miss";
       const p = this.backgroundFetch(k, index, options, fetchContext);
       return p.__returned = p;
     } else {
@@ -829,15 +818,13 @@ class LRUCache {
         const stale = allowStale && v.__staleWhileFetching !== void 0;
         if (status) {
           status.fetch = "inflight";
-          if (stale)
-            status.returnedStale = true;
+          if (stale) status.returnedStale = true;
         }
         return stale ? v.__staleWhileFetching : v.__returned = v;
       }
       const isStale = this.isStale(index);
       if (!forceRefresh && !isStale) {
-        if (status)
-          status.fetch = "hit";
+        if (status) status.fetch = "hit";
         this.moveToTail(index);
         if (updateAgeOnGet) {
           this.updateItemAge(index);
@@ -850,8 +837,7 @@ class LRUCache {
       const staleVal = hasStale && allowStale;
       if (status) {
         status.fetch = hasStale && isStale ? "stale" : "refresh";
-        if (staleVal && isStale)
-          status.returnedStale = true;
+        if (staleVal && isStale) status.returnedStale = true;
       }
       return staleVal ? p.__staleWhileFetching : p.__returned = p;
     }
@@ -868,14 +854,12 @@ class LRUCache {
       const fetching = this.isBackgroundFetch(value);
       this.statusTTL(status, index);
       if (this.isStale(index)) {
-        if (status)
-          status.get = "stale";
+        if (status) status.get = "stale";
         if (!fetching) {
           if (!noDeleteOnStaleGet) {
             this.delete(k);
           }
-          if (status)
-            status.returnedStale = allowStale;
+          if (status) status.returnedStale = allowStale;
           return allowStale ? value : void 0;
         } else {
           if (status) {
@@ -884,8 +868,7 @@ class LRUCache {
           return allowStale ? value.__staleWhileFetching : void 0;
         }
       } else {
-        if (status)
-          status.get = "hit";
+        if (status) status.get = "hit";
         if (fetching) {
           return value.__staleWhileFetching;
         }