@uiw/react-md-editor 4.0.2 → 4.0.4

package/dist/mdeditor.js

@@ -7,11 +7,11 @@
 		exports["@uiw/react-md-editor"] = factory(require("react"));
 	else
 		root["@uiw/react-md-editor"] = factory(root["React"]);
-})(self, (__WEBPACK_EXTERNAL_MODULE__787__) => {
+})(self, (__WEBPACK_EXTERNAL_MODULE__442__) => {
 return /******/ (() => { // webpackBootstrap
 /******/ 	var __webpack_modules__ = ({
 
-/***/ 28:
+/***/ 886:
 /***/ (function(module) {
 
 /**! 
@@ -91,7 +91,7 @@ return /******/ (() => { // webpackBootstrap
 
 /***/ }),
 
-/***/ 377:
+/***/ 740:
 /***/ ((module) => {
 
 module.exports = {
@@ -105,7 +105,7 @@ module.exports = {
 
 /***/ }),
 
-/***/ 229:
+/***/ 909:
 /***/ ((module) => {
 
 "use strict";
@@ -230,7 +230,7 @@ module.exports = function extend() {
 
 /***/ }),
 
-/***/ 812:
+/***/ 848:
 /***/ ((module) => {
 
 // http://www.w3.org/TR/CSS21/grammar.html
@@ -498,7 +498,7 @@ function trim(str) {
 
 /***/ }),
 
-/***/ 324:
+/***/ 934:
 /***/ ((module, exports) => {
 
 /**
@@ -541,7 +541,7 @@ module.exports = parsePart;
 
 /***/ }),
 
-/***/ 426:
+/***/ 192:
 /***/ ((__unused_webpack_module, exports, __webpack_require__) => {
 
 "use strict";
@@ -554,26 +554,26 @@ module.exports = parsePart;
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  */
-var f=__webpack_require__(787),k=Symbol.for("react.element"),l=Symbol.for("react.fragment"),m=Object.prototype.hasOwnProperty,n=f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner,p={key:!0,ref:!0,__self:!0,__source:!0};
+var f=__webpack_require__(442),k=Symbol.for("react.element"),l=Symbol.for("react.fragment"),m=Object.prototype.hasOwnProperty,n=f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner,p={key:!0,ref:!0,__self:!0,__source:!0};
 function q(c,a,g){var b,d={},e=null,h=null;void 0!==g&&(e=""+g);void 0!==a.key&&(e=""+a.key);void 0!==a.ref&&(h=a.ref);for(b in a)m.call(a,b)&&!p.hasOwnProperty(b)&&(d[b]=a[b]);if(c&&c.defaultProps)for(b in a=c.defaultProps,a)void 0===d[b]&&(d[b]=a[b]);return{$$typeof:k,type:c,key:e,ref:h,props:d,_owner:n.current}}exports.Fragment=l;exports.jsx=q;exports.jsxs=q;
 
 
 /***/ }),
 
-/***/ 246:
+/***/ 540:
 /***/ ((module, __unused_webpack_exports, __webpack_require__) => {
 
 "use strict";
 
 
 if (true) {
-  module.exports = __webpack_require__(426);
+  module.exports = __webpack_require__(192);
 } else {}
 
 
 /***/ }),
 
-/***/ 209:
+/***/ 857:
 /***/ (function(__unused_webpack_module, exports, __webpack_require__) {
 
 "use strict";
@@ -582,7 +582,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", ({ value: true }));
-var inline_style_parser_1 = __importDefault(__webpack_require__(812));
+var inline_style_parser_1 = __importDefault(__webpack_require__(848));
 /**
  * Parses inline style to object.
  *
@@ -624,11 +624,11 @@ exports["default"] = StyleToObject;
 
 /***/ }),
 
-/***/ 787:
+/***/ 442:
 /***/ ((module) => {
 
 "use strict";
-module.exports = __WEBPACK_EXTERNAL_MODULE__787__;
+module.exports = __WEBPACK_EXTERNAL_MODULE__442__;
 
 /***/ })
 
@@ -998,7 +998,7 @@ function _objectWithoutProperties(source, excluded) {
   return target;
 }
 // EXTERNAL MODULE: external {"root":"React","commonjs2":"react","commonjs":"react","amd":"react"}
-var external_root_React_commonjs2_react_commonjs_react_amd_react_ = __webpack_require__(787);
+var external_root_React_commonjs2_react_commonjs_react_amd_react_ = __webpack_require__(442);
 var external_root_React_commonjs2_react_commonjs_react_amd_react_default = /*#__PURE__*/__webpack_require__.n(external_root_React_commonjs2_react_commonjs_react_amd_react_);
 ;// CONCATENATED MODULE: ../node_modules/@babel/runtime/helpers/esm/extends.js
 function _extends() {
@@ -1574,7 +1574,7 @@ const html = create({
     autoFocus: types_boolean,
     autoPlay: types_boolean,
     blocking: spaceSeparated,
-    capture: types_boolean,
+    capture: null,
     charSet: null,
     checked: types_boolean,
     cite: null,
@@ -2565,7 +2565,7 @@ function space_separated_tokens_stringify(values) {
 }
 
 // EXTERNAL MODULE: ../node_modules/style-to-object/cjs/index.js
-var cjs = __webpack_require__(209);
+var cjs = __webpack_require__(857);
 ;// CONCATENATED MODULE: ../node_modules/style-to-object/esm/index.mjs
 
 
@@ -4195,7 +4195,7 @@ const urlAttributes = {
 }
 
 // EXTERNAL MODULE: ../node_modules/react/jsx-runtime.js
-var jsx_runtime = __webpack_require__(246);
+var jsx_runtime = __webpack_require__(540);
 ;// CONCATENATED MODULE: ../node_modules/remark-parse/node_modules/mdast-util-to-string/lib/index.js
 /**
  * @typedef {import('mdast').Nodes} Nodes
@@ -4776,8 +4776,6 @@ function htmlExtension(all, extension) {
  * @typedef {import('micromark-util-types').Code} Code
  */
 
-const unicodePunctuationInternal = regexCheck(/\p{P}/u)
-
 /**
  * Check whether the character code represents an ASCII alpha (`a` through `z`,
  * case insensitive).
@@ -4795,7 +4793,7 @@ const unicodePunctuationInternal = regexCheck(/\p{P}/u)
  * @returns {boolean}
  *   Whether it matches.
  */
-const asciiAlpha = regexCheck(/[A-Za-z]/)
+const asciiAlpha = regexCheck(/[A-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII alphanumeric (`a`
@@ -4809,7 +4807,7 @@ const asciiAlpha = regexCheck(/[A-Za-z]/)
  * @returns {boolean}
  *   Whether it matches.
  */
-const asciiAlphanumeric = regexCheck(/[\dA-Za-z]/)
+const asciiAlphanumeric = regexCheck(/[\dA-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII atext.
@@ -4832,7 +4830,7 @@ const asciiAlphanumeric = regexCheck(/[\dA-Za-z]/)
  * @returns {boolean}
  *   Whether it matches.
  */
-const asciiAtext = regexCheck(/[#-'*+\--9=?A-Z^-~]/)
+const asciiAtext = regexCheck(/[#-'*+\--9=?A-Z^-~]/);
 
 /**
  * Check whether a character code is an ASCII control character.
@@ -4850,7 +4848,7 @@ function asciiControl(code) {
     // Special whitespace codes (which have negative values), C0 and Control
     // character DEL
     code !== null && (code < 32 || code === 127)
-  )
+  );
 }
 
 /**
@@ -4864,7 +4862,7 @@ function asciiControl(code) {
  * @returns {boolean}
  *   Whether it matches.
  */
-const asciiDigit = regexCheck(/\d/)
+const asciiDigit = regexCheck(/\d/);
 
 /**
  * Check whether the character code represents an ASCII hex digit (`a` through
@@ -4884,7 +4882,7 @@ const asciiDigit = regexCheck(/\d/)
  * @returns {boolean}
  *   Whether it matches.
  */
-const asciiHexDigit = regexCheck(/[\dA-Fa-f]/)
+const asciiHexDigit = regexCheck(/[\dA-Fa-f]/);
 
 /**
  * Check whether the character code represents ASCII punctuation.
@@ -4899,7 +4897,7 @@ const asciiHexDigit = regexCheck(/[\dA-Fa-f]/)
  * @returns {boolean}
  *   Whether it matches.
  */
-const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/)
+const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/);
 
 /**
  * Check whether a character code is a markdown line ending.
@@ -4917,7 +4915,7 @@ const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/)
  *   Whether it matches.
  */
 function markdownLineEnding(code) {
-  return code !== null && code < -2
+  return code !== null && code < -2;
 }
 
 /**
@@ -4930,7 +4928,7 @@ function markdownLineEnding(code) {
  *   Whether it matches.
  */
 function markdownLineEndingOrSpace(code) {
-  return code !== null && (code < 0 || code === 32)
+  return code !== null && (code < 0 || code === 32);
 }
 
 /**
@@ -4949,7 +4947,7 @@ function markdownLineEndingOrSpace(code) {
  *   Whether it matches.
  */
 function markdownSpace(code) {
-  return code === -2 || code === -1 || code === 32
+  return code === -2 || code === -1 || code === 32;
 }
 
 // Size note: removing ASCII from the regex and using `asciiPunctuation` here
@@ -4968,14 +4966,12 @@ function markdownSpace(code) {
  * [The Unicode Standard](https://www.unicode.org/versions/).
  * Unicode Consortium.
  *
- * @param {Code} code
+ * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-function unicodePunctuation(code) {
-  return asciiPunctuation(code) || unicodePunctuationInternal(code)
-}
+const unicodePunctuation = regexCheck(/\p{P}|\p{S}/u);
 
 /**
  * Check whether the character code represents Unicode whitespace.
@@ -4994,10 +4990,10 @@ function unicodePunctuation(code) {
  *
  * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-const unicodeWhitespace = regexCheck(/\s/)
+const unicodeWhitespace = regexCheck(/\s/);
 
 /**
  * Create a code check from a regex.
@@ -5006,7 +5002,7 @@ const unicodeWhitespace = regexCheck(/\s/)
  * @returns {(code: Code) => boolean}
  */
 function regexCheck(regex) {
-  return check
+  return check;
 
   /**
    * Check whether a code matches the bound regex.
@@ -5017,10 +5013,9 @@ function regexCheck(regex) {
    *   Whether the character code matches the bound regex.
    */
   function check(code) {
-    return code !== null && code > -1 && regex.test(String.fromCharCode(code))
+    return code !== null && code > -1 && regex.test(String.fromCharCode(code));
   }
 }
-
 ;// CONCATENATED MODULE: ../node_modules/remark-parse/node_modules/micromark-factory-space/index.js
 /**
  * @typedef {import('micromark-util-types').Effects} Effects
@@ -14880,8 +14875,6 @@ const serializer = (strict, json, $, _) => {
  * @typedef {import('micromark-util-types').Code} Code
  */
 
-const micromark_util_character_unicodePunctuationInternal = micromark_util_character_regexCheck(/\p{P}/u)
-
 /**
  * Check whether the character code represents an ASCII alpha (`a` through `z`,
  * case insensitive).
@@ -14899,7 +14892,7 @@ const micromark_util_character_unicodePunctuationInternal = micromark_util_chara
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_util_character_asciiAlpha = micromark_util_character_regexCheck(/[A-Za-z]/)
+const micromark_util_character_asciiAlpha = micromark_util_character_regexCheck(/[A-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII alphanumeric (`a`
@@ -14913,7 +14906,7 @@ const micromark_util_character_asciiAlpha = micromark_util_character_regexCheck(
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_util_character_asciiAlphanumeric = micromark_util_character_regexCheck(/[\dA-Za-z]/)
+const micromark_util_character_asciiAlphanumeric = micromark_util_character_regexCheck(/[\dA-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII atext.
@@ -14936,7 +14929,7 @@ const micromark_util_character_asciiAlphanumeric = micromark_util_character_rege
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_util_character_asciiAtext = micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/)
+const micromark_util_character_asciiAtext = micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/);
 
 /**
  * Check whether a character code is an ASCII control character.
@@ -14954,7 +14947,7 @@ function micromark_util_character_asciiControl(code) {
     // Special whitespace codes (which have negative values), C0 and Control
     // character DEL
     code !== null && (code < 32 || code === 127)
-  )
+  );
 }
 
 /**
@@ -14968,7 +14961,7 @@ function micromark_util_character_asciiControl(code) {
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_util_character_asciiDigit = micromark_util_character_regexCheck(/\d/)
+const micromark_util_character_asciiDigit = micromark_util_character_regexCheck(/\d/);
 
 /**
  * Check whether the character code represents an ASCII hex digit (`a` through
@@ -14988,7 +14981,7 @@ const micromark_util_character_asciiDigit = micromark_util_character_regexCheck(
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_util_character_asciiHexDigit = micromark_util_character_regexCheck(/[\dA-Fa-f]/)
+const micromark_util_character_asciiHexDigit = micromark_util_character_regexCheck(/[\dA-Fa-f]/);
 
 /**
  * Check whether the character code represents ASCII punctuation.
@@ -15003,7 +14996,7 @@ const micromark_util_character_asciiHexDigit = micromark_util_character_regexChe
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_util_character_asciiPunctuation = micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/)
+const micromark_util_character_asciiPunctuation = micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/);
 
 /**
  * Check whether a character code is a markdown line ending.
@@ -15021,7 +15014,7 @@ const micromark_util_character_asciiPunctuation = micromark_util_character_regex
  *   Whether it matches.
  */
 function micromark_util_character_markdownLineEnding(code) {
-  return code !== null && code < -2
+  return code !== null && code < -2;
 }
 
 /**
@@ -15034,7 +15027,7 @@ function micromark_util_character_markdownLineEnding(code) {
  *   Whether it matches.
  */
 function micromark_util_character_markdownLineEndingOrSpace(code) {
-  return code !== null && (code < 0 || code === 32)
+  return code !== null && (code < 0 || code === 32);
 }
 
 /**
@@ -15053,7 +15046,7 @@ function micromark_util_character_markdownLineEndingOrSpace(code) {
  *   Whether it matches.
  */
 function micromark_util_character_markdownSpace(code) {
-  return code === -2 || code === -1 || code === 32
+  return code === -2 || code === -1 || code === 32;
 }
 
 // Size note: removing ASCII from the regex and using `asciiPunctuation` here
@@ -15072,14 +15065,12 @@ function micromark_util_character_markdownSpace(code) {
  * [The Unicode Standard](https://www.unicode.org/versions/).
  * Unicode Consortium.
  *
- * @param {Code} code
+ * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-function micromark_util_character_unicodePunctuation(code) {
-  return micromark_util_character_asciiPunctuation(code) || micromark_util_character_unicodePunctuationInternal(code)
-}
+const micromark_util_character_unicodePunctuation = micromark_util_character_regexCheck(/\p{P}|\p{S}/u);
 
 /**
  * Check whether the character code represents Unicode whitespace.
@@ -15098,10 +15089,10 @@ function micromark_util_character_unicodePunctuation(code) {
  *
  * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-const micromark_util_character_unicodeWhitespace = micromark_util_character_regexCheck(/\s/)
+const micromark_util_character_unicodeWhitespace = micromark_util_character_regexCheck(/\s/);
 
 /**
  * Create a code check from a regex.
@@ -15110,7 +15101,7 @@ const micromark_util_character_unicodeWhitespace = micromark_util_character_rege
  * @returns {(code: Code) => boolean}
  */
 function micromark_util_character_regexCheck(regex) {
-  return check
+  return check;
 
   /**
    * Check whether a code matches the bound regex.
@@ -15121,10 +15112,9 @@ function micromark_util_character_regexCheck(regex) {
    *   Whether the character code matches the bound regex.
    */
   function check(code) {
-    return code !== null && code > -1 && regex.test(String.fromCharCode(code))
+    return code !== null && code > -1 && regex.test(String.fromCharCode(code));
   }
 }
-
 ;// CONCATENATED MODULE: ../node_modules/mdast-util-to-hast/node_modules/micromark-util-sanitize-uri/index.js
 
 
@@ -17740,6 +17730,8 @@ function ignore() {
  * @typedef {import('mdast').Nodes} MdastNodes
  * @typedef {import('mdast').Parents} MdastParents
  *
+ * @typedef {import('vfile').VFile} VFile
+ *
  * @typedef {import('./footer.js').FootnoteBackContentTemplate} FootnoteBackContentTemplate
  * @typedef {import('./footer.js').FootnoteBackLabelTemplate} FootnoteBackLabelTemplate
  */
@@ -17785,6 +17777,8 @@ function ignore() {
  *   at that place.
  *   It can also break polyfills.
  *   Using a prefix solves these problems.
+ * @property {VFile | null | undefined} [file]
+ *   Corresponding virtual file representing the input document (optional).
  * @property {FootnoteBackContentTemplate | string | null | undefined} [footnoteBackContent]
  *   Content of the backreference back to references (default: `defaultFootnoteBackContent`).
  *
@@ -18312,12 +18306,14 @@ function toHast(tree, options) {
 /**
  * @typedef {import('hast').Root} HastRoot
  * @typedef {import('mdast').Root} MdastRoot
- * @typedef {import('mdast-util-to-hast').Options} Options
+ * @typedef {import('mdast-util-to-hast').Options} ToHastOptions
  * @typedef {import('unified').Processor} Processor
  * @typedef {import('vfile').VFile} VFile
  */
 
 /**
+ * @typedef {Omit<ToHastOptions, 'file'>} Options
+ *
  * @callback TransformBridge
  *   Bridge-mode.
  *
@@ -18446,7 +18442,9 @@ function remarkRehype(destination, options) {
      */
     return async function (tree, file) {
       // Cast because root in -> root out.
-      const hastTree = /** @type {HastRoot} */ (toHast(tree, options))
+      const hastTree = /** @type {HastRoot} */ (
+        toHast(tree, {file, ...options})
+      )
       await destination.run(hastTree, file)
     }
   }
@@ -18454,9 +18452,11 @@ function remarkRehype(destination, options) {
   /**
    * @type {TransformMutate}
    */
-  return function (tree) {
+  return function (tree, file) {
     // Cast because root in -> root out.
-    return /** @type {HastRoot} */ (toHast(tree, options || destination))
+    return /** @type {HastRoot} */ (
+      toHast(tree, {file, ...(options || destination)})
+    )
   }
 }
 
@@ -18475,7 +18475,7 @@ function bail(error) {
 }
 
 // EXTERNAL MODULE: ../node_modules/extend/index.js
-var extend = __webpack_require__(229);
+var extend = __webpack_require__(909);
 ;// CONCATENATED MODULE: ../node_modules/unified/node_modules/is-plain-obj/index.js
 function isPlainObject(value) {
 	if (typeof value !== 'object' || value === null) {
@@ -18486,23 +18486,44 @@ function isPlainObject(value) {
 	return (prototype === null || prototype === Object.prototype || Object.getPrototypeOf(prototype) === null) && !(Symbol.toStringTag in value) && !(Symbol.iterator in value);
 }
 
-;// CONCATENATED MODULE: ../node_modules/trough/index.js
+;// CONCATENATED MODULE: ../node_modules/trough/lib/index.js
+// To do: remove `void`s
+// To do: remove `null` from output of our APIs, allow it as user APIs.
+
 /**
- * @typedef {(error?: Error|null|undefined, ...output: Array<any>) => void} Callback
+ * @typedef {(error?: Error | null | undefined, ...output: Array<any>) => void} Callback
+ *   Callback.
+ *
  * @typedef {(...input: Array<any>) => any} Middleware
+ *   Ware.
+ *
+ * @typedef Pipeline
+ *   Pipeline.
+ * @property {Run} run
+ *   Run the pipeline.
+ * @property {Use} use
+ *   Add middleware.
  *
  * @typedef {(...input: Array<any>) => void} Run
  *   Call all middleware.
+ *
+ *   Calls `done` on completion with either an error or the output of the
+ *   last middleware.
+ *
+ *   > 👉 **Note**: as the length of input defines whether async functions get a
+ *   > `next` function,
+ *   > it’s recommended to keep `input` at one value normally.
+
+ *
  * @typedef {(fn: Middleware) => Pipeline} Use
- *   Add `fn` (middleware) to the list.
- * @typedef {{run: Run, use: Use}} Pipeline
- *   Middleware.
+ *   Add middleware.
  */
 
 /**
  * Create new middleware.
  *
  * @returns {Pipeline}
+ *   Pipeline.
  */
 function trough() {
   /** @type {Array<Middleware>} */
@@ -18527,7 +18548,7 @@ function trough() {
     /**
      * Run the next `fn`, or we’re done.
      *
-     * @param {Error|null|undefined} error
+     * @param {Error | null | undefined} error
      * @param {Array<any>} output
      */
     function next(error, ...output) {
@@ -18551,7 +18572,7 @@ function trough() {
 
       // Next or done.
       if (fn) {
-        trough_wrap(fn, next)(...output)
+        lib_wrap(fn, next)(...output)
       } else {
         callback(null, ...output)
       }
@@ -18572,14 +18593,38 @@ function trough() {
 }
 
 /**
- * Wrap `middleware`.
- * Can be sync or async; return a promise, receive a callback, or return new
- * values and errors.
+ * Wrap `middleware` into a uniform interface.
+ *
+ * You can pass all input to the resulting function.
+ * `callback` is then called with the output of `middleware`.
+ *
+ * If `middleware` accepts more arguments than the later given in input,
+ * an extra `done` function is passed to it after that input,
+ * which must be called by `middleware`.
+ *
+ * The first value in `input` is the main input value.
+ * All other input values are the rest input values.
+ * The values given to `callback` are the input values,
+ * merged with every non-nullish output value.
+ *
+ * * if `middleware` throws an error,
+ *   returns a promise that is rejected,
+ *   or calls the given `done` function with an error,
+ *   `callback` is called with that error
+ * * if `middleware` returns a value or returns a promise that is resolved,
+ *   that value is the main output value
+ * * if `middleware` calls `done`,
+ *   all non-nullish values except for the first one (the error) overwrite the
+ *   output values
  *
  * @param {Middleware} middleware
+ *   Function to wrap.
  * @param {Callback} callback
+ *   Callback called with the output of `middleware`.
+ * @returns {Run}
+ *   Wrapped middleware.
  */
-function trough_wrap(middleware, callback) {
+function lib_wrap(middleware, callback) {
   /** @type {boolean} */
   let called
 
@@ -18617,7 +18662,7 @@ function trough_wrap(middleware, callback) {
     }
 
     if (!fnExpectsCallback) {
-      if (result instanceof Promise) {
+      if (result && result.then && typeof result.then === 'function') {
         result.then(then, done)
       } else if (result instanceof Error) {
         done(result)
@@ -18629,6 +18674,7 @@ function trough_wrap(middleware, callback) {
 
   /**
    * Call `callback`, only once.
+   *
    * @type {Callback}
    */
   function done(error, ...output) {
@@ -21621,8 +21667,6 @@ function ccount(value, character) {
  * @typedef {import('micromark-util-types').Code} Code
  */
 
-const node_modules_micromark_util_character_unicodePunctuationInternal = node_modules_micromark_util_character_regexCheck(/\p{P}/u)
-
 /**
  * Check whether the character code represents an ASCII alpha (`a` through `z`,
  * case insensitive).
@@ -21640,7 +21684,7 @@ const node_modules_micromark_util_character_unicodePunctuationInternal = node_mo
  * @returns {boolean}
  *   Whether it matches.
  */
-const node_modules_micromark_util_character_asciiAlpha = node_modules_micromark_util_character_regexCheck(/[A-Za-z]/)
+const node_modules_micromark_util_character_asciiAlpha = node_modules_micromark_util_character_regexCheck(/[A-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII alphanumeric (`a`
@@ -21654,7 +21698,7 @@ const node_modules_micromark_util_character_asciiAlpha = node_modules_micromark_
  * @returns {boolean}
  *   Whether it matches.
  */
-const node_modules_micromark_util_character_asciiAlphanumeric = node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/)
+const node_modules_micromark_util_character_asciiAlphanumeric = node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII atext.
@@ -21677,7 +21721,7 @@ const node_modules_micromark_util_character_asciiAlphanumeric = node_modules_mic
  * @returns {boolean}
  *   Whether it matches.
  */
-const node_modules_micromark_util_character_asciiAtext = node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/)
+const node_modules_micromark_util_character_asciiAtext = node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/);
 
 /**
  * Check whether a character code is an ASCII control character.
@@ -21695,7 +21739,7 @@ function node_modules_micromark_util_character_asciiControl(code) {
     // Special whitespace codes (which have negative values), C0 and Control
     // character DEL
     code !== null && (code < 32 || code === 127)
-  )
+  );
 }
 
 /**
@@ -21709,7 +21753,7 @@ function node_modules_micromark_util_character_asciiControl(code) {
  * @returns {boolean}
  *   Whether it matches.
  */
-const node_modules_micromark_util_character_asciiDigit = node_modules_micromark_util_character_regexCheck(/\d/)
+const node_modules_micromark_util_character_asciiDigit = node_modules_micromark_util_character_regexCheck(/\d/);
 
 /**
  * Check whether the character code represents an ASCII hex digit (`a` through
@@ -21729,7 +21773,7 @@ const node_modules_micromark_util_character_asciiDigit = node_modules_micromark_
  * @returns {boolean}
  *   Whether it matches.
  */
-const node_modules_micromark_util_character_asciiHexDigit = node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/)
+const node_modules_micromark_util_character_asciiHexDigit = node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/);
 
 /**
  * Check whether the character code represents ASCII punctuation.
@@ -21744,7 +21788,7 @@ const node_modules_micromark_util_character_asciiHexDigit = node_modules_microma
  * @returns {boolean}
  *   Whether it matches.
  */
-const node_modules_micromark_util_character_asciiPunctuation = node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/)
+const node_modules_micromark_util_character_asciiPunctuation = node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/);
 
 /**
  * Check whether a character code is a markdown line ending.
@@ -21762,7 +21806,7 @@ const node_modules_micromark_util_character_asciiPunctuation = node_modules_micr
  *   Whether it matches.
  */
 function node_modules_micromark_util_character_markdownLineEnding(code) {
-  return code !== null && code < -2
+  return code !== null && code < -2;
 }
 
 /**
@@ -21775,7 +21819,7 @@ function node_modules_micromark_util_character_markdownLineEnding(code) {
  *   Whether it matches.
  */
 function node_modules_micromark_util_character_markdownLineEndingOrSpace(code) {
-  return code !== null && (code < 0 || code === 32)
+  return code !== null && (code < 0 || code === 32);
 }
 
 /**
@@ -21794,7 +21838,7 @@ function node_modules_micromark_util_character_markdownLineEndingOrSpace(code) {
  *   Whether it matches.
  */
 function node_modules_micromark_util_character_markdownSpace(code) {
-  return code === -2 || code === -1 || code === 32
+  return code === -2 || code === -1 || code === 32;
 }
 
 // Size note: removing ASCII from the regex and using `asciiPunctuation` here
@@ -21813,14 +21857,12 @@ function node_modules_micromark_util_character_markdownSpace(code) {
  * [The Unicode Standard](https://www.unicode.org/versions/).
  * Unicode Consortium.
  *
- * @param {Code} code
+ * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-function node_modules_micromark_util_character_unicodePunctuation(code) {
-  return node_modules_micromark_util_character_asciiPunctuation(code) || node_modules_micromark_util_character_unicodePunctuationInternal(code)
-}
+const node_modules_micromark_util_character_unicodePunctuation = node_modules_micromark_util_character_regexCheck(/\p{P}|\p{S}/u);
 
 /**
  * Check whether the character code represents Unicode whitespace.
@@ -21839,10 +21881,10 @@ function node_modules_micromark_util_character_unicodePunctuation(code) {
  *
  * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-const node_modules_micromark_util_character_unicodeWhitespace = node_modules_micromark_util_character_regexCheck(/\s/)
+const node_modules_micromark_util_character_unicodeWhitespace = node_modules_micromark_util_character_regexCheck(/\s/);
 
 /**
  * Create a code check from a regex.
@@ -21851,7 +21893,7 @@ const node_modules_micromark_util_character_unicodeWhitespace = node_modules_mic
  * @returns {(code: Code) => boolean}
  */
 function node_modules_micromark_util_character_regexCheck(regex) {
-  return check
+  return check;
 
   /**
    * Check whether a code matches the bound regex.
@@ -21862,10 +21904,9 @@ function node_modules_micromark_util_character_regexCheck(regex) {
    *   Whether the character code matches the bound regex.
    */
   function check(code) {
-    return code !== null && code > -1 && regex.test(String.fromCharCode(code))
+    return code !== null && code > -1 && regex.test(String.fromCharCode(code));
   }
 }
-
 ;// CONCATENATED MODULE: ../node_modules/mdast-util-find-and-replace/node_modules/escape-string-regexp/index.js
 function escapeStringRegexp(string) {
 	if (typeof string !== 'string') {
@@ -24658,6 +24699,7 @@ function paragraph_paragraph(node, _, state, info) {
 
 ;// CONCATENATED MODULE: ../node_modules/mdast-util-phrasing/lib/index.js
 /**
+ * @typedef {import('mdast').Html} Html
  * @typedef {import('mdast').PhrasingContent} PhrasingContent
  */
 
@@ -24675,21 +24717,30 @@ function paragraph_paragraph(node, _, state, info) {
  */
 
 const phrasing =
-  /** @type {(node?: unknown) => node is PhrasingContent} */
+  /** @type {(node?: unknown) => node is Exclude<PhrasingContent, Html>} */
   (
     convert([
       'break',
       'delete',
       'emphasis',
+      // To do: next major: removed since footnotes were added to GFM.
       'footnote',
       'footnoteReference',
       'image',
       'imageReference',
       'inlineCode',
+      // Enabled by `mdast-util-math`:
+      'inlineMath',
       'link',
       'linkReference',
+      // Enabled by `mdast-util-mdx`:
+      'mdxJsxTextElement',
+      // Enabled by `mdast-util-mdx`:
+      'mdxTextExpression',
       'strong',
-      'text'
+      'text',
+      // Enabled by `mdast-util-directive`:
+      'textDirective'
     ])
   )
 
@@ -25635,8 +25686,6 @@ function micromark_util_combine_extensions_htmlExtension(all, extension) {
  * @typedef {import('micromark-util-types').Code} Code
  */
 
-const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_unicodePunctuationInternal = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/\p{P}/u)
-
 /**
  * Check whether the character code represents an ASCII alpha (`a` through `z`,
  * case insensitive).
@@ -25654,7 +25703,7 @@ const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_chara
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/)
+const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII alphanumeric (`a`
@@ -25668,7 +25717,7 @@ const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_chara
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/)
+const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII atext.
@@ -25691,7 +25740,7 @@ const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_chara
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/)
+const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/);
 
 /**
  * Check whether a character code is an ASCII control character.
@@ -25709,7 +25758,7 @@ function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_ch
     // Special whitespace codes (which have negative values), C0 and Control
     // character DEL
     code !== null && (code < 32 || code === 127)
-  )
+  );
 }
 
 /**
@@ -25723,7 +25772,7 @@ function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_ch
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/\d/)
+const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/\d/);
 
 /**
  * Check whether the character code represents an ASCII hex digit (`a` through
@@ -25743,7 +25792,7 @@ const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_chara
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/)
+const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/);
 
 /**
  * Check whether the character code represents ASCII punctuation.
@@ -25758,7 +25807,7 @@ const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_chara
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/)
+const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/);
 
 /**
  * Check whether a character code is a markdown line ending.
@@ -25776,7 +25825,7 @@ const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_chara
  *   Whether it matches.
  */
 function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_markdownLineEnding(code) {
-  return code !== null && code < -2
+  return code !== null && code < -2;
 }
 
 /**
@@ -25789,7 +25838,7 @@ function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_ch
  *   Whether it matches.
  */
 function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_markdownLineEndingOrSpace(code) {
-  return code !== null && (code < 0 || code === 32)
+  return code !== null && (code < 0 || code === 32);
 }
 
 /**
@@ -25808,7 +25857,7 @@ function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_ch
  *   Whether it matches.
  */
 function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_markdownSpace(code) {
-  return code === -2 || code === -1 || code === 32
+  return code === -2 || code === -1 || code === 32;
 }
 
 // Size note: removing ASCII from the regex and using `asciiPunctuation` here
@@ -25827,14 +25876,12 @@ function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_ch
  * [The Unicode Standard](https://www.unicode.org/versions/).
  * Unicode Consortium.
  *
- * @param {Code} code
+ * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_unicodePunctuation(code) {
-  return micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_asciiPunctuation(code) || micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_unicodePunctuationInternal(code)
-}
+const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_unicodePunctuation = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/\p{P}|\p{S}/u);
 
 /**
  * Check whether the character code represents Unicode whitespace.
@@ -25853,10 +25900,10 @@ function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_ch
  *
  * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/\s/)
+const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(/\s/);
 
 /**
  * Create a code check from a regex.
@@ -25865,7 +25912,7 @@ const micromark_extension_gfm_autolink_literal_node_modules_micromark_util_chara
  * @returns {(code: Code) => boolean}
  */
 function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_character_regexCheck(regex) {
-  return check
+  return check;
 
   /**
    * Check whether a code matches the bound regex.
@@ -25876,10 +25923,9 @@ function micromark_extension_gfm_autolink_literal_node_modules_micromark_util_ch
    *   Whether the character code matches the bound regex.
    */
   function check(code) {
-    return code !== null && code > -1 && regex.test(String.fromCharCode(code))
+    return code !== null && code > -1 && regex.test(String.fromCharCode(code));
   }
 }
-
 ;// CONCATENATED MODULE: ../node_modules/micromark-extension-gfm-autolink-literal/lib/syntax.js
 /**
  * @typedef {import('micromark-util-types').Code} Code
@@ -26837,8 +26883,6 @@ function previousUnbalanced(events) {
  * @typedef {import('micromark-util-types').Code} Code
  */
 
-const micromark_extension_gfm_footnote_node_modules_micromark_util_character_unicodePunctuationInternal = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/\p{P}/u)
-
 /**
  * Check whether the character code represents an ASCII alpha (`a` through `z`,
  * case insensitive).
@@ -26856,7 +26900,7 @@ const micromark_extension_gfm_footnote_node_modules_micromark_util_character_uni
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/)
+const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII alphanumeric (`a`
@@ -26870,7 +26914,7 @@ const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asc
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/)
+const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII atext.
@@ -26893,7 +26937,7 @@ const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asc
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/)
+const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/);
 
 /**
  * Check whether a character code is an ASCII control character.
@@ -26911,7 +26955,7 @@ function micromark_extension_gfm_footnote_node_modules_micromark_util_character_
     // Special whitespace codes (which have negative values), C0 and Control
     // character DEL
     code !== null && (code < 32 || code === 127)
-  )
+  );
 }
 
 /**
@@ -26925,7 +26969,7 @@ function micromark_extension_gfm_footnote_node_modules_micromark_util_character_
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/\d/)
+const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/\d/);
 
 /**
  * Check whether the character code represents an ASCII hex digit (`a` through
@@ -26945,7 +26989,7 @@ const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asc
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/)
+const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/);
 
 /**
  * Check whether the character code represents ASCII punctuation.
@@ -26960,7 +27004,7 @@ const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asc
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/)
+const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/);
 
 /**
  * Check whether a character code is a markdown line ending.
@@ -26978,7 +27022,7 @@ const micromark_extension_gfm_footnote_node_modules_micromark_util_character_asc
  *   Whether it matches.
  */
 function micromark_extension_gfm_footnote_node_modules_micromark_util_character_markdownLineEnding(code) {
-  return code !== null && code < -2
+  return code !== null && code < -2;
 }
 
 /**
@@ -26991,7 +27035,7 @@ function micromark_extension_gfm_footnote_node_modules_micromark_util_character_
  *   Whether it matches.
  */
 function micromark_extension_gfm_footnote_node_modules_micromark_util_character_markdownLineEndingOrSpace(code) {
-  return code !== null && (code < 0 || code === 32)
+  return code !== null && (code < 0 || code === 32);
 }
 
 /**
@@ -27010,7 +27054,7 @@ function micromark_extension_gfm_footnote_node_modules_micromark_util_character_
  *   Whether it matches.
  */
 function micromark_extension_gfm_footnote_node_modules_micromark_util_character_markdownSpace(code) {
-  return code === -2 || code === -1 || code === 32
+  return code === -2 || code === -1 || code === 32;
 }
 
 // Size note: removing ASCII from the regex and using `asciiPunctuation` here
@@ -27029,14 +27073,12 @@ function micromark_extension_gfm_footnote_node_modules_micromark_util_character_
  * [The Unicode Standard](https://www.unicode.org/versions/).
  * Unicode Consortium.
  *
- * @param {Code} code
+ * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-function micromark_extension_gfm_footnote_node_modules_micromark_util_character_unicodePunctuation(code) {
-  return micromark_extension_gfm_footnote_node_modules_micromark_util_character_asciiPunctuation(code) || micromark_extension_gfm_footnote_node_modules_micromark_util_character_unicodePunctuationInternal(code)
-}
+const micromark_extension_gfm_footnote_node_modules_micromark_util_character_unicodePunctuation = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/\p{P}|\p{S}/u);
 
 /**
  * Check whether the character code represents Unicode whitespace.
@@ -27055,10 +27097,10 @@ function micromark_extension_gfm_footnote_node_modules_micromark_util_character_
  *
  * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-const micromark_extension_gfm_footnote_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/\s/)
+const micromark_extension_gfm_footnote_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(/\s/);
 
 /**
  * Create a code check from a regex.
@@ -27067,7 +27109,7 @@ const micromark_extension_gfm_footnote_node_modules_micromark_util_character_uni
  * @returns {(code: Code) => boolean}
  */
 function micromark_extension_gfm_footnote_node_modules_micromark_util_character_regexCheck(regex) {
-  return check
+  return check;
 
   /**
    * Check whether a code matches the bound regex.
@@ -27078,10 +27120,9 @@ function micromark_extension_gfm_footnote_node_modules_micromark_util_character_
    *   Whether the character code matches the bound regex.
    */
   function check(code) {
-    return code !== null && code > -1 && regex.test(String.fromCharCode(code))
+    return code !== null && code > -1 && regex.test(String.fromCharCode(code));
   }
 }
-
 ;// CONCATENATED MODULE: ../node_modules/micromark-extension-gfm-footnote/node_modules/micromark-factory-space/index.js
 /**
  * @typedef {import('micromark-util-types').Effects} Effects
@@ -27869,8 +27910,6 @@ function node_modules_micromark_util_chunked_push(list, items) {
  * @typedef {import('micromark-util-types').Code} Code
  */
 
-const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_unicodePunctuationInternal = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/\p{P}/u)
-
 /**
  * Check whether the character code represents an ASCII alpha (`a` through `z`,
  * case insensitive).
@@ -27888,7 +27927,7 @@ const micromark_extension_gfm_strikethrough_node_modules_micromark_util_characte
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/)
+const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII alphanumeric (`a`
@@ -27902,7 +27941,7 @@ const micromark_extension_gfm_strikethrough_node_modules_micromark_util_characte
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/)
+const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII atext.
@@ -27925,7 +27964,7 @@ const micromark_extension_gfm_strikethrough_node_modules_micromark_util_characte
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/)
+const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/);
 
 /**
  * Check whether a character code is an ASCII control character.
@@ -27943,7 +27982,7 @@ function micromark_extension_gfm_strikethrough_node_modules_micromark_util_chara
     // Special whitespace codes (which have negative values), C0 and Control
     // character DEL
     code !== null && (code < 32 || code === 127)
-  )
+  );
 }
 
 /**
@@ -27957,7 +27996,7 @@ function micromark_extension_gfm_strikethrough_node_modules_micromark_util_chara
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/\d/)
+const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/\d/);
 
 /**
  * Check whether the character code represents an ASCII hex digit (`a` through
@@ -27977,7 +28016,7 @@ const micromark_extension_gfm_strikethrough_node_modules_micromark_util_characte
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/)
+const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/);
 
 /**
  * Check whether the character code represents ASCII punctuation.
@@ -27992,7 +28031,7 @@ const micromark_extension_gfm_strikethrough_node_modules_micromark_util_characte
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/)
+const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/);
 
 /**
  * Check whether a character code is a markdown line ending.
@@ -28010,7 +28049,7 @@ const micromark_extension_gfm_strikethrough_node_modules_micromark_util_characte
  *   Whether it matches.
  */
 function micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_markdownLineEnding(code) {
-  return code !== null && code < -2
+  return code !== null && code < -2;
 }
 
 /**
@@ -28023,7 +28062,7 @@ function micromark_extension_gfm_strikethrough_node_modules_micromark_util_chara
  *   Whether it matches.
  */
 function micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_markdownLineEndingOrSpace(code) {
-  return code !== null && (code < 0 || code === 32)
+  return code !== null && (code < 0 || code === 32);
 }
 
 /**
@@ -28042,7 +28081,7 @@ function micromark_extension_gfm_strikethrough_node_modules_micromark_util_chara
  *   Whether it matches.
  */
 function micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_markdownSpace(code) {
-  return code === -2 || code === -1 || code === 32
+  return code === -2 || code === -1 || code === 32;
 }
 
 // Size note: removing ASCII from the regex and using `asciiPunctuation` here
@@ -28061,14 +28100,12 @@ function micromark_extension_gfm_strikethrough_node_modules_micromark_util_chara
  * [The Unicode Standard](https://www.unicode.org/versions/).
  * Unicode Consortium.
  *
- * @param {Code} code
+ * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-function micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_unicodePunctuation(code) {
-  return micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_asciiPunctuation(code) || micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_unicodePunctuationInternal(code)
-}
+const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_unicodePunctuation = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/\p{P}|\p{S}/u);
 
 /**
  * Check whether the character code represents Unicode whitespace.
@@ -28087,10 +28124,10 @@ function micromark_extension_gfm_strikethrough_node_modules_micromark_util_chara
  *
  * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/\s/)
+const micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(/\s/);
 
 /**
  * Create a code check from a regex.
@@ -28099,7 +28136,7 @@ const micromark_extension_gfm_strikethrough_node_modules_micromark_util_characte
  * @returns {(code: Code) => boolean}
  */
 function micromark_extension_gfm_strikethrough_node_modules_micromark_util_character_regexCheck(regex) {
-  return check
+  return check;
 
   /**
    * Check whether a code matches the bound regex.
@@ -28110,10 +28147,9 @@ function micromark_extension_gfm_strikethrough_node_modules_micromark_util_chara
    *   Whether the character code matches the bound regex.
    */
   function check(code) {
-    return code !== null && code > -1 && regex.test(String.fromCharCode(code))
+    return code !== null && code > -1 && regex.test(String.fromCharCode(code));
   }
 }
-
 ;// CONCATENATED MODULE: ../node_modules/micromark-extension-gfm-strikethrough/node_modules/micromark-util-classify-character/index.js
 /**
  * @typedef {import('micromark-util-types').Code} Code
@@ -28371,8 +28407,6 @@ function gfmStrikethrough(options) {
  * @typedef {import('micromark-util-types').Code} Code
  */
 
-const micromark_extension_gfm_table_node_modules_micromark_util_character_unicodePunctuationInternal = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/\p{P}/u)
-
 /**
  * Check whether the character code represents an ASCII alpha (`a` through `z`,
  * case insensitive).
@@ -28390,7 +28424,7 @@ const micromark_extension_gfm_table_node_modules_micromark_util_character_unicod
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/)
+const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII alphanumeric (`a`
@@ -28404,7 +28438,7 @@ const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiA
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/)
+const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII atext.
@@ -28427,7 +28461,7 @@ const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiA
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/)
+const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/);
 
 /**
  * Check whether a character code is an ASCII control character.
@@ -28445,7 +28479,7 @@ function micromark_extension_gfm_table_node_modules_micromark_util_character_asc
     // Special whitespace codes (which have negative values), C0 and Control
     // character DEL
     code !== null && (code < 32 || code === 127)
-  )
+  );
 }
 
 /**
@@ -28459,7 +28493,7 @@ function micromark_extension_gfm_table_node_modules_micromark_util_character_asc
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/\d/)
+const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/\d/);
 
 /**
  * Check whether the character code represents an ASCII hex digit (`a` through
@@ -28479,7 +28513,7 @@ const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiD
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/)
+const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/);
 
 /**
  * Check whether the character code represents ASCII punctuation.
@@ -28494,7 +28528,7 @@ const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiH
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/)
+const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/);
 
 /**
  * Check whether a character code is a markdown line ending.
@@ -28512,7 +28546,7 @@ const micromark_extension_gfm_table_node_modules_micromark_util_character_asciiP
  *   Whether it matches.
  */
 function micromark_extension_gfm_table_node_modules_micromark_util_character_markdownLineEnding(code) {
-  return code !== null && code < -2
+  return code !== null && code < -2;
 }
 
 /**
@@ -28525,7 +28559,7 @@ function micromark_extension_gfm_table_node_modules_micromark_util_character_mar
  *   Whether it matches.
  */
 function micromark_extension_gfm_table_node_modules_micromark_util_character_markdownLineEndingOrSpace(code) {
-  return code !== null && (code < 0 || code === 32)
+  return code !== null && (code < 0 || code === 32);
 }
 
 /**
@@ -28544,7 +28578,7 @@ function micromark_extension_gfm_table_node_modules_micromark_util_character_mar
  *   Whether it matches.
  */
 function micromark_extension_gfm_table_node_modules_micromark_util_character_markdownSpace(code) {
-  return code === -2 || code === -1 || code === 32
+  return code === -2 || code === -1 || code === 32;
 }
 
 // Size note: removing ASCII from the regex and using `asciiPunctuation` here
@@ -28563,14 +28597,12 @@ function micromark_extension_gfm_table_node_modules_micromark_util_character_mar
  * [The Unicode Standard](https://www.unicode.org/versions/).
  * Unicode Consortium.
  *
- * @param {Code} code
+ * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-function micromark_extension_gfm_table_node_modules_micromark_util_character_unicodePunctuation(code) {
-  return micromark_extension_gfm_table_node_modules_micromark_util_character_asciiPunctuation(code) || micromark_extension_gfm_table_node_modules_micromark_util_character_unicodePunctuationInternal(code)
-}
+const micromark_extension_gfm_table_node_modules_micromark_util_character_unicodePunctuation = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/\p{P}|\p{S}/u);
 
 /**
  * Check whether the character code represents Unicode whitespace.
@@ -28589,10 +28621,10 @@ function micromark_extension_gfm_table_node_modules_micromark_util_character_uni
  *
  * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-const micromark_extension_gfm_table_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/\s/)
+const micromark_extension_gfm_table_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(/\s/);
 
 /**
  * Create a code check from a regex.
@@ -28601,7 +28633,7 @@ const micromark_extension_gfm_table_node_modules_micromark_util_character_unicod
  * @returns {(code: Code) => boolean}
  */
 function micromark_extension_gfm_table_node_modules_micromark_util_character_regexCheck(regex) {
-  return check
+  return check;
 
   /**
    * Check whether a code matches the bound regex.
@@ -28612,10 +28644,9 @@ function micromark_extension_gfm_table_node_modules_micromark_util_character_reg
    *   Whether the character code matches the bound regex.
    */
   function check(code) {
-    return code !== null && code > -1 && regex.test(String.fromCharCode(code))
+    return code !== null && code > -1 && regex.test(String.fromCharCode(code));
   }
 }
-
 ;// CONCATENATED MODULE: ../node_modules/micromark-extension-gfm-table/node_modules/micromark-factory-space/index.js
 /**
  * @typedef {import('micromark-util-types').Effects} Effects
@@ -29833,8 +29864,6 @@ function getPoint(events, index) {
  * @typedef {import('micromark-util-types').Code} Code
  */
 
-const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_unicodePunctuationInternal = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/\p{P}/u)
-
 /**
  * Check whether the character code represents an ASCII alpha (`a` through `z`,
  * case insensitive).
@@ -29852,7 +29881,7 @@ const micromark_extension_gfm_task_list_item_node_modules_micromark_util_charact
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/)
+const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiAlpha = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[A-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII alphanumeric (`a`
@@ -29866,7 +29895,7 @@ const micromark_extension_gfm_task_list_item_node_modules_micromark_util_charact
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/)
+const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiAlphanumeric = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[\dA-Za-z]/);
 
 /**
  * Check whether the character code represents an ASCII atext.
@@ -29889,7 +29918,7 @@ const micromark_extension_gfm_task_list_item_node_modules_micromark_util_charact
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/)
+const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiAtext = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[#-'*+\--9=?A-Z^-~]/);
 
 /**
  * Check whether a character code is an ASCII control character.
@@ -29907,7 +29936,7 @@ function micromark_extension_gfm_task_list_item_node_modules_micromark_util_char
     // Special whitespace codes (which have negative values), C0 and Control
     // character DEL
     code !== null && (code < 32 || code === 127)
-  )
+  );
 }
 
 /**
@@ -29921,7 +29950,7 @@ function micromark_extension_gfm_task_list_item_node_modules_micromark_util_char
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/\d/)
+const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiDigit = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/\d/);
 
 /**
  * Check whether the character code represents an ASCII hex digit (`a` through
@@ -29941,7 +29970,7 @@ const micromark_extension_gfm_task_list_item_node_modules_micromark_util_charact
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/)
+const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiHexDigit = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[\dA-Fa-f]/);
 
 /**
  * Check whether the character code represents ASCII punctuation.
@@ -29956,7 +29985,7 @@ const micromark_extension_gfm_task_list_item_node_modules_micromark_util_charact
  * @returns {boolean}
  *   Whether it matches.
  */
-const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/)
+const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiPunctuation = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/[!-/:-@[-`{-~]/);
 
 /**
  * Check whether a character code is a markdown line ending.
@@ -29974,7 +30003,7 @@ const micromark_extension_gfm_task_list_item_node_modules_micromark_util_charact
  *   Whether it matches.
  */
 function micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_markdownLineEnding(code) {
-  return code !== null && code < -2
+  return code !== null && code < -2;
 }
 
 /**
@@ -29987,7 +30016,7 @@ function micromark_extension_gfm_task_list_item_node_modules_micromark_util_char
  *   Whether it matches.
  */
 function micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_markdownLineEndingOrSpace(code) {
-  return code !== null && (code < 0 || code === 32)
+  return code !== null && (code < 0 || code === 32);
 }
 
 /**
@@ -30006,7 +30035,7 @@ function micromark_extension_gfm_task_list_item_node_modules_micromark_util_char
  *   Whether it matches.
  */
 function micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_markdownSpace(code) {
-  return code === -2 || code === -1 || code === 32
+  return code === -2 || code === -1 || code === 32;
 }
 
 // Size note: removing ASCII from the regex and using `asciiPunctuation` here
@@ -30025,14 +30054,12 @@ function micromark_extension_gfm_task_list_item_node_modules_micromark_util_char
  * [The Unicode Standard](https://www.unicode.org/versions/).
  * Unicode Consortium.
  *
- * @param {Code} code
+ * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-function micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_unicodePunctuation(code) {
-  return micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_asciiPunctuation(code) || micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_unicodePunctuationInternal(code)
-}
+const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_unicodePunctuation = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/\p{P}|\p{S}/u);
 
 /**
  * Check whether the character code represents Unicode whitespace.
@@ -30051,10 +30078,10 @@ function micromark_extension_gfm_task_list_item_node_modules_micromark_util_char
  *
  * @param code
  *   Code.
- * @returns {boolean}
+ * @returns
  *   Whether it matches.
  */
-const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/\s/)
+const micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_unicodeWhitespace = micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(/\s/);
 
 /**
  * Create a code check from a regex.
@@ -30063,7 +30090,7 @@ const micromark_extension_gfm_task_list_item_node_modules_micromark_util_charact
  * @returns {(code: Code) => boolean}
  */
 function micromark_extension_gfm_task_list_item_node_modules_micromark_util_character_regexCheck(regex) {
-  return check
+  return check;
 
   /**
    * Check whether a code matches the bound regex.
@@ -30074,10 +30101,9 @@ function micromark_extension_gfm_task_list_item_node_modules_micromark_util_char
    *   Whether the character code matches the bound regex.
    */
   function check(code) {
-    return code !== null && code > -1 && regex.test(String.fromCharCode(code))
+    return code !== null && code > -1 && regex.test(String.fromCharCode(code));
   }
 }
-
 ;// CONCATENATED MODULE: ../node_modules/micromark-extension-gfm-task-list-item/node_modules/micromark-factory-space/index.js
 /**
  * @typedef {import('micromark-util-types').Effects} Effects
@@ -41506,7 +41532,7 @@ function rehypeRaw(options) {
 }
 
 // EXTERNAL MODULE: ../node_modules/@uiw/copy-to-clipboard/dist/copy-to-clipboard.umd.js
-var copy_to_clipboard_umd = __webpack_require__(28);
+var copy_to_clipboard_umd = __webpack_require__(886);
 var copy_to_clipboard_umd_default = /*#__PURE__*/__webpack_require__.n(copy_to_clipboard_umd);
 ;// CONCATENATED MODULE: ../node_modules/@uiw/react-markdown-preview/esm/plugins/useCopied.js
 
@@ -41615,1288 +41641,243 @@ var preview_defaultUrlTransform = url => url;
     }))
   }));
 }));
-;// CONCATENATED MODULE: ../node_modules/rehype-prism-plus/node_modules/unist-util-is/lib/index.js
+;// CONCATENATED MODULE: ../node_modules/hast-util-to-string/lib/index.js
 /**
- * @typedef {import('unist').Node} Node
- * @typedef {import('unist').Parent} Parent
+ * @typedef {import('hast').Nodes} Nodes
+ * @typedef {import('hast').Parents} Parents
  */
 
 /**
- * @typedef {Record<string, unknown>} Props
- * @typedef {null | undefined | string | Props | TestFunctionAnything | Array<string | Props | TestFunctionAnything>} Test
- *   Check for an arbitrary node, unaware of TypeScript inferral.
+ * Get the plain-text value of a hast node.
  *
- * @callback TestFunctionAnything
- *   Check if a node passes a test, unaware of TypeScript inferral.
- * @param {unknown} this
- *   The given context.
- * @param {Node} node
- *   A node.
- * @param {number | null | undefined} [index]
- *   The node’s position in its parent.
- * @param {Parent | null | undefined} [parent]
- *   The node’s parent.
- * @returns {boolean | void}
- *   Whether this node passes the test.
+ * @param {Nodes} node
+ *   Node to serialize.
+ * @returns {string}
+ *   Serialized node.
  */
+function hast_util_to_string_lib_toString(node) {
+  // “The concatenation of data of all the Text node descendants of the context
+  // object, in tree order.”
+  if ('children' in node) {
+    return hast_util_to_string_lib_all(node)
+  }
 
-/**
- * @template {Node} Kind
- *   Node type.
- * @typedef {Kind['type'] | Partial<Kind> | TestFunctionPredicate<Kind> | Array<Kind['type'] | Partial<Kind> | TestFunctionPredicate<Kind>>} PredicateTest
- *   Check for a node that can be inferred by TypeScript.
- */
+  // “Context object’s data.”
+  return 'value' in node ? node.value : ''
+}
 
 /**
- * Check if a node passes a certain test.
- *
- * @template {Node} Kind
- *   Node type.
- * @callback TestFunctionPredicate
- *   Complex test function for a node that can be inferred by TypeScript.
- * @param {Node} node
- *   A node.
- * @param {number | null | undefined} [index]
- *   The node’s position in its parent.
- * @param {Parent | null | undefined} [parent]
- *   The node’s parent.
- * @returns {node is Kind}
- *   Whether this node passes the test.
+ * @param {Nodes} node
+ *   Node.
+ * @returns {string}
+ *   Serialized node.
  */
+function hast_util_to_string_lib_one(node) {
+  if (node.type === 'text') {
+    return node.value
+  }
+
+  return 'children' in node ? hast_util_to_string_lib_all(node) : ''
+}
 
 /**
- * @callback AssertAnything
- *   Check that an arbitrary value is a node, unaware of TypeScript inferral.
- * @param {unknown} [node]
- *   Anything (typically a node).
- * @param {number | null | undefined} [index]
- *   The node’s position in its parent.
- * @param {Parent | null | undefined} [parent]
- *   The node’s parent.
- * @returns {boolean}
- *   Whether this is a node and passes a test.
+ * @param {Parents} node
+ *   Node.
+ * @returns {string}
+ *   Serialized node.
  */
+function hast_util_to_string_lib_all(node) {
+  let index = -1
+  /** @type {Array<string>} */
+  const result = []
+
+  while (++index < node.children.length) {
+    result[index] = hast_util_to_string_lib_one(node.children[index])
+  }
+
+  return result.join('')
+}
 
+;// CONCATENATED MODULE: ../node_modules/unist-util-filter/lib/index.js
 /**
- * Check if a node is a node and passes a certain node test.
+ * @typedef {import('unist').Node} Node
+ * @typedef {import('unist').Parent} Parent
  *
- * @template {Node} Kind
- *   Node type.
- * @callback AssertPredicate
- *   Check that an arbitrary value is a specific node, aware of TypeScript.
- * @param {unknown} [node]
- *   Anything (typically a node).
- * @param {number | null | undefined} [index]
- *   The node’s position in its parent.
- * @param {Parent | null | undefined} [parent]
- *   The node’s parent.
- * @returns {node is Kind}
- *   Whether this is a node and passes a test.
+ * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test
+ *   Test from `unist-util-is`.
+ *
+ *   Note: we have remove and add `undefined`, because otherwise when generating
+ *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,
+ *   which doesn’t work when publishing on npm.
  */
 
 /**
- * Check if `node` is a `Node` and whether it passes the given test.
- *
- * @param node
- *   Thing to check, typically `Node`.
- * @param test
- *   A check for a specific node.
- * @param index
- *   The node’s position in its parent.
- * @param parent
- *   The node’s parent.
- * @returns
- *   Whether `node` is a node and passes a test.
+ * @typedef Options
+ *   Configuration (optional).
+ * @property {boolean | null | undefined} [cascade=true]
+ *   Whether to drop parent nodes if they had children, but all their children
+ *   were filtered out (default: `true`).
  */
-const lib_is =
-  /**
-   * @type {(
-   *   (() => false) &
-   *   (<Kind extends Node = Node>(node: unknown, test: PredicateTest<Kind>, index: number, parent: Parent, context?: unknown) => node is Kind) &
-   *   (<Kind extends Node = Node>(node: unknown, test: PredicateTest<Kind>, index?: null | undefined, parent?: null | undefined, context?: unknown) => node is Kind) &
-   *   ((node: unknown, test: Test, index: number, parent: Parent, context?: unknown) => boolean) &
-   *   ((node: unknown, test?: Test, index?: null | undefined, parent?: null | undefined, context?: unknown) => boolean)
-   * )}
-   */
-  (
-    /**
-     * @param {unknown} [node]
-     * @param {Test} [test]
-     * @param {number | null | undefined} [index]
-     * @param {Parent | null | undefined} [parent]
-     * @param {unknown} [context]
-     * @returns {boolean}
-     */
-    // eslint-disable-next-line max-params
-    function is(node, test, index, parent, context) {
-      const check = lib_convert(test)
-
-      if (
-        index !== undefined &&
-        index !== null &&
-        (typeof index !== 'number' ||
-          index < 0 ||
-          index === Number.POSITIVE_INFINITY)
-      ) {
-        throw new Error('Expected positive finite index')
-      }
 
-      if (
-        parent !== undefined &&
-        parent !== null &&
-        (!is(parent) || !parent.children)
-      ) {
-        throw new Error('Expected parent node')
-      }
 
-      if (
-        (parent === undefined || parent === null) !==
-        (index === undefined || index === null)
-      ) {
-        throw new Error('Expected both parent and index')
-      }
 
-      // @ts-expect-error Looks like a node.
-      return node && node.type && typeof node.type === 'string'
-        ? Boolean(check.call(context, node, index, parent))
-        : false
-    }
-  )
+const unist_util_filter_lib_own = {}.hasOwnProperty
 
 /**
- * Generate an assertion from a test.
+ * Create a new `tree` of copies of all nodes that pass `test`.
  *
- * Useful if you’re going to test many nodes, for example when creating a
- * utility where something else passes a compatible test.
+ * The tree is walked in *preorder* (NLR), visiting the node itself, then its
+ * head, etc.
  *
- * The created function is a bit faster because it expects valid input only:
- * a `node`, `index`, and `parent`.
+ * @template {Node} Tree
+ * @template {Test} Check
  *
- * @param test
- *   *   when nullish, checks if `node` is a `Node`.
- *   *   when `string`, works like passing `(node) => node.type === test`.
- *   *   when `function` checks if function passed the node is true.
- *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.
- *   *   when `array`, checks if any one of the subtests pass.
- * @returns
- *   An assertion.
+ * @overload
+ * @param {Tree} tree
+ * @param {Options | null | undefined} options
+ * @param {Check} test
+ * @returns {import('./complex-types.js').Matches<Tree, Check>}
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {Check} test
+ * @returns {import('./complex-types.js').Matches<Tree, Check>}
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {null | undefined} [options]
+ * @returns {Tree}
+ *
+ * @param {Node} tree
+ *   Tree to filter.
+ * @param {Options | Test} [options]
+ *   Configuration (optional).
+ * @param {Test} [test]
+ *   `unist-util-is` compatible test.
+ * @returns {Node | undefined}
+ *   New filtered tree.
+ *
+ *   `undefined` is returned if `tree` itself didn’t pass the test, or is
+ *   cascaded away.
  */
-const lib_convert =
-  /**
-   * @type {(
-   *   (<Kind extends Node>(test: PredicateTest<Kind>) => AssertPredicate<Kind>) &
-   *   ((test?: Test) => AssertAnything)
-   * )}
-   */
-  (
-    /**
-     * @param {Test} [test]
-     * @returns {AssertAnything}
-     */
-    function (test) {
-      if (test === undefined || test === null) {
-        return unist_util_is_lib_ok
-      }
-
-      if (typeof test === 'string') {
-        return lib_typeFactory(test)
-      }
-
-      if (typeof test === 'object') {
-        return Array.isArray(test) ? lib_anyFactory(test) : lib_propsFactory(test)
-      }
+function filter(tree, options, test) {
+  const is = convert(test || options)
+  const cascadeRaw =
+    options && typeof options === 'object' && 'cascade' in options
+      ? /** @type {boolean | null | undefined} */ (options.cascade)
+      : undefined
+  const cascade =
+    cascadeRaw === undefined || cascadeRaw === null ? true : cascadeRaw
 
-      if (typeof test === 'function') {
-        return lib_castFactory(test)
-      }
+  return preorder(tree)
 
-      throw new Error('Expected function, string, or object as test')
-    }
-  )
+  /**
+   * @param {Node} node
+   *   Current node.
+   * @param {number | undefined} [index]
+   *   Index of `node` in `parent`.
+   * @param {Parent | undefined} [parentNode]
+   *   Parent node.
+   * @returns {Node | undefined}
+   *   Shallow copy of `node`.
+   */
+  function preorder(node, index, parentNode) {
+    /** @type {Array<Node>} */
+    const children = []
 
-/**
- * @param {Array<string | Props | TestFunctionAnything>} tests
- * @returns {AssertAnything}
- */
-function lib_anyFactory(tests) {
-  /** @type {Array<AssertAnything>} */
-  const checks = []
-  let index = -1
+    if (!is(node, index, parentNode)) return undefined
 
-  while (++index < tests.length) {
-    checks[index] = lib_convert(tests[index])
-  }
+    if (lib_parent(node)) {
+      let childIndex = -1
 
-  return lib_castFactory(any)
+      while (++childIndex < node.children.length) {
+        const result = preorder(node.children[childIndex], childIndex, node)
 
-  /**
-   * @this {unknown}
-   * @param {Array<unknown>} parameters
-   * @returns {boolean}
-   */
-  function any(...parameters) {
-    let index = -1
+        if (result) {
+          children.push(result)
+        }
+      }
 
-    while (++index < checks.length) {
-      if (checks[index].call(this, ...parameters)) return true
+      if (cascade && node.children.length > 0 && children.length === 0) {
+        return undefined
+      }
     }
 
-    return false
-  }
-}
-
-/**
- * Turn an object into a test for a node with a certain fields.
- *
- * @param {Props} check
- * @returns {AssertAnything}
- */
-function lib_propsFactory(check) {
-  return lib_castFactory(all)
-
-  /**
-   * @param {Node} node
-   * @returns {boolean}
-   */
-  function all(node) {
+    // Create a shallow clone, using the new children.
+    /** @type {typeof node} */
+    // @ts-expect-error all the fields will be copied over.
+    const next = {}
     /** @type {string} */
     let key
 
-    for (key in check) {
-      // @ts-expect-error: hush, it sure works as an index.
-      if (node[key] !== check[key]) return false
+    for (key in node) {
+      if (unist_util_filter_lib_own.call(node, key)) {
+        // @ts-expect-error: Looks like a record.
+        next[key] = key === 'children' ? children : node[key]
+      }
     }
 
-    return true
+    return next
   }
 }
 
 /**
- * Turn a string into a test for a node with a certain type.
- *
- * @param {string} check
- * @returns {AssertAnything}
+ * @param {Node} node
+ * @returns {node is Parent}
  */
-function lib_typeFactory(check) {
-  return lib_castFactory(type)
-
-  /**
-   * @param {Node} node
-   */
-  function type(node) {
-    return node && node.type === check
-  }
+function lib_parent(node) {
+  return 'children' in node && node.children !== undefined
 }
 
-/**
- * Turn a custom test into a test for a node that passes that test.
- *
- * @param {TestFunctionAnything} check
- * @returns {AssertAnything}
- */
-function lib_castFactory(check) {
-  return assertion
+// EXTERNAL MODULE: ../node_modules/parse-numeric-range/index.js
+var parse_numeric_range = __webpack_require__(934);
+;// CONCATENATED MODULE: ../node_modules/refractor/lang/clike.js
+// @ts-nocheck
+clike.displayName = 'clike'
+clike.aliases = []
 
-  /**
-   * @this {unknown}
-   * @param {unknown} node
-   * @param {Array<unknown>} parameters
-   * @returns {boolean}
-   */
-  function assertion(node, ...parameters) {
-    return Boolean(
-      node &&
-        typeof node === 'object' &&
-        'type' in node &&
-        // @ts-expect-error: fine.
-        Boolean(check.call(this, node, ...parameters))
-    )
+/** @type {import('../core.js').Syntax} */
+function clike(Prism) {
+  Prism.languages.clike = {
+    comment: [
+      {
+        pattern: /(^|[^\\])\/\*[\s\S]*?(?:\*\/|$)/,
+        lookbehind: true,
+        greedy: true
+      },
+      {
+        pattern: /(^|[^\\:])\/\/.*/,
+        lookbehind: true,
+        greedy: true
+      }
+    ],
+    string: {
+      pattern: /(["'])(?:\\(?:\r\n|[\s\S])|(?!\1)[^\\\r\n])*\1/,
+      greedy: true
+    },
+    'class-name': {
+      pattern:
+        /(\b(?:class|extends|implements|instanceof|interface|new|trait)\s+|\bcatch\s+\()[\w.\\]+/i,
+      lookbehind: true,
+      inside: {
+        punctuation: /[.\\]/
+      }
+    },
+    keyword:
+      /\b(?:break|catch|continue|do|else|finally|for|function|if|in|instanceof|new|null|return|throw|try|while)\b/,
+    boolean: /\b(?:false|true)\b/,
+    function: /\b\w+(?=\()/,
+    number: /\b0x[\da-f]+\b|(?:\b\d+(?:\.\d*)?|\B\.\d+)(?:e[+-]?\d+)?/i,
+    operator: /[<>]=?|[!=]=?=?|--?|\+\+?|&&?|\|\|?|[?*/~^%]/,
+    punctuation: /[{}[\];(),.:]/
   }
 }
 
-function unist_util_is_lib_ok() {
-  return true
-}
-
-;// CONCATENATED MODULE: ../node_modules/rehype-prism-plus/node_modules/unist-util-visit-parents/lib/color.browser.js
-/**
- * @param {string} d
- * @returns {string}
- */
-function color_browser_color(d) {
-  return d
-}
-
-;// CONCATENATED MODULE: ../node_modules/rehype-prism-plus/node_modules/unist-util-visit-parents/lib/index.js
-/**
- * @typedef {import('unist').Node} Node
- * @typedef {import('unist').Parent} Parent
- * @typedef {import('unist-util-is').Test} Test
- */
-
-/**
- * @typedef {boolean | 'skip'} Action
- *   Union of the action types.
- *
- * @typedef {number} Index
- *   Move to the sibling at `index` next (after node itself is completely
- *   traversed).
- *
- *   Useful if mutating the tree, such as removing the node the visitor is
- *   currently on, or any of its previous siblings.
- *   Results less than 0 or greater than or equal to `children.length` stop
- *   traversing the parent.
- *
- * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple
- *   List with one or two values, the first an action, the second an index.
- *
- * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult
- *   Any value that can be returned from a visitor.
- */
-
-/**
- * @template {Node} [Visited=Node]
- *   Visited node type.
- * @template {Parent} [Ancestor=Parent]
- *   Ancestor type.
- * @callback Visitor
- *   Handle a node (matching `test`, if given).
- *
- *   Visitors are free to transform `node`.
- *   They can also transform the parent of node (the last of `ancestors`).
- *
- *   Replacing `node` itself, if `SKIP` is not returned, still causes its
- *   descendants to be walked (which is a bug).
- *
- *   When adding or removing previous siblings of `node` (or next siblings, in
- *   case of reverse), the `Visitor` should return a new `Index` to specify the
- *   sibling to traverse after `node` is traversed.
- *   Adding or removing next siblings of `node` (or previous siblings, in case
- *   of reverse) is handled as expected without needing to return a new `Index`.
- *
- *   Removing the children property of an ancestor still results in them being
- *   traversed.
- * @param {Visited} node
- *   Found node.
- * @param {Array<Ancestor>} ancestors
- *   Ancestors of `node`.
- * @returns {VisitorResult}
- *   What to do next.
- *
- *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.
- *   An `Action` is treated as a tuple of `[Action]`.
- *
- *   Passing a tuple back only makes sense if the `Action` is `SKIP`.
- *   When the `Action` is `EXIT`, that action can be returned.
- *   When the `Action` is `CONTINUE`, `Index` can be returned.
- */
-
-/**
- * @template {Node} [Tree=Node]
- *   Tree type.
- * @template {Test} [Check=string]
- *   Test type.
- * @typedef {Visitor<import('./complex-types.js').Matches<import('./complex-types.js').InclusiveDescendant<Tree>, Check>, Extract<import('./complex-types.js').InclusiveDescendant<Tree>, Parent>>} BuildVisitor
- *   Build a typed `Visitor` function from a tree and a test.
- *
- *   It will infer which values are passed as `node` and which as `parents`.
- */
-
-
-
-
-/**
- * Continue traversing as normal.
- */
-const lib_CONTINUE = true
-
-/**
- * Stop traversing immediately.
- */
-const lib_EXIT = false
+;// CONCATENATED MODULE: ../node_modules/refractor/lang/c.js
+// @ts-nocheck
 
-/**
- * Do not traverse this node’s children.
- */
-const lib_SKIP = 'skip'
-
-/**
- * Visit nodes, with ancestral information.
- *
- * This algorithm performs *depth-first* *tree traversal* in *preorder*
- * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).
- *
- * You can choose for which nodes `visitor` is called by passing a `test`.
- * For complex tests, you should test yourself in `visitor`, as it will be
- * faster and will have improved type information.
- *
- * Walking the tree is an intensive task.
- * Make use of the return values of the visitor when possible.
- * Instead of walking a tree multiple times, walk it once, use `unist-util-is`
- * to check if a node matches, and then perform different operations.
- *
- * You can change the tree.
- * See `Visitor` for more info.
- *
- * @param tree
- *   Tree to traverse.
- * @param test
- *   `unist-util-is`-compatible test
- * @param visitor
- *   Handle each node.
- * @param reverse
- *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).
- * @returns
- *   Nothing.
- */
-const lib_visitParents =
-  /**
-   * @type {(
-   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &
-   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)
-   * )}
-   */
-  (
-    /**
-     * @param {Node} tree
-     * @param {Test} test
-     * @param {Visitor<Node>} visitor
-     * @param {boolean | null | undefined} [reverse]
-     * @returns {void}
-     */
-    function (tree, test, visitor, reverse) {
-      if (typeof test === 'function' && typeof visitor !== 'function') {
-        reverse = visitor
-        // @ts-expect-error no visitor given, so `visitor` is test.
-        visitor = test
-        test = null
-      }
-
-      const is = lib_convert(test)
-      const step = reverse ? -1 : 1
-
-      factory(tree, undefined, [])()
-
-      /**
-       * @param {Node} node
-       * @param {number | undefined} index
-       * @param {Array<Parent>} parents
-       */
-      function factory(node, index, parents) {
-        /** @type {Record<string, unknown>} */
-        // @ts-expect-error: hush
-        const value = node && typeof node === 'object' ? node : {}
-
-        if (typeof value.type === 'string') {
-          const name =
-            // `hast`
-            typeof value.tagName === 'string'
-              ? value.tagName
-              : // `xast`
-              typeof value.name === 'string'
-              ? value.name
-              : undefined
-
-          Object.defineProperty(visit, 'name', {
-            value:
-              'node (' + color_browser_color(node.type + (name ? '<' + name + '>' : '')) + ')'
-          })
-        }
-
-        return visit
-
-        function visit() {
-          /** @type {ActionTuple} */
-          let result = []
-          /** @type {ActionTuple} */
-          let subresult
-          /** @type {number} */
-          let offset
-          /** @type {Array<Parent>} */
-          let grandparents
-
-          if (!test || is(node, index, parents[parents.length - 1] || null)) {
-            result = lib_toResult(visitor(node, parents))
-
-            if (result[0] === lib_EXIT) {
-              return result
-            }
-          }
-
-          // @ts-expect-error looks like a parent.
-          if (node.children && result[0] !== lib_SKIP) {
-            // @ts-expect-error looks like a parent.
-            offset = (reverse ? node.children.length : -1) + step
-            // @ts-expect-error looks like a parent.
-            grandparents = parents.concat(node)
-
-            // @ts-expect-error looks like a parent.
-            while (offset > -1 && offset < node.children.length) {
-              // @ts-expect-error looks like a parent.
-              subresult = factory(node.children[offset], offset, grandparents)()
-
-              if (subresult[0] === lib_EXIT) {
-                return subresult
-              }
-
-              offset =
-                typeof subresult[1] === 'number' ? subresult[1] : offset + step
-            }
-          }
-
-          return result
-        }
-      }
-    }
-  )
-
-/**
- * Turn a return value into a clean result.
- *
- * @param {VisitorResult} value
- *   Valid return values from visitors.
- * @returns {ActionTuple}
- *   Clean result.
- */
-function lib_toResult(value) {
-  if (Array.isArray(value)) {
-    return value
-  }
-
-  if (typeof value === 'number') {
-    return [lib_CONTINUE, value]
-  }
-
-  return [value]
-}
-
-;// CONCATENATED MODULE: ../node_modules/rehype-prism-plus/node_modules/unist-util-visit/lib/index.js
-/**
- * @typedef {import('unist').Node} Node
- * @typedef {import('unist').Parent} Parent
- * @typedef {import('unist-util-is').Test} Test
- * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult
- */
-
-/**
- * Check if `Child` can be a child of `Ancestor`.
- *
- * Returns the ancestor when `Child` can be a child of `Ancestor`, or returns
- * `never`.
- *
- * @template {Node} Ancestor
- *   Node type.
- * @template {Node} Child
- *   Node type.
- * @typedef {(
- *   Ancestor extends Parent
- *     ? Child extends Ancestor['children'][number]
- *       ? Ancestor
- *       : never
- *     : never
- * )} ParentsOf
- */
-
-/**
- * @template {Node} [Visited=Node]
- *   Visited node type.
- * @template {Parent} [Ancestor=Parent]
- *   Ancestor type.
- * @callback Visitor
- *   Handle a node (matching `test`, if given).
- *
- *   Visitors are free to transform `node`.
- *   They can also transform `parent`.
- *
- *   Replacing `node` itself, if `SKIP` is not returned, still causes its
- *   descendants to be walked (which is a bug).
- *
- *   When adding or removing previous siblings of `node` (or next siblings, in
- *   case of reverse), the `Visitor` should return a new `Index` to specify the
- *   sibling to traverse after `node` is traversed.
- *   Adding or removing next siblings of `node` (or previous siblings, in case
- *   of reverse) is handled as expected without needing to return a new `Index`.
- *
- *   Removing the children property of `parent` still results in them being
- *   traversed.
- * @param {Visited} node
- *   Found node.
- * @param {Visited extends Node ? number | null : never} index
- *   Index of `node` in `parent`.
- * @param {Ancestor extends Node ? Ancestor | null : never} parent
- *   Parent of `node`.
- * @returns {VisitorResult}
- *   What to do next.
- *
- *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.
- *   An `Action` is treated as a tuple of `[Action]`.
- *
- *   Passing a tuple back only makes sense if the `Action` is `SKIP`.
- *   When the `Action` is `EXIT`, that action can be returned.
- *   When the `Action` is `CONTINUE`, `Index` can be returned.
- */
-
-/**
- * Build a typed `Visitor` function from a node and all possible parents.
- *
- * It will infer which values are passed as `node` and which as `parent`.
- *
- * @template {Node} Visited
- *   Node type.
- * @template {Parent} Ancestor
- *   Parent type.
- * @typedef {Visitor<Visited, ParentsOf<Ancestor, Visited>>} BuildVisitorFromMatch
- */
-
-/**
- * Build a typed `Visitor` function from a list of descendants and a test.
- *
- * It will infer which values are passed as `node` and which as `parent`.
- *
- * @template {Node} Descendant
- *   Node type.
- * @template {Test} Check
- *   Test type.
- * @typedef {(
- *   BuildVisitorFromMatch<
- *     import('unist-util-visit-parents/complex-types.js').Matches<Descendant, Check>,
- *     Extract<Descendant, Parent>
- *   >
- * )} BuildVisitorFromDescendants
- */
-
-/**
- * Build a typed `Visitor` function from a tree and a test.
- *
- * It will infer which values are passed as `node` and which as `parent`.
- *
- * @template {Node} [Tree=Node]
- *   Node type.
- * @template {Test} [Check=string]
- *   Test type.
- * @typedef {(
- *   BuildVisitorFromDescendants<
- *     import('unist-util-visit-parents/complex-types.js').InclusiveDescendant<Tree>,
- *     Check
- *   >
- * )} BuildVisitor
- */
-
-
-
-/**
- * Visit nodes.
- *
- * This algorithm performs *depth-first* *tree traversal* in *preorder*
- * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).
- *
- * You can choose for which nodes `visitor` is called by passing a `test`.
- * For complex tests, you should test yourself in `visitor`, as it will be
- * faster and will have improved type information.
- *
- * Walking the tree is an intensive task.
- * Make use of the return values of the visitor when possible.
- * Instead of walking a tree multiple times, walk it once, use `unist-util-is`
- * to check if a node matches, and then perform different operations.
- *
- * You can change the tree.
- * See `Visitor` for more info.
- *
- * @param tree
- *   Tree to traverse.
- * @param test
- *   `unist-util-is`-compatible test
- * @param visitor
- *   Handle each node.
- * @param reverse
- *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).
- * @returns
- *   Nothing.
- */
-const lib_visit =
-  /**
-   * @type {(
-   *   (<Tree extends Node, Check extends Test>(tree: Tree, test: Check, visitor: BuildVisitor<Tree, Check>, reverse?: boolean | null | undefined) => void) &
-   *   (<Tree extends Node>(tree: Tree, visitor: BuildVisitor<Tree>, reverse?: boolean | null | undefined) => void)
-   * )}
-   */
-  (
-    /**
-     * @param {Node} tree
-     * @param {Test} test
-     * @param {Visitor} visitor
-     * @param {boolean | null | undefined} [reverse]
-     * @returns {void}
-     */
-    function (tree, test, visitor, reverse) {
-      if (typeof test === 'function' && typeof visitor !== 'function') {
-        reverse = visitor
-        visitor = test
-        test = null
-      }
-
-      lib_visitParents(tree, test, overload, reverse)
-
-      /**
-       * @param {Node} node
-       * @param {Array<Parent>} parents
-       */
-      function overload(node, parents) {
-        const parent = parents[parents.length - 1]
-        return visitor(
-          node,
-          parent ? parent.children.indexOf(node) : null,
-          parent
-        )
-      }
-    }
-  )
-
-
-
-;// CONCATENATED MODULE: ../node_modules/rehype-prism-plus/node_modules/hast-util-to-string/index.js
-/**
- * @fileoverview
- *   Get the plain-text value of a hast node.
- * @longdescription
- *   ## Use
- *
- *   ```js
- *   import {h} from 'hastscript'
- *   import {toString} from 'hast-util-to-string'
- *
- *   toString(h('p', 'Alpha'))
- *   //=> 'Alpha'
- *   toString(h('div', [h('b', 'Bold'), ' and ', h('i', 'italic'), '.']))
- *   //=> 'Bold and italic.'
- *   ```
- *
- *   ## API
- *
- *   ### `toString(node)`
- *
- *   Transform a node to a string.
- */
-
-/**
- * @typedef {import('hast').Root} Root
- * @typedef {import('hast').Element} Element
- * @typedef {Root|Root['children'][number]} Node
- */
-
-/**
- * Get the plain-text value of a hast node.
- *
- * @param {Node} node
- * @returns {string}
- */
-function hast_util_to_string_toString(node) {
-  // “The concatenation of data of all the Text node descendants of the context
-  // object, in tree order.”
-  if ('children' in node) {
-    return hast_util_to_string_all(node)
-  }
-
-  // “Context object’s data.”
-  return 'value' in node ? node.value : ''
-}
-
-/**
- * @param {Node} node
- * @returns {string}
- */
-function hast_util_to_string_one(node) {
-  if (node.type === 'text') {
-    return node.value
-  }
-
-  return 'children' in node ? hast_util_to_string_all(node) : ''
-}
-
-/**
- * @param {Root|Element} node
- * @returns {string}
- */
-function hast_util_to_string_all(node) {
-  let index = -1
-  /** @type {string[]} */
-  const result = []
-
-  while (++index < node.children.length) {
-    result[index] = hast_util_to_string_one(node.children[index])
-  }
-
-  return result.join('')
-}
-
-;// CONCATENATED MODULE: ../node_modules/unist-util-filter/node_modules/unist-util-is/lib/index.js
-/**
- * @typedef {import('unist').Node} Node
- * @typedef {import('unist').Parent} Parent
- */
-
-/**
- * @typedef {Record<string, unknown>} Props
- * @typedef {null | undefined | string | Props | TestFunctionAnything | Array<string | Props | TestFunctionAnything>} Test
- *   Check for an arbitrary node, unaware of TypeScript inferral.
- *
- * @callback TestFunctionAnything
- *   Check if a node passes a test, unaware of TypeScript inferral.
- * @param {unknown} this
- *   The given context.
- * @param {Node} node
- *   A node.
- * @param {number | null | undefined} [index]
- *   The node’s position in its parent.
- * @param {Parent | null | undefined} [parent]
- *   The node’s parent.
- * @returns {boolean | void}
- *   Whether this node passes the test.
- */
-
-/**
- * @template {Node} Kind
- *   Node type.
- * @typedef {Kind['type'] | Partial<Kind> | TestFunctionPredicate<Kind> | Array<Kind['type'] | Partial<Kind> | TestFunctionPredicate<Kind>>} PredicateTest
- *   Check for a node that can be inferred by TypeScript.
- */
-
-/**
- * Check if a node passes a certain test.
- *
- * @template {Node} Kind
- *   Node type.
- * @callback TestFunctionPredicate
- *   Complex test function for a node that can be inferred by TypeScript.
- * @param {Node} node
- *   A node.
- * @param {number | null | undefined} [index]
- *   The node’s position in its parent.
- * @param {Parent | null | undefined} [parent]
- *   The node’s parent.
- * @returns {node is Kind}
- *   Whether this node passes the test.
- */
-
-/**
- * @callback AssertAnything
- *   Check that an arbitrary value is a node, unaware of TypeScript inferral.
- * @param {unknown} [node]
- *   Anything (typically a node).
- * @param {number | null | undefined} [index]
- *   The node’s position in its parent.
- * @param {Parent | null | undefined} [parent]
- *   The node’s parent.
- * @returns {boolean}
- *   Whether this is a node and passes a test.
- */
-
-/**
- * Check if a node is a node and passes a certain node test.
- *
- * @template {Node} Kind
- *   Node type.
- * @callback AssertPredicate
- *   Check that an arbitrary value is a specific node, aware of TypeScript.
- * @param {unknown} [node]
- *   Anything (typically a node).
- * @param {number | null | undefined} [index]
- *   The node’s position in its parent.
- * @param {Parent | null | undefined} [parent]
- *   The node’s parent.
- * @returns {node is Kind}
- *   Whether this is a node and passes a test.
- */
-
-/**
- * Check if `node` is a `Node` and whether it passes the given test.
- *
- * @param node
- *   Thing to check, typically `Node`.
- * @param test
- *   A check for a specific node.
- * @param index
- *   The node’s position in its parent.
- * @param parent
- *   The node’s parent.
- * @returns
- *   Whether `node` is a node and passes a test.
- */
-const unist_util_is_lib_is =
-  /**
-   * @type {(
-   *   (() => false) &
-   *   (<Kind extends Node = Node>(node: unknown, test: PredicateTest<Kind>, index: number, parent: Parent, context?: unknown) => node is Kind) &
-   *   (<Kind extends Node = Node>(node: unknown, test: PredicateTest<Kind>, index?: null | undefined, parent?: null | undefined, context?: unknown) => node is Kind) &
-   *   ((node: unknown, test: Test, index: number, parent: Parent, context?: unknown) => boolean) &
-   *   ((node: unknown, test?: Test, index?: null | undefined, parent?: null | undefined, context?: unknown) => boolean)
-   * )}
-   */
-  (
-    /**
-     * @param {unknown} [node]
-     * @param {Test} [test]
-     * @param {number | null | undefined} [index]
-     * @param {Parent | null | undefined} [parent]
-     * @param {unknown} [context]
-     * @returns {boolean}
-     */
-    // eslint-disable-next-line max-params
-    function is(node, test, index, parent, context) {
-      const check = unist_util_is_lib_convert(test)
-
-      if (
-        index !== undefined &&
-        index !== null &&
-        (typeof index !== 'number' ||
-          index < 0 ||
-          index === Number.POSITIVE_INFINITY)
-      ) {
-        throw new Error('Expected positive finite index')
-      }
-
-      if (
-        parent !== undefined &&
-        parent !== null &&
-        (!is(parent) || !parent.children)
-      ) {
-        throw new Error('Expected parent node')
-      }
-
-      if (
-        (parent === undefined || parent === null) !==
-        (index === undefined || index === null)
-      ) {
-        throw new Error('Expected both parent and index')
-      }
-
-      // @ts-expect-error Looks like a node.
-      return node && node.type && typeof node.type === 'string'
-        ? Boolean(check.call(context, node, index, parent))
-        : false
-    }
-  )
-
-/**
- * Generate an assertion from a test.
- *
- * Useful if you’re going to test many nodes, for example when creating a
- * utility where something else passes a compatible test.
- *
- * The created function is a bit faster because it expects valid input only:
- * a `node`, `index`, and `parent`.
- *
- * @param test
- *   *   when nullish, checks if `node` is a `Node`.
- *   *   when `string`, works like passing `(node) => node.type === test`.
- *   *   when `function` checks if function passed the node is true.
- *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.
- *   *   when `array`, checks if any one of the subtests pass.
- * @returns
- *   An assertion.
- */
-const unist_util_is_lib_convert =
-  /**
-   * @type {(
-   *   (<Kind extends Node>(test: PredicateTest<Kind>) => AssertPredicate<Kind>) &
-   *   ((test?: Test) => AssertAnything)
-   * )}
-   */
-  (
-    /**
-     * @param {Test} [test]
-     * @returns {AssertAnything}
-     */
-    function (test) {
-      if (test === undefined || test === null) {
-        return node_modules_unist_util_is_lib_ok
-      }
-
-      if (typeof test === 'string') {
-        return unist_util_is_lib_typeFactory(test)
-      }
-
-      if (typeof test === 'object') {
-        return Array.isArray(test) ? unist_util_is_lib_anyFactory(test) : unist_util_is_lib_propsFactory(test)
-      }
-
-      if (typeof test === 'function') {
-        return unist_util_is_lib_castFactory(test)
-      }
-
-      throw new Error('Expected function, string, or object as test')
-    }
-  )
-
-/**
- * @param {Array<string | Props | TestFunctionAnything>} tests
- * @returns {AssertAnything}
- */
-function unist_util_is_lib_anyFactory(tests) {
-  /** @type {Array<AssertAnything>} */
-  const checks = []
-  let index = -1
-
-  while (++index < tests.length) {
-    checks[index] = unist_util_is_lib_convert(tests[index])
-  }
-
-  return unist_util_is_lib_castFactory(any)
-
-  /**
-   * @this {unknown}
-   * @param {Array<unknown>} parameters
-   * @returns {boolean}
-   */
-  function any(...parameters) {
-    let index = -1
-
-    while (++index < checks.length) {
-      if (checks[index].call(this, ...parameters)) return true
-    }
-
-    return false
-  }
-}
-
-/**
- * Turn an object into a test for a node with a certain fields.
- *
- * @param {Props} check
- * @returns {AssertAnything}
- */
-function unist_util_is_lib_propsFactory(check) {
-  return unist_util_is_lib_castFactory(all)
-
-  /**
-   * @param {Node} node
-   * @returns {boolean}
-   */
-  function all(node) {
-    /** @type {string} */
-    let key
-
-    for (key in check) {
-      // @ts-expect-error: hush, it sure works as an index.
-      if (node[key] !== check[key]) return false
-    }
-
-    return true
-  }
-}
-
-/**
- * Turn a string into a test for a node with a certain type.
- *
- * @param {string} check
- * @returns {AssertAnything}
- */
-function unist_util_is_lib_typeFactory(check) {
-  return unist_util_is_lib_castFactory(type)
-
-  /**
-   * @param {Node} node
-   */
-  function type(node) {
-    return node && node.type === check
-  }
-}
-
-/**
- * Turn a custom test into a test for a node that passes that test.
- *
- * @param {TestFunctionAnything} check
- * @returns {AssertAnything}
- */
-function unist_util_is_lib_castFactory(check) {
-  return assertion
-
-  /**
-   * @this {unknown}
-   * @param {unknown} node
-   * @param {Array<unknown>} parameters
-   * @returns {boolean}
-   */
-  function assertion(node, ...parameters) {
-    return Boolean(
-      node &&
-        typeof node === 'object' &&
-        'type' in node &&
-        // @ts-expect-error: fine.
-        Boolean(check.call(this, node, ...parameters))
-    )
-  }
-}
-
-function node_modules_unist_util_is_lib_ok() {
-  return true
-}
-
-;// CONCATENATED MODULE: ../node_modules/unist-util-filter/lib/index.js
-/**
- * @typedef {import('unist').Node} Node
- * @typedef {import('unist').Parent} Parent
- * @typedef {import('unist-util-is').Test} Test
- *
- * @typedef Options
- *   Configuration (optional).
- * @property {boolean | null | undefined} [cascade=true]
- *   Whether to drop parent nodes if they had children, but all their children
- *   were filtered out.
- */
-
-
-
-const unist_util_filter_lib_own = {}.hasOwnProperty
-
-/**
- * Create a new `tree` of copies of all nodes that pass `test`.
- *
- * The tree is walked in *preorder* (NLR), visiting the node itself, then its
- * head, etc.
- *
- * @param tree
- *   Tree to filter.
- * @param options
- *   Configuration (optional).
- * @param test
- *   `unist-util-is` compatible test.
- * @returns
- *   New filtered tree.
- *
- *   `null` is returned if `tree` itself didn’t pass the test, or is cascaded
- *   away.
- */
-const filter =
-  /**
-   * @type {(
-   *  (<Tree extends Node, Check extends Test>(node: Tree, options: Options | null | undefined, test: Check | null | undefined) => import('./complex-types.js').Matches<Tree, Check>) &
-   *  (<Tree extends Node, Check extends Test>(node: Tree, test: Check) => import('./complex-types.js').Matches<Tree, Check>) &
-   *  (<Tree extends Node>(node: Tree, options?: Options | null | undefined) => Tree)
-   * )}
-   */
-  (
-    /**
-     * @param {Node} tree
-     * @param {Options | Test | null | undefined} [options]
-     * @param {Test | null | undefined} [test]
-     * @returns {Node | null}
-     */
-    function (tree, options, test) {
-      const is = unist_util_is_lib_convert(test || options)
-      /** @type {boolean | null | undefined} */
-      const cascadeRaw =
-        options && typeof options === 'object' && 'cascade' in options
-          ? /** @type {boolean | null | undefined} */ (options.cascade)
-          : undefined
-      const cascade =
-        cascadeRaw === undefined || cascadeRaw === null ? true : cascadeRaw
-
-      return preorder(tree)
-
-      /**
-       * @param {Node} node
-       *   Current node.
-       * @param {number | undefined} [index]
-       *   Index of `node` in `parent`.
-       * @param {Parent | undefined} [parent]
-       *   Parent node.
-       * @returns {Node | null}
-       *   Shallow copy of `node`.
-       */
-      function preorder(node, index, parent) {
-        /** @type {Array<Node>} */
-        const children = []
-
-        if (!is(node, index, parent)) return null
-
-        // @ts-expect-error: Looks like a parent.
-        if (node.children) {
-          let childIndex = -1
-
-          // @ts-expect-error Looks like a parent.
-          while (++childIndex < node.children.length) {
-            // @ts-expect-error Looks like a parent.
-            const result = preorder(node.children[childIndex], childIndex, node)
-
-            if (result) {
-              children.push(result)
-            }
-          }
-
-          // @ts-expect-error Looks like a parent.
-          if (cascade && node.children.length > 0 && children.length === 0)
-            return null
-        }
-
-        // Create a shallow clone, using the new children.
-        /** @type {typeof node} */
-        // @ts-expect-error all the fields will be copied over.
-        const next = {}
-        /** @type {string} */
-        let key
-
-        for (key in node) {
-          if (unist_util_filter_lib_own.call(node, key)) {
-            // @ts-expect-error: Looks like a record.
-            next[key] = key === 'children' ? children : node[key]
-          }
-        }
-
-        return next
-      }
-    }
-  )
-
-// EXTERNAL MODULE: ../node_modules/parse-numeric-range/index.js
-var parse_numeric_range = __webpack_require__(324);
-;// CONCATENATED MODULE: ../node_modules/refractor/lang/clike.js
-// @ts-nocheck
-clike.displayName = 'clike'
-clike.aliases = []
-
-/** @type {import('../core.js').Syntax} */
-function clike(Prism) {
-  Prism.languages.clike = {
-    comment: [
-      {
-        pattern: /(^|[^\\])\/\*[\s\S]*?(?:\*\/|$)/,
-        lookbehind: true,
-        greedy: true
-      },
-      {
-        pattern: /(^|[^\\:])\/\/.*/,
-        lookbehind: true,
-        greedy: true
-      }
-    ],
-    string: {
-      pattern: /(["'])(?:\\(?:\r\n|[\s\S])|(?!\1)[^\\\r\n])*\1/,
-      greedy: true
-    },
-    'class-name': {
-      pattern:
-        /(\b(?:class|extends|implements|instanceof|interface|new|trait)\s+|\bcatch\s+\()[\w.\\]+/i,
-      lookbehind: true,
-      inside: {
-        punctuation: /[.\\]/
-      }
-    },
-    keyword:
-      /\b(?:break|catch|continue|do|else|finally|for|function|if|in|instanceof|new|null|return|throw|try|while)\b/,
-    boolean: /\b(?:false|true)\b/,
-    function: /\b\w+(?=\()/,
-    number: /\b0x[\da-f]+\b|(?:\b\d+(?:\.\d*)?|\B\.\d+)(?:e[+-]?\d+)?/i,
-    operator: /[<>]=?|[!=]=?=?|--?|\+\+?|&&?|\|\|?|[?*/~^%]/,
-    punctuation: /[{}[\];(),.:]/
-  }
-}
-
-;// CONCATENATED MODULE: ../node_modules/refractor/lang/c.js
-// @ts-nocheck
-
-c.displayName = 'c'
-c.aliases = []
+c.displayName = 'c'
+c.aliases = []
 
 /** @type {import('../core.js').Syntax} */
 function c(Prism) {
@@ -70175,7 +69156,7 @@ refractor.register(zig)
 
 
 ;// CONCATENATED MODULE: ../node_modules/rehype-prism-plus/dist/index.es.js
-function a(){a=function(e,r){return new t(e,void 0,r)};var e=RegExp.prototype,r=new WeakMap;function t(e,n,i){var o=new RegExp(e,n);return r.set(o,i||r.get(e)),l(o,t.prototype)}function n(e,t){var n=r.get(t);return Object.keys(n).reduce(function(r,t){var i=n[t];if("number"==typeof i)r[t]=e[i];else{for(var o=0;void 0===e[i[o]]&&o+1<i.length;)o++;r[t]=e[i[o]]}return r},Object.create(null))}return function(e,r){if("function"!=typeof r&&null!==r)throw new TypeError("Super expression must either be null or a function");e.prototype=Object.create(r&&r.prototype,{constructor:{value:e,writable:!0,configurable:!0}}),Object.defineProperty(e,"prototype",{writable:!1}),r&&l(e,r)}(t,RegExp),t.prototype.exec=function(r){var t=e.exec.call(this,r);if(t){t.groups=n(t,this);var i=t.indices;i&&(i.groups=n(i,this))}return t},t.prototype[Symbol.replace]=function(t,i){if("string"==typeof i){var o=r.get(this);return e[Symbol.replace].call(this,t,i.replace(/\$<([^>]+)>/g,function(e,r){var t=o[r];return"$"+(Array.isArray(t)?t.join("$"):t)}))}if("function"==typeof i){var a=this;return e[Symbol.replace].call(this,t,function(){var e=arguments;return"object"!=typeof e[e.length-1]&&(e=[].slice.call(e)).push(n(e,a)),i.apply(this,e)})}return e[Symbol.replace].call(this,t,i)},a.apply(this,arguments)}function l(e,r){return l=Object.setPrototypeOf?Object.setPrototypeOf.bind():function(e,r){return e.__proto__=r,e},l(e,r)}function index_es_s(e,r){(null==r||r>e.length)&&(r=e.length);for(var t=0,n=new Array(r);t<r;t++)n[t]=e[t];return n}function u(e,r){var t="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(t)return(t=t.call(e)).next.bind(t);if(Array.isArray(e)||(t=function(e,r){if(e){if("string"==typeof e)return index_es_s(e,r);var t=Object.prototype.toString.call(e).slice(8,-1);return"Object"===t&&e.constructor&&(t=e.constructor.name),"Map"===t||"Set"===t?Array.from(e):"Arguments"===t||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t)?index_es_s(e,r):void 0}}(e))||r&&e&&"number"==typeof e.length){t&&(e=t);var n=0;return function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var index_es_c=function(i){return function(o){return void 0===o&&(o={}),function(e,r){if(r&&!e.registered(r))throw new Error('The default language "'+r+'" is not registered with refractor.')}(i,o.defaultLanguage),function(r){lib_visit(r,"element",l)};function l(e,l,s){var c,p;if(s&&"pre"===s.tagName&&"code"===e.tagName){var f=(null==e||null==(c=e.data)?void 0:c.meta)||(null==e||null==(p=e.properties)?void 0:p.metastring)||"";e.properties.className?"boolean"==typeof e.properties.className?e.properties.className=[]:Array.isArray(e.properties.className)||(e.properties.className=[e.properties.className]):e.properties.className=[];var m,h,d=function(e){for(var r,t=u(e.properties.className);!(r=t()).done;){var n=r.value;if("language-"===n.slice(0,9))return n.slice(9).toLowerCase()}return null}(e);if(!d&&o.defaultLanguage&&e.properties.className.push("language-"+(d=o.defaultLanguage)),e.properties.className.push("code-highlight"),d)try{var g,v;v=null!=(g=d)&&g.includes("diff-")?d.split("-")[1]:d,m=i.highlight(hast_util_to_string_toString(e),v),s.properties.className=(s.properties.className||[]).concat("language-"+v)}catch(r){if(!o.ignoreMissing||!/Unknown language/.test(r.message))throw r;m=e}else m=e;m.children=(h=1,function e(r){return r.reduce(function(r,t){if("text"===t.type){var n=t.value,i=(n.match(/\n/g)||"").length;if(0===i)t.position={start:{line:h,column:1},end:{line:h,column:1}},r.push(t);else for(var o,a=n.split("\n"),l=u(a.entries());!(o=l()).done;){var s=o.value,c=s[0],p=s[1];r.push({type:"text",value:c===a.length-1?p:p+"\n",position:{start:{line:h+c,column:1},end:{line:h+c,column:1}}})}return h+=i,r}if(Object.prototype.hasOwnProperty.call(t,"children")){var f=h;return t.children=e(t.children),r.push(t),t.position={start:{line:f,column:1},end:{line:h,column:1}},r}return r.push(t),r},[])})(m.children),m.position=m.children.length>0?{start:{line:m.children[0].position.start.line,column:0},end:{line:m.children[m.children.length-1].position.end.line,column:0}}:{start:{line:0,column:0},end:{line:0,column:0}};for(var y,b=function(e){var r=/{([\d,-]+)}/,t=e.split(",").map(function(e){return e.trim()}).join();if(r.test(t)){var i=r.exec(t)[1],o=parse_numeric_range(i);return function(e){return o.includes(e+1)}}return function(){return!1}}(f),w=function(e){var r=/*#__PURE__*/a(/showLineNumbers=(\d+)/i,{lines:1});if(r.test(e)){var t=r.exec(e);return Number(t.groups.lines)}return 1}(f),N=function(e){for(var r=new Array(e),t=0;t<e;t++)r[t]={type:"element",tagName:"span",properties:{className:[]},children:[]};return r}(m.position.end.line),j=["showlinenumbers=false",'showlinenumbers="false"',"showlinenumbers={false}"],x=function(){var e,n,i=y.value,a=i[0],l=i[1];l.properties.className=["code-line"];var s=filter(m,function(e){return e.position.start.line<=a+1&&e.position.end.line>=a+1});l.children=s.children,!f.toLowerCase().includes("showLineNumbers".toLowerCase())&&!o.showLineNumbers||j.some(function(e){return f.toLowerCase().includes(e)})||(l.properties.line=[(a+w).toString()],l.properties.className.push("line-number")),b(a)&&l.properties.className.push("highlight-line"),("diff"===d||null!=(e=d)&&e.includes("diff-"))&&"-"===hast_util_to_string_toString(l).substring(0,1)?l.properties.className.push("deleted"):("diff"===d||null!=(n=d)&&n.includes("diff-"))&&"+"===hast_util_to_string_toString(l).substring(0,1)&&l.properties.className.push("inserted")},O=u(N.entries());!(y=O()).done;)x();N.length>0&&""===hast_util_to_string_toString(N[N.length-1]).trim()&&N.pop(),e.children=N}}}},p=index_es_c(refractor),f=index_es_c(refractor);
+function a(){a=function(e,r){return new t(e,void 0,r)};var e=RegExp.prototype,r=new WeakMap;function t(e,n,i){var o=new RegExp(e,n);return r.set(o,i||r.get(e)),l(o,t.prototype)}function n(e,t){var n=r.get(t);return Object.keys(n).reduce(function(r,t){var i=n[t];if("number"==typeof i)r[t]=e[i];else{for(var o=0;void 0===e[i[o]]&&o+1<i.length;)o++;r[t]=e[i[o]]}return r},Object.create(null))}return function(e,r){if("function"!=typeof r&&null!==r)throw new TypeError("Super expression must either be null or a function");e.prototype=Object.create(r&&r.prototype,{constructor:{value:e,writable:!0,configurable:!0}}),Object.defineProperty(e,"prototype",{writable:!1}),r&&l(e,r)}(t,RegExp),t.prototype.exec=function(r){var t=e.exec.call(this,r);if(t){t.groups=n(t,this);var i=t.indices;i&&(i.groups=n(i,this))}return t},t.prototype[Symbol.replace]=function(t,i){if("string"==typeof i){var o=r.get(this);return e[Symbol.replace].call(this,t,i.replace(/\$<([^>]+)>/g,function(e,r){var t=o[r];return"$"+(Array.isArray(t)?t.join("$"):t)}))}if("function"==typeof i){var a=this;return e[Symbol.replace].call(this,t,function(){var e=arguments;return"object"!=typeof e[e.length-1]&&(e=[].slice.call(e)).push(n(e,a)),i.apply(this,e)})}return e[Symbol.replace].call(this,t,i)},a.apply(this,arguments)}function l(e,r){return l=Object.setPrototypeOf?Object.setPrototypeOf.bind():function(e,r){return e.__proto__=r,e},l(e,r)}function index_es_s(e,r){(null==r||r>e.length)&&(r=e.length);for(var t=0,n=new Array(r);t<r;t++)n[t]=e[t];return n}function u(e,r){var t="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(t)return(t=t.call(e)).next.bind(t);if(Array.isArray(e)||(t=function(e,r){if(e){if("string"==typeof e)return index_es_s(e,r);var t=Object.prototype.toString.call(e).slice(8,-1);return"Object"===t&&e.constructor&&(t=e.constructor.name),"Map"===t||"Set"===t?Array.from(e):"Arguments"===t||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t)?index_es_s(e,r):void 0}}(e))||r&&e&&"number"==typeof e.length){t&&(e=t);var n=0;return function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var index_es_c=function(i){return function(o){return void 0===o&&(o={}),function(e,r){if(r&&!e.registered(r))throw new Error('The default language "'+r+'" is not registered with refractor.')}(i,o.defaultLanguage),function(r){visit(r,"element",l)};function l(e,l,s){var c,p;if(s&&"pre"===s.tagName&&"code"===e.tagName){var f=(null==e||null==(c=e.data)?void 0:c.meta)||(null==e||null==(p=e.properties)?void 0:p.metastring)||"";e.properties.className?"boolean"==typeof e.properties.className?e.properties.className=[]:Array.isArray(e.properties.className)||(e.properties.className=[e.properties.className]):e.properties.className=[];var m,h,d=function(e){for(var r,t=u(e.properties.className);!(r=t()).done;){var n=r.value;if("language-"===n.slice(0,9))return n.slice(9).toLowerCase()}return null}(e);if(!d&&o.defaultLanguage&&e.properties.className.push("language-"+(d=o.defaultLanguage)),e.properties.className.push("code-highlight"),d)try{var g,v;v=null!=(g=d)&&g.includes("diff-")?d.split("-")[1]:d,m=i.highlight(hast_util_to_string_lib_toString(e),v),s.properties.className=(s.properties.className||[]).concat("language-"+v)}catch(r){if(!o.ignoreMissing||!/Unknown language/.test(r.message))throw r;m=e}else m=e;m.children=(h=1,function e(r){return r.reduce(function(r,t){if("text"===t.type){var n=t.value,i=(n.match(/\n/g)||"").length;if(0===i)t.position={start:{line:h,column:1},end:{line:h,column:1}},r.push(t);else for(var o,a=n.split("\n"),l=u(a.entries());!(o=l()).done;){var s=o.value,c=s[0],p=s[1];r.push({type:"text",value:c===a.length-1?p:p+"\n",position:{start:{line:h+c,column:1},end:{line:h+c,column:1}}})}return h+=i,r}if(Object.prototype.hasOwnProperty.call(t,"children")){var f=h;return t.children=e(t.children),r.push(t),t.position={start:{line:f,column:1},end:{line:h,column:1}},r}return r.push(t),r},[])})(m.children),m.position=m.children.length>0?{start:{line:m.children[0].position.start.line,column:0},end:{line:m.children[m.children.length-1].position.end.line,column:0}}:{start:{line:0,column:0},end:{line:0,column:0}};for(var y,b=function(e){var r=/{([\d,-]+)}/,t=e.split(",").map(function(e){return e.trim()}).join();if(r.test(t)){var i=r.exec(t)[1],o=parse_numeric_range(i);return function(e){return o.includes(e+1)}}return function(){return!1}}(f),w=function(e){var r=/*#__PURE__*/a(/showLineNumbers=(\d+)/i,{lines:1});if(r.test(e)){var t=r.exec(e);return Number(t.groups.lines)}return 1}(f),N=function(e){for(var r=new Array(e),t=0;t<e;t++)r[t]={type:"element",tagName:"span",properties:{className:[]},children:[]};return r}(m.position.end.line),j=["showlinenumbers=false",'showlinenumbers="false"',"showlinenumbers={false}"],x=function(){var e,n,i=y.value,a=i[0],l=i[1];l.properties.className=["code-line"];var s=filter(m,function(e){return e.position.start.line<=a+1&&e.position.end.line>=a+1});l.children=s.children,!f.toLowerCase().includes("showLineNumbers".toLowerCase())&&!o.showLineNumbers||j.some(function(e){return f.toLowerCase().includes(e)})||(l.properties.line=[(a+w).toString()],l.properties.className.push("line-number")),b(a)&&l.properties.className.push("highlight-line"),("diff"===d||null!=(e=d)&&e.includes("diff-"))&&"-"===hast_util_to_string_lib_toString(l).substring(0,1)?l.properties.className.push("deleted"):("diff"===d||null!=(n=d)&&n.includes("diff-"))&&"+"===hast_util_to_string_lib_toString(l).substring(0,1)&&l.properties.className.push("inserted")},O=u(N.entries());!(y=O()).done;)x();N.length>0&&""===hast_util_to_string_lib_toString(N[N.length-1]).trim()&&N.pop(),e.children=N}}}},p=index_es_c(refractor),f=index_es_c(refractor);
 //# sourceMappingURL=index.es.js.map
 
 ;// CONCATENATED MODULE: ../node_modules/css-selector-parser/dist/mjs/indexes.js
@@ -70864,6 +69845,9 @@ function createParser(options) {
             result += chr;
             next();
         }
+        if (result === '-' && !isIdent(chr) && !is('\\')) {
+            fail('Identifiers cannot consist of a single hyphen.');
+        }
         if (strict && result.length >= 2) {
             // Checking this only for strict mode since browsers work fine with these identifiers.
             fail('Identifiers cannot start with two hyphens with strict mode on.');
@@ -71644,63 +70628,6 @@ function direction(value) {
   return rtl.test(source) ? 'rtl' : ltr.test(source) ? 'ltr' : 'neutral'
 }
 
-;// CONCATENATED MODULE: ../node_modules/hast-util-to-string/lib/index.js
-/**
- * @typedef {import('hast').Nodes} Nodes
- * @typedef {import('hast').Parents} Parents
- */
-
-/**
- * Get the plain-text value of a hast node.
- *
- * @param {Nodes} node
- *   Node to serialize.
- * @returns {string}
- *   Serialized node.
- */
-function hast_util_to_string_lib_toString(node) {
-  // “The concatenation of data of all the Text node descendants of the context
-  // object, in tree order.”
-  if ('children' in node) {
-    return hast_util_to_string_lib_all(node)
-  }
-
-  // “Context object’s data.”
-  return 'value' in node ? node.value : ''
-}
-
-/**
- * @param {Nodes} node
- *   Node.
- * @returns {string}
- *   Serialized node.
- */
-function hast_util_to_string_lib_one(node) {
-  if (node.type === 'text') {
-    return node.value
-  }
-
-  return 'children' in node ? hast_util_to_string_lib_all(node) : ''
-}
-
-/**
- * @param {Parents} node
- *   Node.
- * @returns {string}
- *   Serialized node.
- */
-function hast_util_to_string_lib_all(node) {
-  let index = -1
-  /** @type {Array<string>} */
-  const result = []
-
-  while (++index < node.children.length) {
-    result[index] = hast_util_to_string_lib_one(node.children[index])
-  }
-
-  return result.join('')
-}
-
 ;// CONCATENATED MODULE: ../node_modules/hast-util-select/lib/enter-state.js
 /**
  * @typedef {import('hast').ElementContent} ElementContent
@@ -72405,7 +71332,7 @@ function esm_parse_parse(formula) {
 }
 //# sourceMappingURL=parse.js.map
 // EXTERNAL MODULE: ../node_modules/boolbase/index.js
-var boolbase = __webpack_require__(377);
+var boolbase = __webpack_require__(740);
 ;// CONCATENATED MODULE: ../node_modules/nth-check/lib/esm/compile.js
 
 /**
@@ -74394,11 +73321,11 @@ const convertElement =
 
       // Assume array.
       if (typeof test === 'object') {
-        return hast_util_is_element_lib_anyFactory(test)
+        return lib_anyFactory(test)
       }
 
       if (typeof test === 'function') {
-        return hast_util_is_element_lib_castFactory(test)
+        return lib_castFactory(test)
       }
 
       throw new Error('Expected function, string, or array as `test`')
@@ -74411,7 +73338,7 @@ const convertElement =
  * @param {Array<TestFunction | string>} tests
  * @returns {Check}
  */
-function hast_util_is_element_lib_anyFactory(tests) {
+function lib_anyFactory(tests) {
   /** @type {Array<Check>} */
   const checks = []
   let index = -1
@@ -74420,7 +73347,7 @@ function hast_util_is_element_lib_anyFactory(tests) {
     checks[index] = convertElement(tests[index])
   }
 
-  return hast_util_is_element_lib_castFactory(any)
+  return lib_castFactory(any)
 
   /**
    * @this {unknown}
@@ -74444,7 +73371,7 @@ function hast_util_is_element_lib_anyFactory(tests) {
  * @returns {Check}
  */
 function tagNameFactory(check) {
-  return hast_util_is_element_lib_castFactory(tagName)
+  return lib_castFactory(tagName)
 
   /**
    * @param {Element} element
@@ -74461,7 +73388,7 @@ function tagNameFactory(check) {
  * @param {TestFunction} testFunction
  * @returns {Check}
  */
-function hast_util_is_element_lib_castFactory(testFunction) {
+function lib_castFactory(testFunction) {
   return check
 
   /**
@@ -74951,13 +73878,13 @@ var defaultRehypePlugins = [rehypeSlug, rehypeAutolinkHeadings, rehype_ignore_li
 
 /* harmony default export */ const react_markdown_preview_esm = (/*#__PURE__*/external_root_React_commonjs2_react_commonjs_react_amd_react_default().forwardRef((props, ref) => {
   var _props$disableCopy;
-  var rehypePlugins = [reservedMeta, rehypeRaw, retrieveMeta, [f, {
-    ignoreMissing: true
-  }], ...defaultRehypePlugins, [lib, {
+  var rehypePlugins = [reservedMeta, rehypeRaw, retrieveMeta, ...defaultRehypePlugins, [lib, {
     rewrite: rehypeRewriteHandle((_props$disableCopy = props.disableCopy) != null ? _props$disableCopy : false, props.rehypeRewrite)
   }], [rehype_attr_lib, {
     properties: 'attr'
-  }], ...(props.rehypePlugins || [])];
+  }], ...(props.rehypePlugins || []), [f, {
+    ignoreMissing: true
+  }]];
   return /*#__PURE__*/(0,jsx_runtime.jsx)(preview, _extends({}, props, {
     rehypePlugins: rehypePlugins,
     ref: ref