@touchvue/chat 1.0.0-beta.3 → 1.0.0-beta.30

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/autolink.mjs

@@ -0,0 +1,75 @@
+// Process autolinks '<protocol:...>'
+
+/* eslint max-len:0 */
+const EMAIL_RE    = /^([a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*)$/;
+/* eslint-disable-next-line no-control-regex */
+const AUTOLINK_RE = /^([a-zA-Z][a-zA-Z0-9+.-]{1,31}):([^<>\x00-\x20]*)$/;
+
+function autolink (state, silent) {
+  let pos = state.pos;
+
+  if (state.src.charCodeAt(pos) !== 0x3C/* < */) { return false }
+
+  const start = state.pos;
+  const max = state.posMax;
+
+  for (;;) {
+    if (++pos >= max) return false
+
+    const ch = state.src.charCodeAt(pos);
+
+    if (ch === 0x3C /* < */) return false
+    if (ch === 0x3E /* > */) break
+  }
+
+  const url = state.src.slice(start + 1, pos);
+
+  if (AUTOLINK_RE.test(url)) {
+    const fullUrl = state.md.normalizeLink(url);
+    if (!state.md.validateLink(fullUrl)) { return false }
+
+    if (!silent) {
+      const token_o   = state.push('link_open', 'a', 1);
+      token_o.attrs   = [['href', fullUrl]];
+      token_o.markup  = 'autolink';
+      token_o.info    = 'auto';
+
+      const token_t   = state.push('text', '', 0);
+      token_t.content = state.md.normalizeLinkText(url);
+
+      const token_c   = state.push('link_close', 'a', -1);
+      token_c.markup  = 'autolink';
+      token_c.info    = 'auto';
+    }
+
+    state.pos += url.length + 2;
+    return true
+  }
+
+  if (EMAIL_RE.test(url)) {
+    const fullUrl = state.md.normalizeLink('mailto:' + url);
+    if (!state.md.validateLink(fullUrl)) { return false }
+
+    if (!silent) {
+      const token_o   = state.push('link_open', 'a', 1);
+      token_o.attrs   = [['href', fullUrl]];
+      token_o.markup  = 'autolink';
+      token_o.info    = 'auto';
+
+      const token_t   = state.push('text', '', 0);
+      token_t.content = state.md.normalizeLinkText(url);
+
+      const token_c   = state.push('link_close', 'a', -1);
+      token_c.markup  = 'autolink';
+      token_c.info    = 'auto';
+    }
+
+    state.pos += url.length + 2;
+    return true
+  }
+
+  return false
+}
+
+export { autolink as default };
+//# sourceMappingURL=autolink.mjs.map

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/autolink.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"autolink.mjs","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/autolink.mjs"],"sourcesContent":["// Process autolinks '<protocol:...>'\n\n/* eslint max-len:0 */\nconst EMAIL_RE    = /^([a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*)$/\n/* eslint-disable-next-line no-control-regex */\nconst AUTOLINK_RE = /^([a-zA-Z][a-zA-Z0-9+.-]{1,31}):([^<>\\x00-\\x20]*)$/\n\nexport default function autolink (state, silent) {\n  let pos = state.pos\n\n  if (state.src.charCodeAt(pos) !== 0x3C/* < */) { return false }\n\n  const start = state.pos\n  const max = state.posMax\n\n  for (;;) {\n    if (++pos >= max) return false\n\n    const ch = state.src.charCodeAt(pos)\n\n    if (ch === 0x3C /* < */) return false\n    if (ch === 0x3E /* > */) break\n  }\n\n  const url = state.src.slice(start + 1, pos)\n\n  if (AUTOLINK_RE.test(url)) {\n    const fullUrl = state.md.normalizeLink(url)\n    if (!state.md.validateLink(fullUrl)) { return false }\n\n    if (!silent) {\n      const token_o   = state.push('link_open', 'a', 1)\n      token_o.attrs   = [['href', fullUrl]]\n      token_o.markup  = 'autolink'\n      token_o.info    = 'auto'\n\n      const token_t   = state.push('text', '', 0)\n      token_t.content = state.md.normalizeLinkText(url)\n\n      const token_c   = state.push('link_close', 'a', -1)\n      token_c.markup  = 'autolink'\n      token_c.info    = 'auto'\n    }\n\n    state.pos += url.length + 2\n    return true\n  }\n\n  if (EMAIL_RE.test(url)) {\n    const fullUrl = state.md.normalizeLink('mailto:' + url)\n    if (!state.md.validateLink(fullUrl)) { return false }\n\n    if (!silent) {\n      const token_o   = state.push('link_open', 'a', 1)\n      token_o.attrs   = [['href', fullUrl]]\n      token_o.markup  = 'autolink'\n      token_o.info    = 'auto'\n\n      const token_t   = state.push('text', '', 0)\n      token_t.content = state.md.normalizeLinkText(url)\n\n      const token_c   = state.push('link_close', 'a', -1)\n      token_c.markup  = 'autolink'\n      token_c.info    = 'auto'\n    }\n\n    state.pos += url.length + 2\n    return true\n  }\n\n  return false\n}\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA,MAAM,QAAQ,MAAM,yIAAwI;AAC5J;AACA,MAAM,WAAW,GAAG,qDAAoD;AACxE;AACe,SAAS,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE;AACjD,EAAE,IAAI,GAAG,GAAG,KAAK,CAAC,IAAG;AACrB;AACA,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI,SAAS,EAAE,OAAO,KAAK,EAAE;AACjE;AACA,EAAE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAG;AACzB,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,OAAM;AAC1B;AACA,EAAE,SAAS;AACX,IAAI,IAAI,EAAE,GAAG,IAAI,GAAG,EAAE,OAAO,KAAK;AAClC;AACA,IAAI,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAC;AACxC;AACA,IAAI,IAAI,EAAE,KAAK,IAAI,UAAU,OAAO,KAAK;AACzC,IAAI,IAAI,EAAE,KAAK,IAAI,UAAU,KAAK;AAClC,GAAG;AACH;AACA,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,EAAC;AAC7C;AACA,EAAE,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;AAC7B,IAAI,MAAM,OAAO,GAAG,KAAK,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,EAAC;AAC/C,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,KAAK,EAAE;AACzD;AACA,IAAI,IAAI,CAAC,MAAM,EAAE;AACjB,MAAM,MAAM,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,EAAE,CAAC,EAAC;AACvD,MAAM,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,EAAC;AAC3C,MAAM,OAAO,CAAC,MAAM,IAAI,WAAU;AAClC,MAAM,OAAO,CAAC,IAAI,MAAM,OAAM;AAC9B;AACA,MAAM,MAAM,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,EAAC;AACjD,MAAM,OAAO,CAAC,OAAO,GAAG,KAAK,CAAC,EAAE,CAAC,iBAAiB,CAAC,GAAG,EAAC;AACvD;AACA,MAAM,MAAM,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC,EAAC;AACzD,MAAM,OAAO,CAAC,MAAM,IAAI,WAAU;AAClC,MAAM,OAAO,CAAC,IAAI,MAAM,OAAM;AAC9B,KAAK;AACL;AACA,IAAI,KAAK,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,GAAG,EAAC;AAC/B,IAAI,OAAO,IAAI;AACf,GAAG;AACH;AACA,EAAE,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;AAC1B,IAAI,MAAM,OAAO,GAAG,KAAK,CAAC,EAAE,CAAC,aAAa,CAAC,SAAS,GAAG,GAAG,EAAC;AAC3D,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,KAAK,EAAE;AACzD;AACA,IAAI,IAAI,CAAC,MAAM,EAAE;AACjB,MAAM,MAAM,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,EAAE,CAAC,EAAC;AACvD,MAAM,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,EAAC;AAC3C,MAAM,OAAO,CAAC,MAAM,IAAI,WAAU;AAClC,MAAM,OAAO,CAAC,IAAI,MAAM,OAAM;AAC9B;AACA,MAAM,MAAM,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,EAAC;AACjD,MAAM,OAAO,CAAC,OAAO,GAAG,KAAK,CAAC,EAAE,CAAC,iBAAiB,CAAC,GAAG,EAAC;AACvD;AACA,MAAM,MAAM,OAAO,KAAK,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC,EAAC;AACzD,MAAM,OAAO,CAAC,MAAM,IAAI,WAAU;AAClC,MAAM,OAAO,CAAC,IAAI,MAAM,OAAM;AAC9B,KAAK;AACL;AACA,IAAI,KAAK,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,GAAG,EAAC;AAC/B,IAAI,OAAO,IAAI;AACf,GAAG;AACH;AACA,EAAE,OAAO,KAAK;AACd;;;;","x_google_ignoreList":[0]}

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/backticks.mjs

@@ -0,0 +1,63 @@
+// Parse backticks
+
+function backtick (state, silent) {
+  let pos = state.pos;
+  const ch = state.src.charCodeAt(pos);
+
+  if (ch !== 0x60/* ` */) { return false }
+
+  const start = pos;
+  pos++;
+  const max = state.posMax;
+
+  // scan marker length
+  while (pos < max && state.src.charCodeAt(pos) === 0x60/* ` */) { pos++; }
+
+  const marker = state.src.slice(start, pos);
+  const openerLength = marker.length;
+
+  if (state.backticksScanned && (state.backticks[openerLength] || 0) <= start) {
+    if (!silent) state.pending += marker;
+    state.pos += openerLength;
+    return true
+  }
+
+  let matchEnd = pos;
+  let matchStart;
+
+  // Nothing found in the cache, scan until the end of the line (or until marker is found)
+  while ((matchStart = state.src.indexOf('`', matchEnd)) !== -1) {
+    matchEnd = matchStart + 1;
+
+    // scan marker length
+    while (matchEnd < max && state.src.charCodeAt(matchEnd) === 0x60/* ` */) { matchEnd++; }
+
+    const closerLength = matchEnd - matchStart;
+
+    if (closerLength === openerLength) {
+      // Found matching closer length.
+      if (!silent) {
+        const token = state.push('code_inline', 'code', 0);
+        token.markup = marker;
+        token.content = state.src.slice(pos, matchStart)
+          .replace(/\n/g, ' ')
+          .replace(/^ (.+) $/, '$1');
+      }
+      state.pos = matchEnd;
+      return true
+    }
+
+    // Some different length found, put it in cache as upper limit of where closer can be found
+    state.backticks[closerLength] = matchStart;
+  }
+
+  // Scanned through the end, didn't find anything
+  state.backticksScanned = true;
+
+  if (!silent) state.pending += marker;
+  state.pos += openerLength;
+  return true
+}
+
+export { backtick as default };
+//# sourceMappingURL=backticks.mjs.map

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/backticks.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"backticks.mjs","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/backticks.mjs"],"sourcesContent":["// Parse backticks\n\nexport default function backtick (state, silent) {\n  let pos = state.pos\n  const ch = state.src.charCodeAt(pos)\n\n  if (ch !== 0x60/* ` */) { return false }\n\n  const start = pos\n  pos++\n  const max = state.posMax\n\n  // scan marker length\n  while (pos < max && state.src.charCodeAt(pos) === 0x60/* ` */) { pos++ }\n\n  const marker = state.src.slice(start, pos)\n  const openerLength = marker.length\n\n  if (state.backticksScanned && (state.backticks[openerLength] || 0) <= start) {\n    if (!silent) state.pending += marker\n    state.pos += openerLength\n    return true\n  }\n\n  let matchEnd = pos\n  let matchStart\n\n  // Nothing found in the cache, scan until the end of the line (or until marker is found)\n  while ((matchStart = state.src.indexOf('`', matchEnd)) !== -1) {\n    matchEnd = matchStart + 1\n\n    // scan marker length\n    while (matchEnd < max && state.src.charCodeAt(matchEnd) === 0x60/* ` */) { matchEnd++ }\n\n    const closerLength = matchEnd - matchStart\n\n    if (closerLength === openerLength) {\n      // Found matching closer length.\n      if (!silent) {\n        const token = state.push('code_inline', 'code', 0)\n        token.markup = marker\n        token.content = state.src.slice(pos, matchStart)\n          .replace(/\\n/g, ' ')\n          .replace(/^ (.+) $/, '$1')\n      }\n      state.pos = matchEnd\n      return true\n    }\n\n    // Some different length found, put it in cache as upper limit of where closer can be found\n    state.backticks[closerLength] = matchStart\n  }\n\n  // Scanned through the end, didn't find anything\n  state.backticksScanned = true\n\n  if (!silent) state.pending += marker\n  state.pos += openerLength\n  return true\n}\n"],"names":[],"mappings":"AAAA;AACA;AACe,SAAS,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE;AACjD,EAAE,IAAI,GAAG,GAAG,KAAK,CAAC,IAAG;AACrB,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAC;AACtC;AACA,EAAE,IAAI,EAAE,KAAK,IAAI,SAAS,EAAE,OAAO,KAAK,EAAE;AAC1C;AACA,EAAE,MAAM,KAAK,GAAG,IAAG;AACnB,EAAE,GAAG,GAAE;AACP,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,OAAM;AAC1B;AACA;AACA,EAAE,OAAO,GAAG,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI,SAAS,EAAE,GAAG,GAAE,EAAE;AAC1E;AACA,EAAE,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,EAAC;AAC5C,EAAE,MAAM,YAAY,GAAG,MAAM,CAAC,OAAM;AACpC;AACA,EAAE,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,KAAK,EAAE;AAC/E,IAAI,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,IAAI,OAAM;AACxC,IAAI,KAAK,CAAC,GAAG,IAAI,aAAY;AAC7B,IAAI,OAAO,IAAI;AACf,GAAG;AACH;AACA,EAAE,IAAI,QAAQ,GAAG,IAAG;AACpB,EAAE,IAAI,WAAU;AAChB;AACA;AACA,EAAE,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE;AACjE,IAAI,QAAQ,GAAG,UAAU,GAAG,EAAC;AAC7B;AACA;AACA,IAAI,OAAO,QAAQ,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,IAAI,SAAS,EAAE,QAAQ,GAAE,EAAE;AAC3F;AACA,IAAI,MAAM,YAAY,GAAG,QAAQ,GAAG,WAAU;AAC9C;AACA,IAAI,IAAI,YAAY,KAAK,YAAY,EAAE;AACvC;AACA,MAAM,IAAI,CAAC,MAAM,EAAE;AACnB,QAAQ,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,EAAE,CAAC,EAAC;AAC1D,QAAQ,KAAK,CAAC,MAAM,GAAG,OAAM;AAC7B,QAAQ,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC;AACxD,WAAW,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC;AAC9B,WAAW,OAAO,CAAC,UAAU,EAAE,IAAI,EAAC;AACpC,OAAO;AACP,MAAM,KAAK,CAAC,GAAG,GAAG,SAAQ;AAC1B,MAAM,OAAO,IAAI;AACjB,KAAK;AACL;AACA;AACA,IAAI,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,GAAG,WAAU;AAC9C,GAAG;AACH;AACA;AACA,EAAE,KAAK,CAAC,gBAAgB,GAAG,KAAI;AAC/B;AACA,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,IAAI,OAAM;AACtC,EAAE,KAAK,CAAC,GAAG,IAAI,aAAY;AAC3B,EAAE,OAAO,IAAI;AACb;;;;","x_google_ignoreList":[0]}

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/balance_pairs.mjs

@@ -0,0 +1,127 @@
+// For each opening emphasis-like marker find a matching closing one
+//
+
+function processDelimiters (delimiters) {
+  const openersBottom = {};
+  const max = delimiters.length;
+
+  if (!max) return
+
+  // headerIdx is the first delimiter of the current (where closer is) delimiter run
+  let headerIdx = 0;
+  let lastTokenIdx = -2; // needs any value lower than -1
+  const jumps = [];
+
+  for (let closerIdx = 0; closerIdx < max; closerIdx++) {
+    const closer = delimiters[closerIdx];
+
+    jumps.push(0);
+
+    // markers belong to same delimiter run if:
+    //  - they have adjacent tokens
+    //  - AND markers are the same
+    //
+    if (delimiters[headerIdx].marker !== closer.marker || lastTokenIdx !== closer.token - 1) {
+      headerIdx = closerIdx;
+    }
+
+    lastTokenIdx = closer.token;
+
+    // Length is only used for emphasis-specific "rule of 3",
+    // if it's not defined (in strikethrough or 3rd party plugins),
+    // we can default it to 0 to disable those checks.
+    //
+    closer.length = closer.length || 0;
+
+    if (!closer.close) continue
+
+    // Previously calculated lower bounds (previous fails)
+    // for each marker, each delimiter length modulo 3,
+    // and for whether this closer can be an opener;
+    // https://github.com/commonmark/cmark/commit/34250e12ccebdc6372b8b49c44fab57c72443460
+    /* eslint-disable-next-line no-prototype-builtins */
+    if (!openersBottom.hasOwnProperty(closer.marker)) {
+      openersBottom[closer.marker] = [-1, -1, -1, -1, -1, -1];
+    }
+
+    const minOpenerIdx = openersBottom[closer.marker][(closer.open ? 3 : 0) + (closer.length % 3)];
+
+    let openerIdx = headerIdx - jumps[headerIdx] - 1;
+
+    let newMinOpenerIdx = openerIdx;
+
+    for (; openerIdx > minOpenerIdx; openerIdx -= jumps[openerIdx] + 1) {
+      const opener = delimiters[openerIdx];
+
+      if (opener.marker !== closer.marker) continue
+
+      if (opener.open && opener.end < 0) {
+        let isOddMatch = false;
+
+        // from spec:
+        //
+        // If one of the delimiters can both open and close emphasis, then the
+        // sum of the lengths of the delimiter runs containing the opening and
+        // closing delimiters must not be a multiple of 3 unless both lengths
+        // are multiples of 3.
+        //
+        if (opener.close || closer.open) {
+          if ((opener.length + closer.length) % 3 === 0) {
+            if (opener.length % 3 !== 0 || closer.length % 3 !== 0) {
+              isOddMatch = true;
+            }
+          }
+        }
+
+        if (!isOddMatch) {
+          // If previous delimiter cannot be an opener, we can safely skip
+          // the entire sequence in future checks. This is required to make
+          // sure algorithm has linear complexity (see *_*_*_*_*_... case).
+          //
+          const lastJump = openerIdx > 0 && !delimiters[openerIdx - 1].open
+            ? jumps[openerIdx - 1] + 1
+            : 0;
+
+          jumps[closerIdx] = closerIdx - openerIdx + lastJump;
+          jumps[openerIdx] = lastJump;
+
+          closer.open  = false;
+          opener.end   = closerIdx;
+          opener.close = false;
+          newMinOpenerIdx = -1;
+          // treat next token as start of run,
+          // it optimizes skips in **<...>**a**<...>** pathological case
+          lastTokenIdx = -2;
+          break
+        }
+      }
+    }
+
+    if (newMinOpenerIdx !== -1) {
+      // If match for this delimiter run failed, we want to set lower bound for
+      // future lookups. This is required to make sure algorithm has linear
+      // complexity.
+      //
+      // See details here:
+      // https://github.com/commonmark/cmark/issues/178#issuecomment-270417442
+      //
+      openersBottom[closer.marker][(closer.open ? 3 : 0) + ((closer.length || 0) % 3)] = newMinOpenerIdx;
+    }
+  }
+}
+
+function link_pairs (state) {
+  const tokens_meta = state.tokens_meta;
+  const max = state.tokens_meta.length;
+
+  processDelimiters(state.delimiters);
+
+  for (let curr = 0; curr < max; curr++) {
+    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {
+      processDelimiters(tokens_meta[curr].delimiters);
+    }
+  }
+}
+
+export { link_pairs as default };
+//# sourceMappingURL=balance_pairs.mjs.map

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/balance_pairs.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"balance_pairs.mjs","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/balance_pairs.mjs"],"sourcesContent":["// For each opening emphasis-like marker find a matching closing one\n//\n\nfunction processDelimiters (delimiters) {\n  const openersBottom = {}\n  const max = delimiters.length\n\n  if (!max) return\n\n  // headerIdx is the first delimiter of the current (where closer is) delimiter run\n  let headerIdx = 0\n  let lastTokenIdx = -2 // needs any value lower than -1\n  const jumps = []\n\n  for (let closerIdx = 0; closerIdx < max; closerIdx++) {\n    const closer = delimiters[closerIdx]\n\n    jumps.push(0)\n\n    // markers belong to same delimiter run if:\n    //  - they have adjacent tokens\n    //  - AND markers are the same\n    //\n    if (delimiters[headerIdx].marker !== closer.marker || lastTokenIdx !== closer.token - 1) {\n      headerIdx = closerIdx\n    }\n\n    lastTokenIdx = closer.token\n\n    // Length is only used for emphasis-specific \"rule of 3\",\n    // if it's not defined (in strikethrough or 3rd party plugins),\n    // we can default it to 0 to disable those checks.\n    //\n    closer.length = closer.length || 0\n\n    if (!closer.close) continue\n\n    // Previously calculated lower bounds (previous fails)\n    // for each marker, each delimiter length modulo 3,\n    // and for whether this closer can be an opener;\n    // https://github.com/commonmark/cmark/commit/34250e12ccebdc6372b8b49c44fab57c72443460\n    /* eslint-disable-next-line no-prototype-builtins */\n    if (!openersBottom.hasOwnProperty(closer.marker)) {\n      openersBottom[closer.marker] = [-1, -1, -1, -1, -1, -1]\n    }\n\n    const minOpenerIdx = openersBottom[closer.marker][(closer.open ? 3 : 0) + (closer.length % 3)]\n\n    let openerIdx = headerIdx - jumps[headerIdx] - 1\n\n    let newMinOpenerIdx = openerIdx\n\n    for (; openerIdx > minOpenerIdx; openerIdx -= jumps[openerIdx] + 1) {\n      const opener = delimiters[openerIdx]\n\n      if (opener.marker !== closer.marker) continue\n\n      if (opener.open && opener.end < 0) {\n        let isOddMatch = false\n\n        // from spec:\n        //\n        // If one of the delimiters can both open and close emphasis, then the\n        // sum of the lengths of the delimiter runs containing the opening and\n        // closing delimiters must not be a multiple of 3 unless both lengths\n        // are multiples of 3.\n        //\n        if (opener.close || closer.open) {\n          if ((opener.length + closer.length) % 3 === 0) {\n            if (opener.length % 3 !== 0 || closer.length % 3 !== 0) {\n              isOddMatch = true\n            }\n          }\n        }\n\n        if (!isOddMatch) {\n          // If previous delimiter cannot be an opener, we can safely skip\n          // the entire sequence in future checks. This is required to make\n          // sure algorithm has linear complexity (see *_*_*_*_*_... case).\n          //\n          const lastJump = openerIdx > 0 && !delimiters[openerIdx - 1].open\n            ? jumps[openerIdx - 1] + 1\n            : 0\n\n          jumps[closerIdx] = closerIdx - openerIdx + lastJump\n          jumps[openerIdx] = lastJump\n\n          closer.open  = false\n          opener.end   = closerIdx\n          opener.close = false\n          newMinOpenerIdx = -1\n          // treat next token as start of run,\n          // it optimizes skips in **<...>**a**<...>** pathological case\n          lastTokenIdx = -2\n          break\n        }\n      }\n    }\n\n    if (newMinOpenerIdx !== -1) {\n      // If match for this delimiter run failed, we want to set lower bound for\n      // future lookups. This is required to make sure algorithm has linear\n      // complexity.\n      //\n      // See details here:\n      // https://github.com/commonmark/cmark/issues/178#issuecomment-270417442\n      //\n      openersBottom[closer.marker][(closer.open ? 3 : 0) + ((closer.length || 0) % 3)] = newMinOpenerIdx\n    }\n  }\n}\n\nexport default function link_pairs (state) {\n  const tokens_meta = state.tokens_meta\n  const max = state.tokens_meta.length\n\n  processDelimiters(state.delimiters)\n\n  for (let curr = 0; curr < max; curr++) {\n    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {\n      processDelimiters(tokens_meta[curr].delimiters)\n    }\n  }\n}\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA,SAAS,iBAAiB,EAAE,UAAU,EAAE;AACxC,EAAE,MAAM,aAAa,GAAG,GAAE;AAC1B,EAAE,MAAM,GAAG,GAAG,UAAU,CAAC,OAAM;AAC/B;AACA,EAAE,IAAI,CAAC,GAAG,EAAE,MAAM;AAClB;AACA;AACA,EAAE,IAAI,SAAS,GAAG,EAAC;AACnB,EAAE,IAAI,YAAY,GAAG,CAAC,EAAC;AACvB,EAAE,MAAM,KAAK,GAAG,GAAE;AAClB;AACA,EAAE,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,GAAG,EAAE,SAAS,EAAE,EAAE;AACxD,IAAI,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAC;AACxC;AACA,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,EAAC;AACjB;AACA;AACA;AACA;AACA;AACA,IAAI,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,IAAI,YAAY,KAAK,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE;AAC7F,MAAM,SAAS,GAAG,UAAS;AAC3B,KAAK;AACL;AACA,IAAI,YAAY,GAAG,MAAM,CAAC,MAAK;AAC/B;AACA;AACA;AACA;AACA;AACA,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,EAAC;AACtC;AACA,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE;AACtD,MAAM,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAC;AAC7D,KAAK;AACL;AACA,IAAI,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAC;AAClG;AACA,IAAI,IAAI,SAAS,GAAG,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,EAAC;AACpD;AACA,IAAI,IAAI,eAAe,GAAG,UAAS;AACnC;AACA,IAAI,OAAO,SAAS,GAAG,YAAY,EAAE,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE;AACxE,MAAM,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,EAAC;AAC1C;AACA,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ;AACnD;AACA,MAAM,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE;AACzC,QAAQ,IAAI,UAAU,GAAG,MAAK;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,EAAE;AACzC,UAAU,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,EAAE;AACzD,YAAY,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE;AACpE,cAAc,UAAU,GAAG,KAAI;AAC/B,aAAa;AACb,WAAW;AACX,SAAS;AACT;AACA,QAAQ,IAAI,CAAC,UAAU,EAAE;AACzB;AACA;AACA;AACA;AACA,UAAU,MAAM,QAAQ,GAAG,SAAS,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI;AAC3E,cAAc,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC;AACtC,cAAc,EAAC;AACf;AACA,UAAU,KAAK,CAAC,SAAS,CAAC,GAAG,SAAS,GAAG,SAAS,GAAG,SAAQ;AAC7D,UAAU,KAAK,CAAC,SAAS,CAAC,GAAG,SAAQ;AACrC;AACA,UAAU,MAAM,CAAC,IAAI,IAAI,MAAK;AAC9B,UAAU,MAAM,CAAC,GAAG,KAAK,UAAS;AAClC,UAAU,MAAM,CAAC,KAAK,GAAG,MAAK;AAC9B,UAAU,eAAe,GAAG,CAAC,EAAC;AAC9B;AACA;AACA,UAAU,YAAY,GAAG,CAAC,EAAC;AAC3B,UAAU,KAAK;AACf,SAAS;AACT,OAAO;AACP,KAAK;AACL;AACA,IAAI,IAAI,eAAe,KAAK,CAAC,CAAC,EAAE;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,gBAAe;AACxG,KAAK;AACL,GAAG;AACH,CAAC;AACD;AACe,SAAS,UAAU,EAAE,KAAK,EAAE;AAC3C,EAAE,MAAM,WAAW,GAAG,KAAK,CAAC,YAAW;AACvC,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC,OAAM;AACtC;AACA,EAAE,iBAAiB,CAAC,KAAK,CAAC,UAAU,EAAC;AACrC;AACA,EAAE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE;AACzC,IAAI,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE;AAC3D,MAAM,iBAAiB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,UAAU,EAAC;AACrD,KAAK;AACL,GAAG;AACH;;;;","x_google_ignoreList":[0]}

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/emphasis.mjs

@@ -0,0 +1,126 @@
+// Process *this* and _that_
+//
+
+// Insert each marker as a separate text token, and add it to delimiter list
+//
+function emphasis_tokenize (state, silent) {
+  const start = state.pos;
+  const marker = state.src.charCodeAt(start);
+
+  if (silent) { return false }
+
+  if (marker !== 0x5F /* _ */ && marker !== 0x2A /* * */) { return false }
+
+  const scanned = state.scanDelims(state.pos, marker === 0x2A);
+
+  for (let i = 0; i < scanned.length; i++) {
+    const token = state.push('text', '', 0);
+    token.content = String.fromCharCode(marker);
+
+    state.delimiters.push({
+      // Char code of the starting marker (number).
+      //
+      marker,
+
+      // Total length of these series of delimiters.
+      //
+      length: scanned.length,
+
+      // A position of the token this delimiter corresponds to.
+      //
+      token: state.tokens.length - 1,
+
+      // If this delimiter is matched as a valid opener, `end` will be
+      // equal to its position, otherwise it's `-1`.
+      //
+      end: -1,
+
+      // Boolean flags that determine if this delimiter could open or close
+      // an emphasis.
+      //
+      open: scanned.can_open,
+      close: scanned.can_close
+    });
+  }
+
+  state.pos += scanned.length;
+
+  return true
+}
+
+function postProcess (state, delimiters) {
+  const max = delimiters.length;
+
+  for (let i = max - 1; i >= 0; i--) {
+    const startDelim = delimiters[i];
+
+    if (startDelim.marker !== 0x5F/* _ */ && startDelim.marker !== 0x2A/* * */) {
+      continue
+    }
+
+    // Process only opening markers
+    if (startDelim.end === -1) {
+      continue
+    }
+
+    const endDelim = delimiters[startDelim.end];
+
+    // If the previous delimiter has the same marker and is adjacent to this one,
+    // merge those into one strong delimiter.
+    //
+    // `<em><em>whatever</em></em>` -> `<strong>whatever</strong>`
+    //
+    const isStrong = i > 0 &&
+               delimiters[i - 1].end === startDelim.end + 1 &&
+               // check that first two markers match and adjacent
+               delimiters[i - 1].marker === startDelim.marker &&
+               delimiters[i - 1].token === startDelim.token - 1 &&
+               // check that last two markers are adjacent (we can safely assume they match)
+               delimiters[startDelim.end + 1].token === endDelim.token + 1;
+
+    const ch = String.fromCharCode(startDelim.marker);
+
+    const token_o   = state.tokens[startDelim.token];
+    token_o.type    = isStrong ? 'strong_open' : 'em_open';
+    token_o.tag     = isStrong ? 'strong' : 'em';
+    token_o.nesting = 1;
+    token_o.markup  = isStrong ? ch + ch : ch;
+    token_o.content = '';
+
+    const token_c   = state.tokens[endDelim.token];
+    token_c.type    = isStrong ? 'strong_close' : 'em_close';
+    token_c.tag     = isStrong ? 'strong' : 'em';
+    token_c.nesting = -1;
+    token_c.markup  = isStrong ? ch + ch : ch;
+    token_c.content = '';
+
+    if (isStrong) {
+      state.tokens[delimiters[i - 1].token].content = '';
+      state.tokens[delimiters[startDelim.end + 1].token].content = '';
+      i--;
+    }
+  }
+}
+
+// Walk through delimiter list and replace text tokens with tags
+//
+function emphasis_post_process (state) {
+  const tokens_meta = state.tokens_meta;
+  const max = state.tokens_meta.length;
+
+  postProcess(state, state.delimiters);
+
+  for (let curr = 0; curr < max; curr++) {
+    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {
+      postProcess(state, tokens_meta[curr].delimiters);
+    }
+  }
+}
+
+var r_emphasis = {
+  tokenize: emphasis_tokenize,
+  postProcess: emphasis_post_process
+};
+
+export { r_emphasis as default };
+//# sourceMappingURL=emphasis.mjs.map

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/emphasis.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"emphasis.mjs","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/emphasis.mjs"],"sourcesContent":["// Process *this* and _that_\n//\n\n// Insert each marker as a separate text token, and add it to delimiter list\n//\nfunction emphasis_tokenize (state, silent) {\n  const start = state.pos\n  const marker = state.src.charCodeAt(start)\n\n  if (silent) { return false }\n\n  if (marker !== 0x5F /* _ */ && marker !== 0x2A /* * */) { return false }\n\n  const scanned = state.scanDelims(state.pos, marker === 0x2A)\n\n  for (let i = 0; i < scanned.length; i++) {\n    const token = state.push('text', '', 0)\n    token.content = String.fromCharCode(marker)\n\n    state.delimiters.push({\n      // Char code of the starting marker (number).\n      //\n      marker,\n\n      // Total length of these series of delimiters.\n      //\n      length: scanned.length,\n\n      // A position of the token this delimiter corresponds to.\n      //\n      token: state.tokens.length - 1,\n\n      // If this delimiter is matched as a valid opener, `end` will be\n      // equal to its position, otherwise it's `-1`.\n      //\n      end: -1,\n\n      // Boolean flags that determine if this delimiter could open or close\n      // an emphasis.\n      //\n      open: scanned.can_open,\n      close: scanned.can_close\n    })\n  }\n\n  state.pos += scanned.length\n\n  return true\n}\n\nfunction postProcess (state, delimiters) {\n  const max = delimiters.length\n\n  for (let i = max - 1; i >= 0; i--) {\n    const startDelim = delimiters[i]\n\n    if (startDelim.marker !== 0x5F/* _ */ && startDelim.marker !== 0x2A/* * */) {\n      continue\n    }\n\n    // Process only opening markers\n    if (startDelim.end === -1) {\n      continue\n    }\n\n    const endDelim = delimiters[startDelim.end]\n\n    // If the previous delimiter has the same marker and is adjacent to this one,\n    // merge those into one strong delimiter.\n    //\n    // `<em><em>whatever</em></em>` -> `<strong>whatever</strong>`\n    //\n    const isStrong = i > 0 &&\n               delimiters[i - 1].end === startDelim.end + 1 &&\n               // check that first two markers match and adjacent\n               delimiters[i - 1].marker === startDelim.marker &&\n               delimiters[i - 1].token === startDelim.token - 1 &&\n               // check that last two markers are adjacent (we can safely assume they match)\n               delimiters[startDelim.end + 1].token === endDelim.token + 1\n\n    const ch = String.fromCharCode(startDelim.marker)\n\n    const token_o   = state.tokens[startDelim.token]\n    token_o.type    = isStrong ? 'strong_open' : 'em_open'\n    token_o.tag     = isStrong ? 'strong' : 'em'\n    token_o.nesting = 1\n    token_o.markup  = isStrong ? ch + ch : ch\n    token_o.content = ''\n\n    const token_c   = state.tokens[endDelim.token]\n    token_c.type    = isStrong ? 'strong_close' : 'em_close'\n    token_c.tag     = isStrong ? 'strong' : 'em'\n    token_c.nesting = -1\n    token_c.markup  = isStrong ? ch + ch : ch\n    token_c.content = ''\n\n    if (isStrong) {\n      state.tokens[delimiters[i - 1].token].content = ''\n      state.tokens[delimiters[startDelim.end + 1].token].content = ''\n      i--\n    }\n  }\n}\n\n// Walk through delimiter list and replace text tokens with tags\n//\nfunction emphasis_post_process (state) {\n  const tokens_meta = state.tokens_meta\n  const max = state.tokens_meta.length\n\n  postProcess(state, state.delimiters)\n\n  for (let curr = 0; curr < max; curr++) {\n    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {\n      postProcess(state, tokens_meta[curr].delimiters)\n    }\n  }\n}\n\nexport default {\n  tokenize: emphasis_tokenize,\n  postProcess: emphasis_post_process\n}\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA,SAAS,iBAAiB,EAAE,KAAK,EAAE,MAAM,EAAE;AAC3C,EAAE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAG;AACzB,EAAE,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,EAAC;AAC5C;AACA,EAAE,IAAI,MAAM,EAAE,EAAE,OAAO,KAAK,EAAE;AAC9B;AACA,EAAE,IAAI,MAAM,KAAK,IAAI,YAAY,MAAM,KAAK,IAAI,UAAU,EAAE,OAAO,KAAK,EAAE;AAC1E;AACA,EAAE,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,EAAC;AAC9D;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC3C,IAAI,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,EAAC;AAC3C,IAAI,KAAK,CAAC,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,EAAC;AAC/C;AACA,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC;AAC1B;AACA;AACA,MAAM,MAAM;AACZ;AACA;AACA;AACA,MAAM,MAAM,EAAE,OAAO,CAAC,MAAM;AAC5B;AACA;AACA;AACA,MAAM,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;AACpC;AACA;AACA;AACA;AACA,MAAM,GAAG,EAAE,CAAC,CAAC;AACb;AACA;AACA;AACA;AACA,MAAM,IAAI,EAAE,OAAO,CAAC,QAAQ;AAC5B,MAAM,KAAK,EAAE,OAAO,CAAC,SAAS;AAC9B,KAAK,EAAC;AACN,GAAG;AACH;AACA,EAAE,KAAK,CAAC,GAAG,IAAI,OAAO,CAAC,OAAM;AAC7B;AACA,EAAE,OAAO,IAAI;AACb,CAAC;AACD;AACA,SAAS,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE;AACzC,EAAE,MAAM,GAAG,GAAG,UAAU,CAAC,OAAM;AAC/B;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACrC,IAAI,MAAM,UAAU,GAAG,UAAU,CAAC,CAAC,EAAC;AACpC;AACA,IAAI,IAAI,UAAU,CAAC,MAAM,KAAK,IAAI,WAAW,UAAU,CAAC,MAAM,KAAK,IAAI,SAAS;AAChF,MAAM,QAAQ;AACd,KAAK;AACL;AACA;AACA,IAAI,IAAI,UAAU,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE;AAC/B,MAAM,QAAQ;AACd,KAAK;AACL;AACA,IAAI,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,GAAG,EAAC;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC;AAC1B,eAAe,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,UAAU,CAAC,GAAG,GAAG,CAAC;AAC3D;AACA,eAAe,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM;AAC7D,eAAe,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,UAAU,CAAC,KAAK,GAAG,CAAC;AAC/D;AACA,eAAe,UAAU,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,GAAG,EAAC;AAC1E;AACA,IAAI,MAAM,EAAE,GAAG,MAAM,CAAC,YAAY,CAAC,UAAU,CAAC,MAAM,EAAC;AACrD;AACA,IAAI,MAAM,OAAO,KAAK,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,EAAC;AACpD,IAAI,OAAO,CAAC,IAAI,MAAM,QAAQ,GAAG,aAAa,GAAG,UAAS;AAC1D,IAAI,OAAO,CAAC,GAAG,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAI;AAChD,IAAI,OAAO,CAAC,OAAO,GAAG,EAAC;AACvB,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ,GAAG,EAAE,GAAG,EAAE,GAAG,GAAE;AAC7C,IAAI,OAAO,CAAC,OAAO,GAAG,GAAE;AACxB;AACA,IAAI,MAAM,OAAO,KAAK,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAC;AAClD,IAAI,OAAO,CAAC,IAAI,MAAM,QAAQ,GAAG,cAAc,GAAG,WAAU;AAC5D,IAAI,OAAO,CAAC,GAAG,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAI;AAChD,IAAI,OAAO,CAAC,OAAO,GAAG,CAAC,EAAC;AACxB,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ,GAAG,EAAE,GAAG,EAAE,GAAG,GAAE;AAC7C,IAAI,OAAO,CAAC,OAAO,GAAG,GAAE;AACxB;AACA,IAAI,IAAI,QAAQ,EAAE;AAClB,MAAM,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,GAAE;AACxD,MAAM,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,GAAE;AACrE,MAAM,CAAC,GAAE;AACT,KAAK;AACL,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA,SAAS,qBAAqB,EAAE,KAAK,EAAE;AACvC,EAAE,MAAM,WAAW,GAAG,KAAK,CAAC,YAAW;AACvC,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC,OAAM;AACtC;AACA,EAAE,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,EAAC;AACtC;AACA,EAAE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE;AACzC,IAAI,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE;AAC3D,MAAM,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,UAAU,EAAC;AACtD,KAAK;AACL,GAAG;AACH,CAAC;AACD;AACA,iBAAe;AACf,EAAE,QAAQ,EAAE,iBAAiB;AAC7B,EAAE,WAAW,EAAE,qBAAqB;AACpC;;;;","x_google_ignoreList":[0]}

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/entity.mjs

@@ -0,0 +1,55 @@
+import { isValidEntityCode, fromCodePoint } from '../common/utils.mjs';
+import { decodeHTML } from '../../../../../entities@4.5.0/node_modules/entities/lib/esm/decode.mjs';
+
+// Process html entity - {, ¯, ", ...
+
+
+const DIGITAL_RE = /^&#((?:x[a-f0-9]{1,6}|[0-9]{1,7}));/i;
+const NAMED_RE   = /^&([a-z][a-z0-9]{1,31});/i;
+
+function entity (state, silent) {
+  const pos = state.pos;
+  const max = state.posMax;
+
+  if (state.src.charCodeAt(pos) !== 0x26/* & */) return false
+
+  if (pos + 1 >= max) return false
+
+  const ch = state.src.charCodeAt(pos + 1);
+
+  if (ch === 0x23 /* # */) {
+    const match = state.src.slice(pos).match(DIGITAL_RE);
+    if (match) {
+      if (!silent) {
+        const code = match[1][0].toLowerCase() === 'x' ? parseInt(match[1].slice(1), 16) : parseInt(match[1], 10);
+
+        const token   = state.push('text_special', '', 0);
+        token.content = isValidEntityCode(code) ? fromCodePoint(code) : fromCodePoint(0xFFFD);
+        token.markup  = match[0];
+        token.info    = 'entity';
+      }
+      state.pos += match[0].length;
+      return true
+    }
+  } else {
+    const match = state.src.slice(pos).match(NAMED_RE);
+    if (match) {
+      const decoded = decodeHTML(match[0]);
+      if (decoded !== match[0]) {
+        if (!silent) {
+          const token   = state.push('text_special', '', 0);
+          token.content = decoded;
+          token.markup  = match[0];
+          token.info    = 'entity';
+        }
+        state.pos += match[0].length;
+        return true
+      }
+    }
+  }
+
+  return false
+}
+
+export { entity as default };
+//# sourceMappingURL=entity.mjs.map

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/entity.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity.mjs","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/entity.mjs"],"sourcesContent":["// Process html entity - {, ¯, ", ...\n\nimport { decodeHTML } from 'entities'\nimport { isValidEntityCode, fromCodePoint } from '../common/utils.mjs'\n\nconst DIGITAL_RE = /^&#((?:x[a-f0-9]{1,6}|[0-9]{1,7}));/i\nconst NAMED_RE   = /^&([a-z][a-z0-9]{1,31});/i\n\nexport default function entity (state, silent) {\n  const pos = state.pos\n  const max = state.posMax\n\n  if (state.src.charCodeAt(pos) !== 0x26/* & */) return false\n\n  if (pos + 1 >= max) return false\n\n  const ch = state.src.charCodeAt(pos + 1)\n\n  if (ch === 0x23 /* # */) {\n    const match = state.src.slice(pos).match(DIGITAL_RE)\n    if (match) {\n      if (!silent) {\n        const code = match[1][0].toLowerCase() === 'x' ? parseInt(match[1].slice(1), 16) : parseInt(match[1], 10)\n\n        const token   = state.push('text_special', '', 0)\n        token.content = isValidEntityCode(code) ? fromCodePoint(code) : fromCodePoint(0xFFFD)\n        token.markup  = match[0]\n        token.info    = 'entity'\n      }\n      state.pos += match[0].length\n      return true\n    }\n  } else {\n    const match = state.src.slice(pos).match(NAMED_RE)\n    if (match) {\n      const decoded = decodeHTML(match[0])\n      if (decoded !== match[0]) {\n        if (!silent) {\n          const token   = state.push('text_special', '', 0)\n          token.content = decoded\n          token.markup  = match[0]\n          token.info    = 'entity'\n        }\n        state.pos += match[0].length\n        return true\n      }\n    }\n  }\n\n  return false\n}\n"],"names":[],"mappings":";;;AAAA;AACA;AAGA;AACA,MAAM,UAAU,GAAG,uCAAsC;AACzD,MAAM,QAAQ,KAAK,4BAA2B;AAC9C;AACe,SAAS,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;AAC/C,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAG;AACvB,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,OAAM;AAC1B;AACA,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI,SAAS,OAAO,KAAK;AAC7D;AACA,EAAE,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,EAAE,OAAO,KAAK;AAClC;AACA,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,EAAC;AAC1C;AACA,EAAE,IAAI,EAAE,KAAK,IAAI,UAAU;AAC3B,IAAI,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,EAAC;AACxD,IAAI,IAAI,KAAK,EAAE;AACf,MAAM,IAAI,CAAC,MAAM,EAAE;AACnB,QAAQ,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,EAAC;AACjH;AACA,QAAQ,MAAM,KAAK,KAAK,KAAK,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,EAAE,CAAC,EAAC;AACzD,QAAQ,KAAK,CAAC,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,EAAC;AAC7F,QAAQ,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,EAAC;AAChC,QAAQ,KAAK,CAAC,IAAI,MAAM,SAAQ;AAChC,OAAO;AACP,MAAM,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAM;AAClC,MAAM,OAAO,IAAI;AACjB,KAAK;AACL,GAAG,MAAM;AACT,IAAI,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAC;AACtD,IAAI,IAAI,KAAK,EAAE;AACf,MAAM,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAC;AAC1C,MAAM,IAAI,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE;AAChC,QAAQ,IAAI,CAAC,MAAM,EAAE;AACrB,UAAU,MAAM,KAAK,KAAK,KAAK,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,EAAE,CAAC,EAAC;AAC3D,UAAU,KAAK,CAAC,OAAO,GAAG,QAAO;AACjC,UAAU,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,EAAC;AAClC,UAAU,KAAK,CAAC,IAAI,MAAM,SAAQ;AAClC,SAAS;AACT,QAAQ,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAM;AACpC,QAAQ,OAAO,IAAI;AACnB,OAAO;AACP,KAAK;AACL,GAAG;AACH;AACA,EAAE,OAAO,KAAK;AACd;;;;","x_google_ignoreList":[0]}

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/escape.mjs

@@ -0,0 +1,73 @@
+import { isSpace } from '../common/utils.mjs';
+
+// Process escaped chars and hardbreaks
+
+
+const ESCAPED = [];
+
+for (let i = 0; i < 256; i++) { ESCAPED.push(0); }
+
+'\\!"#$%&\'()*+,./:;<=>?@[]^_`{|}~-'
+  .split('').forEach(function (ch) { ESCAPED[ch.charCodeAt(0)] = 1; });
+
+function escape (state, silent) {
+  let pos = state.pos;
+  const max = state.posMax;
+
+  if (state.src.charCodeAt(pos) !== 0x5C/* \ */) return false
+  pos++;
+
+  // '\' at the end of the inline block
+  if (pos >= max) return false
+
+  let ch1 = state.src.charCodeAt(pos);
+
+  if (ch1 === 0x0A) {
+    if (!silent) {
+      state.push('hardbreak', 'br', 0);
+    }
+
+    pos++;
+    // skip leading whitespaces from next line
+    while (pos < max) {
+      ch1 = state.src.charCodeAt(pos);
+      if (!isSpace(ch1)) break
+      pos++;
+    }
+
+    state.pos = pos;
+    return true
+  }
+
+  let escapedStr = state.src[pos];
+
+  if (ch1 >= 0xD800 && ch1 <= 0xDBFF && pos + 1 < max) {
+    const ch2 = state.src.charCodeAt(pos + 1);
+
+    if (ch2 >= 0xDC00 && ch2 <= 0xDFFF) {
+      escapedStr += state.src[pos + 1];
+      pos++;
+    }
+  }
+
+  const origStr = '\\' + escapedStr;
+
+  if (!silent) {
+    const token = state.push('text_special', '', 0);
+
+    if (ch1 < 256 && ESCAPED[ch1] !== 0) {
+      token.content = escapedStr;
+    } else {
+      token.content = origStr;
+    }
+
+    token.markup = origStr;
+    token.info   = 'escape';
+  }
+
+  state.pos = pos + 1;
+  return true
+}
+
+export { escape as default };
+//# sourceMappingURL=escape.mjs.map

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/escape.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"escape.mjs","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/escape.mjs"],"sourcesContent":["// Process escaped chars and hardbreaks\n\nimport { isSpace } from '../common/utils.mjs'\n\nconst ESCAPED = []\n\nfor (let i = 0; i < 256; i++) { ESCAPED.push(0) }\n\n'\\\\!\"#$%&\\'()*+,./:;<=>?@[]^_`{|}~-'\n  .split('').forEach(function (ch) { ESCAPED[ch.charCodeAt(0)] = 1 })\n\nexport default function escape (state, silent) {\n  let pos = state.pos\n  const max = state.posMax\n\n  if (state.src.charCodeAt(pos) !== 0x5C/* \\ */) return false\n  pos++\n\n  // '\\' at the end of the inline block\n  if (pos >= max) return false\n\n  let ch1 = state.src.charCodeAt(pos)\n\n  if (ch1 === 0x0A) {\n    if (!silent) {\n      state.push('hardbreak', 'br', 0)\n    }\n\n    pos++\n    // skip leading whitespaces from next line\n    while (pos < max) {\n      ch1 = state.src.charCodeAt(pos)\n      if (!isSpace(ch1)) break\n      pos++\n    }\n\n    state.pos = pos\n    return true\n  }\n\n  let escapedStr = state.src[pos]\n\n  if (ch1 >= 0xD800 && ch1 <= 0xDBFF && pos + 1 < max) {\n    const ch2 = state.src.charCodeAt(pos + 1)\n\n    if (ch2 >= 0xDC00 && ch2 <= 0xDFFF) {\n      escapedStr += state.src[pos + 1]\n      pos++\n    }\n  }\n\n  const origStr = '\\\\' + escapedStr\n\n  if (!silent) {\n    const token = state.push('text_special', '', 0)\n\n    if (ch1 < 256 && ESCAPED[ch1] !== 0) {\n      token.content = escapedStr\n    } else {\n      token.content = origStr\n    }\n\n    token.markup = origStr\n    token.info   = 'escape'\n  }\n\n  state.pos = pos + 1\n  return true\n}\n"],"names":[],"mappings":";;AAAA;AACA;AAEA;AACA,MAAM,OAAO,GAAG,GAAE;AAClB;AACA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,EAAC,EAAE;AACjD;AACA,oCAAoC;AACpC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,EAAC,EAAE,EAAC;AACrE;AACe,SAAS,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;AAC/C,EAAE,IAAI,GAAG,GAAG,KAAK,CAAC,IAAG;AACrB,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,OAAM;AAC1B;AACA,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI,SAAS,OAAO,KAAK;AAC7D,EAAE,GAAG,GAAE;AACP;AACA;AACA,EAAE,IAAI,GAAG,IAAI,GAAG,EAAE,OAAO,KAAK;AAC9B;AACA,EAAE,IAAI,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAC;AACrC;AACA,EAAE,IAAI,GAAG,KAAK,IAAI,EAAE;AACpB,IAAI,IAAI,CAAC,MAAM,EAAE;AACjB,MAAM,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,EAAC;AACtC,KAAK;AACL;AACA,IAAI,GAAG,GAAE;AACT;AACA,IAAI,OAAO,GAAG,GAAG,GAAG,EAAE;AACtB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAC;AACrC,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,KAAK;AAC9B,MAAM,GAAG,GAAE;AACX,KAAK;AACL;AACA,IAAI,KAAK,CAAC,GAAG,GAAG,IAAG;AACnB,IAAI,OAAO,IAAI;AACf,GAAG;AACH;AACA,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAC;AACjC;AACA,EAAE,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE;AACvD,IAAI,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,EAAC;AAC7C;AACA,IAAI,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,EAAE;AACxC,MAAM,UAAU,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAC;AACtC,MAAM,GAAG,GAAE;AACX,KAAK;AACL,GAAG;AACH;AACA,EAAE,MAAM,OAAO,GAAG,IAAI,GAAG,WAAU;AACnC;AACA,EAAE,IAAI,CAAC,MAAM,EAAE;AACf,IAAI,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,EAAE,CAAC,EAAC;AACnD;AACA,IAAI,IAAI,GAAG,GAAG,GAAG,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;AACzC,MAAM,KAAK,CAAC,OAAO,GAAG,WAAU;AAChC,KAAK,MAAM;AACX,MAAM,KAAK,CAAC,OAAO,GAAG,QAAO;AAC7B,KAAK;AACL;AACA,IAAI,KAAK,CAAC,MAAM,GAAG,QAAO;AAC1B,IAAI,KAAK,CAAC,IAAI,KAAK,SAAQ;AAC3B,GAAG;AACH;AACA,EAAE,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG,EAAC;AACrB,EAAE,OAAO,IAAI;AACb;;;;","x_google_ignoreList":[0]}

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/fragments_join.mjs

@@ -0,0 +1,41 @@
+// Clean up tokens after emphasis and strikethrough postprocessing:
+// merge adjacent text nodes into one and re-calculate all token levels
+//
+// This is necessary because initially emphasis delimiter markers (*, _, ~)
+// are treated as their own separate text tokens. Then emphasis rule either
+// leaves them as text (needed to merge with adjacent text) or turns them
+// into opening/closing tags (which messes up levels inside).
+//
+
+function fragments_join (state) {
+  let curr, last;
+  let level = 0;
+  const tokens = state.tokens;
+  const max = state.tokens.length;
+
+  for (curr = last = 0; curr < max; curr++) {
+    // re-calculate levels after emphasis/strikethrough turns some text nodes
+    // into opening/closing tags
+    if (tokens[curr].nesting < 0) level--; // closing tag
+    tokens[curr].level = level;
+    if (tokens[curr].nesting > 0) level++; // opening tag
+
+    if (tokens[curr].type === 'text' &&
+        curr + 1 < max &&
+        tokens[curr + 1].type === 'text') {
+      // collapse two adjacent text nodes
+      tokens[curr + 1].content = tokens[curr].content + tokens[curr + 1].content;
+    } else {
+      if (curr !== last) { tokens[last] = tokens[curr]; }
+
+      last++;
+    }
+  }
+
+  if (curr !== last) {
+    tokens.length = last;
+  }
+}
+
+export { fragments_join as default };
+//# sourceMappingURL=fragments_join.mjs.map

package/es/node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/fragments_join.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"fragments_join.mjs","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@14.1.0/node_modules/markdown-it/lib/rules_inline/fragments_join.mjs"],"sourcesContent":["// Clean up tokens after emphasis and strikethrough postprocessing:\n// merge adjacent text nodes into one and re-calculate all token levels\n//\n// This is necessary because initially emphasis delimiter markers (*, _, ~)\n// are treated as their own separate text tokens. Then emphasis rule either\n// leaves them as text (needed to merge with adjacent text) or turns them\n// into opening/closing tags (which messes up levels inside).\n//\n\nexport default function fragments_join (state) {\n  let curr, last\n  let level = 0\n  const tokens = state.tokens\n  const max = state.tokens.length\n\n  for (curr = last = 0; curr < max; curr++) {\n    // re-calculate levels after emphasis/strikethrough turns some text nodes\n    // into opening/closing tags\n    if (tokens[curr].nesting < 0) level-- // closing tag\n    tokens[curr].level = level\n    if (tokens[curr].nesting > 0) level++ // opening tag\n\n    if (tokens[curr].type === 'text' &&\n        curr + 1 < max &&\n        tokens[curr + 1].type === 'text') {\n      // collapse two adjacent text nodes\n      tokens[curr + 1].content = tokens[curr].content + tokens[curr + 1].content\n    } else {\n      if (curr !== last) { tokens[last] = tokens[curr] }\n\n      last++\n    }\n  }\n\n  if (curr !== last) {\n    tokens.length = last\n  }\n}\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAS,cAAc,EAAE,KAAK,EAAE;AAC/C,EAAE,IAAI,IAAI,EAAE,KAAI;AAChB,EAAE,IAAI,KAAK,GAAG,EAAC;AACf,EAAE,MAAM,MAAM,GAAG,KAAK,CAAC,OAAM;AAC7B,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,OAAM;AACjC;AACA,EAAE,KAAK,IAAI,GAAG,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE;AAC5C;AACA;AACA,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,KAAK,GAAE;AACzC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,MAAK;AAC9B,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,KAAK,GAAE;AACzC;AACA,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;AACpC,QAAQ,IAAI,GAAG,CAAC,GAAG,GAAG;AACtB,QAAQ,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE;AAC1C;AACA,MAAM,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,QAAO;AAChF,KAAK,MAAM;AACX,MAAM,IAAI,IAAI,KAAK,IAAI,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,EAAC,EAAE;AACxD;AACA,MAAM,IAAI,GAAE;AACZ,KAAK;AACL,GAAG;AACH;AACA,EAAE,IAAI,IAAI,KAAK,IAAI,EAAE;AACrB,IAAI,MAAM,CAAC,MAAM,GAAG,KAAI;AACxB,GAAG;AACH;;;;","x_google_ignoreList":[0]}