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

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/backticks.js

@@ -1,63 +0,0 @@
-'use strict';
-
-var backticks = function backtick(state, silent) {
-  var start, max, marker, token, matchStart, matchEnd, openerLength, closerLength,
-      pos = state.pos,
-      ch = state.src.charCodeAt(pos);
-
-  if (ch !== 0x60/* ` */) { return false; }
-
-  start = pos;
-  pos++;
-  max = state.posMax;
-
-  // scan marker length
-  while (pos < max && state.src.charCodeAt(pos) === 0x60/* ` */) { pos++; }
-
-  marker = state.src.slice(start, pos);
-  openerLength = marker.length;
-
-  if (state.backticksScanned && (state.backticks[openerLength] || 0) <= start) {
-    if (!silent) state.pending += marker;
-    state.pos += openerLength;
-    return true;
-  }
-
-  matchStart = matchEnd = pos;
-
-  // 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++; }
-
-    closerLength = matchEnd - matchStart;
-
-    if (closerLength === openerLength) {
-      // Found matching closer length.
-      if (!silent) {
-        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;
-};
-
-exports.backticks = backticks;
-//# sourceMappingURL=backticks.js.map

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/backticks.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"backticks.js","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/backticks.js"],"sourcesContent":["// Parse backticks\n\n'use strict';\n\n\nmodule.exports = function backtick(state, silent) {\n  var start, max, marker, token, matchStart, matchEnd, openerLength, closerLength,\n      pos = state.pos,\n      ch = state.src.charCodeAt(pos);\n\n  if (ch !== 0x60/* ` */) { return false; }\n\n  start = pos;\n  pos++;\n  max = state.posMax;\n\n  // scan marker length\n  while (pos < max && state.src.charCodeAt(pos) === 0x60/* ` */) { pos++; }\n\n  marker = state.src.slice(start, pos);\n  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  matchStart = matchEnd = pos;\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    closerLength = matchEnd - matchStart;\n\n    if (closerLength === openerLength) {\n      // Found matching closer length.\n      if (!silent) {\n        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":";;AAKA,IAAA,SAAc,GAAG,SAAS,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE;AAClD,EAAE,IAAI,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY;AACjF,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG;AACrB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;;AAEpC,EAAE,IAAI,EAAE,KAAK,IAAI,SAAS,EAAE,OAAO,KAAK,CAAC,EAAA;;AAEzC,EAAE,KAAK,GAAG,GAAG,CAAA;AACb,EAAE,GAAG,EAAE,CAAA;AACP,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,CAAA;;AAEpB;AACA,EAAE,OAAO,GAAG,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI,SAAS,EAAE,GAAG,EAAE,CAAC,EAAA;;AAEzE,EAAE,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;AACtC,EAAE,YAAY,GAAG,MAAM,CAAC,MAAM,CAAA;;AAE9B,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,MAAM,CAAA;AACxC,IAAI,KAAK,CAAC,GAAG,IAAI,YAAY,CAAA;AAC7B,IAAI,OAAO,IAAI,CAAA;AACf,GAAA;;AAEA,EAAE,UAAU,GAAG,QAAQ,GAAG,GAAG,CAAA;;AAE7B;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,CAAC,CAAA;;AAE7B;AACA,IAAI,OAAO,QAAQ,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,IAAI,SAAS,EAAE,QAAQ,EAAE,CAAC,EAAA;;AAE1F,IAAI,YAAY,GAAG,QAAQ,GAAG,UAAU,CAAA;;AAExC,IAAI,IAAI,YAAY,KAAK,YAAY,EAAE;AACvC;AACA,MAAM,IAAI,CAAC,MAAM,EAAE;AACnB,QAAQ,KAAK,OAAO,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;AACxD,QAAQ,KAAK,CAAC,MAAM,IAAI,MAAM,CAAA;AAC9B,QAAQ,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,UAAU,CAAA;AACvD,WAAW,OAAO,CAAC,KAAK,EAAE,GAAG,CAAA;AAC7B,WAAW,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;AACpC,OAAA;AACA,MAAM,KAAK,CAAC,GAAG,GAAG,QAAQ,CAAA;AAC1B,MAAM,OAAO,IAAI,CAAA;AACjB,KAAA;;AAEA;AACA,IAAI,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,GAAG,UAAU,CAAA;AAC9C,GAAA;;AAEA;AACA,EAAE,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAA;;AAE/B,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,IAAI,MAAM,CAAA;AACtC,EAAE,KAAK,CAAC,GAAG,IAAI,YAAY,CAAA;AAC3B,EAAE,OAAO,IAAI,CAAA;AACb;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/balance_pairs.js

@@ -1,130 +0,0 @@
-'use strict';
-
-function processDelimiters(state, delimiters) {
-  var closerIdx, openerIdx, closer, opener, minOpenerIdx, newMinOpenerIdx,
-      isOddMatch, lastJump,
-      openersBottom = {},
-      max = delimiters.length;
-
-  if (!max) return;
-
-  // headerIdx is the first delimiter of the current (where closer is) delimiter run
-  var headerIdx = 0;
-  var lastTokenIdx = -2; // needs any value lower than -1
-  var jumps = [];
-
-  for (closerIdx = 0; closerIdx < max; closerIdx++) {
-    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
-    if (!openersBottom.hasOwnProperty(closer.marker)) {
-      openersBottom[closer.marker] = [ -1, -1, -1, -1, -1, -1 ];
-    }
-
-    minOpenerIdx = openersBottom[closer.marker][(closer.open ? 3 : 0) + (closer.length % 3)];
-
-    openerIdx = headerIdx - jumps[headerIdx] - 1;
-
-    newMinOpenerIdx = openerIdx;
-
-    for (; openerIdx > minOpenerIdx; openerIdx -= jumps[openerIdx] + 1) {
-      opener = delimiters[openerIdx];
-
-      if (opener.marker !== closer.marker) continue;
-
-      if (opener.open && opener.end < 0) {
-
-        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).
-          //
-          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;
-    }
-  }
-}
-
-
-var balance_pairs = function link_pairs(state) {
-  var curr,
-      tokens_meta = state.tokens_meta,
-      max = state.tokens_meta.length;
-
-  processDelimiters(state, state.delimiters);
-
-  for (curr = 0; curr < max; curr++) {
-    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {
-      processDelimiters(state, tokens_meta[curr].delimiters);
-    }
-  }
-};
-
-exports.balance_pairs = balance_pairs;
-//# sourceMappingURL=balance_pairs.js.map

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/balance_pairs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"balance_pairs.js","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/balance_pairs.js"],"sourcesContent":["// For each opening emphasis-like marker find a matching closing one\n//\n'use strict';\n\n\nfunction processDelimiters(state, delimiters) {\n  var closerIdx, openerIdx, closer, opener, minOpenerIdx, newMinOpenerIdx,\n      isOddMatch, lastJump,\n      openersBottom = {},\n      max = delimiters.length;\n\n  if (!max) return;\n\n  // headerIdx is the first delimiter of the current (where closer is) delimiter run\n  var headerIdx = 0;\n  var lastTokenIdx = -2; // needs any value lower than -1\n  var jumps = [];\n\n  for (closerIdx = 0; closerIdx < max; closerIdx++) {\n    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    if (!openersBottom.hasOwnProperty(closer.marker)) {\n      openersBottom[closer.marker] = [ -1, -1, -1, -1, -1, -1 ];\n    }\n\n    minOpenerIdx = openersBottom[closer.marker][(closer.open ? 3 : 0) + (closer.length % 3)];\n\n    openerIdx = headerIdx - jumps[headerIdx] - 1;\n\n    newMinOpenerIdx = openerIdx;\n\n    for (; openerIdx > minOpenerIdx; openerIdx -= jumps[openerIdx] + 1) {\n      opener = delimiters[openerIdx];\n\n      if (opener.marker !== closer.marker) continue;\n\n      if (opener.open && opener.end < 0) {\n\n        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          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\n\nmodule.exports = function link_pairs(state) {\n  var curr,\n      tokens_meta = state.tokens_meta,\n      max = state.tokens_meta.length;\n\n  processDelimiters(state, state.delimiters);\n\n  for (curr = 0; curr < max; curr++) {\n    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {\n      processDelimiters(state, tokens_meta[curr].delimiters);\n    }\n  }\n};\n"],"names":[],"mappings":";;AAKA,SAAS,iBAAiB,CAAC,KAAK,EAAE,UAAU,EAAE;AAC9C,EAAE,IAAI,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,eAAe;AACzE,MAAM,UAAU,EAAE,QAAQ;AAC1B,MAAM,aAAa,GAAG,EAAE;AACxB,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAA;;AAE7B,EAAE,IAAI,CAAC,GAAG,EAAE,OAAA;;AAEZ;AACA,EAAE,IAAI,SAAS,GAAG,CAAC,CAAA;AACnB,EAAE,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;AACxB,EAAE,IAAI,KAAK,GAAG,EAAE,CAAA;;AAEhB,EAAE,KAAK,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,GAAG,EAAE,SAAS,EAAE,EAAE;AACpD,IAAI,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC,CAAA;;AAElC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;AAEjB;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,SAAS,CAAA;AAC3B,KAAA;;AAEA,IAAI,YAAY,GAAG,MAAM,CAAC,KAAK,CAAA;;AAE/B;AACA;AACA;AACA;AACA,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,CAAC,CAAA;;AAEtC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,SAAA;;AAEvB;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,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAA;AAC/D,KAAA;;AAEA,IAAI,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;;AAE5F,IAAI,SAAS,GAAG,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;;AAEhD,IAAI,eAAe,GAAG,SAAS,CAAA;;AAE/B,IAAI,OAAO,SAAS,GAAG,YAAY,EAAE,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE;AACxE,MAAM,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC,CAAA;;AAEpC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,SAAA;;AAE3C,MAAM,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE;;AAEzC,QAAQ,UAAU,GAAG,KAAK,CAAA;;AAE1B;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,IAAI,CAAA;AAC/B,aAAA;AACA,WAAA;AACA,SAAA;;AAEA,QAAQ,IAAI,CAAC,UAAU,EAAE;AACzB;AACA;AACA;AACA;AACA,UAAU,QAAQ,GAAG,SAAS,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI;AACrE,YAAY,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC;AACpC,YAAY,CAAC,CAAA;;AAEb,UAAU,KAAK,CAAC,SAAS,CAAC,GAAG,SAAS,GAAG,SAAS,GAAG,QAAQ,CAAA;AAC7D,UAAU,KAAK,CAAC,SAAS,CAAC,GAAG,QAAQ,CAAA;;AAErC,UAAU,MAAM,CAAC,IAAI,IAAI,KAAK,CAAA;AAC9B,UAAU,MAAM,CAAC,GAAG,KAAK,SAAS,CAAA;AAClC,UAAU,MAAM,CAAC,KAAK,GAAG,KAAK,CAAA;AAC9B,UAAU,eAAe,GAAG,CAAC,CAAC,CAAA;AAC9B;AACA;AACA,UAAU,YAAY,GAAG,CAAC,CAAC,CAAA;AAC3B,UAAU,MAAA;AACV,SAAA;AACA,OAAA;AACA,KAAA;;AAEA,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,eAAe,CAAA;AACxG,KAAA;AACA,GAAA;AACA,CAAA;;;AAGA,IAAA,aAAc,GAAG,SAAS,UAAU,CAAC,KAAK,EAAE;AAC5C,EAAE,IAAI,IAAI;AACV,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW;AACrC,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAA;;AAEpC,EAAE,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,CAAA;;AAE5C,EAAE,KAAK,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE;AACrC,IAAI,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE;AAC3D,MAAM,iBAAiB,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAA;AAC5D,KAAA;AACA,GAAA;AACA;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/emphasis.js

@@ -1,134 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-var emphasis = require('../../../../../../../_virtual/emphasis.js');
-
-// Insert each marker as a separate text token, and add it to delimiter list
-//
-emphasis.__exports.tokenize = function emphasis(state, silent) {
-  var i, scanned, token,
-      start = state.pos,
-      marker = state.src.charCodeAt(start);
-
-  if (silent) { return false; }
-
-  if (marker !== 0x5F /* _ */ && marker !== 0x2A /* * */) { return false; }
-
-  scanned = state.scanDelims(state.pos, marker === 0x2A);
-
-  for (i = 0; i < scanned.length; i++) {
-    token         = state.push('text', '', 0);
-    token.content = String.fromCharCode(marker);
-
-    state.delimiters.push({
-      // Char code of the starting marker (number).
-      //
-      marker: 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) {
-  var i,
-      startDelim,
-      endDelim,
-      token,
-      ch,
-      isStrong,
-      max = delimiters.length;
-
-  for (i = max - 1; i >= 0; i--) {
-    startDelim = delimiters[i];
-
-    if (startDelim.marker !== 0x5F/* _ */ && startDelim.marker !== 0x2A/* * */) {
-      continue;
-    }
-
-    // Process only opening markers
-    if (startDelim.end === -1) {
-      continue;
-    }
-
-    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>`
-    //
-    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;
-
-    ch = String.fromCharCode(startDelim.marker);
-
-    token         = state.tokens[startDelim.token];
-    token.type    = isStrong ? 'strong_open' : 'em_open';
-    token.tag     = isStrong ? 'strong' : 'em';
-    token.nesting = 1;
-    token.markup  = isStrong ? ch + ch : ch;
-    token.content = '';
-
-    token         = state.tokens[endDelim.token];
-    token.type    = isStrong ? 'strong_close' : 'em_close';
-    token.tag     = isStrong ? 'strong' : 'em';
-    token.nesting = -1;
-    token.markup  = isStrong ? ch + ch : ch;
-    token.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
-//
-emphasis.__exports.postProcess = function emphasis(state) {
-  var curr,
-      tokens_meta = state.tokens_meta,
-      max = state.tokens_meta.length;
-
-  postProcess(state, state.delimiters);
-
-  for (curr = 0; curr < max; curr++) {
-    if (tokens_meta[curr] && tokens_meta[curr].delimiters) {
-      postProcess(state, tokens_meta[curr].delimiters);
-    }
-  }
-};
-
-exports.default = emphasis.__exports;
-//# sourceMappingURL=emphasis.js.map

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/emphasis.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"emphasis.js","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/emphasis.js"],"sourcesContent":["// Process *this* and _that_\n//\n'use strict';\n\n\n// Insert each marker as a separate text token, and add it to delimiter list\n//\nmodule.exports.tokenize = function emphasis(state, silent) {\n  var i, scanned, token,\n      start = state.pos,\n      marker = state.src.charCodeAt(start);\n\n  if (silent) { return false; }\n\n  if (marker !== 0x5F /* _ */ && marker !== 0x2A /* * */) { return false; }\n\n  scanned = state.scanDelims(state.pos, marker === 0x2A);\n\n  for (i = 0; i < scanned.length; i++) {\n    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: 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\n\nfunction postProcess(state, delimiters) {\n  var i,\n      startDelim,\n      endDelim,\n      token,\n      ch,\n      isStrong,\n      max = delimiters.length;\n\n  for (i = max - 1; i >= 0; i--) {\n    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    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    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    ch = String.fromCharCode(startDelim.marker);\n\n    token         = state.tokens[startDelim.token];\n    token.type    = isStrong ? 'strong_open' : 'em_open';\n    token.tag     = isStrong ? 'strong' : 'em';\n    token.nesting = 1;\n    token.markup  = isStrong ? ch + ch : ch;\n    token.content = '';\n\n    token         = state.tokens[endDelim.token];\n    token.type    = isStrong ? 'strong_close' : 'em_close';\n    token.tag     = isStrong ? 'strong' : 'em';\n    token.nesting = -1;\n    token.markup  = isStrong ? ch + ch : ch;\n    token.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\n// Walk through delimiter list and replace text tokens with tags\n//\nmodule.exports.postProcess = function emphasis(state) {\n  var curr,\n      tokens_meta = state.tokens_meta,\n      max = state.tokens_meta.length;\n\n  postProcess(state, state.delimiters);\n\n  for (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"],"names":["emphasis"],"mappings":";;;;;;AAKA;AACA;AACAA,kBAAA,CAAA,QAAuB,GAAG,SAAS,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE;AAC3D,EAAE,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK;AACvB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG;AACvB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;;AAE1C,EAAE,IAAI,MAAM,EAAE,EAAE,OAAO,KAAK,CAAC,EAAA;;AAE7B,EAAE,IAAI,MAAM,KAAK,IAAI,YAAY,MAAM,KAAK,IAAI,UAAU,EAAE,OAAO,KAAK,CAAC,EAAA;;AAEzE,EAAE,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC,CAAA;;AAExD,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,IAAI,KAAK,WAAW,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;AAC7C,IAAI,KAAK,CAAC,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAA;;AAE/C,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC;AAC1B;AACA;AACA,MAAM,MAAM,EAAE,MAAM;;AAEpB;AACA;AACA,MAAM,MAAM,EAAE,OAAO,CAAC,MAAM;;AAE5B;AACA;AACA,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;;AAErC;AACA;AACA;AACA,MAAM,GAAG,KAAK,CAAC,CAAC;;AAEhB;AACA;AACA;AACA,MAAM,IAAI,IAAI,OAAO,CAAC,QAAQ;AAC9B,MAAM,KAAK,GAAG,OAAO,CAAC,SAAA;AACtB,KAAK,CAAC,CAAA;AACN,GAAA;;AAEA,EAAE,KAAK,CAAC,GAAG,IAAI,OAAO,CAAC,MAAM,CAAA;;AAE7B,EAAE,OAAO,IAAI,CAAA;AACb,EAAC;;;AAGD,SAAS,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE;AACxC,EAAE,IAAI,CAAC;AACP,MAAM,UAAU;AAChB,MAAM,QAAQ;AACd,MAAM,KAAK;AACX,MAAM,EAAE;AACR,MAAM,QAAQ;AACd,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAA;;AAE7B,EAAE,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACjC,IAAI,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;;AAE9B,IAAI,IAAI,UAAU,CAAC,MAAM,KAAK,IAAI,WAAW,UAAU,CAAC,MAAM,KAAK,IAAI,SAAS;AAChF,MAAM,SAAA;AACN,KAAA;;AAEA;AACA,IAAI,IAAI,UAAU,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE;AAC/B,MAAM,SAAA;AACN,KAAA;;AAEA,IAAI,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;;AAEzC;AACA;AACA;AACA;AACA;AACA,IAAI,QAAQ,GAAG,CAAC,GAAG,CAAC;AACpB,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,CAAC,CAAA;;AAE1E,IAAI,EAAE,GAAG,MAAM,CAAC,YAAY,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;;AAE/C,IAAI,KAAK,WAAW,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;AAClD,IAAI,KAAK,CAAC,IAAI,MAAM,QAAQ,GAAG,aAAa,GAAG,SAAS,CAAA;AACxD,IAAI,KAAK,CAAC,GAAG,OAAO,QAAQ,GAAG,QAAQ,GAAG,IAAI,CAAA;AAC9C,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAA;AACrB,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;AAC3C,IAAI,KAAK,CAAC,OAAO,GAAG,EAAE,CAAA;;AAEtB,IAAI,KAAK,WAAW,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;AAChD,IAAI,KAAK,CAAC,IAAI,MAAM,QAAQ,GAAG,cAAc,GAAG,UAAU,CAAA;AAC1D,IAAI,KAAK,CAAC,GAAG,OAAO,QAAQ,GAAG,QAAQ,GAAG,IAAI,CAAA;AAC9C,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAA;AACtB,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;AAC3C,IAAI,KAAK,CAAC,OAAO,GAAG,EAAE,CAAA;;AAEtB,IAAI,IAAI,QAAQ,EAAE;AAClB,MAAM,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,EAAE,CAAA;AACxD,MAAM,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,EAAE,CAAA;AACrE,MAAM,CAAC,EAAE,CAAA;AACT,KAAA;AACA,GAAA;AACA,CAAA;;;AAGA;AACA;AACAA,kBAAA,CAAA,WAA0B,GAAG,SAAS,QAAQ,CAAC,KAAK,EAAE;AACtD,EAAE,IAAI,IAAI;AACV,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW;AACrC,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAA;;AAEpC,EAAE,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,CAAA;;AAEtC,EAAE,KAAK,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE;AACrC,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,CAAC,CAAA;AACtD,KAAA;AACA,GAAA;AACA;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/entity.js

@@ -1,53 +0,0 @@
-'use strict';
-
-var utils = require('../../../../../../../_virtual/utils.js');
-require('../common/utils.js');
-var entities$1 = require('../common/entities.js');
-
-var entities          = entities$1.entities;
-var has               = utils.__exports.has;
-var isValidEntityCode = utils.__exports.isValidEntityCode;
-var fromCodePoint     = utils.__exports.fromCodePoint;
-
-
-var DIGITAL_RE = /^&#((?:x[a-f0-9]{1,6}|[0-9]{1,7}));/i;
-var NAMED_RE   = /^&([a-z][a-z0-9]{1,31});/i;
-
-
-var entity = function entity(state, silent) {
-  var ch, code, match, pos = state.pos, max = state.posMax;
-
-  if (state.src.charCodeAt(pos) !== 0x26/* & */) { return false; }
-
-  if (pos + 1 < max) {
-    ch = state.src.charCodeAt(pos + 1);
-
-    if (ch === 0x23 /* # */) {
-      match = state.src.slice(pos).match(DIGITAL_RE);
-      if (match) {
-        if (!silent) {
-          code = match[1][0].toLowerCase() === 'x' ? parseInt(match[1].slice(1), 16) : parseInt(match[1], 10);
-          state.pending += isValidEntityCode(code) ? fromCodePoint(code) : fromCodePoint(0xFFFD);
-        }
-        state.pos += match[0].length;
-        return true;
-      }
-    } else {
-      match = state.src.slice(pos).match(NAMED_RE);
-      if (match) {
-        if (has(entities, match[1])) {
-          if (!silent) { state.pending += entities[match[1]]; }
-          state.pos += match[0].length;
-          return true;
-        }
-      }
-    }
-  }
-
-  if (!silent) { state.pending += '&'; }
-  state.pos++;
-  return true;
-};
-
-exports.entity = entity;
-//# sourceMappingURL=entity.js.map

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/entity.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"entity.js","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/entity.js"],"sourcesContent":["// Process html entity - &#123;, &#xAF;, &quot;, ...\n\n'use strict';\n\nvar entities          = require('../common/entities');\nvar has               = require('../common/utils').has;\nvar isValidEntityCode = require('../common/utils').isValidEntityCode;\nvar fromCodePoint     = require('../common/utils').fromCodePoint;\n\n\nvar DIGITAL_RE = /^&#((?:x[a-f0-9]{1,6}|[0-9]{1,7}));/i;\nvar NAMED_RE   = /^&([a-z][a-z0-9]{1,31});/i;\n\n\nmodule.exports = function entity(state, silent) {\n  var ch, code, match, pos = state.pos, max = state.posMax;\n\n  if (state.src.charCodeAt(pos) !== 0x26/* & */) { return false; }\n\n  if (pos + 1 < max) {\n    ch = state.src.charCodeAt(pos + 1);\n\n    if (ch === 0x23 /* # */) {\n      match = state.src.slice(pos).match(DIGITAL_RE);\n      if (match) {\n        if (!silent) {\n          code = match[1][0].toLowerCase() === 'x' ? parseInt(match[1].slice(1), 16) : parseInt(match[1], 10);\n          state.pending += isValidEntityCode(code) ? fromCodePoint(code) : fromCodePoint(0xFFFD);\n        }\n        state.pos += match[0].length;\n        return true;\n      }\n    } else {\n      match = state.src.slice(pos).match(NAMED_RE);\n      if (match) {\n        if (has(entities, match[1])) {\n          if (!silent) { state.pending += entities[match[1]]; }\n          state.pos += match[0].length;\n          return true;\n        }\n      }\n    }\n  }\n\n  if (!silent) { state.pending += '&'; }\n  state.pos++;\n  return true;\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;AAIA,IAAI,QAAQ,YAAYA,mBAA6B,CAAA;AACrD,IAAI,GAAG,iBAAiBC,eAA0B,CAAC,GAAG,CAAA;AACtD,IAAI,iBAAiB,GAAGA,eAA0B,CAAC,iBAAiB,CAAA;AACpE,IAAI,aAAa,OAAOA,eAA0B,CAAC,aAAa,CAAA;;;AAGhE,IAAI,UAAU,GAAG,sCAAsC,CAAA;AACvD,IAAI,QAAQ,KAAK,2BAA2B,CAAA;;;AAG5C,IAAA,MAAc,GAAG,SAAS,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE;AAChD,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,CAAA;;AAE1D,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI,SAAS,EAAE,OAAO,KAAK,CAAC,EAAA;;AAEhE,EAAE,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE;AACrB,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;;AAEtC,IAAI,IAAI,EAAE,KAAK,IAAI,UAAU;AAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;AACpD,MAAM,IAAI,KAAK,EAAE;AACjB,QAAQ,IAAI,CAAC,MAAM,EAAE;AACrB,UAAU,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,CAAC,CAAA;AAC7G,UAAU,KAAK,CAAC,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC,CAAA;AAChG,SAAA;AACA,QAAQ,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;AACpC,QAAQ,OAAO,IAAI,CAAA;AACnB,OAAA;AACA,KAAK,MAAM;AACX,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;AAClD,MAAM,IAAI,KAAK,EAAE;AACjB,QAAQ,IAAI,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;AACrC,UAAU,IAAI,CAAC,MAAM,EAAE,EAAE,KAAK,CAAC,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAA;AAC7D,UAAU,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;AACtC,UAAU,OAAO,IAAI,CAAA;AACrB,SAAA;AACA,OAAA;AACA,KAAA;AACA,GAAA;;AAEA,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,KAAK,CAAC,OAAO,IAAI,GAAG,CAAC,EAAA;AACtC,EAAE,KAAK,CAAC,GAAG,EAAE,CAAA;AACb,EAAE,OAAO,IAAI,CAAA;AACb;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/escape.js

@@ -1,56 +0,0 @@
-'use strict';
-
-var utils = require('../../../../../../../_virtual/utils.js');
-require('../common/utils.js');
-
-var isSpace = utils.__exports.isSpace;
-
-var ESCAPED = [];
-
-for (var i = 0; i < 256; i++) { ESCAPED.push(0); }
-
-'\\!"#$%&\'()*+,./:;<=>?@[]^_`{|}~-'
-  .split('').forEach(function (ch) { ESCAPED[ch.charCodeAt(0)] = 1; });
-
-
-var _escape = function escape(state, silent) {
-  var ch, pos = state.pos, max = state.posMax;
-
-  if (state.src.charCodeAt(pos) !== 0x5C/* \ */) { return false; }
-
-  pos++;
-
-  if (pos < max) {
-    ch = state.src.charCodeAt(pos);
-
-    if (ch < 256 && ESCAPED[ch] !== 0) {
-      if (!silent) { state.pending += state.src[pos]; }
-      state.pos += 2;
-      return true;
-    }
-
-    if (ch === 0x0A) {
-      if (!silent) {
-        state.push('hardbreak', 'br', 0);
-      }
-
-      pos++;
-      // skip leading whitespaces from next line
-      while (pos < max) {
-        ch = state.src.charCodeAt(pos);
-        if (!isSpace(ch)) { break; }
-        pos++;
-      }
-
-      state.pos = pos;
-      return true;
-    }
-  }
-
-  if (!silent) { state.pending += '\\'; }
-  state.pos++;
-  return true;
-};
-
-exports._escape = _escape;
-//# sourceMappingURL=escape.js.map

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/escape.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"escape.js","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/escape.js"],"sourcesContent":["// Process escaped chars and hardbreaks\n\n'use strict';\n\nvar isSpace = require('../common/utils').isSpace;\n\nvar ESCAPED = [];\n\nfor (var i = 0; i < 256; i++) { ESCAPED.push(0); }\n\n'\\\\!\"#$%&\\'()*+,./:;<=>?@[]^_`{|}~-'\n  .split('').forEach(function (ch) { ESCAPED[ch.charCodeAt(0)] = 1; });\n\n\nmodule.exports = function escape(state, silent) {\n  var ch, pos = state.pos, max = state.posMax;\n\n  if (state.src.charCodeAt(pos) !== 0x5C/* \\ */) { return false; }\n\n  pos++;\n\n  if (pos < max) {\n    ch = state.src.charCodeAt(pos);\n\n    if (ch < 256 && ESCAPED[ch] !== 0) {\n      if (!silent) { state.pending += state.src[pos]; }\n      state.pos += 2;\n      return true;\n    }\n\n    if (ch === 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        ch = state.src.charCodeAt(pos);\n        if (!isSpace(ch)) { break; }\n        pos++;\n      }\n\n      state.pos = pos;\n      return true;\n    }\n  }\n\n  if (!silent) { state.pending += '\\\\'; }\n  state.pos++;\n  return true;\n};\n"],"names":["require$$0"],"mappings":";;;;;AAIA,IAAI,OAAO,GAAGA,eAA0B,CAAC,OAAO,CAAA;;AAEhD,IAAI,OAAO,GAAG,EAAE,CAAA;;AAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAA;;AAEhD,oCAAA;AACA,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAA;;;AAGtE,IAAA,OAAc,GAAG,SAAS,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE;AAChD,EAAE,IAAI,EAAE,EAAE,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,CAAA;;AAE7C,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI,SAAS,EAAE,OAAO,KAAK,CAAC,EAAA;;AAEhE,EAAE,GAAG,EAAE,CAAA;;AAEP,EAAE,IAAI,GAAG,GAAG,GAAG,EAAE;AACjB,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;;AAElC,IAAI,IAAI,EAAE,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE;AACvC,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAA;AACrD,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,CAAA;AACpB,MAAM,OAAO,IAAI,CAAA;AACjB,KAAA;;AAEA,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE;AACrB,MAAM,IAAI,CAAC,MAAM,EAAE;AACnB,QAAQ,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;AACxC,OAAA;;AAEA,MAAM,GAAG,EAAE,CAAA;AACX;AACA,MAAM,OAAO,GAAG,GAAG,GAAG,EAAE;AACxB,QAAQ,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;AACtC,QAAQ,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAA;AAClC,QAAQ,GAAG,EAAE,CAAA;AACb,OAAA;;AAEA,MAAM,KAAK,CAAC,GAAG,GAAG,GAAG,CAAA;AACrB,MAAM,OAAO,IAAI,CAAA;AACjB,KAAA;AACA,GAAA;;AAEA,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,EAAA;AACvC,EAAE,KAAK,CAAC,GAAG,EAAE,CAAA;AACb,EAAE,OAAO,IAAI,CAAA;AACb;;;;","x_google_ignoreList":[0]}

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/html_inline.js

@@ -1,50 +0,0 @@
-'use strict';
-
-var html_re = require('../../../../../../../_virtual/html_re.js');
-require('../common/html_re.js');
-
-var HTML_TAG_RE = html_re.__exports.HTML_TAG_RE;
-
-
-function isLetter(ch) {
-  /*eslint no-bitwise:0*/
-  var lc = ch | 0x20; // to lower case
-  return (lc >= 0x61/* a */) && (lc <= 0x7a/* z */);
-}
-
-
-var html_inline = function html_inline(state, silent) {
-  var ch, match, max, token,
-      pos = state.pos;
-
-  if (!state.md.options.html) { return false; }
-
-  // Check start
-  max = state.posMax;
-  if (state.src.charCodeAt(pos) !== 0x3C/* < */ ||
-      pos + 2 >= max) {
-    return false;
-  }
-
-  // Quick fail on second char
-  ch = state.src.charCodeAt(pos + 1);
-  if (ch !== 0x21/* ! */ &&
-      ch !== 0x3F/* ? */ &&
-      ch !== 0x2F/* / */ &&
-      !isLetter(ch)) {
-    return false;
-  }
-
-  match = state.src.slice(pos).match(HTML_TAG_RE);
-  if (!match) { return false; }
-
-  if (!silent) {
-    token         = state.push('html_inline', '', 0);
-    token.content = state.src.slice(pos, pos + match[0].length);
-  }
-  state.pos += match[0].length;
-  return true;
-};
-
-exports.html_inline = html_inline;
-//# sourceMappingURL=html_inline.js.map

package/lib/node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/html_inline.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"html_inline.js","sources":["../../../../../../../../../node_modules/.pnpm/markdown-it@12.3.2/node_modules/markdown-it/lib/rules_inline/html_inline.js"],"sourcesContent":["// Process html tags\n\n'use strict';\n\n\nvar HTML_TAG_RE = require('../common/html_re').HTML_TAG_RE;\n\n\nfunction isLetter(ch) {\n  /*eslint no-bitwise:0*/\n  var lc = ch | 0x20; // to lower case\n  return (lc >= 0x61/* a */) && (lc <= 0x7a/* z */);\n}\n\n\nmodule.exports = function html_inline(state, silent) {\n  var ch, match, max, token,\n      pos = state.pos;\n\n  if (!state.md.options.html) { return false; }\n\n  // Check start\n  max = state.posMax;\n  if (state.src.charCodeAt(pos) !== 0x3C/* < */ ||\n      pos + 2 >= max) {\n    return false;\n  }\n\n  // Quick fail on second char\n  ch = state.src.charCodeAt(pos + 1);\n  if (ch !== 0x21/* ! */ &&\n      ch !== 0x3F/* ? */ &&\n      ch !== 0x2F/* / */ &&\n      !isLetter(ch)) {\n    return false;\n  }\n\n  match = state.src.slice(pos).match(HTML_TAG_RE);\n  if (!match) { return false; }\n\n  if (!silent) {\n    token         = state.push('html_inline', '', 0);\n    token.content = state.src.slice(pos, pos + match[0].length);\n  }\n  state.pos += match[0].length;\n  return true;\n};\n"],"names":["require$$0"],"mappings":";;;;;AAKA,IAAI,WAAW,GAAGA,iBAA4B,CAAC,WAAW,CAAA;;;AAG1D,SAAS,QAAQ,CAAC,EAAE,EAAE;AACtB;AACA,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AACrB,EAAE,OAAO,CAAC,EAAE,IAAI,IAAI,aAAa,EAAE,IAAI,IAAI,QAAQ,CAAA;AACnD,CAAA;;;AAGA,IAAA,WAAc,GAAG,SAAS,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE;AACrD,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK;AAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;;AAErB,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,OAAO,KAAK,CAAC,EAAA;;AAE7C;AACA,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,CAAA;AACpB,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,IAAI;AACxC,MAAM,GAAG,GAAG,CAAC,IAAI,GAAG,EAAE;AACtB,IAAI,OAAO,KAAK,CAAA;AAChB,GAAA;;AAEA;AACA,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;AACpC,EAAE,IAAI,EAAE,KAAK,IAAI;AACjB,MAAM,EAAE,KAAK,IAAI;AACjB,MAAM,EAAE,KAAK,IAAI;AACjB,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE;AACrB,IAAI,OAAO,KAAK,CAAA;AAChB,GAAA;;AAEA,EAAE,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;AACjD,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,OAAO,KAAK,CAAC,EAAA;;AAE7B,EAAE,IAAI,CAAC,MAAM,EAAE;AACf,IAAI,KAAK,WAAW,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;AACpD,IAAI,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;AAC/D,GAAA;AACA,EAAE,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;AAC9B,EAAE,OAAO,IAAI,CAAA;AACb;;;;","x_google_ignoreList":[0]}