@e-llm-studio/instant-learning 0.0.149 → 0.0.151

package/dist/node_modules/hast-util-from-parse5/node_modules/comma-separated-tokens/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/hast-util-from-parse5/node_modules/comma-separated-tokens/index.js"],"sourcesContent":["/**\n * @typedef Options\n *   Configuration for `stringify`.\n * @property {boolean} [padLeft=true]\n *   Whether to pad a space before a token.\n * @property {boolean} [padRight=false]\n *   Whether to pad a space after a token.\n */\n\n/**\n * @typedef {Options} StringifyOptions\n *   Please use `StringifyOptions` instead.\n */\n\n/**\n * Parse comma-separated tokens to an array.\n *\n * @param {string} value\n *   Comma-separated tokens.\n * @returns {Array<string>}\n *   List of tokens.\n */\nexport function parse(value) {\n  /** @type {Array<string>} */\n  const tokens = []\n  const input = String(value || '')\n  let index = input.indexOf(',')\n  let start = 0\n  /** @type {boolean} */\n  let end = false\n\n  while (!end) {\n    if (index === -1) {\n      index = input.length\n      end = true\n    }\n\n    const token = input.slice(start, index).trim()\n\n    if (token || !end) {\n      tokens.push(token)\n    }\n\n    start = index + 1\n    index = input.indexOf(',', start)\n  }\n\n  return tokens\n}\n\n/**\n * Serialize an array of strings or numbers to comma-separated tokens.\n *\n * @param {Array<string|number>} values\n *   List of tokens.\n * @param {Options} [options]\n *   Configuration for `stringify` (optional).\n * @returns {string}\n *   Comma-separated tokens.\n */\nexport function stringify(values, options) {\n  const settings = options || {}\n\n  // Ensure the last empty entry is seen.\n  const input = values[values.length - 1] === '' ? [...values, ''] : values\n\n  return input\n    .join(\n      (settings.padRight ? ' ' : '') +\n        ',' +\n        (settings.padLeft === false ? '' : ' ')\n    )\n    .trim()\n}\n"],"names":["parse","value","tokens","input","String","index","indexOf","start","end","length","token","slice","trim","push"],"mappings":"AAsBO,SAASA,EAAMC,GAEpB,MAAMC,EAAS,GACTC,EAAQC,OAAOH,GAAS,IAC9B,IAAII,EAAQF,EAAMG,QAAQ,KACtBC,EAAQ,EAERC,GAAM,EAEV,MAAQA,GAAK,EACI,IAAXH,IACFA,EAAQF,EAAMM,OACdD,GAAM,GAGR,MAAME,EAAQP,EAAMQ,MAAMJ,EAAOF,GAAOO,QAEpCF,GAAUF,GACZN,EAAOW,KAAKH,GAGdH,EAAQF,EAAQ,EAChBA,EAAQF,EAAMG,QAAQ,IAAKC,EAC5B,CAED,OAAOL,CACT"}

package/dist/node_modules/hast-util-from-parse5/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):[]}export{t as parse};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/hast-util-from-parse5/node_modules/space-separated-tokens/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/hast-util-from-parse5/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"],"mappings":"AAQO,SAASA,EAAMC,GACpB,MAAMC,EAAQC,OAAOF,GAAS,IAAIG,OAClC,OAAOF,EAAQA,EAAMG,MAAM,iBAAmB,EAChD"}

package/dist/node_modules/hast-util-raw/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/hast-util-raw/node_modules/unist-util-position/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/hast-util-raw/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/hast-util-to-parse5/node_modules/comma-separated-tokens/index.js

@@ -1,2 +0,0 @@
-function t(t,n){const e=n||{};return(""===t[t.length-1]?[...t,""]:t).join((e.padRight?" ":"")+","+(!1===e.padLeft?"":" ")).trim()}export{t as stringify};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/hast-util-to-parse5/node_modules/comma-separated-tokens/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/hast-util-to-parse5/node_modules/comma-separated-tokens/index.js"],"sourcesContent":["/**\n * @typedef Options\n *   Configuration for `stringify`.\n * @property {boolean} [padLeft=true]\n *   Whether to pad a space before a token.\n * @property {boolean} [padRight=false]\n *   Whether to pad a space after a token.\n */\n\n/**\n * @typedef {Options} StringifyOptions\n *   Please use `StringifyOptions` instead.\n */\n\n/**\n * Parse comma-separated tokens to an array.\n *\n * @param {string} value\n *   Comma-separated tokens.\n * @returns {Array<string>}\n *   List of tokens.\n */\nexport function parse(value) {\n  /** @type {Array<string>} */\n  const tokens = []\n  const input = String(value || '')\n  let index = input.indexOf(',')\n  let start = 0\n  /** @type {boolean} */\n  let end = false\n\n  while (!end) {\n    if (index === -1) {\n      index = input.length\n      end = true\n    }\n\n    const token = input.slice(start, index).trim()\n\n    if (token || !end) {\n      tokens.push(token)\n    }\n\n    start = index + 1\n    index = input.indexOf(',', start)\n  }\n\n  return tokens\n}\n\n/**\n * Serialize an array of strings or numbers to comma-separated tokens.\n *\n * @param {Array<string|number>} values\n *   List of tokens.\n * @param {Options} [options]\n *   Configuration for `stringify` (optional).\n * @returns {string}\n *   Comma-separated tokens.\n */\nexport function stringify(values, options) {\n  const settings = options || {}\n\n  // Ensure the last empty entry is seen.\n  const input = values[values.length - 1] === '' ? [...values, ''] : values\n\n  return input\n    .join(\n      (settings.padRight ? ' ' : '') +\n        ',' +\n        (settings.padLeft === false ? '' : ' ')\n    )\n    .trim()\n}\n"],"names":["stringify","values","options","settings","length","join","padRight","padLeft","trim"],"mappings":"AA4DO,SAASA,EAAUC,EAAQC,GAChC,MAAMC,EAAWD,GAAW,CAAE,EAK9B,OAF4C,KAA9BD,EAAOA,EAAOG,OAAS,GAAY,IAAIH,EAAQ,IAAMA,GAGhEI,MACEF,EAASG,SAAW,IAAM,IACzB,MACsB,IAArBH,EAASI,QAAoB,GAAK,MAEtCC,MACL"}

package/dist/node_modules/hast-util-to-parse5/node_modules/space-separated-tokens/index.js

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

package/dist/node_modules/hast-util-to-parse5/node_modules/space-separated-tokens/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/hast-util-to-parse5/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":["stringify","values","join","trim"],"mappings":"AAqBO,SAASA,EAAUC,GACxB,OAAOA,EAAOC,KAAK,KAAKC,MAC1B"}

package/dist/node_modules/mdast-util-definitions/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/mdast-util-definitions/node_modules/unist-util-is/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/mdast-util-definitions/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/mdast-util-definitions/node_modules/unist-util-visit/lib/index.js

@@ -1,2 +0,0 @@
-import{visitParents as n}from"../../unist-util-visit-parents/lib/index.js";export{CONTINUE,EXIT,SKIP}from"../../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/mdast-util-definitions/node_modules/unist-util-visit/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/mdast-util-definitions/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":"uJA8IY,MAACA,EAOb,SAQcC,EAAMC,EAAMC,EAASC,GACT,mBAATF,GAA0C,mBAAZC,IACvCC,EAAUD,EACVA,EAAUD,EACVA,EAAO,MAGTG,EAAaJ,EAAMC,GAMnB,SAAkBI,EAAMC,GACtB,MAAMC,EAASD,EAAQA,EAAQE,OAAS,GACxC,OAAON,EACLG,EACAE,EAASA,EAAOE,SAASC,QAAQL,GAAQ,KACzCE,EAEH,GAbkCJ,EAezC"}

package/dist/node_modules/mdast-util-definitions/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/mdast-util-definitions/node_modules/unist-util-visit-parents/lib/color.browser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"color.browser.js","sources":["../../../../../../node_modules/mdast-util-definitions/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/mdast-util-definitions/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/mdast-util-definitions/node_modules/unist-util-visit-parents/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/mdast-util-definitions/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/mdast-util-find-and-replace/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/mdast-util-find-and-replace/node_modules/unist-util-is/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/mdast-util-find-and-replace/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/mdast-util-find-and-replace/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/mdast-util-find-and-replace/node_modules/unist-util-visit-parents/lib/color.browser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"color.browser.js","sources":["../../../../../../node_modules/mdast-util-find-and-replace/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/mdast-util-find-and-replace/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/mdast-util-find-and-replace/node_modules/unist-util-visit-parents/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/mdast-util-find-and-replace/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/mdast-util-from-markdown/node_modules/unist-util-stringify-position/lib/index.js

@@ -1,2 +0,0 @@
-function n(n){return n&&"object"==typeof n?"position"in n||"type"in n?i(n.position):"start"in n||"end"in n?i(n):"line"in n||"column"in n?t(n):"":""}function t(n){return e(n&&n.line)+":"+e(n&&n.column)}function i(n){return t(n&&n.start)+"-"+t(n&&n.end)}function e(n){return n&&"number"==typeof n?n:1}export{n as stringifyPosition};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/mdast-util-from-markdown/node_modules/unist-util-stringify-position/lib/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/mdast-util-from-markdown/node_modules/unist-util-stringify-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 * Serialize the positional info of a point, position (start and end points),\n * or node.\n *\n * @param {Node | NodeLike | Position | PositionLike | Point | PointLike | null | undefined} [value]\n *   Node, position, or point.\n * @returns {string}\n *   Pretty printed positional info of a node (`string`).\n *\n *   In the format of a range `ls:cs-le:ce` (when given `node` or `position`)\n *   or a point `l:c` (when given `point`), where `l` stands for line, `c` for\n *   column, `s` for `start`, and `e` for end.\n *   An empty string (`''`) is returned if the given value is neither `node`,\n *   `position`, nor `point`.\n */\nexport function stringifyPosition(value) {\n  // Nothing.\n  if (!value || typeof value !== 'object') {\n    return ''\n  }\n\n  // Node.\n  if ('position' in value || 'type' in value) {\n    return position(value.position)\n  }\n\n  // Position.\n  if ('start' in value || 'end' in value) {\n    return position(value)\n  }\n\n  // Point.\n  if ('line' in value || 'column' in value) {\n    return point(value)\n  }\n\n  // ?\n  return ''\n}\n\n/**\n * @param {Point | PointLike | null | undefined} point\n * @returns {string}\n */\nfunction point(point) {\n  return index(point && point.line) + ':' + index(point && point.column)\n}\n\n/**\n * @param {Position | PositionLike | null | undefined} pos\n * @returns {string}\n */\nfunction position(pos) {\n  return point(pos && pos.start) + '-' + point(pos && pos.end)\n}\n\n/**\n * @param {number | null | undefined} value\n * @returns {number}\n */\nfunction index(value) {\n  return value && typeof value === 'number' ? value : 1\n}\n"],"names":["stringifyPosition","value","position","point","index","line","column","pos","start","end"],"mappings":"AAoCO,SAASA,EAAkBC,GAEhC,OAAKA,GAA0B,iBAAVA,EAKjB,aAAcA,GAAS,SAAUA,EAC5BC,EAASD,EAAMC,UAIpB,UAAWD,GAAS,QAASA,EACxBC,EAASD,GAId,SAAUA,GAAS,WAAYA,EAC1BE,EAAMF,GAIR,GAnBE,EAoBX,CAMA,SAASE,EAAMA,GACb,OAAOC,EAAMD,GAASA,EAAME,MAAQ,IAAMD,EAAMD,GAASA,EAAMG,OACjE,CAMA,SAASJ,EAASK,GAChB,OAAOJ,EAAMI,GAAOA,EAAIC,OAAS,IAAML,EAAMI,GAAOA,EAAIE,IAC1D,CAMA,SAASL,EAAMH,GACb,OAAOA,GAA0B,iBAAVA,EAAqBA,EAAQ,CACtD"}

package/dist/node_modules/mdast-util-to-hast/lib/footer.js

@@ -1,2 +0,0 @@
-import{normalizeUri as e}from"../node_modules/micromark-util-sanitize-uri/index.js";function t(t){const o=[];let n=-1;for(;++n<t.footnoteOrder.length;){const a=t.footnoteById[t.footnoteOrder[n]];if(!a)continue;const r=t.all(a),l=String(a.identifier).toUpperCase(),i=e(l.toLowerCase());let p=0;const s=[];for(;++p<=t.footnoteCounts[l];){const e={type:"element",tagName:"a",properties:{href:"#"+t.clobberPrefix+"fnref-"+i+(p>1?"-"+p:""),dataFootnoteBackref:!0,className:["data-footnote-backref"],ariaLabel:t.footnoteBackLabel},children:[{type:"text",value:"↩"}]};p>1&&e.children.push({type:"element",tagName:"sup",children:[{type:"text",value:String(p)}]}),s.length>0&&s.push({type:"text",value:" "}),s.push(e)}const c=r[r.length-1];if(c&&"element"===c.type&&"p"===c.tagName){const e=c.children[c.children.length-1];e&&"text"===e.type?e.value+=" ":c.children.push({type:"text",value:" "}),c.children.push(...s)}else r.push(...s);const f={type:"element",tagName:"li",properties:{id:t.clobberPrefix+"fn-"+i},children:t.wrap(r,!0)};t.patch(a,f),o.push(f)}if(0!==o.length)return{type:"element",tagName:"section",properties:{dataFootnotes:!0,className:["footnotes"]},children:[{type:"element",tagName:t.footnoteLabelTagName,properties:{...JSON.parse(JSON.stringify(t.footnoteLabelProperties)),id:"footnote-label"},children:[{type:"text",value:t.footnoteLabel}]},{type:"text",value:"\n"},{type:"element",tagName:"ol",properties:{},children:t.wrap(o,!0)},{type:"text",value:"\n"}]}}export{t as footer};
-//# sourceMappingURL=footer.js.map

package/dist/node_modules/mdast-util-to-hast/lib/footer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"footer.js","sources":["../../../../node_modules/mdast-util-to-hast/lib/footer.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n *\n * @typedef {import('./state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\n\n/**\n * Generate a hast footer for called footnote definitions.\n *\n * @param {State} state\n *   Info passed around.\n * @returns {Element | undefined}\n *   `section` element or `undefined`.\n */\nexport function footer(state) {\n  /** @type {Array<ElementContent>} */\n  const listItems = []\n  let index = -1\n\n  while (++index < state.footnoteOrder.length) {\n    const def = state.footnoteById[state.footnoteOrder[index]]\n\n    if (!def) {\n      continue\n    }\n\n    const content = state.all(def)\n    const id = String(def.identifier).toUpperCase()\n    const safeId = normalizeUri(id.toLowerCase())\n    let referenceIndex = 0\n    /** @type {Array<ElementContent>} */\n    const backReferences = []\n\n    while (++referenceIndex <= state.footnoteCounts[id]) {\n      /** @type {Element} */\n      const backReference = {\n        type: 'element',\n        tagName: 'a',\n        properties: {\n          href:\n            '#' +\n            state.clobberPrefix +\n            'fnref-' +\n            safeId +\n            (referenceIndex > 1 ? '-' + referenceIndex : ''),\n          dataFootnoteBackref: true,\n          className: ['data-footnote-backref'],\n          ariaLabel: state.footnoteBackLabel\n        },\n        children: [{type: 'text', value: '↩'}]\n      }\n\n      if (referenceIndex > 1) {\n        backReference.children.push({\n          type: 'element',\n          tagName: 'sup',\n          children: [{type: 'text', value: String(referenceIndex)}]\n        })\n      }\n\n      if (backReferences.length > 0) {\n        backReferences.push({type: 'text', value: ' '})\n      }\n\n      backReferences.push(backReference)\n    }\n\n    const tail = content[content.length - 1]\n\n    if (tail && tail.type === 'element' && tail.tagName === 'p') {\n      const tailTail = tail.children[tail.children.length - 1]\n      if (tailTail && tailTail.type === 'text') {\n        tailTail.value += ' '\n      } else {\n        tail.children.push({type: 'text', value: ' '})\n      }\n\n      tail.children.push(...backReferences)\n    } else {\n      content.push(...backReferences)\n    }\n\n    /** @type {Element} */\n    const listItem = {\n      type: 'element',\n      tagName: 'li',\n      properties: {id: state.clobberPrefix + 'fn-' + safeId},\n      children: state.wrap(content, true)\n    }\n\n    state.patch(def, listItem)\n\n    listItems.push(listItem)\n  }\n\n  if (listItems.length === 0) {\n    return\n  }\n\n  return {\n    type: 'element',\n    tagName: 'section',\n    properties: {dataFootnotes: true, className: ['footnotes']},\n    children: [\n      {\n        type: 'element',\n        tagName: state.footnoteLabelTagName,\n        properties: {\n          // To do: use structured clone.\n          ...JSON.parse(JSON.stringify(state.footnoteLabelProperties)),\n          id: 'footnote-label'\n        },\n        children: [{type: 'text', value: state.footnoteLabel}]\n      },\n      {type: 'text', value: '\\n'},\n      {\n        type: 'element',\n        tagName: 'ol',\n        properties: {},\n        children: state.wrap(listItems, true)\n      },\n      {type: 'text', value: '\\n'}\n    ]\n  }\n}\n"],"names":["footer","state","listItems","index","footnoteOrder","length","def","footnoteById","content","all","id","String","identifier","toUpperCase","safeId","normalizeUri","toLowerCase","referenceIndex","backReferences","footnoteCounts","backReference","type","tagName","properties","href","clobberPrefix","dataFootnoteBackref","className","ariaLabel","footnoteBackLabel","children","value","push","tail","tailTail","listItem","wrap","patch","dataFootnotes","footnoteLabelTagName","JSON","parse","stringify","footnoteLabelProperties","footnoteLabel"],"mappings":"oFAiBO,SAASA,EAAOC,GAErB,MAAMC,EAAY,GAClB,IAAIC,GAAS,EAEb,OAASA,EAAQF,EAAMG,cAAcC,QAAQ,CAC3C,MAAMC,EAAML,EAAMM,aAAaN,EAAMG,cAAcD,IAEnD,IAAKG,EACH,SAGF,MAAME,EAAUP,EAAMQ,IAAIH,GACpBI,EAAKC,OAAOL,EAAIM,YAAYC,cAC5BC,EAASC,EAAaL,EAAGM,eAC/B,IAAIC,EAAiB,EAErB,MAAMC,EAAiB,GAEvB,OAASD,GAAkBhB,EAAMkB,eAAeT,IAAK,CAEnD,MAAMU,EAAgB,CACpBC,KAAM,UACNC,QAAS,IACTC,WAAY,CACVC,KACE,IACAvB,EAAMwB,cACN,SACAX,GACCG,EAAiB,EAAI,IAAMA,EAAiB,IAC/CS,qBAAqB,EACrBC,UAAW,CAAC,yBACZC,UAAW3B,EAAM4B,mBAEnBC,SAAU,CAAC,CAACT,KAAM,OAAQU,MAAO,OAG/Bd,EAAiB,GACnBG,EAAcU,SAASE,KAAK,CAC1BX,KAAM,UACNC,QAAS,MACTQ,SAAU,CAAC,CAACT,KAAM,OAAQU,MAAOpB,OAAOM,OAIxCC,EAAeb,OAAS,GAC1Ba,EAAec,KAAK,CAACX,KAAM,OAAQU,MAAO,MAG5Cb,EAAec,KAAKZ,EACrB,CAED,MAAMa,EAAOzB,EAAQA,EAAQH,OAAS,GAEtC,GAAI4B,GAAsB,YAAdA,EAAKZ,MAAuC,MAAjBY,EAAKX,QAAiB,CAC3D,MAAMY,EAAWD,EAAKH,SAASG,EAAKH,SAASzB,OAAS,GAClD6B,GAA8B,SAAlBA,EAASb,KACvBa,EAASH,OAAS,IAElBE,EAAKH,SAASE,KAAK,CAACX,KAAM,OAAQU,MAAO,MAG3CE,EAAKH,SAASE,QAAQd,EAC5B,MACMV,EAAQwB,QAAQd,GAIlB,MAAMiB,EAAW,CACfd,KAAM,UACNC,QAAS,KACTC,WAAY,CAACb,GAAIT,EAAMwB,cAAgB,MAAQX,GAC/CgB,SAAU7B,EAAMmC,KAAK5B,GAAS,IAGhCP,EAAMoC,MAAM/B,EAAK6B,GAEjBjC,EAAU8B,KAAKG,EAChB,CAED,GAAyB,IAArBjC,EAAUG,OAId,MAAO,CACLgB,KAAM,UACNC,QAAS,UACTC,WAAY,CAACe,eAAe,EAAMX,UAAW,CAAC,cAC9CG,SAAU,CACR,CACET,KAAM,UACNC,QAASrB,EAAMsC,qBACfhB,WAAY,IAEPiB,KAAKC,MAAMD,KAAKE,UAAUzC,EAAM0C,0BACnCjC,GAAI,kBAENoB,SAAU,CAAC,CAACT,KAAM,OAAQU,MAAO9B,EAAM2C,iBAEzC,CAACvB,KAAM,OAAQU,MAAO,MACtB,CACEV,KAAM,UACNC,QAAS,KACTC,WAAY,CAAE,EACdO,SAAU7B,EAAMmC,KAAKlC,GAAW,IAElC,CAACmB,KAAM,OAAQU,MAAO,OAG5B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/blockquote.js

@@ -1,2 +0,0 @@
-function e(e,t){const a={type:"element",tagName:"blockquote",properties:{},children:e.wrap(e.all(t),!0)};return e.patch(t,a),e.applyData(t,a)}export{e as blockquote};
-//# sourceMappingURL=blockquote.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/blockquote.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"blockquote.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/blockquote.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Blockquote} Blockquote\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `blockquote` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Blockquote} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function blockquote(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'blockquote',\n    properties: {},\n    children: state.wrap(state.all(node), true)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["blockquote","state","node","result","type","tagName","properties","children","wrap","all","patch","applyData"],"mappings":"AAgBO,SAASA,EAAWC,EAAOC,GAEhC,MAAMC,EAAS,CACbC,KAAM,UACNC,QAAS,aACTC,WAAY,CAAE,EACdC,SAAUN,EAAMO,KAAKP,EAAMQ,IAAIP,IAAO,IAGxC,OADAD,EAAMS,MAAMR,EAAMC,GACXF,EAAMU,UAAUT,EAAMC,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/break.js

@@ -1,2 +0,0 @@
-function e(e,t){const p={type:"element",tagName:"br",properties:{},children:[]};return e.patch(t,p),[e.applyData(t,p),{type:"text",value:"\n"}]}export{e as hardBreak};
-//# sourceMappingURL=break.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/break.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"break.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/break.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Text} Text\n * @typedef {import('mdast').Break} Break\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `break` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Break} node\n *   mdast node.\n * @returns {Array<Element | Text>}\n *   hast element content.\n */\nexport function hardBreak(state, node) {\n  /** @type {Element} */\n  const result = {type: 'element', tagName: 'br', properties: {}, children: []}\n  state.patch(node, result)\n  return [state.applyData(node, result), {type: 'text', value: '\\n'}]\n}\n"],"names":["hardBreak","state","node","result","type","tagName","properties","children","patch","applyData","value"],"mappings":"AAiBO,SAASA,EAAUC,EAAOC,GAE/B,MAAMC,EAAS,CAACC,KAAM,UAAWC,QAAS,KAAMC,WAAY,CAAA,EAAIC,SAAU,IAE1E,OADAN,EAAMO,MAAMN,EAAMC,GACX,CAACF,EAAMQ,UAAUP,EAAMC,GAAS,CAACC,KAAM,OAAQM,MAAO,MAC/D"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/code.js

@@ -1,2 +0,0 @@
-function e(e,t){const a=t.value?t.value+"\n":"",l=t.lang?t.lang.match(/^[^ \t]+(?=[ \t]|$)/):null,n={};l&&(n.className=["language-"+l]);let p={type:"element",tagName:"code",properties:n,children:[{type:"text",value:a}]};return t.meta&&(p.data={meta:t.meta}),e.patch(t,p),p=e.applyData(t,p),p={type:"element",tagName:"pre",properties:{},children:[p]},e.patch(t,p),p}export{e as code};
-//# sourceMappingURL=code.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/code.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"code.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/code.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').Code} Code\n * @typedef {import('../state.js').State} State\n\n */\n\n/**\n * Turn an mdast `code` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Code} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function code(state, node) {\n  const value = node.value ? node.value + '\\n' : ''\n  // To do: next major, use `node.lang` w/o regex, the splitting’s been going\n  // on for years in remark now.\n  const lang = node.lang ? node.lang.match(/^[^ \\t]+(?=[ \\t]|$)/) : null\n  /** @type {Properties} */\n  const properties = {}\n\n  if (lang) {\n    properties.className = ['language-' + lang]\n  }\n\n  // Create `<code>`.\n  /** @type {Element} */\n  let result = {\n    type: 'element',\n    tagName: 'code',\n    properties,\n    children: [{type: 'text', value}]\n  }\n\n  if (node.meta) {\n    result.data = {meta: node.meta}\n  }\n\n  state.patch(node, result)\n  result = state.applyData(node, result)\n\n  // Create `<pre>`.\n  result = {type: 'element', tagName: 'pre', properties: {}, children: [result]}\n  state.patch(node, result)\n  return result\n}\n"],"names":["code","state","node","value","lang","match","properties","className","result","type","tagName","children","meta","data","patch","applyData"],"mappings":"AAkBO,SAASA,EAAKC,EAAOC,GAC1B,MAAMC,EAAQD,EAAKC,MAAQD,EAAKC,MAAQ,KAAO,GAGzCC,EAAOF,EAAKE,KAAOF,EAAKE,KAAKC,MAAM,uBAAyB,KAE5DC,EAAa,CAAE,EAEjBF,IACFE,EAAWC,UAAY,CAAC,YAAcH,IAKxC,IAAII,EAAS,CACXC,KAAM,UACNC,QAAS,OACTJ,aACAK,SAAU,CAAC,CAACF,KAAM,OAAQN,WAa5B,OAVID,EAAKU,OACPJ,EAAOK,KAAO,CAACD,KAAMV,EAAKU,OAG5BX,EAAMa,MAAMZ,EAAMM,GAClBA,EAASP,EAAMc,UAAUb,EAAMM,GAG/BA,EAAS,CAACC,KAAM,UAAWC,QAAS,MAAOJ,WAAY,GAAIK,SAAU,CAACH,IACtEP,EAAMa,MAAMZ,EAAMM,GACXA,CACT"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/delete.js

@@ -1,2 +0,0 @@
-function e(e,t){const a={type:"element",tagName:"del",properties:{},children:e.all(t)};return e.patch(t,a),e.applyData(t,a)}export{e as strikethrough};
-//# sourceMappingURL=delete.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/delete.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"delete.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/delete.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Delete} Delete\n * @typedef {import('../state.js').State} State\n\n */\n\n/**\n * Turn an mdast `delete` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Delete} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function strikethrough(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'del',\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["strikethrough","state","node","result","type","tagName","properties","children","all","patch","applyData"],"mappings":"AAiBO,SAASA,EAAcC,EAAOC,GAEnC,MAAMC,EAAS,CACbC,KAAM,UACNC,QAAS,MACTC,WAAY,CAAE,EACdC,SAAUN,EAAMO,IAAIN,IAGtB,OADAD,EAAMQ,MAAMP,EAAMC,GACXF,EAAMS,UAAUR,EAAMC,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/emphasis.js

@@ -1,2 +0,0 @@
-function e(e,t){const a={type:"element",tagName:"em",properties:{},children:e.all(t)};return e.patch(t,a),e.applyData(t,a)}export{e as emphasis};
-//# sourceMappingURL=emphasis.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/emphasis.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"emphasis.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/emphasis.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Emphasis} Emphasis\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `emphasis` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Emphasis} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function emphasis(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'em',\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["emphasis","state","node","result","type","tagName","properties","children","all","patch","applyData"],"mappings":"AAgBO,SAASA,EAASC,EAAOC,GAE9B,MAAMC,EAAS,CACbC,KAAM,UACNC,QAAS,KACTC,WAAY,CAAE,EACdC,SAAUN,EAAMO,IAAIN,IAGtB,OADAD,EAAMQ,MAAMP,EAAMC,GACXF,EAAMS,UAAUR,EAAMC,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/footnote-reference.js

@@ -1,2 +0,0 @@
-import{normalizeUri as e}from"../../node_modules/micromark-util-sanitize-uri/index.js";function t(t,o){const r=String(o.identifier).toUpperCase(),n=e(r.toLowerCase()),i=t.footnoteOrder.indexOf(r);let a;-1===i?(t.footnoteOrder.push(r),t.footnoteCounts[r]=1,a=t.footnoteOrder.length):(t.footnoteCounts[r]++,a=i+1);const f=t.footnoteCounts[r],p={type:"element",tagName:"a",properties:{href:"#"+t.clobberPrefix+"fn-"+n,id:t.clobberPrefix+"fnref-"+n+(f>1?"-"+f:""),dataFootnoteRef:!0,ariaDescribedBy:["footnote-label"]},children:[{type:"text",value:String(a)}]};t.patch(o,p);const s={type:"element",tagName:"sup",properties:{},children:[p]};return t.patch(o,s),t.applyData(o,s)}export{t as footnoteReference};
-//# sourceMappingURL=footnote-reference.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/footnote-reference.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"footnote-reference.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/footnote-reference.js"],"sourcesContent":["/**\n * @typedef {import('mdast').FootnoteReference} FootnoteReference\n * @typedef {import('hast').Element} Element\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\n\n/**\n * Turn an mdast `footnoteReference` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {FootnoteReference} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function footnoteReference(state, node) {\n  const id = String(node.identifier).toUpperCase()\n  const safeId = normalizeUri(id.toLowerCase())\n  const index = state.footnoteOrder.indexOf(id)\n  /** @type {number} */\n  let counter\n\n  if (index === -1) {\n    state.footnoteOrder.push(id)\n    state.footnoteCounts[id] = 1\n    counter = state.footnoteOrder.length\n  } else {\n    state.footnoteCounts[id]++\n    counter = index + 1\n  }\n\n  const reuseCounter = state.footnoteCounts[id]\n\n  /** @type {Element} */\n  const link = {\n    type: 'element',\n    tagName: 'a',\n    properties: {\n      href: '#' + state.clobberPrefix + 'fn-' + safeId,\n      id:\n        state.clobberPrefix +\n        'fnref-' +\n        safeId +\n        (reuseCounter > 1 ? '-' + reuseCounter : ''),\n      dataFootnoteRef: true,\n      ariaDescribedBy: ['footnote-label']\n    },\n    children: [{type: 'text', value: String(counter)}]\n  }\n  state.patch(node, link)\n\n  /** @type {Element} */\n  const sup = {\n    type: 'element',\n    tagName: 'sup',\n    properties: {},\n    children: [link]\n  }\n  state.patch(node, sup)\n  return state.applyData(node, sup)\n}\n"],"names":["footnoteReference","state","node","id","String","identifier","toUpperCase","safeId","normalizeUri","toLowerCase","index","footnoteOrder","indexOf","counter","push","footnoteCounts","length","reuseCounter","link","type","tagName","properties","href","clobberPrefix","dataFootnoteRef","ariaDescribedBy","children","value","patch","sup","applyData"],"mappings":"uFAkBO,SAASA,EAAkBC,EAAOC,GACvC,MAAMC,EAAKC,OAAOF,EAAKG,YAAYC,cAC7BC,EAASC,EAAaL,EAAGM,eACzBC,EAAQT,EAAMU,cAAcC,QAAQT,GAE1C,IAAIU,GAEW,IAAXH,GACFT,EAAMU,cAAcG,KAAKX,GACzBF,EAAMc,eAAeZ,GAAM,EAC3BU,EAAUZ,EAAMU,cAAcK,SAE9Bf,EAAMc,eAAeZ,KACrBU,EAAUH,EAAQ,GAGpB,MAAMO,EAAehB,EAAMc,eAAeZ,GAGpCe,EAAO,CACXC,KAAM,UACNC,QAAS,IACTC,WAAY,CACVC,KAAM,IAAMrB,EAAMsB,cAAgB,MAAQhB,EAC1CJ,GACEF,EAAMsB,cACN,SACAhB,GACCU,EAAe,EAAI,IAAMA,EAAe,IAC3CO,iBAAiB,EACjBC,gBAAiB,CAAC,mBAEpBC,SAAU,CAAC,CAACP,KAAM,OAAQQ,MAAOvB,OAAOS,MAE1CZ,EAAM2B,MAAM1B,EAAMgB,GAGlB,MAAMW,EAAM,CACVV,KAAM,UACNC,QAAS,MACTC,WAAY,CAAE,EACdK,SAAU,CAACR,IAGb,OADAjB,EAAM2B,MAAM1B,EAAM2B,GACX5B,EAAM6B,UAAU5B,EAAM2B,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/footnote.js

@@ -1,2 +0,0 @@
-import{footnoteReference as o}from"./footnote-reference.js";function e(e,t){const i=e.footnoteById;let n=1;for(;n in i;)n++;const r=String(n);return i[r]={type:"footnoteDefinition",identifier:r,children:[{type:"paragraph",children:t.children}],position:t.position},o(e,{type:"footnoteReference",identifier:r,position:t.position})}export{e as footnote};
-//# sourceMappingURL=footnote.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/footnote.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"footnote.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/footnote.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Footnote} Footnote\n * @typedef {import('../state.js').State} State\n */\n\nimport {footnoteReference} from './footnote-reference.js'\n\n// To do: when both:\n// * <https://github.com/micromark/micromark-extension-footnote>\n// * <https://github.com/syntax-tree/mdast-util-footnote>\n// …are archived, remove this (also from mdast).\n// These inline notes are not used in GFM.\n\n/**\n * Turn an mdast `footnote` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Footnote} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function footnote(state, node) {\n  const footnoteById = state.footnoteById\n  let no = 1\n\n  while (no in footnoteById) no++\n\n  const identifier = String(no)\n\n  footnoteById[identifier] = {\n    type: 'footnoteDefinition',\n    identifier,\n    children: [{type: 'paragraph', children: node.children}],\n    position: node.position\n  }\n\n  return footnoteReference(state, {\n    type: 'footnoteReference',\n    identifier,\n    position: node.position\n  })\n}\n"],"names":["footnote","state","node","footnoteById","no","identifier","String","type","children","position","footnoteReference"],"mappings":"4DAwBO,SAASA,EAASC,EAAOC,GAC9B,MAAMC,EAAeF,EAAME,aAC3B,IAAIC,EAAK,EAET,KAAOA,KAAMD,GAAcC,IAE3B,MAAMC,EAAaC,OAAOF,GAS1B,OAPAD,EAAaE,GAAc,CACzBE,KAAM,qBACNF,aACAG,SAAU,CAAC,CAACD,KAAM,YAAaC,SAAUN,EAAKM,WAC9CC,SAAUP,EAAKO,UAGVC,EAAkBT,EAAO,CAC9BM,KAAM,oBACNF,aACAI,SAAUP,EAAKO,UAEnB"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/heading.js

@@ -1,2 +0,0 @@
-function e(e,t){const p={type:"element",tagName:"h"+t.depth,properties:{},children:e.all(t)};return e.patch(t,p),e.applyData(t,p)}export{e as heading};
-//# sourceMappingURL=heading.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/heading.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"heading.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/heading.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Heading} Heading\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `heading` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Heading} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function heading(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'h' + node.depth,\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["heading","state","node","result","type","tagName","depth","properties","children","all","patch","applyData"],"mappings":"AAgBO,SAASA,EAAQC,EAAOC,GAE7B,MAAMC,EAAS,CACbC,KAAM,UACNC,QAAS,IAAMH,EAAKI,MACpBC,WAAY,CAAE,EACdC,SAAUP,EAAMQ,IAAIP,IAGtB,OADAD,EAAMS,MAAMR,EAAMC,GACXF,EAAMU,UAAUT,EAAMC,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/html.js

@@ -1,2 +0,0 @@
-function a(a,t){if(a.dangerous){const e={type:"raw",value:t.value};return a.patch(t,e),a.applyData(t,e)}return null}export{a as html};
-//# sourceMappingURL=html.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/html.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"html.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/html.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').HTML} Html\n * @typedef {import('../state.js').State} State\n * @typedef {import('../../index.js').Raw} Raw\n */\n\n/**\n * Turn an mdast `html` node into hast (`raw` node in dangerous mode, otherwise\n * nothing).\n *\n * @param {State} state\n *   Info passed around.\n * @param {Html} node\n *   mdast node.\n * @returns {Raw | Element | null}\n *   hast node.\n */\nexport function html(state, node) {\n  if (state.dangerous) {\n    /** @type {Raw} */\n    const result = {type: 'raw', value: node.value}\n    state.patch(node, result)\n    return state.applyData(node, result)\n  }\n\n  // To do: next major: return `undefined`.\n  return null\n}\n"],"names":["html","state","node","dangerous","result","type","value","patch","applyData"],"mappings":"AAkBO,SAASA,EAAKC,EAAOC,GAC1B,GAAID,EAAME,UAAW,CAEnB,MAAMC,EAAS,CAACC,KAAM,MAAOC,MAAOJ,EAAKI,OAEzC,OADAL,EAAMM,MAAML,EAAME,GACXH,EAAMO,UAAUN,EAAME,EAC9B,CAGD,OAAO,IACT"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/image-reference.js

@@ -1,2 +0,0 @@
-import{normalizeUri as t}from"../../node_modules/micromark-util-sanitize-uri/index.js";import{revert as e}from"../revert.js";function i(i,r){const n=i.definition(r.identifier);if(!n)return e(i,r);const o={src:t(n.url||""),alt:r.alt};null!==n.title&&void 0!==n.title&&(o.title=n.title);const l={type:"element",tagName:"img",properties:o,children:[]};return i.patch(r,l),i.applyData(r,l)}export{i as imageReference};
-//# sourceMappingURL=image-reference.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/image-reference.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"image-reference.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/image-reference.js"],"sourcesContent":["/**\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').ImageReference} ImageReference\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\nimport {revert} from '../revert.js'\n\n/**\n * Turn an mdast `imageReference` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {ImageReference} node\n *   mdast node.\n * @returns {ElementContent | Array<ElementContent>}\n *   hast node.\n */\nexport function imageReference(state, node) {\n  const def = state.definition(node.identifier)\n\n  if (!def) {\n    return revert(state, node)\n  }\n\n  /** @type {Properties} */\n  const properties = {src: normalizeUri(def.url || ''), alt: node.alt}\n\n  if (def.title !== null && def.title !== undefined) {\n    properties.title = def.title\n  }\n\n  /** @type {Element} */\n  const result = {type: 'element', tagName: 'img', properties, children: []}\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["imageReference","state","node","def","definition","identifier","revert","properties","src","normalizeUri","url","alt","title","undefined","result","type","tagName","children","patch","applyData"],"mappings":"6HAqBO,SAASA,EAAeC,EAAOC,GACpC,MAAMC,EAAMF,EAAMG,WAAWF,EAAKG,YAElC,IAAKF,EACH,OAAOG,EAAOL,EAAOC,GAIvB,MAAMK,EAAa,CAACC,IAAKC,EAAaN,EAAIO,KAAO,IAAKC,IAAKT,EAAKS,KAE9C,OAAdR,EAAIS,YAAgCC,IAAdV,EAAIS,QAC5BL,EAAWK,MAAQT,EAAIS,OAIzB,MAAME,EAAS,CAACC,KAAM,UAAWC,QAAS,MAAOT,aAAYU,SAAU,IAEvE,OADAhB,EAAMiB,MAAMhB,EAAMY,GACXb,EAAMkB,UAAUjB,EAAMY,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/image.js

@@ -1,2 +0,0 @@
-import{normalizeUri as t}from"../../node_modules/micromark-util-sanitize-uri/index.js";function e(e,l){const i={src:t(l.url)};null!==l.alt&&void 0!==l.alt&&(i.alt=l.alt),null!==l.title&&void 0!==l.title&&(i.title=l.title);const r={type:"element",tagName:"img",properties:i,children:[]};return e.patch(l,r),e.applyData(l,r)}export{e as image};
-//# sourceMappingURL=image.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/image.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"image.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/image.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').Image} Image\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\n\n/**\n * Turn an mdast `image` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Image} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function image(state, node) {\n  /** @type {Properties} */\n  const properties = {src: normalizeUri(node.url)}\n\n  if (node.alt !== null && node.alt !== undefined) {\n    properties.alt = node.alt\n  }\n\n  if (node.title !== null && node.title !== undefined) {\n    properties.title = node.title\n  }\n\n  /** @type {Element} */\n  const result = {type: 'element', tagName: 'img', properties, children: []}\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["image","state","node","properties","src","normalizeUri","url","alt","undefined","title","result","type","tagName","children","patch","applyData"],"mappings":"uFAmBO,SAASA,EAAMC,EAAOC,GAE3B,MAAMC,EAAa,CAACC,IAAKC,EAAaH,EAAKI,MAE1B,OAAbJ,EAAKK,UAA6BC,IAAbN,EAAKK,MAC5BJ,EAAWI,IAAML,EAAKK,KAGL,OAAfL,EAAKO,YAAiCD,IAAfN,EAAKO,QAC9BN,EAAWM,MAAQP,EAAKO,OAI1B,MAAMC,EAAS,CAACC,KAAM,UAAWC,QAAS,MAAOT,aAAYU,SAAU,IAEvE,OADAZ,EAAMa,MAAMZ,EAAMQ,GACXT,EAAMc,UAAUb,EAAMQ,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/index.js

@@ -1,2 +0,0 @@
-import{blockquote as o}from"./blockquote.js";import{hardBreak as e}from"./break.js";import{code as r}from"./code.js";import{strikethrough as t}from"./delete.js";import{emphasis as m}from"./emphasis.js";import{footnoteReference as i}from"./footnote-reference.js";import{footnote as f}from"./footnote.js";import{heading as s}from"./heading.js";import{html as n}from"./html.js";import{imageReference as p}from"./image-reference.js";import{image as l}from"./image.js";import{inlineCode as a}from"./inline-code.js";import{linkReference as j}from"./link-reference.js";import{link as c}from"./link.js";import{listItem as b}from"./list-item.js";import{list as g}from"./list.js";import{paragraph as h}from"./paragraph.js";import{root as k}from"./root.js";import{strong as d}from"./strong.js";import{table as u}from"./table.js";import{tableRow as R}from"./table-row.js";import{tableCell as x}from"./table-cell.js";import{text as q}from"./text.js";import{thematicBreak as w}from"./thematic-break.js";const C={blockquote:o,break:e,code:r,delete:t,emphasis:m,footnoteReference:i,footnote:f,heading:s,html:n,imageReference:p,image:l,inlineCode:a,linkReference:j,link:c,listItem:b,list:g,paragraph:h,root:k,strong:d,table:u,tableCell:x,tableRow:R,text:q,thematicBreak:w,toml:y,yaml:y,definition:y,footnoteDefinition:y};function y(){return null}export{C as handlers};
-//# sourceMappingURL=index.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/index.js"],"sourcesContent":["import {blockquote} from './blockquote.js'\nimport {hardBreak} from './break.js'\nimport {code} from './code.js'\nimport {strikethrough} from './delete.js'\nimport {emphasis} from './emphasis.js'\nimport {footnoteReference} from './footnote-reference.js'\nimport {footnote} from './footnote.js'\nimport {heading} from './heading.js'\nimport {html} from './html.js'\nimport {imageReference} from './image-reference.js'\nimport {image} from './image.js'\nimport {inlineCode} from './inline-code.js'\nimport {linkReference} from './link-reference.js'\nimport {link} from './link.js'\nimport {listItem} from './list-item.js'\nimport {list} from './list.js'\nimport {paragraph} from './paragraph.js'\nimport {root} from './root.js'\nimport {strong} from './strong.js'\nimport {table} from './table.js'\nimport {tableRow} from './table-row.js'\nimport {tableCell} from './table-cell.js'\nimport {text} from './text.js'\nimport {thematicBreak} from './thematic-break.js'\n\n/**\n * Default handlers for nodes.\n */\nexport const handlers = {\n  blockquote,\n  break: hardBreak,\n  code,\n  delete: strikethrough,\n  emphasis,\n  footnoteReference,\n  footnote,\n  heading,\n  html,\n  imageReference,\n  image,\n  inlineCode,\n  linkReference,\n  link,\n  listItem,\n  list,\n  paragraph,\n  root,\n  strong,\n  table,\n  tableCell,\n  tableRow,\n  text,\n  thematicBreak,\n  toml: ignore,\n  yaml: ignore,\n  definition: ignore,\n  footnoteDefinition: ignore\n}\n\n// Return nothing for nodes that are ignored.\nfunction ignore() {\n  // To do: next major: return `undefined`.\n  return null\n}\n"],"names":["handlers","blockquote","break","hardBreak","code","delete","strikethrough","emphasis","footnoteReference","footnote","heading","html","imageReference","image","inlineCode","linkReference","link","listItem","list","paragraph","root","strong","table","tableCell","tableRow","text","thematicBreak","toml","ignore","yaml","definition","footnoteDefinition"],"mappings":"69BA4BY,MAACA,EAAW,CACtBC,aACAC,MAAOC,EACPC,OACAC,OAAQC,EACRC,WACAC,oBACAC,WACAC,UACAC,OACAC,iBACAC,QACAC,aACAC,gBACAC,OACAC,WACAC,OACAC,YACAC,OACAC,SACAC,QACAC,YACAC,WACAC,OACAC,gBACAC,KAAMC,EACNC,KAAMD,EACNE,WAAYF,EACZG,mBAAoBH,GAItB,SAASA,IAEP,OAAO,IACT"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/inline-code.js

@@ -1,2 +0,0 @@
-function e(e,t){const a={type:"text",value:t.value.replace(/\r?\n|\r/g," ")};e.patch(t,a);const p={type:"element",tagName:"code",properties:{},children:[a]};return e.patch(t,p),e.applyData(t,p)}export{e as inlineCode};
-//# sourceMappingURL=inline-code.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/inline-code.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"inline-code.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/inline-code.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Text} Text\n * @typedef {import('mdast').InlineCode} InlineCode\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `inlineCode` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {InlineCode} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function inlineCode(state, node) {\n  /** @type {Text} */\n  const text = {type: 'text', value: node.value.replace(/\\r?\\n|\\r/g, ' ')}\n  state.patch(node, text)\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'code',\n    properties: {},\n    children: [text]\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["inlineCode","state","node","text","type","value","replace","patch","result","tagName","properties","children","applyData"],"mappings":"AAiBO,SAASA,EAAWC,EAAOC,GAEhC,MAAMC,EAAO,CAACC,KAAM,OAAQC,MAAOH,EAAKG,MAAMC,QAAQ,YAAa,MACnEL,EAAMM,MAAML,EAAMC,GAGlB,MAAMK,EAAS,CACbJ,KAAM,UACNK,QAAS,OACTC,WAAY,CAAE,EACdC,SAAU,CAACR,IAGb,OADAF,EAAMM,MAAML,EAAMM,GACXP,EAAMW,UAAUV,EAAMM,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/link-reference.js

@@ -1,2 +0,0 @@
-import{normalizeUri as t}from"../../node_modules/micromark-util-sanitize-uri/index.js";import{revert as e}from"../revert.js";function i(i,r){const n=i.definition(r.identifier);if(!n)return e(i,r);const o={href:t(n.url||"")};null!==n.title&&void 0!==n.title&&(o.title=n.title);const l={type:"element",tagName:"a",properties:o,children:i.all(r)};return i.patch(r,l),i.applyData(r,l)}export{i as linkReference};
-//# sourceMappingURL=link-reference.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/link-reference.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"link-reference.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/link-reference.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').LinkReference} LinkReference\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\nimport {revert} from '../revert.js'\n\n/**\n * Turn an mdast `linkReference` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {LinkReference} node\n *   mdast node.\n * @returns {ElementContent | Array<ElementContent>}\n *   hast node.\n */\nexport function linkReference(state, node) {\n  const def = state.definition(node.identifier)\n\n  if (!def) {\n    return revert(state, node)\n  }\n\n  /** @type {Properties} */\n  const properties = {href: normalizeUri(def.url || '')}\n\n  if (def.title !== null && def.title !== undefined) {\n    properties.title = def.title\n  }\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'a',\n    properties,\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["linkReference","state","node","def","definition","identifier","revert","properties","href","normalizeUri","url","title","undefined","result","type","tagName","children","all","patch","applyData"],"mappings":"6HAqBO,SAASA,EAAcC,EAAOC,GACnC,MAAMC,EAAMF,EAAMG,WAAWF,EAAKG,YAElC,IAAKF,EACH,OAAOG,EAAOL,EAAOC,GAIvB,MAAMK,EAAa,CAACC,KAAMC,EAAaN,EAAIO,KAAO,KAEhC,OAAdP,EAAIQ,YAAgCC,IAAdT,EAAIQ,QAC5BJ,EAAWI,MAAQR,EAAIQ,OAIzB,MAAME,EAAS,CACbC,KAAM,UACNC,QAAS,IACTR,aACAS,SAAUf,EAAMgB,IAAIf,IAGtB,OADAD,EAAMiB,MAAMhB,EAAMW,GACXZ,EAAMkB,UAAUjB,EAAMW,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/link.js

@@ -1,2 +0,0 @@
-import{normalizeUri as t}from"../../node_modules/micromark-util-sanitize-uri/index.js";function e(e,i){const l={href:t(i.url)};null!==i.title&&void 0!==i.title&&(l.title=i.title);const r={type:"element",tagName:"a",properties:l,children:e.all(i)};return e.patch(i,r),e.applyData(i,r)}export{e as link};
-//# sourceMappingURL=link.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/link.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"link.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/link.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').Link} Link\n * @typedef {import('../state.js').State} State\n */\n\nimport {normalizeUri} from 'micromark-util-sanitize-uri'\n\n/**\n * Turn an mdast `link` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Link} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function link(state, node) {\n  /** @type {Properties} */\n  const properties = {href: normalizeUri(node.url)}\n\n  if (node.title !== null && node.title !== undefined) {\n    properties.title = node.title\n  }\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'a',\n    properties,\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["link","state","node","properties","href","normalizeUri","url","title","undefined","result","type","tagName","children","all","patch","applyData"],"mappings":"uFAmBO,SAASA,EAAKC,EAAOC,GAE1B,MAAMC,EAAa,CAACC,KAAMC,EAAaH,EAAKI,MAEzB,OAAfJ,EAAKK,YAAiCC,IAAfN,EAAKK,QAC9BJ,EAAWI,MAAQL,EAAKK,OAI1B,MAAME,EAAS,CACbC,KAAM,UACNC,QAAS,IACTR,aACAS,SAAUX,EAAMY,IAAIX,IAGtB,OADAD,EAAMa,MAAMZ,EAAMO,GACXR,EAAMc,UAAUb,EAAMO,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/list-item.js

@@ -1,2 +0,0 @@
-function e(e,n,l){const p=e.all(n),a=l?function(e){let n=!1;if("list"===e.type){n=e.spread||!1;const l=e.children;let p=-1;for(;!n&&++p<l.length;)n=t(l[p])}return n}(l):t(n),c={},h=[];if("boolean"==typeof n.checked){const e=p[0];let t;e&&"element"===e.type&&"p"===e.tagName?t=e:(t={type:"element",tagName:"p",properties:{},children:[]},p.unshift(t)),t.children.length>0&&t.children.unshift({type:"text",value:" "}),t.children.unshift({type:"element",tagName:"input",properties:{type:"checkbox",checked:n.checked,disabled:!0},children:[]}),c.className=["task-list-item"]}let i=-1;for(;++i<p.length;){const e=p[i];(a||0!==i||"element"!==e.type||"p"!==e.tagName)&&h.push({type:"text",value:"\n"}),"element"!==e.type||"p"!==e.tagName||a?h.push(e):h.push(...e.children)}const r=p[p.length-1];r&&(a||"element"!==r.type||"p"!==r.tagName)&&h.push({type:"text",value:"\n"});const s={type:"element",tagName:"li",properties:c,children:h};return e.patch(n,s),e.applyData(n,s)}function t(e){const t=e.spread;return null==t?e.children.length>1:t}export{e as listItem};
-//# sourceMappingURL=list-item.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/list-item.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"list-item.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/list-item.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').Content} Content\n * @typedef {import('mdast').ListItem} ListItem\n * @typedef {import('mdast').Parent} Parent\n * @typedef {import('mdast').Root} Root\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * @typedef {Root | Content} Nodes\n * @typedef {Extract<Nodes, Parent>} Parents\n */\n\n/**\n * Turn an mdast `listItem` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {ListItem} node\n *   mdast node.\n * @param {Parents | null | undefined} parent\n *   Parent of `node`.\n * @returns {Element}\n *   hast node.\n */\nexport function listItem(state, node, parent) {\n  const results = state.all(node)\n  const loose = parent ? listLoose(parent) : listItemLoose(node)\n  /** @type {Properties} */\n  const properties = {}\n  /** @type {Array<ElementContent>} */\n  const children = []\n\n  if (typeof node.checked === 'boolean') {\n    const head = results[0]\n    /** @type {Element} */\n    let paragraph\n\n    if (head && head.type === 'element' && head.tagName === 'p') {\n      paragraph = head\n    } else {\n      paragraph = {type: 'element', tagName: 'p', properties: {}, children: []}\n      results.unshift(paragraph)\n    }\n\n    if (paragraph.children.length > 0) {\n      paragraph.children.unshift({type: 'text', value: ' '})\n    }\n\n    paragraph.children.unshift({\n      type: 'element',\n      tagName: 'input',\n      properties: {type: 'checkbox', checked: node.checked, disabled: true},\n      children: []\n    })\n\n    // According to github-markdown-css, this class hides bullet.\n    // See: <https://github.com/sindresorhus/github-markdown-css>.\n    properties.className = ['task-list-item']\n  }\n\n  let index = -1\n\n  while (++index < results.length) {\n    const child = results[index]\n\n    // Add eols before nodes, except if this is a loose, first paragraph.\n    if (\n      loose ||\n      index !== 0 ||\n      child.type !== 'element' ||\n      child.tagName !== 'p'\n    ) {\n      children.push({type: 'text', value: '\\n'})\n    }\n\n    if (child.type === 'element' && child.tagName === 'p' && !loose) {\n      children.push(...child.children)\n    } else {\n      children.push(child)\n    }\n  }\n\n  const tail = results[results.length - 1]\n\n  // Add a final eol.\n  if (tail && (loose || tail.type !== 'element' || tail.tagName !== 'p')) {\n    children.push({type: 'text', value: '\\n'})\n  }\n\n  /** @type {Element} */\n  const result = {type: 'element', tagName: 'li', properties, children}\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n\n/**\n * @param {Parents} node\n * @return {Boolean}\n */\nfunction listLoose(node) {\n  let loose = false\n  if (node.type === 'list') {\n    loose = node.spread || false\n    const children = node.children\n    let index = -1\n\n    while (!loose && ++index < children.length) {\n      loose = listItemLoose(children[index])\n    }\n  }\n\n  return loose\n}\n\n/**\n * @param {ListItem} node\n * @return {Boolean}\n */\nfunction listItemLoose(node) {\n  const spread = node.spread\n\n  return spread === undefined || spread === null\n    ? node.children.length > 1\n    : spread\n}\n"],"names":["listItem","state","node","parent","results","all","loose","type","spread","children","index","length","listItemLoose","listLoose","properties","checked","head","paragraph","tagName","unshift","value","disabled","className","child","push","tail","result","patch","applyData"],"mappings":"AA4BO,SAASA,EAASC,EAAOC,EAAMC,GACpC,MAAMC,EAAUH,EAAMI,IAAIH,GACpBI,EAAQH,EAyEhB,SAAmBD,GACjB,IAAII,GAAQ,EACZ,GAAkB,SAAdJ,EAAKK,KAAiB,CACxBD,EAAQJ,EAAKM,SAAU,EACvB,MAAMC,EAAWP,EAAKO,SACtB,IAAIC,GAAS,EAEb,MAAQJ,KAAWI,EAAQD,EAASE,QAClCL,EAAQM,EAAcH,EAASC,GAElC,CAED,OAAOJ,CACT,CAtFyBO,CAAUV,GAAUS,EAAcV,GAEnDY,EAAa,CAAE,EAEfL,EAAW,GAEjB,GAA4B,kBAAjBP,EAAKa,QAAuB,CACrC,MAAMC,EAAOZ,EAAQ,GAErB,IAAIa,EAEAD,GAAsB,YAAdA,EAAKT,MAAuC,MAAjBS,EAAKE,QAC1CD,EAAYD,GAEZC,EAAY,CAACV,KAAM,UAAWW,QAAS,IAAKJ,WAAY,CAAA,EAAIL,SAAU,IACtEL,EAAQe,QAAQF,IAGdA,EAAUR,SAASE,OAAS,GAC9BM,EAAUR,SAASU,QAAQ,CAACZ,KAAM,OAAQa,MAAO,MAGnDH,EAAUR,SAASU,QAAQ,CACzBZ,KAAM,UACNW,QAAS,QACTJ,WAAY,CAACP,KAAM,WAAYQ,QAASb,EAAKa,QAASM,UAAU,GAChEZ,SAAU,KAKZK,EAAWQ,UAAY,CAAC,iBACzB,CAED,IAAIZ,GAAS,EAEb,OAASA,EAAQN,EAAQO,QAAQ,CAC/B,MAAMY,EAAQnB,EAAQM,IAIpBJ,GACU,IAAVI,GACe,YAAfa,EAAMhB,MACY,MAAlBgB,EAAML,UAENT,EAASe,KAAK,CAACjB,KAAM,OAAQa,MAAO,OAGnB,YAAfG,EAAMhB,MAAwC,MAAlBgB,EAAML,SAAoBZ,EAGxDG,EAASe,KAAKD,GAFdd,EAASe,QAAQD,EAAMd,SAI1B,CAED,MAAMgB,EAAOrB,EAAQA,EAAQO,OAAS,GAGlCc,IAASnB,GAAuB,YAAdmB,EAAKlB,MAAuC,MAAjBkB,EAAKP,UACpDT,EAASe,KAAK,CAACjB,KAAM,OAAQa,MAAO,OAItC,MAAMM,EAAS,CAACnB,KAAM,UAAWW,QAAS,KAAMJ,aAAYL,YAE5D,OADAR,EAAM0B,MAAMzB,EAAMwB,GACXzB,EAAM2B,UAAU1B,EAAMwB,EAC/B,CAyBA,SAASd,EAAcV,GACrB,MAAMM,EAASN,EAAKM,OAEpB,OAAOA,QACHN,EAAKO,SAASE,OAAS,EACvBH,CACN"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/list.js

@@ -1,2 +0,0 @@
-function t(t,e){const a={},r=t.all(e);let s=-1;for("number"==typeof e.start&&1!==e.start&&(a.start=e.start);++s<r.length;){const t=r[s];if("element"===t.type&&"li"===t.tagName&&t.properties&&Array.isArray(t.properties.className)&&t.properties.className.includes("task-list-item")){a.className=["contains-task-list"];break}}const l={type:"element",tagName:e.ordered?"ol":"ul",properties:a,children:t.wrap(r,!0)};return t.patch(e,l),t.applyData(e,l)}export{t as list};
-//# sourceMappingURL=list.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/list.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"list.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/list.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('mdast').List} List\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `list` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {List} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function list(state, node) {\n  /** @type {Properties} */\n  const properties = {}\n  const results = state.all(node)\n  let index = -1\n\n  if (typeof node.start === 'number' && node.start !== 1) {\n    properties.start = node.start\n  }\n\n  // Like GitHub, add a class for custom styling.\n  while (++index < results.length) {\n    const child = results[index]\n\n    if (\n      child.type === 'element' &&\n      child.tagName === 'li' &&\n      child.properties &&\n      Array.isArray(child.properties.className) &&\n      child.properties.className.includes('task-list-item')\n    ) {\n      properties.className = ['contains-task-list']\n      break\n    }\n  }\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: node.ordered ? 'ol' : 'ul',\n    properties,\n    children: state.wrap(results, true)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["list","state","node","properties","results","all","index","start","length","child","type","tagName","Array","isArray","className","includes","result","ordered","children","wrap","patch","applyData"],"mappings":"AAiBO,SAASA,EAAKC,EAAOC,GAE1B,MAAMC,EAAa,CAAE,EACfC,EAAUH,EAAMI,IAAIH,GAC1B,IAAII,GAAS,EAOb,IAL0B,iBAAfJ,EAAKK,OAAqC,IAAfL,EAAKK,QACzCJ,EAAWI,MAAQL,EAAKK,SAIjBD,EAAQF,EAAQI,QAAQ,CAC/B,MAAMC,EAAQL,EAAQE,GAEtB,GACiB,YAAfG,EAAMC,MACY,OAAlBD,EAAME,SACNF,EAAMN,YACNS,MAAMC,QAAQJ,EAAMN,WAAWW,YAC/BL,EAAMN,WAAWW,UAAUC,SAAS,kBACpC,CACAZ,EAAWW,UAAY,CAAC,sBACxB,KACD,CACF,CAGD,MAAME,EAAS,CACbN,KAAM,UACNC,QAAST,EAAKe,QAAU,KAAO,KAC/Bd,aACAe,SAAUjB,EAAMkB,KAAKf,GAAS,IAGhC,OADAH,EAAMmB,MAAMlB,EAAMc,GACXf,EAAMoB,UAAUnB,EAAMc,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/paragraph.js

@@ -1,2 +0,0 @@
-function e(e,t){const p={type:"element",tagName:"p",properties:{},children:e.all(t)};return e.patch(t,p),e.applyData(t,p)}export{e as paragraph};
-//# sourceMappingURL=paragraph.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/paragraph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"paragraph.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/paragraph.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Paragraph} Paragraph\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `paragraph` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Paragraph} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function paragraph(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'p',\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["paragraph","state","node","result","type","tagName","properties","children","all","patch","applyData"],"mappings":"AAgBO,SAASA,EAAUC,EAAOC,GAE/B,MAAMC,EAAS,CACbC,KAAM,UACNC,QAAS,IACTC,WAAY,CAAE,EACdC,SAAUN,EAAMO,IAAIN,IAGtB,OADAD,EAAMQ,MAAMP,EAAMC,GACXF,EAAMS,UAAUR,EAAMC,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/root.js

@@ -1,2 +0,0 @@
-function t(t,a){const p={type:"root",children:t.wrap(t.all(a))};return t.patch(a,p),t.applyData(a,p)}export{t as root};
-//# sourceMappingURL=root.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/root.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"root.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/root.js"],"sourcesContent":["/**\n * @typedef {import('hast').Root} HastRoot\n * @typedef {import('hast').Element} HastElement\n * @typedef {import('mdast').Root} MdastRoot\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `root` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {MdastRoot} node\n *   mdast node.\n * @returns {HastRoot | HastElement}\n *   hast node.\n */\nexport function root(state, node) {\n  /** @type {HastRoot} */\n  const result = {type: 'root', children: state.wrap(state.all(node))}\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["root","state","node","result","type","children","wrap","all","patch","applyData"],"mappings":"AAiBO,SAASA,EAAKC,EAAOC,GAE1B,MAAMC,EAAS,CAACC,KAAM,OAAQC,SAAUJ,EAAMK,KAAKL,EAAMM,IAAIL,KAE7D,OADAD,EAAMO,MAAMN,EAAMC,GACXF,EAAMQ,UAAUP,EAAMC,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/strong.js

@@ -1,2 +0,0 @@
-function t(t,e){const a={type:"element",tagName:"strong",properties:{},children:t.all(e)};return t.patch(e,a),t.applyData(e,a)}export{t as strong};
-//# sourceMappingURL=strong.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/strong.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"strong.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/strong.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').Strong} Strong\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `strong` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {Strong} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function strong(state, node) {\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'strong',\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["strong","state","node","result","type","tagName","properties","children","all","patch","applyData"],"mappings":"AAgBO,SAASA,EAAOC,EAAOC,GAE5B,MAAMC,EAAS,CACbC,KAAM,UACNC,QAAS,SACTC,WAAY,CAAE,EACdC,SAAUN,EAAMO,IAAIN,IAGtB,OADAD,EAAMQ,MAAMP,EAAMC,GACXF,EAAMS,UAAUR,EAAMC,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/table-cell.js

@@ -1,2 +0,0 @@
-function t(t,e){const a={type:"element",tagName:"td",properties:{},children:t.all(e)};return t.patch(e,a),t.applyData(e,a)}export{t as tableCell};
-//# sourceMappingURL=table-cell.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/table-cell.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"table-cell.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/table-cell.js"],"sourcesContent":["/**\n * @typedef {import('hast').Element} Element\n * @typedef {import('mdast').TableCell} TableCell\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * Turn an mdast `tableCell` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {TableCell} node\n *   mdast node.\n * @returns {Element}\n *   hast node.\n */\nexport function tableCell(state, node) {\n  // Note: this function is normally not called: see `table-row` for how rows\n  // and their cells are compiled.\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'td', // Assume body cell.\n    properties: {},\n    children: state.all(node)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["tableCell","state","node","result","type","tagName","properties","children","all","patch","applyData"],"mappings":"AAgBO,SAASA,EAAUC,EAAOC,GAI/B,MAAMC,EAAS,CACbC,KAAM,UACNC,QAAS,KACTC,WAAY,CAAE,EACdC,SAAUN,EAAMO,IAAIN,IAGtB,OADAD,EAAMQ,MAAMP,EAAMC,GACXF,EAAMS,UAAUR,EAAMC,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/table-row.js

@@ -1,2 +0,0 @@
-function e(e,t,n){const l=n?n.children:void 0,a=0===(l?l.indexOf(t):1)?"th":"td",p=n&&"table"===n.type?n.align:void 0,r=p?p.length:t.children.length;let i=-1;const c=[];for(;++i<r;){const n=t.children[i],l={},r=p?p[i]:void 0;r&&(l.align=r);let h={type:"element",tagName:a,properties:l,children:[]};n&&(h.children=e.all(n),e.patch(n,h),h=e.applyData(t,h)),c.push(h)}const h={type:"element",tagName:"tr",properties:{},children:e.wrap(c,!0)};return e.patch(t,h),e.applyData(t,h)}export{e as tableRow};
-//# sourceMappingURL=table-row.js.map

package/dist/node_modules/mdast-util-to-hast/lib/handlers/table-row.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"table-row.js","sources":["../../../../../node_modules/mdast-util-to-hast/lib/handlers/table-row.js"],"sourcesContent":["/**\n * @typedef {import('hast').Properties} Properties\n * @typedef {import('hast').Element} Element\n * @typedef {import('hast').ElementContent} ElementContent\n * @typedef {import('mdast').Content} Content\n * @typedef {import('mdast').Parent} Parent\n * @typedef {import('mdast').Root} Root\n * @typedef {import('mdast').TableRow} TableRow\n * @typedef {import('../state.js').State} State\n */\n\n/**\n * @typedef {Root | Content} Nodes\n * @typedef {Extract<Nodes, Parent>} Parents\n */\n\n/**\n * Turn an mdast `tableRow` node into hast.\n *\n * @param {State} state\n *   Info passed around.\n * @param {TableRow} node\n *   mdast node.\n * @param {Parents | null | undefined} parent\n *   Parent of `node`.\n * @returns {Element}\n *   hast node.\n */\nexport function tableRow(state, node, parent) {\n  const siblings = parent ? parent.children : undefined\n  // Generate a body row when without parent.\n  const rowIndex = siblings ? siblings.indexOf(node) : 1\n  const tagName = rowIndex === 0 ? 'th' : 'td'\n  const align = parent && parent.type === 'table' ? parent.align : undefined\n  const length = align ? align.length : node.children.length\n  let cellIndex = -1\n  /** @type {Array<ElementContent>} */\n  const cells = []\n\n  while (++cellIndex < length) {\n    // Note: can also be undefined.\n    const cell = node.children[cellIndex]\n    /** @type {Properties} */\n    const properties = {}\n    const alignValue = align ? align[cellIndex] : undefined\n\n    if (alignValue) {\n      properties.align = alignValue\n    }\n\n    /** @type {Element} */\n    let result = {type: 'element', tagName, properties, children: []}\n\n    if (cell) {\n      result.children = state.all(cell)\n      state.patch(cell, result)\n      result = state.applyData(node, result)\n    }\n\n    cells.push(result)\n  }\n\n  /** @type {Element} */\n  const result = {\n    type: 'element',\n    tagName: 'tr',\n    properties: {},\n    children: state.wrap(cells, true)\n  }\n  state.patch(node, result)\n  return state.applyData(node, result)\n}\n"],"names":["tableRow","state","node","parent","siblings","children","undefined","tagName","indexOf","align","type","length","cellIndex","cells","cell","properties","alignValue","result","all","patch","applyData","push","wrap"],"mappings":"AA4BO,SAASA,EAASC,EAAOC,EAAMC,GACpC,MAAMC,EAAWD,EAASA,EAAOE,cAAWC,EAGtCC,EAAuB,KADZH,EAAWA,EAASI,QAAQN,GAAQ,GACpB,KAAO,KAClCO,EAAQN,GAA0B,UAAhBA,EAAOO,KAAmBP,EAAOM,WAAQH,EAC3DK,EAASF,EAAQA,EAAME,OAAST,EAAKG,SAASM,OACpD,IAAIC,GAAa,EAEjB,MAAMC,EAAQ,GAEd,OAASD,EAAYD,GAAQ,CAE3B,MAAMG,EAAOZ,EAAKG,SAASO,GAErBG,EAAa,CAAE,EACfC,EAAaP,EAAQA,EAAMG,QAAaN,EAE1CU,IACFD,EAAWN,MAAQO,GAIrB,IAAIC,EAAS,CAACP,KAAM,UAAWH,UAASQ,aAAYV,SAAU,IAE1DS,IACFG,EAAOZ,SAAWJ,EAAMiB,IAAIJ,GAC5Bb,EAAMkB,MAAML,EAAMG,GAClBA,EAAShB,EAAMmB,UAAUlB,EAAMe,IAGjCJ,EAAMQ,KAAKJ,EACZ,CAGD,MAAMA,EAAS,CACbP,KAAM,UACNH,QAAS,KACTQ,WAAY,CAAE,EACdV,SAAUJ,EAAMqB,KAAKT,GAAO,IAG9B,OADAZ,EAAMkB,MAAMjB,EAAMe,GACXhB,EAAMmB,UAAUlB,EAAMe,EAC/B"}

package/dist/node_modules/mdast-util-to-hast/lib/handlers/table.js

@@ -1,2 +0,0 @@
-import{pointStart as e,pointEnd as t}from"../../../unist-util-position/lib/index.js";function n(n,i){const p=n.all(i),r=p.shift(),l=[];if(r){const e={type:"element",tagName:"thead",properties:{},children:n.wrap([r],!0)};n.patch(i.children[0],e),l.push(e)}if(p.length>0){const r={type:"element",tagName:"tbody",properties:{},children:n.wrap(p,!0)},a=e(i.children[1]),o=t(i.children[i.children.length-1]);a.line&&o.line&&(r.position={start:a,end:o}),l.push(r)}const a={type:"element",tagName:"table",properties:{},children:n.wrap(l,!0)};return n.patch(i,a),n.applyData(i,a)}export{n as table};
-//# sourceMappingURL=table.js.map