@easyv/biz-components 0.0.3 → 0.0.5

package/dist/node_modules/.pnpm/ccount@2.0.1/node_modules/ccount/index.es.js

@@ -0,0 +1,13 @@
+function r(i, e) {
+  const t = String(i);
+  if (typeof e != "string")
+    throw new TypeError("Expected character");
+  let o = 0, n = t.indexOf(e);
+  for (; n !== -1; )
+    o++, n = t.indexOf(e, n + e.length);
+  return o;
+}
+export {
+  r as ccount
+};
+//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/ccount@2.0.1/node_modules/ccount/index.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../../../node_modules/.pnpm/ccount@2.0.1/node_modules/ccount/index.js"],"sourcesContent":["/**\n * Count how often a character (or substring) is used in a string.\n *\n * @param {string} value\n *   Value to search in.\n * @param {string} character\n *   Character (or substring) to look for.\n * @return {number}\n *   Number of times `character` occurred in `value`.\n */\nexport function ccount(value, character) {\n  const source = String(value)\n\n  if (typeof character !== 'string') {\n    throw new TypeError('Expected character')\n  }\n\n  let count = 0\n  let index = source.indexOf(character)\n\n  while (index !== -1) {\n    count++\n    index = source.indexOf(character, index + character.length)\n  }\n\n  return count\n}\n"],"names":["ccount","value","character","source","count","index"],"mappings":"AAUO,SAASA,EAAOC,GAAOC,GAAW;AACvC,QAAMC,IAAS,OAAOF,CAAK;AAE3B,MAAI,OAAOC,KAAc;AACvB,UAAM,IAAI,UAAU,oBAAoB;AAG1C,MAAIE,IAAQ,GACRC,IAAQF,EAAO,QAAQD,CAAS;AAEpC,SAAOG,MAAU;AACf,IAAAD,KACAC,IAAQF,EAAO,QAAQD,GAAWG,IAAQH,EAAU,MAAM;AAG5D,SAAOE;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/classnames@2.3.2/node_modules/classnames/index.es.js

@@ -1,5 +1,5 @@
 import { getDefaultExportFromCjs as u } from "../../../../../_virtual/_commonjsHelpers.es.js";
-import { __module as f } from "../../../../../_virtual/index.es4.js";
+import { __module as f } from "../../../../../_virtual/index.es3.js";
 /*!
 	Copyright (c) 2018 Jed Watson.
 	Licensed under the MIT License (MIT), see

package/dist/node_modules/.pnpm/escape-string-regexp@5.0.0/node_modules/escape-string-regexp/index.es.js

@@ -0,0 +1,9 @@
+function r(e) {
+  if (typeof e != "string")
+    throw new TypeError("Expected a string");
+  return e.replace(/[|\\{}()[\]^$+*?.]/g, "\\$&").replace(/-/g, "\\x2d");
+}
+export {
+  r as default
+};
+//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/escape-string-regexp@5.0.0/node_modules/escape-string-regexp/index.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../../../node_modules/.pnpm/escape-string-regexp@5.0.0/node_modules/escape-string-regexp/index.js"],"sourcesContent":["export default function escapeStringRegexp(string) {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\t// Escape characters with special meaning either inside or outside character sets.\n\t// Use a simple backslash escape when it’s always valid, and a `\\xnn` escape when the simpler form would be disallowed by Unicode patterns’ stricter grammar.\n\treturn string\n\t\t.replace(/[|\\\\{}()[\\]^$+*?.]/g, '\\\\$&')\n\t\t.replace(/-/g, '\\\\x2d');\n}\n"],"names":["escapeStringRegexp","string"],"mappings":"AAAe,SAASA,EAAmBC,GAAQ;AAClD,MAAI,OAAOA,KAAW;AACrB,UAAM,IAAI,UAAU,mBAAmB;AAKxC,SAAOA,EACL,QAAQ,uBAAuB,MAAM,EACrC,QAAQ,MAAM,OAAO;AACxB;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/longest-streak@3.1.0/node_modules/longest-streak/index.es.js

@@ -0,0 +1,13 @@
+function f(l, t) {
+  const i = String(l);
+  let e = i.indexOf(t), n = e, o = 0, r = 0;
+  if (typeof t != "string")
+    throw new TypeError("Expected substring");
+  for (; e !== -1; )
+    e === n ? ++o > r && (r = o) : o = 1, n = e + t.length, e = i.indexOf(t, n);
+  return r;
+}
+export {
+  f as longestStreak
+};
+//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/longest-streak@3.1.0/node_modules/longest-streak/index.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../../../node_modules/.pnpm/longest-streak@3.1.0/node_modules/longest-streak/index.js"],"sourcesContent":["/**\n * Get the count of the longest repeating streak of `substring` in `value`.\n *\n * @param {string} value\n *   Content to search in.\n * @param {string} substring\n *   Substring to look for, typically one character.\n * @returns {number}\n *   Count of most frequent adjacent `substring`s in `value`.\n */\nexport function longestStreak(value, substring) {\n  const source = String(value)\n  let index = source.indexOf(substring)\n  let expected = index\n  let count = 0\n  let max = 0\n\n  if (typeof substring !== 'string') {\n    throw new TypeError('Expected substring')\n  }\n\n  while (index !== -1) {\n    if (index === expected) {\n      if (++count > max) {\n        max = count\n      }\n    } else {\n      count = 1\n    }\n\n    expected = index + substring.length\n    index = source.indexOf(substring, expected)\n  }\n\n  return max\n}\n"],"names":["longestStreak","value","substring","source","index","expected","count","max"],"mappings":"AAUO,SAASA,EAAcC,GAAOC,GAAW;AAC9C,QAAMC,IAAS,OAAOF,CAAK;AAC3B,MAAIG,IAAQD,EAAO,QAAQD,CAAS,GAChCG,IAAWD,GACXE,IAAQ,GACRC,IAAM;AAEV,MAAI,OAAOL,KAAc;AACvB,UAAM,IAAI,UAAU,oBAAoB;AAG1C,SAAOE,MAAU;AACf,IAAIA,MAAUC,IACR,EAAEC,IAAQC,MACZA,IAAMD,KAGRA,IAAQ,GAGVD,IAAWD,IAAQF,EAAU,QAC7BE,IAAQD,EAAO,QAAQD,GAAWG,CAAQ;AAG5C,SAAOE;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/markdown-table@3.0.4/node_modules/markdown-table/index.es.js

@@ -0,0 +1,76 @@
+function C(i) {
+  return i.length;
+}
+function L(i, f) {
+  const n = f || {}, d = (n.align || []).concat(), y = n.stringLength || C, p = [], u = [], w = [], a = [];
+  let g = 0, s = -1;
+  for (; ++s < i.length; ) {
+    const r = [], c = [];
+    let t = -1;
+    for (i[s].length > g && (g = i[s].length); ++t < i[s].length; ) {
+      const l = I(i[s][t]);
+      if (n.alignDelimiters !== !1) {
+        const o = y(l);
+        c[t] = o, (a[t] === void 0 || o > a[t]) && (a[t] = o);
+      }
+      r.push(l);
+    }
+    u[s] = r, w[s] = c;
+  }
+  let e = -1;
+  if (typeof d == "object" && "length" in d)
+    for (; ++e < g; )
+      p[e] = S(d[e]);
+  else {
+    const r = S(d);
+    for (; ++e < g; )
+      p[e] = r;
+  }
+  e = -1;
+  const z = [], x = [];
+  for (; ++e < g; ) {
+    const r = p[e];
+    let c = "", t = "";
+    r === 99 ? (c = ":", t = ":") : r === 108 ? c = ":" : r === 114 && (t = ":");
+    let l = n.alignDelimiters === !1 ? 1 : Math.max(
+      1,
+      a[e] - c.length - t.length
+    );
+    const o = c + "-".repeat(l) + t;
+    n.alignDelimiters !== !1 && (l = c.length + l + t.length, l > a[e] && (a[e] = l), x[e] = l), z[e] = o;
+  }
+  u.splice(1, 0, z), w.splice(1, 0, x), s = -1;
+  const D = [];
+  for (; ++s < u.length; ) {
+    const r = u[s], c = w[s];
+    e = -1;
+    const t = [];
+    for (; ++e < g; ) {
+      const l = r[e] || "";
+      let o = "", m = "";
+      if (n.alignDelimiters !== !1) {
+        const h = a[e] - (c[e] || 0), j = p[e];
+        j === 114 ? o = " ".repeat(h) : j === 99 ? h % 2 ? (o = " ".repeat(h / 2 + 0.5), m = " ".repeat(h / 2 - 0.5)) : (o = " ".repeat(h / 2), m = o) : m = " ".repeat(h);
+      }
+      n.delimiterStart !== !1 && !e && t.push("|"), n.padding !== !1 && // Don’t add the opening space if we’re not aligning and the cell is
+      // empty: there will be a closing space.
+      !(n.alignDelimiters === !1 && l === "") && (n.delimiterStart !== !1 || e) && t.push(" "), n.alignDelimiters !== !1 && t.push(o), t.push(l), n.alignDelimiters !== !1 && t.push(m), n.padding !== !1 && t.push(" "), (n.delimiterEnd !== !1 || e !== g - 1) && t.push("|");
+    }
+    D.push(
+      n.delimiterEnd === !1 ? t.join("").replace(/ +$/, "") : t.join("")
+    );
+  }
+  return D.join(`
+`);
+}
+function I(i) {
+  return i == null ? "" : String(i);
+}
+function S(i) {
+  const f = typeof i == "string" ? i.codePointAt(0) : 0;
+  return f === 67 || f === 99 ? 99 : f === 76 || f === 108 ? 108 : f === 82 || f === 114 ? 114 : 0;
+}
+export {
+  L as markdownTable
+};
+//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/markdown-table@3.0.4/node_modules/markdown-table/index.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../../../node_modules/.pnpm/markdown-table@3.0.4/node_modules/markdown-table/index.js"],"sourcesContent":["// To do: next major: remove.\n/**\n * @typedef {Options} MarkdownTableOptions\n *   Configuration.\n */\n\n/**\n * @typedef Options\n *   Configuration.\n * @property {boolean | null | undefined} [alignDelimiters=true]\n *   Whether to align the delimiters (default: `true`);\n *   they are aligned by default:\n *\n *   ```markdown\n *   | Alpha | B     |\n *   | ----- | ----- |\n *   | C     | Delta |\n *   ```\n *\n *   Pass `false` to make them staggered:\n *\n *   ```markdown\n *   | Alpha | B |\n *   | - | - |\n *   | C | Delta |\n *   ```\n * @property {ReadonlyArray<string | null | undefined> | string | null | undefined} [align]\n *   How to align columns (default: `''`);\n *   one style for all columns or styles for their respective columns;\n *   each style is either `'l'` (left), `'r'` (right), or `'c'` (center);\n *   other values are treated as `''`, which doesn’t place the colon in the\n *   alignment row but does align left;\n *   *only the lowercased first character is used, so `Right` is fine.*\n * @property {boolean | null | undefined} [delimiterEnd=true]\n *   Whether to end each row with the delimiter (default: `true`).\n *\n *   > 👉 **Note**: please don’t use this: it could create fragile structures\n *   > that aren’t understandable to some markdown parsers.\n *\n *   When `true`, there are ending delimiters:\n *\n *   ```markdown\n *   | Alpha | B     |\n *   | ----- | ----- |\n *   | C     | Delta |\n *   ```\n *\n *   When `false`, there are no ending delimiters:\n *\n *   ```markdown\n *   | Alpha | B\n *   | ----- | -----\n *   | C     | Delta\n *   ```\n * @property {boolean | null | undefined} [delimiterStart=true]\n *   Whether to begin each row with the delimiter (default: `true`).\n *\n *   > 👉 **Note**: please don’t use this: it could create fragile structures\n *   > that aren’t understandable to some markdown parsers.\n *\n *   When `true`, there are starting delimiters:\n *\n *   ```markdown\n *   | Alpha | B     |\n *   | ----- | ----- |\n *   | C     | Delta |\n *   ```\n *\n *   When `false`, there are no starting delimiters:\n *\n *   ```markdown\n *   Alpha | B     |\n *   ----- | ----- |\n *   C     | Delta |\n *   ```\n * @property {boolean | null | undefined} [padding=true]\n *   Whether to add a space of padding between delimiters and cells\n *   (default: `true`).\n *\n *   When `true`, there is padding:\n *\n *   ```markdown\n *   | Alpha | B     |\n *   | ----- | ----- |\n *   | C     | Delta |\n *   ```\n *\n *   When `false`, there is no padding:\n *\n *   ```markdown\n *   |Alpha|B    |\n *   |-----|-----|\n *   |C    |Delta|\n *   ```\n * @property {((value: string) => number) | null | undefined} [stringLength]\n *   Function to detect the length of table cell content (optional);\n *   this is used when aligning the delimiters (`|`) between table cells;\n *   full-width characters and emoji mess up delimiter alignment when viewing\n *   the markdown source;\n *   to fix this, you can pass this function,\n *   which receives the cell content and returns its “visible” size;\n *   note that what is and isn’t visible depends on where the text is displayed.\n *\n *   Without such a function, the following:\n *\n *   ```js\n *   markdownTable([\n *     ['Alpha', 'Bravo'],\n *     ['中文', 'Charlie'],\n *     ['👩‍❤️‍👩', 'Delta']\n *   ])\n *   ```\n *\n *   Yields:\n *\n *   ```markdown\n *   | Alpha | Bravo |\n *   | - | - |\n *   | 中文 | Charlie |\n *   | 👩‍❤️‍👩 | Delta |\n *   ```\n *\n *   With [`string-width`](https://github.com/sindresorhus/string-width):\n *\n *   ```js\n *   import stringWidth from 'string-width'\n *\n *   markdownTable(\n *     [\n *       ['Alpha', 'Bravo'],\n *       ['中文', 'Charlie'],\n *       ['👩‍❤️‍👩', 'Delta']\n *     ],\n *     {stringLength: stringWidth}\n *   )\n *   ```\n *\n *   Yields:\n *\n *   ```markdown\n *   | Alpha | Bravo   |\n *   | ----- | ------- |\n *   | 中文  | Charlie |\n *   | 👩‍❤️‍👩    | Delta   |\n *   ```\n */\n\n/**\n * @param {string} value\n *   Cell value.\n * @returns {number}\n *   Cell size.\n */\nfunction defaultStringLength(value) {\n  return value.length\n}\n\n/**\n * Generate a markdown\n * ([GFM](https://docs.github.com/en/github/writing-on-github/working-with-advanced-formatting/organizing-information-with-tables))\n * table.\n *\n * @param {ReadonlyArray<ReadonlyArray<string | null | undefined>>} table\n *   Table data (matrix of strings).\n * @param {Readonly<Options> | null | undefined} [options]\n *   Configuration (optional).\n * @returns {string}\n *   Result.\n */\nexport function markdownTable(table, options) {\n  const settings = options || {}\n  // To do: next major: change to spread.\n  const align = (settings.align || []).concat()\n  const stringLength = settings.stringLength || defaultStringLength\n  /** @type {Array<number>} Character codes as symbols for alignment per column. */\n  const alignments = []\n  /** @type {Array<Array<string>>} Cells per row. */\n  const cellMatrix = []\n  /** @type {Array<Array<number>>} Sizes of each cell per row. */\n  const sizeMatrix = []\n  /** @type {Array<number>} */\n  const longestCellByColumn = []\n  let mostCellsPerRow = 0\n  let rowIndex = -1\n\n  // This is a superfluous loop if we don’t align delimiters, but otherwise we’d\n  // do superfluous work when aligning, so optimize for aligning.\n  while (++rowIndex < table.length) {\n    /** @type {Array<string>} */\n    const row = []\n    /** @type {Array<number>} */\n    const sizes = []\n    let columnIndex = -1\n\n    if (table[rowIndex].length > mostCellsPerRow) {\n      mostCellsPerRow = table[rowIndex].length\n    }\n\n    while (++columnIndex < table[rowIndex].length) {\n      const cell = serialize(table[rowIndex][columnIndex])\n\n      if (settings.alignDelimiters !== false) {\n        const size = stringLength(cell)\n        sizes[columnIndex] = size\n\n        if (\n          longestCellByColumn[columnIndex] === undefined ||\n          size > longestCellByColumn[columnIndex]\n        ) {\n          longestCellByColumn[columnIndex] = size\n        }\n      }\n\n      row.push(cell)\n    }\n\n    cellMatrix[rowIndex] = row\n    sizeMatrix[rowIndex] = sizes\n  }\n\n  // Figure out which alignments to use.\n  let columnIndex = -1\n\n  if (typeof align === 'object' && 'length' in align) {\n    while (++columnIndex < mostCellsPerRow) {\n      alignments[columnIndex] = toAlignment(align[columnIndex])\n    }\n  } else {\n    const code = toAlignment(align)\n\n    while (++columnIndex < mostCellsPerRow) {\n      alignments[columnIndex] = code\n    }\n  }\n\n  // Inject the alignment row.\n  columnIndex = -1\n  /** @type {Array<string>} */\n  const row = []\n  /** @type {Array<number>} */\n  const sizes = []\n\n  while (++columnIndex < mostCellsPerRow) {\n    const code = alignments[columnIndex]\n    let before = ''\n    let after = ''\n\n    if (code === 99 /* `c` */) {\n      before = ':'\n      after = ':'\n    } else if (code === 108 /* `l` */) {\n      before = ':'\n    } else if (code === 114 /* `r` */) {\n      after = ':'\n    }\n\n    // There *must* be at least one hyphen-minus in each alignment cell.\n    let size =\n      settings.alignDelimiters === false\n        ? 1\n        : Math.max(\n            1,\n            longestCellByColumn[columnIndex] - before.length - after.length\n          )\n\n    const cell = before + '-'.repeat(size) + after\n\n    if (settings.alignDelimiters !== false) {\n      size = before.length + size + after.length\n\n      if (size > longestCellByColumn[columnIndex]) {\n        longestCellByColumn[columnIndex] = size\n      }\n\n      sizes[columnIndex] = size\n    }\n\n    row[columnIndex] = cell\n  }\n\n  // Inject the alignment row.\n  cellMatrix.splice(1, 0, row)\n  sizeMatrix.splice(1, 0, sizes)\n\n  rowIndex = -1\n  /** @type {Array<string>} */\n  const lines = []\n\n  while (++rowIndex < cellMatrix.length) {\n    const row = cellMatrix[rowIndex]\n    const sizes = sizeMatrix[rowIndex]\n    columnIndex = -1\n    /** @type {Array<string>} */\n    const line = []\n\n    while (++columnIndex < mostCellsPerRow) {\n      const cell = row[columnIndex] || ''\n      let before = ''\n      let after = ''\n\n      if (settings.alignDelimiters !== false) {\n        const size =\n          longestCellByColumn[columnIndex] - (sizes[columnIndex] || 0)\n        const code = alignments[columnIndex]\n\n        if (code === 114 /* `r` */) {\n          before = ' '.repeat(size)\n        } else if (code === 99 /* `c` */) {\n          if (size % 2) {\n            before = ' '.repeat(size / 2 + 0.5)\n            after = ' '.repeat(size / 2 - 0.5)\n          } else {\n            before = ' '.repeat(size / 2)\n            after = before\n          }\n        } else {\n          after = ' '.repeat(size)\n        }\n      }\n\n      if (settings.delimiterStart !== false && !columnIndex) {\n        line.push('|')\n      }\n\n      if (\n        settings.padding !== false &&\n        // Don’t add the opening space if we’re not aligning and the cell is\n        // empty: there will be a closing space.\n        !(settings.alignDelimiters === false && cell === '') &&\n        (settings.delimiterStart !== false || columnIndex)\n      ) {\n        line.push(' ')\n      }\n\n      if (settings.alignDelimiters !== false) {\n        line.push(before)\n      }\n\n      line.push(cell)\n\n      if (settings.alignDelimiters !== false) {\n        line.push(after)\n      }\n\n      if (settings.padding !== false) {\n        line.push(' ')\n      }\n\n      if (\n        settings.delimiterEnd !== false ||\n        columnIndex !== mostCellsPerRow - 1\n      ) {\n        line.push('|')\n      }\n    }\n\n    lines.push(\n      settings.delimiterEnd === false\n        ? line.join('').replace(/ +$/, '')\n        : line.join('')\n    )\n  }\n\n  return lines.join('\\n')\n}\n\n/**\n * @param {string | null | undefined} [value]\n *   Value to serialize.\n * @returns {string}\n *   Result.\n */\nfunction serialize(value) {\n  return value === null || value === undefined ? '' : String(value)\n}\n\n/**\n * @param {string | null | undefined} value\n *   Value.\n * @returns {number}\n *   Alignment.\n */\nfunction toAlignment(value) {\n  const code = typeof value === 'string' ? value.codePointAt(0) : 0\n\n  return code === 67 /* `C` */ || code === 99 /* `c` */\n    ? 99 /* `c` */\n    : code === 76 /* `L` */ || code === 108 /* `l` */\n      ? 108 /* `l` */\n      : code === 82 /* `R` */ || code === 114 /* `r` */\n        ? 114 /* `r` */\n        : 0\n}\n"],"names":["defaultStringLength","value","markdownTable","table","options","settings","align","stringLength","alignments","cellMatrix","sizeMatrix","longestCellByColumn","mostCellsPerRow","rowIndex","row","sizes","columnIndex","cell","serialize","size","toAlignment","code","before","after","lines","line"],"mappings":"AAyJA,SAASA,EAAoBC,GAAO;AAClC,SAAOA,EAAM;AACf;AAcO,SAASC,EAAcC,GAAOC,GAAS;AAC5C,QAAMC,IAAWD,KAAW,CAAA,GAEtBE,KAASD,EAAS,SAAS,CAAE,GAAE,OAAM,GACrCE,IAAeF,EAAS,gBAAgBL,GAExCQ,IAAa,CAAA,GAEbC,IAAa,CAAA,GAEbC,IAAa,CAAA,GAEbC,IAAsB,CAAA;AAC5B,MAAIC,IAAkB,GAClBC,IAAW;AAIf,SAAO,EAAEA,IAAWV,EAAM,UAAQ;AAEhC,UAAMW,IAAM,CAAA,GAENC,IAAQ,CAAA;AACd,QAAIC,IAAc;AAMlB,SAJIb,EAAMU,CAAQ,EAAE,SAASD,MAC3BA,IAAkBT,EAAMU,CAAQ,EAAE,SAG7B,EAAEG,IAAcb,EAAMU,CAAQ,EAAE,UAAQ;AAC7C,YAAMI,IAAOC,EAAUf,EAAMU,CAAQ,EAAEG,CAAW,CAAC;AAEnD,UAAIX,EAAS,oBAAoB,IAAO;AACtC,cAAMc,IAAOZ,EAAaU,CAAI;AAC9B,QAAAF,EAAMC,CAAW,IAAIG,IAGnBR,EAAoBK,CAAW,MAAM,UACrCG,IAAOR,EAAoBK,CAAW,OAEtCL,EAAoBK,CAAW,IAAIG;AAAA,MAE7C;AAEM,MAAAL,EAAI,KAAKG,CAAI;AAAA,IACnB;AAEI,IAAAR,EAAWI,CAAQ,IAAIC,GACvBJ,EAAWG,CAAQ,IAAIE;AAAA,EAC3B;AAGE,MAAIC,IAAc;AAElB,MAAI,OAAOV,KAAU,YAAY,YAAYA;AAC3C,WAAO,EAAEU,IAAcJ;AACrB,MAAAJ,EAAWQ,CAAW,IAAII,EAAYd,EAAMU,CAAW,CAAC;AAAA,OAErD;AACL,UAAMK,IAAOD,EAAYd,CAAK;AAE9B,WAAO,EAAEU,IAAcJ;AACrB,MAAAJ,EAAWQ,CAAW,IAAIK;AAAA,EAEhC;AAGE,EAAAL,IAAc;AAEd,QAAMF,IAAM,CAAA,GAENC,IAAQ,CAAA;AAEd,SAAO,EAAEC,IAAcJ,KAAiB;AACtC,UAAMS,IAAOb,EAAWQ,CAAW;AACnC,QAAIM,IAAS,IACTC,IAAQ;AAEZ,IAAIF,MAAS,MACXC,IAAS,KACTC,IAAQ,OACCF,MAAS,MAClBC,IAAS,MACAD,MAAS,QAClBE,IAAQ;AAIV,QAAIJ,IACFd,EAAS,oBAAoB,KACzB,IACA,KAAK;AAAA,MACH;AAAA,MACAM,EAAoBK,CAAW,IAAIM,EAAO,SAASC,EAAM;AAAA,IACrE;AAEI,UAAMN,IAAOK,IAAS,IAAI,OAAOH,CAAI,IAAII;AAEzC,IAAIlB,EAAS,oBAAoB,OAC/Bc,IAAOG,EAAO,SAASH,IAAOI,EAAM,QAEhCJ,IAAOR,EAAoBK,CAAW,MACxCL,EAAoBK,CAAW,IAAIG,IAGrCJ,EAAMC,CAAW,IAAIG,IAGvBL,EAAIE,CAAW,IAAIC;AAAA,EACvB;AAGE,EAAAR,EAAW,OAAO,GAAG,GAAGK,CAAG,GAC3BJ,EAAW,OAAO,GAAG,GAAGK,CAAK,GAE7BF,IAAW;AAEX,QAAMW,IAAQ,CAAA;AAEd,SAAO,EAAEX,IAAWJ,EAAW,UAAQ;AACrC,UAAMK,IAAML,EAAWI,CAAQ,GACzBE,IAAQL,EAAWG,CAAQ;AACjC,IAAAG,IAAc;AAEd,UAAMS,IAAO,CAAA;AAEb,WAAO,EAAET,IAAcJ,KAAiB;AACtC,YAAMK,IAAOH,EAAIE,CAAW,KAAK;AACjC,UAAIM,IAAS,IACTC,IAAQ;AAEZ,UAAIlB,EAAS,oBAAoB,IAAO;AACtC,cAAMc,IACJR,EAAoBK,CAAW,KAAKD,EAAMC,CAAW,KAAK,IACtDK,IAAOb,EAAWQ,CAAW;AAEnC,QAAIK,MAAS,MACXC,IAAS,IAAI,OAAOH,CAAI,IACfE,MAAS,KACdF,IAAO,KACTG,IAAS,IAAI,OAAOH,IAAO,IAAI,GAAG,GAClCI,IAAQ,IAAI,OAAOJ,IAAO,IAAI,GAAG,MAEjCG,IAAS,IAAI,OAAOH,IAAO,CAAC,GAC5BI,IAAQD,KAGVC,IAAQ,IAAI,OAAOJ,CAAI;AAAA,MAEjC;AAEM,MAAId,EAAS,mBAAmB,MAAS,CAACW,KACxCS,EAAK,KAAK,GAAG,GAIbpB,EAAS,YAAY;AAAA;AAAA,MAGrB,EAAEA,EAAS,oBAAoB,MAASY,MAAS,QAChDZ,EAAS,mBAAmB,MAASW,MAEtCS,EAAK,KAAK,GAAG,GAGXpB,EAAS,oBAAoB,MAC/BoB,EAAK,KAAKH,CAAM,GAGlBG,EAAK,KAAKR,CAAI,GAEVZ,EAAS,oBAAoB,MAC/BoB,EAAK,KAAKF,CAAK,GAGblB,EAAS,YAAY,MACvBoB,EAAK,KAAK,GAAG,IAIbpB,EAAS,iBAAiB,MAC1BW,MAAgBJ,IAAkB,MAElCa,EAAK,KAAK,GAAG;AAAA,IAErB;AAEI,IAAAD,EAAM;AAAA,MACJnB,EAAS,iBAAiB,KACtBoB,EAAK,KAAK,EAAE,EAAE,QAAQ,OAAO,EAAE,IAC/BA,EAAK,KAAK,EAAE;AAAA,IACtB;AAAA,EACA;AAEE,SAAOD,EAAM,KAAK;AAAA,CAAI;AACxB;AAQA,SAASN,EAAUjB,GAAO;AACxB,SAAOA,KAAU,OAA8B,KAAK,OAAOA,CAAK;AAClE;AAQA,SAASmB,EAAYnB,GAAO;AAC1B,QAAMoB,IAAO,OAAOpB,KAAU,WAAWA,EAAM,YAAY,CAAC,IAAI;AAEhE,SAAOoB,MAAS,MAAgBA,MAAS,KACrC,KACAA,MAAS,MAAgBA,MAAS,MAChC,MACAA,MAAS,MAAgBA,MAAS,MAChC,MACA;AACV;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/mdast-util-find-and-replace@3.0.2/node_modules/mdast-util-find-and-replace/lib/index.es.js

@@ -0,0 +1,71 @@
+import b from "../../../../escape-string-regexp@5.0.0/node_modules/escape-string-regexp/index.es.js";
+import { convert as E } from "../../../../unist-util-is@6.0.0/node_modules/unist-util-is/lib/index.es.js";
+import { visitParents as I } from "../../../../unist-util-visit-parents@6.0.1/node_modules/unist-util-visit-parents/lib/index.es.js";
+function q(e, f, a) {
+  const p = E((a || {}).ignore || []), x = R(f);
+  let d = -1;
+  for (; ++d < x.length; )
+    I(e, "text", m);
+  function m(n, s) {
+    let c = -1, t;
+    for (; ++c < s.length; ) {
+      const u = s[c], r = t ? t.children : void 0;
+      if (p(
+        u,
+        r ? r.indexOf(u) : void 0,
+        t
+      ))
+        return;
+      t = u;
+    }
+    if (t)
+      return w(n, s);
+  }
+  function w(n, s) {
+    const c = s[s.length - 1], t = x[d][0], u = x[d][1];
+    let r = 0;
+    const y = c.children.indexOf(n);
+    let v = !1, l = [];
+    t.lastIndex = 0;
+    let o = t.exec(n.value);
+    for (; o; ) {
+      const h = o.index, A = {
+        index: o.index,
+        input: o.input,
+        stack: [...s, n]
+      };
+      let i = u(...o, A);
+      if (typeof i == "string" && (i = i.length > 0 ? { type: "text", value: i } : void 0), i === !1 ? t.lastIndex = h + 1 : (r !== h && l.push({
+        type: "text",
+        value: n.value.slice(r, h)
+      }), Array.isArray(i) ? l.push(...i) : i && l.push(i), r = h + o[0].length, v = !0), !t.global)
+        break;
+      o = t.exec(n.value);
+    }
+    return v ? (r < n.value.length && l.push({ type: "text", value: n.value.slice(r) }), c.children.splice(y, 1, ...l)) : l = [n], y + l.length;
+  }
+}
+function R(e) {
+  const f = [];
+  if (!Array.isArray(e))
+    throw new TypeError("Expected find and replace tuple or list of tuples");
+  const a = !e[0] || Array.isArray(e[0]) ? e : [e];
+  let g = -1;
+  for (; ++g < a.length; ) {
+    const p = a[g];
+    f.push([k(p[0]), P(p[1])]);
+  }
+  return f;
+}
+function k(e) {
+  return typeof e == "string" ? new RegExp(b(e), "g") : e;
+}
+function P(e) {
+  return typeof e == "function" ? e : function() {
+    return e;
+  };
+}
+export {
+  q as findAndReplace
+};
+//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/mdast-util-find-and-replace@3.0.2/node_modules/mdast-util-find-and-replace/lib/index.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../../../../node_modules/.pnpm/mdast-util-find-and-replace@3.0.2/node_modules/mdast-util-find-and-replace/lib/index.js"],"sourcesContent":["/**\n * @import {Nodes, Parents, PhrasingContent, Root, Text} from 'mdast'\n * @import {BuildVisitor, Test, VisitorResult} from 'unist-util-visit-parents'\n */\n\n/**\n * @typedef RegExpMatchObject\n *   Info on the match.\n * @property {number} index\n *   The index of the search at which the result was found.\n * @property {string} input\n *   A copy of the search string in the text node.\n * @property {[...Array<Parents>, Text]} stack\n *   All ancestors of the text node, where the last node is the text itself.\n *\n * @typedef {RegExp | string} Find\n *   Pattern to find.\n *\n *   Strings are escaped and then turned into global expressions.\n *\n * @typedef {Array<FindAndReplaceTuple>} FindAndReplaceList\n *   Several find and replaces, in array form.\n *\n * @typedef {[Find, Replace?]} FindAndReplaceTuple\n *   Find and replace in tuple form.\n *\n * @typedef {ReplaceFunction | string | null | undefined} Replace\n *   Thing to replace with.\n *\n * @callback ReplaceFunction\n *   Callback called when a search matches.\n * @param {...any} parameters\n *   The parameters are the result of corresponding search expression:\n *\n *   * `value` (`string`) — whole match\n *   * `...capture` (`Array<string>`) — matches from regex capture groups\n *   * `match` (`RegExpMatchObject`) — info on the match\n * @returns {Array<PhrasingContent> | PhrasingContent | string | false | null | undefined}\n *   Thing to replace with.\n *\n *   * when `null`, `undefined`, `''`, remove the match\n *   * …or when `false`, do not replace at all\n *   * …or when `string`, replace with a text node of that value\n *   * …or when `Node` or `Array<Node>`, replace with those nodes\n *\n * @typedef {[RegExp, ReplaceFunction]} Pair\n *   Normalized find and replace.\n *\n * @typedef {Array<Pair>} Pairs\n *   All find and replaced.\n *\n * @typedef Options\n *   Configuration.\n * @property {Test | null | undefined} [ignore]\n *   Test for which nodes to ignore (optional).\n */\n\nimport escape from 'escape-string-regexp'\nimport {visitParents} from 'unist-util-visit-parents'\nimport {convert} from 'unist-util-is'\n\n/**\n * Find patterns in a tree and replace them.\n *\n * The algorithm searches the tree in *preorder* for complete values in `Text`\n * nodes.\n * Partial matches are not supported.\n *\n * @param {Nodes} tree\n *   Tree to change.\n * @param {FindAndReplaceList | FindAndReplaceTuple} list\n *   Patterns to find.\n * @param {Options | null | undefined} [options]\n *   Configuration (when `find` is not `Find`).\n * @returns {undefined}\n *   Nothing.\n */\nexport function findAndReplace(tree, list, options) {\n  const settings = options || {}\n  const ignored = convert(settings.ignore || [])\n  const pairs = toPairs(list)\n  let pairIndex = -1\n\n  while (++pairIndex < pairs.length) {\n    visitParents(tree, 'text', visitor)\n  }\n\n  /** @type {BuildVisitor<Root, 'text'>} */\n  function visitor(node, parents) {\n    let index = -1\n    /** @type {Parents | undefined} */\n    let grandparent\n\n    while (++index < parents.length) {\n      const parent = parents[index]\n      /** @type {Array<Nodes> | undefined} */\n      const siblings = grandparent ? grandparent.children : undefined\n\n      if (\n        ignored(\n          parent,\n          siblings ? siblings.indexOf(parent) : undefined,\n          grandparent\n        )\n      ) {\n        return\n      }\n\n      grandparent = parent\n    }\n\n    if (grandparent) {\n      return handler(node, parents)\n    }\n  }\n\n  /**\n   * Handle a text node which is not in an ignored parent.\n   *\n   * @param {Text} node\n   *   Text node.\n   * @param {Array<Parents>} parents\n   *   Parents.\n   * @returns {VisitorResult}\n   *   Result.\n   */\n  function handler(node, parents) {\n    const parent = parents[parents.length - 1]\n    const find = pairs[pairIndex][0]\n    const replace = pairs[pairIndex][1]\n    let start = 0\n    /** @type {Array<Nodes>} */\n    const siblings = parent.children\n    const index = siblings.indexOf(node)\n    let change = false\n    /** @type {Array<PhrasingContent>} */\n    let nodes = []\n\n    find.lastIndex = 0\n\n    let match = find.exec(node.value)\n\n    while (match) {\n      const position = match.index\n      /** @type {RegExpMatchObject} */\n      const matchObject = {\n        index: match.index,\n        input: match.input,\n        stack: [...parents, node]\n      }\n      let value = replace(...match, matchObject)\n\n      if (typeof value === 'string') {\n        value = value.length > 0 ? {type: 'text', value} : undefined\n      }\n\n      // It wasn’t a match after all.\n      if (value === false) {\n        // False acts as if there was no match.\n        // So we need to reset `lastIndex`, which currently being at the end of\n        // the current match, to the beginning.\n        find.lastIndex = position + 1\n      } else {\n        if (start !== position) {\n          nodes.push({\n            type: 'text',\n            value: node.value.slice(start, position)\n          })\n        }\n\n        if (Array.isArray(value)) {\n          nodes.push(...value)\n        } else if (value) {\n          nodes.push(value)\n        }\n\n        start = position + match[0].length\n        change = true\n      }\n\n      if (!find.global) {\n        break\n      }\n\n      match = find.exec(node.value)\n    }\n\n    if (change) {\n      if (start < node.value.length) {\n        nodes.push({type: 'text', value: node.value.slice(start)})\n      }\n\n      parent.children.splice(index, 1, ...nodes)\n    } else {\n      nodes = [node]\n    }\n\n    return index + nodes.length\n  }\n}\n\n/**\n * Turn a tuple or a list of tuples into pairs.\n *\n * @param {FindAndReplaceList | FindAndReplaceTuple} tupleOrList\n *   Schema.\n * @returns {Pairs}\n *   Clean pairs.\n */\nfunction toPairs(tupleOrList) {\n  /** @type {Pairs} */\n  const result = []\n\n  if (!Array.isArray(tupleOrList)) {\n    throw new TypeError('Expected find and replace tuple or list of tuples')\n  }\n\n  /** @type {FindAndReplaceList} */\n  // @ts-expect-error: correct.\n  const list =\n    !tupleOrList[0] || Array.isArray(tupleOrList[0])\n      ? tupleOrList\n      : [tupleOrList]\n\n  let index = -1\n\n  while (++index < list.length) {\n    const tuple = list[index]\n    result.push([toExpression(tuple[0]), toFunction(tuple[1])])\n  }\n\n  return result\n}\n\n/**\n * Turn a find into an expression.\n *\n * @param {Find} find\n *   Find.\n * @returns {RegExp}\n *   Expression.\n */\nfunction toExpression(find) {\n  return typeof find === 'string' ? new RegExp(escape(find), 'g') : find\n}\n\n/**\n * Turn a replace into a function.\n *\n * @param {Replace} replace\n *   Replace.\n * @returns {ReplaceFunction}\n *   Function.\n */\nfunction toFunction(replace) {\n  return typeof replace === 'function'\n    ? replace\n    : function () {\n        return replace\n      }\n}\n"],"names":["findAndReplace","tree","list","options","ignored","convert","pairs","toPairs","pairIndex","visitParents","visitor","node","parents","index","grandparent","parent","siblings","handler","find","replace","start","change","nodes","match","position","matchObject","value","tupleOrList","result","tuple","toExpression","toFunction","escape"],"mappings":";;;AA6EO,SAASA,EAAeC,GAAMC,GAAMC,GAAS;AAElD,QAAMC,IAAUC,GADCF,KAAW,CAAA,GACK,UAAU,CAAE,CAAA,GACvCG,IAAQC,EAAQL,CAAI;AAC1B,MAAIM,IAAY;AAEhB,SAAO,EAAEA,IAAYF,EAAM;AACzB,IAAAG,EAAaR,GAAM,QAAQS,CAAO;AAIpC,WAASA,EAAQC,GAAMC,GAAS;AAC9B,QAAIC,IAAQ,IAERC;AAEJ,WAAO,EAAED,IAAQD,EAAQ,UAAQ;AAC/B,YAAMG,IAASH,EAAQC,CAAK,GAEtBG,IAAWF,IAAcA,EAAY,WAAW;AAEtD,UACEV;AAAA,QACEW;AAAA,QACAC,IAAWA,EAAS,QAAQD,CAAM,IAAI;AAAA,QACtCD;AAAA,MACV;AAEQ;AAGF,MAAAA,IAAcC;AAAA,IACpB;AAEI,QAAID;AACF,aAAOG,EAAQN,GAAMC,CAAO;AAAA,EAElC;AAYE,WAASK,EAAQN,GAAMC,GAAS;AAC9B,UAAMG,IAASH,EAAQA,EAAQ,SAAS,CAAC,GACnCM,IAAOZ,EAAME,CAAS,EAAE,CAAC,GACzBW,IAAUb,EAAME,CAAS,EAAE,CAAC;AAClC,QAAIY,IAAQ;AAGZ,UAAMP,IADWE,EAAO,SACD,QAAQJ,CAAI;AACnC,QAAIU,IAAS,IAETC,IAAQ,CAAA;AAEZ,IAAAJ,EAAK,YAAY;AAEjB,QAAIK,IAAQL,EAAK,KAAKP,EAAK,KAAK;AAEhC,WAAOY,KAAO;AACZ,YAAMC,IAAWD,EAAM,OAEjBE,IAAc;AAAA,QAClB,OAAOF,EAAM;AAAA,QACb,OAAOA,EAAM;AAAA,QACb,OAAO,CAAC,GAAGX,GAASD,CAAI;AAAA,MAChC;AACM,UAAIe,IAAQP,EAAQ,GAAGI,GAAOE,CAAW;AA8BzC,UA5BI,OAAOC,KAAU,aACnBA,IAAQA,EAAM,SAAS,IAAI,EAAC,MAAM,QAAQ,OAAAA,EAAK,IAAI,SAIjDA,MAAU,KAIZR,EAAK,YAAYM,IAAW,KAExBJ,MAAUI,KACZF,EAAM,KAAK;AAAA,QACT,MAAM;AAAA,QACN,OAAOX,EAAK,MAAM,MAAMS,GAAOI,CAAQ;AAAA,MACxC,CAAA,GAGC,MAAM,QAAQE,CAAK,IACrBJ,EAAM,KAAK,GAAGI,CAAK,IACVA,KACTJ,EAAM,KAAKI,CAAK,GAGlBN,IAAQI,IAAWD,EAAM,CAAC,EAAE,QAC5BF,IAAS,KAGP,CAACH,EAAK;AACR;AAGF,MAAAK,IAAQL,EAAK,KAAKP,EAAK,KAAK;AAAA,IAClC;AAEI,WAAIU,KACED,IAAQT,EAAK,MAAM,UACrBW,EAAM,KAAK,EAAC,MAAM,QAAQ,OAAOX,EAAK,MAAM,MAAMS,CAAK,EAAC,CAAC,GAG3DL,EAAO,SAAS,OAAOF,GAAO,GAAG,GAAGS,CAAK,KAEzCA,IAAQ,CAACX,CAAI,GAGRE,IAAQS,EAAM;AAAA,EACzB;AACA;AAUA,SAASf,EAAQoB,GAAa;AAE5B,QAAMC,IAAS,CAAA;AAEf,MAAI,CAAC,MAAM,QAAQD,CAAW;AAC5B,UAAM,IAAI,UAAU,mDAAmD;AAKzE,QAAMzB,IACJ,CAACyB,EAAY,CAAC,KAAK,MAAM,QAAQA,EAAY,CAAC,CAAC,IAC3CA,IACA,CAACA,CAAW;AAElB,MAAId,IAAQ;AAEZ,SAAO,EAAEA,IAAQX,EAAK,UAAQ;AAC5B,UAAM2B,IAAQ3B,EAAKW,CAAK;AACxB,IAAAe,EAAO,KAAK,CAACE,EAAaD,EAAM,CAAC,CAAC,GAAGE,EAAWF,EAAM,CAAC,CAAC,CAAC,CAAC;AAAA,EAC9D;AAEE,SAAOD;AACT;AAUA,SAASE,EAAaZ,GAAM;AAC1B,SAAO,OAAOA,KAAS,WAAW,IAAI,OAAOc,EAAOd,CAAI,GAAG,GAAG,IAAIA;AACpE;AAUA,SAASa,EAAWZ,GAAS;AAC3B,SAAO,OAAOA,KAAY,aACtBA,IACA,WAAY;AACV,WAAOA;AAAA,EACf;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/mdast-util-gfm-autolink-literal@2.0.1/node_modules/mdast-util-gfm-autolink-literal/lib/index.es.js

@@ -0,0 +1,131 @@
+import { ccount as f } from "../../../../ccount@2.0.1/node_modules/ccount/index.es.js";
+import { ok as k } from "../../../../devlop@1.1.0/node_modules/devlop/lib/default.es.js";
+import { unicodeWhitespace as p, unicodePunctuation as d } from "../../../../micromark-util-character@2.1.1/node_modules/micromark-util-character/index.es.js";
+import { findAndReplace as g } from "../../../../mdast-util-find-and-replace@3.0.2/node_modules/mdast-util-find-and-replace/lib/index.es.js";
+const a = "phrasing", u = ["autolink", "link", "image", "label"];
+function b() {
+  return {
+    transforms: [y],
+    enter: {
+      literalAutolink: w,
+      literalAutolinkEmail: s,
+      literalAutolinkHttp: s,
+      literalAutolinkWww: s
+    },
+    exit: {
+      literalAutolink: L,
+      literalAutolinkEmail: m,
+      literalAutolinkHttp: x,
+      literalAutolinkWww: A
+    }
+  };
+}
+function I() {
+  return {
+    unsafe: [
+      {
+        character: "@",
+        before: "[+\\-.\\w]",
+        after: "[\\-.\\w]",
+        inConstruct: a,
+        notInConstruct: u
+      },
+      {
+        character: ".",
+        before: "[Ww]",
+        after: "[\\-.\\w]",
+        inConstruct: a,
+        notInConstruct: u
+      },
+      {
+        character: ":",
+        before: "[ps]",
+        after: "\\/",
+        inConstruct: a,
+        notInConstruct: u
+      }
+    ]
+  };
+}
+function w(t) {
+  this.enter({ type: "link", title: null, url: "", children: [] }, t);
+}
+function s(t) {
+  this.config.enter.autolinkProtocol.call(this, t);
+}
+function x(t) {
+  this.config.exit.autolinkProtocol.call(this, t);
+}
+function A(t) {
+  this.config.exit.data.call(this, t);
+  const e = this.stack[this.stack.length - 1];
+  k(e.type === "link"), e.url = "http://" + this.sliceSerialize(t);
+}
+function m(t) {
+  this.config.exit.autolinkEmail.call(this, t);
+}
+function L(t) {
+  this.exit(t);
+}
+function y(t) {
+  g(
+    t,
+    [
+      [/(https?:\/\/|www(?=\.))([-.\w]+)([^ \t\r\n]*)/gi, P],
+      [new RegExp("(?<=^|\\s|\\p{P}|\\p{S})([-.\\w+]+)@([-\\w]+(?:\\.[-\\w]+)+)", "gu"), E]
+    ],
+    { ignore: ["link", "linkReference"] }
+  );
+}
+function P(t, e, i, n, o) {
+  let l = "";
+  if (!h(o) || (/^w/i.test(e) && (i = e + i, e = "", l = "http://"), !W(i)))
+    return !1;
+  const r = _(i + n);
+  if (!r[0]) return !1;
+  const c = {
+    type: "link",
+    title: null,
+    url: l + e + r[0],
+    children: [{ type: "text", value: e + r[0] }]
+  };
+  return r[1] ? [c, { type: "text", value: r[1] }] : c;
+}
+function E(t, e, i, n) {
+  return (
+    // Not an expected previous character.
+    !h(n, !0) || // Label ends in not allowed character.
+    /[-\d_]$/.test(i) ? !1 : {
+      type: "link",
+      title: null,
+      url: "mailto:" + e + "@" + i,
+      children: [{ type: "text", value: e + "@" + i }]
+    }
+  );
+}
+function W(t) {
+  const e = t.split(".");
+  return !(e.length < 2 || e[e.length - 1] && (/_/.test(e[e.length - 1]) || !/[a-zA-Z\d]/.test(e[e.length - 1])) || e[e.length - 2] && (/_/.test(e[e.length - 2]) || !/[a-zA-Z\d]/.test(e[e.length - 2])));
+}
+function _(t) {
+  const e = /[!"&'),.:;<>?\]}]+$/.exec(t);
+  if (!e)
+    return [t, void 0];
+  t = t.slice(0, e.index);
+  let i = e[0], n = i.indexOf(")");
+  const o = f(t, "(");
+  let l = f(t, ")");
+  for (; n !== -1 && o > l; )
+    t += i.slice(0, n + 1), i = i.slice(n + 1), n = i.indexOf(")"), l++;
+  return [t, i];
+}
+function h(t, e) {
+  const i = t.input.charCodeAt(t.index - 1);
+  return (t.index === 0 || p(i) || d(i)) && // If it’s an email, the previous character should not be a slash.
+  (!e || i !== 47);
+}
+export {
+  b as gfmAutolinkLiteralFromMarkdown,
+  I as gfmAutolinkLiteralToMarkdown
+};
+//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/mdast-util-gfm-autolink-literal@2.0.1/node_modules/mdast-util-gfm-autolink-literal/lib/index.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../../../../node_modules/.pnpm/mdast-util-gfm-autolink-literal@2.0.1/node_modules/mdast-util-gfm-autolink-literal/lib/index.js"],"sourcesContent":["/**\n * @import {RegExpMatchObject, ReplaceFunction} from 'mdast-util-find-and-replace'\n * @import {CompileContext, Extension as FromMarkdownExtension, Handle as FromMarkdownHandle, Transform as FromMarkdownTransform} from 'mdast-util-from-markdown'\n * @import {ConstructName, Options as ToMarkdownExtension} from 'mdast-util-to-markdown'\n * @import {Link, PhrasingContent} from 'mdast'\n */\n\nimport {ccount} from 'ccount'\nimport {ok as assert} from 'devlop'\nimport {unicodePunctuation, unicodeWhitespace} from 'micromark-util-character'\nimport {findAndReplace} from 'mdast-util-find-and-replace'\n\n/** @type {ConstructName} */\nconst inConstruct = 'phrasing'\n/** @type {Array<ConstructName>} */\nconst notInConstruct = ['autolink', 'link', 'image', 'label']\n\n/**\n * Create an extension for `mdast-util-from-markdown` to enable GFM autolink\n * literals in markdown.\n *\n * @returns {FromMarkdownExtension}\n *   Extension for `mdast-util-to-markdown` to enable GFM autolink literals.\n */\nexport function gfmAutolinkLiteralFromMarkdown() {\n  return {\n    transforms: [transformGfmAutolinkLiterals],\n    enter: {\n      literalAutolink: enterLiteralAutolink,\n      literalAutolinkEmail: enterLiteralAutolinkValue,\n      literalAutolinkHttp: enterLiteralAutolinkValue,\n      literalAutolinkWww: enterLiteralAutolinkValue\n    },\n    exit: {\n      literalAutolink: exitLiteralAutolink,\n      literalAutolinkEmail: exitLiteralAutolinkEmail,\n      literalAutolinkHttp: exitLiteralAutolinkHttp,\n      literalAutolinkWww: exitLiteralAutolinkWww\n    }\n  }\n}\n\n/**\n * Create an extension for `mdast-util-to-markdown` to enable GFM autolink\n * literals in markdown.\n *\n * @returns {ToMarkdownExtension}\n *   Extension for `mdast-util-to-markdown` to enable GFM autolink literals.\n */\nexport function gfmAutolinkLiteralToMarkdown() {\n  return {\n    unsafe: [\n      {\n        character: '@',\n        before: '[+\\\\-.\\\\w]',\n        after: '[\\\\-.\\\\w]',\n        inConstruct,\n        notInConstruct\n      },\n      {\n        character: '.',\n        before: '[Ww]',\n        after: '[\\\\-.\\\\w]',\n        inConstruct,\n        notInConstruct\n      },\n      {\n        character: ':',\n        before: '[ps]',\n        after: '\\\\/',\n        inConstruct,\n        notInConstruct\n      }\n    ]\n  }\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterLiteralAutolink(token) {\n  this.enter({type: 'link', title: null, url: '', children: []}, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterLiteralAutolinkValue(token) {\n  this.config.enter.autolinkProtocol.call(this, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitLiteralAutolinkHttp(token) {\n  this.config.exit.autolinkProtocol.call(this, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitLiteralAutolinkWww(token) {\n  this.config.exit.data.call(this, token)\n  const node = this.stack[this.stack.length - 1]\n  assert(node.type === 'link')\n  node.url = 'http://' + this.sliceSerialize(token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitLiteralAutolinkEmail(token) {\n  this.config.exit.autolinkEmail.call(this, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitLiteralAutolink(token) {\n  this.exit(token)\n}\n\n/** @type {FromMarkdownTransform} */\nfunction transformGfmAutolinkLiterals(tree) {\n  findAndReplace(\n    tree,\n    [\n      [/(https?:\\/\\/|www(?=\\.))([-.\\w]+)([^ \\t\\r\\n]*)/gi, findUrl],\n      [/(?<=^|\\s|\\p{P}|\\p{S})([-.\\w+]+)@([-\\w]+(?:\\.[-\\w]+)+)/gu, findEmail]\n    ],\n    {ignore: ['link', 'linkReference']}\n  )\n}\n\n/**\n * @type {ReplaceFunction}\n * @param {string} _\n * @param {string} protocol\n * @param {string} domain\n * @param {string} path\n * @param {RegExpMatchObject} match\n * @returns {Array<PhrasingContent> | Link | false}\n */\n// eslint-disable-next-line max-params\nfunction findUrl(_, protocol, domain, path, match) {\n  let prefix = ''\n\n  // Not an expected previous character.\n  if (!previous(match)) {\n    return false\n  }\n\n  // Treat `www` as part of the domain.\n  if (/^w/i.test(protocol)) {\n    domain = protocol + domain\n    protocol = ''\n    prefix = 'http://'\n  }\n\n  if (!isCorrectDomain(domain)) {\n    return false\n  }\n\n  const parts = splitUrl(domain + path)\n\n  if (!parts[0]) return false\n\n  /** @type {Link} */\n  const result = {\n    type: 'link',\n    title: null,\n    url: prefix + protocol + parts[0],\n    children: [{type: 'text', value: protocol + parts[0]}]\n  }\n\n  if (parts[1]) {\n    return [result, {type: 'text', value: parts[1]}]\n  }\n\n  return result\n}\n\n/**\n * @type {ReplaceFunction}\n * @param {string} _\n * @param {string} atext\n * @param {string} label\n * @param {RegExpMatchObject} match\n * @returns {Link | false}\n */\nfunction findEmail(_, atext, label, match) {\n  if (\n    // Not an expected previous character.\n    !previous(match, true) ||\n    // Label ends in not allowed character.\n    /[-\\d_]$/.test(label)\n  ) {\n    return false\n  }\n\n  return {\n    type: 'link',\n    title: null,\n    url: 'mailto:' + atext + '@' + label,\n    children: [{type: 'text', value: atext + '@' + label}]\n  }\n}\n\n/**\n * @param {string} domain\n * @returns {boolean}\n */\nfunction isCorrectDomain(domain) {\n  const parts = domain.split('.')\n\n  if (\n    parts.length < 2 ||\n    (parts[parts.length - 1] &&\n      (/_/.test(parts[parts.length - 1]) ||\n        !/[a-zA-Z\\d]/.test(parts[parts.length - 1]))) ||\n    (parts[parts.length - 2] &&\n      (/_/.test(parts[parts.length - 2]) ||\n        !/[a-zA-Z\\d]/.test(parts[parts.length - 2])))\n  ) {\n    return false\n  }\n\n  return true\n}\n\n/**\n * @param {string} url\n * @returns {[string, string | undefined]}\n */\nfunction splitUrl(url) {\n  const trailExec = /[!\"&'),.:;<>?\\]}]+$/.exec(url)\n\n  if (!trailExec) {\n    return [url, undefined]\n  }\n\n  url = url.slice(0, trailExec.index)\n\n  let trail = trailExec[0]\n  let closingParenIndex = trail.indexOf(')')\n  const openingParens = ccount(url, '(')\n  let closingParens = ccount(url, ')')\n\n  while (closingParenIndex !== -1 && openingParens > closingParens) {\n    url += trail.slice(0, closingParenIndex + 1)\n    trail = trail.slice(closingParenIndex + 1)\n    closingParenIndex = trail.indexOf(')')\n    closingParens++\n  }\n\n  return [url, trail]\n}\n\n/**\n * @param {RegExpMatchObject} match\n * @param {boolean | null | undefined} [email=false]\n * @returns {boolean}\n */\nfunction previous(match, email) {\n  const code = match.input.charCodeAt(match.index - 1)\n\n  return (\n    (match.index === 0 ||\n      unicodeWhitespace(code) ||\n      unicodePunctuation(code)) &&\n    // If it’s an email, the previous character should not be a slash.\n    (!email || code !== 47)\n  )\n}\n"],"names":["inConstruct","notInConstruct","gfmAutolinkLiteralFromMarkdown","transformGfmAutolinkLiterals","enterLiteralAutolink","enterLiteralAutolinkValue","exitLiteralAutolink","exitLiteralAutolinkEmail","exitLiteralAutolinkHttp","exitLiteralAutolinkWww","gfmAutolinkLiteralToMarkdown","token","node","assert","tree","findAndReplace","findUrl","findEmail","_","protocol","domain","path","match","prefix","previous","isCorrectDomain","parts","splitUrl","result","atext","label","url","trailExec","trail","closingParenIndex","openingParens","ccount","closingParens","email","code","unicodeWhitespace","unicodePunctuation"],"mappings":";;;;AAaA,MAAMA,IAAc,YAEdC,IAAiB,CAAC,YAAY,QAAQ,SAAS,OAAO;AASrD,SAASC,IAAiC;AAC/C,SAAO;AAAA,IACL,YAAY,CAACC,CAA4B;AAAA,IACzC,OAAO;AAAA,MACL,iBAAiBC;AAAA,MACjB,sBAAsBC;AAAA,MACtB,qBAAqBA;AAAA,MACrB,oBAAoBA;AAAA,IACrB;AAAA,IACD,MAAM;AAAA,MACJ,iBAAiBC;AAAA,MACjB,sBAAsBC;AAAA,MACtB,qBAAqBC;AAAA,MACrB,oBAAoBC;AAAA,IAC1B;AAAA,EACA;AACA;AASO,SAASC,IAA+B;AAC7C,SAAO;AAAA,IACL,QAAQ;AAAA,MACN;AAAA,QACE,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,aAAAV;AAAA,QACA,gBAAAC;AAAA,MACD;AAAA,MACD;AAAA,QACE,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,aAAAD;AAAA,QACA,gBAAAC;AAAA,MACD;AAAA,MACD;AAAA,QACE,WAAW;AAAA,QACX,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,aAAAD;AAAA,QACA,gBAAAC;AAAA,MACR;AAAA,IACA;AAAA,EACA;AACA;AAMA,SAASG,EAAqBO,GAAO;AACnC,OAAK,MAAM,EAAC,MAAM,QAAQ,OAAO,MAAM,KAAK,IAAI,UAAU,CAAA,EAAE,GAAGA,CAAK;AACtE;AAMA,SAASN,EAA0BM,GAAO;AACxC,OAAK,OAAO,MAAM,iBAAiB,KAAK,MAAMA,CAAK;AACrD;AAMA,SAASH,EAAwBG,GAAO;AACtC,OAAK,OAAO,KAAK,iBAAiB,KAAK,MAAMA,CAAK;AACpD;AAMA,SAASF,EAAuBE,GAAO;AACrC,OAAK,OAAO,KAAK,KAAK,KAAK,MAAMA,CAAK;AACtC,QAAMC,IAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7CC,EAAAA,EAAOD,EAAK,SAAS,MAAM,GAC3BA,EAAK,MAAM,YAAY,KAAK,eAAeD,CAAK;AAClD;AAMA,SAASJ,EAAyBI,GAAO;AACvC,OAAK,OAAO,KAAK,cAAc,KAAK,MAAMA,CAAK;AACjD;AAMA,SAASL,EAAoBK,GAAO;AAClC,OAAK,KAAKA,CAAK;AACjB;AAGA,SAASR,EAA6BW,GAAM;AAC1C,EAAAC;AAAA,IACED;AAAA,IACA;AAAA,MACE,CAAC,mDAAmDE,CAAO;AAAA,MAC3D,CAAC,WAAyD,gEAAA,IAAA,GAAEC,CAAS;AAAA,IACtE;AAAA,IACD,EAAC,QAAQ,CAAC,QAAQ,eAAe,EAAC;AAAA,EACtC;AACA;AAYA,SAASD,EAAQE,GAAGC,GAAUC,GAAQC,GAAMC,GAAO;AACjD,MAAIC,IAAS;AAcb,MAXI,CAACC,EAASF,CAAK,MAKf,MAAM,KAAKH,CAAQ,MACrBC,IAASD,IAAWC,GACpBD,IAAW,IACXI,IAAS,YAGP,CAACE,EAAgBL,CAAM;AACzB,WAAO;AAGT,QAAMM,IAAQC,EAASP,IAASC,CAAI;AAEpC,MAAI,CAACK,EAAM,CAAC,EAAG,QAAO;AAGtB,QAAME,IAAS;AAAA,IACb,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAKL,IAASJ,IAAWO,EAAM,CAAC;AAAA,IAChC,UAAU,CAAC,EAAC,MAAM,QAAQ,OAAOP,IAAWO,EAAM,CAAC,EAAC,CAAC;AAAA,EACzD;AAEE,SAAIA,EAAM,CAAC,IACF,CAACE,GAAQ,EAAC,MAAM,QAAQ,OAAOF,EAAM,CAAC,EAAC,CAAC,IAG1CE;AACT;AAUA,SAASX,EAAUC,GAAGW,GAAOC,GAAOR,GAAO;AACzC;AAAA;AAAA,IAEE,CAACE,EAASF,GAAO,EAAI;AAAA,IAErB,UAAU,KAAKQ,CAAK,IAEb,KAGF;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA,MACP,KAAK,YAAYD,IAAQ,MAAMC;AAAA,MAC/B,UAAU,CAAC,EAAC,MAAM,QAAQ,OAAOD,IAAQ,MAAMC,EAAK,CAAC;AAAA,IACzD;AAAA;AACA;AAMA,SAASL,EAAgBL,GAAQ;AAC/B,QAAMM,IAAQN,EAAO,MAAM,GAAG;AAE9B,SACE,EAAAM,EAAM,SAAS,KACdA,EAAMA,EAAM,SAAS,CAAC,MACpB,IAAI,KAAKA,EAAMA,EAAM,SAAS,CAAC,CAAC,KAC/B,CAAC,aAAa,KAAKA,EAAMA,EAAM,SAAS,CAAC,CAAC,MAC7CA,EAAMA,EAAM,SAAS,CAAC,MACpB,IAAI,KAAKA,EAAMA,EAAM,SAAS,CAAC,CAAC,KAC/B,CAAC,aAAa,KAAKA,EAAMA,EAAM,SAAS,CAAC,CAAC;AAMlD;AAMA,SAASC,EAASI,GAAK;AACrB,QAAMC,IAAY,sBAAsB,KAAKD,CAAG;AAEhD,MAAI,CAACC;AACH,WAAO,CAACD,GAAK,MAAS;AAGxB,EAAAA,IAAMA,EAAI,MAAM,GAAGC,EAAU,KAAK;AAElC,MAAIC,IAAQD,EAAU,CAAC,GACnBE,IAAoBD,EAAM,QAAQ,GAAG;AACzC,QAAME,IAAgBC,EAAOL,GAAK,GAAG;AACrC,MAAIM,IAAgBD,EAAOL,GAAK,GAAG;AAEnC,SAAOG,MAAsB,MAAMC,IAAgBE;AACjD,IAAAN,KAAOE,EAAM,MAAM,GAAGC,IAAoB,CAAC,GAC3CD,IAAQA,EAAM,MAAMC,IAAoB,CAAC,GACzCA,IAAoBD,EAAM,QAAQ,GAAG,GACrCI;AAGF,SAAO,CAACN,GAAKE,CAAK;AACpB;AAOA,SAAST,EAASF,GAAOgB,GAAO;AAC9B,QAAMC,IAAOjB,EAAM,MAAM,WAAWA,EAAM,QAAQ,CAAC;AAEnD,UACGA,EAAM,UAAU,KACfkB,EAAkBD,CAAI,KACtBE,EAAmBF,CAAI;AAAA,GAExB,CAACD,KAASC,MAAS;AAExB;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/mdast-util-gfm-footnote@2.1.0/node_modules/mdast-util-gfm-footnote/lib/index.es.js

@@ -0,0 +1,96 @@
+import { ok as a } from "../../../../devlop@1.1.0/node_modules/devlop/lib/default.es.js";
+import { normalizeIdentifier as s } from "../../../../micromark-util-normalize-identifier@2.0.1/node_modules/micromark-util-normalize-identifier/index.es.js";
+u.peek = S;
+function F() {
+  this.buffer();
+}
+function b(e) {
+  this.enter({ type: "footnoteReference", identifier: "", label: "" }, e);
+}
+function k() {
+  this.buffer();
+}
+function d(e) {
+  this.enter(
+    { type: "footnoteDefinition", identifier: "", label: "", children: [] },
+    e
+  );
+}
+function x(e) {
+  const n = this.resume(), t = this.stack[this.stack.length - 1];
+  a(t.type === "footnoteReference"), t.identifier = s(
+    this.sliceSerialize(e)
+  ).toLowerCase(), t.label = n;
+}
+function D(e) {
+  this.exit(e);
+}
+function p(e) {
+  const n = this.resume(), t = this.stack[this.stack.length - 1];
+  a(t.type === "footnoteDefinition"), t.identifier = s(
+    this.sliceSerialize(e)
+  ).toLowerCase(), t.label = n;
+}
+function C(e) {
+  this.exit(e);
+}
+function S() {
+  return "[";
+}
+function u(e, n, t, r) {
+  const l = t.createTracker(r);
+  let o = l.move("[^");
+  const c = t.enter("footnoteReference"), i = t.enter("reference");
+  return o += l.move(
+    t.safe(t.associationId(e), { after: "]", before: o })
+  ), i(), c(), o += l.move("]"), o;
+}
+function R() {
+  return {
+    enter: {
+      gfmFootnoteCallString: F,
+      gfmFootnoteCall: b,
+      gfmFootnoteDefinitionLabelString: k,
+      gfmFootnoteDefinition: d
+    },
+    exit: {
+      gfmFootnoteCallString: x,
+      gfmFootnoteCall: D,
+      gfmFootnoteDefinitionLabelString: p,
+      gfmFootnoteDefinition: C
+    }
+  };
+}
+function y(e) {
+  let n = !1;
+  return e && e.firstLineBlank && (n = !0), {
+    handlers: { footnoteDefinition: t, footnoteReference: u },
+    // This is on by default already.
+    unsafe: [{ character: "[", inConstruct: ["label", "phrasing", "reference"] }]
+  };
+  function t(r, l, o, c) {
+    const i = o.createTracker(c);
+    let f = i.move("[^");
+    const h = o.enter("footnoteDefinition"), g = o.enter("label");
+    return f += i.move(
+      o.safe(o.associationId(r), { before: f, after: "]" })
+    ), g(), f += i.move("]:"), r.children && r.children.length > 0 && (i.shift(4), f += i.move(
+      (n ? `
+` : " ") + o.indentLines(
+        o.containerFlow(r, i.current()),
+        n ? m : v
+      )
+    )), h(), f;
+  }
+}
+function v(e, n, t) {
+  return n === 0 ? e : m(e, n, t);
+}
+function m(e, n, t) {
+  return (t ? "" : "    ") + e;
+}
+export {
+  R as gfmFootnoteFromMarkdown,
+  y as gfmFootnoteToMarkdown
+};
+//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/mdast-util-gfm-footnote@2.1.0/node_modules/mdast-util-gfm-footnote/lib/index.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../../../../node_modules/.pnpm/mdast-util-gfm-footnote@2.1.0/node_modules/mdast-util-gfm-footnote/lib/index.js"],"sourcesContent":["/**\n * @import {\n *   CompileContext,\n *   Extension as FromMarkdownExtension,\n *   Handle as FromMarkdownHandle\n * } from 'mdast-util-from-markdown'\n * @import {ToMarkdownOptions} from 'mdast-util-gfm-footnote'\n * @import {\n *   Handle as ToMarkdownHandle,\n *   Map,\n *   Options as ToMarkdownExtension\n * } from 'mdast-util-to-markdown'\n * @import {FootnoteDefinition, FootnoteReference} from 'mdast'\n */\n\nimport {ok as assert} from 'devlop'\nimport {normalizeIdentifier} from 'micromark-util-normalize-identifier'\n\nfootnoteReference.peek = footnoteReferencePeek\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterFootnoteCallString() {\n  this.buffer()\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterFootnoteCall(token) {\n  this.enter({type: 'footnoteReference', identifier: '', label: ''}, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterFootnoteDefinitionLabelString() {\n  this.buffer()\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterFootnoteDefinition(token) {\n  this.enter(\n    {type: 'footnoteDefinition', identifier: '', label: '', children: []},\n    token\n  )\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitFootnoteCallString(token) {\n  const label = this.resume()\n  const node = this.stack[this.stack.length - 1]\n  assert(node.type === 'footnoteReference')\n  node.identifier = normalizeIdentifier(\n    this.sliceSerialize(token)\n  ).toLowerCase()\n  node.label = label\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitFootnoteCall(token) {\n  this.exit(token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitFootnoteDefinitionLabelString(token) {\n  const label = this.resume()\n  const node = this.stack[this.stack.length - 1]\n  assert(node.type === 'footnoteDefinition')\n  node.identifier = normalizeIdentifier(\n    this.sliceSerialize(token)\n  ).toLowerCase()\n  node.label = label\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitFootnoteDefinition(token) {\n  this.exit(token)\n}\n\n/** @type {ToMarkdownHandle} */\nfunction footnoteReferencePeek() {\n  return '['\n}\n\n/**\n * @type {ToMarkdownHandle}\n * @param {FootnoteReference} node\n */\nfunction footnoteReference(node, _, state, info) {\n  const tracker = state.createTracker(info)\n  let value = tracker.move('[^')\n  const exit = state.enter('footnoteReference')\n  const subexit = state.enter('reference')\n  value += tracker.move(\n    state.safe(state.associationId(node), {after: ']', before: value})\n  )\n  subexit()\n  exit()\n  value += tracker.move(']')\n  return value\n}\n\n/**\n * Create an extension for `mdast-util-from-markdown` to enable GFM footnotes\n * in markdown.\n *\n * @returns {FromMarkdownExtension}\n *   Extension for `mdast-util-from-markdown`.\n */\nexport function gfmFootnoteFromMarkdown() {\n  return {\n    enter: {\n      gfmFootnoteCallString: enterFootnoteCallString,\n      gfmFootnoteCall: enterFootnoteCall,\n      gfmFootnoteDefinitionLabelString: enterFootnoteDefinitionLabelString,\n      gfmFootnoteDefinition: enterFootnoteDefinition\n    },\n    exit: {\n      gfmFootnoteCallString: exitFootnoteCallString,\n      gfmFootnoteCall: exitFootnoteCall,\n      gfmFootnoteDefinitionLabelString: exitFootnoteDefinitionLabelString,\n      gfmFootnoteDefinition: exitFootnoteDefinition\n    }\n  }\n}\n\n/**\n * Create an extension for `mdast-util-to-markdown` to enable GFM footnotes\n * in markdown.\n *\n * @param {ToMarkdownOptions | null | undefined} [options]\n *   Configuration (optional).\n * @returns {ToMarkdownExtension}\n *   Extension for `mdast-util-to-markdown`.\n */\nexport function gfmFootnoteToMarkdown(options) {\n  // To do: next major: change default.\n  let firstLineBlank = false\n\n  if (options && options.firstLineBlank) {\n    firstLineBlank = true\n  }\n\n  return {\n    handlers: {footnoteDefinition, footnoteReference},\n    // This is on by default already.\n    unsafe: [{character: '[', inConstruct: ['label', 'phrasing', 'reference']}]\n  }\n\n  /**\n   * @type {ToMarkdownHandle}\n   * @param {FootnoteDefinition} node\n   */\n  function footnoteDefinition(node, _, state, info) {\n    const tracker = state.createTracker(info)\n    let value = tracker.move('[^')\n    const exit = state.enter('footnoteDefinition')\n    const subexit = state.enter('label')\n    value += tracker.move(\n      state.safe(state.associationId(node), {before: value, after: ']'})\n    )\n    subexit()\n\n    value += tracker.move(']:')\n\n    if (node.children && node.children.length > 0) {\n      tracker.shift(4)\n\n      value += tracker.move(\n        (firstLineBlank ? '\\n' : ' ') +\n          state.indentLines(\n            state.containerFlow(node, tracker.current()),\n            firstLineBlank ? mapAll : mapExceptFirst\n          )\n      )\n    }\n\n    exit()\n\n    return value\n  }\n}\n\n/** @type {Map} */\nfunction mapExceptFirst(line, index, blank) {\n  return index === 0 ? line : mapAll(line, index, blank)\n}\n\n/** @type {Map} */\nfunction mapAll(line, index, blank) {\n  return (blank ? '' : '    ') + line\n}\n"],"names":["footnoteReference","footnoteReferencePeek","enterFootnoteCallString","enterFootnoteCall","token","enterFootnoteDefinitionLabelString","enterFootnoteDefinition","exitFootnoteCallString","label","node","assert","normalizeIdentifier","exitFootnoteCall","exitFootnoteDefinitionLabelString","exitFootnoteDefinition","_","state","info","tracker","value","exit","subexit","gfmFootnoteFromMarkdown","gfmFootnoteToMarkdown","options","firstLineBlank","footnoteDefinition","mapAll","mapExceptFirst","line","index","blank"],"mappings":";;AAkBAA,EAAkB,OAAOC;AAMzB,SAASC,IAA0B;AACjC,OAAK,OAAM;AACb;AAMA,SAASC,EAAkBC,GAAO;AAChC,OAAK,MAAM,EAAC,MAAM,qBAAqB,YAAY,IAAI,OAAO,GAAE,GAAGA,CAAK;AAC1E;AAMA,SAASC,IAAqC;AAC5C,OAAK,OAAM;AACb;AAMA,SAASC,EAAwBF,GAAO;AACtC,OAAK;AAAA,IACH,EAAC,MAAM,sBAAsB,YAAY,IAAI,OAAO,IAAI,UAAU,GAAE;AAAA,IACpEA;AAAA,EACJ;AACA;AAMA,SAASG,EAAuBH,GAAO;AACrC,QAAMI,IAAQ,KAAK,OAAM,GACnBC,IAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7CC,EAAAA,EAAOD,EAAK,SAAS,mBAAmB,GACxCA,EAAK,aAAaE;AAAA,IAChB,KAAK,eAAeP,CAAK;AAAA,EAC7B,EAAI,YAAW,GACbK,EAAK,QAAQD;AACf;AAMA,SAASI,EAAiBR,GAAO;AAC/B,OAAK,KAAKA,CAAK;AACjB;AAMA,SAASS,EAAkCT,GAAO;AAChD,QAAMI,IAAQ,KAAK,OAAM,GACnBC,IAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7CC,EAAAA,EAAOD,EAAK,SAAS,oBAAoB,GACzCA,EAAK,aAAaE;AAAA,IAChB,KAAK,eAAeP,CAAK;AAAA,EAC7B,EAAI,YAAW,GACbK,EAAK,QAAQD;AACf;AAMA,SAASM,EAAuBV,GAAO;AACrC,OAAK,KAAKA,CAAK;AACjB;AAGA,SAASH,IAAwB;AAC/B,SAAO;AACT;AAMA,SAASD,EAAkBS,GAAMM,GAAGC,GAAOC,GAAM;AAC/C,QAAMC,IAAUF,EAAM,cAAcC,CAAI;AACxC,MAAIE,IAAQD,EAAQ,KAAK,IAAI;AAC7B,QAAME,IAAOJ,EAAM,MAAM,mBAAmB,GACtCK,IAAUL,EAAM,MAAM,WAAW;AACvC,SAAAG,KAASD,EAAQ;AAAA,IACfF,EAAM,KAAKA,EAAM,cAAcP,CAAI,GAAG,EAAC,OAAO,KAAK,QAAQU,EAAK,CAAC;AAAA,EACrE,GACEE,EAAO,GACPD,EAAI,GACJD,KAASD,EAAQ,KAAK,GAAG,GAClBC;AACT;AASO,SAASG,IAA0B;AACxC,SAAO;AAAA,IACL,OAAO;AAAA,MACL,uBAAuBpB;AAAA,MACvB,iBAAiBC;AAAA,MACjB,kCAAkCE;AAAA,MAClC,uBAAuBC;AAAA,IACxB;AAAA,IACD,MAAM;AAAA,MACJ,uBAAuBC;AAAA,MACvB,iBAAiBK;AAAA,MACjB,kCAAkCC;AAAA,MAClC,uBAAuBC;AAAA,IAC7B;AAAA,EACA;AACA;AAWO,SAASS,EAAsBC,GAAS;AAE7C,MAAIC,IAAiB;AAErB,SAAID,KAAWA,EAAQ,mBACrBC,IAAiB,KAGZ;AAAA,IACL,UAAU,EAAC,oBAAAC,GAAoB,mBAAA1B,EAAiB;AAAA;AAAA,IAEhD,QAAQ,CAAC,EAAC,WAAW,KAAK,aAAa,CAAC,SAAS,YAAY,WAAW,EAAC,CAAC;AAAA,EAC9E;AAME,WAAS0B,EAAmBjB,GAAMM,GAAGC,GAAOC,GAAM;AAChD,UAAMC,IAAUF,EAAM,cAAcC,CAAI;AACxC,QAAIE,IAAQD,EAAQ,KAAK,IAAI;AAC7B,UAAME,IAAOJ,EAAM,MAAM,oBAAoB,GACvCK,IAAUL,EAAM,MAAM,OAAO;AACnC,WAAAG,KAASD,EAAQ;AAAA,MACfF,EAAM,KAAKA,EAAM,cAAcP,CAAI,GAAG,EAAC,QAAQU,GAAO,OAAO,IAAG,CAAC;AAAA,IACvE,GACIE,EAAO,GAEPF,KAASD,EAAQ,KAAK,IAAI,GAEtBT,EAAK,YAAYA,EAAK,SAAS,SAAS,MAC1CS,EAAQ,MAAM,CAAC,GAEfC,KAASD,EAAQ;AAAA,OACdO,IAAiB;AAAA,IAAO,OACvBT,EAAM;AAAA,QACJA,EAAM,cAAcP,GAAMS,EAAQ,QAAO,CAAE;AAAA,QAC3CO,IAAiBE,IAASC;AAAA,MACtC;AAAA,IACA,IAGIR,EAAI,GAEGD;AAAA,EACX;AACA;AAGA,SAASS,EAAeC,GAAMC,GAAOC,GAAO;AAC1C,SAAOD,MAAU,IAAID,IAAOF,EAAOE,GAAMC,GAAOC,CAAK;AACvD;AAGA,SAASJ,EAAOE,GAAMC,GAAOC,GAAO;AAClC,UAAQA,IAAQ,KAAK,UAAUF;AACjC;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/mdast-util-gfm-strikethrough@2.0.0/node_modules/mdast-util-gfm-strikethrough/lib/index.es.js

@@ -0,0 +1,51 @@
+const h = [
+  "autolink",
+  "destinationLiteral",
+  "destinationRaw",
+  "reference",
+  "titleQuote",
+  "titleApostrophe"
+];
+o.peek = s;
+function l() {
+  return {
+    canContainEols: ["delete"],
+    enter: { strikethrough: c },
+    exit: { strikethrough: a }
+  };
+}
+function f() {
+  return {
+    unsafe: [
+      {
+        character: "~",
+        inConstruct: "phrasing",
+        notInConstruct: h
+      }
+    ],
+    handlers: { delete: o }
+  };
+}
+function c(e) {
+  this.enter({ type: "delete", children: [] }, e);
+}
+function a(e) {
+  this.exit(e);
+}
+function o(e, k, r, i) {
+  const n = r.createTracker(i), u = r.enter("strikethrough");
+  let t = n.move("~~");
+  return t += r.containerPhrasing(e, {
+    ...n.current(),
+    before: t,
+    after: "~"
+  }), t += n.move("~~"), u(), t;
+}
+function s() {
+  return "~";
+}
+export {
+  l as gfmStrikethroughFromMarkdown,
+  f as gfmStrikethroughToMarkdown
+};
+//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/mdast-util-gfm-strikethrough@2.0.0/node_modules/mdast-util-gfm-strikethrough/lib/index.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../../../../node_modules/.pnpm/mdast-util-gfm-strikethrough@2.0.0/node_modules/mdast-util-gfm-strikethrough/lib/index.js"],"sourcesContent":["/**\n * @typedef {import('mdast').Delete} Delete\n *\n * @typedef {import('mdast-util-from-markdown').CompileContext} CompileContext\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n *\n * @typedef {import('mdast-util-to-markdown').ConstructName} ConstructName\n * @typedef {import('mdast-util-to-markdown').Handle} ToMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n */\n\n/**\n * List of constructs that occur in phrasing (paragraphs, headings), but cannot\n * contain strikethrough.\n * So they sort of cancel each other out.\n * Note: could use a better name.\n *\n * Note: keep in sync with: <https://github.com/syntax-tree/mdast-util-to-markdown/blob/8ce8dbf/lib/unsafe.js#L14>\n *\n * @type {Array<ConstructName>}\n */\nconst constructsWithoutStrikethrough = [\n  'autolink',\n  'destinationLiteral',\n  'destinationRaw',\n  'reference',\n  'titleQuote',\n  'titleApostrophe'\n]\n\nhandleDelete.peek = peekDelete\n\n/**\n * Create an extension for `mdast-util-from-markdown` to enable GFM\n * strikethrough in markdown.\n *\n * @returns {FromMarkdownExtension}\n *   Extension for `mdast-util-from-markdown` to enable GFM strikethrough.\n */\nexport function gfmStrikethroughFromMarkdown() {\n  return {\n    canContainEols: ['delete'],\n    enter: {strikethrough: enterStrikethrough},\n    exit: {strikethrough: exitStrikethrough}\n  }\n}\n\n/**\n * Create an extension for `mdast-util-to-markdown` to enable GFM\n * strikethrough in markdown.\n *\n * @returns {ToMarkdownExtension}\n *   Extension for `mdast-util-to-markdown` to enable GFM strikethrough.\n */\nexport function gfmStrikethroughToMarkdown() {\n  return {\n    unsafe: [\n      {\n        character: '~',\n        inConstruct: 'phrasing',\n        notInConstruct: constructsWithoutStrikethrough\n      }\n    ],\n    handlers: {delete: handleDelete}\n  }\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction enterStrikethrough(token) {\n  this.enter({type: 'delete', children: []}, token)\n}\n\n/**\n * @this {CompileContext}\n * @type {FromMarkdownHandle}\n */\nfunction exitStrikethrough(token) {\n  this.exit(token)\n}\n\n/**\n * @type {ToMarkdownHandle}\n * @param {Delete} node\n */\nfunction handleDelete(node, _, state, info) {\n  const tracker = state.createTracker(info)\n  const exit = state.enter('strikethrough')\n  let value = tracker.move('~~')\n  value += state.containerPhrasing(node, {\n    ...tracker.current(),\n    before: value,\n    after: '~'\n  })\n  value += tracker.move('~~')\n  exit()\n  return value\n}\n\n/** @type {ToMarkdownHandle} */\nfunction peekDelete() {\n  return '~'\n}\n"],"names":["constructsWithoutStrikethrough","handleDelete","peekDelete","gfmStrikethroughFromMarkdown","enterStrikethrough","exitStrikethrough","gfmStrikethroughToMarkdown","token","node","_","state","info","tracker","exit","value"],"mappings":"AAsBA,MAAMA,IAAiC;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEAC,EAAa,OAAOC;AASb,SAASC,IAA+B;AAC7C,SAAO;AAAA,IACL,gBAAgB,CAAC,QAAQ;AAAA,IACzB,OAAO,EAAC,eAAeC,EAAkB;AAAA,IACzC,MAAM,EAAC,eAAeC,EAAiB;AAAA,EAC3C;AACA;AASO,SAASC,IAA6B;AAC3C,SAAO;AAAA,IACL,QAAQ;AAAA,MACN;AAAA,QACE,WAAW;AAAA,QACX,aAAa;AAAA,QACb,gBAAgBN;AAAA,MACxB;AAAA,IACK;AAAA,IACD,UAAU,EAAC,QAAQC,EAAY;AAAA,EACnC;AACA;AAMA,SAASG,EAAmBG,GAAO;AACjC,OAAK,MAAM,EAAC,MAAM,UAAU,UAAU,CAAE,EAAA,GAAGA,CAAK;AAClD;AAMA,SAASF,EAAkBE,GAAO;AAChC,OAAK,KAAKA,CAAK;AACjB;AAMA,SAASN,EAAaO,GAAMC,GAAGC,GAAOC,GAAM;AAC1C,QAAMC,IAAUF,EAAM,cAAcC,CAAI,GAClCE,IAAOH,EAAM,MAAM,eAAe;AACxC,MAAII,IAAQF,EAAQ,KAAK,IAAI;AAC7B,SAAAE,KAASJ,EAAM,kBAAkBF,GAAM;AAAA,IACrC,GAAGI,EAAQ,QAAS;AAAA,IACpB,QAAQE;AAAA,IACR,OAAO;AAAA,EACR,CAAA,GACDA,KAASF,EAAQ,KAAK,IAAI,GAC1BC,EAAI,GACGC;AACT;AAGA,SAASZ,IAAa;AACpB,SAAO;AACT;","x_google_ignoreList":[0]}