@e-llm-studio/citation 0.0.140-beta.6 → 0.0.141

package/dist/node_modules/remark-rehype/node_modules/micromark-util-sanitize-uri/index.js

@@ -1,2 +0,0 @@
-import{asciiAlphanumeric as e}from"../micromark-util-character/index.js";function r(r){const o=[];let t=-1,n=0,i=0;for(;++t<r.length;){const c=r.charCodeAt(t);let C="";if(37===c&&e(r.charCodeAt(t+1))&&e(r.charCodeAt(t+2)))i=2;else if(c<128)/[!#$&-;=?-Z_a-z~]/.test(String.fromCharCode(c))||(C=String.fromCharCode(c));else if(c>55295&&c<57344){const e=r.charCodeAt(t+1);c<56320&&e>56319&&e<57344?(C=String.fromCharCode(c,e),i=1):C="�"}else C=String.fromCharCode(c);C&&(o.push(r.slice(n,t),encodeURIComponent(C)),n=t+i+1,C=""),i&&(t+=i,i=0)}return o.join("")+r.slice(n)}export{r as normalizeUri};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/remark-rehype/node_modules/micromark-util-sanitize-uri/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/remark-rehype/node_modules/micromark-util-sanitize-uri/index.js"],"sourcesContent":["import {asciiAlphanumeric} from 'micromark-util-character'\nimport {encode} from 'micromark-util-encode'\n/**\n * Make a value safe for injection as a URL.\n *\n * This encodes unsafe characters with percent-encoding and skips already\n * encoded sequences (see `normalizeUri`).\n * Further unsafe characters are encoded as character references (see\n * `micromark-util-encode`).\n *\n * A regex of allowed protocols can be given, in which case the URL is\n * sanitized.\n * For example, `/^(https?|ircs?|mailto|xmpp)$/i` can be used for `a[href]`, or\n * `/^https?$/i` for `img[src]` (this is what `github.com` allows).\n * If the URL includes an unknown protocol (one not matched by `protocol`, such\n * as a dangerous example, `javascript:`), the value is ignored.\n *\n * @param {string | undefined} url\n *   URI to sanitize.\n * @param {RegExp | null | undefined} [protocol]\n *   Allowed protocols.\n * @returns {string}\n *   Sanitized URI.\n */\nexport function sanitizeUri(url, protocol) {\n  const value = encode(normalizeUri(url || ''))\n  if (!protocol) {\n    return value\n  }\n  const colon = value.indexOf(':')\n  const questionMark = value.indexOf('?')\n  const numberSign = value.indexOf('#')\n  const slash = value.indexOf('/')\n  if (\n    // If there is no protocol, it’s relative.\n    colon < 0 ||\n    // If the first colon is after a `?`, `#`, or `/`, it’s not a protocol.\n    (slash > -1 && colon > slash) ||\n    (questionMark > -1 && colon > questionMark) ||\n    (numberSign > -1 && colon > numberSign) ||\n    // It is a protocol, it should be allowed.\n    protocol.test(value.slice(0, colon))\n  ) {\n    return value\n  }\n  return ''\n}\n\n/**\n * Normalize a URL.\n *\n * Encode unsafe characters with percent-encoding, skipping already encoded\n * sequences.\n *\n * @param {string} value\n *   URI to normalize.\n * @returns {string}\n *   Normalized URI.\n */\nexport function normalizeUri(value) {\n  /** @type {Array<string>} */\n  const result = []\n  let index = -1\n  let start = 0\n  let skip = 0\n  while (++index < value.length) {\n    const code = value.charCodeAt(index)\n    /** @type {string} */\n    let replace = ''\n\n    // A correct percent encoded value.\n    if (\n      code === 37 &&\n      asciiAlphanumeric(value.charCodeAt(index + 1)) &&\n      asciiAlphanumeric(value.charCodeAt(index + 2))\n    ) {\n      skip = 2\n    }\n    // ASCII.\n    else if (code < 128) {\n      if (!/[!#$&-;=?-Z_a-z~]/.test(String.fromCharCode(code))) {\n        replace = String.fromCharCode(code)\n      }\n    }\n    // Astral.\n    else if (code > 55295 && code < 57344) {\n      const next = value.charCodeAt(index + 1)\n\n      // A correct surrogate pair.\n      if (code < 56320 && next > 56319 && next < 57344) {\n        replace = String.fromCharCode(code, next)\n        skip = 1\n      }\n      // Lone surrogate.\n      else {\n        replace = '\\uFFFD'\n      }\n    }\n    // Unicode.\n    else {\n      replace = String.fromCharCode(code)\n    }\n    if (replace) {\n      result.push(value.slice(start, index), encodeURIComponent(replace))\n      start = index + skip + 1\n      replace = ''\n    }\n    if (skip) {\n      index += skip\n      skip = 0\n    }\n  }\n  return result.join('') + value.slice(start)\n}\n"],"names":["normalizeUri","value","result","index","start","skip","length","code","charCodeAt","replace","asciiAlphanumeric","test","String","fromCharCode","next","push","slice","encodeURIComponent","join"],"mappings":"yEA2DO,SAASA,EAAaC,GAE3B,MAAMC,EAAS,GACf,IAAIC,GAAS,EACTC,EAAQ,EACRC,EAAO,EACX,OAASF,EAAQF,EAAMK,QAAQ,CAC7B,MAAMC,EAAON,EAAMO,WAAWL,GAE9B,IAAIM,EAAU,GAGd,GACW,KAATF,GACAG,EAAkBT,EAAMO,WAAWL,EAAQ,KAC3CO,EAAkBT,EAAMO,WAAWL,EAAQ,IAE3CE,EAAO,OAGJ,GAAIE,EAAO,IACT,oBAAoBI,KAAKC,OAAOC,aAAaN,MAChDE,EAAUG,OAAOC,aAAaN,SAI7B,GAAIA,EAAO,OAASA,EAAO,MAAO,CACrC,MAAMO,EAAOb,EAAMO,WAAWL,EAAQ,GAGlCI,EAAO,OAASO,EAAO,OAASA,EAAO,OACzCL,EAAUG,OAAOC,aAAaN,EAAMO,GACpCT,EAAO,GAIPI,EAAU,GAEb,MAGCA,EAAUG,OAAOC,aAAaN,GAE5BE,IACFP,EAAOa,KAAKd,EAAMe,MAAMZ,EAAOD,GAAQc,mBAAmBR,IAC1DL,EAAQD,EAAQE,EAAO,EACvBI,EAAU,IAERJ,IACFF,GAASE,EACTA,EAAO,EAEV,CACD,OAAOH,EAAOgB,KAAK,IAAMjB,EAAMe,MAAMZ,EACvC"}

package/dist/node_modules/remark-rehype/node_modules/unist-util-position/lib/index.js

@@ -1,2 +0,0 @@
-const n=e("start"),t=e("end");function o(o){return{start:n(o),end:t(o)}}function e(n){return function(t){const o=t&&t.position&&t.position[n]||{};return{line:o.line||null,column:o.column||null,offset:o.offset>-1?o.offset:null}}}export{t as pointEnd,n as pointStart,o as position};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/remark-rehype/node_modules/unist-util-position/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/remark-rehype/node_modules/unist-util-position/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Position} Position\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Point} Point\n */\n\n/**\n * @typedef NodeLike\n * @property {string} type\n * @property {PositionLike | null | undefined} [position]\n *\n * @typedef PositionLike\n * @property {PointLike | null | undefined} [start]\n * @property {PointLike | null | undefined} [end]\n *\n * @typedef PointLike\n * @property {number | null | undefined} [line]\n * @property {number | null | undefined} [column]\n * @property {number | null | undefined} [offset]\n */\n\n/**\n * Get the starting point of `node`.\n *\n * @param node\n *   Node.\n * @returns\n *   Point.\n */\nexport const pointStart = point('start')\n\n/**\n * Get the ending point of `node`.\n *\n * @param node\n *   Node.\n * @returns\n *   Point.\n */\nexport const pointEnd = point('end')\n\n/**\n * Get the positional info of `node`.\n *\n * @param {NodeLike | Node | null | undefined} [node]\n *   Node.\n * @returns {Position}\n *   Position.\n */\nexport function position(node) {\n  return {start: pointStart(node), end: pointEnd(node)}\n}\n\n/**\n * Get the positional info of `node`.\n *\n * @param {'start' | 'end'} type\n *   Side.\n * @returns\n *   Getter.\n */\nfunction point(type) {\n  return point\n\n  /**\n   * Get the point info of `node` at a bound side.\n   *\n   * @param {NodeLike | Node | null | undefined} [node]\n   * @returns {Point}\n   */\n  function point(node) {\n    const point = (node && node.position && node.position[type]) || {}\n\n    // To do: next major: don’t return points when invalid.\n    return {\n      // @ts-expect-error: in practice, null is allowed.\n      line: point.line || null,\n      // @ts-expect-error: in practice, null is allowed.\n      column: point.column || null,\n      // @ts-expect-error: in practice, null is allowed.\n      offset: point.offset > -1 ? point.offset : null\n    }\n  }\n}\n"],"names":["pointStart","point","pointEnd","position","node","start","end","type","line","column","offset"],"mappings":"AA6BY,MAACA,EAAaC,EAAM,SAUnBC,EAAWD,EAAM,OAUvB,SAASE,EAASC,GACvB,MAAO,CAACC,MAAOL,EAAWI,GAAOE,IAAKJ,EAASE,GACjD,CAUA,SAASH,EAAMM,GACb,OAQA,SAAeH,GACb,MAAMH,EAASG,GAAQA,EAAKD,UAAYC,EAAKD,SAASI,IAAU,CAAE,EAGlE,MAAO,CAELC,KAAMP,EAAMO,MAAQ,KAEpBC,OAAQR,EAAMQ,QAAU,KAExBC,OAAQT,EAAMS,QAAU,EAAIT,EAAMS,OAAS,KAE9C,CACH"}

package/dist/node_modules/space-separated-tokens/index.js

@@ -1,2 +0,0 @@
-function t(t){const n=String(t||"").trim();return n?n.split(/[ \t\n\r\f]+/g):[]}function n(t){return t.join(" ").trim()}export{t as parse,n as stringify};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/space-separated-tokens/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../node_modules/space-separated-tokens/index.js"],"sourcesContent":["/**\n * Parse space-separated tokens to an array of strings.\n *\n * @param {string} value\n *   Space-separated tokens.\n * @returns {Array<string>}\n *   List of tokens.\n */\nexport function parse(value) {\n  const input = String(value || '').trim()\n  return input ? input.split(/[ \\t\\n\\r\\f]+/g) : []\n}\n\n/**\n * Serialize an array of strings as space separated-tokens.\n *\n * @param {Array<string|number>} values\n *   List of tokens.\n * @returns {string}\n *   Space-separated tokens.\n */\nexport function stringify(values) {\n  return values.join(' ').trim()\n}\n"],"names":["parse","value","input","String","trim","split","stringify","values","join"],"mappings":"AAQO,SAASA,EAAMC,GACpB,MAAMC,EAAQC,OAAOF,GAAS,IAAIG,OAClC,OAAOF,EAAQA,EAAMG,MAAM,iBAAmB,EAChD,CAUO,SAASC,EAAUC,GACxB,OAAOA,EAAOC,KAAK,KAAKJ,MAC1B"}

package/dist/node_modules/state-local/lib/es/state-local.js

@@ -1,2 +0,0 @@
-function e(e,n,t){return n in e?Object.defineProperty(e,n,{value:t,enumerable:!0,configurable:!0,writable:!0}):e[n]=t,e}function n(e,n){var t=Object.keys(e);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(e);n&&(r=r.filter(function(n){return Object.getOwnPropertyDescriptor(e,n).enumerable})),t.push.apply(t,r)}return t}function t(t){for(var r=1;r<arguments.length;r++){var i=null!=arguments[r]?arguments[r]:{};r%2?n(Object(i),!0).forEach(function(n){e(t,n,i[n])}):Object.getOwnPropertyDescriptors?Object.defineProperties(t,Object.getOwnPropertyDescriptors(i)):n(Object(i)).forEach(function(e){Object.defineProperty(t,e,Object.getOwnPropertyDescriptor(i,e))})}return t}function r(e){return function n(){for(var t=this,r=arguments.length,i=new Array(r),c=0;c<r;c++)i[c]=arguments[c];return i.length>=e.length?e.apply(this,i):function(){for(var e=arguments.length,r=new Array(e),c=0;c<e;c++)r[c]=arguments[c];return n.apply(t,[].concat(i,r))}}}function i(e){return{}.toString.call(e).includes("Object")}function c(e){return"function"==typeof e}var o=r(function(e,n){throw new Error(e[n]||e.default)})({initialIsRequired:"initial state is required",initialType:"initial state should be an object",initialContent:"initial state shouldn't be an empty object",handlerType:"handler should be an object or a function",handlersType:"all handlers should be a functions",selectorType:"selector should be a function",changeType:"provided value of changes should be an object",changeField:'it seams you want to change a field in the state which is not specified in the "initial" state',default:"an unknown error accured in `state-local` package"}),a={changes:function(e,n){return i(n)||o("changeType"),Object.keys(n).some(function(n){return t=e,r=n,!Object.prototype.hasOwnProperty.call(t,r);var t,r})&&o("changeField"),n},selector:function(e){c(e)||o("selectorType")},handler:function(e){c(e)||i(e)||o("handlerType"),i(e)&&Object.values(e).some(function(e){return!c(e)})&&o("handlersType")},initial:function(e){var n;e||o("initialIsRequired"),i(e)||o("initialType"),n=e,Object.keys(n).length||o("initialContent")}};function u(e,n){return c(n)?n(e.current):n}function l(e,n){return e.current=t(t({},e.current),n),n}function f(e,n,t){return c(n)?n(e.current):Object.keys(t).forEach(function(t){var r;return null===(r=n[t])||void 0===r?void 0:r.call(n,e.current[t])}),t}var s={create:function(e){var n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};a.initial(e),a.handler(n);var t={current:e},i=r(f)(t,n),c=r(l)(t),o=r(a.changes)(e),s=r(u)(t);return[function(){var e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:function(e){return e};return a.selector(e),e(t.current)},function(e){!function(){for(var e=arguments.length,n=new Array(e),t=0;t<e;t++)n[t]=arguments[t];return function(e){return n.reduceRight(function(e,n){return n(e)},e)}}(i,c,o,s)(e)}]}};export{s as default};
-//# sourceMappingURL=state-local.js.map

package/dist/node_modules/state-local/lib/es/state-local.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"state-local.js","sources":["../../../../../node_modules/state-local/lib/es/state-local.js"],"sourcesContent":["function _defineProperty(obj, key, value) {\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n\n  return obj;\n}\n\nfunction ownKeys(object, enumerableOnly) {\n  var keys = Object.keys(object);\n\n  if (Object.getOwnPropertySymbols) {\n    var symbols = Object.getOwnPropertySymbols(object);\n    if (enumerableOnly) symbols = symbols.filter(function (sym) {\n      return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n    });\n    keys.push.apply(keys, symbols);\n  }\n\n  return keys;\n}\n\nfunction _objectSpread2(target) {\n  for (var i = 1; i < arguments.length; i++) {\n    var source = arguments[i] != null ? arguments[i] : {};\n\n    if (i % 2) {\n      ownKeys(Object(source), true).forEach(function (key) {\n        _defineProperty(target, key, source[key]);\n      });\n    } else if (Object.getOwnPropertyDescriptors) {\n      Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n    } else {\n      ownKeys(Object(source)).forEach(function (key) {\n        Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n      });\n    }\n  }\n\n  return target;\n}\n\nfunction compose() {\n  for (var _len = arguments.length, fns = new Array(_len), _key = 0; _key < _len; _key++) {\n    fns[_key] = arguments[_key];\n  }\n\n  return function (x) {\n    return fns.reduceRight(function (y, f) {\n      return f(y);\n    }, x);\n  };\n}\n\nfunction curry(fn) {\n  return function curried() {\n    var _this = this;\n\n    for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n      args[_key2] = arguments[_key2];\n    }\n\n    return args.length >= fn.length ? fn.apply(this, args) : function () {\n      for (var _len3 = arguments.length, nextArgs = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {\n        nextArgs[_key3] = arguments[_key3];\n      }\n\n      return curried.apply(_this, [].concat(args, nextArgs));\n    };\n  };\n}\n\nfunction isObject(value) {\n  return {}.toString.call(value).includes('Object');\n}\n\nfunction isEmpty(obj) {\n  return !Object.keys(obj).length;\n}\n\nfunction isFunction(value) {\n  return typeof value === 'function';\n}\n\nfunction hasOwnProperty(object, property) {\n  return Object.prototype.hasOwnProperty.call(object, property);\n}\n\nfunction validateChanges(initial, changes) {\n  if (!isObject(changes)) errorHandler('changeType');\n  if (Object.keys(changes).some(function (field) {\n    return !hasOwnProperty(initial, field);\n  })) errorHandler('changeField');\n  return changes;\n}\n\nfunction validateSelector(selector) {\n  if (!isFunction(selector)) errorHandler('selectorType');\n}\n\nfunction validateHandler(handler) {\n  if (!(isFunction(handler) || isObject(handler))) errorHandler('handlerType');\n  if (isObject(handler) && Object.values(handler).some(function (_handler) {\n    return !isFunction(_handler);\n  })) errorHandler('handlersType');\n}\n\nfunction validateInitial(initial) {\n  if (!initial) errorHandler('initialIsRequired');\n  if (!isObject(initial)) errorHandler('initialType');\n  if (isEmpty(initial)) errorHandler('initialContent');\n}\n\nfunction throwError(errorMessages, type) {\n  throw new Error(errorMessages[type] || errorMessages[\"default\"]);\n}\n\nvar errorMessages = {\n  initialIsRequired: 'initial state is required',\n  initialType: 'initial state should be an object',\n  initialContent: 'initial state shouldn\\'t be an empty object',\n  handlerType: 'handler should be an object or a function',\n  handlersType: 'all handlers should be a functions',\n  selectorType: 'selector should be a function',\n  changeType: 'provided value of changes should be an object',\n  changeField: 'it seams you want to change a field in the state which is not specified in the \"initial\" state',\n  \"default\": 'an unknown error accured in `state-local` package'\n};\nvar errorHandler = curry(throwError)(errorMessages);\nvar validators = {\n  changes: validateChanges,\n  selector: validateSelector,\n  handler: validateHandler,\n  initial: validateInitial\n};\n\nfunction create(initial) {\n  var handler = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  validators.initial(initial);\n  validators.handler(handler);\n  var state = {\n    current: initial\n  };\n  var didUpdate = curry(didStateUpdate)(state, handler);\n  var update = curry(updateState)(state);\n  var validate = curry(validators.changes)(initial);\n  var getChanges = curry(extractChanges)(state);\n\n  function getState() {\n    var selector = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : function (state) {\n      return state;\n    };\n    validators.selector(selector);\n    return selector(state.current);\n  }\n\n  function setState(causedChanges) {\n    compose(didUpdate, update, validate, getChanges)(causedChanges);\n  }\n\n  return [getState, setState];\n}\n\nfunction extractChanges(state, causedChanges) {\n  return isFunction(causedChanges) ? causedChanges(state.current) : causedChanges;\n}\n\nfunction updateState(state, changes) {\n  state.current = _objectSpread2(_objectSpread2({}, state.current), changes);\n  return changes;\n}\n\nfunction didStateUpdate(state, handler, changes) {\n  isFunction(handler) ? handler(state.current) : Object.keys(changes).forEach(function (field) {\n    var _handler$field;\n\n    return (_handler$field = handler[field]) === null || _handler$field === void 0 ? void 0 : _handler$field.call(handler, state.current[field]);\n  });\n  return changes;\n}\n\nvar index = {\n  create: create\n};\n\nexport default index;\n"],"names":["_defineProperty","obj","key","value","Object","defineProperty","enumerable","configurable","writable","ownKeys","object","enumerableOnly","keys","getOwnPropertySymbols","symbols","filter","sym","getOwnPropertyDescriptor","push","apply","_objectSpread2","target","i","arguments","length","source","forEach","getOwnPropertyDescriptors","defineProperties","curry","fn","curried","_this","this","_len2","args","Array","_key2","_len3","nextArgs","_key3","concat","isObject","toString","call","includes","isFunction","errorHandler","errorMessages","type","Error","initialIsRequired","initialType","initialContent","handlerType","handlersType","selectorType","changeType","changeField","default","validators","changes","initial","some","field","property","prototype","hasOwnProperty","selector","handler","values","_handler","extractChanges","state","causedChanges","current","updateState","didStateUpdate","_handler$field","index","create","undefined","didUpdate","update","validate","getChanges","_len","fns","_key","x","reduceRight","y","f","compose"],"mappings":"AAAA,SAASA,EAAgBC,EAAKC,EAAKC,GAYjC,OAXID,KAAOD,EACTG,OAAOC,eAAeJ,EAAKC,EAAK,CAC9BC,MAAOA,EACPG,YAAY,EACZC,cAAc,EACdC,UAAU,IAGZP,EAAIC,GAAOC,EAGNF,CACT,CAEA,SAASQ,EAAQC,EAAQC,GACvB,IAAIC,EAAOR,OAAOQ,KAAKF,GAEvB,GAAIN,OAAOS,sBAAuB,CAChC,IAAIC,EAAUV,OAAOS,sBAAsBH,GACvCC,IAAgBG,EAAUA,EAAQC,OAAO,SAAUC,GACrD,OAAOZ,OAAOa,yBAAyBP,EAAQM,GAAKV,UAC1D,IACIM,EAAKM,KAAKC,MAAMP,EAAME,EACvB,CAED,OAAOF,CACT,CAEA,SAASQ,EAAeC,GACtB,IAAK,IAAIC,EAAI,EAAGA,EAAIC,UAAUC,OAAQF,IAAK,CACzC,IAAIG,EAAyB,MAAhBF,UAAUD,GAAaC,UAAUD,GAAK,GAE/CA,EAAI,EACNb,EAAQL,OAAOqB,IAAS,GAAMC,QAAQ,SAAUxB,GAC9CF,EAAgBqB,EAAQnB,EAAKuB,EAAOvB,GAC5C,GACeE,OAAOuB,0BAChBvB,OAAOwB,iBAAiBP,EAAQjB,OAAOuB,0BAA0BF,IAEjEhB,EAAQL,OAAOqB,IAASC,QAAQ,SAAUxB,GACxCE,OAAOC,eAAegB,EAAQnB,EAAKE,OAAOa,yBAAyBQ,EAAQvB,GACnF,EAEG,CAED,OAAOmB,CACT,CAcA,SAASQ,EAAMC,GACb,OAAO,SAASC,IAGd,IAFA,IAAIC,EAAQC,KAEHC,EAAQX,UAAUC,OAAQW,EAAO,IAAIC,MAAMF,GAAQG,EAAQ,EAAGA,EAAQH,EAAOG,IACpFF,EAAKE,GAASd,UAAUc,GAG1B,OAAOF,EAAKX,QAAUM,EAAGN,OAASM,EAAGX,MAAMc,KAAME,GAAQ,WACvD,IAAK,IAAIG,EAAQf,UAAUC,OAAQe,EAAW,IAAIH,MAAME,GAAQE,EAAQ,EAAGA,EAAQF,EAAOE,IACxFD,EAASC,GAASjB,UAAUiB,GAG9B,OAAOT,EAAQZ,MAAMa,EAAO,GAAGS,OAAON,EAAMI,GAClD,CACA,CACA,CAEA,SAASG,EAASvC,GAChB,MAAO,CAAA,EAAGwC,SAASC,KAAKzC,GAAO0C,SAAS,SAC1C,CAMA,SAASC,EAAW3C,GAClB,MAAwB,mBAAVA,CAChB,CAmCA,IAWI4C,EAAelB,EAfnB,SAAoBmB,EAAeC,GACjC,MAAM,IAAIC,MAAMF,EAAcC,IAASD,EAAuB,QAChE,EAamBnB,CAXC,CAClBsB,kBAAmB,4BACnBC,YAAa,oCACbC,eAAgB,6CAChBC,YAAa,4CACbC,aAAc,qCACdC,aAAc,gCACdC,WAAY,gDACZC,YAAa,iGACbC,QAAW,sDAGTC,EAAa,CACfC,QA1CF,SAAyBC,EAASD,GAKhC,OAJKnB,EAASmB,IAAUd,EAAa,cACjC3C,OAAOQ,KAAKiD,GAASE,KAAK,SAAUC,GACtC,OAPoBtD,EAOGoD,EAPKG,EAOID,GAN3B5D,OAAO8D,UAAUC,eAAevB,KAAKlC,EAAQuD,GADtD,IAAwBvD,EAAQuD,CAQhC,IAAMlB,EAAa,eACVc,CACT,EAqCEO,SAnCF,SAA0BA,GACnBtB,EAAWsB,IAAWrB,EAAa,eAC1C,EAkCEsB,QAhCF,SAAyBA,GACjBvB,EAAWuB,IAAY3B,EAAS2B,IAAWtB,EAAa,eAC1DL,EAAS2B,IAAYjE,OAAOkE,OAAOD,GAASN,KAAK,SAAUQ,GAC7D,OAAQzB,EAAWyB,EACvB,IAAMxB,EAAa,eACnB,EA4BEe,QA1BF,SAAyBA,GA/BzB,IAAiB7D,EAgCV6D,GAASf,EAAa,qBACtBL,EAASoB,IAAUf,EAAa,eAjCtB9C,EAkCH6D,EAjCJ1D,OAAOQ,KAAKX,GAAKuB,QAiCHuB,EAAa,iBACrC,GAoDA,SAASyB,EAAeC,EAAOC,GAC7B,OAAO5B,EAAW4B,GAAiBA,EAAcD,EAAME,SAAWD,CACpE,CAEA,SAASE,EAAYH,EAAOZ,GAE1B,OADAY,EAAME,QAAUvD,EAAeA,EAAe,CAAE,EAAEqD,EAAME,SAAUd,GAC3DA,CACT,CAEA,SAASgB,EAAeJ,EAAOJ,EAASR,GAMtC,OALAf,EAAWuB,GAAWA,EAAQI,EAAME,SAAWvE,OAAOQ,KAAKiD,GAASnC,QAAQ,SAAUsC,GACpF,IAAIc,EAEJ,OAA6C,QAArCA,EAAiBT,EAAQL,UAA4C,IAAxBc,OAAiC,EAAIA,EAAelC,KAAKyB,EAASI,EAAME,QAAQX,GACzI,GACSH,CACT,CAEG,IAACkB,EAAQ,CACVC,OA9CF,SAAgBlB,GACd,IAAIO,EAAU9C,UAAUC,OAAS,QAAsByD,IAAjB1D,UAAU,GAAmBA,UAAU,GAAK,CAAA,EAClFqC,EAAWE,QAAQA,GACnBF,EAAWS,QAAQA,GACnB,IAAII,EAAQ,CACVE,QAASb,GAEPoB,EAAYrD,EAAMgD,EAANhD,CAAsB4C,EAAOJ,GACzCc,EAAStD,EAAM+C,EAAN/C,CAAmB4C,GAC5BW,EAAWvD,EAAM+B,EAAWC,QAAjBhC,CAA0BiC,GACrCuB,EAAaxD,EAAM2C,EAAN3C,CAAsB4C,GAcvC,MAAO,CAZP,WACE,IAAIL,EAAW7C,UAAUC,OAAS,QAAsByD,IAAjB1D,UAAU,GAAmBA,UAAU,GAAK,SAAUkD,GAC3F,OAAOA,CACb,EAEI,OADAb,EAAWQ,SAASA,GACbA,EAASK,EAAME,QACvB,EAED,SAAkBD,IAlHpB,WACE,IAAK,IAAIY,EAAO/D,UAAUC,OAAQ+D,EAAM,IAAInD,MAAMkD,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC9ED,EAAIC,GAAQjE,UAAUiE,GAGxB,OAAO,SAAUC,GACf,OAAOF,EAAIG,YAAY,SAAUC,EAAGC,GAClC,OAAOA,EAAED,EACV,EAAEF,EACP,CACA,CAyGII,CAAQX,EAAWC,EAAQC,EAAUC,EAArCQ,CAAiDnB,EAClD,EAGH"}

package/dist/node_modules/style-to-object/index.js

@@ -1,2 +0,0 @@
-import{__module as r}from"../../_virtual/index9.js";import{__require as e}from"../inline-style-parser/index.js";var t;function n(){if(t)return r.exports;t=1;var n=e();function o(r,e){var t,o=null;if(!r||"string"!=typeof r)return o;for(var i,u,p=n(r),s="function"==typeof e,a=0,f=p.length;a<f;a++)i=(t=p[a]).property,u=t.value,s?e(i,u,t):u&&(o||(o={}),o[i]=u);return o}return r.exports=o,r.exports.default=o,r.exports}export{n as __require};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/style-to-object/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../node_modules/style-to-object/index.js"],"sourcesContent":["var parse = require('inline-style-parser');\n\n/**\n * Parses inline style to object.\n *\n * @example\n * // returns { 'line-height': '42' }\n * StyleToObject('line-height: 42;');\n *\n * @param  {String}      style      - The inline style.\n * @param  {Function}    [iterator] - The iterator function.\n * @return {null|Object}\n */\nfunction StyleToObject(style, iterator) {\n  var output = null;\n  if (!style || typeof style !== 'string') {\n    return output;\n  }\n\n  var declaration;\n  var declarations = parse(style);\n  var hasIterator = typeof iterator === 'function';\n  var property;\n  var value;\n\n  for (var i = 0, len = declarations.length; i < len; i++) {\n    declaration = declarations[i];\n    property = declaration.property;\n    value = declaration.value;\n\n    if (hasIterator) {\n      iterator(property, value, declaration);\n    } else if (value) {\n      output || (output = {});\n      output[property] = value;\n    }\n  }\n\n  return output;\n}\n\nmodule.exports = StyleToObject;\nmodule.exports.default = StyleToObject; // ESM support\n"],"names":["parse","require$$0","StyleToObject","style","iterator","declaration","output","property","value","declarations","hasIterator","i","len","length","styleToObjectModule","exports","default"],"mappings":"6JAAA,IAAIA,EAAQC,IAaZ,SAASC,EAAcC,EAAOC,GAC5B,IAKIC,EALAC,EAAS,KACb,IAAKH,GAA0B,iBAAVA,EACnB,OAAOG,EAST,IALA,IAEIC,EACAC,EAHAC,EAAeT,EAAMG,GACrBO,EAAkC,mBAAbN,EAIhBO,EAAI,EAAGC,EAAMH,EAAaI,OAAQF,EAAIC,EAAKD,IAElDJ,GADAF,EAAcI,EAAaE,IACJJ,SACvBC,EAAQH,EAAYG,MAEhBE,EACFN,EAASG,EAAUC,EAAOH,GACjBG,IACTF,IAAWA,EAAS,CAAA,GACpBA,EAAOC,GAAYC,GAIvB,OAAOF,CACT,QAEAQ,EAAAC,QAAiBb,EACKY,EAAAC,QAAAC,QAAGd"}

package/dist/node_modules/style-to-object/index.mjs.js

@@ -1,2 +0,0 @@
-import r from"../../_virtual/index8.js";export{default}from"../../_virtual/index8.js";
-//# sourceMappingURL=index.mjs.js.map

package/dist/node_modules/style-to-object/index.mjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.mjs.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/node_modules/trim-lines/index.js

@@ -1,2 +0,0 @@
-function e(e){const n=String(e),o=/\r?\n|\r/g;let i=o.exec(n),c=0;const r=[];for(;i;)r.push(t(n.slice(c,i.index),c>0,!0),i[0]),c=i.index+i[0].length,i=o.exec(n);return r.push(t(n.slice(c),c>0,!1)),r.join("")}function t(e,t,n){let o=0,i=e.length;if(t){let t=e.codePointAt(o);for(;9===t||32===t;)o++,t=e.codePointAt(o)}if(n){let t=e.codePointAt(i-1);for(;9===t||32===t;)i--,t=e.codePointAt(i-1)}return i>o?e.slice(o,i):""}export{e as trimLines};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/trim-lines/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../node_modules/trim-lines/index.js"],"sourcesContent":["const tab = 9 /* `\\t` */\nconst space = 32 /* ` ` */\n\n/**\n * Remove initial and final spaces and tabs at the line breaks in `value`.\n * Does not trim initial and final spaces and tabs of the value itself.\n *\n * @param {string} value\n *   Value to trim.\n * @returns {string}\n *   Trimmed value.\n */\nexport function trimLines(value) {\n  const source = String(value)\n  const search = /\\r?\\n|\\r/g\n  let match = search.exec(source)\n  let last = 0\n  /** @type {Array<string>} */\n  const lines = []\n\n  while (match) {\n    lines.push(\n      trimLine(source.slice(last, match.index), last > 0, true),\n      match[0]\n    )\n\n    last = match.index + match[0].length\n    match = search.exec(source)\n  }\n\n  lines.push(trimLine(source.slice(last), last > 0, false))\n\n  return lines.join('')\n}\n\n/**\n * @param {string} value\n *   Line to trim.\n * @param {boolean} start\n *   Whether to trim the start of the line.\n * @param {boolean} end\n *   Whether to trim the end of the line.\n * @returns {string}\n *   Trimmed line.\n */\nfunction trimLine(value, start, end) {\n  let startIndex = 0\n  let endIndex = value.length\n\n  if (start) {\n    let code = value.codePointAt(startIndex)\n\n    while (code === tab || code === space) {\n      startIndex++\n      code = value.codePointAt(startIndex)\n    }\n  }\n\n  if (end) {\n    let code = value.codePointAt(endIndex - 1)\n\n    while (code === tab || code === space) {\n      endIndex--\n      code = value.codePointAt(endIndex - 1)\n    }\n  }\n\n  return endIndex > startIndex ? value.slice(startIndex, endIndex) : ''\n}\n"],"names":["trimLines","value","source","String","search","match","exec","last","lines","push","trimLine","slice","index","length","join","start","end","startIndex","endIndex","code","codePointAt"],"mappings":"AAYO,SAASA,EAAUC,GACxB,MAAMC,EAASC,OAAOF,GAChBG,EAAS,YACf,IAAIC,EAAQD,EAAOE,KAAKJ,GACpBK,EAAO,EAEX,MAAMC,EAAQ,GAEd,KAAOH,GACLG,EAAMC,KACJC,EAASR,EAAOS,MAAMJ,EAAMF,EAAMO,OAAQL,EAAO,GAAG,GACpDF,EAAM,IAGRE,EAAOF,EAAMO,MAAQP,EAAM,GAAGQ,OAC9BR,EAAQD,EAAOE,KAAKJ,GAKtB,OAFAM,EAAMC,KAAKC,EAASR,EAAOS,MAAMJ,GAAOA,EAAO,GAAG,IAE3CC,EAAMM,KAAK,GACpB,CAYA,SAASJ,EAAST,EAAOc,EAAOC,GAC9B,IAAIC,EAAa,EACbC,EAAWjB,EAAMY,OAErB,GAAIE,EAAO,CACT,IAAII,EAAOlB,EAAMmB,YAAYH,GAE7B,KApDQ,IAoDDE,GAnDG,KAmDaA,GACrBF,IACAE,EAAOlB,EAAMmB,YAAYH,EAE5B,CAED,GAAID,EAAK,CACP,IAAIG,EAAOlB,EAAMmB,YAAYF,EAAW,GAExC,KA7DQ,IA6DDC,GA5DG,KA4DaA,GACrBD,IACAC,EAAOlB,EAAMmB,YAAYF,EAAW,EAEvC,CAED,OAAOA,EAAWD,EAAahB,EAAMU,MAAMM,EAAYC,GAAY,EACrE"}

package/dist/node_modules/trough/lib/index.js

@@ -1,2 +0,0 @@
-function n(){const n=[],e={run:function(...e){let o=-1;const r=e.pop();if("function"!=typeof r)throw new TypeError("Expected function as last argument, not "+r);!function u(c,...f){const i=n[++o];let l=-1;if(c)r(c);else{for(;++l<e.length;)null!==f[l]&&void 0!==f[l]||(f[l]=e[l]);e=f,i?t(i,u)(...f):r(null,...f)}}(null,...e)},use:function(t){if("function"!=typeof t)throw new TypeError("Expected `middelware` to be a function, not "+t);return n.push(t),e}};return e}function t(n,t){let e;return function(...t){const u=n.length>t.length;let c;u&&t.push(o);try{c=n.apply(this,t)}catch(n){if(u&&e)throw n;return o(n)}u||(c&&c.then&&"function"==typeof c.then?c.then(r,o):c instanceof Error?o(c):r(c))};function o(n,...o){e||(e=!0,t(n,...o))}function r(n){o(null,n)}}export{n as trough,t as wrap};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/trough/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../node_modules/trough/lib/index.js"],"sourcesContent":["// To do: remove `void`s\n// To do: remove `null` from output of our APIs, allow it as user APIs.\n\n/**\n * @typedef {(error?: Error | null | undefined, ...output: Array<any>) => void} Callback\n *   Callback.\n *\n * @typedef {(...input: Array<any>) => any} Middleware\n *   Ware.\n *\n * @typedef Pipeline\n *   Pipeline.\n * @property {Run} run\n *   Run the pipeline.\n * @property {Use} use\n *   Add middleware.\n *\n * @typedef {(...input: Array<any>) => void} Run\n *   Call all middleware.\n *\n *   Calls `done` on completion with either an error or the output of the\n *   last middleware.\n *\n *   > 👉 **Note**: as the length of input defines whether async functions get a\n *   > `next` function,\n *   > it’s recommended to keep `input` at one value normally.\n\n *\n * @typedef {(fn: Middleware) => Pipeline} Use\n *   Add middleware.\n */\n\n/**\n * Create new middleware.\n *\n * @returns {Pipeline}\n *   Pipeline.\n */\nexport function trough() {\n  /** @type {Array<Middleware>} */\n  const fns = []\n  /** @type {Pipeline} */\n  const pipeline = {run, use}\n\n  return pipeline\n\n  /** @type {Run} */\n  function run(...values) {\n    let middlewareIndex = -1\n    /** @type {Callback} */\n    const callback = values.pop()\n\n    if (typeof callback !== 'function') {\n      throw new TypeError('Expected function as last argument, not ' + callback)\n    }\n\n    next(null, ...values)\n\n    /**\n     * Run the next `fn`, or we’re done.\n     *\n     * @param {Error | null | undefined} error\n     * @param {Array<any>} output\n     */\n    function next(error, ...output) {\n      const fn = fns[++middlewareIndex]\n      let index = -1\n\n      if (error) {\n        callback(error)\n        return\n      }\n\n      // Copy non-nullish input into values.\n      while (++index < values.length) {\n        if (output[index] === null || output[index] === undefined) {\n          output[index] = values[index]\n        }\n      }\n\n      // Save the newly created `output` for the next call.\n      values = output\n\n      // Next or done.\n      if (fn) {\n        wrap(fn, next)(...output)\n      } else {\n        callback(null, ...output)\n      }\n    }\n  }\n\n  /** @type {Use} */\n  function use(middelware) {\n    if (typeof middelware !== 'function') {\n      throw new TypeError(\n        'Expected `middelware` to be a function, not ' + middelware\n      )\n    }\n\n    fns.push(middelware)\n    return pipeline\n  }\n}\n\n/**\n * Wrap `middleware` into a uniform interface.\n *\n * You can pass all input to the resulting function.\n * `callback` is then called with the output of `middleware`.\n *\n * If `middleware` accepts more arguments than the later given in input,\n * an extra `done` function is passed to it after that input,\n * which must be called by `middleware`.\n *\n * The first value in `input` is the main input value.\n * All other input values are the rest input values.\n * The values given to `callback` are the input values,\n * merged with every non-nullish output value.\n *\n * * if `middleware` throws an error,\n *   returns a promise that is rejected,\n *   or calls the given `done` function with an error,\n *   `callback` is called with that error\n * * if `middleware` returns a value or returns a promise that is resolved,\n *   that value is the main output value\n * * if `middleware` calls `done`,\n *   all non-nullish values except for the first one (the error) overwrite the\n *   output values\n *\n * @param {Middleware} middleware\n *   Function to wrap.\n * @param {Callback} callback\n *   Callback called with the output of `middleware`.\n * @returns {Run}\n *   Wrapped middleware.\n */\nexport function wrap(middleware, callback) {\n  /** @type {boolean} */\n  let called\n\n  return wrapped\n\n  /**\n   * Call `middleware`.\n   * @this {any}\n   * @param {Array<any>} parameters\n   * @returns {void}\n   */\n  function wrapped(...parameters) {\n    const fnExpectsCallback = middleware.length > parameters.length\n    /** @type {any} */\n    let result\n\n    if (fnExpectsCallback) {\n      parameters.push(done)\n    }\n\n    try {\n      result = middleware.apply(this, parameters)\n    } catch (error) {\n      const exception = /** @type {Error} */ (error)\n\n      // Well, this is quite the pickle.\n      // `middleware` received a callback and called it synchronously, but that\n      // threw an error.\n      // The only thing left to do is to throw the thing instead.\n      if (fnExpectsCallback && called) {\n        throw exception\n      }\n\n      return done(exception)\n    }\n\n    if (!fnExpectsCallback) {\n      if (result && result.then && typeof result.then === 'function') {\n        result.then(then, done)\n      } else if (result instanceof Error) {\n        done(result)\n      } else {\n        then(result)\n      }\n    }\n  }\n\n  /**\n   * Call `callback`, only once.\n   *\n   * @type {Callback}\n   */\n  function done(error, ...output) {\n    if (!called) {\n      called = true\n      callback(error, ...output)\n    }\n  }\n\n  /**\n   * Call `done` with one value.\n   *\n   * @param {any} [value]\n   */\n  function then(value) {\n    done(null, value)\n  }\n}\n"],"names":["trough","fns","pipeline","run","values","middlewareIndex","callback","pop","TypeError","next","error","output","fn","index","length","undefined","wrap","use","middelware","push","middleware","called","parameters","fnExpectsCallback","result","done","apply","this","then","Error","value"],"mappings":"AAsCO,SAASA,IAEd,MAAMC,EAAM,GAENC,EAAW,CAACC,IAKlB,YAAgBC,GACd,IAAIC,GAAmB,EAEvB,MAAMC,EAAWF,EAAOG,MAExB,GAAwB,mBAAbD,EACT,MAAM,IAAIE,UAAU,2CAA6CF,IAWnE,SAASG,EAAKC,KAAUC,GACtB,MAAMC,EAAKX,IAAMI,GACjB,IAAIQ,GAAS,EAEb,GAAIH,EACFJ,EAASI,OADX,CAMA,OAASG,EAAQT,EAAOU,QACA,OAAlBH,EAAOE,SAAqCE,IAAlBJ,EAAOE,KACnCF,EAAOE,GAAST,EAAOS,IAK3BT,EAASO,EAGLC,EACFI,EAAKJ,EAAIH,EAATO,IAAkBL,GAElBL,EAAS,QAASK,EAhBnB,CAkBF,CAjCDF,CAAK,QAASL,EAkCf,EAhDsBa,IAmDvB,SAAaC,GACX,GAA0B,mBAAfA,EACT,MAAM,IAAIV,UACR,+CAAiDU,GAKrD,OADAjB,EAAIkB,KAAKD,GACFhB,CACR,GA1DD,OAAOA,CA2DT,CAkCO,SAASc,EAAKI,EAAYd,GAE/B,IAAIe,EAEJ,OAQA,YAAoBC,GAClB,MAAMC,EAAoBH,EAAWN,OAASQ,EAAWR,OAEzD,IAAIU,EAEAD,GACFD,EAAWH,KAAKM,GAGlB,IACED,EAASJ,EAAWM,MAAMC,KAAML,EACjC,CAAC,MAAOZ,GAOP,GAAIa,GAAqBF,EACvB,MAPsC,EAUxC,OAAOI,EAViC,EAWzC,CAEIF,IACCC,GAAUA,EAAOI,MAA+B,mBAAhBJ,EAAOI,KACzCJ,EAAOI,KAAKA,EAAMH,GACTD,aAAkBK,MAC3BJ,EAAKD,GAELI,EAAKJ,GAGV,EAOD,SAASC,EAAKf,KAAUC,GACjBU,IACHA,GAAS,EACTf,EAASI,KAAUC,GAEtB,CAOD,SAASiB,EAAKE,GACZL,EAAK,KAAMK,EACZ,CACH"}

package/dist/node_modules/tslib/tslib.es6.mjs.js

@@ -1,2 +0,0 @@
-var t=function(){return t=Object.assign||function(t){for(var e,r=1,n=arguments.length;r<n;r++)for(var o in e=arguments[r])Object.prototype.hasOwnProperty.call(e,o)&&(t[o]=e[o]);return t},t.apply(this,arguments)};function e(t,e){var r={};for(var n in t)Object.prototype.hasOwnProperty.call(t,n)&&e.indexOf(n)<0&&(r[n]=t[n]);if(null!=t&&"function"==typeof Object.getOwnPropertySymbols){var o=0;for(n=Object.getOwnPropertySymbols(t);o<n.length;o++)e.indexOf(n[o])<0&&Object.prototype.propertyIsEnumerable.call(t,n[o])&&(r[n[o]]=t[n[o]])}return r}function r(t,e,r,n){return new(r||(r=Promise))(function(o,a){function c(t){try{i(n.next(t))}catch(t){a(t)}}function l(t){try{i(n.throw(t))}catch(t){a(t)}}function i(t){var e;t.done?o(t.value):(e=t.value,e instanceof r?e:new r(function(t){t(e)})).then(c,l)}i((n=n.apply(t,e||[])).next())})}function n(t,e){var r,n,o,a={label:0,sent:function(){if(1&o[0])throw o[1];return o[1]},trys:[],ops:[]},c=Object.create(("function"==typeof Iterator?Iterator:Object).prototype);return c.next=l(0),c.throw=l(1),c.return=l(2),"function"==typeof Symbol&&(c[Symbol.iterator]=function(){return this}),c;function l(l){return function(i){return function(l){if(r)throw new TypeError("Generator is already executing.");for(;c&&(c=0,l[0]&&(a=0)),a;)try{if(r=1,n&&(o=2&l[0]?n.return:l[0]?n.throw||((o=n.return)&&o.call(n),0):n.next)&&!(o=o.call(n,l[1])).done)return o;switch(n=0,o&&(l=[2&l[0],o.value]),l[0]){case 0:case 1:o=l;break;case 4:return a.label++,{value:l[1],done:!1};case 5:a.label++,n=l[1],l=[0];continue;case 7:l=a.ops.pop(),a.trys.pop();continue;default:if(!(o=a.trys,(o=o.length>0&&o[o.length-1])||6!==l[0]&&2!==l[0])){a=0;continue}if(3===l[0]&&(!o||l[1]>o[0]&&l[1]<o[3])){a.label=l[1];break}if(6===l[0]&&a.label<o[1]){a.label=o[1],o=l;break}if(o&&a.label<o[2]){a.label=o[2],a.ops.push(l);break}o[2]&&a.ops.pop(),a.trys.pop();continue}l=e.call(t,a)}catch(t){l=[6,t],n=0}finally{r=o=0}if(5&l[0])throw l[1];return{value:l[0]?l[1]:void 0,done:!0}}([l,i])}}}function o(t,e,r){if(r||2===arguments.length)for(var n,o=0,a=e.length;o<a;o++)!n&&o in e||(n||(n=Array.prototype.slice.call(e,0,o)),n[o]=e[o]);return t.concat(n||Array.prototype.slice.call(e))}"function"==typeof SuppressedError&&SuppressedError;export{t as __assign,r as __awaiter,n as __generator,e as __rest,o as __spreadArray};
-//# sourceMappingURL=tslib.es6.mjs.js.map

package/dist/node_modules/tslib/tslib.es6.mjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tslib.es6.mjs.js","sources":["../../../node_modules/tslib/tslib.es6.mjs"],"sourcesContent":["/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol, Iterator */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nexport function __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n  return g.next = verb(0), g[\"throw\"] = verb(1), g[\"return\"] = verb(2), typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\n          if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = Object.create((typeof AsyncIterator === \"function\" ? AsyncIterator : Object).prototype), verb(\"next\"), verb(\"throw\"), verb(\"return\", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }\n  function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nvar ownKeys = function(o) {\n  ownKeys = Object.getOwnPropertyNames || function (o) {\n    var ar = [];\n    for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;\n    return ar;\n  };\n  return ownKeys(o);\n};\n\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== \"default\") __createBinding(result, mod, k[i]);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nexport function __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose, inner;\n    if (async) {\n      if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n      dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n      if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n      dispose = value[Symbol.dispose];\n      if (async) inner = dispose;\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  var r, s = 0;\n  function next() {\n    while (r = env.stack.pop()) {\n      try {\n        if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);\n        if (r.dispose) {\n          var result = r.dispose.call(r.value);\n          if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n        }\n        else s |= 1;\n      }\n      catch (e) {\n        fail(e);\n      }\n    }\n    if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\nexport function __rewriteRelativeImportExtension(path, preserveJsx) {\n  if (typeof path === \"string\" && /^\\.\\.?\\//.test(path)) {\n      return path.replace(/\\.(tsx)$|((?:\\.d)?)((?:\\.[^./]+?)?)\\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {\n          return tsx ? preserveJsx ? \".jsx\" : \".js\" : d && (!ext || !cm) ? m : (d + ext + \".\" + cm.toLowerCase() + \"js\");\n      });\n  }\n  return path;\n}\n\nexport default {\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __esDecorate,\n  __runInitializers,\n  __propKey,\n  __setFunctionName,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n  __rewriteRelativeImportExtension,\n};\n"],"names":["__assign","Object","assign","t","s","i","n","arguments","length","p","prototype","hasOwnProperty","call","apply","this","__rest","e","indexOf","getOwnPropertySymbols","propertyIsEnumerable","__awaiter","thisArg","_arguments","P","generator","Promise","resolve","reject","fulfilled","value","step","next","rejected","result","done","then","__generator","body","f","y","_","label","sent","trys","ops","g","create","Iterator","verb","Symbol","iterator","v","op","TypeError","pop","push","__spreadArray","to","from","pack","ar","l","Array","slice","concat","SuppressedError"],"mappings":"AA+BU,IAACA,EAAW,WAQpB,OAPAA,EAAWC,OAAOC,QAAU,SAAkBC,GAC1C,IAAK,IAAIC,EAAGC,EAAI,EAAGC,EAAIC,UAAUC,OAAQH,EAAIC,EAAGD,IAE5C,IAAK,IAAII,KADTL,EAAIG,UAAUF,GACOJ,OAAOS,UAAUC,eAAeC,KAAKR,EAAGK,KAAIN,EAAEM,GAAKL,EAAEK,IAE9E,OAAON,CACV,EACMH,EAASa,MAAMC,KAAMP,UAC9B,EAEO,SAASQ,EAAOX,EAAGY,GACxB,IAAIb,EAAI,CAAA,EACR,IAAK,IAAIM,KAAKL,EAAOH,OAAOS,UAAUC,eAAeC,KAAKR,EAAGK,IAAMO,EAAEC,QAAQR,GAAK,IAC9EN,EAAEM,GAAKL,EAAEK,IACb,GAAS,MAALL,GAAqD,mBAAjCH,OAAOiB,sBACtB,KAAIb,EAAI,EAAb,IAAgBI,EAAIR,OAAOiB,sBAAsBd,GAAIC,EAAII,EAAED,OAAQH,IAC3DW,EAAEC,QAAQR,EAAEJ,IAAM,GAAKJ,OAAOS,UAAUS,qBAAqBP,KAAKR,EAAGK,EAAEJ,MACvEF,EAAEM,EAAEJ,IAAMD,EAAEK,EAAEJ,IAF4B,CAItD,OAAOF,CACT,CA8DO,SAASiB,EAAUC,EAASC,EAAYC,EAAGC,GAEhD,OAAO,IAAKD,IAAMA,EAAIE,UAAU,SAAUC,EAASC,GAC/C,SAASC,EAAUC,GAAS,IAAMC,EAAKN,EAAUO,KAAKF,GAAQ,CAAG,MAAOb,GAAKW,EAAOX,GAAO,CAC3F,SAASgB,EAASH,GAAS,IAAMC,EAAKN,EAAiB,MAAEK,GAAU,CAAC,MAAOb,GAAKW,EAAOX,GAAO,CAC9F,SAASc,EAAKG,GAJlB,IAAeJ,EAIaI,EAAOC,KAAOR,EAAQO,EAAOJ,QAJ1CA,EAIyDI,EAAOJ,MAJhDA,aAAiBN,EAAIM,EAAQ,IAAIN,EAAE,SAAUG,GAAWA,EAAQG,EAAO,IAIhBM,KAAKP,EAAWI,EAAY,CAC9GF,GAAMN,EAAYA,EAAUX,MAAMQ,EAASC,GAAc,KAAKS,OACpE,EACA,CAEO,SAASK,EAAYf,EAASgB,GACnC,IAAsGC,EAAGC,EAAGpC,EAAxGqC,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPvC,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAG,EAAIwC,KAAM,GAAIC,IAAK,IAAeC,EAAI5C,OAAO6C,QAA4B,mBAAbC,SAA0BA,SAAW9C,QAAQS,WACtL,OAAOmC,EAAEd,KAAOiB,EAAK,GAAIH,EAAS,MAAIG,EAAK,GAAIH,EAAU,OAAIG,EAAK,GAAsB,mBAAXC,SAA0BJ,EAAEI,OAAOC,UAAY,WAAa,OAAOpC,IAAO,GAAG+B,EAC1J,SAASG,EAAK1C,GAAK,OAAO,SAAU6C,GAAK,OACzC,SAAcC,GACV,GAAId,EAAG,MAAM,IAAIe,UAAU,mCAC3B,KAAOR,IAAMA,EAAI,EAAGO,EAAG,KAAOZ,EAAI,IAAKA,OACnC,GAAIF,EAAI,EAAGC,IAAMpC,EAAY,EAARiD,EAAG,GAASb,EAAU,OAAIa,EAAG,GAAKb,EAAS,SAAOpC,EAAIoC,EAAU,SAAMpC,EAAES,KAAK2B,GAAI,GAAKA,EAAER,SAAW5B,EAAIA,EAAES,KAAK2B,EAAGa,EAAG,KAAKlB,KAAM,OAAO/B,EAE3J,OADIoC,EAAI,EAAGpC,IAAGiD,EAAK,CAAS,EAARA,EAAG,GAAQjD,EAAE0B,QACzBuB,EAAG,IACP,KAAK,EAAG,KAAK,EAAGjD,EAAIiD,EAAI,MACxB,KAAK,EAAc,OAAXZ,EAAEC,QAAgB,CAAEZ,MAAOuB,EAAG,GAAIlB,MAAM,GAChD,KAAK,EAAGM,EAAEC,QAASF,EAAIa,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKZ,EAAEI,IAAIU,MAAOd,EAAEG,KAAKW,MAAO,SACxC,QACI,KAAMnD,EAAIqC,EAAEG,MAAMxC,EAAIA,EAAEK,OAAS,GAAKL,EAAEA,EAAEK,OAAS,KAAkB,IAAV4C,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAEZ,EAAI,EAAG,QAAW,CAC5G,GAAc,IAAVY,EAAG,MAAcjD,GAAMiD,EAAG,GAAKjD,EAAE,IAAMiD,EAAG,GAAKjD,EAAE,IAAM,CAAEqC,EAAEC,MAAQW,EAAG,GAAI,KAAQ,CACtF,GAAc,IAAVA,EAAG,IAAYZ,EAAEC,MAAQtC,EAAE,GAAI,CAAEqC,EAAEC,MAAQtC,EAAE,GAAIA,EAAIiD,EAAI,KAAQ,CACrE,GAAIjD,GAAKqC,EAAEC,MAAQtC,EAAE,GAAI,CAAEqC,EAAEC,MAAQtC,EAAE,GAAIqC,EAAEI,IAAIW,KAAKH,GAAK,KAAQ,CAC/DjD,EAAE,IAAIqC,EAAEI,IAAIU,MAChBd,EAAEG,KAAKW,MAAO,SAEtBF,EAAKf,EAAKzB,KAAKS,EAASmB,EAC3B,CAAC,MAAOxB,GAAKoC,EAAK,CAAC,EAAGpC,GAAIuB,EAAI,CAAE,CAAW,QAAED,EAAInC,EAAI,CAAI,CAC1D,GAAY,EAARiD,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEvB,MAAOuB,EAAG,GAAKA,EAAG,QAAU,EAAGlB,MAAM,EAC7E,CAtB+CJ,CAAK,CAACxB,EAAG6C,GAAM,CAAG,CAuBpE,CA+DO,SAASK,EAAcC,EAAIC,EAAMC,GACtC,GAAIA,GAA6B,IAArBpD,UAAUC,OAAc,IAAK,IAA4BoD,EAAxBvD,EAAI,EAAGwD,EAAIH,EAAKlD,OAAYH,EAAIwD,EAAGxD,KACxEuD,GAAQvD,KAAKqD,IACRE,IAAIA,EAAKE,MAAMpD,UAAUqD,MAAMnD,KAAK8C,EAAM,EAAGrD,IAClDuD,EAAGvD,GAAKqD,EAAKrD,IAGrB,OAAOoD,EAAGO,OAAOJ,GAAME,MAAMpD,UAAUqD,MAAMnD,KAAK8C,GACpD,CA0GkD,mBAApBO,iBAAiCA"}

package/dist/node_modules/unified/lib/index.js

@@ -1,2 +0,0 @@
-import{bail as n}from"../../bail/index.js";import e from"../../../_virtual/index3.js";import r from"../../../_virtual/index4.js";import t from"../../is-plain-obj/index.js";import{trough as o}from"../../trough/lib/index.js";import{VFile as i}from"../../vfile/lib/index.js";const s=function i(){const s=o(),w=[];let m,d={},h=-1;return b.data=function(n,e){if("string"==typeof n)return 2===arguments.length?(p("data",m),d[n]=e,b):f.call(d,n)&&d[n]||null;if(n)return p("data",m),d=n,b;return d},b.Parser=void 0,b.Compiler=void 0,b.freeze=function(){if(m)return b;for(;++h<w.length;){const[n,...e]=w[h];if(!1===e[0])continue;!0===e[0]&&(e[0]=void 0);const r=n.call(b,...e);"function"==typeof r&&s.use(r)}return m=!0,h=Number.POSITIVE_INFINITY,b},b.attachers=w,b.use=function(n,...e){let o;if(p("use",m),null==n);else if("function"==typeof n)u(n,...e);else{if("object"!=typeof n)throw new TypeError("Expected usable value, not `"+n+"`");Array.isArray(n)?f(n):s(n)}o&&(d.settings=Object.assign(d.settings||{},o));return b;function i(n){if("function"==typeof n)u(n);else{if("object"!=typeof n)throw new TypeError("Expected usable value, not `"+n+"`");if(Array.isArray(n)){const[e,...r]=n;u(e,...r)}else s(n)}}function s(n){f(n.plugins),n.settings&&(o=Object.assign(o||{},n.settings))}function f(n){let e=-1;if(null==n);else{if(!Array.isArray(n))throw new TypeError("Expected a list of plugins, not `"+n+"`");for(;++e<n.length;){i(n[e])}}}function u(n,e){let o,i=-1;for(;++i<w.length;)if(w[i][0]===n){o=w[i];break}o?(t(o[1])&&t(e)&&(e=r(!0,o[1],e)),o[1]=e):w.push([...arguments])}},b.parse=function(n){b.freeze();const e=g(n),r=b.Parser;if(c("parse",r),u(r,"parse"))return new r(String(e),e).parse();return r(String(e),e)},b.stringify=function(n,e){b.freeze();const r=g(e),t=b.Compiler;if(l("stringify",t),a(n),u(t,"compile"))return new t(n,r).compile();return t(n,r)},b.run=function(n,e,r){a(n),b.freeze(),r||"function"!=typeof e||(r=e,e=void 0);if(!r)return new Promise(t);function t(t,o){function i(e,i,s){i=i||n,e?o(e):t?t(i):r(null,i,s)}s.run(n,g(e),i)}t(null,r)},b.runSync=function(e,r){let t,o;return b.run(e,r,i),y("runSync","run",o),t;function i(e,r){n(e),t=r,o=!0}},b.process=function(n,r){if(b.freeze(),c("process",b.Parser),l("process",b.Compiler),!r)return new Promise(t);function t(t,o){const i=g(n);function s(n,e){n||!e?o(n):t?t(e):r(null,e)}b.run(b.parse(i),i,(n,r,t)=>{if(!n&&r&&t){const i=b.stringify(r,t);null==i||("string"==typeof(o=i)||e(o)?t.value=i:t.result=i),s(n,t)}else s(n);var o})}t(null,r)},b.processSync=function(e){let r;b.freeze(),c("processSync",b.Parser),l("processSync",b.Compiler);const t=g(e);return b.process(t,o),y("processSync","process",r),t;function o(e){r=!0,n(e)}},b;function b(){const n=i();let e=-1;for(;++e<w.length;)n.use(...w[e]);return n.data(r(!0,{},d)),n}}().freeze(),f={}.hasOwnProperty;function u(n,e){return"function"==typeof n&&n.prototype&&(function(n){let e;for(e in n)if(f.call(n,e))return!0;return!1}(n.prototype)||e in n.prototype)}function c(n,e){if("function"!=typeof e)throw new TypeError("Cannot `"+n+"` without `Parser`")}function l(n,e){if("function"!=typeof e)throw new TypeError("Cannot `"+n+"` without `Compiler`")}function p(n,e){if(e)throw new Error("Cannot call `"+n+"` on a frozen processor.\nCreate a new processor first, by calling it: use `processor()` instead of `processor`.")}function a(n){if(!t(n)||"string"!=typeof n.type)throw new TypeError("Expected node, got `"+n+"`")}function y(n,e,r){if(!r)throw new Error("`"+n+"` finished async. Use `"+e+"` instead")}function g(n){return function(n){return Boolean(n&&"object"==typeof n&&"message"in n&&"messages"in n)}(n)?n:new i(n)}export{s as unified};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/unified/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../node_modules/unified/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('vfile').VFileCompatible} VFileCompatible\n * @typedef {import('vfile').VFileValue} VFileValue\n * @typedef {import('..').Processor} Processor\n * @typedef {import('..').Plugin} Plugin\n * @typedef {import('..').Preset} Preset\n * @typedef {import('..').Pluggable} Pluggable\n * @typedef {import('..').PluggableList} PluggableList\n * @typedef {import('..').Transformer} Transformer\n * @typedef {import('..').Parser} Parser\n * @typedef {import('..').Compiler} Compiler\n * @typedef {import('..').RunCallback} RunCallback\n * @typedef {import('..').ProcessCallback} ProcessCallback\n *\n * @typedef Context\n * @property {Node} tree\n * @property {VFile} file\n */\n\nimport {bail} from 'bail'\nimport isBuffer from 'is-buffer'\nimport extend from 'extend'\nimport isPlainObj from 'is-plain-obj'\nimport {trough} from 'trough'\nimport {VFile} from 'vfile'\n\n// Expose a frozen processor.\nexport const unified = base().freeze()\n\nconst own = {}.hasOwnProperty\n\n// Function to create the first processor.\n/**\n * @returns {Processor}\n */\nfunction base() {\n  const transformers = trough()\n  /** @type {Processor['attachers']} */\n  const attachers = []\n  /** @type {Record<string, unknown>} */\n  let namespace = {}\n  /** @type {boolean|undefined} */\n  let frozen\n  let freezeIndex = -1\n\n  // Data management.\n  // @ts-expect-error: overloads are handled.\n  processor.data = data\n  processor.Parser = undefined\n  processor.Compiler = undefined\n\n  // Lock.\n  processor.freeze = freeze\n\n  // Plugins.\n  processor.attachers = attachers\n  // @ts-expect-error: overloads are handled.\n  processor.use = use\n\n  // API.\n  processor.parse = parse\n  processor.stringify = stringify\n  // @ts-expect-error: overloads are handled.\n  processor.run = run\n  processor.runSync = runSync\n  // @ts-expect-error: overloads are handled.\n  processor.process = process\n  processor.processSync = processSync\n\n  // Expose.\n  return processor\n\n  // Create a new processor based on the processor in the current scope.\n  /** @type {Processor} */\n  function processor() {\n    const destination = base()\n    let index = -1\n\n    while (++index < attachers.length) {\n      destination.use(...attachers[index])\n    }\n\n    destination.data(extend(true, {}, namespace))\n\n    return destination\n  }\n\n  /**\n   * @param {string|Record<string, unknown>} [key]\n   * @param {unknown} [value]\n   * @returns {unknown}\n   */\n  function data(key, value) {\n    if (typeof key === 'string') {\n      // Set `key`.\n      if (arguments.length === 2) {\n        assertUnfrozen('data', frozen)\n        namespace[key] = value\n        return processor\n      }\n\n      // Get `key`.\n      return (own.call(namespace, key) && namespace[key]) || null\n    }\n\n    // Set space.\n    if (key) {\n      assertUnfrozen('data', frozen)\n      namespace = key\n      return processor\n    }\n\n    // Get space.\n    return namespace\n  }\n\n  /** @type {Processor['freeze']} */\n  function freeze() {\n    if (frozen) {\n      return processor\n    }\n\n    while (++freezeIndex < attachers.length) {\n      const [attacher, ...options] = attachers[freezeIndex]\n\n      if (options[0] === false) {\n        continue\n      }\n\n      if (options[0] === true) {\n        options[0] = undefined\n      }\n\n      /** @type {Transformer|void} */\n      const transformer = attacher.call(processor, ...options)\n\n      if (typeof transformer === 'function') {\n        transformers.use(transformer)\n      }\n    }\n\n    frozen = true\n    freezeIndex = Number.POSITIVE_INFINITY\n\n    return processor\n  }\n\n  /**\n   * @param {Pluggable|null|undefined} [value]\n   * @param {...unknown} options\n   * @returns {Processor}\n   */\n  function use(value, ...options) {\n    /** @type {Record<string, unknown>|undefined} */\n    let settings\n\n    assertUnfrozen('use', frozen)\n\n    if (value === null || value === undefined) {\n      // Empty.\n    } else if (typeof value === 'function') {\n      addPlugin(value, ...options)\n    } else if (typeof value === 'object') {\n      if (Array.isArray(value)) {\n        addList(value)\n      } else {\n        addPreset(value)\n      }\n    } else {\n      throw new TypeError('Expected usable value, not `' + value + '`')\n    }\n\n    if (settings) {\n      namespace.settings = Object.assign(namespace.settings || {}, settings)\n    }\n\n    return processor\n\n    /**\n     * @param {import('..').Pluggable<unknown[]>} value\n     * @returns {void}\n     */\n    function add(value) {\n      if (typeof value === 'function') {\n        addPlugin(value)\n      } else if (typeof value === 'object') {\n        if (Array.isArray(value)) {\n          const [plugin, ...options] = value\n          addPlugin(plugin, ...options)\n        } else {\n          addPreset(value)\n        }\n      } else {\n        throw new TypeError('Expected usable value, not `' + value + '`')\n      }\n    }\n\n    /**\n     * @param {Preset} result\n     * @returns {void}\n     */\n    function addPreset(result) {\n      addList(result.plugins)\n\n      if (result.settings) {\n        settings = Object.assign(settings || {}, result.settings)\n      }\n    }\n\n    /**\n     * @param {PluggableList|null|undefined} [plugins]\n     * @returns {void}\n     */\n    function addList(plugins) {\n      let index = -1\n\n      if (plugins === null || plugins === undefined) {\n        // Empty.\n      } else if (Array.isArray(plugins)) {\n        while (++index < plugins.length) {\n          const thing = plugins[index]\n          add(thing)\n        }\n      } else {\n        throw new TypeError('Expected a list of plugins, not `' + plugins + '`')\n      }\n    }\n\n    /**\n     * @param {Plugin} plugin\n     * @param {...unknown} [value]\n     * @returns {void}\n     */\n    function addPlugin(plugin, value) {\n      let index = -1\n      /** @type {Processor['attachers'][number]|undefined} */\n      let entry\n\n      while (++index < attachers.length) {\n        if (attachers[index][0] === plugin) {\n          entry = attachers[index]\n          break\n        }\n      }\n\n      if (entry) {\n        if (isPlainObj(entry[1]) && isPlainObj(value)) {\n          value = extend(true, entry[1], value)\n        }\n\n        entry[1] = value\n      } else {\n        // @ts-expect-error: fine.\n        attachers.push([...arguments])\n      }\n    }\n  }\n\n  /** @type {Processor['parse']} */\n  function parse(doc) {\n    processor.freeze()\n    const file = vfile(doc)\n    const Parser = processor.Parser\n    assertParser('parse', Parser)\n\n    if (newable(Parser, 'parse')) {\n      // @ts-expect-error: `newable` checks this.\n      return new Parser(String(file), file).parse()\n    }\n\n    // @ts-expect-error: `newable` checks this.\n    return Parser(String(file), file) // eslint-disable-line new-cap\n  }\n\n  /** @type {Processor['stringify']} */\n  function stringify(node, doc) {\n    processor.freeze()\n    const file = vfile(doc)\n    const Compiler = processor.Compiler\n    assertCompiler('stringify', Compiler)\n    assertNode(node)\n\n    if (newable(Compiler, 'compile')) {\n      // @ts-expect-error: `newable` checks this.\n      return new Compiler(node, file).compile()\n    }\n\n    // @ts-expect-error: `newable` checks this.\n    return Compiler(node, file) // eslint-disable-line new-cap\n  }\n\n  /**\n   * @param {Node} node\n   * @param {VFileCompatible|RunCallback} [doc]\n   * @param {RunCallback} [callback]\n   * @returns {Promise<Node>|void}\n   */\n  function run(node, doc, callback) {\n    assertNode(node)\n    processor.freeze()\n\n    if (!callback && typeof doc === 'function') {\n      callback = doc\n      doc = undefined\n    }\n\n    if (!callback) {\n      return new Promise(executor)\n    }\n\n    executor(null, callback)\n\n    /**\n     * @param {null|((node: Node) => void)} resolve\n     * @param {(error: Error) => void} reject\n     * @returns {void}\n     */\n    function executor(resolve, reject) {\n      // @ts-expect-error: `doc` can’t be a callback anymore, we checked.\n      transformers.run(node, vfile(doc), done)\n\n      /**\n       * @param {Error|null} error\n       * @param {Node} tree\n       * @param {VFile} file\n       * @returns {void}\n       */\n      function done(error, tree, file) {\n        tree = tree || node\n        if (error) {\n          reject(error)\n        } else if (resolve) {\n          resolve(tree)\n        } else {\n          // @ts-expect-error: `callback` is defined if `resolve` is not.\n          callback(null, tree, file)\n        }\n      }\n    }\n  }\n\n  /** @type {Processor['runSync']} */\n  function runSync(node, file) {\n    /** @type {Node|undefined} */\n    let result\n    /** @type {boolean|undefined} */\n    let complete\n\n    processor.run(node, file, done)\n\n    assertDone('runSync', 'run', complete)\n\n    // @ts-expect-error: we either bailed on an error or have a tree.\n    return result\n\n    /**\n     * @param {Error|null} [error]\n     * @param {Node} [tree]\n     * @returns {void}\n     */\n    function done(error, tree) {\n      bail(error)\n      result = tree\n      complete = true\n    }\n  }\n\n  /**\n   * @param {VFileCompatible} doc\n   * @param {ProcessCallback} [callback]\n   * @returns {Promise<VFile>|undefined}\n   */\n  function process(doc, callback) {\n    processor.freeze()\n    assertParser('process', processor.Parser)\n    assertCompiler('process', processor.Compiler)\n\n    if (!callback) {\n      return new Promise(executor)\n    }\n\n    executor(null, callback)\n\n    /**\n     * @param {null|((file: VFile) => void)} resolve\n     * @param {(error?: Error|null|undefined) => void} reject\n     * @returns {void}\n     */\n    function executor(resolve, reject) {\n      const file = vfile(doc)\n\n      processor.run(processor.parse(file), file, (error, tree, file) => {\n        if (error || !tree || !file) {\n          done(error)\n        } else {\n          /** @type {unknown} */\n          const result = processor.stringify(tree, file)\n\n          if (result === undefined || result === null) {\n            // Empty.\n          } else if (looksLikeAVFileValue(result)) {\n            file.value = result\n          } else {\n            file.result = result\n          }\n\n          done(error, file)\n        }\n      })\n\n      /**\n       * @param {Error|null|undefined} [error]\n       * @param {VFile|undefined} [file]\n       * @returns {void}\n       */\n      function done(error, file) {\n        if (error || !file) {\n          reject(error)\n        } else if (resolve) {\n          resolve(file)\n        } else {\n          // @ts-expect-error: `callback` is defined if `resolve` is not.\n          callback(null, file)\n        }\n      }\n    }\n  }\n\n  /** @type {Processor['processSync']} */\n  function processSync(doc) {\n    /** @type {boolean|undefined} */\n    let complete\n\n    processor.freeze()\n    assertParser('processSync', processor.Parser)\n    assertCompiler('processSync', processor.Compiler)\n\n    const file = vfile(doc)\n\n    processor.process(file, done)\n\n    assertDone('processSync', 'process', complete)\n\n    return file\n\n    /**\n     * @param {Error|null|undefined} [error]\n     * @returns {void}\n     */\n    function done(error) {\n      complete = true\n      bail(error)\n    }\n  }\n}\n\n/**\n * Check if `value` is a constructor.\n *\n * @param {unknown} value\n * @param {string} name\n * @returns {boolean}\n */\nfunction newable(value, name) {\n  return (\n    typeof value === 'function' &&\n    // Prototypes do exist.\n    // type-coverage:ignore-next-line\n    value.prototype &&\n    // A function with keys in its prototype is probably a constructor.\n    // Classes’ prototype methods are not enumerable, so we check if some value\n    // exists in the prototype.\n    // type-coverage:ignore-next-line\n    (keys(value.prototype) || name in value.prototype)\n  )\n}\n\n/**\n * Check if `value` is an object with keys.\n *\n * @param {Record<string, unknown>} value\n * @returns {boolean}\n */\nfunction keys(value) {\n  /** @type {string} */\n  let key\n\n  for (key in value) {\n    if (own.call(value, key)) {\n      return true\n    }\n  }\n\n  return false\n}\n\n/**\n * Assert a parser is available.\n *\n * @param {string} name\n * @param {unknown} value\n * @returns {asserts value is Parser}\n */\nfunction assertParser(name, value) {\n  if (typeof value !== 'function') {\n    throw new TypeError('Cannot `' + name + '` without `Parser`')\n  }\n}\n\n/**\n * Assert a compiler is available.\n *\n * @param {string} name\n * @param {unknown} value\n * @returns {asserts value is Compiler}\n */\nfunction assertCompiler(name, value) {\n  if (typeof value !== 'function') {\n    throw new TypeError('Cannot `' + name + '` without `Compiler`')\n  }\n}\n\n/**\n * Assert the processor is not frozen.\n *\n * @param {string} name\n * @param {unknown} frozen\n * @returns {asserts frozen is false}\n */\nfunction assertUnfrozen(name, frozen) {\n  if (frozen) {\n    throw new Error(\n      'Cannot call `' +\n        name +\n        '` on a frozen processor.\\nCreate a new processor first, by calling it: use `processor()` instead of `processor`.'\n    )\n  }\n}\n\n/**\n * Assert `node` is a unist node.\n *\n * @param {unknown} node\n * @returns {asserts node is Node}\n */\nfunction assertNode(node) {\n  // `isPlainObj` unfortunately uses `any` instead of `unknown`.\n  // type-coverage:ignore-next-line\n  if (!isPlainObj(node) || typeof node.type !== 'string') {\n    throw new TypeError('Expected node, got `' + node + '`')\n    // Fine.\n  }\n}\n\n/**\n * Assert that `complete` is `true`.\n *\n * @param {string} name\n * @param {string} asyncName\n * @param {unknown} complete\n * @returns {asserts complete is true}\n */\nfunction assertDone(name, asyncName, complete) {\n  if (!complete) {\n    throw new Error(\n      '`' + name + '` finished async. Use `' + asyncName + '` instead'\n    )\n  }\n}\n\n/**\n * @param {VFileCompatible} [value]\n * @returns {VFile}\n */\nfunction vfile(value) {\n  return looksLikeAVFile(value) ? value : new VFile(value)\n}\n\n/**\n * @param {VFileCompatible} [value]\n * @returns {value is VFile}\n */\nfunction looksLikeAVFile(value) {\n  return Boolean(\n    value &&\n      typeof value === 'object' &&\n      'message' in value &&\n      'messages' in value\n  )\n}\n\n/**\n * @param {unknown} [value]\n * @returns {value is VFileValue}\n */\nfunction looksLikeAVFileValue(value) {\n  return typeof value === 'string' || isBuffer(value)\n}\n"],"names":["unified","base","transformers","trough","attachers","frozen","namespace","freezeIndex","processor","data","key","value","arguments","length","assertUnfrozen","own","call","Parser","undefined","Compiler","freeze","attacher","options","transformer","use","Number","POSITIVE_INFINITY","settings","addPlugin","TypeError","Array","isArray","addList","addPreset","Object","assign","add","plugin","result","plugins","index","entry","isPlainObj","extend","push","parse","doc","file","vfile","assertParser","newable","String","stringify","node","assertCompiler","assertNode","compile","run","callback","Promise","executor","resolve","reject","done","error","tree","runSync","complete","assertDone","bail","process","isBuffer","processSync","destination","hasOwnProperty","name","prototype","keys","Error","type","asyncName","Boolean","looksLikeAVFile","VFile"],"mappings":"gRA4BY,MAACA,EAQb,SAASC,IACP,MAAMC,EAAeC,IAEfC,EAAY,GAElB,IAEIC,EAFAC,EAAY,CAAE,EAGdC,GAAe,EA2BnB,OAvBAC,EAAUC,KA6CV,SAAcC,EAAKC,GACjB,GAAmB,iBAARD,EAET,OAAyB,IAArBE,UAAUC,QACZC,EAAe,OAAQT,GACvBC,EAAUI,GAAOC,EACVH,GAIDO,EAAIC,KAAKV,EAAWI,IAAQJ,EAAUI,IAAS,KAIzD,GAAIA,EAGF,OAFAI,EAAe,OAAQT,GACvBC,EAAYI,EACLF,EAIT,OAAOF,CACR,EAlEDE,EAAUS,YAASC,EACnBV,EAAUW,cAAWD,EAGrBV,EAAUY,OAiEV,WACE,GAAIf,EACF,OAAOG,EAGT,OAASD,EAAcH,EAAUS,QAAQ,CACvC,MAAOQ,KAAaC,GAAWlB,EAAUG,GAEzC,IAAmB,IAAfe,EAAQ,GACV,UAGiB,IAAfA,EAAQ,KACVA,EAAQ,QAAKJ,GAIf,MAAMK,EAAcF,EAASL,KAAKR,KAAcc,GAErB,mBAAhBC,GACTrB,EAAasB,IAAID,EAEpB,CAKD,OAHAlB,GAAS,EACTE,EAAckB,OAAOC,kBAEdlB,CACR,EA1FDA,EAAUJ,UAAYA,EAEtBI,EAAUgB,IA+FV,SAAab,KAAUW,GAErB,IAAIK,EAIJ,GAFAb,EAAe,MAAOT,GAElBM,cAEG,GAAqB,mBAAVA,EAChBiB,EAAUjB,KAAUW,OACf,IAAqB,iBAAVX,EAOhB,MAAM,IAAIkB,UAAU,+BAAiClB,EAAQ,KANzDmB,MAAMC,QAAQpB,GAChBqB,EAAQrB,GAERsB,EAAUtB,EAIb,CAEGgB,IACFrB,EAAUqB,SAAWO,OAAOC,OAAO7B,EAAUqB,UAAY,CAAE,EAAEA,IAG/D,OAAOnB,EAMP,SAAS4B,EAAIzB,GACX,GAAqB,mBAAVA,EACTiB,EAAUjB,OACL,IAAqB,iBAAVA,EAQhB,MAAM,IAAIkB,UAAU,+BAAiClB,EAAQ,KAP7D,GAAImB,MAAMC,QAAQpB,GAAQ,CACxB,MAAO0B,KAAWf,GAAWX,EAC7BiB,EAAUS,KAAWf,EAC/B,MACUW,EAAUtB,EAIb,CACF,CAMD,SAASsB,EAAUK,GACjBN,EAAQM,EAAOC,SAEXD,EAAOX,WACTA,EAAWO,OAAOC,OAAOR,GAAY,CAAE,EAAEW,EAAOX,UAEnD,CAMD,SAASK,EAAQO,GACf,IAAIC,GAAS,EAEb,GAAID,aAEG,KAAIT,MAAMC,QAAQQ,GAMvB,MAAM,IAAIV,UAAU,oCAAsCU,EAAU,KALpE,OAASC,EAAQD,EAAQ1B,QAAQ,CAE/BuB,EADcG,EAAQC,GAEvB,CAGF,CACF,CAOD,SAASZ,EAAUS,EAAQ1B,GACzB,IAEI8B,EAFAD,GAAS,EAIb,OAASA,EAAQpC,EAAUS,QACzB,GAAIT,EAAUoC,GAAO,KAAOH,EAAQ,CAClCI,EAAQrC,EAAUoC,GAClB,KACD,CAGCC,GACEC,EAAWD,EAAM,KAAOC,EAAW/B,KACrCA,EAAQgC,GAAO,EAAMF,EAAM,GAAI9B,IAGjC8B,EAAM,GAAK9B,GAGXP,EAAUwC,KAAK,IAAIhC,WAEtB,CACF,EApMDJ,EAAUqC,MAuMV,SAAeC,GACbtC,EAAUY,SACV,MAAM2B,EAAOC,EAAMF,GACb7B,EAAST,EAAUS,OAGzB,GAFAgC,EAAa,QAAShC,GAElBiC,EAAQjC,EAAQ,SAElB,OAAO,IAAIA,EAAOkC,OAAOJ,GAAOA,GAAMF,QAIxC,OAAO5B,EAAOkC,OAAOJ,GAAOA,EAC7B,EAnNDvC,EAAU4C,UAsNV,SAAmBC,EAAMP,GACvBtC,EAAUY,SACV,MAAM2B,EAAOC,EAAMF,GACb3B,EAAWX,EAAUW,SAI3B,GAHAmC,EAAe,YAAanC,GAC5BoC,EAAWF,GAEPH,EAAQ/B,EAAU,WAEpB,OAAO,IAAIA,EAASkC,EAAMN,GAAMS,UAIlC,OAAOrC,EAASkC,EAAMN,EACvB,EAlODvC,EAAUiD,IA0OV,SAAaJ,EAAMP,EAAKY,GACtBH,EAAWF,GACX7C,EAAUY,SAELsC,GAA2B,mBAARZ,IACtBY,EAAWZ,EACXA,OAAM5B,GAGR,IAAKwC,EACH,OAAO,IAAIC,QAAQC,GAUrB,SAASA,EAASC,EAASC,GAUzB,SAASC,EAAKC,EAAOC,EAAMlB,GACzBkB,EAAOA,GAAQZ,EACXW,EACFF,EAAOE,GACEH,EACTA,EAAQI,GAGRP,EAAS,KAAMO,EAAMlB,EAExB,CAlBD7C,EAAauD,IAAIJ,EAAML,EAAMF,GAAMiB,EAmBpC,CA5BDH,EAAS,KAAMF,EA6BhB,EAnRDlD,EAAU0D,QAsRV,SAAiBb,EAAMN,GAErB,IAAIT,EAEA6B,EAOJ,OALA3D,EAAUiD,IAAIJ,EAAMN,EAAMgB,GAE1BK,EAAW,UAAW,MAAOD,GAGtB7B,EAOP,SAASyB,EAAKC,EAAOC,GACnBI,EAAKL,GACL1B,EAAS2B,EACTE,GAAW,CACZ,CACF,EA3SD3D,EAAU8D,QAkTV,SAAiBxB,EAAKY,GAKpB,GAJAlD,EAAUY,SACV6B,EAAa,UAAWzC,EAAUS,QAClCqC,EAAe,UAAW9C,EAAUW,WAE/BuC,EACH,OAAO,IAAIC,QAAQC,GAUrB,SAASA,EAASC,EAASC,GACzB,MAAMf,EAAOC,EAAMF,GA0BnB,SAASiB,EAAKC,EAAOjB,GACfiB,IAAUjB,EACZe,EAAOE,GACEH,EACTA,EAAQd,GAGRW,EAAS,KAAMX,EAElB,CAjCDvC,EAAUiD,IAAIjD,EAAUqC,MAAME,GAAOA,EAAM,CAACiB,EAAOC,EAAMlB,KACvD,IAAIiB,GAAUC,GAASlB,EAEhB,CAEL,MAAMT,EAAS9B,EAAU4C,UAAUa,EAAMlB,GAErCT,UAsMY,iBADI3B,EAnMY2B,IAoMJiC,EAAS5D,GAnMnCoC,EAAKpC,MAAQ2B,EAEbS,EAAKT,OAASA,GAGhByB,EAAKC,EAAOjB,EACb,MAdCgB,EAAKC,GA0Mf,IAA8BrD,GA1KzB,CA5CDiD,EAAS,KAAMF,EA6ChB,EAvWDlD,EAAUgE,YA0WV,SAAqB1B,GAEnB,IAAIqB,EAEJ3D,EAAUY,SACV6B,EAAa,cAAezC,EAAUS,QACtCqC,EAAe,cAAe9C,EAAUW,UAExC,MAAM4B,EAAOC,EAAMF,GAMnB,OAJAtC,EAAU8D,QAAQvB,EAAMgB,GAExBK,EAAW,cAAe,UAAWD,GAE9BpB,EAMP,SAASgB,EAAKC,GACZG,GAAW,EACXE,EAAKL,EACN,CACF,EA/XMxD,EAIP,SAASA,IACP,MAAMiE,EAAcxE,IACpB,IAAIuC,GAAS,EAEb,OAASA,EAAQpC,EAAUS,QACzB4D,EAAYjD,OAAOpB,EAAUoC,IAK/B,OAFAiC,EAAYhE,KAAKkC,GAAO,EAAM,CAAE,EAAErC,IAE3BmE,CACR,CAiXH,CA3auBxE,GAAOmB,SAExBL,EAAM,CAAE,EAAC2D,eAkbf,SAASxB,EAAQvC,EAAOgE,GACtB,MACmB,mBAAVhE,GAGPA,EAAMiE,YAeV,SAAcjE,GAEZ,IAAID,EAEJ,IAAKA,KAAOC,EACV,GAAII,EAAIC,KAAKL,EAAOD,GAClB,OAAO,EAIX,OAAO,CACT,CArBKmE,CAAKlE,EAAMiE,YAAcD,KAAQhE,EAAMiE,UAE5C,CA4BA,SAAS3B,EAAa0B,EAAMhE,GAC1B,GAAqB,mBAAVA,EACT,MAAM,IAAIkB,UAAU,WAAa8C,EAAO,qBAE5C,CASA,SAASrB,EAAeqB,EAAMhE,GAC5B,GAAqB,mBAAVA,EACT,MAAM,IAAIkB,UAAU,WAAa8C,EAAO,uBAE5C,CASA,SAAS7D,EAAe6D,EAAMtE,GAC5B,GAAIA,EACF,MAAM,IAAIyE,MACR,gBACEH,EACA,mHAGR,CAQA,SAASpB,EAAWF,GAGlB,IAAKX,EAAWW,IAA8B,iBAAdA,EAAK0B,KACnC,MAAM,IAAIlD,UAAU,uBAAyBwB,EAAO,IAGxD,CAUA,SAASe,EAAWO,EAAMK,EAAWb,GACnC,IAAKA,EACH,MAAM,IAAIW,MACR,IAAMH,EAAO,0BAA4BK,EAAY,YAG3D,CAMA,SAAShC,EAAMrC,GACb,OAOF,SAAyBA,GACvB,OAAOsE,QACLtE,GACmB,iBAAVA,GACP,YAAaA,GACb,aAAcA,EAEpB,CAdSuE,CAAgBvE,GAASA,EAAQ,IAAIwE,EAAMxE,EACpD"}

package/dist/node_modules/unist-util-generated/lib/index.js

@@ -1,2 +0,0 @@
-function o(o){return!(o&&o.position&&o.position.start&&o.position.start.line&&o.position.start.column&&o.position.end&&o.position.end.line&&o.position.end.column)}export{o as generated};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/unist-util-generated/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../node_modules/unist-util-generated/lib/index.js"],"sourcesContent":["/**\n * @typedef PointLike\n * @property {number | null | undefined} [line]\n * @property {number | null | undefined} [column]\n * @property {number | null | undefined} [offset]\n *\n * @typedef PositionLike\n * @property {PointLike | null | undefined} [start]\n * @property {PointLike | null | undefined} [end]\n *\n * @typedef NodeLike\n * @property {PositionLike | null | undefined} [position]\n */\n\n/**\n * Check if `node` is generated.\n *\n * @param {NodeLike | null | undefined} [node]\n *   Node to check.\n * @returns {boolean}\n *   Whether `node` is generated (does not have positional info).\n */\nexport function generated(node) {\n  return (\n    !node ||\n    !node.position ||\n    !node.position.start ||\n    !node.position.start.line ||\n    !node.position.start.column ||\n    !node.position.end ||\n    !node.position.end.line ||\n    !node.position.end.column\n  )\n}\n"],"names":["generated","node","position","start","line","column","end"],"mappings":"AAsBO,SAASA,EAAUC,GACxB,QACGA,GACAA,EAAKC,UACLD,EAAKC,SAASC,OACdF,EAAKC,SAASC,MAAMC,MACpBH,EAAKC,SAASC,MAAME,QACpBJ,EAAKC,SAASI,KACdL,EAAKC,SAASI,IAAIF,MAClBH,EAAKC,SAASI,IAAID,OAEvB"}

package/dist/node_modules/unist-util-is/lib/index.js

@@ -1,2 +0,0 @@
-const n=function(e){if(null==e)return r;if("function"==typeof e)return t(e);if("object"==typeof e)return Array.isArray(e)?function(r){const e=[];let o=-1;for(;++o<r.length;)e[o]=n(r[o]);return t(u);function u(...n){let t=-1;for(;++t<e.length;)if(e[t].apply(this,n))return!0;return!1}}(e):function(n){const r=n;return t(e);function e(t){const e=t;let o;for(o in n)if(e[o]!==r[o])return!1;return!0}}(e);if("string"==typeof e)return function(n){return t(r);function r(t){return t&&t.type===n}}(e);throw new Error("Expected function, string, or object as test")};function t(n){return function(t,r,e){return Boolean(function(n){return null!==n&&"object"==typeof n&&"type"in n}(t)&&n.call(this,t,"number"==typeof r?r:void 0,e||void 0))}}function r(){return!0}export{n as convert};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/unist-util-is/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../node_modules/unist-util-is/lib/index.js"],"sourcesContent":["/**\n * @import {Node, Parent} from 'unist'\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | ReadonlyArray<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends ReadonlyArray<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends Array<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test)\n          ? anyFactory(test)\n          : // Cast because `ReadonlyArray` goes into the above but `isArray`\n            // narrows to `Array`.\n            propertiesFactory(/** @type {Props} */ (test))\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propertiesFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n"],"names":["convert","test","ok","castFactory","Array","isArray","tests","checks","index","length","any","parameters","apply","this","anyFactory","check","checkAsRecord","all","node","nodeAsRecord","key","propertiesFactory","type","typeFactory","Error","testFunction","value","parent","Boolean","looksLikeANode","call","undefined"],"mappings":"AA4IY,MAACA,EAWb,SAKcC,GACR,GAAIA,QACF,OAAOC,EAGT,GAAoB,mBAATD,EACT,OAAOE,EAAYF,GAGrB,GAAoB,iBAATA,EACT,OAAOG,MAAMC,QAAQJ,GAmB7B,SAAoBK,GAElB,MAAMC,EAAS,GACf,IAAIC,GAAS,EAEb,OAASA,EAAQF,EAAMG,QACrBF,EAAOC,GAASR,EAAQM,EAAME,IAGhC,OAAOL,EAAYO,GAMnB,SAASA,KAAOC,GACd,IAAIH,GAAS,EAEb,OAASA,EAAQD,EAAOE,QACtB,GAAIF,EAAOC,GAAOI,MAAMC,KAAMF,GAAa,OAAO,EAGpD,OAAO,CACR,CACH,CA1CYG,CAAWb,GAkDvB,SAA2Bc,GACzB,MAAMC,EAAwD,EAE9D,OAAOb,EAAYc,GAMnB,SAASA,EAAIC,GACX,MAAMC,EAAY,EAKlB,IAAIC,EAEJ,IAAKA,KAAOL,EACV,GAAII,EAAaC,KAASJ,EAAcI,GAAM,OAAO,EAGvD,OAAO,CACR,CACH,CAtEYC,CAAwC,GAG9C,GAAoB,iBAATpB,EACT,OA0ER,SAAqBc,GACnB,OAAOZ,EAAYmB,GAKnB,SAASA,EAAKJ,GACZ,OAAOA,GAAQA,EAAKI,OAASP,CAC9B,CACH,CAnFeQ,CAAYtB,GAGrB,MAAM,IAAIuB,MAAM,+CAEnB,EAsFH,SAASrB,EAAYsB,GACnB,OAMA,SAAeC,EAAOlB,EAAOmB,GAC3B,OAAOC,QAoBX,SAAwBF,GACtB,OAAiB,OAAVA,GAAmC,iBAAVA,GAAsB,SAAUA,CAClE,CArBMG,CAAeH,IACbD,EAAaK,KACXjB,KACAa,EACiB,iBAAVlB,EAAqBA,OAAQuB,EACpCJ,QAAUI,GAGjB,CACH,CAEA,SAAS7B,IACP,OAAO,CACT"}

package/dist/node_modules/unist-util-position/lib/index.js

@@ -1,2 +0,0 @@
-const n=e("end"),o=e("start");function e(n){return function(o){const e=o&&o.position&&o.position[n]||{};if("number"==typeof e.line&&e.line>0&&"number"==typeof e.column&&e.column>0)return{line:e.line,column:e.column,offset:"number"==typeof e.offset&&e.offset>-1?e.offset:void 0}}}export{n as pointEnd,o as pointStart};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/unist-util-position/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../node_modules/unist-util-position/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Point} Point\n * @typedef {import('unist').Position} Position\n */\n\n/**\n * @typedef NodeLike\n * @property {string} type\n * @property {PositionLike | null | undefined} [position]\n *\n * @typedef PositionLike\n * @property {PointLike | null | undefined} [start]\n * @property {PointLike | null | undefined} [end]\n *\n * @typedef PointLike\n * @property {number | null | undefined} [line]\n * @property {number | null | undefined} [column]\n * @property {number | null | undefined} [offset]\n */\n\n/**\n * Get the ending point of `node`.\n *\n * @param node\n *   Node.\n * @returns\n *   Point.\n */\nexport const pointEnd = point('end')\n\n/**\n * Get the starting point of `node`.\n *\n * @param node\n *   Node.\n * @returns\n *   Point.\n */\nexport const pointStart = point('start')\n\n/**\n * Get the positional info of `node`.\n *\n * @param {'end' | 'start'} type\n *   Side.\n * @returns\n *   Getter.\n */\nfunction point(type) {\n  return point\n\n  /**\n   * Get the point info of `node` at a bound side.\n   *\n   * @param {Node | NodeLike | null | undefined} [node]\n   * @returns {Point | undefined}\n   */\n  function point(node) {\n    const point = (node && node.position && node.position[type]) || {}\n\n    if (\n      typeof point.line === 'number' &&\n      point.line > 0 &&\n      typeof point.column === 'number' &&\n      point.column > 0\n    ) {\n      return {\n        line: point.line,\n        column: point.column,\n        offset:\n          typeof point.offset === 'number' && point.offset > -1\n            ? point.offset\n            : undefined\n      }\n    }\n  }\n}\n\n/**\n * Get the positional info of `node`.\n *\n * @param {Node | NodeLike | null | undefined} [node]\n *   Node.\n * @returns {Position | undefined}\n *   Position.\n */\nexport function position(node) {\n  const start = pointStart(node)\n  const end = pointEnd(node)\n\n  if (start && end) {\n    return {start, end}\n  }\n}\n"],"names":["pointEnd","point","pointStart","type","node","position","line","column","offset","undefined"],"mappings":"AA6BY,MAACA,EAAWC,EAAM,OAUjBC,EAAaD,EAAM,SAUhC,SAASA,EAAME,GACb,OAQA,SAAeC,GACb,MAAMH,EAASG,GAAQA,EAAKC,UAAYD,EAAKC,SAASF,IAAU,CAAE,EAElE,GACwB,iBAAfF,EAAMK,MACbL,EAAMK,KAAO,GACW,iBAAjBL,EAAMM,QACbN,EAAMM,OAAS,EAEf,MAAO,CACLD,KAAML,EAAMK,KACZC,OAAQN,EAAMM,OACdC,OAC0B,iBAAjBP,EAAMO,QAAuBP,EAAMO,QAAU,EAChDP,EAAMO,YACNC,EAGX,CACH"}

package/dist/node_modules/unist-util-visit/lib/index.js

@@ -1,2 +0,0 @@
-import{visitParents as n}from"../node_modules/unist-util-visit-parents/lib/index.js";export{CONTINUE,EXIT,SKIP}from"../node_modules/unist-util-visit-parents/lib/index.js";const t=function(t,i,o,e){"function"==typeof i&&"function"!=typeof o&&(e=o,o=i,i=null),n(t,i,function(n,t){const i=t[t.length-1];return o(n,i?i.children.indexOf(n):null,i)},e)};export{t as visit};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/unist-util-visit/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../node_modules/unist-util-visit/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\n */\n\n/**\n * Check if `Child` can be a child of `Ancestor`.\n *\n * Returns the ancestor when `Child` can be a child of `Ancestor`, or returns\n * `never`.\n *\n * @template {Node} Ancestor\n *   Node type.\n * @template {Node} Child\n *   Node type.\n * @typedef {(\n *   Ancestor extends Parent\n *     ? Child extends Ancestor['children'][number]\n *       ? Ancestor\n *       : never\n *     : never\n * )} ParentsOf\n */\n\n/**\n * @template {Node} [Visited=Node]\n *   Visited node type.\n * @template {Parent} [Ancestor=Parent]\n *   Ancestor type.\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends Node ? number | null : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends Node ? Ancestor | null : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n */\n\n/**\n * Build a typed `Visitor` function from a node and all possible parents.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n *\n * @template {Node} Visited\n *   Node type.\n * @template {Parent} Ancestor\n *   Parent type.\n * @typedef {Visitor<Visited, ParentsOf<Ancestor, Visited>>} BuildVisitorFromMatch\n */\n\n/**\n * Build a typed `Visitor` function from a list of descendants and a test.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n *\n * @template {Node} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     import('unist-util-visit-parents/complex-types.js').Matches<Descendant, Check>,\n *     Extract<Descendant, Parent>\n *   >\n * )} BuildVisitorFromDescendants\n */\n\n/**\n * Build a typed `Visitor` function from a tree and a test.\n *\n * It will infer which values are passed as `node` and which as `parent`.\n *\n * @template {Node} [Tree=Node]\n *   Node type.\n * @template {Test} [Check=string]\n *   Test type.\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     import('unist-util-visit-parents/complex-types.js').InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @param tree\n *   Tree to traverse.\n * @param test\n *   `unist-util-is`-compatible test\n * @param visitor\n *   Handle each node.\n * @param reverse\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns\n *   Nothing.\n */\nexport const visit =\n  /**\n   * @type {(\n   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &\n   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)\n   * )}\n   */\n  (\n    /**\n     * @param {Node} tree\n     * @param {Test} test\n     * @param {Visitor} visitor\n     * @param {boolean | null | undefined} [reverse]\n     * @returns {void}\n     */\n    function (tree, test, visitor, reverse) {\n      if (typeof test === 'function' && typeof visitor !== 'function') {\n        reverse = visitor\n        visitor = test\n        test = null\n      }\n\n      visitParents(tree, test, overload, reverse)\n\n      /**\n       * @param {Node} node\n       * @param {Array<Parent>} parents\n       */\n      function overload(node, parents) {\n        const parent = parents[parents.length - 1]\n        return visitor(\n          node,\n          parent ? parent.children.indexOf(node) : null,\n          parent\n        )\n      }\n    }\n  )\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n"],"names":["visit","tree","test","visitor","reverse","visitParents","node","parents","parent","length","children","indexOf"],"mappings":"2KA8IY,MAACA,EAOb,SAQcC,EAAMC,EAAMC,EAASC,GACT,mBAATF,GAA0C,mBAAZC,IACvCC,EAAUD,EACVA,EAAUD,EACVA,EAAO,MAGTG,EAAaJ,EAAMC,EAMnB,SAAkBI,EAAMC,GACtB,MAAMC,EAASD,EAAQA,EAAQE,OAAS,GACxC,OAAON,EACLG,EACAE,EAASA,EAAOE,SAASC,QAAQL,GAAQ,KACzCE,EAEH,EAbkCJ,EAezC"}

package/dist/node_modules/unist-util-visit/node_modules/unist-util-is/lib/index.js

@@ -1,2 +0,0 @@
-const t=function(e){if(null==e)return r;if("string"==typeof e)return function(t){return n(r);function r(n){return n&&n.type===t}}(e);if("object"==typeof e)return Array.isArray(e)?function(r){const e=[];let o=-1;for(;++o<r.length;)e[o]=t(r[o]);return n(u);function u(...t){let n=-1;for(;++n<e.length;)if(e[n].call(this,...t))return!0;return!1}}(e):function(t){return n(r);function r(n){let r;for(r in t)if(n[r]!==t[r])return!1;return!0}}(e);if("function"==typeof e)return n(e);throw new Error("Expected function, string, or object as test")};function n(t){return function(n,...r){return Boolean(n&&"object"==typeof n&&"type"in n&&Boolean(t.call(this,n,...r)))}}function r(){return!0}export{t as convert};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/unist-util-visit/node_modules/unist-util-is/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/unist-util-visit/node_modules/unist-util-is/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n */\n\n/**\n * @typedef {Record<string, unknown>} Props\n * @typedef {null | undefined | string | Props | TestFunctionAnything | Array<string | Props | TestFunctionAnything>} Test\n *   Check for an arbitrary node, unaware of TypeScript inferral.\n *\n * @callback TestFunctionAnything\n *   Check if a node passes a test, unaware of TypeScript inferral.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | void}\n *   Whether this node passes the test.\n */\n\n/**\n * @template {Node} Kind\n *   Node type.\n * @typedef {Kind['type'] | Partial<Kind> | TestFunctionPredicate<Kind> | Array<Kind['type'] | Partial<Kind> | TestFunctionPredicate<Kind>>} PredicateTest\n *   Check for a node that can be inferred by TypeScript.\n */\n\n/**\n * Check if a node passes a certain test.\n *\n * @template {Node} Kind\n *   Node type.\n * @callback TestFunctionPredicate\n *   Complex test function for a node that can be inferred by TypeScript.\n * @param {Node} node\n *   A node.\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {node is Kind}\n *   Whether this node passes the test.\n */\n\n/**\n * @callback AssertAnything\n *   Check that an arbitrary value is a node, unaware of TypeScript inferral.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n */\n\n/**\n * Check if a node is a node and passes a certain node test.\n *\n * @template {Node} Kind\n *   Node type.\n * @callback AssertPredicate\n *   Check that an arbitrary value is a specific node, aware of TypeScript.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {node is Kind}\n *   Whether this is a node and passes a test.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param node\n *   Thing to check, typically `Node`.\n * @param test\n *   A check for a specific node.\n * @param index\n *   The node’s position in its parent.\n * @param parent\n *   The node’s parent.\n * @returns\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  /**\n   * @type {(\n   *   (() => false) &\n   *   (<Kind extends Node = Node>(node: unknown, test: PredicateTest<Kind>, index: number, parent: Parent, context?: unknown) => node is Kind) &\n   *   (<Kind extends Node = Node>(node: unknown, test: PredicateTest<Kind>, index?: null | undefined, parent?: null | undefined, context?: unknown) => node is Kind) &\n   *   ((node: unknown, test: Test, index: number, parent: Parent, context?: unknown) => boolean) &\n   *   ((node: unknown, test?: Test, index?: null | undefined, parent?: null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function is(node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      // @ts-expect-error Looks like a node.\n      return node && node.type && typeof node.type === 'string'\n        ? Boolean(check.call(context, node, index, parent))\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns\n *   An assertion.\n */\nexport const convert =\n  /**\n   * @type {(\n   *   (<Kind extends Node>(test: PredicateTest<Kind>) => AssertPredicate<Kind>) &\n   *   ((test?: Test) => AssertAnything)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {AssertAnything}\n     */\n    function (test) {\n      if (test === undefined || test === null) {\n        return ok\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test) ? anyFactory(test) : propsFactory(test)\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<string | Props | TestFunctionAnything>} tests\n * @returns {AssertAnything}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<AssertAnything>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @param {Array<unknown>} parameters\n   * @returns {boolean}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].call(this, ...parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {AssertAnything}\n */\nfunction propsFactory(check) {\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      // @ts-expect-error: hush, it sure works as an index.\n      if (node[key] !== check[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {AssertAnything}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunctionAnything} check\n * @returns {AssertAnything}\n */\nfunction castFactory(check) {\n  return assertion\n\n  /**\n   * @this {unknown}\n   * @param {unknown} node\n   * @param {Array<unknown>} parameters\n   * @returns {boolean}\n   */\n  function assertion(node, ...parameters) {\n    return Boolean(\n      node &&\n        typeof node === 'object' &&\n        'type' in node &&\n        // @ts-expect-error: fine.\n        Boolean(check.call(this, node, ...parameters))\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n"],"names":["convert","test","ok","check","castFactory","type","node","typeFactory","Array","isArray","tests","checks","index","length","any","parameters","call","this","anyFactory","all","key","propsFactory","Error","Boolean"],"mappings":"AAqKY,MAACA,EAOb,SAKcC,GACR,GAAIA,QACF,OAAOC,EAGT,GAAoB,iBAATD,EACT,OA8ER,SAAqBE,GACnB,OAAOC,EAAYC,GAKnB,SAASA,EAAKC,GACZ,OAAOA,GAAQA,EAAKD,OAASF,CAC9B,CACH,CAvFeI,CAAYN,GAGrB,GAAoB,iBAATA,EACT,OAAOO,MAAMC,QAAQR,GAe7B,SAAoBS,GAElB,MAAMC,EAAS,GACf,IAAIC,GAAS,EAEb,OAASA,EAAQF,EAAMG,QACrBF,EAAOC,GAASZ,EAAQU,EAAME,IAGhC,OAAOR,EAAYU,GAOnB,SAASA,KAAOC,GACd,IAAIH,GAAS,EAEb,OAASA,EAAQD,EAAOE,QACtB,GAAIF,EAAOC,GAAOI,KAAKC,QAASF,GAAa,OAAO,EAGtD,OAAO,CACR,CACH,CAxCqCG,CAAWjB,GAgDhD,SAAsBE,GACpB,OAAOC,EAAYe,GAMnB,SAASA,EAAIb,GAEX,IAAIc,EAEJ,IAAKA,KAAOjB,EAEV,GAAIG,EAAKc,KAASjB,EAAMiB,GAAM,OAAO,EAGvC,OAAO,CACR,CACH,CAlEwDC,CAAapB,GAG/D,GAAoB,mBAATA,EACT,OAAOG,EAAYH,GAGrB,MAAM,IAAIqB,MAAM,+CAEnB,EAkFH,SAASlB,EAAYD,GACnB,OAQA,SAAmBG,KAASS,GAC1B,OAAOQ,QACLjB,GACkB,iBAATA,GACP,SAAUA,GAEViB,QAAQpB,EAAMa,KAAKC,KAAMX,KAASS,IAEvC,CACH,CAEA,SAASb,IACP,OAAO,CACT"}

package/dist/node_modules/unist-util-visit/node_modules/unist-util-visit-parents/lib/color.browser.js

@@ -1,2 +0,0 @@
-function n(n){return n}export{n as color};
-//# sourceMappingURL=color.browser.js.map

package/dist/node_modules/unist-util-visit/node_modules/unist-util-visit-parents/lib/color.browser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"color.browser.js","sources":["../../../../../../node_modules/unist-util-visit/node_modules/unist-util-visit-parents/lib/color.browser.js"],"sourcesContent":["/**\n * @param {string} d\n * @returns {string}\n */\nexport function color(d) {\n  return d\n}\n"],"names":["color","d"],"mappings":"AAIO,SAASA,EAAMC,GACpB,OAAOA,CACT"}

package/dist/node_modules/unist-util-visit/node_modules/unist-util-visit-parents/lib/index.js

@@ -1,2 +0,0 @@
-import{convert as n}from"../../unist-util-is/lib/index.js";import{color as t}from"./color.browser.js";const e=!0,r=!1,o="skip",i=function(i,f,u,c){"function"==typeof f&&"function"!=typeof u&&(c=u,u=f,f=null);const l=n(f),p=c?-1:1;!function n(i,s,y){const a=i&&"object"==typeof i?i:{};if("string"==typeof a.type){const n="string"==typeof a.tagName?a.tagName:"string"==typeof a.name?a.name:void 0;Object.defineProperty(m,"name",{value:"node ("+t(i.type+(n?"<"+n+">":""))+")"})}return m;function m(){let t,a,m,d=[];if((!f||l(i,s,y[y.length-1]||null))&&(d=function(n){if(Array.isArray(n))return n;if("number"==typeof n)return[e,n];return[n]}(u(i,y)),d[0]===r))return d;if(i.children&&d[0]!==o)for(a=(c?i.children.length:-1)+p,m=y.concat(i);a>-1&&a<i.children.length;){if(t=n(i.children[a],a,m)(),t[0]===r)return t;a="number"==typeof t[1]?t[1]:a+p}return d}}(i,void 0,[])()};export{e as CONTINUE,r as EXIT,o as SKIP,i as visitParents};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/unist-util-visit/node_modules/unist-util-visit-parents/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/unist-util-visit/node_modules/unist-util-visit-parents/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Parent} Parent\n * @typedef {import('unist-util-is').Test} Test\n */\n\n/**\n * @typedef {boolean | 'skip'} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @template {Node} [Visited=Node]\n *   Visited node type.\n * @template {Parent} [Ancestor=Parent]\n *   Ancestor type.\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<Ancestor>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n */\n\n/**\n * @template {Node} [Tree=Node]\n *   Tree type.\n * @template {Test} [Check=string]\n *   Test type.\n * @typedef {Visitor<import('./complex-types.js').Matches<import('./complex-types.js').InclusiveDescendant<Tree>, Check>, Extract<import('./complex-types.js').InclusiveDescendant<Tree>, Parent>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from './color.js'\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @param tree\n *   Tree to traverse.\n * @param test\n *   `unist-util-is`-compatible test\n * @param visitor\n *   Handle each node.\n * @param reverse\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns\n *   Nothing.\n */\nexport const visitParents =\n  /**\n   * @type {(\n   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &\n   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)\n   * )}\n   */\n  (\n    /**\n     * @param {Node} tree\n     * @param {Test} test\n     * @param {Visitor<Node>} visitor\n     * @param {boolean | null | undefined} [reverse]\n     * @returns {void}\n     */\n    function (tree, test, visitor, reverse) {\n      if (typeof test === 'function' && typeof visitor !== 'function') {\n        reverse = visitor\n        // @ts-expect-error no visitor given, so `visitor` is test.\n        visitor = test\n        test = null\n      }\n\n      const is = convert(test)\n      const step = reverse ? -1 : 1\n\n      factory(tree, undefined, [])()\n\n      /**\n       * @param {Node} node\n       * @param {number | undefined} index\n       * @param {Array<Parent>} parents\n       */\n      function factory(node, index, parents) {\n        /** @type {Record<string, unknown>} */\n        // @ts-expect-error: hush\n        const value = node && typeof node === 'object' ? node : {}\n\n        if (typeof value.type === 'string') {\n          const name =\n            // `hast`\n            typeof value.tagName === 'string'\n              ? value.tagName\n              : // `xast`\n              typeof value.name === 'string'\n              ? value.name\n              : undefined\n\n          Object.defineProperty(visit, 'name', {\n            value:\n              'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n          })\n        }\n\n        return visit\n\n        function visit() {\n          /** @type {ActionTuple} */\n          let result = []\n          /** @type {ActionTuple} */\n          let subresult\n          /** @type {number} */\n          let offset\n          /** @type {Array<Parent>} */\n          let grandparents\n\n          if (!test || is(node, index, parents[parents.length - 1] || null)) {\n            result = toResult(visitor(node, parents))\n\n            if (result[0] === EXIT) {\n              return result\n            }\n          }\n\n          // @ts-expect-error looks like a parent.\n          if (node.children && result[0] !== SKIP) {\n            // @ts-expect-error looks like a parent.\n            offset = (reverse ? node.children.length : -1) + step\n            // @ts-expect-error looks like a parent.\n            grandparents = parents.concat(node)\n\n            // @ts-expect-error looks like a parent.\n            while (offset > -1 && offset < node.children.length) {\n              // @ts-expect-error looks like a parent.\n              subresult = factory(node.children[offset], offset, grandparents)()\n\n              if (subresult[0] === EXIT) {\n                return subresult\n              }\n\n              offset =\n                typeof subresult[1] === 'number' ? subresult[1] : offset + step\n            }\n          }\n\n          return result\n        }\n      }\n    }\n  )\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {ActionTuple}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return [value]\n}\n"],"names":["CONTINUE","EXIT","SKIP","visitParents","tree","test","visitor","reverse","is","convert","step","factory","node","index","parents","value","type","name","tagName","undefined","Object","defineProperty","visit","color","subresult","offset","grandparents","result","length","Array","isArray","toResult","children","concat"],"mappings":"sGAgFY,MAACA,GAAW,EAKXC,GAAO,EAKPC,EAAO,OA+BPC,EAOb,SAQcC,EAAMC,EAAMC,EAASC,GACT,mBAATF,GAA0C,mBAAZC,IACvCC,EAAUD,EAEVA,EAAUD,EACVA,EAAO,MAGT,MAAMG,EAAKC,EAAQJ,GACbK,EAAOH,GAAW,EAAI,GAS5B,SAASI,EAAQC,EAAMC,EAAOC,GAG5B,MAAMC,EAAQH,GAAwB,iBAATA,EAAoBA,EAAO,CAAE,EAE1D,GAA0B,iBAAfG,EAAMC,KAAmB,CAClC,MAAMC,EAEqB,iBAAlBF,EAAMG,QACTH,EAAMG,QAEc,iBAAfH,EAAME,KACXF,EAAME,UACNE,EAENC,OAAOC,eAAeC,EAAO,OAAQ,CACnCP,MACE,SAAWQ,EAAMX,EAAKI,MAAQC,EAAO,IAAMA,EAAO,IAAM,KAAO,KAEpE,CAED,OAAOK,EAEP,SAASA,IAEP,IAEIE,EAEAC,EAEAC,EANAC,EAAS,GAQb,KAAKtB,GAAQG,EAAGI,EAAMC,EAAOC,EAAQA,EAAQc,OAAS,IAAM,SAC1DD,EA0CZ,SAAkBZ,GAChB,GAAIc,MAAMC,QAAQf,GAChB,OAAOA,EAGT,GAAqB,iBAAVA,EACT,MAAO,CAACf,EAAUe,GAGpB,MAAO,CAACA,EACV,CApDqBgB,CAASzB,EAAQM,EAAME,IAE5Ba,EAAO,KAAO1B,GAChB,OAAO0B,EAKX,GAAIf,EAAKoB,UAAYL,EAAO,KAAOzB,EAOjC,IALAuB,GAAUlB,EAAUK,EAAKoB,SAASJ,QAAU,GAAKlB,EAEjDgB,EAAeZ,EAAQmB,OAAOrB,GAGvBa,GAAU,GAAKA,EAASb,EAAKoB,SAASJ,QAAQ,CAInD,GAFAJ,EAAYb,EAAQC,EAAKoB,SAASP,GAASA,EAAQC,EAAvCf,GAERa,EAAU,KAAOvB,EACnB,OAAOuB,EAGTC,EAC0B,iBAAjBD,EAAU,GAAkBA,EAAU,GAAKC,EAASf,CAC9D,CAGH,OAAOiB,CACR,CACF,CAvEDhB,CAAQP,OAAMe,EAAW,GAAzBR,EAyEH"}

package/dist/node_modules/unist-util-visit-parents/lib/color.js

@@ -1,2 +0,0 @@
-function n(n){return n}export{n as color};
-//# sourceMappingURL=color.js.map

package/dist/node_modules/unist-util-visit-parents/lib/color.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"color.js","sources":["../../../../node_modules/unist-util-visit-parents/lib/color.js"],"sourcesContent":["/**\n * @param {string} d\n * @returns {string}\n */\nexport function color(d) {\n  return d\n}\n"],"names":["color","d"],"mappings":"AAIO,SAASA,EAAMC,GACpB,OAAOA,CACT"}

package/dist/node_modules/unist-util-visit-parents/lib/index.js

@@ -1,2 +0,0 @@
-import{convert as n}from"../../unist-util-is/lib/index.js";import{color as t}from"./color.js";const e=[],r=!0,i=!1,o="skip";function f(f,c,u,l){let p;"function"==typeof c&&"function"!=typeof u?(l=u,u=c):p=c;const s=n(p),y=l?-1:1;!function n(f,p,d){const a=f&&"object"==typeof f?f:{};if("string"==typeof a.type){const n="string"==typeof a.tagName?a.tagName:"string"==typeof a.name?a.name:void 0;Object.defineProperty(m,"name",{value:"node ("+t(f.type+(n?"<"+n+">":""))+")"})}return m;function m(){let t,a,m,h=e;if((!c||s(f,p,d[d.length-1]||void 0))&&(h=function(n){if(Array.isArray(n))return n;if("number"==typeof n)return[r,n];return null==n?e:[n]}(u(f,d)),h[0]===i))return h;if("children"in f&&f.children){const e=f;if(e.children&&h[0]!==o)for(a=(l?e.children.length:-1)+y,m=d.concat(e);a>-1&&a<e.children.length;){const r=e.children[a];if(t=n(r,a,m)(),t[0]===i)return t;a="number"==typeof t[1]?t[1]:a+y}}return h}}(f,void 0,[])()}export{r as CONTINUE,i as EXIT,o as SKIP,f as visitParents};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/unist-util-visit-parents/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../node_modules/unist-util-visit-parents/lib/index.js"],"sourcesContent":["/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<infer T>\n *   ? MatchesOne<Value, T>\n *   : Check extends Array<infer T>\n *   ? MatchesOne<Value, T>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {InternalAncestor<InclusiveDescendant<Tree>, Child>} Ancestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {'skip' | boolean} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<VisitedParents>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [VisitedParents=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Matches<InclusiveDescendant<Tree>, Check>, Ancestor<Tree, Matches<InclusiveDescendant<Tree>, Check>>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Tree type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from 'unist-util-visit-parents/do-not-use-color'\n\n/** @type {Readonly<ActionTuple>} */\nconst empty = []\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} test\n *   `unist-util-is`-compatible test\n * @param {Visitor | boolean | null | undefined} [visitor]\n *   Handle each node.\n * @param {boolean | null | undefined} [reverse]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visitParents(tree, test, visitor, reverse) {\n  /** @type {Test} */\n  let check\n\n  if (typeof test === 'function' && typeof visitor !== 'function') {\n    reverse = visitor\n    // @ts-expect-error no visitor given, so `visitor` is test.\n    visitor = test\n  } else {\n    // @ts-expect-error visitor given, so `test` isn’t a visitor.\n    check = test\n  }\n\n  const is = convert(check)\n  const step = reverse ? -1 : 1\n\n  factory(tree, undefined, [])()\n\n  /**\n   * @param {UnistNode} node\n   * @param {number | undefined} index\n   * @param {Array<UnistParent>} parents\n   */\n  function factory(node, index, parents) {\n    const value = /** @type {Record<string, unknown>} */ (\n      node && typeof node === 'object' ? node : {}\n    )\n\n    if (typeof value.type === 'string') {\n      const name =\n        // `hast`\n        typeof value.tagName === 'string'\n          ? value.tagName\n          : // `xast`\n            typeof value.name === 'string'\n            ? value.name\n            : undefined\n\n      Object.defineProperty(visit, 'name', {\n        value:\n          'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n      })\n    }\n\n    return visit\n\n    function visit() {\n      /** @type {Readonly<ActionTuple>} */\n      let result = empty\n      /** @type {Readonly<ActionTuple>} */\n      let subresult\n      /** @type {number} */\n      let offset\n      /** @type {Array<UnistParent>} */\n      let grandparents\n\n      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {\n        // @ts-expect-error: `visitor` is now a visitor.\n        result = toResult(visitor(node, parents))\n\n        if (result[0] === EXIT) {\n          return result\n        }\n      }\n\n      if ('children' in node && node.children) {\n        const nodeAsParent = /** @type {UnistParent} */ (node)\n\n        if (nodeAsParent.children && result[0] !== SKIP) {\n          offset = (reverse ? nodeAsParent.children.length : -1) + step\n          grandparents = parents.concat(nodeAsParent)\n\n          while (offset > -1 && offset < nodeAsParent.children.length) {\n            const child = nodeAsParent.children[offset]\n\n            subresult = factory(child, offset, grandparents)()\n\n            if (subresult[0] === EXIT) {\n              return subresult\n            }\n\n            offset =\n              typeof subresult[1] === 'number' ? subresult[1] : offset + step\n          }\n        }\n      }\n\n      return result\n    }\n  }\n}\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {Readonly<ActionTuple>}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return value === null || value === undefined ? empty : [value]\n}\n"],"names":["empty","CONTINUE","EXIT","SKIP","visitParents","tree","test","visitor","reverse","check","is","convert","step","factory","node","index","parents","value","type","name","tagName","undefined","Object","defineProperty","visit","color","subresult","offset","grandparents","result","length","Array","isArray","toResult","children","nodeAsParent","concat","child"],"mappings":"8FAgOA,MAAMA,EAAQ,GAKDC,GAAW,EAKXC,GAAO,EAKPC,EAAO,OAiDb,SAASC,EAAaC,EAAMC,EAAMC,EAASC,GAEhD,IAAIC,EAEgB,mBAATH,GAA0C,mBAAZC,GACvCC,EAAUD,EAEVA,EAAUD,GAGVG,EAAQH,EAGV,MAAMI,EAAKC,EAAQF,GACbG,EAAOJ,GAAW,EAAI,GAS5B,SAASK,EAAQC,EAAMC,EAAOC,GAC5B,MAAMC,EACJH,GAAwB,iBAATA,EAAoBA,EAAO,CAAE,EAG9C,GAA0B,iBAAfG,EAAMC,KAAmB,CAClC,MAAMC,EAEqB,iBAAlBF,EAAMG,QACTH,EAAMG,QAEgB,iBAAfH,EAAME,KACXF,EAAME,UACNE,EAERC,OAAOC,eAAeC,EAAO,OAAQ,CACnCP,MACE,SAAWQ,EAAMX,EAAKI,MAAQC,EAAO,IAAMA,EAAO,IAAM,KAAO,KAEpE,CAED,OAAOK,EAEP,SAASA,IAEP,IAEIE,EAEAC,EAEAC,EANAC,EAAS7B,EAQb,KAAKM,GAAQI,EAAGI,EAAMC,EAAOC,EAAQA,EAAQc,OAAS,SAAMT,MAE1DQ,EA0CR,SAAkBZ,GAChB,GAAIc,MAAMC,QAAQf,GAChB,OAAOA,EAGT,GAAqB,iBAAVA,EACT,MAAO,CAAChB,EAAUgB,GAGpB,OAAOA,QAAwCjB,EAAQ,CAACiB,EAC1D,CApDiBgB,CAAS1B,EAAQO,EAAME,IAE5Ba,EAAO,KAAO3B,GAChB,OAAO2B,EAIX,GAAI,aAAcf,GAAQA,EAAKoB,SAAU,CACvC,MAAMC,EAA2C,EAEjD,GAAIA,EAAaD,UAAYL,EAAO,KAAO1B,EAIzC,IAHAwB,GAAUnB,EAAU2B,EAAaD,SAASJ,QAAU,GAAKlB,EACzDgB,EAAeZ,EAAQoB,OAAOD,GAEvBR,GAAU,GAAKA,EAASQ,EAAaD,SAASJ,QAAQ,CAC3D,MAAMO,EAAQF,EAAaD,SAASP,GAIpC,GAFAD,EAAYb,EAAQwB,EAAOV,EAAQC,EAAvBf,GAERa,EAAU,KAAOxB,EACnB,OAAOwB,EAGTC,EAC0B,iBAAjBD,EAAU,GAAkBA,EAAU,GAAKC,EAASf,CAC9D,CAEJ,CAED,OAAOiB,CACR,CACF,CAzEDhB,CAAQR,OAAMgB,EAAW,GAAzBR,EA0EF"}

package/dist/node_modules/vfile/lib/index.js

@@ -1,2 +0,0 @@
-import t from"../../../_virtual/index3.js";import{VFileMessage as e}from"../../vfile-message/lib/index.js";import{path as s}from"./minpath.browser.js";import{proc as i}from"./minproc.browser.js";import{urlToPath as n}from"./minurl.browser.js";import{isUrl as r}from"./minurl.shared.js";const a=["history","path","basename","stem","extname","dirname"];class h{constructor(e){let s;s=e?"string"==typeof e||function(e){return t(e)}(e)?{value:e}:r(e)?{path:e}:e:{},this.data={},this.messages=[],this.history=[],this.cwd=i.cwd(),this.value,this.stored,this.result,this.map;let n,h=-1;for(;++h<a.length;){const t=a[h];t in s&&void 0!==s[t]&&null!==s[t]&&(this[t]="history"===t?[...s[t]]:s[t])}for(n in s)a.includes(n)||(this[n]=s[n])}get path(){return this.history[this.history.length-1]}set path(t){r(t)&&(t=n(t)),m(t,"path"),this.path!==t&&this.history.push(t)}get dirname(){return"string"==typeof this.path?s.dirname(this.path):void 0}set dirname(t){p(this.basename,"dirname"),this.path=s.join(t||"",this.basename)}get basename(){return"string"==typeof this.path?s.basename(this.path):void 0}set basename(t){m(t,"basename"),o(t,"basename"),this.path=s.join(this.dirname||"",t)}get extname(){return"string"==typeof this.path?s.extname(this.path):void 0}set extname(t){if(o(t,"extname"),p(this.dirname,"extname"),t){if(46!==t.charCodeAt(0))throw new Error("`extname` must start with `.`");if(t.includes(".",1))throw new Error("`extname` cannot contain multiple dots")}this.path=s.join(this.dirname,this.stem+(t||""))}get stem(){return"string"==typeof this.path?s.basename(this.path,this.extname):void 0}set stem(t){m(t,"stem"),o(t,"stem"),this.path=s.join(this.dirname||"",t+(this.extname||""))}toString(t){return(this.value||"").toString(t||void 0)}message(t,s,i){const n=new e(t,s,i);return this.path&&(n.name=this.path+":"+n.name,n.file=this.path),n.fatal=!1,this.messages.push(n),n}info(t,e,s){const i=this.message(t,e,s);return i.fatal=null,i}fail(t,e,s){const i=this.message(t,e,s);throw i.fatal=!0,i}}function o(t,e){if(t&&t.includes(s.sep))throw new Error("`"+e+"` cannot be a path: did not expect `"+s.sep+"`")}function m(t,e){if(!t)throw new Error("`"+e+"` cannot be empty")}function p(t,e){if(!t)throw new Error("Setting `"+e+"` requires `path` to be set too")}export{h as VFile};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/vfile/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../node_modules/vfile/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('unist').Node} Node\n * @typedef {import('unist').Position} Position\n * @typedef {import('unist').Point} Point\n * @typedef {import('./minurl.shared.js').URL} URL\n * @typedef {import('../index.js').Data} Data\n * @typedef {import('../index.js').Value} Value\n */\n\n/**\n * @typedef {Record<string, unknown> & {type: string, position?: Position | undefined}} NodeLike\n *\n * @typedef {'ascii' | 'utf8' | 'utf-8' | 'utf16le' | 'ucs2' | 'ucs-2' | 'base64' | 'base64url' | 'latin1' | 'binary' | 'hex'} BufferEncoding\n *   Encodings supported by the buffer class.\n *\n *   This is a copy of the types from Node, copied to prevent Node globals from\n *   being needed.\n *   Copied from: <https://github.com/DefinitelyTyped/DefinitelyTyped/blob/90a4ec8/types/node/buffer.d.ts#L170>\n *\n * @typedef {Options | URL | Value | VFile} Compatible\n *   Things that can be passed to the constructor.\n *\n * @typedef VFileCoreOptions\n *   Set multiple values.\n * @property {Value | null | undefined} [value]\n *   Set `value`.\n * @property {string | null | undefined} [cwd]\n *   Set `cwd`.\n * @property {Array<string> | null | undefined} [history]\n *   Set `history`.\n * @property {URL | string | null | undefined} [path]\n *   Set `path`.\n * @property {string | null | undefined} [basename]\n *   Set `basename`.\n * @property {string | null | undefined} [stem]\n *   Set `stem`.\n * @property {string | null | undefined} [extname]\n *   Set `extname`.\n * @property {string | null | undefined} [dirname]\n *   Set `dirname`.\n * @property {Data | null | undefined} [data]\n *   Set `data`.\n *\n * @typedef Map\n *   Raw source map.\n *\n *   See:\n *   <https://github.com/mozilla/source-map/blob/58819f0/source-map.d.ts#L15-L23>.\n * @property {number} version\n *   Which version of the source map spec this map is following.\n * @property {Array<string>} sources\n *   An array of URLs to the original source files.\n * @property {Array<string>} names\n *   An array of identifiers which can be referenced by individual mappings.\n * @property {string | undefined} [sourceRoot]\n *   The URL root from which all sources are relative.\n * @property {Array<string> | undefined} [sourcesContent]\n *   An array of contents of the original source files.\n * @property {string} mappings\n *   A string of base64 VLQs which contain the actual mappings.\n * @property {string} file\n *   The generated file this source map is associated with.\n *\n * @typedef {{[key: string]: unknown} & VFileCoreOptions} Options\n *   Configuration.\n *\n *   A bunch of keys that will be shallow copied over to the new file.\n *\n * @typedef {Record<string, unknown>} ReporterSettings\n *   Configuration for reporters.\n */\n\n/**\n * @template {ReporterSettings} Settings\n *   Options type.\n * @callback Reporter\n *   Type for a reporter.\n * @param {Array<VFile>} files\n *   Files to report.\n * @param {Settings} options\n *   Configuration.\n * @returns {string}\n *   Report.\n */\n\nimport bufferLike from 'is-buffer'\nimport {VFileMessage} from 'vfile-message'\nimport {path} from './minpath.js'\nimport {proc} from './minproc.js'\nimport {urlToPath, isUrl} from './minurl.js'\n\n/**\n * Order of setting (least specific to most), we need this because otherwise\n * `{stem: 'a', path: '~/b.js'}` would throw, as a path is needed before a\n * stem can be set.\n *\n * @type {Array<'basename' | 'dirname' | 'extname' | 'history' | 'path' | 'stem'>}\n */\nconst order = ['history', 'path', 'basename', 'stem', 'extname', 'dirname']\n\nexport class VFile {\n  /**\n   * Create a new virtual file.\n   *\n   * `options` is treated as:\n   *\n   * *   `string` or `Buffer` — `{value: options}`\n   * *   `URL` — `{path: options}`\n   * *   `VFile` — shallow copies its data over to the new file\n   * *   `object` — all fields are shallow copied over to the new file\n   *\n   * Path related fields are set in the following order (least specific to\n   * most specific): `history`, `path`, `basename`, `stem`, `extname`,\n   * `dirname`.\n   *\n   * You cannot set `dirname` or `extname` without setting either `history`,\n   * `path`, `basename`, or `stem` too.\n   *\n   * @param {Compatible | null | undefined} [value]\n   *   File value.\n   * @returns\n   *   New instance.\n   */\n  constructor(value) {\n    /** @type {Options | VFile} */\n    let options\n\n    if (!value) {\n      options = {}\n    } else if (typeof value === 'string' || buffer(value)) {\n      options = {value}\n    } else if (isUrl(value)) {\n      options = {path: value}\n    } else {\n      options = value\n    }\n\n    /**\n     * Place to store custom information (default: `{}`).\n     *\n     * It’s OK to store custom data directly on the file but moving it to\n     * `data` is recommended.\n     *\n     * @type {Data}\n     */\n    this.data = {}\n\n    /**\n     * List of messages associated with the file.\n     *\n     * @type {Array<VFileMessage>}\n     */\n    this.messages = []\n\n    /**\n     * List of filepaths the file moved between.\n     *\n     * The first is the original path and the last is the current path.\n     *\n     * @type {Array<string>}\n     */\n    this.history = []\n\n    /**\n     * Base of `path` (default: `process.cwd()` or `'/'` in browsers).\n     *\n     * @type {string}\n     */\n    this.cwd = proc.cwd()\n\n    /* eslint-disable no-unused-expressions */\n    /**\n     * Raw value.\n     *\n     * @type {Value}\n     */\n    this.value\n\n    // The below are non-standard, they are “well-known”.\n    // As in, used in several tools.\n\n    /**\n     * Whether a file was saved to disk.\n     *\n     * This is used by vfile reporters.\n     *\n     * @type {boolean}\n     */\n    this.stored\n\n    /**\n     * Custom, non-string, compiled, representation.\n     *\n     * This is used by unified to store non-string results.\n     * One example is when turning markdown into React nodes.\n     *\n     * @type {unknown}\n     */\n    this.result\n\n    /**\n     * Source map.\n     *\n     * This type is equivalent to the `RawSourceMap` type from the `source-map`\n     * module.\n     *\n     * @type {Map | null | undefined}\n     */\n    this.map\n    /* eslint-enable no-unused-expressions */\n\n    // Set path related properties in the correct order.\n    let index = -1\n\n    while (++index < order.length) {\n      const prop = order[index]\n\n      // Note: we specifically use `in` instead of `hasOwnProperty` to accept\n      // `vfile`s too.\n      if (\n        prop in options &&\n        options[prop] !== undefined &&\n        options[prop] !== null\n      ) {\n        // @ts-expect-error: TS doesn’t understand basic reality.\n        this[prop] = prop === 'history' ? [...options[prop]] : options[prop]\n      }\n    }\n\n    /** @type {string} */\n    let prop\n\n    // Set non-path related properties.\n    for (prop in options) {\n      // @ts-expect-error: fine to set other things.\n      if (!order.includes(prop)) {\n        // @ts-expect-error: fine to set other things.\n        this[prop] = options[prop]\n      }\n    }\n  }\n\n  /**\n   * Get the full path (example: `'~/index.min.js'`).\n   *\n   * @returns {string}\n   */\n  get path() {\n    return this.history[this.history.length - 1]\n  }\n\n  /**\n   * Set the full path (example: `'~/index.min.js'`).\n   *\n   * Cannot be nullified.\n   * You can set a file URL (a `URL` object with a `file:` protocol) which will\n   * be turned into a path with `url.fileURLToPath`.\n   *\n   * @param {string | URL} path\n   */\n  set path(path) {\n    if (isUrl(path)) {\n      path = urlToPath(path)\n    }\n\n    assertNonEmpty(path, 'path')\n\n    if (this.path !== path) {\n      this.history.push(path)\n    }\n  }\n\n  /**\n   * Get the parent path (example: `'~'`).\n   */\n  get dirname() {\n    return typeof this.path === 'string' ? path.dirname(this.path) : undefined\n  }\n\n  /**\n   * Set the parent path (example: `'~'`).\n   *\n   * Cannot be set if there’s no `path` yet.\n   */\n  set dirname(dirname) {\n    assertPath(this.basename, 'dirname')\n    this.path = path.join(dirname || '', this.basename)\n  }\n\n  /**\n   * Get the basename (including extname) (example: `'index.min.js'`).\n   */\n  get basename() {\n    return typeof this.path === 'string' ? path.basename(this.path) : undefined\n  }\n\n  /**\n   * Set basename (including extname) (`'index.min.js'`).\n   *\n   * Cannot contain path separators (`'/'` on unix, macOS, and browsers, `'\\'`\n   * on windows).\n   * Cannot be nullified (use `file.path = file.dirname` instead).\n   */\n  set basename(basename) {\n    assertNonEmpty(basename, 'basename')\n    assertPart(basename, 'basename')\n    this.path = path.join(this.dirname || '', basename)\n  }\n\n  /**\n   * Get the extname (including dot) (example: `'.js'`).\n   */\n  get extname() {\n    return typeof this.path === 'string' ? path.extname(this.path) : undefined\n  }\n\n  /**\n   * Set the extname (including dot) (example: `'.js'`).\n   *\n   * Cannot contain path separators (`'/'` on unix, macOS, and browsers, `'\\'`\n   * on windows).\n   * Cannot be set if there’s no `path` yet.\n   */\n  set extname(extname) {\n    assertPart(extname, 'extname')\n    assertPath(this.dirname, 'extname')\n\n    if (extname) {\n      if (extname.charCodeAt(0) !== 46 /* `.` */) {\n        throw new Error('`extname` must start with `.`')\n      }\n\n      if (extname.includes('.', 1)) {\n        throw new Error('`extname` cannot contain multiple dots')\n      }\n    }\n\n    this.path = path.join(this.dirname, this.stem + (extname || ''))\n  }\n\n  /**\n   * Get the stem (basename w/o extname) (example: `'index.min'`).\n   */\n  get stem() {\n    return typeof this.path === 'string'\n      ? path.basename(this.path, this.extname)\n      : undefined\n  }\n\n  /**\n   * Set the stem (basename w/o extname) (example: `'index.min'`).\n   *\n   * Cannot contain path separators (`'/'` on unix, macOS, and browsers, `'\\'`\n   * on windows).\n   * Cannot be nullified (use `file.path = file.dirname` instead).\n   */\n  set stem(stem) {\n    assertNonEmpty(stem, 'stem')\n    assertPart(stem, 'stem')\n    this.path = path.join(this.dirname || '', stem + (this.extname || ''))\n  }\n\n  /**\n   * Serialize the file.\n   *\n   * @param {BufferEncoding | null | undefined} [encoding='utf8']\n   *   Character encoding to understand `value` as when it’s a `Buffer`\n   *   (default: `'utf8'`).\n   * @returns {string}\n   *   Serialized file.\n   */\n  toString(encoding) {\n    return (this.value || '').toString(encoding || undefined)\n  }\n\n  /**\n   * Create a warning message associated with the file.\n   *\n   * Its `fatal` is set to `false` and `file` is set to the current file path.\n   * Its added to `file.messages`.\n   *\n   * @param {string | Error | VFileMessage} reason\n   *   Reason for message, uses the stack and message of the error if given.\n   * @param {Node | NodeLike | Position | Point | null | undefined} [place]\n   *   Place in file where the message occurred.\n   * @param {string | null | undefined} [origin]\n   *   Place in code where the message originates (example:\n   *   `'my-package:my-rule'` or `'my-rule'`).\n   * @returns {VFileMessage}\n   *   Message.\n   */\n  message(reason, place, origin) {\n    const message = new VFileMessage(reason, place, origin)\n\n    if (this.path) {\n      message.name = this.path + ':' + message.name\n      message.file = this.path\n    }\n\n    message.fatal = false\n\n    this.messages.push(message)\n\n    return message\n  }\n\n  /**\n   * Create an info message associated with the file.\n   *\n   * Its `fatal` is set to `null` and `file` is set to the current file path.\n   * Its added to `file.messages`.\n   *\n   * @param {string | Error | VFileMessage} reason\n   *   Reason for message, uses the stack and message of the error if given.\n   * @param {Node | NodeLike | Position | Point | null | undefined} [place]\n   *   Place in file where the message occurred.\n   * @param {string | null | undefined} [origin]\n   *   Place in code where the message originates (example:\n   *   `'my-package:my-rule'` or `'my-rule'`).\n   * @returns {VFileMessage}\n   *   Message.\n   */\n  info(reason, place, origin) {\n    const message = this.message(reason, place, origin)\n\n    message.fatal = null\n\n    return message\n  }\n\n  /**\n   * Create a fatal error associated with the file.\n   *\n   * Its `fatal` is set to `true` and `file` is set to the current file path.\n   * Its added to `file.messages`.\n   *\n   * > 👉 **Note**: a fatal error means that a file is no longer processable.\n   *\n   * @param {string | Error | VFileMessage} reason\n   *   Reason for message, uses the stack and message of the error if given.\n   * @param {Node | NodeLike | Position | Point | null | undefined} [place]\n   *   Place in file where the message occurred.\n   * @param {string | null | undefined} [origin]\n   *   Place in code where the message originates (example:\n   *   `'my-package:my-rule'` or `'my-rule'`).\n   * @returns {never}\n   *   Message.\n   * @throws {VFileMessage}\n   *   Message.\n   */\n  fail(reason, place, origin) {\n    const message = this.message(reason, place, origin)\n\n    message.fatal = true\n\n    throw message\n  }\n}\n\n/**\n * Assert that `part` is not a path (as in, does not contain `path.sep`).\n *\n * @param {string | null | undefined} part\n *   File path part.\n * @param {string} name\n *   Part name.\n * @returns {void}\n *   Nothing.\n */\nfunction assertPart(part, name) {\n  if (part && part.includes(path.sep)) {\n    throw new Error(\n      '`' + name + '` cannot be a path: did not expect `' + path.sep + '`'\n    )\n  }\n}\n\n/**\n * Assert that `part` is not empty.\n *\n * @param {string | undefined} part\n *   Thing.\n * @param {string} name\n *   Part name.\n * @returns {asserts part is string}\n *   Nothing.\n */\nfunction assertNonEmpty(part, name) {\n  if (!part) {\n    throw new Error('`' + name + '` cannot be empty')\n  }\n}\n\n/**\n * Assert `path` exists.\n *\n * @param {string | undefined} path\n *   Path.\n * @param {string} name\n *   Dependency name.\n * @returns {asserts path is string}\n *   Nothing.\n */\nfunction assertPath(path, name) {\n  if (!path) {\n    throw new Error('Setting `' + name + '` requires `path` to be set too')\n  }\n}\n\n/**\n * Assert `value` is a buffer.\n *\n * @param {unknown} value\n *   thing.\n * @returns {value is Buffer}\n *   Whether `value` is a Node.js buffer.\n */\nfunction buffer(value) {\n  return bufferLike(value)\n}\n"],"names":["order","VFile","constructor","value","options","bufferLike","buffer","isUrl","path","this","data","messages","history","cwd","proc","stored","result","map","prop","index","length","undefined","includes","urlToPath","assertNonEmpty","push","dirname","assertPath","basename","join","assertPart","extname","charCodeAt","Error","stem","toString","encoding","message","reason","place","origin","VFileMessage","name","file","fatal","info","fail","part","sep"],"mappings":"8RAkGA,MAAMA,EAAQ,CAAC,UAAW,OAAQ,WAAY,OAAQ,UAAW,WAE1D,MAAMC,EAuBX,WAAAC,CAAYC,GAEV,IAAIC,EAKFA,EAHGD,EAEuB,iBAAVA,GAoYtB,SAAgBA,GACd,OAAOE,EAAWF,EACpB,CAtY4CG,CAAOH,GACnC,CAACA,SACFI,EAAMJ,GACL,CAACK,KAAML,GAEPA,EANA,CAAE,EAiBdM,KAAKC,KAAO,CAAE,EAOdD,KAAKE,SAAW,GAShBF,KAAKG,QAAU,GAOfH,KAAKI,IAAMC,EAAKD,MAQhBJ,KAAKN,MAYLM,KAAKM,OAULN,KAAKO,OAULP,KAAKQ,IAIL,IAkBIC,EAlBAC,GAAS,EAEb,OAASA,EAAQnB,EAAMoB,QAAQ,CAC7B,MAAMF,EAAOlB,EAAMmB,GAKjBD,KAAQd,QACUiB,IAAlBjB,EAAQc,IACU,OAAlBd,EAAQc,KAGRT,KAAKS,GAAiB,YAATA,EAAqB,IAAId,EAAQc,IAASd,EAAQc,GAElE,CAMD,IAAKA,KAAQd,EAENJ,EAAMsB,SAASJ,KAElBT,KAAKS,GAAQd,EAAQc,GAG1B,CAOD,QAAIV,GACF,OAAOC,KAAKG,QAAQH,KAAKG,QAAQQ,OAAS,EAC3C,CAWD,QAAIZ,CAAKA,GACHD,EAAMC,KACRA,EAAOe,EAAUf,IAGnBgB,EAAehB,EAAM,QAEjBC,KAAKD,OAASA,GAChBC,KAAKG,QAAQa,KAAKjB,EAErB,CAKD,WAAIkB,GACF,MAA4B,iBAAdjB,KAAKD,KAAoBA,EAAKkB,QAAQjB,KAAKD,WAAQa,CAClE,CAOD,WAAIK,CAAQA,GACVC,EAAWlB,KAAKmB,SAAU,WAC1BnB,KAAKD,KAAOA,EAAKqB,KAAKH,GAAW,GAAIjB,KAAKmB,SAC3C,CAKD,YAAIA,GACF,MAA4B,iBAAdnB,KAAKD,KAAoBA,EAAKoB,SAASnB,KAAKD,WAAQa,CACnE,CASD,YAAIO,CAASA,GACXJ,EAAeI,EAAU,YACzBE,EAAWF,EAAU,YACrBnB,KAAKD,KAAOA,EAAKqB,KAAKpB,KAAKiB,SAAW,GAAIE,EAC3C,CAKD,WAAIG,GACF,MAA4B,iBAAdtB,KAAKD,KAAoBA,EAAKuB,QAAQtB,KAAKD,WAAQa,CAClE,CASD,WAAIU,CAAQA,GAIV,GAHAD,EAAWC,EAAS,WACpBJ,EAAWlB,KAAKiB,QAAS,WAErBK,EAAS,CACX,GAA8B,KAA1BA,EAAQC,WAAW,GACrB,MAAM,IAAIC,MAAM,iCAGlB,GAAIF,EAAQT,SAAS,IAAK,GACxB,MAAM,IAAIW,MAAM,yCAEnB,CAEDxB,KAAKD,KAAOA,EAAKqB,KAAKpB,KAAKiB,QAASjB,KAAKyB,MAAQH,GAAW,IAC7D,CAKD,QAAIG,GACF,MAA4B,iBAAdzB,KAAKD,KACfA,EAAKoB,SAASnB,KAAKD,KAAMC,KAAKsB,cAC9BV,CACL,CASD,QAAIa,CAAKA,GACPV,EAAeU,EAAM,QACrBJ,EAAWI,EAAM,QACjBzB,KAAKD,KAAOA,EAAKqB,KAAKpB,KAAKiB,SAAW,GAAIQ,GAAQzB,KAAKsB,SAAW,IACnE,CAWD,QAAAI,CAASC,GACP,OAAQ3B,KAAKN,OAAS,IAAIgC,SAASC,QAAYf,EAChD,CAkBD,OAAAgB,CAAQC,EAAQC,EAAOC,GACrB,MAAMH,EAAU,IAAII,EAAaH,EAAQC,EAAOC,GAWhD,OATI/B,KAAKD,OACP6B,EAAQK,KAAOjC,KAAKD,KAAO,IAAM6B,EAAQK,KACzCL,EAAQM,KAAOlC,KAAKD,MAGtB6B,EAAQO,OAAQ,EAEhBnC,KAAKE,SAASc,KAAKY,GAEZA,CACR,CAkBD,IAAAQ,CAAKP,EAAQC,EAAOC,GAClB,MAAMH,EAAU5B,KAAK4B,QAAQC,EAAQC,EAAOC,GAI5C,OAFAH,EAAQO,MAAQ,KAETP,CACR,CAsBD,IAAAS,CAAKR,EAAQC,EAAOC,GAClB,MAAMH,EAAU5B,KAAK4B,QAAQC,EAAQC,EAAOC,GAI5C,MAFAH,EAAQO,OAAQ,EAEVP,CACP,EAaH,SAASP,EAAWiB,EAAML,GACxB,GAAIK,GAAQA,EAAKzB,SAASd,EAAKwC,KAC7B,MAAM,IAAIf,MACR,IAAMS,EAAO,uCAAyClC,EAAKwC,IAAM,IAGvE,CAYA,SAASxB,EAAeuB,EAAML,GAC5B,IAAKK,EACH,MAAM,IAAId,MAAM,IAAMS,EAAO,oBAEjC,CAYA,SAASf,EAAWnB,EAAMkC,GACxB,IAAKlC,EACH,MAAM,IAAIyB,MAAM,YAAcS,EAAO,kCAEzC"}

package/dist/node_modules/vfile/lib/minpath.browser.js

@@ -1,2 +0,0 @@
-const e={basename:function(e,n){if(void 0!==n&&"string"!=typeof n)throw new TypeError('"ext" argument must be a string');t(e);let r,i=0,l=-1,o=e.length;if(void 0===n||0===n.length||n.length>e.length){for(;o--;)if(47===e.charCodeAt(o)){if(r){i=o+1;break}}else l<0&&(r=!0,l=o+1);return l<0?"":e.slice(i,l)}if(n===e)return"";let f=-1,h=n.length-1;for(;o--;)if(47===e.charCodeAt(o)){if(r){i=o+1;break}}else f<0&&(r=!0,f=o+1),h>-1&&(e.charCodeAt(o)===n.charCodeAt(h--)?h<0&&(l=o):(h=-1,l=f));i===l?l=f:l<0&&(l=e.length);return e.slice(i,l)},dirname:function(e){if(t(e),0===e.length)return".";let n,r=-1,i=e.length;for(;--i;)if(47===e.charCodeAt(i)){if(n){r=i;break}}else n||(n=!0);return r<0?47===e.charCodeAt(0)?"/":".":1===r&&47===e.charCodeAt(0)?"//":e.slice(0,r)},extname:function(e){t(e);let n,r=e.length,i=-1,l=0,o=-1,f=0;for(;r--;){const t=e.charCodeAt(r);if(47!==t)i<0&&(n=!0,i=r+1),46===t?o<0?o=r:1!==f&&(f=1):o>-1&&(f=-1);else if(n){l=r+1;break}}if(o<0||i<0||0===f||1===f&&o===i-1&&o===l+1)return"";return e.slice(o,i)},join:function(...e){let n,r=-1;for(;++r<e.length;)t(e[r]),e[r]&&(n=void 0===n?e[r]:n+"/"+e[r]);return void 0===n?".":function(e){t(e);const n=47===e.charCodeAt(0);let r=function(e,t){let n,r,i="",l=0,o=-1,f=0,h=-1;for(;++h<=e.length;){if(h<e.length)n=e.charCodeAt(h);else{if(47===n)break;n=47}if(47===n){if(o===h-1||1===f);else if(o!==h-1&&2===f){if(i.length<2||2!==l||46!==i.charCodeAt(i.length-1)||46!==i.charCodeAt(i.length-2))if(i.length>2){if(r=i.lastIndexOf("/"),r!==i.length-1){r<0?(i="",l=0):(i=i.slice(0,r),l=i.length-1-i.lastIndexOf("/")),o=h,f=0;continue}}else if(i.length>0){i="",l=0,o=h,f=0;continue}t&&(i=i.length>0?i+"/..":"..",l=2)}else i.length>0?i+="/"+e.slice(o+1,h):i=e.slice(o+1,h),l=h-o-1;o=h,f=0}else 46===n&&f>-1?f++:f=-1}return i}(e,!n);0!==r.length||n||(r=".");r.length>0&&47===e.charCodeAt(e.length-1)&&(r+="/");return n?"/"+r:r}(n)},sep:"/"};function t(e){if("string"!=typeof e)throw new TypeError("Path must be a string. Received "+JSON.stringify(e))}export{e as path};
-//# sourceMappingURL=minpath.browser.js.map