@uiw/react-md-editor 4.0.1 → 4.0.3

package/dist/mdeditor.js

@@ -266,7 +266,7 @@ var TYPE_DECLARATION = 'declaration';
  * @throws {TypeError}
  * @throws {Error}
  */
-module.exports = function(style, options) {
+module.exports = function (style, options) {
   if (typeof style !== 'string') {
     throw new TypeError('First argument must be a string');
   }
@@ -300,7 +300,7 @@ module.exports = function(style, options) {
    */
   function position() {
     var start = { line: lineno, column: column };
-    return function(node) {
+    return function (node) {
       node.position = new Position(start);
       whitespace();
       return node;
@@ -573,53 +573,54 @@ if (true) {
 
 /***/ }),
 
-/***/ 862:
-/***/ ((module, __unused_webpack_exports, __webpack_require__) => {
+/***/ 209:
+/***/ (function(__unused_webpack_module, exports, __webpack_require__) {
 
-var parse = __webpack_require__(812);
+"use strict";
 
+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));
 /**
  * Parses inline style to object.
  *
- * @example
- * // returns { 'line-height': '42' }
- * StyleToObject('line-height: 42;');
+ * @param style - Inline style.
+ * @param iterator - Iterator.
+ * @returns - Style object or null.
+ *
+ * @example Parsing inline style to object:
  *
- * @param  {String}      style      - The inline style.
- * @param  {Function}    [iterator] - The iterator function.
- * @return {null|Object}
+ * ```js
+ * import parse from 'style-to-object';
+ * parse('line-height: 42;'); // { 'line-height': '42' }
+ * ```
  */
 function StyleToObject(style, iterator) {
-  var output = null;
-  if (!style || typeof style !== 'string') {
-    return output;
-  }
-
-  var declaration;
-  var declarations = parse(style);
-  var hasIterator = typeof iterator === 'function';
-  var property;
-  var value;
-
-  for (var i = 0, len = declarations.length; i < len; i++) {
-    declaration = declarations[i];
-    property = declaration.property;
-    value = declaration.value;
-
-    if (hasIterator) {
-      iterator(property, value, declaration);
-    } else if (value) {
-      output || (output = {});
-      output[property] = value;
-    }
-  }
-
-  return output;
+    var styleObject = null;
+    if (!style || typeof style !== 'string') {
+        return styleObject;
+    }
+    var declarations = (0, inline_style_parser_1.default)(style);
+    var hasIterator = typeof iterator === 'function';
+    declarations.forEach(function (declaration) {
+        if (declaration.type !== 'declaration') {
+            return;
+        }
+        var property = declaration.property, value = declaration.value;
+        if (hasIterator) {
+            iterator(property, value, declaration);
+        }
+        else if (value) {
+            styleObject = styleObject || {};
+            styleObject[property] = value;
+        }
+    });
+    return styleObject;
 }
-
-module.exports = StyleToObject;
-module.exports["default"] = StyleToObject; // ESM support
-
+exports["default"] = StyleToObject;
+//# sourceMappingURL=index.js.map
 
 /***/ }),
 
@@ -850,27 +851,27 @@ function _typeof(o) {
 }
 ;// CONCATENATED MODULE: ../node_modules/@babel/runtime/helpers/esm/toPrimitive.js
 
-function _toPrimitive(input, hint) {
-  if (_typeof(input) !== "object" || input === null) return input;
-  var prim = input[Symbol.toPrimitive];
-  if (prim !== undefined) {
-    var res = prim.call(input, hint || "default");
-    if (_typeof(res) !== "object") return res;
+function toPrimitive(t, r) {
+  if ("object" != _typeof(t) || !t) return t;
+  var e = t[Symbol.toPrimitive];
+  if (void 0 !== e) {
+    var i = e.call(t, r || "default");
+    if ("object" != _typeof(i)) return i;
     throw new TypeError("@@toPrimitive must return a primitive value.");
   }
-  return (hint === "string" ? String : Number)(input);
+  return ("string" === r ? String : Number)(t);
 }
 ;// CONCATENATED MODULE: ../node_modules/@babel/runtime/helpers/esm/toPropertyKey.js
 
 
-function _toPropertyKey(arg) {
-  var key = _toPrimitive(arg, "string");
-  return _typeof(key) === "symbol" ? key : String(key);
+function toPropertyKey(t) {
+  var i = toPrimitive(t, "string");
+  return "symbol" == _typeof(i) ? i : String(i);
 }
 ;// CONCATENATED MODULE: ../node_modules/@babel/runtime/helpers/esm/defineProperty.js
 
 function _defineProperty(obj, key, value) {
-  key = _toPropertyKey(key);
+  key = toPropertyKey(key);
   if (key in obj) {
     Object.defineProperty(obj, key, {
       value: value,
@@ -1101,6 +1102,69 @@ function stringify(values, options) {
     .trim()
 }
 
+;// CONCATENATED MODULE: ../node_modules/estree-util-is-identifier-name/lib/index.js
+/**
+ * @typedef Options
+ *   Configuration.
+ * @property {boolean | null | undefined} [jsx=false]
+ *   Support JSX identifiers (default: `false`).
+ */
+
+const startRe = /[$_\p{ID_Start}]/u
+const contRe = /[$_\u{200C}\u{200D}\p{ID_Continue}]/u
+const contReJsx = /[-$_\u{200C}\u{200D}\p{ID_Continue}]/u
+const nameRe = /^[$_\p{ID_Start}][$_\u{200C}\u{200D}\p{ID_Continue}]*$/u
+const nameReJsx = /^[$_\p{ID_Start}][-$_\u{200C}\u{200D}\p{ID_Continue}]*$/u
+
+/** @type {Options} */
+const emptyOptions = {}
+
+/**
+ * Checks if the given code point can start an identifier.
+ *
+ * @param {number | undefined} code
+ *   Code point to check.
+ * @returns {boolean}
+ *   Whether `code` can start an identifier.
+ */
+// Note: `undefined` is supported so you can pass the result from `''.codePointAt`.
+function start(code) {
+  return code ? startRe.test(String.fromCodePoint(code)) : false
+}
+
+/**
+ * Checks if the given code point can continue an identifier.
+ *
+ * @param {number | undefined} code
+ *   Code point to check.
+ * @param {Options | null | undefined} [options]
+ *   Configuration (optional).
+ * @returns {boolean}
+ *   Whether `code` can continue an identifier.
+ */
+// Note: `undefined` is supported so you can pass the result from `''.codePointAt`.
+function cont(code, options) {
+  const settings = options || emptyOptions
+  const re = settings.jsx ? contReJsx : contRe
+  return code ? re.test(String.fromCodePoint(code)) : false
+}
+
+/**
+ * Checks if the given value is a valid identifier name.
+ *
+ * @param {string} name
+ *   Identifier to check.
+ * @param {Options | null | undefined} [options]
+ *   Configuration (optional).
+ * @returns {boolean}
+ *   Whether `name` can be an identifier.
+ */
+function lib_name(name, options) {
+  const settings = options || emptyOptions
+  const re = settings.jsx ? nameReJsx : nameRe
+  return re.test(name)
+}
+
 ;// CONCATENATED MODULE: ../node_modules/hast-util-whitespace/lib/index.js
 /**
  * @typedef {import('hast').Nodes} Nodes
@@ -2500,12 +2564,13 @@ function space_separated_tokens_stringify(values) {
   return values.join(' ').trim()
 }
 
-// EXTERNAL MODULE: ../node_modules/style-to-object/index.js
-var style_to_object = __webpack_require__(862);
-;// CONCATENATED MODULE: ../node_modules/style-to-object/index.mjs
+// EXTERNAL MODULE: ../node_modules/style-to-object/cjs/index.js
+var cjs = __webpack_require__(209);
+;// CONCATENATED MODULE: ../node_modules/style-to-object/esm/index.mjs
 
 
-/* harmony default export */ const node_modules_style_to_object = (style_to_object);
+// ensure compatibility with rollup umd build
+/* harmony default export */ const esm = (cjs["default"] || cjs);
 
 ;// CONCATENATED MODULE: ../node_modules/unist-util-position/lib/index.js
 /**
@@ -3011,13 +3076,36 @@ VFileMessage.prototype.ruleId = undefined
 VFileMessage.prototype.source = undefined
 
 ;// CONCATENATED MODULE: ../node_modules/hast-util-to-jsx-runtime/lib/index.js
+// Register MDX nodes in mdast:
+/// <reference types="mdast-util-mdx-expression" />
+/// <reference types="mdast-util-mdx-jsx" />
+/// <reference types="mdast-util-mdxjs-esm" />
+
 /**
+ * @typedef {import('estree').Identifier} Identifier
+ * @typedef {import('estree').Literal} Literal
+ * @typedef {import('estree').MemberExpression} MemberExpression
+ * @typedef {import('estree').Expression} Expression
+ * @typedef {import('estree').Program} Program
+ *
  * @typedef {import('hast').Element} Element
  * @typedef {import('hast').Nodes} Nodes
  * @typedef {import('hast').Parents} Parents
+ * @typedef {import('hast').Root} Root
+ * @typedef {import('hast').Text} Text
+ *
+ * @typedef {import('mdast-util-mdx-expression').MdxFlowExpressionHast} MdxFlowExpression
+ * @typedef {import('mdast-util-mdx-expression').MdxTextExpressionHast} MdxTextExpression
+ *
+ * @typedef {import('mdast-util-mdx-jsx').MdxJsxFlowElementHast} MdxJsxFlowElement
+ * @typedef {import('mdast-util-mdx-jsx').MdxJsxTextElementHast} MdxJsxTextElement
+ *
+ * @typedef {import('mdast-util-mdxjs-esm').MdxjsEsmHast} MdxjsEsm
  *
  * @typedef {import('property-information').Schema} Schema
  *
+ * @typedef {import('unist').Position} Position
+ *
  * @typedef {import('./components.js').Components} Components
  */
 
@@ -3038,12 +3126,40 @@ VFileMessage.prototype.source = undefined
  * @returns {JSX.Element}
  *   Result.
  *
+ * @callback CreateEvaluater
+ *   Create an evaluator that turns ESTree ASTs from embedded MDX into values.
+ * @returns {Evaluater}
+ *   Evaluater.
+ *
  * @typedef {'html' | 'react'} ElementAttributeNameCase
  *   Casing to use for attribute names.
  *
  *   HTML casing is for example `class`, `stroke-linecap`, `xml:lang`.
  *   React casing is for example `className`, `strokeLinecap`, `xmlLang`.
  *
+ * @callback EvaluateExpression
+ *   Turn an MDX expression into a value.
+ * @param {Expression} expression
+ *   ESTree expression.
+ * @returns {unknown}
+ *   Result of expression.
+ *
+ * @callback EvaluateProgram
+ *   Turn an MDX program (export/import statements) into a value.
+ * @param {Program} expression
+ *   ESTree program.
+ * @returns {unknown}
+ *   Result of program;
+ *   should likely be `undefined` as ESM changes the scope but doesn’t yield
+ *   something.
+ *
+ * @typedef Evaluater
+ *   Evaluator that turns ESTree ASTs from embedded MDX into values.
+ * @property {EvaluateExpression} evaluateExpression
+ *   Evaluate an expression.
+ * @property {EvaluateProgram} evaluateProgram
+ *   Evaluate a program.
+ *
  * @typedef {[string, Value]} Field
  *   Property field.
  *
@@ -3059,7 +3175,7 @@ VFileMessage.prototype.source = undefined
  * @param {string | undefined} [key]
  *   Dynamicly generated key to use.
  * @returns {JSX.Element}
- *   An element from your framework.
+ *   Element from your framework.
  *
  * @callback JsxDev
  *   Create a development element.
@@ -3077,15 +3193,17 @@ VFileMessage.prototype.source = undefined
  * @param {undefined} self
  *   Nothing (this is used by frameworks that have components, we don’t).
  * @returns {JSX.Element}
- *   An element from your framework.
+ *   Element from your framework.
  *
- * @typedef {{children?: Array<Child> | Child, node?: Element | undefined, [prop: string]: Array<Child> | Child | Element | Value | undefined}} Props
+ * @typedef {{children?: Array<Child> | Child, node?: Element | MdxJsxFlowElement | MdxJsxTextElement | undefined, [prop: string]: Array<Child> | Child | Element | MdxJsxFlowElement | MdxJsxTextElement | Value | undefined}} Props
  *   Properties and children.
  *
  * @typedef RegularFields
  *   Configuration.
  * @property {Partial<Components> | null | undefined} [components]
  *   Components to use (optional).
+ * @property {CreateEvaluater | null | undefined} [createEvaluater]
+ *   Create an evaluator that turns ESTree ASTs into values (optional).
  * @property {ElementAttributeNameCase | null | undefined} [elementAttributeNameCase='react']
  *   Specify casing to use for attribute names (default: `'react'`).
  * @property {string | null | undefined} [filePath]
@@ -3184,6 +3302,8 @@ VFileMessage.prototype.source = undefined
  *   Create something in development or production.
  * @property {ElementAttributeNameCase} elementAttributeNameCase
  *   Casing to use for attribute names.
+ * @property {Evaluater | undefined} evaluater
+ *   Evaluator that turns ESTree ASTs into values.
  * @property {string | undefined} filePath
  *   File path.
  * @property {boolean} ignoreInvalidStyle
@@ -3231,6 +3351,8 @@ VFileMessage.prototype.source = undefined
 
 
 
+
+
 const lib_own = {}.hasOwnProperty
 
 /** @type {Map<string, number>} */
@@ -3254,6 +3376,8 @@ const tableElements = new Set(['table', 'tbody', 'thead', 'tfoot', 'tr'])
 
 const tableCellElement = new Set(['td', 'th'])
 
+const docs = 'https://github.com/syntax-tree/hast-util-to-jsx-runtime'
+
 /**
  * Transform a hast tree to preact, react, solid, svelte, vue, etc.,
  * with an automatic JSX runtime.
@@ -3302,6 +3426,7 @@ function toJsxRuntime(tree, options) {
     components: options.components || {},
     create,
     elementAttributeNameCase: options.elementAttributeNameCase || 'react',
+    evaluater: options.createEvaluater ? options.createEvaluater() : undefined,
     filePath,
     ignoreInvalidStyle: options.ignoreInvalidStyle || false,
     passKeys: options.passKeys !== false,
@@ -3340,67 +3465,233 @@ function toJsxRuntime(tree, options) {
  *   Child, optional.
  */
 function one(state, node, key) {
-  if (node.type === 'element' || node.type === 'root') {
-    const parentSchema = state.schema
-    let schema = parentSchema
+  if (node.type === 'element') {
+    return lib_element(state, node, key)
+  }
 
-    if (
-      node.type === 'element' &&
-      node.tagName.toLowerCase() === 'svg' &&
-      parentSchema.space === 'html'
-    ) {
-      schema = property_information_svg
-      state.schema = schema
-    }
+  if (node.type === 'mdxFlowExpression' || node.type === 'mdxTextExpression') {
+    return mdxExpression(state, node)
+  }
 
-    state.ancestors.push(node)
+  if (node.type === 'mdxJsxFlowElement' || node.type === 'mdxJsxTextElement') {
+    return mdxJsxElement(state, node, key)
+  }
 
-    let children = createChildren(state, node)
-    const props = createProperties(state, state.ancestors)
-    let type = state.Fragment
+  if (node.type === 'mdxjsEsm') {
+    return mdxEsm(state, node)
+  }
 
-    state.ancestors.pop()
+  if (node.type === 'root') {
+    return root(state, node, key)
+  }
 
-    if (node.type === 'element') {
-      if (children && tableElements.has(node.tagName)) {
-        children = children.filter(function (child) {
-          return typeof child === 'string' ? !whitespace(child) : true
-        })
-      }
+  if (node.type === 'text') {
+    return lib_text(state, node)
+  }
+}
 
-      if (lib_own.call(state.components, node.tagName)) {
-        const key = /** @type {keyof JSX.IntrinsicElements} */ (node.tagName)
-        type = state.components[key]
+/**
+ * Handle element.
+ *
+ * @param {State} state
+ *   Info passed around.
+ * @param {Element} node
+ *   Current node.
+ * @param {string | undefined} key
+ *   Key.
+ * @returns {Child | undefined}
+ *   Child, optional.
+ */
+function lib_element(state, node, key) {
+  const parentSchema = state.schema
+  let schema = parentSchema
 
-        // If this is swapped out for a component:
-        if (
-          typeof type !== 'string' &&
-          type !== state.Fragment &&
-          state.passNode
-        ) {
-          props.node = node
-        }
-      } else {
-        type = node.tagName
-      }
-    }
+  if (node.tagName.toLowerCase() === 'svg' && parentSchema.space === 'html') {
+    schema = property_information_svg
+    state.schema = schema
+  }
 
-    if (children.length > 0) {
-      const value = children.length > 1 ? children : children[0]
+  state.ancestors.push(node)
 
-      if (value) {
-        props.children = value
-      }
-    }
+  const type = findComponentFromName(state, node.tagName, false)
+  const props = createElementProps(state, node)
+  let children = createChildren(state, node)
+
+  if (tableElements.has(node.tagName)) {
+    children = children.filter(function (child) {
+      return typeof child === 'string' ? !whitespace(child) : true
+    })
+  }
+
+  addNode(state, props, type, node)
+  addChildren(props, children)
 
-    // Restore parent schema.
-    state.schema = parentSchema
+  // Restore.
+  state.ancestors.pop()
+  state.schema = parentSchema
 
-    return state.create(node, type, props, key)
+  return state.create(node, type, props, key)
+}
+
+/**
+ * Handle MDX expression.
+ *
+ * @param {State} state
+ *   Info passed around.
+ * @param {MdxFlowExpression | MdxTextExpression} node
+ *   Current node.
+ * @returns {Child | undefined}
+ *   Child, optional.
+ */
+function mdxExpression(state, node) {
+  if (node.data && node.data.estree && state.evaluater) {
+    const program = node.data.estree
+    const expression = program.body[0]
+    ok(expression.type === 'ExpressionStatement')
+
+    // Assume result is a child.
+    return /** @type {Child | undefined} */ (
+      state.evaluater.evaluateExpression(expression.expression)
+    )
   }
 
-  if (node.type === 'text') {
-    return node.value
+  crashEstree(state, node.position)
+}
+
+/**
+ * Handle MDX ESM.
+ *
+ * @param {State} state
+ *   Info passed around.
+ * @param {MdxjsEsm} node
+ *   Current node.
+ * @returns {Child | undefined}
+ *   Child, optional.
+ */
+function mdxEsm(state, node) {
+  if (node.data && node.data.estree && state.evaluater) {
+    // Assume result is a child.
+    return /** @type {Child | undefined} */ (
+      state.evaluater.evaluateProgram(node.data.estree)
+    )
+  }
+
+  crashEstree(state, node.position)
+}
+
+/**
+ * Handle MDX JSX.
+ *
+ * @param {State} state
+ *   Info passed around.
+ * @param {MdxJsxFlowElement | MdxJsxTextElement} node
+ *   Current node.
+ * @param {string | undefined} key
+ *   Key.
+ * @returns {Child | undefined}
+ *   Child, optional.
+ */
+function mdxJsxElement(state, node, key) {
+  const parentSchema = state.schema
+  let schema = parentSchema
+
+  if (node.name === 'svg' && parentSchema.space === 'html') {
+    schema = property_information_svg
+    state.schema = schema
+  }
+
+  state.ancestors.push(node)
+
+  const type =
+    node.name === null
+      ? state.Fragment
+      : findComponentFromName(state, node.name, true)
+  const props = createJsxElementProps(state, node)
+  const children = createChildren(state, node)
+
+  addNode(state, props, type, node)
+  addChildren(props, children)
+
+  // Restore.
+  state.ancestors.pop()
+  state.schema = parentSchema
+
+  return state.create(node, type, props, key)
+}
+
+/**
+ * Handle root.
+ *
+ * @param {State} state
+ *   Info passed around.
+ * @param {Root} node
+ *   Current node.
+ * @param {string | undefined} key
+ *   Key.
+ * @returns {Child | undefined}
+ *   Child, optional.
+ */
+function root(state, node, key) {
+  /** @type {Props} */
+  const props = {}
+
+  addChildren(props, createChildren(state, node))
+
+  return state.create(node, state.Fragment, props, key)
+}
+
+/**
+ * Handle text.
+ *
+ * @param {State} _
+ *   Info passed around.
+ * @param {Text} node
+ *   Current node.
+ * @returns {Child | undefined}
+ *   Child, optional.
+ */
+function lib_text(_, node) {
+  return node.value
+}
+
+/**
+ * Add `node` to props.
+ *
+ * @param {State} state
+ *   Info passed around.
+ * @param {Props} props
+ *   Props.
+ * @param {unknown} type
+ *   Type.
+ * @param {Element | MdxJsxFlowElement | MdxJsxTextElement} node
+ *   Node.
+ * @returns {undefined}
+ *   Nothing.
+ */
+function addNode(state, props, type, node) {
+  // If this is swapped out for a component:
+  if (typeof type !== 'string' && type !== state.Fragment && state.passNode) {
+    props.node = node
+  }
+}
+
+/**
+ * Add children to props.
+ *
+ * @param {Props} props
+ *   Props.
+ * @param {Array<Child>} children
+ *   Children.
+ * @returns {undefined}
+ *   Nothing.
+ */
+function addChildren(props, children) {
+  if (children.length > 0) {
+    const value = children.length > 1 ? children : children[0]
+
+    if (value) {
+      props.children = value
+    }
   }
 }
 
@@ -3455,6 +3746,118 @@ function developmentCreate(filePath, jsxDEV) {
   }
 }
 
+/**
+ * Create props from an element.
+ *
+ * @param {State} state
+ *   Info passed around.
+ * @param {Element} node
+ *   Current element.
+ * @returns {Props}
+ *   Props.
+ */
+function createElementProps(state, node) {
+  /** @type {Props} */
+  const props = {}
+  /** @type {string | undefined} */
+  let alignValue
+  /** @type {string} */
+  let prop
+
+  for (prop in node.properties) {
+    if (prop !== 'children' && lib_own.call(node.properties, prop)) {
+      const result = createProperty(state, prop, node.properties[prop])
+
+      if (result) {
+        const [key, value] = result
+
+        if (
+          state.tableCellAlignToStyle &&
+          key === 'align' &&
+          typeof value === 'string' &&
+          tableCellElement.has(node.tagName)
+        ) {
+          alignValue = value
+        } else {
+          props[key] = value
+        }
+      }
+    }
+  }
+
+  if (alignValue) {
+    // Assume style is an object.
+    const style = /** @type {Style} */ (props.style || (props.style = {}))
+    style[state.stylePropertyNameCase === 'css' ? 'text-align' : 'textAlign'] =
+      alignValue
+  }
+
+  return props
+}
+
+/**
+ * Create props from a JSX element.
+ *
+ * @param {State} state
+ *   Info passed around.
+ * @param {MdxJsxFlowElement | MdxJsxTextElement} node
+ *   Current JSX element.
+ * @returns {Props}
+ *   Props.
+ */
+function createJsxElementProps(state, node) {
+  /** @type {Props} */
+  const props = {}
+
+  for (const attribute of node.attributes) {
+    if (attribute.type === 'mdxJsxExpressionAttribute') {
+      if (attribute.data && attribute.data.estree && state.evaluater) {
+        const program = attribute.data.estree
+        const expression = program.body[0]
+        ok(expression.type === 'ExpressionStatement')
+        const objectExpression = expression.expression
+        ok(objectExpression.type === 'ObjectExpression')
+        const property = objectExpression.properties[0]
+        ok(property.type === 'SpreadElement')
+
+        Object.assign(
+          props,
+          state.evaluater.evaluateExpression(property.argument)
+        )
+      } else {
+        crashEstree(state, node.position)
+      }
+    } else {
+      // For JSX, the author is responsible of passing in the correct values.
+      const name = attribute.name
+      /** @type {unknown} */
+      let value
+
+      if (attribute.value && typeof attribute.value === 'object') {
+        if (
+          attribute.value.data &&
+          attribute.value.data.estree &&
+          state.evaluater
+        ) {
+          const program = attribute.value.data.estree
+          const expression = program.body[0]
+          ok(expression.type === 'ExpressionStatement')
+          value = state.evaluater.evaluateExpression(expression.expression)
+        } else {
+          crashEstree(state, node.position)
+        }
+      } else {
+        value = attribute.value === null ? true : attribute.value
+      }
+
+      // Assume a prop.
+      props[name] = /** @type {Props[keyof Props]} */ (value)
+    }
+  }
+
+  return props
+}
+
 /**
  * Create children.
  *
@@ -3472,17 +3875,27 @@ function createChildren(state, node) {
   /** @type {Map<string, number>} */
   // Note: test this when Solid doesn’t want to merge my upcoming PR.
   /* c8 ignore next */
-  const countsByTagName = state.passKeys ? new Map() : emptyMap
+  const countsByName = state.passKeys ? new Map() : emptyMap
 
   while (++index < node.children.length) {
     const child = node.children[index]
     /** @type {string | undefined} */
     let key
 
-    if (state.passKeys && child.type === 'element') {
-      const count = countsByTagName.get(child.tagName) || 0
-      key = child.tagName + '-' + count
-      countsByTagName.set(child.tagName, count + 1)
+    if (state.passKeys) {
+      const name =
+        child.type === 'element'
+          ? child.tagName
+          : child.type === 'mdxJsxFlowElement' ||
+              child.type === 'mdxJsxTextElement'
+            ? child.name
+            : undefined
+
+      if (name) {
+        const count = countsByName.get(name) || 0
+        key = name + '-' + count
+        countsByName.set(name, count + 1)
+      }
     }
 
     const result = one(state, child, key)
@@ -3492,72 +3905,11 @@ function createChildren(state, node) {
   return children
 }
 
-/**
- * Handle properties.
- *
- * @param {State} state
- *   Info passed around.
- * @param {Array<Parents>} ancestors
- *   Stack of parents.
- * @returns {Props}
- *   Props for runtime.
- */
-function createProperties(state, ancestors) {
-  const node = ancestors[ancestors.length - 1]
-  /** @type {Props} */
-  const props = {}
-  /** @type {string} */
-  let prop
-
-  if ('properties' in node && node.properties) {
-    /** @type {string | undefined} */
-    let alignValue
-
-    for (prop in node.properties) {
-      if (prop !== 'children' && lib_own.call(node.properties, prop)) {
-        const result = createProperty(
-          state,
-          ancestors,
-          prop,
-          node.properties[prop]
-        )
-
-        if (result) {
-          const [key, value] = result
-
-          if (
-            state.tableCellAlignToStyle &&
-            key === 'align' &&
-            typeof value === 'string' &&
-            tableCellElement.has(node.tagName)
-          ) {
-            alignValue = value
-          } else {
-            props[key] = value
-          }
-        }
-      }
-    }
-
-    if (alignValue) {
-      // Assume style is an object.
-      const style = /** @type {Style} */ (props.style || (props.style = {}))
-      style[
-        state.stylePropertyNameCase === 'css' ? 'text-align' : 'textAlign'
-      ] = alignValue
-    }
-  }
-
-  return props
-}
-
 /**
  * Handle a property.
  *
  * @param {State} state
  *   Info passed around.
- * @param {Array<Parents>} ancestors
- *   Stack of parents.
  * @param {string} prop
  *   Key.
  * @param {Array<number | string> | boolean | number | string | null | undefined} value
@@ -3565,7 +3917,7 @@ function createProperties(state, ancestors) {
  * @returns {Field | undefined}
  *   Field for runtime, optional.
  */
-function createProperty(state, ancestors, prop, value) {
+function createProperty(state, prop, value) {
   const info = find(state.schema, prop)
 
   // Ignore nullish and `NaN` values.
@@ -3586,9 +3938,7 @@ function createProperty(state, ancestors, prop, value) {
   // React only accepts `style` as object.
   if (info.property === 'style') {
     let styleObject =
-      typeof value === 'object'
-        ? value
-        : parseStyle(state, ancestors, String(value))
+      typeof value === 'object' ? value : parseStyle(state, String(value))
 
     if (state.stylePropertyNameCase === 'css') {
       styleObject = transformStylesToCssCasing(styleObject)
@@ -3610,8 +3960,6 @@ function createProperty(state, ancestors, prop, value) {
  *
  * @param {State} state
  *   Info passed around.
- * @param {Array<Nodes>} ancestors
- *   Stack of nodes.
  * @param {string} value
  *   CSS declarations.
  * @returns {Style}
@@ -3619,24 +3967,24 @@ function createProperty(state, ancestors, prop, value) {
  * @throws
  *   Throws `VFileMessage` when CSS cannot be parsed.
  */
-function parseStyle(state, ancestors, value) {
+function parseStyle(state, value) {
   /** @type {Style} */
   const result = {}
 
   try {
-    node_modules_style_to_object(value, replacer)
+    // @ts-expect-error: `style-to-object` types are broken.
+    esm(value, replacer)
   } catch (error) {
     if (!state.ignoreInvalidStyle) {
       const cause = /** @type {Error} */ (error)
       const message = new VFileMessage('Cannot parse `style` attribute', {
-        ancestors,
+        ancestors: state.ancestors,
         cause,
-        source: 'hast-util-to-jsx-runtime',
-        ruleId: 'style'
+        ruleId: 'style',
+        source: 'hast-util-to-jsx-runtime'
       })
       message.file = state.filePath || undefined
-      message.url =
-        'https://github.com/syntax-tree/hast-util-to-jsx-runtime#cannot-parse-style-attribute'
+      message.url = docs + '#cannot-parse-style-attribute'
 
       throw message
     }
@@ -3667,6 +4015,92 @@ function parseStyle(state, ancestors, value) {
   }
 }
 
+/**
+ * Create a JSX name from a string.
+ *
+ * @param {State} state
+ *   To do.
+ * @param {string} name
+ *   Name.
+ * @param {boolean} allowExpression
+ *   Allow member expressions and identifiers.
+ * @returns {unknown}
+ *   To do.
+ */
+function findComponentFromName(state, name, allowExpression) {
+  /** @type {Identifier | Literal | MemberExpression} */
+  let result
+
+  if (!allowExpression) {
+    result = {type: 'Literal', value: name}
+  } else if (name.includes('.')) {
+    const identifiers = name.split('.')
+    let index = -1
+    /** @type {Identifier | Literal | MemberExpression | undefined} */
+    let node
+
+    while (++index < identifiers.length) {
+      /** @type {Identifier | Literal} */
+      const prop = lib_name(identifiers[index])
+        ? {type: 'Identifier', name: identifiers[index]}
+        : {type: 'Literal', value: identifiers[index]}
+      node = node
+        ? {
+            type: 'MemberExpression',
+            object: node,
+            property: prop,
+            computed: Boolean(index && prop.type === 'Literal'),
+            optional: false
+          }
+        : prop
+    }
+
+    ok(node, 'always a result')
+    result = node
+  } else {
+    result =
+      lib_name(name) && !/^[a-z]/.test(name)
+        ? {type: 'Identifier', name}
+        : {type: 'Literal', value: name}
+  }
+
+  // Only literals can be passed in `components` currently.
+  // No identifiers / member expressions.
+  if (result.type === 'Literal') {
+    const name = /** @type {keyof JSX.IntrinsicElements} */ (result.value)
+
+    return lib_own.call(state.components, name) ? state.components[name] : name
+  }
+
+  // Assume component.
+  if (state.evaluater) {
+    return state.evaluater.evaluateExpression(result)
+  }
+
+  crashEstree(state)
+}
+
+/**
+ * @param {State} state
+ * @param {Position | undefined} [place]
+ * @returns {never}
+ */
+function crashEstree(state, place) {
+  const message = new VFileMessage(
+    'Cannot handle MDX estrees without `createEvaluater`',
+    {
+      ancestors: state.ancestors,
+      place,
+      ruleId: 'mdx-estree',
+      source: 'hast-util-to-jsx-runtime'
+    }
+  )
+  message.file = state.filePath || undefined
+  message.url = docs + '#cannot-handle-mdx-estrees-without-createevaluater'
+
+  throw message
+}
+
 /**
  * Transform a DOM casing style object to a CSS casing style object.
  *
@@ -3775,7 +4209,7 @@ var jsx_runtime = __webpack_require__(246);
  */
 
 /** @type {Options} */
-const emptyOptions = {}
+const lib_emptyOptions = {}
 
 /**
  * Get the text content of a node or list of nodes.
@@ -3791,7 +4225,7 @@ const emptyOptions = {}
  *   Serialized `value`.
  */
 function lib_toString(value, options) {
-  const settings = options || emptyOptions
+  const settings = options || lib_emptyOptions
   const includeImageAlt =
     typeof settings.includeImageAlt === 'boolean'
       ? settings.includeImageAlt
@@ -14430,7 +14864,7 @@ const serializer = (strict, json, $, _) => {
  * fallback to the polyfill if present.
  * @returns {Record[]}
  */
-/* harmony default export */ const esm = (typeof structuredClone === "function" ?
+/* harmony default export */ const structured_clone_esm = (typeof structuredClone === "function" ?
   /* c8 ignore start */
   (any, options) => (
     options && ('json' in options || 'lossy' in options) ?
@@ -15042,7 +15476,7 @@ function footer(state) {
         type: 'element',
         tagName: footnoteLabelTagName,
         properties: {
-          ...esm(footnoteLabelProperties),
+          ...structured_clone_esm(footnoteLabelProperties),
           id: 'footnote-label'
         },
         children: [{type: 'text', value: footnoteLabel}]
@@ -16889,7 +17323,7 @@ function paragraph(state, node) {
  * @returns {HastParents}
  *   hast node.
  */
-function root(state, node) {
+function root_root(state, node) {
   /** @type {HastRoot} */
   const result = {type: 'root', children: state.wrap(state.all(node))}
   state.patch(node, result)
@@ -17274,7 +17708,7 @@ const handlers_handlers = {
   list: list_list,
   paragraph: paragraph,
   // @ts-expect-error: root is different, but hard to type.
-  root: root,
+  root: root_root,
   strong: strong,
   table: table,
   tableCell: tableCell,
@@ -17548,7 +17982,7 @@ function createState(tree, options) {
     if (state.options.passThrough && state.options.passThrough.includes(type)) {
       if ('children' in node) {
         const {children, ...shallow} = node
-        const result = esm(shallow)
+        const result = structured_clone_esm(shallow)
         // @ts-expect-error: TS doesn’t understand…
         result.children = state.all(node)
         // @ts-expect-error: TS doesn’t understand…
@@ -17556,7 +17990,7 @@ function createState(tree, options) {
       }
 
       // @ts-expect-error: it’s custom.
-      return esm(node)
+      return structured_clone_esm(node)
     }
 
     const unknown = state.options.unknownHandler || defaultUnknownHandler
@@ -17666,7 +18100,7 @@ function applyData(from, to) {
     }
 
     if (result.type === 'element' && hProperties) {
-      Object.assign(result.properties, esm(hProperties))
+      Object.assign(result.properties, structured_clone_esm(hProperties))
     }
 
     if (
@@ -23200,7 +23634,7 @@ function emphasisPeek(_, _1, state) {
  */
 
 /** @type {Options} */
-const lib_emptyOptions = {}
+const mdast_util_to_string_lib_emptyOptions = {}
 
 /**
  * Get the text content of a node or list of nodes.
@@ -23216,7 +23650,7 @@ const lib_emptyOptions = {}
  *   Serialized `value`.
  */
 function mdast_util_to_string_lib_toString(value, options) {
-  const settings = options || lib_emptyOptions
+  const settings = options || mdast_util_to_string_lib_emptyOptions
   const includeImageAlt =
     typeof settings.includeImageAlt === 'boolean'
       ? settings.includeImageAlt
@@ -24276,7 +24710,7 @@ const phrasing =
  * @param {Info} info
  * @returns {string}
  */
-function root_root(node, _, state, info) {
+function handle_root_root(node, _, state, info) {
   // Note: `html` nodes are ambiguous.
   const hasPhrasing = node.children.some(function (d) {
     return phrasing(d)
@@ -24467,7 +24901,7 @@ const handle = {
   list: handle_list_list,
   listItem: list_item_listItem,
   paragraph: paragraph_paragraph,
-  root: root_root,
+  root: handle_root_root,
   strong: strong_strong,
   text: handle_text_text,
   thematicBreak: handle_thematic_break_thematicBreak
@@ -30810,7 +31244,7 @@ function hast_util_from_parse5_lib_one(state, node) {
     // Element.
     default: {
       const reference = /** @type {P5Element} */ (node)
-      result = lib_element(state, reference)
+      result = hast_util_from_parse5_lib_element(state, reference)
       return result
     }
   }
@@ -30850,7 +31284,7 @@ function hast_util_from_parse5_lib_all(state, nodes) {
  * @returns {Element}
  *   hast node.
  */
-function lib_element(state, node) {
+function hast_util_from_parse5_lib_element(state, node) {
   const schema = state.schema
 
   state.schema = node.namespaceURI === webNamespaces.svg ? property_information_svg : property_information_html
@@ -31187,7 +31621,7 @@ const hast_util_to_parse5_lib_emptyOptions = {}
 
 const hast_util_to_parse5_lib_own = {}.hasOwnProperty
 
-const hast_util_to_parse5_lib_one = zwitch('type', {handlers: {root: lib_root, element: hast_util_to_parse5_lib_element, text: lib_text, comment, doctype}})
+const hast_util_to_parse5_lib_one = zwitch('type', {handlers: {root: lib_root, element: hast_util_to_parse5_lib_element, text: hast_util_to_parse5_lib_text, comment, doctype}})
 
 /**
  * Transform a hast tree to a `parse5` AST.
@@ -31268,7 +31702,7 @@ function doctype(node) {
  * @returns {Parse5Text}
  *   Parse5 node.
  */
-function lib_text(node) {
+function hast_util_to_parse5_lib_text(node) {
   /** @type {Parse5Text} */
   const result = {
     nodeName: '#text',
@@ -41029,8 +41463,8 @@ function createParse5Location(node) {
  */
 function cloneWithoutChildren(node) {
   return 'children' in node
-    ? esm({...node, children: []})
-    : esm(node)
+    ? structured_clone_esm({...node, children: []})
+    : structured_clone_esm(node)
 }
 
 ;// CONCATENATED MODULE: ../node_modules/rehype-raw/lib/index.js
@@ -41116,7 +41550,7 @@ function useCopied(container) {
 ;// CONCATENATED MODULE: ../node_modules/@uiw/react-markdown-preview/esm/preview.js
 
 
-var _excluded = ["prefixCls", "className", "source", "style", "disableCopy", "skipHtml", "onScroll", "onMouseOver", "pluginsFilter", "rehypeRewrite", "wrapperElement", "warpperElement"];
+var _excluded = ["prefixCls", "className", "source", "style", "disableCopy", "skipHtml", "onScroll", "onMouseOver", "pluginsFilter", "rehypeRewrite", "wrapperElement", "warpperElement", "urlTransform"];
 
 
 
@@ -41124,7 +41558,11 @@ var _excluded = ["prefixCls", "className", "source", "style", "disableCopy", "sk
 
 
 
+/**
+ * https://github.com/uiwjs/react-md-editor/issues/607
+ */
 
+var preview_defaultUrlTransform = url => url;
 /* harmony default export */ const preview = (/*#__PURE__*/external_root_React_commonjs2_react_commonjs_react_amd_react_default().forwardRef((props, ref) => {
   var {
       prefixCls = 'wmde-markdown wmde-markdown-color',
@@ -41137,7 +41575,8 @@ var _excluded = ["prefixCls", "className", "source", "style", "disableCopy", "sk
       onMouseOver,
       pluginsFilter,
       wrapperElement = {},
-      warpperElement = {}
+      warpperElement = {},
+      urlTransform
     } = props,
     other = _objectWithoutPropertiesLoose(props, _excluded);
   var mdp = external_root_React_commonjs2_react_commonjs_react_amd_react_default().useRef(null);
@@ -41169,1244 +41608,200 @@ var _excluded = ["prefixCls", "className", "source", "style", "disableCopy", "sk
     style: style,
     children: /*#__PURE__*/(0,jsx_runtime.jsx)(Markdown, _extends({}, customProps, other, {
       skipHtml: skipHtml,
+      urlTransform: urlTransform || preview_defaultUrlTransform,
       rehypePlugins: pluginsFilter ? pluginsFilter('rehype', rehypePlugins) : rehypePlugins,
       remarkPlugins: pluginsFilter ? pluginsFilter('remark', remarkPlugins) : remarkPlugins,
       children: source || ''
     }))
   }));
 }));
-;// CONCATENATED MODULE: ../node_modules/rehype-prism-plus/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.
- */
-
+;// CONCATENATED MODULE: ../node_modules/hast-util-to-string/lib/index.js
 /**
- * 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 {import('hast').Nodes} Nodes
+ * @typedef {import('hast').Parents} Parents
  */
-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
-    }
-  )
 
 /**
- * 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`.
+ * Get the plain-text value of a hast node.
  *
- * @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 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)
-      }
-
-      if (typeof test === 'function') {
-        return lib_castFactory(test)
-      }
-
-      throw new Error('Expected function, string, or object as test')
-    }
-  )
-
-/**
- * @param {Array<string | Props | TestFunctionAnything>} tests
- * @returns {AssertAnything}
+ * @param {Nodes} node
+ *   Node to serialize.
+ * @returns {string}
+ *   Serialized node.
  */
-function lib_anyFactory(tests) {
-  /** @type {Array<AssertAnything>} */
-  const checks = []
-  let index = -1
-
-  while (++index < tests.length) {
-    checks[index] = lib_convert(tests[index])
+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)
   }
 
-  return 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
-  }
+  // “Context object’s data.”
+  return 'value' in node ? node.value : ''
 }
 
 /**
- * Turn an object into a test for a node with a certain fields.
- *
- * @param {Props} check
- * @returns {AssertAnything}
+ * @param {Nodes} node
+ *   Node.
+ * @returns {string}
+ *   Serialized node.
  */
-function lib_propsFactory(check) {
-  return 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
+function hast_util_to_string_lib_one(node) {
+  if (node.type === 'text') {
+    return node.value
   }
-}
-
-/**
- * Turn a string into a test for a node with a certain type.
- *
- * @param {string} check
- * @returns {AssertAnything}
- */
-function lib_typeFactory(check) {
-  return lib_castFactory(type)
 
-  /**
-   * @param {Node} node
-   */
-  function type(node) {
-    return node && node.type === check
-  }
+  return 'children' in node ? hast_util_to_string_lib_all(node) : ''
 }
 
 /**
- * Turn a custom test into a test for a node that passes that test.
- *
- * @param {TestFunctionAnything} check
- * @returns {AssertAnything}
+ * @param {Parents} node
+ *   Node.
+ * @returns {string}
+ *   Serialized node.
  */
-function lib_castFactory(check) {
-  return assertion
+function hast_util_to_string_lib_all(node) {
+  let index = -1
+  /** @type {Array<string>} */
+  const result = []
 
-  /**
-   * @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))
-    )
+  while (++index < node.children.length) {
+    result[index] = hast_util_to_string_lib_one(node.children[index])
   }
-}
-
-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
+  return result.join('')
 }
 
-;// CONCATENATED MODULE: ../node_modules/rehype-prism-plus/node_modules/unist-util-visit-parents/lib/index.js
+;// 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 {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]`.
+ * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test
+ *   Test from `unist-util-is`.
  *
- *   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.
+ *   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.
  */
 
 /**
- * @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`.
+ * @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 unist_util_filter_lib_own = {}.hasOwnProperty
 
 /**
- * Continue traversing as normal.
- */
-const lib_CONTINUE = true
-
-/**
- * Stop traversing immediately.
- */
-const lib_EXIT = false
-
-/**
- * Do not traverse this node’s children.
- */
-const lib_SKIP = 'skip'
-
-/**
- * Visit nodes, with ancestral information.
+ * Create a new `tree` of copies of all nodes that pass `test`.
  *
- * This algorithm performs *depth-first* *tree traversal* in *preorder*
- * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).
+ * The tree is walked in *preorder* (NLR), visiting the node itself, then its
+ * head, etc.
  *
- * 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.
+ * @template {Node} Tree
+ * @template {Test} Check
  *
- * 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.
+ * @overload
+ * @param {Tree} tree
+ * @param {Options | null | undefined} options
+ * @param {Check} test
+ * @returns {import('./complex-types.js').Matches<Tree, Check>}
  *
- * You can change the tree.
- * See `Visitor` for more info.
+ * @overload
+ * @param {Tree} tree
+ * @param {Check} test
+ * @returns {import('./complex-types.js').Matches<Tree, Check>}
  *
- * @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.
+ * @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_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 + '>' : '')) + ')'
-          })
-        }
+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
 
-        return visit
+  return preorder(tree)
 
-        function visit() {
-          /** @type {ActionTuple} */
-          let result = []
-          /** @type {ActionTuple} */
-          let subresult
-          /** @type {number} */
-          let offset
-          /** @type {Array<Parent>} */
-          let grandparents
+  /**
+   * @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 = []
 
-          if (!test || is(node, index, parents[parents.length - 1] || null)) {
-            result = lib_toResult(visitor(node, parents))
+    if (!is(node, index, parentNode)) return undefined
 
-            if (result[0] === lib_EXIT) {
-              return result
-            }
-          }
+    if (lib_parent(node)) {
+      let childIndex = -1
 
-          // @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)
+      while (++childIndex < node.children.length) {
+        const result = preorder(node.children[childIndex], childIndex, 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 (result) {
+          children.push(result)
+        }
+      }
 
-              if (subresult[0] === lib_EXIT) {
-                return subresult
-              }
+      if (cascade && node.children.length > 0 && children.length === 0) {
+        return undefined
+      }
+    }
 
-              offset =
-                typeof subresult[1] === 'number' ? subresult[1] : offset + step
-            }
-          }
+    // 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
 
-          return result
-        }
+    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]
       }
     }
-  )
-
-/**
- * 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 next
   }
-
-  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
+ * @param {Node} node
+ * @returns {node is Parent}
  */
-
-/**
- * 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
-      }
-    }
-  )
+function lib_parent(node) {
+  return 'children' in node && node.children !== undefined
+}
 
 // EXTERNAL MODULE: ../node_modules/parse-numeric-range/index.js
 var parse_numeric_range = __webpack_require__(324);
@@ -69735,7 +69130,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
@@ -70096,15 +69491,20 @@ var cssSyntaxDefinitions = {
 
 ;// CONCATENATED MODULE: ../node_modules/css-selector-parser/dist/mjs/utils.js
 function isIdentStart(c) {
-    return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c === '-' || c === '_' || c === '\\';
+    return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c === '-' || c === '_' || c === '\\' || c >= '\u00a0';
 }
 function isIdent(c) {
-    return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9') || c === '-' || c === '_';
+    return ((c >= 'a' && c <= 'z') ||
+        (c >= 'A' && c <= 'Z') ||
+        (c >= '0' && c <= '9') ||
+        c === '-' ||
+        c === '_' ||
+        c >= '\u00a0');
 }
 function isHex(c) {
     return (c >= 'a' && c <= 'f') || (c >= 'A' && c <= 'F') || (c >= '0' && c <= '9');
 }
-var identSpecialChars = {
+var identEscapeChars = {
     '!': true,
     '"': true,
     '#': true,
@@ -70135,19 +69535,12 @@ var identSpecialChars = {
     '}': true,
     '~': true
 };
-var strReplacementsRev = {
-    '\n': '\\n',
-    '\r': '\\r',
-    '\t': '\\t',
-    '\f': '\\f',
-    '\v': '\\v'
-};
-var stringEscapeChars = {
-    n: '\n',
-    r: '\r',
-    t: '\t',
-    f: '\f',
-    '\\': '\\'
+var stringRenderEscapeChars = {
+    '\n': true,
+    '\r': true,
+    '\t': true,
+    '\f': true,
+    '\v': true
 };
 var whitespaceChars = {
     ' ': true,
@@ -70172,21 +69565,25 @@ var digitsChars = {
     8: true,
     9: true
 };
+var maxHexLength = 6;
 function utils_escapeIdentifier(s) {
     var len = s.length;
     var result = '';
     var i = 0;
     while (i < len) {
         var chr = s.charAt(i);
-        if (identSpecialChars[chr]) {
+        if (identEscapeChars[chr] || (chr === '-' && i === 1 && s.charAt(0) === '-')) {
             result += '\\' + chr;
         }
         else {
-            if (!(chr === '_' ||
-                chr === '-' ||
+            if (chr === '-' ||
+                chr === '_' ||
                 (chr >= 'A' && chr <= 'Z') ||
                 (chr >= 'a' && chr <= 'z') ||
-                (i !== 0 && chr >= '0' && chr <= '9'))) {
+                (chr >= '0' && chr <= '9' && i !== 0 && !(i === 1 && s.charAt(0) === '-'))) {
+                result += chr;
+            }
+            else {
                 var charCode = chr.charCodeAt(0);
                 if ((charCode & 0xf800) === 0xd800) {
                     var extraCharCode = s.charCodeAt(i++);
@@ -70197,19 +69594,15 @@ function utils_escapeIdentifier(s) {
                 }
                 result += '\\' + charCode.toString(16) + ' ';
             }
-            else {
-                result += chr;
-            }
         }
         i++;
     }
     return result.trim();
 }
-function utils_escapeStr(s) {
+function utils_escapeString(s) {
     var len = s.length;
     var result = '';
     var i = 0;
-    var replacement;
     while (i < len) {
         var chr = s.charAt(i);
         if (chr === '"') {
@@ -70218,8 +69611,8 @@ function utils_escapeStr(s) {
         else if (chr === '\\') {
             chr = '\\\\';
         }
-        else if ((replacement = strReplacementsRev[chr]) !== undefined) {
-            chr = replacement;
+        else if (stringRenderEscapeChars[chr]) {
+            chr = '\\' + chr.charCodeAt(0).toString(16) + (i === len - 1 ? '' : ' ');
         }
         result += chr;
         i++;
@@ -70360,16 +69753,22 @@ function createParser(options) {
             }
         }
     }
+    /**
+     * @see https://www.w3.org/TR/css-syntax/#hex-digit-diagram
+     */
     function parseHex() {
         var hex = readAndNext();
-        while (isHex(chr)) {
+        var count = 1;
+        while (isHex(chr) && count < maxHexLength) {
             hex += readAndNext();
+            count++;
         }
-        if (is(' ')) {
-            next();
-        }
+        skipSingleWhitespace();
         return String.fromCharCode(parseInt(hex, 16));
     }
+    /**
+     * @see https://www.w3.org/TR/css-syntax/#string-token-diagram
+     */
     function parseString(quote) {
         var result = '';
         pass(quote);
@@ -70380,33 +69779,53 @@ function createParser(options) {
             }
             else if (is('\\')) {
                 next();
-                var esc = void 0;
                 if (is(quote)) {
                     result += quote;
+                    next();
                 }
-                else if ((esc = stringEscapeChars[chr]) !== undefined) {
-                    result += esc;
+                else if (chr === '\n' || chr === '\f') {
+                    next();
+                }
+                else if (chr === '\r') {
+                    next();
+                    if (is('\n')) {
+                        next();
+                    }
                 }
                 else if (isHex(chr)) {
                     result += parseHex();
-                    continue;
                 }
                 else {
                     result += chr;
+                    next();
                 }
             }
             else {
                 result += chr;
+                next();
             }
-            next();
         }
         return result;
     }
+    /**
+     * @see https://www.w3.org/TR/css-syntax/#ident-token-diagram
+     */
     function parseIdentifier() {
         if (!isIdentStart(chr)) {
             return null;
         }
         var result = '';
+        while (is('-')) {
+            result += chr;
+            next();
+        }
+        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.');
+        }
+        if (digitsChars[chr]) {
+            fail('Identifiers cannot start with hyphens followed by digits.');
+        }
         while (pos < l) {
             if (isIdent(chr)) {
                 result += readAndNext();
@@ -70422,7 +69841,7 @@ function createParser(options) {
                 }
             }
             else {
-                return result;
+                break;
             }
         }
         return result;
@@ -70452,6 +69871,18 @@ function createParser(options) {
         }
         return result.trim();
     }
+    function skipSingleWhitespace() {
+        if (chr === ' ' || chr === '\t' || chr === '\f' || chr === '\n') {
+            next();
+            return;
+        }
+        if (chr === '\r') {
+            next();
+        }
+        if (chr === '\n') {
+            next();
+        }
+    }
     function skipWhitespace() {
         while (whitespaceChars[chr]) {
             next();
@@ -71012,7 +70443,7 @@ function render(entity) {
         if (operator && value) {
             result += operator;
             if (value.type === 'String') {
-                result += escapeStr(value.value);
+                result += escapeString(value.value);
             }
             else if (value.type === 'Substitution') {
                 result += renderSubstitution(value);
@@ -71168,63 +70599,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
@@ -73918,11 +73292,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`')
@@ -73935,7 +73309,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
@@ -73944,7 +73318,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}
@@ -73968,7 +73342,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
@@ -73985,7 +73359,7 @@ function tagNameFactory(check) {
  * @param {TestFunction} testFunction
  * @returns {Check}
  */
-function hast_util_is_element_lib_castFactory(testFunction) {
+function lib_castFactory(testFunction) {
   return check
 
   /**
@@ -74247,7 +73621,7 @@ function rehypeAutolinkHeadings(options) {
  */
 function clone(thing) {
   // Cast because it’s mutable now.
-  return /** @type {Cloneable<T>} */ (esm(thing))
+  return /** @type {Cloneable<T>} */ (structured_clone_esm(thing))
 }
 
 /**
@@ -76788,7 +76162,7 @@ function raw_raw(node, index, parent, state) {
  * @returns {string}
  *   Serialized node.
  */
-function handle_root_root(node, _1, _2, state) {
+function lib_handle_root_root(node, _1, _2, state) {
   return state.all(node)
 }
 
@@ -76814,7 +76188,7 @@ function handle_root_root(node, _1, _2, state) {
 const handle_handle = zwitch('type', {
   invalid,
   unknown: handle_unknown,
-  handlers: {comment: comment_comment, doctype: doctype_doctype, element: element_element, raw: raw_raw, root: handle_root_root, text: lib_handle_text_text}
+  handlers: {comment: comment_comment, doctype: doctype_doctype, element: element_element, raw: raw_raw, root: lib_handle_root_root, text: lib_handle_text_text}
 })
 
 /**
@@ -77197,7 +76571,7 @@ function _defineProperties(target, props) {
     descriptor.enumerable = descriptor.enumerable || false;
     descriptor.configurable = true;
     if ("value" in descriptor) descriptor.writable = true;
-    Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor);
+    Object.defineProperty(target, toPropertyKey(descriptor.key), descriptor);
   }
 }
 function _createClass(Constructor, protoProps, staticProps) {