pi-fileops 0.3.7

package/node_modules/lru_map/README.md

@@ -0,0 +1,214 @@
+# Least Recently Used (LRU) cache algorithm
+
+A finite key-value map using the [Least Recently Used (LRU)](http://en.wikipedia.org/wiki/Cache_algorithms#Least_Recently_Used) algorithm, where the most recently-used items are "kept alive" while older, less-recently used items are evicted to make room for newer items.
+
+Useful when you want to limit use of memory to only hold commonly-used things.
+
+[![Build status](https://travis-ci.org/rsms/js-lru.svg?branch=master)](https://travis-ci.org/rsms/js-lru)
+
+## Terminology & design
+
+- Based on a doubly-linked list for low complexity random shuffling of entries.
+
+- The cache object iself has a "head" (least recently used entry) and a
+  "tail" (most recently used entry).
+
+- The "oldest" and "newest" are list entries -- an entry might have a "newer" and
+  an "older" entry (doubly-linked, "older" being close to "head" and "newer"
+  being closer to "tail").
+
+- Key lookup is done through a key-entry mapping native object, which on most 
+  platforms mean `O(1)` complexity. This comes at a very low memory cost  (for 
+  storing two extra pointers for each entry).
+
+Fancy ASCII art illustration of the general design:
+
+```txt
+           entry             entry             entry             entry        
+           ______            ______            ______            ______       
+          | head |.newer => |      |.newer => |      |.newer => | tail |      
+.oldest = |  A   |          |  B   |          |  C   |          |  D   | = .newest
+          |______| <= older.|______| <= older.|______| <= older.|______|      
+                                                                             
+       removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added
+```
+
+## Example
+
+```js
+let c = new LRUMap(3)
+c.set('adam',   29)
+c.set('john',   26)
+c.set('angela', 24)
+c.toString()        // -> "adam:29 < john:26 < angela:24"
+c.get('john')       // -> 26
+
+// Now 'john' is the most recently used entry, since we just requested it
+c.toString()        // -> "adam:29 < angela:24 < john:26"
+c.set('zorro', 141) // -> {key:adam, value:29}
+
+// Because we only have room for 3 entries, adding 'zorro' caused 'adam'
+// to be removed in order to make room for the new entry
+c.toString()        // -> "angela:24 < john:26 < zorro:141"
+```
+
+# Usage
+
+**Recommended:** Copy the code in lru.js or copy the lru.js and lru.d.ts files into your source directory. For minimal functionality, you only need the lines up until the comment that says "Following code is optional".
+
+**Using NPM:** [`yarn add lru_map`](https://www.npmjs.com/package/lru_map) (note that because NPM is one large flat namespace, you need to import the module as "lru_map" rather than simply "lru".)
+
+**Using AMD:** An [AMD](https://github.com/amdjs/amdjs-api/blob/master/AMD.md#amd) module loader like [`amdld`](https://github.com/rsms/js-amdld) can be used to load this module as well. There should be nothing to configure.
+
+**Testing**:
+
+- Run tests with `npm test`
+- Run benchmarks with `npm run benchmark`
+
+**ES compatibility:** This implementation is compatible with modern JavaScript environments and depend on the following features not found in ES5:
+
+- `const` and `let` keywords
+- `Symbol` including `Symbol.iterator`
+- `Map`
+
+> Note: If you need ES5 compatibility e.g. to use with older browsers, [please use version 2](https://github.com/rsms/js-lru/tree/v2) which has a slightly less feature-full API but is well-tested and about as fast as this implementation.
+
+**Using with TypeScript**
+
+This module comes with complete typing coverage for use with TypeScript. If you copied the code or files rather than using a module loader, make sure to include `lru.d.ts` into the same location where you put `lru.js`.
+
+```ts
+import {LRUMap} from './lru'
+// import {LRUMap} from 'lru'     // when using via AMD
+// import {LRUMap} from 'lru_map' // when using from NPM
+console.log('LRUMap:', LRUMap)
+```
+
+# API
+
+The API imitates that of [`Map`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map), which means that in most cases you can use `LRUMap` as a drop-in replacement for `Map`.
+
+```ts
+export class LRUMap<K,V> {
+  // Construct a new cache object which will hold up to limit entries.
+  // When the size == limit, a `put` operation will evict the oldest entry.
+  //
+  // If `entries` is provided, all entries are added to the new map.
+  // `entries` should be an Array or other iterable object whose elements are
+  // key-value pairs (2-element Arrays). Each key-value pair is added to the new Map.
+  // null is treated as undefined.
+  constructor(limit :number, entries? :Iterable<[K,V]>);
+
+  // Convenience constructor equivalent to `new LRUMap(count(entries), entries)`
+  constructor(entries :Iterable<[K,V]>);
+
+  // Current number of items
+  size :number;
+
+  // Maximum number of items this map can hold
+  limit :number;
+
+  // Least recently-used entry. Invalidated when map is modified.
+  oldest :Entry<K,V>;
+
+  // Most recently-used entry. Invalidated when map is modified.
+  newest :Entry<K,V>;
+
+  // Replace all values in this map with key-value pairs (2-element Arrays) from
+  // provided iterable.
+  assign(entries :Iterable<[K,V]>) : void;
+
+  // Put <value> into the cache associated with <key>. Replaces any existing entry
+  // with the same key. Returns `this`.
+  set(key :K, value :V) : LRUMap<K,V>;
+
+  // Purge the least recently used (oldest) entry from the cache.
+  // Returns the removed entry or undefined if the cache was empty.
+  shift() : [K,V] | undefined;
+
+  // Get and register recent use of <key>.
+  // Returns the value associated with <key> or undefined if not in cache.
+  get(key :K) : V | undefined;
+
+  // Check if there's a value for key in the cache without registering recent use.
+  has(key :K) : boolean;
+
+  // Access value for <key> without registering recent use. Useful if you do not
+  // want to chage the state of the map, but only "peek" at it.
+  // Returns the value associated with <key> if found, or undefined if not found.
+  find(key :K) : V | undefined;
+
+  // Remove entry <key> from cache and return its value.
+  // Returns the removed value, or undefined if not found.
+  delete(key :K) : V | undefined;
+
+  // Removes all entries
+  clear() : void;
+
+  // Returns an iterator over all keys, starting with the oldest.
+  keys() : Iterator<K>;
+
+  // Returns an iterator over all values, starting with the oldest.
+  values() : Iterator<V>;
+
+  // Returns an iterator over all entries, starting with the oldest.
+  entries() : Iterator<[K,V]>;
+
+  // Returns an iterator over all entries, starting with the oldest.
+  [Symbol.iterator]() : Iterator<[K,V]>;
+
+  // Call `fun` for each entry, starting with the oldest entry.
+  forEach(fun :(value :V, key :K, m :LRUMap<K,V>)=>void, thisArg? :any) : void;
+
+  // Returns an object suitable for JSON encoding
+  toJSON() : Array<{key :K, value :V}>;
+
+  // Returns a human-readable text representation
+  toString() : string;
+}
+
+// An entry holds the key and value, and pointers to any older and newer entries.
+// Entries might hold references to adjacent entries in the internal linked-list.
+// Therefore you should never store or modify Entry objects. Instead, reference the
+// key and value of an entry when needed.
+interface Entry<K,V> {
+  key   :K;
+  value :V;
+}
+```
+
+If you need to perform any form of finalization of items as they are evicted from the cache, wrapping the `shift` method is a good way to do it:
+
+```js
+let c = new LRUMap(123);
+c.shift = function() {
+  let entry = LRUMap.prototype.shift.call(this);
+  doSomethingWith(entry);
+  return entry;
+}
+```
+
+The internals calls `shift` as entries need to be evicted, so this method is guaranteed to be called for any item that's removed from the cache. The returned entry must not include any strong references to other entries. See note in the documentation of `LRUMap.prototype.set()`.
+
+
+# MIT license
+
+Copyright (c) 2010-2016 Rasmus Andersson <https://rsms.me/>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

package/node_modules/lru_map/dist/lru.js

@@ -0,0 +1,2 @@
+!function(g,c){typeof exports=="object"&&typeof module!="undefined"?c(exports):typeof define=="function"&&define.amd?define(["exports"],c):c((g=g||self).lru_map=g.lru_map||{})}(this,function(g){const c=Symbol("newer"),e=Symbol("older");class n{constructor(a,b){typeof a!=="number"&&(b=a,a=0),this.size=0,this.limit=a,this.oldest=this.newest=void 0,this._keymap=new Map(),b&&(this.assign(b),a<1&&(this.limit=this.size))}_markEntryAsUsed(a){if(a===this.newest)return;a[c]&&(a===this.oldest&&(this.oldest=a[c]),a[c][e]=a[e]),a[e]&&(a[e][c]=a[c]),a[c]=void 0,a[e]=this.newest,this.newest&&(this.newest[c]=a),this.newest=a}assign(a){let b,d=this.limit||Number.MAX_VALUE;this._keymap.clear();let m=a[Symbol.iterator]();for(let h=m.next();!h.done;h=m.next()){let f=new l(h.value[0],h.value[1]);this._keymap.set(f.key,f),b?(b[c]=f,f[e]=b):this.oldest=f,b=f;if(d--==0)throw new Error("overflow")}this.newest=b,this.size=this._keymap.size}get(a){var b=this._keymap.get(a);return b?(this._markEntryAsUsed(b),b.value):void 0}set(a,b){var d=this._keymap.get(a);return d?(d.value=b,this._markEntryAsUsed(d),this):(this._keymap.set(a,d=new l(a,b)),this.newest?(this.newest[c]=d,d[e]=this.newest):this.oldest=d,this.newest=d,++this.size,this.size>this.limit&&this.shift(),this)}shift(){var a=this.oldest;if(a)return this.oldest[c]?(this.oldest=this.oldest[c],this.oldest[e]=void 0):(this.oldest=void 0,this.newest=void 0),a[c]=a[e]=void 0,this._keymap.delete(a.key),--this.size,[a.key,a.value]}find(a){let b=this._keymap.get(a);return b?b.value:void 0}has(a){return this._keymap.has(a)}delete(a){var b=this._keymap.get(a);return b?(this._keymap.delete(b.key),b[c]&&b[e]?(b[e][c]=b[c],b[c][e]=b[e]):b[c]?(b[c][e]=void 0,this.oldest=b[c]):b[e]?(b[e][c]=void 0,this.newest=b[e]):this.oldest=this.newest=void 0,this.size--,b.value):void 0}clear(){this.oldest=this.newest=void 0,this.size=0,this._keymap.clear()}keys(){return new j(this.oldest)}values(){return new k(this.oldest)}entries(){return this}[Symbol.iterator](){return new i(this.oldest)}forEach(a,b){typeof b!=="object"&&(b=this);let d=this.oldest;for(;d;)a.call(b,d.value,d.key,this),d=d[c]}toJSON(){for(var a=new Array(this.size),b=0,d=this.oldest;d;)a[b++]={key:d.key,value:d.value},d=d[c];return a}toString(){for(var a="",b=this.oldest;b;)a+=String(b.key)+":"+b.value,b=b[c],b&&(a+=" < ");return a}}g.LRUMap=n;function l(a,b){this.key=a,this.value=b,this[c]=void 0,this[e]=void 0}function i(a){this.entry=a}i.prototype[Symbol.iterator]=function(){return this},i.prototype.next=function(){let a=this.entry;return a?(this.entry=a[c],{done:!1,value:[a.key,a.value]}):{done:!0,value:void 0}};function j(a){this.entry=a}j.prototype[Symbol.iterator]=function(){return this},j.prototype.next=function(){let a=this.entry;return a?(this.entry=a[c],{done:!1,value:a.key}):{done:!0,value:void 0}};function k(a){this.entry=a}k.prototype[Symbol.iterator]=function(){return this},k.prototype.next=function(){let a=this.entry;return a?(this.entry=a[c],{done:!1,value:a.value}):{done:!0,value:void 0}}});
+//# sourceMappingURL=lru.js.map

package/node_modules/lru_map/dist/lru.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["lru.js"],
+  "sourcesContent": ["/**\n * A doubly linked list-based Least Recently Used (LRU) cache. Will keep most\n * recently used items while discarding least recently used items when its limit\n * is reached.\n *\n * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>\n * See README.md for details.\n *\n * Illustration of the design:\n *\n *       entry             entry             entry             entry\n *       ______            ______            ______            ______\n *      | head |.newer => |      |.newer => |      |.newer => | tail |\n *      |  A   |          |  B   |          |  C   |          |  D   |\n *      |______| <= older.|______| <= older.|______| <= older.|______|\n *\n *  removed  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  <--  added\n */\n!function(g,f){\n  if (typeof exports == 'object' && typeof module != \"undefined\") {\n    f(exports)\n  } else if (typeof define == 'function' && define.amd) {\n    define([\"exports\"], f)\n  } else {\n    f((g = g || self)[\"lru_map\"] = (g[\"lru_map\"] || {}))\n  }\n}(this, function(exports) {\n\nconst NEWER = Symbol('newer');\nconst OLDER = Symbol('older');\n\nclass LRUMap {\n  constructor(limit, entries) {\n    if (typeof limit !== 'number') {\n      // called as (entries)\n      entries = limit;\n      limit = 0;\n    }\n\n    this.size = 0;\n    this.limit = limit;\n    this.oldest = this.newest = undefined;\n    this._keymap = new Map();\n\n    if (entries) {\n      this.assign(entries);\n      if (limit < 1) {\n        this.limit = this.size;\n      }\n    }\n  }\n\n  _markEntryAsUsed(entry) {\n    if (entry === this.newest) {\n      // Already the most recenlty used entry, so no need to update the list\n      return;\n    }\n    // HEAD--------------TAIL\n    //   <.older   .newer>\n    //  <--- add direction --\n    //   A  B  C  <D>  E\n    if (entry[NEWER]) {\n      if (entry === this.oldest) {\n        this.oldest = entry[NEWER];\n      }\n      entry[NEWER][OLDER] = entry[OLDER]; // C <-- E.\n    }\n    if (entry[OLDER]) {\n      entry[OLDER][NEWER] = entry[NEWER]; // C. --> E\n    }\n    entry[NEWER] = undefined; // D --x\n    entry[OLDER] = this.newest; // D. --> E\n    if (this.newest) {\n      this.newest[NEWER] = entry; // E. <-- D\n    }\n    this.newest = entry;\n  }\n\n  assign(entries) {\n    let entry, limit = this.limit || Number.MAX_VALUE;\n    this._keymap.clear();\n    let it = entries[Symbol.iterator]();\n    for (let itv = it.next(); !itv.done; itv = it.next()) {\n      let e = new Entry(itv.value[0], itv.value[1]);\n      this._keymap.set(e.key, e);\n      if (!entry) {\n        this.oldest = e;\n      } else {\n        entry[NEWER] = e;\n        e[OLDER] = entry;\n      }\n      entry = e;\n      if (limit-- == 0) {\n        throw new Error('overflow');\n      }\n    }\n    this.newest = entry;\n    this.size = this._keymap.size;\n  }\n\n  get(key) {\n    // First, find our cache entry\n    var entry = this._keymap.get(key);\n    if (!entry) return; // Not cached. Sorry.\n    // As <key> was found in the cache, register it as being requested recently\n    this._markEntryAsUsed(entry);\n    return entry.value;\n  }\n\n  set(key, value) {\n    var entry = this._keymap.get(key);\n\n    if (entry) {\n      // update existing\n      entry.value = value;\n      this._markEntryAsUsed(entry);\n      return this;\n    }\n\n    // new entry\n    this._keymap.set(key, (entry = new Entry(key, value)));\n\n    if (this.newest) {\n      // link previous tail to the new tail (entry)\n      this.newest[NEWER] = entry;\n      entry[OLDER] = this.newest;\n    } else {\n      // we're first in -- yay\n      this.oldest = entry;\n    }\n\n    // add new entry to the end of the linked list -- it's now the freshest entry.\n    this.newest = entry;\n    ++this.size;\n    if (this.size > this.limit) {\n      // we hit the limit -- remove the head\n      this.shift();\n    }\n\n    return this;\n  }\n\n  shift() {\n    // todo: handle special case when limit == 1\n    var entry = this.oldest;\n    if (entry) {\n      if (this.oldest[NEWER]) {\n        // advance the list\n        this.oldest = this.oldest[NEWER];\n        this.oldest[OLDER] = undefined;\n      } else {\n        // the cache is exhausted\n        this.oldest = undefined;\n        this.newest = undefined;\n      }\n      // Remove last strong reference to <entry> and remove links from the purged\n      // entry being returned:\n      entry[NEWER] = entry[OLDER] = undefined;\n      this._keymap.delete(entry.key);\n      --this.size;\n      return [entry.key, entry.value];\n    }\n  }\n\n  // -------------------------------------------------------------------------------------\n  // Following code (until end of class definition) is optional and can be removed without\n  // breaking the core functionality.\n\n  find(key) {\n    let e = this._keymap.get(key);\n    return e ? e.value : undefined;\n  }\n\n  has(key) {\n    return this._keymap.has(key);\n  }\n\n  delete(key) {\n    var entry = this._keymap.get(key);\n    if (!entry) return;\n    this._keymap.delete(entry.key);\n    if (entry[NEWER] && entry[OLDER]) {\n      // relink the older entry with the newer entry\n      entry[OLDER][NEWER] = entry[NEWER];\n      entry[NEWER][OLDER] = entry[OLDER];\n    } else if (entry[NEWER]) {\n      // remove the link to us\n      entry[NEWER][OLDER] = undefined;\n      // link the newer entry to head\n      this.oldest = entry[NEWER];\n    } else if (entry[OLDER]) {\n      // remove the link to us\n      entry[OLDER][NEWER] = undefined;\n      // link the newer entry to head\n      this.newest = entry[OLDER];\n    } else {// if(entry[OLDER] === undefined && entry.newer === undefined) {\n      this.oldest = this.newest = undefined;\n    }\n\n    this.size--;\n    return entry.value;\n  }\n\n  clear() {\n    // Not clearing links should be safe, as we don't expose live links to user\n    this.oldest = this.newest = undefined;\n    this.size = 0;\n    this._keymap.clear();\n  }\n\n  keys() {\n    return new KeyIterator(this.oldest);\n  }\n\n  values() {\n    return new ValueIterator(this.oldest);\n  }\n\n  entries() {\n    return this;\n  }\n\n  [Symbol.iterator]() {\n    return new EntryIterator(this.oldest);\n  }\n\n  forEach(fun, thisObj) {\n    if (typeof thisObj !== 'object') {\n      thisObj = this;\n    }\n    let entry = this.oldest;\n    while (entry) {\n      fun.call(thisObj, entry.value, entry.key, this);\n      entry = entry[NEWER];\n    }\n  }\n\n  /** Returns a JSON (array) representation */\n  toJSON() {\n    var s = new Array(this.size), i = 0, entry = this.oldest;\n    while (entry) {\n      s[i++] = { key: entry.key, value: entry.value };\n      entry = entry[NEWER];\n    }\n    return s;\n  }\n\n  /** Returns a String representation */\n  toString() {\n    var s = '', entry = this.oldest;\n    while (entry) {\n      s += String(entry.key)+':'+entry.value;\n      entry = entry[NEWER];\n      if (entry) {\n        s += ' < ';\n      }\n    }\n    return s;\n  }\n}\n\nexports.LRUMap = LRUMap\n\nfunction Entry(key, value) {\n  this.key = key;\n  this.value = value;\n  this[NEWER] = undefined;\n  this[OLDER] = undefined;\n}\n\n\nfunction EntryIterator(oldestEntry) { this.entry = oldestEntry; }\nEntryIterator.prototype[Symbol.iterator] = function() { return this; }\nEntryIterator.prototype.next = function() {\n  let ent = this.entry;\n  if (ent) {\n    this.entry = ent[NEWER];\n    return { done: false, value: [ent.key, ent.value] };\n  } else {\n    return { done: true, value: undefined };\n  }\n};\n\n\nfunction KeyIterator(oldestEntry) { this.entry = oldestEntry; }\nKeyIterator.prototype[Symbol.iterator] = function() { return this; }\nKeyIterator.prototype.next = function() {\n  let ent = this.entry;\n  if (ent) {\n    this.entry = ent[NEWER];\n    return { done: false, value: ent.key };\n  } else {\n    return { done: true, value: undefined };\n  }\n};\n\nfunction ValueIterator(oldestEntry) { this.entry = oldestEntry; }\nValueIterator.prototype[Symbol.iterator] = function() { return this; }\nValueIterator.prototype.next = function() {\n  let ent = this.entry;\n  if (ent) {\n    this.entry = ent[NEWER];\n    return { done: false, value: ent.value };\n  } else {\n    return { done: true, value: undefined };\n  }\n};\n\n});\n"],
+  "mappings": "AAAA,AAkBA,CAAC,SAAS,EAAE,GACV,AAAI,MAAO,UAAW,UAAY,MAAO,SAAU,YACjD,EAAE,SACG,AAAI,MAAO,SAAU,YAAc,OAAO,IAC/C,OAAO,CAAC,WAAY,GAEpB,EAAG,GAAI,GAAK,MAAM,QAAc,EAAE,SAAc,KAElD,KAAM,SAAS,GAEjB,KAAM,GAAQ,OAAO,SACf,EAAQ,OAAO,SA7BrB,QAgCE,YAAY,EAAO,GACjB,AAAI,MAAO,KAAU,UAEnB,GAAU,EACV,EAAQ,GAGV,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,OAAS,KAAK,OAAS,OAC5B,KAAK,QAAU,GAAI,OAEnB,AAAI,GACF,MAAK,OAAO,GACZ,AAAI,EAAQ,GACV,MAAK,MAAQ,KAAK,OAKxB,iBAAiB,GACf,GAAI,IAAU,KAAK,OAEjB,OAMF,AAAI,EAAM,IACR,CAAI,IAAU,KAAK,QACjB,MAAK,OAAS,EAAM,IAEtB,EAAM,GAAO,GAAS,EAAM,IAE9B,AAAI,EAAM,IACR,GAAM,GAAO,GAAS,EAAM,IAE9B,EAAM,GAAS,OACf,EAAM,GAAS,KAAK,OACpB,AAAI,KAAK,QACP,MAAK,OAAO,GAAS,GAEvB,KAAK,OAAS,EAGhB,OAAO,GACL,GAAI,GAAO,EAAQ,KAAK,OAAS,OAAO,UACxC,KAAK,QAAQ,QACb,GAAI,GAAK,EAAQ,OAAO,YACxB,OAAS,GAAM,EAAG,OAAQ,CAAC,EAAI,KAAM,EAAM,EAAG,QAC5C,GAAI,GAAI,GAAI,GAAM,EAAI,MAAM,GAAI,EAAI,MAAM,IAC1C,KAAK,QAAQ,IAAI,EAAE,IAAK,GACxB,AAAK,EAGH,GAAM,GAAS,EACf,EAAE,GAAS,GAHX,KAAK,OAAS,EAKhB,EAAQ,EACR,GAAI,KAAW,EACb,KAAM,IAAI,OAAM,YAGpB,KAAK,OAAS,EACd,KAAK,KAAO,KAAK,QAAQ,KAG3B,IAAI,GAEF,GAAI,GAAQ,KAAK,QAAQ,IAAI,GAC7B,MAAK,GAEL,MAAK,iBAAiB,GACf,EAAM,OAHD,OAMd,IAAI,EAAK,GACP,GAAI,GAAQ,KAAK,QAAQ,IAAI,GAE7B,MAAI,GAEF,GAAM,MAAQ,EACd,KAAK,iBAAiB,GACf,MAIT,MAAK,QAAQ,IAAI,EAAM,EAAQ,GAAI,GAAM,EAAK,IAE9C,AAAI,KAAK,OAEP,MAAK,OAAO,GAAS,EACrB,EAAM,GAAS,KAAK,QAGpB,KAAK,OAAS,EAIhB,KAAK,OAAS,EACd,EAAE,KAAK,KACP,AAAI,KAAK,KAAO,KAAK,OAEnB,KAAK,QAGA,MAGT,QAEE,GAAI,GAAQ,KAAK,OACjB,GAAI,EACF,MAAI,MAAK,OAAO,GAEd,MAAK,OAAS,KAAK,OAAO,GAC1B,KAAK,OAAO,GAAS,QAGrB,MAAK,OAAS,OACd,KAAK,OAAS,QAIhB,EAAM,GAAS,EAAM,GAAS,OAC9B,KAAK,QAAQ,OAAO,EAAM,KAC1B,EAAE,KAAK,KACA,CAAC,EAAM,IAAK,EAAM,OAQ7B,KAAK,GACH,GAAI,GAAI,KAAK,QAAQ,IAAI,GACzB,MAAO,GAAI,EAAE,MAAQ,OAGvB,IAAI,GACF,MAAO,MAAK,QAAQ,IAAI,GAG1B,OAAO,GACL,GAAI,GAAQ,KAAK,QAAQ,IAAI,GAC7B,MAAK,GACL,MAAK,QAAQ,OAAO,EAAM,KAC1B,AAAI,EAAM,IAAU,EAAM,GAExB,GAAM,GAAO,GAAS,EAAM,GAC5B,EAAM,GAAO,GAAS,EAAM,IACvB,AAAI,EAAM,GAEf,GAAM,GAAO,GAAS,OAEtB,KAAK,OAAS,EAAM,IACf,AAAI,EAAM,GAEf,GAAM,GAAO,GAAS,OAEtB,KAAK,OAAS,EAAM,IAEpB,KAAK,OAAS,KAAK,OAAS,OAG9B,KAAK,OACE,EAAM,OArBD,OAwBd,QAEE,KAAK,OAAS,KAAK,OAAS,OAC5B,KAAK,KAAO,EACZ,KAAK,QAAQ,QAGf,OACE,MAAO,IAAI,GAAY,KAAK,QAG9B,SACE,MAAO,IAAI,GAAc,KAAK,QAGhC,UACE,MAAO,OAGR,OAAO,YACN,MAAO,IAAI,GAAc,KAAK,QAGhC,QAAQ,EAAK,GACX,AAAI,MAAO,KAAY,UACrB,GAAU,MAEZ,GAAI,GAAQ,KAAK,OACjB,KAAO,GACL,EAAI,KAAK,EAAS,EAAM,MAAO,EAAM,IAAK,MAC1C,EAAQ,EAAM,GAKlB,SAEE,OADI,GAAI,GAAI,OAAM,KAAK,MAAO,EAAI,EAAG,EAAQ,KAAK,OAC3C,GACL,EAAE,KAAO,CAAE,IAAK,EAAM,IAAK,MAAO,EAAM,OACxC,EAAQ,EAAM,GAEhB,MAAO,GAIT,WAEE,OADI,GAAI,GAAI,EAAQ,KAAK,OAClB,GACL,GAAK,OAAO,EAAM,KAAK,IAAI,EAAM,MACjC,EAAQ,EAAM,GACd,AAAI,GACF,IAAK,OAGT,MAAO,IAIX,EAAQ,OAAS,EAEjB,WAAe,EAAK,GAClB,KAAK,IAAM,EACX,KAAK,MAAQ,EACb,KAAK,GAAS,OACd,KAAK,GAAS,OAIhB,WAAuB,GAAe,KAAK,MAAQ,EACnD,EAAc,UAAU,OAAO,UAAY,WAAa,MAAO,OAC/D,EAAc,UAAU,KAAO,WAC7B,GAAI,GAAM,KAAK,MACf,MAAI,GACF,MAAK,MAAQ,EAAI,GACV,CAAE,KAAM,GAAO,MAAO,CAAC,EAAI,IAAK,EAAI,SAEpC,CAAE,KAAM,GAAM,MAAO,SAKhC,WAAqB,GAAe,KAAK,MAAQ,EACjD,EAAY,UAAU,OAAO,UAAY,WAAa,MAAO,OAC7D,EAAY,UAAU,KAAO,WAC3B,GAAI,GAAM,KAAK,MACf,MAAI,GACF,MAAK,MAAQ,EAAI,GACV,CAAE,KAAM,GAAO,MAAO,EAAI,MAE1B,CAAE,KAAM,GAAM,MAAO,SAIhC,WAAuB,GAAe,KAAK,MAAQ,EACnD,EAAc,UAAU,OAAO,UAAY,WAAa,MAAO,OAC/D,EAAc,UAAU,KAAO,WAC7B,GAAI,GAAM,KAAK,MACf,MAAI,GACF,MAAK,MAAQ,EAAI,GACV,CAAE,KAAM,GAAO,MAAO,EAAI,QAE1B,CAAE,KAAM,GAAM,MAAO",
+  "names": []
+}

package/node_modules/lru_map/lru.d.ts

@@ -0,0 +1,83 @@
+export class LRUMap<K,V> {
+  // Construct a new cache object which will hold up to limit entries.
+  // When the size == limit, a `put` operation will evict the oldest entry.
+  //
+  // If `entries` is provided, all entries are added to the new map.
+  // `entries` should be an Array or other iterable object whose elements are
+  // key-value pairs (2-element Arrays). Each key-value pair is added to the new Map.
+  // null is treated as undefined.
+  constructor(limit :number, entries? :Iterable<[K,V]>);
+
+  // Convenience constructor equivalent to `new LRUMap(count(entries), entries)`
+  constructor(entries :Iterable<[K,V]>);
+
+  // Current number of items
+  size :number;
+
+  // Maximum number of items this map can hold
+  limit :number;
+
+  // Least recently-used entry. Invalidated when map is modified.
+  oldest :Entry<K,V>;
+
+  // Most recently-used entry. Invalidated when map is modified.
+  newest :Entry<K,V>;
+
+  // Replace all values in this map with key-value pairs (2-element Arrays) from
+  // provided iterable.
+  assign(entries :Iterable<[K,V]>) : void;
+
+  // Put <value> into the cache associated with <key>. Replaces any existing entry
+  // with the same key. Returns `this`.
+  set(key :K, value :V) : LRUMap<K,V>;
+
+  // Purge the least recently used (oldest) entry from the cache.
+  // Returns the removed entry or undefined if the cache was empty.
+  shift() : [K,V] | undefined;
+
+  // Get and register recent use of <key>.
+  // Returns the value associated with <key> or undefined if not in cache.
+  get(key :K) : V | undefined;
+
+  // Check if there's a value for key in the cache without registering recent use.
+  has(key :K) : boolean;
+
+  // Access value for <key> without registering recent use. Useful if you do not
+  // want to chage the state of the map, but only "peek" at it.
+  // Returns the value associated with <key> if found, or undefined if not found.
+  find(key :K) : V | undefined;
+
+  // Remove entry <key> from cache and return its value.
+  // Returns the removed value, or undefined if not found.
+  delete(key :K) : V | undefined;
+
+  // Removes all entries
+  clear() : void;
+
+  // Returns an iterator over all keys, starting with the oldest.
+  keys() : Iterator<K>;
+
+  // Returns an iterator over all values, starting with the oldest.
+  values() : Iterator<V>;
+
+  // Returns an iterator over all entries, starting with the oldest.
+  entries() : Iterator<[K,V]>;
+
+  // Returns an iterator over all entries, starting with the oldest.
+  [Symbol.iterator]() : Iterator<[K,V]>;
+
+  // Call `fun` for each entry, starting with the oldest entry.
+  forEach(fun :(value :V, key :K, m :LRUMap<K,V>)=>void, thisArg? :any) : void;
+
+  // Returns an object suitable for JSON encoding
+  toJSON() : Array<{key :K, value :V}>;
+
+  // Returns a human-readable text representation
+  toString() : string;
+}
+
+// An entry holds the key and value, and pointers to any older and newer entries.
+interface Entry<K,V> {
+  key   :K;
+  value :V;
+}

package/node_modules/lru_map/package.json

@@ -0,0 +1,41 @@
+{
+  "name": "lru_map",
+  "version": "0.4.1",
+  "description": "Finite key-value map using the Least Recently Used (LRU) algorithm where the most recently used objects are keept in the map while less recently used items are evicted to make room for new ones.",
+  "main": "dist/lru.js",
+  "types": "lru.d.ts",
+  "typings": "lru.d.ts",
+  "scripts": {
+    "test": "npm run build && node test.js && echo 'Verifying TypeScript definition...' && tsc --noEmit",
+    "build": "esbuild --minify --sourcemap --target=es2016 --outfile=dist/lru.js lru.js",
+    "prepublishOnly": "npm test",
+    "benchmark": "node --expose-gc benchmark.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/rsms/js-lru.git"
+  },
+  "files": [
+    "README.md",
+    "lru.d.ts",
+    "dist/lru.js",
+    "dist/lru.js.map",
+    ".gitignore"
+  ],
+  "keywords": [
+    "cache",
+    "lru",
+    "buffer",
+    "map"
+  ],
+  "author": "Rasmus Andersson <me@rsms.me>",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/rsms/js-lru/issues"
+  },
+  "homepage": "https://github.com/rsms/js-lru#readme",
+  "devDependencies": {
+    "esbuild": "^0.5.26",
+    "typescript": "^3.9.7"
+  }
+}

package/node_modules/mdast-util-to-hast/index.d.ts

@@ -0,0 +1,94 @@
+import type {Data, ElementContent, Literal, Properties} from 'hast'
+
+// Expose types.
+export type {
+  FootnoteBackContentTemplate,
+  FootnoteBackLabelTemplate
+} from './lib/footer.js'
+export type {Handler, Handlers, Options, State} from './lib/state.js'
+
+// Expose JS API.
+export {handlers as defaultHandlers} from './lib/handlers/index.js'
+export {
+  defaultFootnoteBackContent,
+  defaultFootnoteBackLabel
+} from './lib/footer.js'
+export {toHast} from './lib/index.js'
+
+/**
+ * Raw string of HTML embedded into HTML AST.
+ */
+export interface Raw extends Literal {
+  /**
+   * Node type of raw.
+   */
+  type: 'raw'
+
+  /**
+   * Data associated with the hast raw.
+   */
+  data?: RawData | undefined
+}
+
+/**
+ * Info associated with hast raw nodes by the ecosystem.
+ */
+export interface RawData extends Data {}
+
+// Register nodes in content.
+declare module 'hast' {
+  interface ElementData {
+    /**
+     * Custom info relating to the node, if `<code>` in `<pre>`.
+     *
+     * Defined by `mdast-util-to-hast` (`remark-rehype`).
+     */
+    meta?: string | null | undefined
+  }
+
+  interface ElementContentMap {
+    /**
+     * Raw string of HTML embedded into HTML AST.
+     */
+    raw: Raw
+  }
+
+  interface RootContentMap {
+    /**
+     * Raw string of HTML embedded into HTML AST.
+     */
+    raw: Raw
+  }
+}
+
+// Register data on mdast.
+declare module 'mdast' {
+  interface Data {
+    /**
+     * Field supported by `mdast-util-to-hast` to signal that a node should
+     * result in something with these children.
+     *
+     * When this is defined, when a parent is created, these children will
+     * be used.
+     */
+    hChildren?: ElementContent[] | undefined
+
+    /**
+     * Field supported by `mdast-util-to-hast` to signal that a node should
+     * result in a particular element, instead of its default behavior.
+     *
+     * When this is defined, an element with the given tag name is created.
+     * For example, when setting `hName` to `'b'`, a `<b>` element is created.
+     */
+    hName?: string | undefined
+
+    /**
+     * Field supported by `mdast-util-to-hast` to signal that a node should
+     * result in an element with these properties.
+     *
+     * When this is defined, when an element is created, these properties will
+     * be used.
+     */
+    hProperties?: Properties | undefined
+  }
+}

package/node_modules/mdast-util-to-hast/index.js

@@ -0,0 +1,7 @@
+// Note: types exposed from `index.d.ts`.
+export {handlers as defaultHandlers} from './lib/handlers/index.js'
+export {toHast} from './lib/index.js'
+export {
+  defaultFootnoteBackContent,
+  defaultFootnoteBackLabel
+} from './lib/footer.js'

package/node_modules/mdast-util-to-hast/lib/footer.d.ts

@@ -0,0 +1,81 @@
+/**
+ * Generate the default content that GitHub uses on backreferences.
+ *
+ * @param {number} _
+ *   Index of the definition in the order that they are first referenced,
+ *   0-indexed.
+ * @param {number} rereferenceIndex
+ *   Index of calls to the same definition, 0-indexed.
+ * @returns {Array<ElementContent>}
+ *   Content.
+ */
+export function defaultFootnoteBackContent(_: number, rereferenceIndex: number): Array<ElementContent>;
+/**
+ * Generate the default label that GitHub uses on backreferences.
+ *
+ * @param {number} referenceIndex
+ *   Index of the definition in the order that they are first referenced,
+ *   0-indexed.
+ * @param {number} rereferenceIndex
+ *   Index of calls to the same definition, 0-indexed.
+ * @returns {string}
+ *   Label.
+ */
+export function defaultFootnoteBackLabel(referenceIndex: number, rereferenceIndex: number): string;
+/**
+ * Generate a hast footer for called footnote definitions.
+ *
+ * @param {State} state
+ *   Info passed around.
+ * @returns {Element | undefined}
+ *   `section` element or `undefined`.
+ */
+export function footer(state: State): Element | undefined;
+/**
+ * Generate content for the backreference dynamically.
+ *
+ * For the following markdown:
+ *
+ * ```markdown
+ * Alpha[^micromark], bravo[^micromark], and charlie[^remark].
+ *
+ * [^remark]: things about remark
+ * [^micromark]: things about micromark
+ * ```
+ *
+ * This function will be called with:
+ *
+ * *  `0` and `0` for the backreference from `things about micromark` to
+ *  `alpha`, as it is the first used definition, and the first call to it
+ * *  `0` and `1` for the backreference from `things about micromark` to
+ *  `bravo`, as it is the first used definition, and the second call to it
+ * *  `1` and `0` for the backreference from `things about remark` to
+ *  `charlie`, as it is the second used definition
+ */
+export type FootnoteBackContentTemplate = (referenceIndex: number, rereferenceIndex: number) => Array<ElementContent> | ElementContent | string;
+/**
+ * Generate a back label dynamically.
+ *
+ * For the following markdown:
+ *
+ * ```markdown
+ * Alpha[^micromark], bravo[^micromark], and charlie[^remark].
+ *
+ * [^remark]: things about remark
+ * [^micromark]: things about micromark
+ * ```
+ *
+ * This function will be called with:
+ *
+ * *  `0` and `0` for the backreference from `things about micromark` to
+ *  `alpha`, as it is the first used definition, and the first call to it
+ * *  `0` and `1` for the backreference from `things about micromark` to
+ *  `bravo`, as it is the first used definition, and the second call to it
+ * *  `1` and `0` for the backreference from `things about remark` to
+ *  `charlie`, as it is the second used definition
+ */
+export type FootnoteBackLabelTemplate = (referenceIndex: number, rereferenceIndex: number) => string;
+import type { ElementContent } from 'hast';
+import type { State } from './state.js';
+import type { Element } from 'hast';
+//# sourceMappingURL=footer.d.ts.map

package/node_modules/mdast-util-to-hast/lib/footer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"footer.d.ts","sourceRoot":"","sources":["footer.js"],"names":[],"mappings":"AAmEA;;;;;;;;;;GAUG;AACH,8CARW,MAAM,oBAGN,MAAM,GAEJ,KAAK,CAAC,cAAc,CAAC,CAiBjC;AAED;;;;;;;;;;GAUG;AACH,yDARW,MAAM,oBAGN,MAAM,GAEJ,MAAM,CASlB;AAED;;;;;;;GAOG;AAEH,8BANW,KAAK,GAEH,OAAO,GAAG,SAAS,CAmI/B;;;;;;;;;;;;;;;;;;;;;;2DA/NU,MAAM,oBAGN,MAAM,KAEJ,KAAK,CAAC,cAAc,CAAC,GAAG,cAAc,GAAG,MAAM;;;;;;;;;;;;;;;;;;;;;;yDAwBjD,MAAM,oBAGN,MAAM,KAEJ,MAAM;oCA3DuB,MAAM;2BACxB,YAAY;6BADM,MAAM"}