@quartz-community/remark-obsidian 0.2.1 → 0.2.3

package/dist/index.js

@@ -784,12 +784,15 @@ function tokenizeFlow(effects, ok3, nok) {
     return afterOpen;
   }
   function afterOpen(code) {
-    if (code === null) return nok(code);
+    if (code === null) {
+      effects.exit("comment");
+      return ok3(code);
+    }
     if (isLineEnding3(code)) {
       return effects.attempt(
         nonLazyContinuation,
         beforeContentChunk,
-        abandon
+        afterLazy
       )(code);
     }
     effects.enter("commentContent");
@@ -797,13 +800,14 @@ function tokenizeFlow(effects, ok3, nok) {
   }
   function beforeContentChunk(code) {
     if (code === null) {
-      return abandon(code);
+      effects.exit("comment");
+      return ok3(code);
     }
     if (isLineEnding3(code)) {
       return effects.attempt(
         nonLazyContinuation,
         beforeContentChunk,
-        abandon
+        afterLazy
       )(code);
     }
     if (code === PERCENT) {
@@ -818,7 +822,11 @@ function tokenizeFlow(effects, ok3, nok) {
     return contentChunk;
   }
   function contentChunk(code) {
-    if (code === null) return abandon(code);
+    if (code === null) {
+      effects.exit("commentContent");
+      effects.exit("comment");
+      return ok3(code);
+    }
     if (code === PERCENT) {
       return effects.attempt(flowClose, closeAfter, contentConsume)(code);
     }
@@ -827,14 +835,18 @@ function tokenizeFlow(effects, ok3, nok) {
       return effects.attempt(
         nonLazyContinuation,
         beforeContentChunk,
-        abandon
+        afterLazy
       )(code);
     }
     effects.consume(code);
     return contentChunk;
   }
   function contentConsume(code) {
-    if (code === null) return abandon(code);
+    if (code === null) {
+      effects.exit("commentContent");
+      effects.exit("comment");
+      return ok3(code);
+    }
     effects.consume(code);
     return contentChunk;
   }
@@ -842,9 +854,9 @@ function tokenizeFlow(effects, ok3, nok) {
     effects.exit("comment");
     return ok3(code);
   }
-  function abandon(code) {
+  function afterLazy(code) {
     effects.exit("comment");
-    return nok(code);
+    return ok3(code);
   }
   function tokenizeFlowClose(closeEffects, closeOk, closeNok) {
     let inContent = false;

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../node_modules/unist-util-is/lib/index.js","../node_modules/unist-util-visit-parents/lib/color.node.js","../node_modules/unist-util-visit-parents/lib/index.js","../node_modules/unist-util-visit/lib/index.js","../node_modules/micromark-util-symbol/lib/codes.js","../src/lib/syntax/wikilink.ts","../src/lib/syntax/highlight.ts","../src/lib/syntax/comment.ts","../src/lib/syntax/tag.ts","../src/lib/mdast/wikilink.ts","../src/lib/mdast/highlight.ts","../src/lib/mdast/comment.ts","../src/lib/mdast/tag.ts","../src/lib/mdast/wikilink-to-markdown.ts","../src/lib/mdast/highlight-to-markdown.ts","../src/lib/mdast/comment-to-markdown.ts","../src/lib/mdast/tag-to-markdown.ts","../src/lib/task-char.ts","../node_modules/micromark-util-character/index.js","../node_modules/micromark-factory-space/index.js","../node_modules/micromark-extension-math/lib/math-flow.js","../node_modules/micromark-extension-math/lib/math-text.js","../node_modules/micromark-extension-math/lib/syntax.js","../node_modules/devlop/lib/default.js","../node_modules/longest-streak/index.js","../node_modules/mdast-util-math/lib/index.js","../src/index.ts"],"sourcesContent":["/**\n * @import {Node, Parent} from 'unist'\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | ReadonlyArray<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends ReadonlyArray<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends Array<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test)\n          ? anyFactory(test)\n          : // Cast because `ReadonlyArray` goes into the above but `isArray`\n            // narrows to `Array`.\n            propertiesFactory(/** @type {Props} */ (test))\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propertiesFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n","/**\n * @param {string} d\n * @returns {string}\n */\nexport function color(d) {\n  return '\\u001B[33m' + d + '\\u001B[39m'\n}\n","/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<infer T>\n *   ? MatchesOne<Value, T>\n *   : Check extends Array<infer T>\n *   ? MatchesOne<Value, T>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {InternalAncestor<InclusiveDescendant<Tree>, Child>} Ancestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {'skip' | boolean} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<VisitedParents>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [VisitedParents=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Matches<InclusiveDescendant<Tree>, Check>, Ancestor<Tree, Matches<InclusiveDescendant<Tree>, Check>>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Tree type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from 'unist-util-visit-parents/do-not-use-color'\n\n/** @type {Readonly<ActionTuple>} */\nconst empty = []\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} test\n *   `unist-util-is`-compatible test\n * @param {Visitor | boolean | null | undefined} [visitor]\n *   Handle each node.\n * @param {boolean | null | undefined} [reverse]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visitParents(tree, test, visitor, reverse) {\n  /** @type {Test} */\n  let check\n\n  if (typeof test === 'function' && typeof visitor !== 'function') {\n    reverse = visitor\n    // @ts-expect-error no visitor given, so `visitor` is test.\n    visitor = test\n  } else {\n    // @ts-expect-error visitor given, so `test` isn’t a visitor.\n    check = test\n  }\n\n  const is = convert(check)\n  const step = reverse ? -1 : 1\n\n  factory(tree, undefined, [])()\n\n  /**\n   * @param {UnistNode} node\n   * @param {number | undefined} index\n   * @param {Array<UnistParent>} parents\n   */\n  function factory(node, index, parents) {\n    const value = /** @type {Record<string, unknown>} */ (\n      node && typeof node === 'object' ? node : {}\n    )\n\n    if (typeof value.type === 'string') {\n      const name =\n        // `hast`\n        typeof value.tagName === 'string'\n          ? value.tagName\n          : // `xast`\n            typeof value.name === 'string'\n            ? value.name\n            : undefined\n\n      Object.defineProperty(visit, 'name', {\n        value:\n          'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n      })\n    }\n\n    return visit\n\n    function visit() {\n      /** @type {Readonly<ActionTuple>} */\n      let result = empty\n      /** @type {Readonly<ActionTuple>} */\n      let subresult\n      /** @type {number} */\n      let offset\n      /** @type {Array<UnistParent>} */\n      let grandparents\n\n      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {\n        // @ts-expect-error: `visitor` is now a visitor.\n        result = toResult(visitor(node, parents))\n\n        if (result[0] === EXIT) {\n          return result\n        }\n      }\n\n      if ('children' in node && node.children) {\n        const nodeAsParent = /** @type {UnistParent} */ (node)\n\n        if (nodeAsParent.children && result[0] !== SKIP) {\n          offset = (reverse ? nodeAsParent.children.length : -1) + step\n          grandparents = parents.concat(nodeAsParent)\n\n          while (offset > -1 && offset < nodeAsParent.children.length) {\n            const child = nodeAsParent.children[offset]\n\n            subresult = factory(child, offset, grandparents)()\n\n            if (subresult[0] === EXIT) {\n              return subresult\n            }\n\n            offset =\n              typeof subresult[1] === 'number' ? subresult[1] : offset + step\n          }\n        }\n      }\n\n      return result\n    }\n  }\n}\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {Readonly<ActionTuple>}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return value === null || value === undefined ? empty : [value]\n}\n","/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n * @import {VisitorResult} from 'unist-util-visit-parents'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n// To do: use types from `unist-util-visit-parents` when it’s released.\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<any>\n *   ? MatchesOne<Value, Check[number]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends UnistNode ? number | undefined : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends UnistParent ? Ancestor | undefined : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [Ancestor=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Visited, Parent<Ancestor, Visited>>} BuildVisitorFromMatch\n *   Build a typed `Visitor` function from a node and all possible parents.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Visited\n *   Node type.\n * @template {UnistParent} Ancestor\n *   Parent type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     Matches<Descendant, Check>,\n *     Extract<Descendant, UnistParent>\n *   >\n * )} BuildVisitorFromDescendants\n *   Build a typed `Visitor` function from a list of descendants and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Node type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} testOrVisitor\n *   `unist-util-is`-compatible test (optional, omit to pass a visitor).\n * @param {Visitor | boolean | null | undefined} [visitorOrReverse]\n *   Handle each node (when test is omitted, pass `reverse`).\n * @param {boolean | null | undefined} [maybeReverse=false]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visit(tree, testOrVisitor, visitorOrReverse, maybeReverse) {\n  /** @type {boolean | null | undefined} */\n  let reverse\n  /** @type {Test} */\n  let test\n  /** @type {Visitor} */\n  let visitor\n\n  if (\n    typeof testOrVisitor === 'function' &&\n    typeof visitorOrReverse !== 'function'\n  ) {\n    test = undefined\n    visitor = testOrVisitor\n    reverse = visitorOrReverse\n  } else {\n    // @ts-expect-error: assume the overload with test was given.\n    test = testOrVisitor\n    // @ts-expect-error: assume the overload with test was given.\n    visitor = visitorOrReverse\n    reverse = maybeReverse\n  }\n\n  visitParents(tree, test, overload, reverse)\n\n  /**\n   * @param {UnistNode} node\n   * @param {Array<UnistParent>} parents\n   */\n  function overload(node, parents) {\n    const parent = parents[parents.length - 1]\n    const index = parent ? parent.children.indexOf(node) : undefined\n    return visitor(node, index, parent)\n  }\n}\n","/**\n * Character codes.\n *\n * This module is compiled away!\n *\n * micromark works based on character codes.\n * This module contains constants for the ASCII block and the replacement\n * character.\n * A couple of them are handled in a special way, such as the line endings\n * (CR, LF, and CR+LF, commonly known as end-of-line: EOLs), the tab (horizontal\n * tab) and its expansion based on what column it’s at (virtual space),\n * and the end-of-file (eof) character.\n * As values are preprocessed before handling them, the actual characters LF,\n * CR, HT, and NUL (which is present as the replacement character), are\n * guaranteed to not exist.\n *\n * Unicode basic latin block.\n */\nexport const codes = /** @type {const} */ ({\n  carriageReturn: -5,\n  lineFeed: -4,\n  carriageReturnLineFeed: -3,\n  horizontalTab: -2,\n  virtualSpace: -1,\n  eof: null,\n  nul: 0,\n  soh: 1,\n  stx: 2,\n  etx: 3,\n  eot: 4,\n  enq: 5,\n  ack: 6,\n  bel: 7,\n  bs: 8,\n  ht: 9, // `\\t`\n  lf: 10, // `\\n`\n  vt: 11, // `\\v`\n  ff: 12, // `\\f`\n  cr: 13, // `\\r`\n  so: 14,\n  si: 15,\n  dle: 16,\n  dc1: 17,\n  dc2: 18,\n  dc3: 19,\n  dc4: 20,\n  nak: 21,\n  syn: 22,\n  etb: 23,\n  can: 24,\n  em: 25,\n  sub: 26,\n  esc: 27,\n  fs: 28,\n  gs: 29,\n  rs: 30,\n  us: 31,\n  space: 32,\n  exclamationMark: 33, // `!`\n  quotationMark: 34, // `\"`\n  numberSign: 35, // `#`\n  dollarSign: 36, // `$`\n  percentSign: 37, // `%`\n  ampersand: 38, // `&`\n  apostrophe: 39, // `'`\n  leftParenthesis: 40, // `(`\n  rightParenthesis: 41, // `)`\n  asterisk: 42, // `*`\n  plusSign: 43, // `+`\n  comma: 44, // `,`\n  dash: 45, // `-`\n  dot: 46, // `.`\n  slash: 47, // `/`\n  digit0: 48, // `0`\n  digit1: 49, // `1`\n  digit2: 50, // `2`\n  digit3: 51, // `3`\n  digit4: 52, // `4`\n  digit5: 53, // `5`\n  digit6: 54, // `6`\n  digit7: 55, // `7`\n  digit8: 56, // `8`\n  digit9: 57, // `9`\n  colon: 58, // `:`\n  semicolon: 59, // `;`\n  lessThan: 60, // `<`\n  equalsTo: 61, // `=`\n  greaterThan: 62, // `>`\n  questionMark: 63, // `?`\n  atSign: 64, // `@`\n  uppercaseA: 65, // `A`\n  uppercaseB: 66, // `B`\n  uppercaseC: 67, // `C`\n  uppercaseD: 68, // `D`\n  uppercaseE: 69, // `E`\n  uppercaseF: 70, // `F`\n  uppercaseG: 71, // `G`\n  uppercaseH: 72, // `H`\n  uppercaseI: 73, // `I`\n  uppercaseJ: 74, // `J`\n  uppercaseK: 75, // `K`\n  uppercaseL: 76, // `L`\n  uppercaseM: 77, // `M`\n  uppercaseN: 78, // `N`\n  uppercaseO: 79, // `O`\n  uppercaseP: 80, // `P`\n  uppercaseQ: 81, // `Q`\n  uppercaseR: 82, // `R`\n  uppercaseS: 83, // `S`\n  uppercaseT: 84, // `T`\n  uppercaseU: 85, // `U`\n  uppercaseV: 86, // `V`\n  uppercaseW: 87, // `W`\n  uppercaseX: 88, // `X`\n  uppercaseY: 89, // `Y`\n  uppercaseZ: 90, // `Z`\n  leftSquareBracket: 91, // `[`\n  backslash: 92, // `\\`\n  rightSquareBracket: 93, // `]`\n  caret: 94, // `^`\n  underscore: 95, // `_`\n  graveAccent: 96, // `` ` ``\n  lowercaseA: 97, // `a`\n  lowercaseB: 98, // `b`\n  lowercaseC: 99, // `c`\n  lowercaseD: 100, // `d`\n  lowercaseE: 101, // `e`\n  lowercaseF: 102, // `f`\n  lowercaseG: 103, // `g`\n  lowercaseH: 104, // `h`\n  lowercaseI: 105, // `i`\n  lowercaseJ: 106, // `j`\n  lowercaseK: 107, // `k`\n  lowercaseL: 108, // `l`\n  lowercaseM: 109, // `m`\n  lowercaseN: 110, // `n`\n  lowercaseO: 111, // `o`\n  lowercaseP: 112, // `p`\n  lowercaseQ: 113, // `q`\n  lowercaseR: 114, // `r`\n  lowercaseS: 115, // `s`\n  lowercaseT: 116, // `t`\n  lowercaseU: 117, // `u`\n  lowercaseV: 118, // `v`\n  lowercaseW: 119, // `w`\n  lowercaseX: 120, // `x`\n  lowercaseY: 121, // `y`\n  lowercaseZ: 122, // `z`\n  leftCurlyBrace: 123, // `{`\n  verticalBar: 124, // `|`\n  rightCurlyBrace: 125, // `}`\n  tilde: 126, // `~`\n  del: 127,\n  // Unicode Specials block.\n  byteOrderMarker: 65_279,\n  // Unicode Specials block.\n  replacementCharacter: 65_533 // `�`\n})\n","import type {\n  Code,\n  Effects,\n  Extension,\n  State,\n  TokenizeContext,\n} from \"micromark-util-types\";\nimport { codes } from \"micromark-util-symbol\";\n\nconst EXCLAMATION = 33;\nconst HASH = 35;\nconst LEFT_BRACKET = 91;\nconst BACKSLASH = 92;\nconst RIGHT_BRACKET = 93;\nconst PIPE = 124;\n\nfunction isLineEnding(code: Code): boolean {\n  return code === codes.lineFeed || code === codes.carriageReturn;\n}\n\nexport function wikilinkSyntax(): Extension {\n  return {\n    text: {\n      [LEFT_BRACKET]: { name: \"wikilink\", tokenize },\n      [EXCLAMATION]: { name: \"wikilink\", tokenize },\n    },\n  };\n}\n\nfunction tokenize(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  let hasPath = false;\n  let hasHeading = false;\n  let hasAlias = false;\n\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code === EXCLAMATION) {\n      effects.enter(\"wikilink\");\n      effects.enter(\"wikilinkEmbedMarker\");\n      effects.consume(code);\n      effects.exit(\"wikilinkEmbedMarker\");\n      return openFirst;\n    }\n\n    if (code === LEFT_BRACKET) {\n      effects.enter(\"wikilink\");\n      return openFirst(code);\n    }\n\n    return nok(code);\n  }\n\n  function openFirst(code: Code): State | undefined {\n    if (code !== LEFT_BRACKET) return nok(code);\n    effects.enter(\"wikilinkMarker\");\n    effects.consume(code);\n    return openSecond;\n  }\n\n  function openSecond(code: Code): State | undefined {\n    if (code !== LEFT_BRACKET) return nok(code);\n    effects.consume(code);\n    effects.exit(\"wikilinkMarker\");\n    return pathStart;\n  }\n\n  function pathStart(code: Code): State | undefined {\n    if (code === HASH) return headingMarker(code);\n    if (code === PIPE) return nok(code);\n    if (code === RIGHT_BRACKET || code === null || isLineEnding(code))\n      return nok(code);\n    effects.enter(\"wikilinkPath\");\n    hasPath = true;\n    return path(code);\n  }\n\n  function path(code: Code): State | undefined {\n    if (code === BACKSLASH) {\n      effects.consume(code);\n      return pathEscape;\n    }\n\n    if (code === HASH) {\n      effects.exit(\"wikilinkPath\");\n      return headingMarker(code);\n    }\n\n    if (code === PIPE) {\n      effects.exit(\"wikilinkPath\");\n      return aliasMarker(code);\n    }\n\n    if (code === RIGHT_BRACKET) {\n      effects.exit(\"wikilinkPath\");\n      return closeFirst(code);\n    }\n\n    if (code === null || isLineEnding(code)) return nok(code);\n\n    effects.consume(code);\n    return path;\n  }\n\n  function pathEscape(code: Code): State | undefined {\n    if (code === PIPE) {\n      effects.exit(\"wikilinkPath\");\n      return aliasMarker(code);\n    }\n    if (code === null || isLineEnding(code)) return nok(code);\n    effects.consume(code);\n    return path;\n  }\n\n  function headingMarker(code: Code): State | undefined {\n    if (code !== HASH) return nok(code);\n    effects.enter(\"wikilinkHeadingMarker\");\n    effects.consume(code);\n    effects.exit(\"wikilinkHeadingMarker\");\n    return headingStart;\n  }\n\n  function headingStart(code: Code): State | undefined {\n    if (code === null || isLineEnding(code)) return nok(code);\n\n    // Allow empty heading: [[page#]] or [[page#|alias]]\n    if (code === RIGHT_BRACKET) {\n      hasHeading = true;\n      return closeFirst(code);\n    }\n    if (code === PIPE) {\n      hasHeading = true;\n      return aliasMarker(code);\n    }\n\n    effects.enter(\"wikilinkHeading\");\n    hasHeading = true;\n    return heading(code);\n  }\n\n  function heading(code: Code): State | undefined {\n    if (code === BACKSLASH) {\n      effects.consume(code);\n      return headingEscape;\n    }\n\n    if (code === PIPE) {\n      effects.exit(\"wikilinkHeading\");\n      return aliasMarker(code);\n    }\n\n    if (code === RIGHT_BRACKET) {\n      effects.exit(\"wikilinkHeading\");\n      return closeFirst(code);\n    }\n\n    if (code === null || isLineEnding(code)) return nok(code);\n\n    effects.consume(code);\n    return heading;\n  }\n\n  function headingEscape(code: Code): State | undefined {\n    if (code === PIPE) {\n      effects.exit(\"wikilinkHeading\");\n      return aliasMarker(code);\n    }\n    if (code === null || isLineEnding(code)) return nok(code);\n    effects.consume(code);\n    return heading;\n  }\n\n  function aliasMarker(code: Code): State | undefined {\n    if (code !== PIPE) return nok(code);\n    effects.enter(\"wikilinkAliasMarker\");\n    effects.consume(code);\n    effects.exit(\"wikilinkAliasMarker\");\n    return aliasStart;\n  }\n\n  function aliasStart(code: Code): State | undefined {\n    if (code === RIGHT_BRACKET) return closeFirst(code);\n    if (code === null || isLineEnding(code)) return nok(code);\n    effects.enter(\"wikilinkAlias\");\n    hasAlias = true;\n    return alias(code);\n  }\n\n  function alias(code: Code): State | undefined {\n    if (code === RIGHT_BRACKET) {\n      effects.exit(\"wikilinkAlias\");\n      return closeFirst(code);\n    }\n\n    if (code === null || isLineEnding(code)) return nok(code);\n\n    effects.consume(code);\n    return alias;\n  }\n\n  function closeFirst(code: Code): State | undefined {\n    if (code !== RIGHT_BRACKET) return nok(code);\n    if (!hasPath && !hasHeading && !hasAlias) return nok(code);\n    effects.enter(\"wikilinkMarker\");\n    effects.consume(code);\n    return closeSecond;\n  }\n\n  function closeSecond(code: Code): State | undefined {\n    if (code !== RIGHT_BRACKET) return nok(code);\n    effects.consume(code);\n    effects.exit(\"wikilinkMarker\");\n    effects.exit(\"wikilink\");\n    return ok;\n  }\n}\n","import type {\n  Code,\n  Construct,\n  Effects,\n  Extension,\n  State,\n  TokenizeContext,\n} from \"micromark-util-types\";\nimport { codes } from \"micromark-util-symbol\";\n\nconst EQUALS = 61;\n\nfunction isLineEnding(code: Code): boolean {\n  return code === codes.lineFeed || code === codes.carriageReturn;\n}\n\nexport function highlightSyntax(): Extension {\n  return {\n    text: {\n      [EQUALS]: { name: \"highlight\", tokenize },\n    },\n  };\n}\n\nfunction tokenize(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  const close: Construct = { tokenize: tokenizeClose, partial: true };\n  let hasContent = false;\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code !== EQUALS) return nok(code);\n    effects.enter(\"highlight\");\n    effects.enter(\"highlightMarker\");\n    effects.consume(code);\n    return openSecond;\n  }\n\n  function openSecond(code: Code): State | undefined {\n    if (code !== EQUALS) return nok(code);\n    effects.consume(code);\n    effects.exit(\"highlightMarker\");\n    effects.enter(\"highlightContent\");\n    return content;\n  }\n\n  function content(code: Code): State | undefined {\n    if (code === null || isLineEnding(code)) return nok(code);\n    if (!hasContent && code === EQUALS) return nok(code);\n    if (code === EQUALS)\n      return effects.attempt(close, closeAfter, contentConsume)(code);\n    effects.consume(code);\n    hasContent = true;\n    return content;\n  }\n\n  function contentConsume(code: Code): State | undefined {\n    if (code === null || isLineEnding(code)) return nok(code);\n    effects.consume(code);\n    return content;\n  }\n\n  function tokenizeClose(\n    this: TokenizeContext,\n    closeEffects: Effects,\n    closeOk: State,\n    closeNok: State,\n  ): State {\n    return closeStart;\n\n    function closeStart(closeCode: Code): State | undefined {\n      if (closeCode !== EQUALS) return closeNok(closeCode);\n      closeEffects.exit(\"highlightContent\");\n      closeEffects.enter(\"highlightMarker\");\n      closeEffects.consume(closeCode);\n      return closeSecond;\n    }\n\n    function closeSecond(closeCode: Code): State | undefined {\n      if (closeCode !== EQUALS) return closeNok(closeCode);\n      closeEffects.consume(closeCode);\n      closeEffects.exit(\"highlightMarker\");\n      return closeOk;\n    }\n  }\n\n  function closeAfter(code: Code): State | undefined {\n    effects.exit(\"highlight\");\n    return ok(code);\n  }\n}\n","import type {\n  Code,\n  Construct,\n  Effects,\n  Extension,\n  State,\n  TokenizeContext,\n} from \"micromark-util-types\";\n\nconst PERCENT = 37;\nconst LINE_FEED = -4;\nconst CARRIAGE_RETURN = -3;\nconst CARRIAGE_RETURN_LINE_FEED = -5;\n\nfunction isLineEnding(code: Code): code is number {\n  return (\n    code === LINE_FEED ||\n    code === CARRIAGE_RETURN ||\n    code === CARRIAGE_RETURN_LINE_FEED\n  );\n}\n\nconst commentFlow: Construct = {\n  tokenize: tokenizeFlow,\n  concrete: true,\n  name: \"commentFlow\",\n};\n\nconst nonLazyContinuation: Construct = {\n  tokenize: tokenizeNonLazyContinuation,\n  partial: true,\n};\n\nexport function commentSyntax(): Extension {\n  return {\n    text: {\n      [PERCENT]: { name: \"comment\", tokenize: tokenizeText },\n    },\n    flow: {\n      [PERCENT]: commentFlow,\n    },\n  };\n}\n\nfunction tokenizeText(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  const close: Construct = { tokenize: tokenizeClose, partial: true };\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code !== PERCENT) return nok(code);\n    effects.enter(\"comment\");\n    effects.enter(\"commentMarker\");\n    effects.consume(code);\n    return openSecond;\n  }\n\n  function openSecond(code: Code): State | undefined {\n    if (code !== PERCENT) return nok(code);\n    effects.consume(code);\n    effects.exit(\"commentMarker\");\n    effects.enter(\"commentContent\");\n    return content;\n  }\n\n  function content(code: Code): State | undefined {\n    if (code === null) return nok(code);\n    if (code === PERCENT)\n      return effects.attempt(close, closeAfter, contentConsume)(code);\n    effects.consume(code);\n    return content;\n  }\n\n  function contentConsume(code: Code): State | undefined {\n    if (code === null) return nok(code);\n    effects.consume(code);\n    return content;\n  }\n\n  function tokenizeClose(\n    this: TokenizeContext,\n    closeEffects: Effects,\n    closeOk: State,\n    closeNok: State,\n  ): State {\n    return closeStart;\n\n    function closeStart(closeCode: Code): State | undefined {\n      if (closeCode !== PERCENT) return closeNok(closeCode);\n      closeEffects.exit(\"commentContent\");\n      closeEffects.enter(\"commentMarker\");\n      closeEffects.consume(closeCode);\n      return closeSecond;\n    }\n\n    function closeSecond(closeCode: Code): State | undefined {\n      if (closeCode !== PERCENT) return closeNok(closeCode);\n      closeEffects.consume(closeCode);\n      closeEffects.exit(\"commentMarker\");\n      return closeOk;\n    }\n  }\n\n  function closeAfter(code: Code): State | undefined {\n    effects.exit(\"comment\");\n    return ok(code);\n  }\n}\n\nfunction tokenizeFlow(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  const self = this;\n  const flowClose: Construct = {\n    tokenize: tokenizeFlowClose,\n    partial: true,\n  };\n\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code !== PERCENT) return nok(code);\n    effects.enter(\"comment\");\n    effects.enter(\"commentMarker\");\n    effects.consume(code);\n    return openSecond;\n  }\n\n  function openSecond(code: Code): State | undefined {\n    if (code !== PERCENT) return nok(code);\n    effects.consume(code);\n    effects.exit(\"commentMarker\");\n    return afterOpen;\n  }\n\n  function afterOpen(code: Code): State | undefined {\n    if (code === null) return nok(code);\n\n    if (isLineEnding(code)) {\n      return effects.attempt(\n        nonLazyContinuation,\n        beforeContentChunk,\n        abandon,\n      )(code);\n    }\n\n    effects.enter(\"commentContent\");\n    return contentChunk(code);\n  }\n\n  function beforeContentChunk(code: Code): State | undefined {\n    if (code === null) {\n      return abandon(code);\n    }\n\n    if (isLineEnding(code)) {\n      return effects.attempt(\n        nonLazyContinuation,\n        beforeContentChunk,\n        abandon,\n      )(code);\n    }\n\n    if (code === PERCENT) {\n      return effects.attempt(flowClose, closeAfter, startContent)(code);\n    }\n\n    effects.enter(\"commentContent\");\n    return contentChunk(code);\n  }\n\n  function startContent(code: Code): State | undefined {\n    effects.enter(\"commentContent\");\n    effects.consume(code);\n    return contentChunk;\n  }\n\n  function contentChunk(code: Code): State | undefined {\n    if (code === null) return abandon(code);\n\n    if (code === PERCENT) {\n      return effects.attempt(flowClose, closeAfter, contentConsume)(code);\n    }\n\n    if (isLineEnding(code)) {\n      effects.exit(\"commentContent\");\n      return effects.attempt(\n        nonLazyContinuation,\n        beforeContentChunk,\n        abandon,\n      )(code);\n    }\n\n    effects.consume(code);\n    return contentChunk;\n  }\n\n  function contentConsume(code: Code): State | undefined {\n    if (code === null) return abandon(code);\n    effects.consume(code);\n    return contentChunk;\n  }\n\n  function closeAfter(code: Code): State | undefined {\n    effects.exit(\"comment\");\n    return ok(code);\n  }\n\n  function abandon(code: Code): State | undefined {\n    effects.exit(\"comment\");\n    return nok(code);\n  }\n\n  function tokenizeFlowClose(\n    this: TokenizeContext,\n    closeEffects: Effects,\n    closeOk: State,\n    closeNok: State,\n  ): State {\n    let inContent = false;\n    return closeStart;\n\n    function closeStart(closeCode: Code): State | undefined {\n      if (closeCode !== PERCENT) return closeNok(closeCode);\n      const current = self.events[self.events.length - 1];\n      if (\n        current &&\n        current[0] === \"enter\" &&\n        current[1].type === \"commentContent\"\n      ) {\n        closeEffects.exit(\"commentContent\");\n        inContent = true;\n      }\n      closeEffects.enter(\"commentMarker\");\n      closeEffects.consume(closeCode);\n      return closeSecond;\n    }\n\n    function closeSecond(closeCode: Code): State | undefined {\n      if (closeCode !== PERCENT) {\n        if (inContent) {\n          closeEffects.exit(\"commentMarker\");\n          closeEffects.enter(\"commentContent\");\n        }\n        return closeNok(closeCode);\n      }\n      closeEffects.consume(closeCode);\n      closeEffects.exit(\"commentMarker\");\n      return closeOk;\n    }\n  }\n}\n\nfunction tokenizeNonLazyContinuation(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  const self = this;\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code === null) {\n      return ok(code);\n    }\n    if (!isLineEnding(code)) return nok(code);\n    effects.enter(\"lineEnding\");\n    effects.consume(code);\n    effects.exit(\"lineEnding\");\n    return lineStart;\n  }\n\n  function lineStart(code: Code): State | undefined {\n    return self.parser.lazy[self.now().line] ? nok(code) : ok(code);\n  }\n}\n","import type {\n  Code,\n  Effects,\n  Extension,\n  State,\n  TokenizeContext,\n} from \"micromark-util-types\";\nimport { codes } from \"micromark-util-symbol\";\n\nconst HASH = 35;\nconst SLASH = 47;\nconst DASH = 45;\nconst UNDERSCORE = 95;\n\nconst tagCharRegex = /[\\p{L}\\p{M}\\p{Emoji}]/u;\n\nfunction isWhitespace(code: Code): boolean {\n  return (\n    code === codes.space ||\n    code === codes.horizontalTab ||\n    code === codes.lineFeed ||\n    code === codes.carriageReturn ||\n    code === codes.carriageReturnLineFeed\n  );\n}\n\nfunction isTagChar(code: Code): boolean {\n  if (code === null || code < 0) return false;\n  if (code >= 48 && code <= 57) return true;\n  if (code === DASH || code === UNDERSCORE) return true;\n  return tagCharRegex.test(String.fromCodePoint(code));\n}\n\nfunction isNonDigit(code: Code): boolean {\n  if (code === null) return false;\n  return !(code >= 48 && code <= 57);\n}\n\nexport function tagSyntax(): Extension {\n  return {\n    text: {\n      [HASH]: { name: \"tag\", tokenize },\n    },\n  };\n}\n\nfunction tokenize(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  let hasNonDigit = false;\n  const context = this;\n\n  return start;\n\n  function start(code: Code): State | undefined {\n    const previous = context.previous;\n    const allowedStart =\n      previous === null || isWhitespace(previous) || previous === HASH;\n    if (!allowedStart) return nok(code);\n    if (code !== HASH) return nok(code);\n    effects.enter(\"tag\");\n    effects.enter(\"tagMarker\");\n    effects.consume(code);\n    effects.exit(\"tagMarker\");\n    return tagStart;\n  }\n\n  function tagStart(code: Code): State | undefined {\n    if (!isTagChar(code)) return nok(code);\n    effects.enter(\"tagContent\");\n    if (isNonDigit(code)) hasNonDigit = true;\n    effects.consume(code);\n    return tagContent;\n  }\n\n  function tagContent(code: Code): State | undefined {\n    if (code === SLASH) {\n      effects.consume(code);\n      return afterSlash;\n    }\n\n    if (isTagChar(code)) {\n      if (isNonDigit(code)) hasNonDigit = true;\n      effects.consume(code);\n      return tagContent;\n    }\n\n    return end(code);\n  }\n\n  function afterSlash(code: Code): State | undefined {\n    if (!isTagChar(code)) return nok(code);\n    if (isNonDigit(code)) hasNonDigit = true;\n    effects.consume(code);\n    return tagContent;\n  }\n\n  function end(code: Code): State | undefined {\n    if (!hasNonDigit) return nok(code);\n    effects.exit(\"tagContent\");\n    effects.exit(\"tag\");\n    return ok(code);\n  }\n}\n","import type { Extension } from \"mdast-util-from-markdown\";\n\nexport function wikilinkFromMarkdown(): Extension {\n  return {\n    enter: {\n      wikilink(token) {\n        this.enter(\n          {\n            type: \"wikilink\",\n            value: \"\",\n            embedded: false,\n            path: \"\",\n            heading: \"\",\n            alias: \"\",\n          },\n          token,\n        );\n      },\n      wikilinkEmbedMarker() {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.embedded = true;\n      },\n      wikilinkPath(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.path = this.sliceSerialize(token).replace(/\\\\([#\\[\\]])/g, \"$1\");\n      },\n      wikilinkHeading(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.heading = this.sliceSerialize(token).replace(/\\\\([#\\[\\]])/g, \"$1\");\n      },\n      wikilinkAlias(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.alias = this.sliceSerialize(token);\n      },\n    },\n    exit: {\n      wikilink(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        if (node.alias) {\n          if (node.path.endsWith(\"\\\\\")) node.path = node.path.slice(0, -1);\n          if (node.heading.endsWith(\"\\\\\"))\n            node.heading = node.heading.slice(0, -1);\n        }\n        this.exit(token);\n      },\n    },\n  };\n}\n","import type { Extension } from \"mdast-util-from-markdown\";\n\nexport function highlightFromMarkdown(): Extension {\n  return {\n    enter: {\n      highlight(token) {\n        this.enter({ type: \"highlight\", children: [] }, token);\n      },\n    },\n    exit: {\n      highlightContent(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.children = [{ type: \"text\", value: this.sliceSerialize(token) }];\n      },\n      highlight(token) {\n        this.exit(token);\n      },\n    },\n  };\n}\n","import type { Extension } from \"mdast-util-from-markdown\";\n\nexport function commentFromMarkdown(): Extension {\n  return {\n    enter: {\n      comment(token) {\n        this.enter({ type: \"comment\", value: \"\" }, token);\n      },\n    },\n    exit: {\n      commentContent(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.value += this.sliceSerialize(token);\n      },\n      comment(token) {\n        this.exit(token);\n      },\n    },\n  };\n}\n","import type { Extension } from \"mdast-util-from-markdown\";\n\nexport function tagFromMarkdown(): Extension {\n  return {\n    enter: {\n      tag(token) {\n        this.enter({ type: \"tag\", value: \"\" }, token);\n      },\n      tagContent(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        if (node.type === \"tag\") node.value = this.sliceSerialize(token);\n      },\n    },\n    exit: {\n      tag(token) {\n        this.exit(token);\n      },\n    },\n  };\n}\n","import type { Options } from \"mdast-util-to-markdown\";\nimport type { Wikilink } from \"../types.js\";\n\nexport function wikilinkToMarkdown(): Options {\n  return {\n    handlers: {\n      wikilink(node: Wikilink) {\n        const prefix = node.embedded ? \"!\" : \"\";\n        const heading = node.heading ? `#${node.heading}` : \"\";\n        const alias = node.alias ? `|${node.alias}` : \"\";\n        return `${prefix}[[${node.path}${heading}${alias}]]`;\n      },\n    },\n  };\n}\n","import type { Options, State, Info } from \"mdast-util-to-markdown\";\nimport type { Parents } from \"mdast\";\nimport type { Highlight } from \"../types.js\";\n\nexport function highlightToMarkdown(): Options {\n  return {\n    handlers: {\n      highlight(\n        node: Highlight,\n        _parent: Parents | undefined,\n        state: State,\n        info: Info,\n      ) {\n        const exit = state.enter(\"highlight\" as any);\n        const content = state.containerPhrasing(node, info);\n        exit();\n        return `==${content}==`;\n      },\n    },\n  };\n}\n","import type { Options } from \"mdast-util-to-markdown\";\nimport type { Comment } from \"../types.js\";\n\nexport function commentToMarkdown(): Options {\n  return {\n    handlers: {\n      comment(node: Comment) {\n        return `%%${node.value}%%`;\n      },\n    },\n  };\n}\n","import type { Options } from \"mdast-util-to-markdown\";\nimport type { Tag } from \"../types.js\";\n\nexport function tagToMarkdown(): Options {\n  return {\n    handlers: {\n      tag(node: Tag) {\n        return `#${node.value}`;\n      },\n    },\n  };\n}\n","import type { Root } from \"mdast\";\nimport { visit } from \"unist-util-visit\";\n\nexport function customTaskCharTransform(tree: Root, source?: string) {\n  visit(tree, \"listItem\", (node: any) => {\n    if (typeof node.checked === \"boolean\") {\n      let char = node.checked ? \"x\" : \" \";\n\n      // Recover original character (e.g. \"X\" vs \"x\") from source\n      if (source && node.position?.start?.offset != null) {\n        const slice = source.slice(\n          node.position.start.offset,\n          node.position.start.offset + 20,\n        );\n        const m = slice.match(/\\[([^\\]])\\]/);\n        if (m) {\n          char = m[1];\n        }\n      }\n\n      node.data ??= {};\n      node.data.taskChar = char;\n      node.data.hProperties ??= {};\n      node.data.hProperties.dataTaskChar = char;\n      return;\n    }\n\n    const firstChild = node.children?.[0];\n    if (!firstChild || firstChild.type !== \"paragraph\") return;\n\n    const firstText = firstChild.children?.[0];\n    if (!firstText || firstText.type !== \"text\") return;\n\n    const match = firstText.value.match(/^\\[([^\\]])\\]\\s/);\n    if (!match) return;\n\n    const taskChar = match[1];\n\n    node.checked = taskChar !== \" \";\n    node.data ??= {};\n    node.data.taskChar = taskChar;\n    node.data.hProperties ??= {};\n    node.data.hProperties.dataTaskChar = taskChar;\n\n    firstText.value = firstText.value.slice(match[0].length);\n\n    if (firstText.value.length === 0) {\n      firstChild.children.shift();\n    } else if (\n      firstText.position &&\n      typeof firstText.position.start.offset === \"number\"\n    ) {\n      firstText.position.start.column += match[0].length;\n      firstText.position.start.offset += match[0].length;\n    }\n  });\n}\n","/**\n * @import {Code} from 'micromark-util-types'\n */\n\n/**\n * Check whether the character code represents an ASCII alpha (`a` through `z`,\n * case insensitive).\n *\n * An **ASCII alpha** is an ASCII upper alpha or ASCII lower alpha.\n *\n * An **ASCII upper alpha** is a character in the inclusive range U+0041 (`A`)\n * to U+005A (`Z`).\n *\n * An **ASCII lower alpha** is a character in the inclusive range U+0061 (`a`)\n * to U+007A (`z`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiAlpha = regexCheck(/[A-Za-z]/);\n\n/**\n * Check whether the character code represents an ASCII alphanumeric (`a`\n * through `z`, case insensitive, or `0` through `9`).\n *\n * An **ASCII alphanumeric** is an ASCII digit (see `asciiDigit`) or ASCII alpha\n * (see `asciiAlpha`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiAlphanumeric = regexCheck(/[\\dA-Za-z]/);\n\n/**\n * Check whether the character code represents an ASCII atext.\n *\n * atext is an ASCII alphanumeric (see `asciiAlphanumeric`), or a character in\n * the inclusive ranges U+0023 NUMBER SIGN (`#`) to U+0027 APOSTROPHE (`'`),\n * U+002A ASTERISK (`*`), U+002B PLUS SIGN (`+`), U+002D DASH (`-`), U+002F\n * SLASH (`/`), U+003D EQUALS TO (`=`), U+003F QUESTION MARK (`?`), U+005E\n * CARET (`^`) to U+0060 GRAVE ACCENT (`` ` ``), or U+007B LEFT CURLY BRACE\n * (`{`) to U+007E TILDE (`~`).\n *\n * See:\n * **\\[RFC5322]**:\n * [Internet Message Format](https://tools.ietf.org/html/rfc5322).\n * P. Resnick.\n * IETF.\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiAtext = regexCheck(/[#-'*+\\--9=?A-Z^-~]/);\n\n/**\n * Check whether a character code is an ASCII control character.\n *\n * An **ASCII control** is a character in the inclusive range U+0000 NULL (NUL)\n * to U+001F (US), or U+007F (DEL).\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function asciiControl(code) {\n  return (\n    // Special whitespace codes (which have negative values), C0 and Control\n    // character DEL\n    code !== null && (code < 32 || code === 127)\n  );\n}\n\n/**\n * Check whether the character code represents an ASCII digit (`0` through `9`).\n *\n * An **ASCII digit** is a character in the inclusive range U+0030 (`0`) to\n * U+0039 (`9`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiDigit = regexCheck(/\\d/);\n\n/**\n * Check whether the character code represents an ASCII hex digit (`a` through\n * `f`, case insensitive, or `0` through `9`).\n *\n * An **ASCII hex digit** is an ASCII digit (see `asciiDigit`), ASCII upper hex\n * digit, or an ASCII lower hex digit.\n *\n * An **ASCII upper hex digit** is a character in the inclusive range U+0041\n * (`A`) to U+0046 (`F`).\n *\n * An **ASCII lower hex digit** is a character in the inclusive range U+0061\n * (`a`) to U+0066 (`f`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiHexDigit = regexCheck(/[\\dA-Fa-f]/);\n\n/**\n * Check whether the character code represents ASCII punctuation.\n *\n * An **ASCII punctuation** is a character in the inclusive ranges U+0021\n * EXCLAMATION MARK (`!`) to U+002F SLASH (`/`), U+003A COLON (`:`) to U+0040 AT\n * SIGN (`@`), U+005B LEFT SQUARE BRACKET (`[`) to U+0060 GRAVE ACCENT\n * (`` ` ``), or U+007B LEFT CURLY BRACE (`{`) to U+007E TILDE (`~`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/);\n\n/**\n * Check whether a character code is a markdown line ending.\n *\n * A **markdown line ending** is the virtual characters M-0003 CARRIAGE RETURN\n * LINE FEED (CRLF), M-0004 LINE FEED (LF) and M-0005 CARRIAGE RETURN (CR).\n *\n * In micromark, the actual character U+000A LINE FEED (LF) and U+000D CARRIAGE\n * RETURN (CR) are replaced by these virtual characters depending on whether\n * they occurred together.\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function markdownLineEnding(code) {\n  return code !== null && code < -2;\n}\n\n/**\n * Check whether a character code is a markdown line ending (see\n * `markdownLineEnding`) or markdown space (see `markdownSpace`).\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function markdownLineEndingOrSpace(code) {\n  return code !== null && (code < 0 || code === 32);\n}\n\n/**\n * Check whether a character code is a markdown space.\n *\n * A **markdown space** is the concrete character U+0020 SPACE (SP) and the\n * virtual characters M-0001 VIRTUAL SPACE (VS) and M-0002 HORIZONTAL TAB (HT).\n *\n * In micromark, the actual character U+0009 CHARACTER TABULATION (HT) is\n * replaced by one M-0002 HORIZONTAL TAB (HT) and between 0 and 3 M-0001 VIRTUAL\n * SPACE (VS) characters, depending on the column at which the tab occurred.\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function markdownSpace(code) {\n  return code === -2 || code === -1 || code === 32;\n}\n\n// Size note: removing ASCII from the regex and using `asciiPunctuation` here\n// In fact adds to the bundle size.\n/**\n * Check whether the character code represents Unicode punctuation.\n *\n * A **Unicode punctuation** is a character in the Unicode `Pc` (Punctuation,\n * Connector), `Pd` (Punctuation, Dash), `Pe` (Punctuation, Close), `Pf`\n * (Punctuation, Final quote), `Pi` (Punctuation, Initial quote), `Po`\n * (Punctuation, Other), or `Ps` (Punctuation, Open) categories, or an ASCII\n * punctuation (see `asciiPunctuation`).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n *\n * @param code\n *   Code.\n * @returns\n *   Whether it matches.\n */\nexport const unicodePunctuation = regexCheck(/\\p{P}|\\p{S}/u);\n\n/**\n * Check whether the character code represents Unicode whitespace.\n *\n * Note that this does handle micromark specific markdown whitespace characters.\n * See `markdownLineEndingOrSpace` to check that.\n *\n * A **Unicode whitespace** is a character in the Unicode `Zs` (Separator,\n * Space) category, or U+0009 CHARACTER TABULATION (HT), U+000A LINE FEED (LF),\n * U+000C (FF), or U+000D CARRIAGE RETURN (CR) (**\\[UNICODE]**).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n *\n * @param code\n *   Code.\n * @returns\n *   Whether it matches.\n */\nexport const unicodeWhitespace = regexCheck(/\\s/);\n\n/**\n * Create a code check from a regex.\n *\n * @param {RegExp} regex\n *   Expression.\n * @returns {(code: Code) => boolean}\n *   Check.\n */\nfunction regexCheck(regex) {\n  return check;\n\n  /**\n   * Check whether a code matches the bound regex.\n   *\n   * @param {Code} code\n   *   Character code.\n   * @returns {boolean}\n   *   Whether the character code matches the bound regex.\n   */\n  function check(code) {\n    return code !== null && code > -1 && regex.test(String.fromCharCode(code));\n  }\n}","/**\n * @import {Effects, State, TokenType} from 'micromark-util-types'\n */\n\nimport { markdownSpace } from 'micromark-util-character';\n\n// To do: implement `spaceOrTab`, `spaceOrTabMinMax`, `spaceOrTabWithOptions`.\n\n/**\n * Parse spaces and tabs.\n *\n * There is no `nok` parameter:\n *\n * *   spaces in markdown are often optional, in which case this factory can be\n *     used and `ok` will be switched to whether spaces were found or not\n * *   one line ending or space can be detected with `markdownSpace(code)` right\n *     before using `factorySpace`\n *\n * ###### Examples\n *\n * Where `␉` represents a tab (plus how much it expands) and `␠` represents a\n * single space.\n *\n * ```markdown\n * ␉\n * ␠␠␠␠\n * ␉␠\n * ```\n *\n * @param {Effects} effects\n *   Context.\n * @param {State} ok\n *   State switched to when successful.\n * @param {TokenType} type\n *   Type (`' \\t'`).\n * @param {number | undefined} [max=Infinity]\n *   Max (exclusive).\n * @returns {State}\n *   Start state.\n */\nexport function factorySpace(effects, ok, type, max) {\n  const limit = max ? max - 1 : Number.POSITIVE_INFINITY;\n  let size = 0;\n  return start;\n\n  /** @type {State} */\n  function start(code) {\n    if (markdownSpace(code)) {\n      effects.enter(type);\n      return prefix(code);\n    }\n    return ok(code);\n  }\n\n  /** @type {State} */\n  function prefix(code) {\n    if (markdownSpace(code) && size++ < limit) {\n      effects.consume(code);\n      return prefix;\n    }\n    effects.exit(type);\n    return ok(code);\n  }\n}","/**\n * @import {Construct, State, TokenizeContext, Tokenizer} from 'micromark-util-types'\n */\n\nimport { factorySpace } from 'micromark-factory-space';\nimport { markdownLineEnding } from 'micromark-util-character';\n/** @type {Construct} */\nexport const mathFlow = {\n  tokenize: tokenizeMathFenced,\n  concrete: true,\n  name: 'mathFlow'\n};\n\n/** @type {Construct} */\nconst nonLazyContinuation = {\n  tokenize: tokenizeNonLazyContinuation,\n  partial: true\n};\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeMathFenced(effects, ok, nok) {\n  const self = this;\n  const tail = self.events[self.events.length - 1];\n  const initialSize = tail && tail[1].type === \"linePrefix\" ? tail[2].sliceSerialize(tail[1], true).length : 0;\n  let sizeOpen = 0;\n  return start;\n\n  /**\n   * Start of math.\n   *\n   * ```markdown\n   * > | $$\n   *     ^\n   *   | \\frac{1}{2}\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('mathFlow');\n    effects.enter('mathFlowFence');\n    effects.enter('mathFlowFenceSequence');\n    return sequenceOpen(code);\n  }\n\n  /**\n   * In opening fence sequence.\n   *\n   * ```markdown\n   * > | $$\n   *      ^\n   *   | \\frac{1}{2}\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function sequenceOpen(code) {\n    if (code === 36) {\n      effects.consume(code);\n      sizeOpen++;\n      return sequenceOpen;\n    }\n    if (sizeOpen < 2) {\n      return nok(code);\n    }\n    effects.exit('mathFlowFenceSequence');\n    return factorySpace(effects, metaBefore, \"whitespace\")(code);\n  }\n\n  /**\n   * In opening fence, before meta.\n   *\n   * ```markdown\n   * > | $$asciimath\n   *       ^\n   *   | x < y\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n\n  function metaBefore(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return metaAfter(code);\n    }\n    effects.enter('mathFlowFenceMeta');\n    effects.enter(\"chunkString\", {\n      contentType: \"string\"\n    });\n    return meta(code);\n  }\n\n  /**\n   * In meta.\n   *\n   * ```markdown\n   * > | $$asciimath\n   *        ^\n   *   | x < y\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function meta(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit(\"chunkString\");\n      effects.exit('mathFlowFenceMeta');\n      return metaAfter(code);\n    }\n    if (code === 36) {\n      return nok(code);\n    }\n    effects.consume(code);\n    return meta;\n  }\n\n  /**\n   * After meta.\n   *\n   * ```markdown\n   * > | $$\n   *       ^\n   *   | \\frac{1}{2}\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function metaAfter(code) {\n    // Guaranteed to be eol/eof.\n    effects.exit('mathFlowFence');\n    if (self.interrupt) {\n      return ok(code);\n    }\n    return effects.attempt(nonLazyContinuation, beforeNonLazyContinuation, after)(code);\n  }\n\n  /**\n   * After eol/eof in math, at a non-lazy closing fence or content.\n   *\n   * ```markdown\n   *   | $$\n   * > | \\frac{1}{2}\n   *     ^\n   * > | $$\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function beforeNonLazyContinuation(code) {\n    return effects.attempt({\n      tokenize: tokenizeClosingFence,\n      partial: true\n    }, after, contentStart)(code);\n  }\n\n  /**\n   * Before math content, definitely not before a closing fence.\n   *\n   * ```markdown\n   *   | $$\n   * > | \\frac{1}{2}\n   *     ^\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function contentStart(code) {\n    return (initialSize ? factorySpace(effects, beforeContentChunk, \"linePrefix\", initialSize + 1) : beforeContentChunk)(code);\n  }\n\n  /**\n   * Before math content, after optional prefix.\n   *\n   * ```markdown\n   *   | $$\n   * > | \\frac{1}{2}\n   *     ^\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function beforeContentChunk(code) {\n    if (code === null) {\n      return after(code);\n    }\n    if (markdownLineEnding(code)) {\n      return effects.attempt(nonLazyContinuation, beforeNonLazyContinuation, after)(code);\n    }\n    effects.enter('mathFlowValue');\n    return contentChunk(code);\n  }\n\n  /**\n   * In math content.\n   *\n   * ```markdown\n   *   | $$\n   * > | \\frac{1}{2}\n   *      ^\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function contentChunk(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('mathFlowValue');\n      return beforeContentChunk(code);\n    }\n    effects.consume(code);\n    return contentChunk;\n  }\n\n  /**\n   * After math (ha!).\n   *\n   * ```markdown\n   *   | $$\n   *   | \\frac{1}{2}\n   * > | $$\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    effects.exit('mathFlow');\n    return ok(code);\n  }\n\n  /** @type {Tokenizer} */\n  function tokenizeClosingFence(effects, ok, nok) {\n    let size = 0;\n    /**\n     * Before closing fence, at optional whitespace.\n     *\n     * ```markdown\n     *   | $$\n     *   | \\frac{1}{2}\n     * > | $$\n     *     ^\n     * ```\n     */\n    return factorySpace(effects, beforeSequenceClose, \"linePrefix\", self.parser.constructs.disable.null.includes('codeIndented') ? undefined : 4);\n\n    /**\n     * In closing fence, after optional whitespace, at sequence.\n     *\n     * ```markdown\n     *   | $$\n     *   | \\frac{1}{2}\n     * > | $$\n     *     ^\n     * ```\n     *\n     * @type {State}\n     */\n    function beforeSequenceClose(code) {\n      effects.enter('mathFlowFence');\n      effects.enter('mathFlowFenceSequence');\n      return sequenceClose(code);\n    }\n\n    /**\n     * In closing fence sequence.\n     *\n     * ```markdown\n     *   | $$\n     *   | \\frac{1}{2}\n     * > | $$\n     *      ^\n     * ```\n     *\n     * @type {State}\n     */\n    function sequenceClose(code) {\n      if (code === 36) {\n        size++;\n        effects.consume(code);\n        return sequenceClose;\n      }\n      if (size < sizeOpen) {\n        return nok(code);\n      }\n      effects.exit('mathFlowFenceSequence');\n      return factorySpace(effects, afterSequenceClose, \"whitespace\")(code);\n    }\n\n    /**\n     * After closing fence sequence, after optional whitespace.\n     *\n     * ```markdown\n     *   | $$\n     *   | \\frac{1}{2}\n     * > | $$\n     *       ^\n     * ```\n     *\n     * @type {State}\n     */\n    function afterSequenceClose(code) {\n      if (code === null || markdownLineEnding(code)) {\n        effects.exit('mathFlowFence');\n        return ok(code);\n      }\n      return nok(code);\n    }\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeNonLazyContinuation(effects, ok, nok) {\n  const self = this;\n  return start;\n\n  /** @type {State} */\n  function start(code) {\n    if (code === null) {\n      return ok(code);\n    }\n    effects.enter(\"lineEnding\");\n    effects.consume(code);\n    effects.exit(\"lineEnding\");\n    return lineStart;\n  }\n\n  /** @type {State} */\n  function lineStart(code) {\n    return self.parser.lazy[self.now().line] ? nok(code) : ok(code);\n  }\n}","/**\n * @import {Options} from 'micromark-extension-math'\n * @import {Construct, Previous, Resolver, State, Token, TokenizeContext, Tokenizer} from 'micromark-util-types'\n */\n\n// To do: next major: clean spaces in HTML compiler.\n// This has to be coordinated together with `mdast-util-math`.\n\nimport { markdownLineEnding } from 'micromark-util-character';\n/**\n * @param {Options | null | undefined} [options={}]\n *   Configuration (default: `{}`).\n * @returns {Construct}\n *   Construct.\n */\nexport function mathText(options) {\n  const options_ = options || {};\n  let single = options_.singleDollarTextMath;\n  if (single === null || single === undefined) {\n    single = true;\n  }\n  return {\n    tokenize: tokenizeMathText,\n    resolve: resolveMathText,\n    previous,\n    name: 'mathText'\n  };\n\n  /**\n   * @this {TokenizeContext}\n   * @type {Tokenizer}\n   */\n  function tokenizeMathText(effects, ok, nok) {\n    const self = this;\n    let sizeOpen = 0;\n    /** @type {number} */\n    let size;\n    /** @type {Token} */\n    let token;\n    return start;\n\n    /**\n     * Start of math (text).\n     *\n     * ```markdown\n     * > | $a$\n     *     ^\n     * > | \\$a$\n     *      ^\n     * ```\n     *\n     * @type {State}\n     */\n    function start(code) {\n      effects.enter('mathText');\n      effects.enter('mathTextSequence');\n      return sequenceOpen(code);\n    }\n\n    /**\n     * In opening sequence.\n     *\n     * ```markdown\n     * > | $a$\n     *     ^\n     * ```\n     *\n     * @type {State}\n     */\n\n    function sequenceOpen(code) {\n      if (code === 36) {\n        effects.consume(code);\n        sizeOpen++;\n        return sequenceOpen;\n      }\n\n      // Not enough markers in the sequence.\n      if (sizeOpen < 2 && !single) {\n        return nok(code);\n      }\n      effects.exit('mathTextSequence');\n      return between(code);\n    }\n\n    /**\n     * Between something and something else.\n     *\n     * ```markdown\n     * > | $a$\n     *      ^^\n     * ```\n     *\n     * @type {State}\n     */\n    function between(code) {\n      if (code === null) {\n        return nok(code);\n      }\n      if (code === 36) {\n        token = effects.enter('mathTextSequence');\n        size = 0;\n        return sequenceClose(code);\n      }\n\n      // Tabs don’t work, and virtual spaces don’t make sense.\n      if (code === 32) {\n        effects.enter('space');\n        effects.consume(code);\n        effects.exit('space');\n        return between;\n      }\n      if (markdownLineEnding(code)) {\n        effects.enter(\"lineEnding\");\n        effects.consume(code);\n        effects.exit(\"lineEnding\");\n        return between;\n      }\n\n      // Data.\n      effects.enter('mathTextData');\n      return data(code);\n    }\n\n    /**\n     * In data.\n     *\n     * ```markdown\n     * > | $a$\n     *      ^\n     * ```\n     *\n     * @type {State}\n     */\n    function data(code) {\n      if (code === null || code === 32 || code === 36 || markdownLineEnding(code)) {\n        effects.exit('mathTextData');\n        return between(code);\n      }\n      effects.consume(code);\n      return data;\n    }\n\n    /**\n     * In closing sequence.\n     *\n     * ```markdown\n     * > | `a`\n     *       ^\n     * ```\n     *\n     * @type {State}\n     */\n\n    function sequenceClose(code) {\n      // More.\n      if (code === 36) {\n        effects.consume(code);\n        size++;\n        return sequenceClose;\n      }\n\n      // Done!\n      if (size === sizeOpen) {\n        effects.exit('mathTextSequence');\n        effects.exit('mathText');\n        return ok(code);\n      }\n\n      // More or less accents: mark as data.\n      token.type = 'mathTextData';\n      return data(code);\n    }\n  }\n}\n\n/** @type {Resolver} */\nfunction resolveMathText(events) {\n  let tailExitIndex = events.length - 4;\n  let headEnterIndex = 3;\n  /** @type {number} */\n  let index;\n  /** @type {number | undefined} */\n  let enter;\n\n  // If we start and end with an EOL or a space.\n  if ((events[headEnterIndex][1].type === \"lineEnding\" || events[headEnterIndex][1].type === 'space') && (events[tailExitIndex][1].type === \"lineEnding\" || events[tailExitIndex][1].type === 'space')) {\n    index = headEnterIndex;\n\n    // And we have data.\n    while (++index < tailExitIndex) {\n      if (events[index][1].type === 'mathTextData') {\n        // Then we have padding.\n        events[tailExitIndex][1].type = 'mathTextPadding';\n        events[headEnterIndex][1].type = 'mathTextPadding';\n        headEnterIndex += 2;\n        tailExitIndex -= 2;\n        break;\n      }\n    }\n  }\n\n  // Merge adjacent spaces and data.\n  index = headEnterIndex - 1;\n  tailExitIndex++;\n  while (++index <= tailExitIndex) {\n    if (enter === undefined) {\n      if (index !== tailExitIndex && events[index][1].type !== \"lineEnding\") {\n        enter = index;\n      }\n    } else if (index === tailExitIndex || events[index][1].type === \"lineEnding\") {\n      events[enter][1].type = 'mathTextData';\n      if (index !== enter + 2) {\n        events[enter][1].end = events[index - 1][1].end;\n        events.splice(enter + 2, index - enter - 2);\n        tailExitIndex -= index - enter - 2;\n        index = enter + 2;\n      }\n      enter = undefined;\n    }\n  }\n  return events;\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Previous}\n */\nfunction previous(code) {\n  // If there is a previous code, there will always be a tail.\n  return code !== 36 || this.events[this.events.length - 1][1].type === \"characterEscape\";\n}","/**\n * @import {Options} from 'micromark-extension-math'\n * @import {Extension} from 'micromark-util-types'\n */\n\nimport { mathFlow } from './math-flow.js';\nimport { mathText } from './math-text.js';\n\n/**\n * Create an extension for `micromark` to enable math syntax.\n *\n * @param {Options | null | undefined} [options={}]\n *   Configuration (default: `{}`).\n * @returns {Extension}\n *   Extension for `micromark` that can be passed in `extensions`, to\n *   enable math syntax.\n */\nexport function math(options) {\n  return {\n    flow: {\n      [36]: mathFlow\n    },\n    text: {\n      [36]: mathText(options)\n    }\n  };\n}","export function deprecate(fn) {\n  return fn\n}\n\nexport function equal() {}\n\nexport function ok() {}\n\nexport function unreachable() {}\n","/**\n * Get the count of the longest repeating streak of `substring` in `value`.\n *\n * @param {string} value\n *   Content to search in.\n * @param {string} substring\n *   Substring to look for, typically one character.\n * @returns {number}\n *   Count of most frequent adjacent `substring`s in `value`.\n */\nexport function longestStreak(value, substring) {\n  const source = String(value)\n  let index = source.indexOf(substring)\n  let expected = index\n  let count = 0\n  let max = 0\n\n  if (typeof substring !== 'string') {\n    throw new TypeError('Expected substring')\n  }\n\n  while (index !== -1) {\n    if (index === expected) {\n      if (++count > max) {\n        max = count\n      }\n    } else {\n      count = 1\n    }\n\n    expected = index + substring.length\n    index = source.indexOf(substring, expected)\n  }\n\n  return max\n}\n","/**\n * @typedef {import('hast').Element} HastElement\n * @typedef {import('hast').ElementContent} HastElementContent\n * @typedef {import('mdast-util-from-markdown').CompileContext} CompileContext\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Handle} ToMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n * @typedef {import('../index.js').InlineMath} InlineMath\n * @typedef {import('../index.js').Math} Math\n *\n * @typedef ToOptions\n *   Configuration.\n * @property {boolean | null | undefined} [singleDollarTextMath=true]\n *   Whether to support math (text) with a single dollar (default: `true`).\n *\n *   Single dollars work in Pandoc and many other places, but often interfere\n *   with “normal” dollars in text.\n *   If you turn this off, you can still use two or more dollars for text math.\n */\n\nimport {ok as assert} from 'devlop'\nimport {longestStreak} from 'longest-streak'\n\n/**\n * Create an extension for `mdast-util-from-markdown`.\n *\n * @returns {FromMarkdownExtension}\n *   Extension for `mdast-util-from-markdown`.\n */\nexport function mathFromMarkdown() {\n  return {\n    enter: {\n      mathFlow: enterMathFlow,\n      mathFlowFenceMeta: enterMathFlowMeta,\n      mathText: enterMathText\n    },\n    exit: {\n      mathFlow: exitMathFlow,\n      mathFlowFence: exitMathFlowFence,\n      mathFlowFenceMeta: exitMathFlowMeta,\n      mathFlowValue: exitMathData,\n      mathText: exitMathText,\n      mathTextData: exitMathData\n    }\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function enterMathFlow(token) {\n    /** @type {HastElement} */\n    const code = {\n      type: 'element',\n      tagName: 'code',\n      properties: {className: ['language-math', 'math-display']},\n      children: []\n    }\n    this.enter(\n      {\n        type: 'math',\n        meta: null,\n        value: '',\n        data: {hName: 'pre', hChildren: [code]}\n      },\n      token\n    )\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function enterMathFlowMeta() {\n    this.buffer()\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathFlowMeta() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    assert(node.type === 'math')\n    node.meta = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathFlowFence() {\n    // Exit if this is the closing fence.\n    if (this.data.mathFlowInside) return\n    this.buffer()\n    this.data.mathFlowInside = true\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathFlow(token) {\n    const data = this.resume().replace(/^(\\r?\\n|\\r)|(\\r?\\n|\\r)$/g, '')\n    const node = this.stack[this.stack.length - 1]\n    assert(node.type === 'math')\n    this.exit(token)\n    node.value = data\n    // @ts-expect-error: we defined it in `enterMathFlow`.\n    const code = /** @type {HastElement} */ (node.data.hChildren[0])\n    assert(code.type === 'element')\n    assert(code.tagName === 'code')\n    code.children.push({type: 'text', value: data})\n    this.data.mathFlowInside = undefined\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function enterMathText(token) {\n    this.enter(\n      {\n        type: 'inlineMath',\n        value: '',\n        data: {\n          hName: 'code',\n          hProperties: {className: ['language-math', 'math-inline']},\n          hChildren: []\n        }\n      },\n      token\n    )\n    this.buffer()\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathText(token) {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    assert(node.type === 'inlineMath')\n    this.exit(token)\n    node.value = data\n    const children = /** @type {Array<HastElementContent>} */ (\n      // @ts-expect-error: we defined it in `enterMathFlow`.\n      node.data.hChildren\n    )\n    children.push({type: 'text', value: data})\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathData(token) {\n    this.config.enter.data.call(this, token)\n    this.config.exit.data.call(this, token)\n  }\n}\n\n/**\n * Create an extension for `mdast-util-to-markdown`.\n *\n * @param {ToOptions | null | undefined} [options]\n *   Configuration (optional).\n * @returns {ToMarkdownExtension}\n *   Extension for `mdast-util-to-markdown`.\n */\nexport function mathToMarkdown(options) {\n  let single = (options || {}).singleDollarTextMath\n\n  if (single === null || single === undefined) {\n    single = true\n  }\n\n  inlineMath.peek = inlineMathPeek\n\n  return {\n    unsafe: [\n      {character: '\\r', inConstruct: 'mathFlowMeta'},\n      {character: '\\n', inConstruct: 'mathFlowMeta'},\n      {\n        character: '$',\n        after: single ? undefined : '\\\\$',\n        inConstruct: 'phrasing'\n      },\n      {character: '$', inConstruct: 'mathFlowMeta'},\n      {atBreak: true, character: '$', after: '\\\\$'}\n    ],\n    handlers: {math, inlineMath}\n  }\n\n  /**\n   * @type {ToMarkdownHandle}\n   * @param {Math} node\n   */\n  // Note: fixing this code? Please also fix the similar code for code:\n  // <https://github.com/syntax-tree/mdast-util-to-markdown/blob/main/lib/handle/code.js>\n  function math(node, _, state, info) {\n    const raw = node.value || ''\n    const tracker = state.createTracker(info)\n    const sequence = '$'.repeat(Math.max(longestStreak(raw, '$') + 1, 2))\n    const exit = state.enter('mathFlow')\n    let value = tracker.move(sequence)\n\n    if (node.meta) {\n      const subexit = state.enter('mathFlowMeta')\n      value += tracker.move(\n        state.safe(node.meta, {\n          after: '\\n',\n          before: value,\n          encode: ['$'],\n          ...tracker.current()\n        })\n      )\n      subexit()\n    }\n\n    value += tracker.move('\\n')\n\n    if (raw) {\n      value += tracker.move(raw + '\\n')\n    }\n\n    value += tracker.move(sequence)\n    exit()\n    return value\n  }\n\n  /**\n   * @type {ToMarkdownHandle}\n   * @param {InlineMath} node\n   */\n  // Note: fixing this code? Please also fix the similar code for inline code:\n  // <https://github.com/syntax-tree/mdast-util-to-markdown/blob/main/lib/handle/inline-code.js>\n  function inlineMath(node, _, state) {\n    let value = node.value || ''\n    let size = 1\n\n    if (!single) size++\n\n    // If there is a single dollar sign on its own in the math, use a fence of\n    // two.\n    // If there are two in a row, use one.\n    while (\n      new RegExp('(^|[^$])' + '\\\\$'.repeat(size) + '([^$]|$)').test(value)\n    ) {\n      size++\n    }\n\n    const sequence = '$'.repeat(size)\n\n    // If this is not just spaces or eols (tabs don’t count), and either the\n    // first and last character are a space or eol, or the first or last\n    // character are dollar signs, then pad with spaces.\n    if (\n      // Contains non-space.\n      /[^ \\r\\n]/.test(value) &&\n      // Starts with space and ends with space.\n      ((/^[ \\r\\n]/.test(value) && /[ \\r\\n]$/.test(value)) ||\n        // Starts or ends with dollar.\n        /^\\$|\\$$/.test(value))\n    ) {\n      value = ' ' + value + ' '\n    }\n\n    let index = -1\n\n    // We have a potential problem: certain characters after eols could result in\n    // blocks being seen.\n    // For example, if someone injected the string `'\\n# b'`, then that would\n    // result in an ATX heading.\n    // We can’t escape characters in `inlineMath`, but because eols are\n    // transformed to spaces when going from markdown to HTML anyway, we can swap\n    // them out.\n    while (++index < state.unsafe.length) {\n      const pattern = state.unsafe[index]\n\n      // Only look for `atBreak`s.\n      // Btw: note that `atBreak` patterns will always start the regex at LF or\n      // CR.\n      if (!pattern.atBreak) continue\n\n      const expression = state.compilePattern(pattern)\n      /** @type {RegExpExecArray | null} */\n      let match\n\n      while ((match = expression.exec(value))) {\n        let position = match.index\n\n        // Support CRLF (patterns only look for one of the characters).\n        if (\n          value.codePointAt(position) === 10 /* `\\n` */ &&\n          value.codePointAt(position - 1) === 13 /* `\\r` */\n        ) {\n          position--\n        }\n\n        value = value.slice(0, position) + ' ' + value.slice(match.index + 1)\n      }\n    }\n\n    return sequence + value + sequence\n  }\n\n  /**\n   * @returns {string}\n   */\n  function inlineMathPeek() {\n    return '$'\n  }\n}\n","/// <reference types=\"remark-parse\" />\n/// <reference types=\"remark-stringify\" />\n\nimport type { Root } from \"mdast\";\nimport type { Processor } from \"unified\";\nimport { visit } from \"unist-util-visit\";\n\nimport \"./lib/types.js\";\n\nimport { wikilinkSyntax } from \"./lib/syntax/wikilink.js\";\nimport { highlightSyntax } from \"./lib/syntax/highlight.js\";\nimport { commentSyntax } from \"./lib/syntax/comment.js\";\nimport { tagSyntax } from \"./lib/syntax/tag.js\";\n\nimport { wikilinkFromMarkdown } from \"./lib/mdast/wikilink.js\";\nimport { highlightFromMarkdown } from \"./lib/mdast/highlight.js\";\nimport { commentFromMarkdown } from \"./lib/mdast/comment.js\";\nimport { tagFromMarkdown } from \"./lib/mdast/tag.js\";\nimport { wikilinkToMarkdown } from \"./lib/mdast/wikilink-to-markdown.js\";\nimport { highlightToMarkdown } from \"./lib/mdast/highlight-to-markdown.js\";\nimport { commentToMarkdown } from \"./lib/mdast/comment-to-markdown.js\";\nimport { tagToMarkdown } from \"./lib/mdast/tag-to-markdown.js\";\nimport { customTaskCharTransform } from \"./lib/task-char.js\";\n\nimport { math as mathSyntax } from \"micromark-extension-math\";\nimport { mathFromMarkdown, mathToMarkdown } from \"mdast-util-math\";\n\nexport interface RemarkObsidianOptions {\n  wikilinks?: boolean;\n  highlights?: boolean;\n  comments?: boolean;\n  tags?: boolean;\n  customTaskChars?: boolean;\n  math?: boolean;\n}\n\nconst defaultOptions: Required<RemarkObsidianOptions> = {\n  wikilinks: true,\n  highlights: true,\n  comments: true,\n  tags: true,\n  customTaskChars: true,\n  math: true,\n};\n\nexport default function remarkObsidian(\n  userOpts?: RemarkObsidianOptions,\n): undefined | ((tree: Root, file: any) => void) {\n  const opts = { ...defaultOptions, ...userOpts };\n  // @ts-expect-error - unified `this` context\n  const data = (this as Processor<Root>).data();\n\n  data.micromarkExtensions ??= [];\n  data.fromMarkdownExtensions ??= [];\n  data.toMarkdownExtensions ??= [];\n\n  if (opts.wikilinks) {\n    data.micromarkExtensions.push(wikilinkSyntax());\n    data.fromMarkdownExtensions.push(wikilinkFromMarkdown());\n    data.toMarkdownExtensions.push(wikilinkToMarkdown());\n  }\n  if (opts.comments) {\n    data.micromarkExtensions.push(commentSyntax());\n    data.fromMarkdownExtensions.push(commentFromMarkdown());\n    data.toMarkdownExtensions.push(commentToMarkdown());\n  }\n  if (opts.tags) {\n    data.micromarkExtensions.push(tagSyntax());\n    data.fromMarkdownExtensions.push(tagFromMarkdown());\n    data.toMarkdownExtensions.push(tagToMarkdown());\n  }\n  if (opts.highlights) {\n    data.micromarkExtensions.push(highlightSyntax());\n    data.fromMarkdownExtensions.push(highlightFromMarkdown());\n    data.toMarkdownExtensions.push(highlightToMarkdown());\n  }\n  if (opts.math) {\n    data.micromarkExtensions.push(mathSyntax());\n    data.fromMarkdownExtensions.push(mathFromMarkdown());\n    data.toMarkdownExtensions.push(mathToMarkdown());\n  }\n\n  const needsTransform = opts.comments || opts.customTaskChars;\n  if (!needsTransform) return undefined;\n\n  return (tree: Root, file: any) => {\n    if (opts.comments) {\n      visit(\n        tree,\n        \"comment\",\n        (_node: unknown, index: number | undefined, parent: any) => {\n          if (parent && typeof index === \"number\") {\n            parent.children.splice(index, 1);\n            return index;\n          }\n          return undefined;\n        },\n      );\n    }\n    if (opts.customTaskChars) {\n      customTaskCharTransform(tree, String(file));\n    }\n  };\n}\n\nexport { wikilinkSyntax } from \"./lib/syntax/wikilink.js\";\nexport { highlightSyntax } from \"./lib/syntax/highlight.js\";\nexport { commentSyntax } from \"./lib/syntax/comment.js\";\nexport { tagSyntax } from \"./lib/syntax/tag.js\";\n\nexport { wikilinkFromMarkdown } from \"./lib/mdast/wikilink.js\";\nexport { highlightFromMarkdown } from \"./lib/mdast/highlight.js\";\nexport { commentFromMarkdown } from \"./lib/mdast/comment.js\";\nexport { tagFromMarkdown } from \"./lib/mdast/tag.js\";\nexport { wikilinkToMarkdown } from \"./lib/mdast/wikilink-to-markdown.js\";\nexport { highlightToMarkdown } from \"./lib/mdast/highlight-to-markdown.js\";\nexport { commentToMarkdown } from \"./lib/mdast/comment-to-markdown.js\";\nexport { tagToMarkdown } from \"./lib/mdast/tag-to-markdown.js\";\nexport { customTaskCharTransform } from \"./lib/task-char.js\";\n\nexport type { Wikilink, Highlight, Comment, Tag } from \"./lib/types.js\";\n"],"mappings":";AA4IO,IAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAgBT,SAAU,MAAM;AACd,QAAI,SAAS,QAAQ,SAAS,QAAW;AACvC,aAAO;AAAA,IACT;AAEA,QAAI,OAAO,SAAS,YAAY;AAC9B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,QAAI,OAAO,SAAS,UAAU;AAC5B,aAAO,MAAM,QAAQ,IAAI,IACrB,WAAW,IAAI;AAAA;AAAA;AAAA,QAGf;AAAA;AAAA,UAAwC;AAAA,QAAK;AAAA;AAAA,IACnD;AAEA,QAAI,OAAO,SAAS,UAAU;AAC5B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AAAA;AAOJ,SAAS,WAAW,OAAO;AAEzB,QAAM,SAAS,CAAC;AAChB,MAAI,QAAQ;AAEZ,SAAO,EAAE,QAAQ,MAAM,QAAQ;AAC7B,WAAO,KAAK,IAAI,QAAQ,MAAM,KAAK,CAAC;AAAA,EACtC;AAEA,SAAO,YAAY,GAAG;AAMtB,WAAS,OAAO,YAAY;AAC1B,QAAIA,SAAQ;AAEZ,WAAO,EAAEA,SAAQ,OAAO,QAAQ;AAC9B,UAAI,OAAOA,MAAK,EAAE,MAAM,MAAM,UAAU,EAAG,QAAO;AAAA,IACpD;AAEA,WAAO;AAAA,EACT;AACF;AAQA,SAAS,kBAAkB,OAAO;AAChC,QAAM;AAAA;AAAA,IAAwD;AAAA;AAE9D,SAAO,YAAY,GAAG;AAMtB,WAAS,IAAI,MAAM;AACjB,UAAM;AAAA;AAAA;AAAA,MACoB;AAAA;AAI1B,QAAI;AAEJ,SAAK,OAAO,OAAO;AACjB,UAAI,aAAa,GAAG,MAAM,cAAc,GAAG,EAAG,QAAO;AAAA,IACvD;AAEA,WAAO;AAAA,EACT;AACF;AAQA,SAAS,YAAY,OAAO;AAC1B,SAAO,YAAY,IAAI;AAKvB,WAAS,KAAK,MAAM;AAClB,WAAO,QAAQ,KAAK,SAAS;AAAA,EAC/B;AACF;AAQA,SAAS,YAAY,cAAc;AACjC,SAAO;AAMP,WAAS,MAAM,OAAO,OAAO,QAAQ;AACnC,WAAO;AAAA,MACL,eAAe,KAAK,KAClB,aAAa;AAAA,QACX;AAAA,QACA;AAAA,QACA,OAAO,UAAU,WAAW,QAAQ;AAAA,QACpC,UAAU;AAAA,MACZ;AAAA,IACJ;AAAA,EACF;AACF;AAEA,SAAS,KAAK;AACZ,SAAO;AACT;AAMA,SAAS,eAAe,OAAO;AAC7B,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,UAAU;AAClE;;;ACnSO,SAAS,MAAM,GAAG;AACvB,SAAO,aAAe,IAAI;AAC5B;;;AC0NA,IAAM,QAAQ,CAAC;AAKR,IAAM,WAAW;AAKjB,IAAM,OAAO;AAKb,IAAM,OAAO;AAiDb,SAAS,aAAa,MAAM,MAAM,SAAS,SAAS;AAEzD,MAAI;AAEJ,MAAI,OAAO,SAAS,cAAc,OAAO,YAAY,YAAY;AAC/D,cAAU;AAEV,cAAU;AAAA,EACZ,OAAO;AAEL,YAAQ;AAAA,EACV;AAEA,QAAMC,MAAK,QAAQ,KAAK;AACxB,QAAM,OAAO,UAAU,KAAK;AAE5B,UAAQ,MAAM,QAAW,CAAC,CAAC,EAAE;AAO7B,WAAS,QAAQ,MAAM,OAAO,SAAS;AACrC,UAAM;AAAA;AAAA,MACJ,QAAQ,OAAO,SAAS,WAAW,OAAO,CAAC;AAAA;AAG7C,QAAI,OAAO,MAAM,SAAS,UAAU;AAClC,YAAM;AAAA;AAAA,QAEJ,OAAO,MAAM,YAAY,WACrB,MAAM;AAAA;AAAA,UAEN,OAAO,MAAM,SAAS,WACpB,MAAM,OACN;AAAA;AAAA;AAER,aAAO,eAAeC,QAAO,QAAQ;AAAA,QACnC,OACE,WAAW,MAAM,KAAK,QAAQ,OAAO,MAAM,OAAO,MAAM,GAAG,IAAI;AAAA,MACnE,CAAC;AAAA,IACH;AAEA,WAAOA;AAEP,aAASA,SAAQ;AAEf,UAAI,SAAS;AAEb,UAAI;AAEJ,UAAI;AAEJ,UAAI;AAEJ,UAAI,CAAC,QAAQD,IAAG,MAAM,OAAO,QAAQ,QAAQ,SAAS,CAAC,KAAK,MAAS,GAAG;AAEtE,iBAAS,SAAS,QAAQ,MAAM,OAAO,CAAC;AAExC,YAAI,OAAO,CAAC,MAAM,MAAM;AACtB,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,cAAc,QAAQ,KAAK,UAAU;AACvC,cAAM;AAAA;AAAA,UAA2C;AAAA;AAEjD,YAAI,aAAa,YAAY,OAAO,CAAC,MAAM,MAAM;AAC/C,oBAAU,UAAU,aAAa,SAAS,SAAS,MAAM;AACzD,yBAAe,QAAQ,OAAO,YAAY;AAE1C,iBAAO,SAAS,MAAM,SAAS,aAAa,SAAS,QAAQ;AAC3D,kBAAM,QAAQ,aAAa,SAAS,MAAM;AAE1C,wBAAY,QAAQ,OAAO,QAAQ,YAAY,EAAE;AAEjD,gBAAI,UAAU,CAAC,MAAM,MAAM;AACzB,qBAAO;AAAA,YACT;AAEA,qBACE,OAAO,UAAU,CAAC,MAAM,WAAW,UAAU,CAAC,IAAI,SAAS;AAAA,UAC/D;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAUA,SAAS,SAAS,OAAO;AACvB,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,CAAC,UAAU,KAAK;AAAA,EACzB;AAEA,SAAO,UAAU,QAAQ,UAAU,SAAY,QAAQ,CAAC,KAAK;AAC/D;;;ACzHO,SAAS,MAAM,MAAM,eAAe,kBAAkB,cAAc;AAEzE,MAAI;AAEJ,MAAI;AAEJ,MAAI;AAEJ,MACE,OAAO,kBAAkB,cACzB,OAAO,qBAAqB,YAC5B;AACA,WAAO;AACP,cAAU;AACV,cAAU;AAAA,EACZ,OAAO;AAEL,WAAO;AAEP,cAAU;AACV,cAAU;AAAA,EACZ;AAEA,eAAa,MAAM,MAAM,UAAU,OAAO;AAM1C,WAAS,SAAS,MAAM,SAAS;AAC/B,UAAM,SAAS,QAAQ,QAAQ,SAAS,CAAC;AACzC,UAAM,QAAQ,SAAS,OAAO,SAAS,QAAQ,IAAI,IAAI;AACvD,WAAO,QAAQ,MAAM,OAAO,MAAM;AAAA,EACpC;AACF;;;ACrSO,IAAM;AAAA;AAAA,EAA8B;AAAA,IACzC,gBAAgB;AAAA,IAChB,UAAU;AAAA,IACV,wBAAwB;AAAA,IACxB,eAAe;AAAA,IACf,cAAc;AAAA,IACd,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,IAAI;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,KAAK;AAAA,IACL,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,OAAO;AAAA,IACP,iBAAiB;AAAA;AAAA,IACjB,eAAe;AAAA;AAAA,IACf,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,aAAa;AAAA;AAAA,IACb,WAAW;AAAA;AAAA,IACX,YAAY;AAAA;AAAA,IACZ,iBAAiB;AAAA;AAAA,IACjB,kBAAkB;AAAA;AAAA,IAClB,UAAU;AAAA;AAAA,IACV,UAAU;AAAA;AAAA,IACV,OAAO;AAAA;AAAA,IACP,MAAM;AAAA;AAAA,IACN,KAAK;AAAA;AAAA,IACL,OAAO;AAAA;AAAA,IACP,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,OAAO;AAAA;AAAA,IACP,WAAW;AAAA;AAAA,IACX,UAAU;AAAA;AAAA,IACV,UAAU;AAAA;AAAA,IACV,aAAa;AAAA;AAAA,IACb,cAAc;AAAA;AAAA,IACd,QAAQ;AAAA;AAAA,IACR,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,mBAAmB;AAAA;AAAA,IACnB,WAAW;AAAA;AAAA,IACX,oBAAoB;AAAA;AAAA,IACpB,OAAO;AAAA;AAAA,IACP,YAAY;AAAA;AAAA,IACZ,aAAa;AAAA;AAAA,IACb,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,gBAAgB;AAAA;AAAA,IAChB,aAAa;AAAA;AAAA,IACb,iBAAiB;AAAA;AAAA,IACjB,OAAO;AAAA;AAAA,IACP,KAAK;AAAA;AAAA,IAEL,iBAAiB;AAAA;AAAA,IAEjB,sBAAsB;AAAA;AAAA,EACxB;AAAA;;;ACpJA,IAAM,cAAc;AACpB,IAAM,OAAO;AACb,IAAM,eAAe;AACrB,IAAM,YAAY;AAClB,IAAM,gBAAgB;AACtB,IAAM,OAAO;AAEb,SAAS,aAAa,MAAqB;AACzC,SAAO,SAAS,MAAM,YAAY,SAAS,MAAM;AACnD;AAEO,SAAS,iBAA4B;AAC1C,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,YAAY,GAAG,EAAE,MAAM,YAAY,SAAS;AAAA,MAC7C,CAAC,WAAW,GAAG,EAAE,MAAM,YAAY,SAAS;AAAA,IAC9C;AAAA,EACF;AACF;AAEA,SAAS,SAEP,SACAE,KACA,KACO;AACP,MAAI,UAAU;AACd,MAAI,aAAa;AACjB,MAAI,WAAW;AAEf,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,aAAa;AACxB,cAAQ,MAAM,UAAU;AACxB,cAAQ,MAAM,qBAAqB;AACnC,cAAQ,QAAQ,IAAI;AACpB,cAAQ,KAAK,qBAAqB;AAClC,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,cAAc;AACzB,cAAQ,MAAM,UAAU;AACxB,aAAO,UAAU,IAAI;AAAA,IACvB;AAEA,WAAO,IAAI,IAAI;AAAA,EACjB;AAEA,WAAS,UAAU,MAA+B;AAChD,QAAI,SAAS,aAAc,QAAO,IAAI,IAAI;AAC1C,YAAQ,MAAM,gBAAgB;AAC9B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,aAAc,QAAO,IAAI,IAAI;AAC1C,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,gBAAgB;AAC7B,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,MAA+B;AAChD,QAAI,SAAS,KAAM,QAAO,cAAc,IAAI;AAC5C,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,QAAI,SAAS,iBAAiB,SAAS,QAAQ,aAAa,IAAI;AAC9D,aAAO,IAAI,IAAI;AACjB,YAAQ,MAAM,cAAc;AAC5B,cAAU;AACV,WAAO,KAAK,IAAI;AAAA,EAClB;AAEA,WAAS,KAAK,MAA+B;AAC3C,QAAI,SAAS,WAAW;AACtB,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,cAAc;AAC3B,aAAO,cAAc,IAAI;AAAA,IAC3B;AAEA,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,cAAc;AAC3B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,QAAI,SAAS,eAAe;AAC1B,cAAQ,KAAK,cAAc;AAC3B,aAAO,WAAW,IAAI;AAAA,IACxB;AAEA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AAExD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,cAAc;AAC3B,aAAO,YAAY,IAAI;AAAA,IACzB;AACA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,cAAc,MAA+B;AACpD,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,YAAQ,MAAM,uBAAuB;AACrC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,uBAAuB;AACpC,WAAO;AAAA,EACT;AAEA,WAAS,aAAa,MAA+B;AACnD,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AAGxD,QAAI,SAAS,eAAe;AAC1B,mBAAa;AACb,aAAO,WAAW,IAAI;AAAA,IACxB;AACA,QAAI,SAAS,MAAM;AACjB,mBAAa;AACb,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,YAAQ,MAAM,iBAAiB;AAC/B,iBAAa;AACb,WAAO,QAAQ,IAAI;AAAA,EACrB;AAEA,WAAS,QAAQ,MAA+B;AAC9C,QAAI,SAAS,WAAW;AACtB,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,iBAAiB;AAC9B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,QAAI,SAAS,eAAe;AAC1B,cAAQ,KAAK,iBAAiB;AAC9B,aAAO,WAAW,IAAI;AAAA,IACxB;AAEA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AAExD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,cAAc,MAA+B;AACpD,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,iBAAiB;AAC9B,aAAO,YAAY,IAAI;AAAA,IACzB;AACA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,YAAY,MAA+B;AAClD,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,YAAQ,MAAM,qBAAqB;AACnC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,qBAAqB;AAClC,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,cAAe,QAAO,WAAW,IAAI;AAClD,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,YAAQ,MAAM,eAAe;AAC7B,eAAW;AACX,WAAO,MAAM,IAAI;AAAA,EACnB;AAEA,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,eAAe;AAC1B,cAAQ,KAAK,eAAe;AAC5B,aAAO,WAAW,IAAI;AAAA,IACxB;AAEA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AAExD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,cAAe,QAAO,IAAI,IAAI;AAC3C,QAAI,CAAC,WAAW,CAAC,cAAc,CAAC,SAAU,QAAO,IAAI,IAAI;AACzD,YAAQ,MAAM,gBAAgB;AAC9B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,YAAY,MAA+B;AAClD,QAAI,SAAS,cAAe,QAAO,IAAI,IAAI;AAC3C,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,gBAAgB;AAC7B,YAAQ,KAAK,UAAU;AACvB,WAAOA;AAAA,EACT;AACF;;;AClNA,IAAM,SAAS;AAEf,SAASC,cAAa,MAAqB;AACzC,SAAO,SAAS,MAAM,YAAY,SAAS,MAAM;AACnD;AAEO,SAAS,kBAA6B;AAC3C,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,MAAM,GAAG,EAAE,MAAM,aAAa,UAAAC,UAAS;AAAA,IAC1C;AAAA,EACF;AACF;AAEA,SAASA,UAEP,SACAC,KACA,KACO;AACP,QAAM,QAAmB,EAAE,UAAU,eAAe,SAAS,KAAK;AAClE,MAAI,aAAa;AACjB,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,OAAQ,QAAO,IAAI,IAAI;AACpC,YAAQ,MAAM,WAAW;AACzB,YAAQ,MAAM,iBAAiB;AAC/B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,OAAQ,QAAO,IAAI,IAAI;AACpC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,iBAAiB;AAC9B,YAAQ,MAAM,kBAAkB;AAChC,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ,MAA+B;AAC9C,QAAI,SAAS,QAAQF,cAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,QAAI,CAAC,cAAc,SAAS,OAAQ,QAAO,IAAI,IAAI;AACnD,QAAI,SAAS;AACX,aAAO,QAAQ,QAAQ,OAAO,YAAY,cAAc,EAAE,IAAI;AAChE,YAAQ,QAAQ,IAAI;AACpB,iBAAa;AACb,WAAO;AAAA,EACT;AAEA,WAAS,eAAe,MAA+B;AACrD,QAAI,SAAS,QAAQA,cAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,cAEP,cACA,SACA,UACO;AACP,WAAO;AAEP,aAAS,WAAW,WAAoC;AACtD,UAAI,cAAc,OAAQ,QAAO,SAAS,SAAS;AACnD,mBAAa,KAAK,kBAAkB;AACpC,mBAAa,MAAM,iBAAiB;AACpC,mBAAa,QAAQ,SAAS;AAC9B,aAAO;AAAA,IACT;AAEA,aAAS,YAAY,WAAoC;AACvD,UAAI,cAAc,OAAQ,QAAO,SAAS,SAAS;AACnD,mBAAa,QAAQ,SAAS;AAC9B,mBAAa,KAAK,iBAAiB;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,WAAW,MAA+B;AACjD,YAAQ,KAAK,WAAW;AACxB,WAAOE,IAAG,IAAI;AAAA,EAChB;AACF;;;ACrFA,IAAM,UAAU;AAChB,IAAM,YAAY;AAClB,IAAM,kBAAkB;AACxB,IAAM,4BAA4B;AAElC,SAASC,cAAa,MAA4B;AAChD,SACE,SAAS,aACT,SAAS,mBACT,SAAS;AAEb;AAEA,IAAM,cAAyB;AAAA,EAC7B,UAAU;AAAA,EACV,UAAU;AAAA,EACV,MAAM;AACR;AAEA,IAAM,sBAAiC;AAAA,EACrC,UAAU;AAAA,EACV,SAAS;AACX;AAEO,SAAS,gBAA2B;AACzC,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,OAAO,GAAG,EAAE,MAAM,WAAW,UAAU,aAAa;AAAA,IACvD;AAAA,IACA,MAAM;AAAA,MACJ,CAAC,OAAO,GAAG;AAAA,IACb;AAAA,EACF;AACF;AAEA,SAAS,aAEP,SACAC,KACA,KACO;AACP,QAAM,QAAmB,EAAE,UAAU,eAAe,SAAS,KAAK;AAClE,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,QAAS,QAAO,IAAI,IAAI;AACrC,YAAQ,MAAM,SAAS;AACvB,YAAQ,MAAM,eAAe;AAC7B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,QAAS,QAAO,IAAI,IAAI;AACrC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,eAAe;AAC5B,YAAQ,MAAM,gBAAgB;AAC9B,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ,MAA+B;AAC9C,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,QAAI,SAAS;AACX,aAAO,QAAQ,QAAQ,OAAO,YAAY,cAAc,EAAE,IAAI;AAChE,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,eAAe,MAA+B;AACrD,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,cAEP,cACA,SACA,UACO;AACP,WAAO;AAEP,aAAS,WAAW,WAAoC;AACtD,UAAI,cAAc,QAAS,QAAO,SAAS,SAAS;AACpD,mBAAa,KAAK,gBAAgB;AAClC,mBAAa,MAAM,eAAe;AAClC,mBAAa,QAAQ,SAAS;AAC9B,aAAO;AAAA,IACT;AAEA,aAAS,YAAY,WAAoC;AACvD,UAAI,cAAc,QAAS,QAAO,SAAS,SAAS;AACpD,mBAAa,QAAQ,SAAS;AAC9B,mBAAa,KAAK,eAAe;AACjC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,WAAW,MAA+B;AACjD,YAAQ,KAAK,SAAS;AACtB,WAAOA,IAAG,IAAI;AAAA,EAChB;AACF;AAEA,SAAS,aAEP,SACAA,KACA,KACO;AACP,QAAM,OAAO;AACb,QAAM,YAAuB;AAAA,IAC3B,UAAU;AAAA,IACV,SAAS;AAAA,EACX;AAEA,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,QAAS,QAAO,IAAI,IAAI;AACrC,YAAQ,MAAM,SAAS;AACvB,YAAQ,MAAM,eAAe;AAC7B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,QAAS,QAAO,IAAI,IAAI;AACrC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,eAAe;AAC5B,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,MAA+B;AAChD,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAElC,QAAID,cAAa,IAAI,GAAG;AACtB,aAAO,QAAQ;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,MACF,EAAE,IAAI;AAAA,IACR;AAEA,YAAQ,MAAM,gBAAgB;AAC9B,WAAO,aAAa,IAAI;AAAA,EAC1B;AAEA,WAAS,mBAAmB,MAA+B;AACzD,QAAI,SAAS,MAAM;AACjB,aAAO,QAAQ,IAAI;AAAA,IACrB;AAEA,QAAIA,cAAa,IAAI,GAAG;AACtB,aAAO,QAAQ;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,MACF,EAAE,IAAI;AAAA,IACR;AAEA,QAAI,SAAS,SAAS;AACpB,aAAO,QAAQ,QAAQ,WAAW,YAAY,YAAY,EAAE,IAAI;AAAA,IAClE;AAEA,YAAQ,MAAM,gBAAgB;AAC9B,WAAO,aAAa,IAAI;AAAA,EAC1B;AAEA,WAAS,aAAa,MAA+B;AACnD,YAAQ,MAAM,gBAAgB;AAC9B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,aAAa,MAA+B;AACnD,QAAI,SAAS,KAAM,QAAO,QAAQ,IAAI;AAEtC,QAAI,SAAS,SAAS;AACpB,aAAO,QAAQ,QAAQ,WAAW,YAAY,cAAc,EAAE,IAAI;AAAA,IACpE;AAEA,QAAIA,cAAa,IAAI,GAAG;AACtB,cAAQ,KAAK,gBAAgB;AAC7B,aAAO,QAAQ;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,MACF,EAAE,IAAI;AAAA,IACR;AAEA,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,eAAe,MAA+B;AACrD,QAAI,SAAS,KAAM,QAAO,QAAQ,IAAI;AACtC,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,YAAQ,KAAK,SAAS;AACtB,WAAOC,IAAG,IAAI;AAAA,EAChB;AAEA,WAAS,QAAQ,MAA+B;AAC9C,YAAQ,KAAK,SAAS;AACtB,WAAO,IAAI,IAAI;AAAA,EACjB;AAEA,WAAS,kBAEP,cACA,SACA,UACO;AACP,QAAI,YAAY;AAChB,WAAO;AAEP,aAAS,WAAW,WAAoC;AACtD,UAAI,cAAc,QAAS,QAAO,SAAS,SAAS;AACpD,YAAM,UAAU,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAClD,UACE,WACA,QAAQ,CAAC,MAAM,WACf,QAAQ,CAAC,EAAE,SAAS,kBACpB;AACA,qBAAa,KAAK,gBAAgB;AAClC,oBAAY;AAAA,MACd;AACA,mBAAa,MAAM,eAAe;AAClC,mBAAa,QAAQ,SAAS;AAC9B,aAAO;AAAA,IACT;AAEA,aAAS,YAAY,WAAoC;AACvD,UAAI,cAAc,SAAS;AACzB,YAAI,WAAW;AACb,uBAAa,KAAK,eAAe;AACjC,uBAAa,MAAM,gBAAgB;AAAA,QACrC;AACA,eAAO,SAAS,SAAS;AAAA,MAC3B;AACA,mBAAa,QAAQ,SAAS;AAC9B,mBAAa,KAAK,eAAe;AACjC,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,4BAEP,SACAA,KACA,KACO;AACP,QAAM,OAAO;AACb,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,MAAM;AACjB,aAAOA,IAAG,IAAI;AAAA,IAChB;AACA,QAAI,CAACD,cAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxC,YAAQ,MAAM,YAAY;AAC1B,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,YAAY;AACzB,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,MAA+B;AAChD,WAAO,KAAK,OAAO,KAAK,KAAK,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAIC,IAAG,IAAI;AAAA,EAChE;AACF;;;AClRA,IAAMC,QAAO;AACb,IAAM,QAAQ;AACd,IAAM,OAAO;AACb,IAAM,aAAa;AAEnB,IAAM,eAAe;AAErB,SAAS,aAAa,MAAqB;AACzC,SACE,SAAS,MAAM,SACf,SAAS,MAAM,iBACf,SAAS,MAAM,YACf,SAAS,MAAM,kBACf,SAAS,MAAM;AAEnB;AAEA,SAAS,UAAU,MAAqB;AACtC,MAAI,SAAS,QAAQ,OAAO,EAAG,QAAO;AACtC,MAAI,QAAQ,MAAM,QAAQ,GAAI,QAAO;AACrC,MAAI,SAAS,QAAQ,SAAS,WAAY,QAAO;AACjD,SAAO,aAAa,KAAK,OAAO,cAAc,IAAI,CAAC;AACrD;AAEA,SAAS,WAAW,MAAqB;AACvC,MAAI,SAAS,KAAM,QAAO;AAC1B,SAAO,EAAE,QAAQ,MAAM,QAAQ;AACjC;AAEO,SAAS,YAAuB;AACrC,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAACA,KAAI,GAAG,EAAE,MAAM,OAAO,UAAAC,UAAS;AAAA,IAClC;AAAA,EACF;AACF;AAEA,SAASA,UAEP,SACAC,KACA,KACO;AACP,MAAI,cAAc;AAClB,QAAM,UAAU;AAEhB,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,UAAMC,YAAW,QAAQ;AACzB,UAAM,eACJA,cAAa,QAAQ,aAAaA,SAAQ,KAAKA,cAAaH;AAC9D,QAAI,CAAC,aAAc,QAAO,IAAI,IAAI;AAClC,QAAI,SAASA,MAAM,QAAO,IAAI,IAAI;AAClC,YAAQ,MAAM,KAAK;AACnB,YAAQ,MAAM,WAAW;AACzB,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,WAAW;AACxB,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,MAA+B;AAC/C,QAAI,CAAC,UAAU,IAAI,EAAG,QAAO,IAAI,IAAI;AACrC,YAAQ,MAAM,YAAY;AAC1B,QAAI,WAAW,IAAI,EAAG,eAAc;AACpC,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,OAAO;AAClB,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAEA,QAAI,UAAU,IAAI,GAAG;AACnB,UAAI,WAAW,IAAI,EAAG,eAAc;AACpC,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAEA,WAAO,IAAI,IAAI;AAAA,EACjB;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,CAAC,UAAU,IAAI,EAAG,QAAO,IAAI,IAAI;AACrC,QAAI,WAAW,IAAI,EAAG,eAAc;AACpC,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,MAA+B;AAC1C,QAAI,CAAC,YAAa,QAAO,IAAI,IAAI;AACjC,YAAQ,KAAK,YAAY;AACzB,YAAQ,KAAK,KAAK;AAClB,WAAOE,IAAG,IAAI;AAAA,EAChB;AACF;;;ACxGO,SAAS,uBAAkC;AAChD,SAAO;AAAA,IACL,OAAO;AAAA,MACL,SAAS,OAAO;AACd,aAAK;AAAA,UACH;AAAA,YACE,MAAM;AAAA,YACN,OAAO;AAAA,YACP,UAAU;AAAA,YACV,MAAM;AAAA,YACN,SAAS;AAAA,YACT,OAAO;AAAA,UACT;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,MACA,sBAAsB;AACpB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,WAAW;AAAA,MAClB;AAAA,MACA,aAAa,OAAO;AAClB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,OAAO,KAAK,eAAe,KAAK,EAAE,QAAQ,gBAAgB,IAAI;AAAA,MACrE;AAAA,MACA,gBAAgB,OAAO;AACrB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,UAAU,KAAK,eAAe,KAAK,EAAE,QAAQ,gBAAgB,IAAI;AAAA,MACxE;AAAA,MACA,cAAc,OAAO;AACnB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,QAAQ,KAAK,eAAe,KAAK;AAAA,MACxC;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ,SAAS,OAAO;AACd,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,YAAI,KAAK,OAAO;AACd,cAAI,KAAK,KAAK,SAAS,IAAI,EAAG,MAAK,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAC/D,cAAI,KAAK,QAAQ,SAAS,IAAI;AAC5B,iBAAK,UAAU,KAAK,QAAQ,MAAM,GAAG,EAAE;AAAA,QAC3C;AACA,aAAK,KAAK,KAAK;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACF;;;AC7CO,SAAS,wBAAmC;AACjD,SAAO;AAAA,IACL,OAAO;AAAA,MACL,UAAU,OAAO;AACf,aAAK,MAAM,EAAE,MAAM,aAAa,UAAU,CAAC,EAAE,GAAG,KAAK;AAAA,MACvD;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ,iBAAiB,OAAO;AACtB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,WAAW,CAAC,EAAE,MAAM,QAAQ,OAAO,KAAK,eAAe,KAAK,EAAE,CAAC;AAAA,MACtE;AAAA,MACA,UAAU,OAAO;AACf,aAAK,KAAK,KAAK;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACF;;;ACjBO,SAAS,sBAAiC;AAC/C,SAAO;AAAA,IACL,OAAO;AAAA,MACL,QAAQ,OAAO;AACb,aAAK,MAAM,EAAE,MAAM,WAAW,OAAO,GAAG,GAAG,KAAK;AAAA,MAClD;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ,eAAe,OAAO;AACpB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,SAAS,KAAK,eAAe,KAAK;AAAA,MACzC;AAAA,MACA,QAAQ,OAAO;AACb,aAAK,KAAK,KAAK;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACF;;;ACjBO,SAAS,kBAA6B;AAC3C,SAAO;AAAA,IACL,OAAO;AAAA,MACL,IAAI,OAAO;AACT,aAAK,MAAM,EAAE,MAAM,OAAO,OAAO,GAAG,GAAG,KAAK;AAAA,MAC9C;AAAA,MACA,WAAW,OAAO;AAChB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,YAAI,KAAK,SAAS,MAAO,MAAK,QAAQ,KAAK,eAAe,KAAK;AAAA,MACjE;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ,IAAI,OAAO;AACT,aAAK,KAAK,KAAK;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACF;;;AChBO,SAAS,qBAA8B;AAC5C,SAAO;AAAA,IACL,UAAU;AAAA,MACR,SAAS,MAAgB;AACvB,cAAM,SAAS,KAAK,WAAW,MAAM;AACrC,cAAM,UAAU,KAAK,UAAU,IAAI,KAAK,OAAO,KAAK;AACpD,cAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,KAAK,KAAK;AAC9C,eAAO,GAAG,MAAM,KAAK,KAAK,IAAI,GAAG,OAAO,GAAG,KAAK;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AACF;;;ACVO,SAAS,sBAA+B;AAC7C,SAAO;AAAA,IACL,UAAU;AAAA,MACR,UACE,MACA,SACA,OACA,MACA;AACA,cAAM,OAAO,MAAM,MAAM,WAAkB;AAC3C,cAAM,UAAU,MAAM,kBAAkB,MAAM,IAAI;AAClD,aAAK;AACL,eAAO,KAAK,OAAO;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACF;;;ACjBO,SAAS,oBAA6B;AAC3C,SAAO;AAAA,IACL,UAAU;AAAA,MACR,QAAQ,MAAe;AACrB,eAAO,KAAK,KAAK,KAAK;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AACF;;;ACRO,SAAS,gBAAyB;AACvC,SAAO;AAAA,IACL,UAAU;AAAA,MACR,IAAI,MAAW;AACb,eAAO,IAAI,KAAK,KAAK;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AACF;;;ACRO,SAAS,wBAAwB,MAAY,QAAiB;AACnE,QAAM,MAAM,YAAY,CAAC,SAAc;AACrC,QAAI,OAAO,KAAK,YAAY,WAAW;AACrC,UAAI,OAAO,KAAK,UAAU,MAAM;AAGhC,UAAI,UAAU,KAAK,UAAU,OAAO,UAAU,MAAM;AAClD,cAAM,QAAQ,OAAO;AAAA,UACnB,KAAK,SAAS,MAAM;AAAA,UACpB,KAAK,SAAS,MAAM,SAAS;AAAA,QAC/B;AACA,cAAM,IAAI,MAAM,MAAM,aAAa;AACnC,YAAI,GAAG;AACL,iBAAO,EAAE,CAAC;AAAA,QACZ;AAAA,MACF;AAEA,WAAK,SAAS,CAAC;AACf,WAAK,KAAK,WAAW;AACrB,WAAK,KAAK,gBAAgB,CAAC;AAC3B,WAAK,KAAK,YAAY,eAAe;AACrC;AAAA,IACF;AAEA,UAAM,aAAa,KAAK,WAAW,CAAC;AACpC,QAAI,CAAC,cAAc,WAAW,SAAS,YAAa;AAEpD,UAAM,YAAY,WAAW,WAAW,CAAC;AACzC,QAAI,CAAC,aAAa,UAAU,SAAS,OAAQ;AAE7C,UAAM,QAAQ,UAAU,MAAM,MAAM,gBAAgB;AACpD,QAAI,CAAC,MAAO;AAEZ,UAAM,WAAW,MAAM,CAAC;AAExB,SAAK,UAAU,aAAa;AAC5B,SAAK,SAAS,CAAC;AACf,SAAK,KAAK,WAAW;AACrB,SAAK,KAAK,gBAAgB,CAAC;AAC3B,SAAK,KAAK,YAAY,eAAe;AAErC,cAAU,QAAQ,UAAU,MAAM,MAAM,MAAM,CAAC,EAAE,MAAM;AAEvD,QAAI,UAAU,MAAM,WAAW,GAAG;AAChC,iBAAW,SAAS,MAAM;AAAA,IAC5B,WACE,UAAU,YACV,OAAO,UAAU,SAAS,MAAM,WAAW,UAC3C;AACA,gBAAU,SAAS,MAAM,UAAU,MAAM,CAAC,EAAE;AAC5C,gBAAU,SAAS,MAAM,UAAU,MAAM,CAAC,EAAE;AAAA,IAC9C;AAAA,EACF,CAAC;AACH;;;ACnCO,IAAM,aAAa,WAAW,UAAU;AAcxC,IAAM,oBAAoB,WAAW,YAAY;AAuBjD,IAAM,aAAa,WAAW,qBAAqB;AAgCnD,IAAM,aAAa,WAAW,IAAI;AAoBlC,IAAM,gBAAgB,WAAW,YAAY;AAe7C,IAAM,mBAAmB,WAAW,gBAAgB;AAiBpD,SAAS,mBAAmB,MAAM;AACvC,SAAO,SAAS,QAAQ,OAAO;AACjC;AA8BO,SAAS,cAAc,MAAM;AAClC,SAAO,SAAS,MAAM,SAAS,MAAM,SAAS;AAChD;AAuBO,IAAM,qBAAqB,WAAW,cAAc;AAsBpD,IAAM,oBAAoB,WAAW,IAAI;AAUhD,SAAS,WAAW,OAAO;AACzB,SAAO;AAUP,WAAS,MAAM,MAAM;AACnB,WAAO,SAAS,QAAQ,OAAO,MAAM,MAAM,KAAK,OAAO,aAAa,IAAI,CAAC;AAAA,EAC3E;AACF;;;AC7MO,SAAS,aAAa,SAASE,KAAI,MAAM,KAAK;AACnD,QAAM,QAAQ,MAAM,MAAM,IAAI,OAAO;AACrC,MAAI,OAAO;AACX,SAAO;AAGP,WAAS,MAAM,MAAM;AACnB,QAAI,cAAc,IAAI,GAAG;AACvB,cAAQ,MAAM,IAAI;AAClB,aAAO,OAAO,IAAI;AAAA,IACpB;AACA,WAAOA,IAAG,IAAI;AAAA,EAChB;AAGA,WAAS,OAAO,MAAM;AACpB,QAAI,cAAc,IAAI,KAAK,SAAS,OAAO;AACzC,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AACA,YAAQ,KAAK,IAAI;AACjB,WAAOA,IAAG,IAAI;AAAA,EAChB;AACF;;;ACxDO,IAAM,WAAW;AAAA,EACtB,UAAU;AAAA,EACV,UAAU;AAAA,EACV,MAAM;AACR;AAGA,IAAMC,uBAAsB;AAAA,EAC1B,UAAUC;AAAA,EACV,SAAS;AACX;AAMA,SAAS,mBAAmB,SAASC,KAAI,KAAK;AAC5C,QAAM,OAAO;AACb,QAAM,OAAO,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAC/C,QAAM,cAAc,QAAQ,KAAK,CAAC,EAAE,SAAS,eAAe,KAAK,CAAC,EAAE,eAAe,KAAK,CAAC,GAAG,IAAI,EAAE,SAAS;AAC3G,MAAI,WAAW;AACf,SAAO;AAcP,WAAS,MAAM,MAAM;AACnB,YAAQ,MAAM,UAAU;AACxB,YAAQ,MAAM,eAAe;AAC7B,YAAQ,MAAM,uBAAuB;AACrC,WAAO,aAAa,IAAI;AAAA,EAC1B;AAcA,WAAS,aAAa,MAAM;AAC1B,QAAI,SAAS,IAAI;AACf,cAAQ,QAAQ,IAAI;AACpB;AACA,aAAO;AAAA,IACT;AACA,QAAI,WAAW,GAAG;AAChB,aAAO,IAAI,IAAI;AAAA,IACjB;AACA,YAAQ,KAAK,uBAAuB;AACpC,WAAO,aAAa,SAAS,YAAY,YAAY,EAAE,IAAI;AAAA,EAC7D;AAeA,WAAS,WAAW,MAAM;AACxB,QAAI,SAAS,QAAQ,mBAAmB,IAAI,GAAG;AAC7C,aAAO,UAAU,IAAI;AAAA,IACvB;AACA,YAAQ,MAAM,mBAAmB;AACjC,YAAQ,MAAM,eAAe;AAAA,MAC3B,aAAa;AAAA,IACf,CAAC;AACD,WAAO,KAAK,IAAI;AAAA,EAClB;AAcA,WAAS,KAAK,MAAM;AAClB,QAAI,SAAS,QAAQ,mBAAmB,IAAI,GAAG;AAC7C,cAAQ,KAAK,aAAa;AAC1B,cAAQ,KAAK,mBAAmB;AAChC,aAAO,UAAU,IAAI;AAAA,IACvB;AACA,QAAI,SAAS,IAAI;AACf,aAAO,IAAI,IAAI;AAAA,IACjB;AACA,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAcA,WAAS,UAAU,MAAM;AAEvB,YAAQ,KAAK,eAAe;AAC5B,QAAI,KAAK,WAAW;AAClB,aAAOA,IAAG,IAAI;AAAA,IAChB;AACA,WAAO,QAAQ,QAAQF,sBAAqB,2BAA2B,KAAK,EAAE,IAAI;AAAA,EACpF;AAeA,WAAS,0BAA0B,MAAM;AACvC,WAAO,QAAQ,QAAQ;AAAA,MACrB,UAAU;AAAA,MACV,SAAS;AAAA,IACX,GAAG,OAAO,YAAY,EAAE,IAAI;AAAA,EAC9B;AAcA,WAAS,aAAa,MAAM;AAC1B,YAAQ,cAAc,aAAa,SAAS,oBAAoB,cAAc,cAAc,CAAC,IAAI,oBAAoB,IAAI;AAAA,EAC3H;AAcA,WAAS,mBAAmB,MAAM;AAChC,QAAI,SAAS,MAAM;AACjB,aAAO,MAAM,IAAI;AAAA,IACnB;AACA,QAAI,mBAAmB,IAAI,GAAG;AAC5B,aAAO,QAAQ,QAAQA,sBAAqB,2BAA2B,KAAK,EAAE,IAAI;AAAA,IACpF;AACA,YAAQ,MAAM,eAAe;AAC7B,WAAO,aAAa,IAAI;AAAA,EAC1B;AAcA,WAAS,aAAa,MAAM;AAC1B,QAAI,SAAS,QAAQ,mBAAmB,IAAI,GAAG;AAC7C,cAAQ,KAAK,eAAe;AAC5B,aAAO,mBAAmB,IAAI;AAAA,IAChC;AACA,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAcA,WAAS,MAAM,MAAM;AACnB,YAAQ,KAAK,UAAU;AACvB,WAAOE,IAAG,IAAI;AAAA,EAChB;AAGA,WAAS,qBAAqBC,UAASD,KAAIE,MAAK;AAC9C,QAAI,OAAO;AAWX,WAAO,aAAaD,UAAS,qBAAqB,cAAc,KAAK,OAAO,WAAW,QAAQ,KAAK,SAAS,cAAc,IAAI,SAAY,CAAC;AAc5I,aAAS,oBAAoB,MAAM;AACjC,MAAAA,SAAQ,MAAM,eAAe;AAC7B,MAAAA,SAAQ,MAAM,uBAAuB;AACrC,aAAO,cAAc,IAAI;AAAA,IAC3B;AAcA,aAAS,cAAc,MAAM;AAC3B,UAAI,SAAS,IAAI;AACf;AACA,QAAAA,SAAQ,QAAQ,IAAI;AACpB,eAAO;AAAA,MACT;AACA,UAAI,OAAO,UAAU;AACnB,eAAOC,KAAI,IAAI;AAAA,MACjB;AACA,MAAAD,SAAQ,KAAK,uBAAuB;AACpC,aAAO,aAAaA,UAAS,oBAAoB,YAAY,EAAE,IAAI;AAAA,IACrE;AAcA,aAAS,mBAAmB,MAAM;AAChC,UAAI,SAAS,QAAQ,mBAAmB,IAAI,GAAG;AAC7C,QAAAA,SAAQ,KAAK,eAAe;AAC5B,eAAOD,IAAG,IAAI;AAAA,MAChB;AACA,aAAOE,KAAI,IAAI;AAAA,IACjB;AAAA,EACF;AACF;AAMA,SAASH,6BAA4B,SAASC,KAAI,KAAK;AACrD,QAAM,OAAO;AACb,SAAO;AAGP,WAAS,MAAM,MAAM;AACnB,QAAI,SAAS,MAAM;AACjB,aAAOA,IAAG,IAAI;AAAA,IAChB;AACA,YAAQ,MAAM,YAAY;AAC1B,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,YAAY;AACzB,WAAO;AAAA,EACT;AAGA,WAAS,UAAU,MAAM;AACvB,WAAO,KAAK,OAAO,KAAK,KAAK,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAIA,IAAG,IAAI;AAAA,EAChE;AACF;;;ACzUO,SAAS,SAAS,SAAS;AAChC,QAAM,WAAW,WAAW,CAAC;AAC7B,MAAI,SAAS,SAAS;AACtB,MAAI,WAAW,QAAQ,WAAW,QAAW;AAC3C,aAAS;AAAA,EACX;AACA,SAAO;AAAA,IACL,UAAU;AAAA,IACV,SAAS;AAAA,IACT;AAAA,IACA,MAAM;AAAA,EACR;AAMA,WAAS,iBAAiB,SAASG,KAAI,KAAK;AAC1C,UAAM,OAAO;AACb,QAAI,WAAW;AAEf,QAAI;AAEJ,QAAI;AACJ,WAAO;AAcP,aAAS,MAAM,MAAM;AACnB,cAAQ,MAAM,UAAU;AACxB,cAAQ,MAAM,kBAAkB;AAChC,aAAO,aAAa,IAAI;AAAA,IAC1B;AAaA,aAAS,aAAa,MAAM;AAC1B,UAAI,SAAS,IAAI;AACf,gBAAQ,QAAQ,IAAI;AACpB;AACA,eAAO;AAAA,MACT;AAGA,UAAI,WAAW,KAAK,CAAC,QAAQ;AAC3B,eAAO,IAAI,IAAI;AAAA,MACjB;AACA,cAAQ,KAAK,kBAAkB;AAC/B,aAAO,QAAQ,IAAI;AAAA,IACrB;AAYA,aAAS,QAAQ,MAAM;AACrB,UAAI,SAAS,MAAM;AACjB,eAAO,IAAI,IAAI;AAAA,MACjB;AACA,UAAI,SAAS,IAAI;AACf,gBAAQ,QAAQ,MAAM,kBAAkB;AACxC,eAAO;AACP,eAAO,cAAc,IAAI;AAAA,MAC3B;AAGA,UAAI,SAAS,IAAI;AACf,gBAAQ,MAAM,OAAO;AACrB,gBAAQ,QAAQ,IAAI;AACpB,gBAAQ,KAAK,OAAO;AACpB,eAAO;AAAA,MACT;AACA,UAAI,mBAAmB,IAAI,GAAG;AAC5B,gBAAQ,MAAM,YAAY;AAC1B,gBAAQ,QAAQ,IAAI;AACpB,gBAAQ,KAAK,YAAY;AACzB,eAAO;AAAA,MACT;AAGA,cAAQ,MAAM,cAAc;AAC5B,aAAO,KAAK,IAAI;AAAA,IAClB;AAYA,aAAS,KAAK,MAAM;AAClB,UAAI,SAAS,QAAQ,SAAS,MAAM,SAAS,MAAM,mBAAmB,IAAI,GAAG;AAC3E,gBAAQ,KAAK,cAAc;AAC3B,eAAO,QAAQ,IAAI;AAAA,MACrB;AACA,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAaA,aAAS,cAAc,MAAM;AAE3B,UAAI,SAAS,IAAI;AACf,gBAAQ,QAAQ,IAAI;AACpB;AACA,eAAO;AAAA,MACT;AAGA,UAAI,SAAS,UAAU;AACrB,gBAAQ,KAAK,kBAAkB;AAC/B,gBAAQ,KAAK,UAAU;AACvB,eAAOA,IAAG,IAAI;AAAA,MAChB;AAGA,YAAM,OAAO;AACb,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AACF;AAGA,SAAS,gBAAgB,QAAQ;AAC/B,MAAI,gBAAgB,OAAO,SAAS;AACpC,MAAI,iBAAiB;AAErB,MAAI;AAEJ,MAAI;AAGJ,OAAK,OAAO,cAAc,EAAE,CAAC,EAAE,SAAS,gBAAgB,OAAO,cAAc,EAAE,CAAC,EAAE,SAAS,aAAa,OAAO,aAAa,EAAE,CAAC,EAAE,SAAS,gBAAgB,OAAO,aAAa,EAAE,CAAC,EAAE,SAAS,UAAU;AACpM,YAAQ;AAGR,WAAO,EAAE,QAAQ,eAAe;AAC9B,UAAI,OAAO,KAAK,EAAE,CAAC,EAAE,SAAS,gBAAgB;AAE5C,eAAO,aAAa,EAAE,CAAC,EAAE,OAAO;AAChC,eAAO,cAAc,EAAE,CAAC,EAAE,OAAO;AACjC,0BAAkB;AAClB,yBAAiB;AACjB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,UAAQ,iBAAiB;AACzB;AACA,SAAO,EAAE,SAAS,eAAe;AAC/B,QAAI,UAAU,QAAW;AACvB,UAAI,UAAU,iBAAiB,OAAO,KAAK,EAAE,CAAC,EAAE,SAAS,cAAc;AACrE,gBAAQ;AAAA,MACV;AAAA,IACF,WAAW,UAAU,iBAAiB,OAAO,KAAK,EAAE,CAAC,EAAE,SAAS,cAAc;AAC5E,aAAO,KAAK,EAAE,CAAC,EAAE,OAAO;AACxB,UAAI,UAAU,QAAQ,GAAG;AACvB,eAAO,KAAK,EAAE,CAAC,EAAE,MAAM,OAAO,QAAQ,CAAC,EAAE,CAAC,EAAE;AAC5C,eAAO,OAAO,QAAQ,GAAG,QAAQ,QAAQ,CAAC;AAC1C,yBAAiB,QAAQ,QAAQ;AACjC,gBAAQ,QAAQ;AAAA,MAClB;AACA,cAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,SAAS,MAAM;AAEtB,SAAO,SAAS,MAAM,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC,EAAE,CAAC,EAAE,SAAS;AACxE;;;ACtNO,SAAS,KAAK,SAAS;AAC5B,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,EAAE,GAAG;AAAA,IACR;AAAA,IACA,MAAM;AAAA,MACJ,CAAC,EAAE,GAAG,SAAS,OAAO;AAAA,IACxB;AAAA,EACF;AACF;;;ACpBO,SAASC,MAAK;AAAC;;;ACIf,SAAS,cAAc,OAAO,WAAW;AAC9C,QAAM,SAAS,OAAO,KAAK;AAC3B,MAAI,QAAQ,OAAO,QAAQ,SAAS;AACpC,MAAI,WAAW;AACf,MAAI,QAAQ;AACZ,MAAI,MAAM;AAEV,MAAI,OAAO,cAAc,UAAU;AACjC,UAAM,IAAI,UAAU,oBAAoB;AAAA,EAC1C;AAEA,SAAO,UAAU,IAAI;AACnB,QAAI,UAAU,UAAU;AACtB,UAAI,EAAE,QAAQ,KAAK;AACjB,cAAM;AAAA,MACR;AAAA,IACF,OAAO;AACL,cAAQ;AAAA,IACV;AAEA,eAAW,QAAQ,UAAU;AAC7B,YAAQ,OAAO,QAAQ,WAAW,QAAQ;AAAA,EAC5C;AAEA,SAAO;AACT;;;ACLO,SAAS,mBAAmB;AACjC,SAAO;AAAA,IACL,OAAO;AAAA,MACL,UAAU;AAAA,MACV,mBAAmB;AAAA,MACnB,UAAU;AAAA,IACZ;AAAA,IACA,MAAM;AAAA,MACJ,UAAU;AAAA,MACV,eAAe;AAAA,MACf,mBAAmB;AAAA,MACnB,eAAe;AAAA,MACf,UAAU;AAAA,MACV,cAAc;AAAA,IAChB;AAAA,EACF;AAMA,WAAS,cAAc,OAAO;AAE5B,UAAM,OAAO;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT,YAAY,EAAC,WAAW,CAAC,iBAAiB,cAAc,EAAC;AAAA,MACzD,UAAU,CAAC;AAAA,IACb;AACA,SAAK;AAAA,MACH;AAAA,QACE,MAAM;AAAA,QACN,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM,EAAC,OAAO,OAAO,WAAW,CAAC,IAAI,EAAC;AAAA,MACxC;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAMA,WAAS,oBAAoB;AAC3B,SAAK,OAAO;AAAA,EACd;AAMA,WAAS,mBAAmB;AAC1B,UAAM,OAAO,KAAK,OAAO;AACzB,UAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,IAAAC,IAAO,KAAK,SAAS,MAAM;AAC3B,SAAK,OAAO;AAAA,EACd;AAMA,WAAS,oBAAoB;AAE3B,QAAI,KAAK,KAAK,eAAgB;AAC9B,SAAK,OAAO;AACZ,SAAK,KAAK,iBAAiB;AAAA,EAC7B;AAMA,WAAS,aAAa,OAAO;AAC3B,UAAM,OAAO,KAAK,OAAO,EAAE,QAAQ,4BAA4B,EAAE;AACjE,UAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,IAAAA,IAAO,KAAK,SAAS,MAAM;AAC3B,SAAK,KAAK,KAAK;AACf,SAAK,QAAQ;AAEb,UAAM;AAAA;AAAA,MAAmC,KAAK,KAAK,UAAU,CAAC;AAAA;AAC9D,IAAAA,IAAO,KAAK,SAAS,SAAS;AAC9B,IAAAA,IAAO,KAAK,YAAY,MAAM;AAC9B,SAAK,SAAS,KAAK,EAAC,MAAM,QAAQ,OAAO,KAAI,CAAC;AAC9C,SAAK,KAAK,iBAAiB;AAAA,EAC7B;AAMA,WAAS,cAAc,OAAO;AAC5B,SAAK;AAAA,MACH;AAAA,QACE,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM;AAAA,UACJ,OAAO;AAAA,UACP,aAAa,EAAC,WAAW,CAAC,iBAAiB,aAAa,EAAC;AAAA,UACzD,WAAW,CAAC;AAAA,QACd;AAAA,MACF;AAAA,MACA;AAAA,IACF;AACA,SAAK,OAAO;AAAA,EACd;AAMA,WAAS,aAAa,OAAO;AAC3B,UAAM,OAAO,KAAK,OAAO;AACzB,UAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,IAAAA,IAAO,KAAK,SAAS,YAAY;AACjC,SAAK,KAAK,KAAK;AACf,SAAK,QAAQ;AACb,UAAM;AAAA;AAAA;AAAA,MAEJ,KAAK,KAAK;AAAA;AAEZ,aAAS,KAAK,EAAC,MAAM,QAAQ,OAAO,KAAI,CAAC;AAAA,EAC3C;AAMA,WAAS,aAAa,OAAO;AAC3B,SAAK,OAAO,MAAM,KAAK,KAAK,MAAM,KAAK;AACvC,SAAK,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK;AAAA,EACxC;AACF;AAUO,SAAS,eAAe,SAAS;AACtC,MAAI,UAAU,WAAW,CAAC,GAAG;AAE7B,MAAI,WAAW,QAAQ,WAAW,QAAW;AAC3C,aAAS;AAAA,EACX;AAEA,aAAW,OAAO;AAElB,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,EAAC,WAAW,MAAM,aAAa,eAAc;AAAA,MAC7C,EAAC,WAAW,MAAM,aAAa,eAAc;AAAA,MAC7C;AAAA,QACE,WAAW;AAAA,QACX,OAAO,SAAS,SAAY;AAAA,QAC5B,aAAa;AAAA,MACf;AAAA,MACA,EAAC,WAAW,KAAK,aAAa,eAAc;AAAA,MAC5C,EAAC,SAAS,MAAM,WAAW,KAAK,OAAO,MAAK;AAAA,IAC9C;AAAA,IACA,UAAU,EAAC,MAAAC,OAAM,WAAU;AAAA,EAC7B;AAQA,WAASA,MAAK,MAAM,GAAG,OAAO,MAAM;AAClC,UAAM,MAAM,KAAK,SAAS;AAC1B,UAAM,UAAU,MAAM,cAAc,IAAI;AACxC,UAAM,WAAW,IAAI,OAAO,KAAK,IAAI,cAAc,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;AACpE,UAAM,OAAO,MAAM,MAAM,UAAU;AACnC,QAAI,QAAQ,QAAQ,KAAK,QAAQ;AAEjC,QAAI,KAAK,MAAM;AACb,YAAM,UAAU,MAAM,MAAM,cAAc;AAC1C,eAAS,QAAQ;AAAA,QACf,MAAM,KAAK,KAAK,MAAM;AAAA,UACpB,OAAO;AAAA,UACP,QAAQ;AAAA,UACR,QAAQ,CAAC,GAAG;AAAA,UACZ,GAAG,QAAQ,QAAQ;AAAA,QACrB,CAAC;AAAA,MACH;AACA,cAAQ;AAAA,IACV;AAEA,aAAS,QAAQ,KAAK,IAAI;AAE1B,QAAI,KAAK;AACP,eAAS,QAAQ,KAAK,MAAM,IAAI;AAAA,IAClC;AAEA,aAAS,QAAQ,KAAK,QAAQ;AAC9B,SAAK;AACL,WAAO;AAAA,EACT;AAQA,WAAS,WAAW,MAAM,GAAG,OAAO;AAClC,QAAI,QAAQ,KAAK,SAAS;AAC1B,QAAI,OAAO;AAEX,QAAI,CAAC,OAAQ;AAKb,WACE,IAAI,OAAO,aAAa,MAAM,OAAO,IAAI,IAAI,UAAU,EAAE,KAAK,KAAK,GACnE;AACA;AAAA,IACF;AAEA,UAAM,WAAW,IAAI,OAAO,IAAI;AAKhC;AAAA;AAAA,MAEE,WAAW,KAAK,KAAK;AAAA,OAEnB,WAAW,KAAK,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,MAE/C,UAAU,KAAK,KAAK;AAAA,MACtB;AACA,cAAQ,MAAM,QAAQ;AAAA,IACxB;AAEA,QAAI,QAAQ;AASZ,WAAO,EAAE,QAAQ,MAAM,OAAO,QAAQ;AACpC,YAAM,UAAU,MAAM,OAAO,KAAK;AAKlC,UAAI,CAAC,QAAQ,QAAS;AAEtB,YAAM,aAAa,MAAM,eAAe,OAAO;AAE/C,UAAI;AAEJ,aAAQ,QAAQ,WAAW,KAAK,KAAK,GAAI;AACvC,YAAI,WAAW,MAAM;AAGrB,YACE,MAAM,YAAY,QAAQ,MAAM,MAChC,MAAM,YAAY,WAAW,CAAC,MAAM,IACpC;AACA;AAAA,QACF;AAEA,gBAAQ,MAAM,MAAM,GAAG,QAAQ,IAAI,MAAM,MAAM,MAAM,MAAM,QAAQ,CAAC;AAAA,MACtE;AAAA,IACF;AAEA,WAAO,WAAW,QAAQ;AAAA,EAC5B;AAKA,WAAS,iBAAiB;AACxB,WAAO;AAAA,EACT;AACF;;;ACxRA,IAAM,iBAAkD;AAAA,EACtD,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,MAAM;AAAA,EACN,iBAAiB;AAAA,EACjB,MAAM;AACR;AAEe,SAAR,eACL,UAC+C;AAC/C,QAAM,OAAO,EAAE,GAAG,gBAAgB,GAAG,SAAS;AAE9C,QAAM,OAAQ,KAAyB,KAAK;AAE5C,OAAK,wBAAwB,CAAC;AAC9B,OAAK,2BAA2B,CAAC;AACjC,OAAK,yBAAyB,CAAC;AAE/B,MAAI,KAAK,WAAW;AAClB,SAAK,oBAAoB,KAAK,eAAe,CAAC;AAC9C,SAAK,uBAAuB,KAAK,qBAAqB,CAAC;AACvD,SAAK,qBAAqB,KAAK,mBAAmB,CAAC;AAAA,EACrD;AACA,MAAI,KAAK,UAAU;AACjB,SAAK,oBAAoB,KAAK,cAAc,CAAC;AAC7C,SAAK,uBAAuB,KAAK,oBAAoB,CAAC;AACtD,SAAK,qBAAqB,KAAK,kBAAkB,CAAC;AAAA,EACpD;AACA,MAAI,KAAK,MAAM;AACb,SAAK,oBAAoB,KAAK,UAAU,CAAC;AACzC,SAAK,uBAAuB,KAAK,gBAAgB,CAAC;AAClD,SAAK,qBAAqB,KAAK,cAAc,CAAC;AAAA,EAChD;AACA,MAAI,KAAK,YAAY;AACnB,SAAK,oBAAoB,KAAK,gBAAgB,CAAC;AAC/C,SAAK,uBAAuB,KAAK,sBAAsB,CAAC;AACxD,SAAK,qBAAqB,KAAK,oBAAoB,CAAC;AAAA,EACtD;AACA,MAAI,KAAK,MAAM;AACb,SAAK,oBAAoB,KAAK,KAAW,CAAC;AAC1C,SAAK,uBAAuB,KAAK,iBAAiB,CAAC;AACnD,SAAK,qBAAqB,KAAK,eAAe,CAAC;AAAA,EACjD;AAEA,QAAM,iBAAiB,KAAK,YAAY,KAAK;AAC7C,MAAI,CAAC,eAAgB,QAAO;AAE5B,SAAO,CAAC,MAAY,SAAc;AAChC,QAAI,KAAK,UAAU;AACjB;AAAA,QACE;AAAA,QACA;AAAA,QACA,CAAC,OAAgB,OAA2B,WAAgB;AAC1D,cAAI,UAAU,OAAO,UAAU,UAAU;AACvC,mBAAO,SAAS,OAAO,OAAO,CAAC;AAC/B,mBAAO;AAAA,UACT;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,QAAI,KAAK,iBAAiB;AACxB,8BAAwB,MAAM,OAAO,IAAI,CAAC;AAAA,IAC5C;AAAA,EACF;AACF;","names":["index","is","visit","ok","isLineEnding","tokenize","ok","isLineEnding","ok","HASH","tokenize","ok","previous","ok","nonLazyContinuation","tokenizeNonLazyContinuation","ok","effects","nok","ok","ok","ok","math"]}
+{"version":3,"sources":["../node_modules/unist-util-is/lib/index.js","../node_modules/unist-util-visit-parents/lib/color.node.js","../node_modules/unist-util-visit-parents/lib/index.js","../node_modules/unist-util-visit/lib/index.js","../node_modules/micromark-util-symbol/lib/codes.js","../src/lib/syntax/wikilink.ts","../src/lib/syntax/highlight.ts","../src/lib/syntax/comment.ts","../src/lib/syntax/tag.ts","../src/lib/mdast/wikilink.ts","../src/lib/mdast/highlight.ts","../src/lib/mdast/comment.ts","../src/lib/mdast/tag.ts","../src/lib/mdast/wikilink-to-markdown.ts","../src/lib/mdast/highlight-to-markdown.ts","../src/lib/mdast/comment-to-markdown.ts","../src/lib/mdast/tag-to-markdown.ts","../src/lib/task-char.ts","../node_modules/micromark-util-character/index.js","../node_modules/micromark-factory-space/index.js","../node_modules/micromark-extension-math/lib/math-flow.js","../node_modules/micromark-extension-math/lib/math-text.js","../node_modules/micromark-extension-math/lib/syntax.js","../node_modules/devlop/lib/default.js","../node_modules/longest-streak/index.js","../node_modules/mdast-util-math/lib/index.js","../src/index.ts"],"sourcesContent":["/**\n * @import {Node, Parent} from 'unist'\n */\n\n/**\n * @template Fn\n * @template Fallback\n * @typedef {Fn extends (value: any) => value is infer Thing ? Thing : Fallback} Predicate\n */\n\n/**\n * @callback Check\n *   Check that an arbitrary value is a node.\n * @param {unknown} this\n *   The given context.\n * @param {unknown} [node]\n *   Anything (typically a node).\n * @param {number | null | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean}\n *   Whether this is a node and passes a test.\n *\n * @typedef {Record<string, unknown> | Node} Props\n *   Object to check for equivalence.\n *\n *   Note: `Node` is included as it is common but is not indexable.\n *\n * @typedef {Array<Props | TestFunction | string> | ReadonlyArray<Props | TestFunction | string> | Props | TestFunction | string | null | undefined} Test\n *   Check for an arbitrary node.\n *\n * @callback TestFunction\n *   Check if a node passes a test.\n * @param {unknown} this\n *   The given context.\n * @param {Node} node\n *   A node.\n * @param {number | undefined} [index]\n *   The node’s position in its parent.\n * @param {Parent | undefined} [parent]\n *   The node’s parent.\n * @returns {boolean | undefined | void}\n *   Whether this node passes the test.\n *\n *   Note: `void` is included until TS sees no return as `undefined`.\n */\n\n/**\n * Check if `node` is a `Node` and whether it passes the given test.\n *\n * @param {unknown} node\n *   Thing to check, typically `Node`.\n * @param {Test} test\n *   A check for a specific node.\n * @param {number | null | undefined} index\n *   The node’s position in its parent.\n * @param {Parent | null | undefined} parent\n *   The node’s parent.\n * @param {unknown} context\n *   Context object (`this`) to pass to `test` functions.\n * @returns {boolean}\n *   Whether `node` is a node and passes a test.\n */\nexport const is =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends ReadonlyArray<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends Array<string>>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition[number]}) &\n   *   (<Condition extends string>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(node: unknown, test: Condition, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((node?: null | undefined) => false) &\n   *   ((node: unknown, test?: null | undefined, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((node: unknown, test?: Test, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => boolean)\n   * )}\n   */\n  (\n    /**\n     * @param {unknown} [node]\n     * @param {Test} [test]\n     * @param {number | null | undefined} [index]\n     * @param {Parent | null | undefined} [parent]\n     * @param {unknown} [context]\n     * @returns {boolean}\n     */\n    // eslint-disable-next-line max-params\n    function (node, test, index, parent, context) {\n      const check = convert(test)\n\n      if (\n        index !== undefined &&\n        index !== null &&\n        (typeof index !== 'number' ||\n          index < 0 ||\n          index === Number.POSITIVE_INFINITY)\n      ) {\n        throw new Error('Expected positive finite index')\n      }\n\n      if (\n        parent !== undefined &&\n        parent !== null &&\n        (!is(parent) || !parent.children)\n      ) {\n        throw new Error('Expected parent node')\n      }\n\n      if (\n        (parent === undefined || parent === null) !==\n        (index === undefined || index === null)\n      ) {\n        throw new Error('Expected both parent and index')\n      }\n\n      return looksLikeANode(node)\n        ? check.call(context, node, index, parent)\n        : false\n    }\n  )\n\n/**\n * Generate an assertion from a test.\n *\n * Useful if you’re going to test many nodes, for example when creating a\n * utility where something else passes a compatible test.\n *\n * The created function is a bit faster because it expects valid input only:\n * a `node`, `index`, and `parent`.\n *\n * @param {Test} test\n *   *   when nullish, checks if `node` is a `Node`.\n *   *   when `string`, works like passing `(node) => node.type === test`.\n *   *   when `function` checks if function passed the node is true.\n *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.\n *   *   when `array`, checks if any one of the subtests pass.\n * @returns {Check}\n *   An assertion.\n */\nexport const convert =\n  // Note: overloads in JSDoc can’t yet use different `@template`s.\n  /**\n   * @type {(\n   *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &\n   *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &\n   *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &\n   *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &\n   *   ((test?: Test) => Check)\n   * )}\n   */\n  (\n    /**\n     * @param {Test} [test]\n     * @returns {Check}\n     */\n    function (test) {\n      if (test === null || test === undefined) {\n        return ok\n      }\n\n      if (typeof test === 'function') {\n        return castFactory(test)\n      }\n\n      if (typeof test === 'object') {\n        return Array.isArray(test)\n          ? anyFactory(test)\n          : // Cast because `ReadonlyArray` goes into the above but `isArray`\n            // narrows to `Array`.\n            propertiesFactory(/** @type {Props} */ (test))\n      }\n\n      if (typeof test === 'string') {\n        return typeFactory(test)\n      }\n\n      throw new Error('Expected function, string, or object as test')\n    }\n  )\n\n/**\n * @param {Array<Props | TestFunction | string>} tests\n * @returns {Check}\n */\nfunction anyFactory(tests) {\n  /** @type {Array<Check>} */\n  const checks = []\n  let index = -1\n\n  while (++index < tests.length) {\n    checks[index] = convert(tests[index])\n  }\n\n  return castFactory(any)\n\n  /**\n   * @this {unknown}\n   * @type {TestFunction}\n   */\n  function any(...parameters) {\n    let index = -1\n\n    while (++index < checks.length) {\n      if (checks[index].apply(this, parameters)) return true\n    }\n\n    return false\n  }\n}\n\n/**\n * Turn an object into a test for a node with a certain fields.\n *\n * @param {Props} check\n * @returns {Check}\n */\nfunction propertiesFactory(check) {\n  const checkAsRecord = /** @type {Record<string, unknown>} */ (check)\n\n  return castFactory(all)\n\n  /**\n   * @param {Node} node\n   * @returns {boolean}\n   */\n  function all(node) {\n    const nodeAsRecord = /** @type {Record<string, unknown>} */ (\n      /** @type {unknown} */ (node)\n    )\n\n    /** @type {string} */\n    let key\n\n    for (key in check) {\n      if (nodeAsRecord[key] !== checkAsRecord[key]) return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Turn a string into a test for a node with a certain type.\n *\n * @param {string} check\n * @returns {Check}\n */\nfunction typeFactory(check) {\n  return castFactory(type)\n\n  /**\n   * @param {Node} node\n   */\n  function type(node) {\n    return node && node.type === check\n  }\n}\n\n/**\n * Turn a custom test into a test for a node that passes that test.\n *\n * @param {TestFunction} testFunction\n * @returns {Check}\n */\nfunction castFactory(testFunction) {\n  return check\n\n  /**\n   * @this {unknown}\n   * @type {Check}\n   */\n  function check(value, index, parent) {\n    return Boolean(\n      looksLikeANode(value) &&\n        testFunction.call(\n          this,\n          value,\n          typeof index === 'number' ? index : undefined,\n          parent || undefined\n        )\n    )\n  }\n}\n\nfunction ok() {\n  return true\n}\n\n/**\n * @param {unknown} value\n * @returns {value is Node}\n */\nfunction looksLikeANode(value) {\n  return value !== null && typeof value === 'object' && 'type' in value\n}\n","/**\n * @param {string} d\n * @returns {string}\n */\nexport function color(d) {\n  return '\\u001B[33m' + d + '\\u001B[39m'\n}\n","/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<infer T>\n *   ? MatchesOne<Value, T>\n *   : Check extends Array<infer T>\n *   ? MatchesOne<Value, T>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {InternalAncestor<InclusiveDescendant<Tree>, Child>} Ancestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {'skip' | boolean} Action\n *   Union of the action types.\n *\n * @typedef {number} Index\n *   Move to the sibling at `index` next (after node itself is completely\n *   traversed).\n *\n *   Useful if mutating the tree, such as removing the node the visitor is\n *   currently on, or any of its previous siblings.\n *   Results less than 0 or greater than or equal to `children.length` stop\n *   traversing the parent.\n *\n * @typedef {[(Action | null | undefined | void)?, (Index | null | undefined)?]} ActionTuple\n *   List with one or two values, the first an action, the second an index.\n *\n * @typedef {Action | ActionTuple | Index | null | undefined | void} VisitorResult\n *   Any value that can be returned from a visitor.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform the parent of node (the last of `ancestors`).\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of an ancestor still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Array<VisitedParents>} ancestors\n *   Ancestors of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [VisitedParents=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Matches<InclusiveDescendant<Tree>, Check>, Ancestor<Tree, Matches<InclusiveDescendant<Tree>, Check>>>} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parents`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Tree type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {convert} from 'unist-util-is'\nimport {color} from 'unist-util-visit-parents/do-not-use-color'\n\n/** @type {Readonly<ActionTuple>} */\nconst empty = []\n\n/**\n * Continue traversing as normal.\n */\nexport const CONTINUE = true\n\n/**\n * Stop traversing immediately.\n */\nexport const EXIT = false\n\n/**\n * Do not traverse this node’s children.\n */\nexport const SKIP = 'skip'\n\n/**\n * Visit nodes, with ancestral information.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} test\n *   `unist-util-is`-compatible test\n * @param {Visitor | boolean | null | undefined} [visitor]\n *   Handle each node.\n * @param {boolean | null | undefined} [reverse]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visitParents(tree, test, visitor, reverse) {\n  /** @type {Test} */\n  let check\n\n  if (typeof test === 'function' && typeof visitor !== 'function') {\n    reverse = visitor\n    // @ts-expect-error no visitor given, so `visitor` is test.\n    visitor = test\n  } else {\n    // @ts-expect-error visitor given, so `test` isn’t a visitor.\n    check = test\n  }\n\n  const is = convert(check)\n  const step = reverse ? -1 : 1\n\n  factory(tree, undefined, [])()\n\n  /**\n   * @param {UnistNode} node\n   * @param {number | undefined} index\n   * @param {Array<UnistParent>} parents\n   */\n  function factory(node, index, parents) {\n    const value = /** @type {Record<string, unknown>} */ (\n      node && typeof node === 'object' ? node : {}\n    )\n\n    if (typeof value.type === 'string') {\n      const name =\n        // `hast`\n        typeof value.tagName === 'string'\n          ? value.tagName\n          : // `xast`\n            typeof value.name === 'string'\n            ? value.name\n            : undefined\n\n      Object.defineProperty(visit, 'name', {\n        value:\n          'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'\n      })\n    }\n\n    return visit\n\n    function visit() {\n      /** @type {Readonly<ActionTuple>} */\n      let result = empty\n      /** @type {Readonly<ActionTuple>} */\n      let subresult\n      /** @type {number} */\n      let offset\n      /** @type {Array<UnistParent>} */\n      let grandparents\n\n      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {\n        // @ts-expect-error: `visitor` is now a visitor.\n        result = toResult(visitor(node, parents))\n\n        if (result[0] === EXIT) {\n          return result\n        }\n      }\n\n      if ('children' in node && node.children) {\n        const nodeAsParent = /** @type {UnistParent} */ (node)\n\n        if (nodeAsParent.children && result[0] !== SKIP) {\n          offset = (reverse ? nodeAsParent.children.length : -1) + step\n          grandparents = parents.concat(nodeAsParent)\n\n          while (offset > -1 && offset < nodeAsParent.children.length) {\n            const child = nodeAsParent.children[offset]\n\n            subresult = factory(child, offset, grandparents)()\n\n            if (subresult[0] === EXIT) {\n              return subresult\n            }\n\n            offset =\n              typeof subresult[1] === 'number' ? subresult[1] : offset + step\n          }\n        }\n      }\n\n      return result\n    }\n  }\n}\n\n/**\n * Turn a return value into a clean result.\n *\n * @param {VisitorResult} value\n *   Valid return values from visitors.\n * @returns {Readonly<ActionTuple>}\n *   Clean result.\n */\nfunction toResult(value) {\n  if (Array.isArray(value)) {\n    return value\n  }\n\n  if (typeof value === 'number') {\n    return [CONTINUE, value]\n  }\n\n  return value === null || value === undefined ? empty : [value]\n}\n","/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n * @import {VisitorResult} from 'unist-util-visit-parents'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n// To do: use types from `unist-util-visit-parents` when it’s released.\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<any>\n *   ? MatchesOne<Value, Check[number]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends UnistNode ? number | undefined : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends UnistParent ? Ancestor | undefined : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [Ancestor=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Visited, Parent<Ancestor, Visited>>} BuildVisitorFromMatch\n *   Build a typed `Visitor` function from a node and all possible parents.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Visited\n *   Node type.\n * @template {UnistParent} Ancestor\n *   Parent type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     Matches<Descendant, Check>,\n *     Extract<Descendant, UnistParent>\n *   >\n * )} BuildVisitorFromDescendants\n *   Build a typed `Visitor` function from a list of descendants and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Node type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} testOrVisitor\n *   `unist-util-is`-compatible test (optional, omit to pass a visitor).\n * @param {Visitor | boolean | null | undefined} [visitorOrReverse]\n *   Handle each node (when test is omitted, pass `reverse`).\n * @param {boolean | null | undefined} [maybeReverse=false]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visit(tree, testOrVisitor, visitorOrReverse, maybeReverse) {\n  /** @type {boolean | null | undefined} */\n  let reverse\n  /** @type {Test} */\n  let test\n  /** @type {Visitor} */\n  let visitor\n\n  if (\n    typeof testOrVisitor === 'function' &&\n    typeof visitorOrReverse !== 'function'\n  ) {\n    test = undefined\n    visitor = testOrVisitor\n    reverse = visitorOrReverse\n  } else {\n    // @ts-expect-error: assume the overload with test was given.\n    test = testOrVisitor\n    // @ts-expect-error: assume the overload with test was given.\n    visitor = visitorOrReverse\n    reverse = maybeReverse\n  }\n\n  visitParents(tree, test, overload, reverse)\n\n  /**\n   * @param {UnistNode} node\n   * @param {Array<UnistParent>} parents\n   */\n  function overload(node, parents) {\n    const parent = parents[parents.length - 1]\n    const index = parent ? parent.children.indexOf(node) : undefined\n    return visitor(node, index, parent)\n  }\n}\n","/**\n * Character codes.\n *\n * This module is compiled away!\n *\n * micromark works based on character codes.\n * This module contains constants for the ASCII block and the replacement\n * character.\n * A couple of them are handled in a special way, such as the line endings\n * (CR, LF, and CR+LF, commonly known as end-of-line: EOLs), the tab (horizontal\n * tab) and its expansion based on what column it’s at (virtual space),\n * and the end-of-file (eof) character.\n * As values are preprocessed before handling them, the actual characters LF,\n * CR, HT, and NUL (which is present as the replacement character), are\n * guaranteed to not exist.\n *\n * Unicode basic latin block.\n */\nexport const codes = /** @type {const} */ ({\n  carriageReturn: -5,\n  lineFeed: -4,\n  carriageReturnLineFeed: -3,\n  horizontalTab: -2,\n  virtualSpace: -1,\n  eof: null,\n  nul: 0,\n  soh: 1,\n  stx: 2,\n  etx: 3,\n  eot: 4,\n  enq: 5,\n  ack: 6,\n  bel: 7,\n  bs: 8,\n  ht: 9, // `\\t`\n  lf: 10, // `\\n`\n  vt: 11, // `\\v`\n  ff: 12, // `\\f`\n  cr: 13, // `\\r`\n  so: 14,\n  si: 15,\n  dle: 16,\n  dc1: 17,\n  dc2: 18,\n  dc3: 19,\n  dc4: 20,\n  nak: 21,\n  syn: 22,\n  etb: 23,\n  can: 24,\n  em: 25,\n  sub: 26,\n  esc: 27,\n  fs: 28,\n  gs: 29,\n  rs: 30,\n  us: 31,\n  space: 32,\n  exclamationMark: 33, // `!`\n  quotationMark: 34, // `\"`\n  numberSign: 35, // `#`\n  dollarSign: 36, // `$`\n  percentSign: 37, // `%`\n  ampersand: 38, // `&`\n  apostrophe: 39, // `'`\n  leftParenthesis: 40, // `(`\n  rightParenthesis: 41, // `)`\n  asterisk: 42, // `*`\n  plusSign: 43, // `+`\n  comma: 44, // `,`\n  dash: 45, // `-`\n  dot: 46, // `.`\n  slash: 47, // `/`\n  digit0: 48, // `0`\n  digit1: 49, // `1`\n  digit2: 50, // `2`\n  digit3: 51, // `3`\n  digit4: 52, // `4`\n  digit5: 53, // `5`\n  digit6: 54, // `6`\n  digit7: 55, // `7`\n  digit8: 56, // `8`\n  digit9: 57, // `9`\n  colon: 58, // `:`\n  semicolon: 59, // `;`\n  lessThan: 60, // `<`\n  equalsTo: 61, // `=`\n  greaterThan: 62, // `>`\n  questionMark: 63, // `?`\n  atSign: 64, // `@`\n  uppercaseA: 65, // `A`\n  uppercaseB: 66, // `B`\n  uppercaseC: 67, // `C`\n  uppercaseD: 68, // `D`\n  uppercaseE: 69, // `E`\n  uppercaseF: 70, // `F`\n  uppercaseG: 71, // `G`\n  uppercaseH: 72, // `H`\n  uppercaseI: 73, // `I`\n  uppercaseJ: 74, // `J`\n  uppercaseK: 75, // `K`\n  uppercaseL: 76, // `L`\n  uppercaseM: 77, // `M`\n  uppercaseN: 78, // `N`\n  uppercaseO: 79, // `O`\n  uppercaseP: 80, // `P`\n  uppercaseQ: 81, // `Q`\n  uppercaseR: 82, // `R`\n  uppercaseS: 83, // `S`\n  uppercaseT: 84, // `T`\n  uppercaseU: 85, // `U`\n  uppercaseV: 86, // `V`\n  uppercaseW: 87, // `W`\n  uppercaseX: 88, // `X`\n  uppercaseY: 89, // `Y`\n  uppercaseZ: 90, // `Z`\n  leftSquareBracket: 91, // `[`\n  backslash: 92, // `\\`\n  rightSquareBracket: 93, // `]`\n  caret: 94, // `^`\n  underscore: 95, // `_`\n  graveAccent: 96, // `` ` ``\n  lowercaseA: 97, // `a`\n  lowercaseB: 98, // `b`\n  lowercaseC: 99, // `c`\n  lowercaseD: 100, // `d`\n  lowercaseE: 101, // `e`\n  lowercaseF: 102, // `f`\n  lowercaseG: 103, // `g`\n  lowercaseH: 104, // `h`\n  lowercaseI: 105, // `i`\n  lowercaseJ: 106, // `j`\n  lowercaseK: 107, // `k`\n  lowercaseL: 108, // `l`\n  lowercaseM: 109, // `m`\n  lowercaseN: 110, // `n`\n  lowercaseO: 111, // `o`\n  lowercaseP: 112, // `p`\n  lowercaseQ: 113, // `q`\n  lowercaseR: 114, // `r`\n  lowercaseS: 115, // `s`\n  lowercaseT: 116, // `t`\n  lowercaseU: 117, // `u`\n  lowercaseV: 118, // `v`\n  lowercaseW: 119, // `w`\n  lowercaseX: 120, // `x`\n  lowercaseY: 121, // `y`\n  lowercaseZ: 122, // `z`\n  leftCurlyBrace: 123, // `{`\n  verticalBar: 124, // `|`\n  rightCurlyBrace: 125, // `}`\n  tilde: 126, // `~`\n  del: 127,\n  // Unicode Specials block.\n  byteOrderMarker: 65_279,\n  // Unicode Specials block.\n  replacementCharacter: 65_533 // `�`\n})\n","import type {\n  Code,\n  Effects,\n  Extension,\n  State,\n  TokenizeContext,\n} from \"micromark-util-types\";\nimport { codes } from \"micromark-util-symbol\";\n\nconst EXCLAMATION = 33;\nconst HASH = 35;\nconst LEFT_BRACKET = 91;\nconst BACKSLASH = 92;\nconst RIGHT_BRACKET = 93;\nconst PIPE = 124;\n\nfunction isLineEnding(code: Code): boolean {\n  return code === codes.lineFeed || code === codes.carriageReturn;\n}\n\nexport function wikilinkSyntax(): Extension {\n  return {\n    text: {\n      [LEFT_BRACKET]: { name: \"wikilink\", tokenize },\n      [EXCLAMATION]: { name: \"wikilink\", tokenize },\n    },\n  };\n}\n\nfunction tokenize(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  let hasPath = false;\n  let hasHeading = false;\n  let hasAlias = false;\n\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code === EXCLAMATION) {\n      effects.enter(\"wikilink\");\n      effects.enter(\"wikilinkEmbedMarker\");\n      effects.consume(code);\n      effects.exit(\"wikilinkEmbedMarker\");\n      return openFirst;\n    }\n\n    if (code === LEFT_BRACKET) {\n      effects.enter(\"wikilink\");\n      return openFirst(code);\n    }\n\n    return nok(code);\n  }\n\n  function openFirst(code: Code): State | undefined {\n    if (code !== LEFT_BRACKET) return nok(code);\n    effects.enter(\"wikilinkMarker\");\n    effects.consume(code);\n    return openSecond;\n  }\n\n  function openSecond(code: Code): State | undefined {\n    if (code !== LEFT_BRACKET) return nok(code);\n    effects.consume(code);\n    effects.exit(\"wikilinkMarker\");\n    return pathStart;\n  }\n\n  function pathStart(code: Code): State | undefined {\n    if (code === HASH) return headingMarker(code);\n    if (code === PIPE) return nok(code);\n    if (code === RIGHT_BRACKET || code === null || isLineEnding(code))\n      return nok(code);\n    effects.enter(\"wikilinkPath\");\n    hasPath = true;\n    return path(code);\n  }\n\n  function path(code: Code): State | undefined {\n    if (code === BACKSLASH) {\n      effects.consume(code);\n      return pathEscape;\n    }\n\n    if (code === HASH) {\n      effects.exit(\"wikilinkPath\");\n      return headingMarker(code);\n    }\n\n    if (code === PIPE) {\n      effects.exit(\"wikilinkPath\");\n      return aliasMarker(code);\n    }\n\n    if (code === RIGHT_BRACKET) {\n      effects.exit(\"wikilinkPath\");\n      return closeFirst(code);\n    }\n\n    if (code === null || isLineEnding(code)) return nok(code);\n\n    effects.consume(code);\n    return path;\n  }\n\n  function pathEscape(code: Code): State | undefined {\n    if (code === PIPE) {\n      effects.exit(\"wikilinkPath\");\n      return aliasMarker(code);\n    }\n    if (code === null || isLineEnding(code)) return nok(code);\n    effects.consume(code);\n    return path;\n  }\n\n  function headingMarker(code: Code): State | undefined {\n    if (code !== HASH) return nok(code);\n    effects.enter(\"wikilinkHeadingMarker\");\n    effects.consume(code);\n    effects.exit(\"wikilinkHeadingMarker\");\n    return headingStart;\n  }\n\n  function headingStart(code: Code): State | undefined {\n    if (code === null || isLineEnding(code)) return nok(code);\n\n    // Allow empty heading: [[page#]] or [[page#|alias]]\n    if (code === RIGHT_BRACKET) {\n      hasHeading = true;\n      return closeFirst(code);\n    }\n    if (code === PIPE) {\n      hasHeading = true;\n      return aliasMarker(code);\n    }\n\n    effects.enter(\"wikilinkHeading\");\n    hasHeading = true;\n    return heading(code);\n  }\n\n  function heading(code: Code): State | undefined {\n    if (code === BACKSLASH) {\n      effects.consume(code);\n      return headingEscape;\n    }\n\n    if (code === PIPE) {\n      effects.exit(\"wikilinkHeading\");\n      return aliasMarker(code);\n    }\n\n    if (code === RIGHT_BRACKET) {\n      effects.exit(\"wikilinkHeading\");\n      return closeFirst(code);\n    }\n\n    if (code === null || isLineEnding(code)) return nok(code);\n\n    effects.consume(code);\n    return heading;\n  }\n\n  function headingEscape(code: Code): State | undefined {\n    if (code === PIPE) {\n      effects.exit(\"wikilinkHeading\");\n      return aliasMarker(code);\n    }\n    if (code === null || isLineEnding(code)) return nok(code);\n    effects.consume(code);\n    return heading;\n  }\n\n  function aliasMarker(code: Code): State | undefined {\n    if (code !== PIPE) return nok(code);\n    effects.enter(\"wikilinkAliasMarker\");\n    effects.consume(code);\n    effects.exit(\"wikilinkAliasMarker\");\n    return aliasStart;\n  }\n\n  function aliasStart(code: Code): State | undefined {\n    if (code === RIGHT_BRACKET) return closeFirst(code);\n    if (code === null || isLineEnding(code)) return nok(code);\n    effects.enter(\"wikilinkAlias\");\n    hasAlias = true;\n    return alias(code);\n  }\n\n  function alias(code: Code): State | undefined {\n    if (code === RIGHT_BRACKET) {\n      effects.exit(\"wikilinkAlias\");\n      return closeFirst(code);\n    }\n\n    if (code === null || isLineEnding(code)) return nok(code);\n\n    effects.consume(code);\n    return alias;\n  }\n\n  function closeFirst(code: Code): State | undefined {\n    if (code !== RIGHT_BRACKET) return nok(code);\n    if (!hasPath && !hasHeading && !hasAlias) return nok(code);\n    effects.enter(\"wikilinkMarker\");\n    effects.consume(code);\n    return closeSecond;\n  }\n\n  function closeSecond(code: Code): State | undefined {\n    if (code !== RIGHT_BRACKET) return nok(code);\n    effects.consume(code);\n    effects.exit(\"wikilinkMarker\");\n    effects.exit(\"wikilink\");\n    return ok;\n  }\n}\n","import type {\n  Code,\n  Construct,\n  Effects,\n  Extension,\n  State,\n  TokenizeContext,\n} from \"micromark-util-types\";\nimport { codes } from \"micromark-util-symbol\";\n\nconst EQUALS = 61;\n\nfunction isLineEnding(code: Code): boolean {\n  return code === codes.lineFeed || code === codes.carriageReturn;\n}\n\nexport function highlightSyntax(): Extension {\n  return {\n    text: {\n      [EQUALS]: { name: \"highlight\", tokenize },\n    },\n  };\n}\n\nfunction tokenize(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  const close: Construct = { tokenize: tokenizeClose, partial: true };\n  let hasContent = false;\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code !== EQUALS) return nok(code);\n    effects.enter(\"highlight\");\n    effects.enter(\"highlightMarker\");\n    effects.consume(code);\n    return openSecond;\n  }\n\n  function openSecond(code: Code): State | undefined {\n    if (code !== EQUALS) return nok(code);\n    effects.consume(code);\n    effects.exit(\"highlightMarker\");\n    effects.enter(\"highlightContent\");\n    return content;\n  }\n\n  function content(code: Code): State | undefined {\n    if (code === null || isLineEnding(code)) return nok(code);\n    if (!hasContent && code === EQUALS) return nok(code);\n    if (code === EQUALS)\n      return effects.attempt(close, closeAfter, contentConsume)(code);\n    effects.consume(code);\n    hasContent = true;\n    return content;\n  }\n\n  function contentConsume(code: Code): State | undefined {\n    if (code === null || isLineEnding(code)) return nok(code);\n    effects.consume(code);\n    return content;\n  }\n\n  function tokenizeClose(\n    this: TokenizeContext,\n    closeEffects: Effects,\n    closeOk: State,\n    closeNok: State,\n  ): State {\n    return closeStart;\n\n    function closeStart(closeCode: Code): State | undefined {\n      if (closeCode !== EQUALS) return closeNok(closeCode);\n      closeEffects.exit(\"highlightContent\");\n      closeEffects.enter(\"highlightMarker\");\n      closeEffects.consume(closeCode);\n      return closeSecond;\n    }\n\n    function closeSecond(closeCode: Code): State | undefined {\n      if (closeCode !== EQUALS) return closeNok(closeCode);\n      closeEffects.consume(closeCode);\n      closeEffects.exit(\"highlightMarker\");\n      return closeOk;\n    }\n  }\n\n  function closeAfter(code: Code): State | undefined {\n    effects.exit(\"highlight\");\n    return ok(code);\n  }\n}\n","import type {\n  Code,\n  Construct,\n  Effects,\n  Extension,\n  State,\n  TokenizeContext,\n} from \"micromark-util-types\";\n\nconst PERCENT = 37;\nconst LINE_FEED = -4;\nconst CARRIAGE_RETURN = -3;\nconst CARRIAGE_RETURN_LINE_FEED = -5;\n\nfunction isLineEnding(code: Code): code is number {\n  return (\n    code === LINE_FEED ||\n    code === CARRIAGE_RETURN ||\n    code === CARRIAGE_RETURN_LINE_FEED\n  );\n}\n\nconst commentFlow: Construct = {\n  tokenize: tokenizeFlow,\n  concrete: true,\n  name: \"commentFlow\",\n};\n\nconst nonLazyContinuation: Construct = {\n  tokenize: tokenizeNonLazyContinuation,\n  partial: true,\n};\n\nexport function commentSyntax(): Extension {\n  return {\n    text: {\n      [PERCENT]: { name: \"comment\", tokenize: tokenizeText },\n    },\n    flow: {\n      [PERCENT]: commentFlow,\n    },\n  };\n}\n\nfunction tokenizeText(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  const close: Construct = { tokenize: tokenizeClose, partial: true };\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code !== PERCENT) return nok(code);\n    effects.enter(\"comment\");\n    effects.enter(\"commentMarker\");\n    effects.consume(code);\n    return openSecond;\n  }\n\n  function openSecond(code: Code): State | undefined {\n    if (code !== PERCENT) return nok(code);\n    effects.consume(code);\n    effects.exit(\"commentMarker\");\n    effects.enter(\"commentContent\");\n    return content;\n  }\n\n  function content(code: Code): State | undefined {\n    if (code === null) return nok(code);\n    if (code === PERCENT)\n      return effects.attempt(close, closeAfter, contentConsume)(code);\n    effects.consume(code);\n    return content;\n  }\n\n  function contentConsume(code: Code): State | undefined {\n    if (code === null) return nok(code);\n    effects.consume(code);\n    return content;\n  }\n\n  function tokenizeClose(\n    this: TokenizeContext,\n    closeEffects: Effects,\n    closeOk: State,\n    closeNok: State,\n  ): State {\n    return closeStart;\n\n    function closeStart(closeCode: Code): State | undefined {\n      if (closeCode !== PERCENT) return closeNok(closeCode);\n      closeEffects.exit(\"commentContent\");\n      closeEffects.enter(\"commentMarker\");\n      closeEffects.consume(closeCode);\n      return closeSecond;\n    }\n\n    function closeSecond(closeCode: Code): State | undefined {\n      if (closeCode !== PERCENT) return closeNok(closeCode);\n      closeEffects.consume(closeCode);\n      closeEffects.exit(\"commentMarker\");\n      return closeOk;\n    }\n  }\n\n  function closeAfter(code: Code): State | undefined {\n    effects.exit(\"comment\");\n    return ok(code);\n  }\n}\n\nfunction tokenizeFlow(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  const self = this;\n  const flowClose: Construct = {\n    tokenize: tokenizeFlowClose,\n    partial: true,\n  };\n\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code !== PERCENT) return nok(code);\n    effects.enter(\"comment\");\n    effects.enter(\"commentMarker\");\n    effects.consume(code);\n    return openSecond;\n  }\n\n  function openSecond(code: Code): State | undefined {\n    if (code !== PERCENT) return nok(code);\n    effects.consume(code);\n    effects.exit(\"commentMarker\");\n    return afterOpen;\n  }\n\n  // Once the opening %% is confirmed, we must never nok().\n  // Concrete flow constructs that nok() after entering tokens\n  // corrupt the event stream and crash subtokenize's SpliceBuffer.\n  function afterOpen(code: Code): State | undefined {\n    if (code === null) {\n      effects.exit(\"comment\");\n      return ok(code);\n    }\n\n    if (isLineEnding(code)) {\n      return effects.attempt(\n        nonLazyContinuation,\n        beforeContentChunk,\n        afterLazy,\n      )(code);\n    }\n\n    effects.enter(\"commentContent\");\n    return contentChunk(code);\n  }\n\n  function beforeContentChunk(code: Code): State | undefined {\n    if (code === null) {\n      effects.exit(\"comment\");\n      return ok(code);\n    }\n\n    if (isLineEnding(code)) {\n      return effects.attempt(\n        nonLazyContinuation,\n        beforeContentChunk,\n        afterLazy,\n      )(code);\n    }\n\n    if (code === PERCENT) {\n      return effects.attempt(flowClose, closeAfter, startContent)(code);\n    }\n\n    effects.enter(\"commentContent\");\n    return contentChunk(code);\n  }\n\n  function startContent(code: Code): State | undefined {\n    effects.enter(\"commentContent\");\n    effects.consume(code);\n    return contentChunk;\n  }\n\n  function contentChunk(code: Code): State | undefined {\n    if (code === null) {\n      effects.exit(\"commentContent\");\n      effects.exit(\"comment\");\n      return ok(code);\n    }\n\n    if (code === PERCENT) {\n      return effects.attempt(flowClose, closeAfter, contentConsume)(code);\n    }\n\n    if (isLineEnding(code)) {\n      effects.exit(\"commentContent\");\n      return effects.attempt(\n        nonLazyContinuation,\n        beforeContentChunk,\n        afterLazy,\n      )(code);\n    }\n\n    effects.consume(code);\n    return contentChunk;\n  }\n\n  function contentConsume(code: Code): State | undefined {\n    if (code === null) {\n      effects.exit(\"commentContent\");\n      effects.exit(\"comment\");\n      return ok(code);\n    }\n    effects.consume(code);\n    return contentChunk;\n  }\n\n  function closeAfter(code: Code): State | undefined {\n    effects.exit(\"comment\");\n    return ok(code);\n  }\n\n  // Lazy continuation: close the comment cleanly instead of nok().\n  function afterLazy(code: Code): State | undefined {\n    effects.exit(\"comment\");\n    return ok(code);\n  }\n\n  function tokenizeFlowClose(\n    this: TokenizeContext,\n    closeEffects: Effects,\n    closeOk: State,\n    closeNok: State,\n  ): State {\n    let inContent = false;\n    return closeStart;\n\n    function closeStart(closeCode: Code): State | undefined {\n      if (closeCode !== PERCENT) return closeNok(closeCode);\n      const current = self.events[self.events.length - 1];\n      if (\n        current &&\n        current[0] === \"enter\" &&\n        current[1].type === \"commentContent\"\n      ) {\n        closeEffects.exit(\"commentContent\");\n        inContent = true;\n      }\n      closeEffects.enter(\"commentMarker\");\n      closeEffects.consume(closeCode);\n      return closeSecond;\n    }\n\n    function closeSecond(closeCode: Code): State | undefined {\n      if (closeCode !== PERCENT) {\n        if (inContent) {\n          closeEffects.exit(\"commentMarker\");\n          closeEffects.enter(\"commentContent\");\n        }\n        return closeNok(closeCode);\n      }\n      closeEffects.consume(closeCode);\n      closeEffects.exit(\"commentMarker\");\n      return closeOk;\n    }\n  }\n}\n\nfunction tokenizeNonLazyContinuation(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  const self = this;\n  return start;\n\n  function start(code: Code): State | undefined {\n    if (code === null) {\n      return ok(code);\n    }\n    if (!isLineEnding(code)) return nok(code);\n    effects.enter(\"lineEnding\");\n    effects.consume(code);\n    effects.exit(\"lineEnding\");\n    return lineStart;\n  }\n\n  function lineStart(code: Code): State | undefined {\n    return self.parser.lazy[self.now().line] ? nok(code) : ok(code);\n  }\n}\n","import type {\n  Code,\n  Effects,\n  Extension,\n  State,\n  TokenizeContext,\n} from \"micromark-util-types\";\nimport { codes } from \"micromark-util-symbol\";\n\nconst HASH = 35;\nconst SLASH = 47;\nconst DASH = 45;\nconst UNDERSCORE = 95;\n\nconst tagCharRegex = /[\\p{L}\\p{M}\\p{Emoji}]/u;\n\nfunction isWhitespace(code: Code): boolean {\n  return (\n    code === codes.space ||\n    code === codes.horizontalTab ||\n    code === codes.lineFeed ||\n    code === codes.carriageReturn ||\n    code === codes.carriageReturnLineFeed\n  );\n}\n\nfunction isTagChar(code: Code): boolean {\n  if (code === null || code < 0) return false;\n  if (code >= 48 && code <= 57) return true;\n  if (code === DASH || code === UNDERSCORE) return true;\n  return tagCharRegex.test(String.fromCodePoint(code));\n}\n\nfunction isNonDigit(code: Code): boolean {\n  if (code === null) return false;\n  return !(code >= 48 && code <= 57);\n}\n\nexport function tagSyntax(): Extension {\n  return {\n    text: {\n      [HASH]: { name: \"tag\", tokenize },\n    },\n  };\n}\n\nfunction tokenize(\n  this: TokenizeContext,\n  effects: Effects,\n  ok: State,\n  nok: State,\n): State {\n  let hasNonDigit = false;\n  const context = this;\n\n  return start;\n\n  function start(code: Code): State | undefined {\n    const previous = context.previous;\n    const allowedStart =\n      previous === null || isWhitespace(previous) || previous === HASH;\n    if (!allowedStart) return nok(code);\n    if (code !== HASH) return nok(code);\n    effects.enter(\"tag\");\n    effects.enter(\"tagMarker\");\n    effects.consume(code);\n    effects.exit(\"tagMarker\");\n    return tagStart;\n  }\n\n  function tagStart(code: Code): State | undefined {\n    if (!isTagChar(code)) return nok(code);\n    effects.enter(\"tagContent\");\n    if (isNonDigit(code)) hasNonDigit = true;\n    effects.consume(code);\n    return tagContent;\n  }\n\n  function tagContent(code: Code): State | undefined {\n    if (code === SLASH) {\n      effects.consume(code);\n      return afterSlash;\n    }\n\n    if (isTagChar(code)) {\n      if (isNonDigit(code)) hasNonDigit = true;\n      effects.consume(code);\n      return tagContent;\n    }\n\n    return end(code);\n  }\n\n  function afterSlash(code: Code): State | undefined {\n    if (!isTagChar(code)) return nok(code);\n    if (isNonDigit(code)) hasNonDigit = true;\n    effects.consume(code);\n    return tagContent;\n  }\n\n  function end(code: Code): State | undefined {\n    if (!hasNonDigit) return nok(code);\n    effects.exit(\"tagContent\");\n    effects.exit(\"tag\");\n    return ok(code);\n  }\n}\n","import type { Extension } from \"mdast-util-from-markdown\";\n\nexport function wikilinkFromMarkdown(): Extension {\n  return {\n    enter: {\n      wikilink(token) {\n        this.enter(\n          {\n            type: \"wikilink\",\n            value: \"\",\n            embedded: false,\n            path: \"\",\n            heading: \"\",\n            alias: \"\",\n          },\n          token,\n        );\n      },\n      wikilinkEmbedMarker() {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.embedded = true;\n      },\n      wikilinkPath(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.path = this.sliceSerialize(token).replace(/\\\\([#\\[\\]])/g, \"$1\");\n      },\n      wikilinkHeading(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.heading = this.sliceSerialize(token).replace(/\\\\([#\\[\\]])/g, \"$1\");\n      },\n      wikilinkAlias(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.alias = this.sliceSerialize(token);\n      },\n    },\n    exit: {\n      wikilink(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        if (node.alias) {\n          if (node.path.endsWith(\"\\\\\")) node.path = node.path.slice(0, -1);\n          if (node.heading.endsWith(\"\\\\\"))\n            node.heading = node.heading.slice(0, -1);\n        }\n        this.exit(token);\n      },\n    },\n  };\n}\n","import type { Extension } from \"mdast-util-from-markdown\";\n\nexport function highlightFromMarkdown(): Extension {\n  return {\n    enter: {\n      highlight(token) {\n        this.enter({ type: \"highlight\", children: [] }, token);\n      },\n    },\n    exit: {\n      highlightContent(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.children = [{ type: \"text\", value: this.sliceSerialize(token) }];\n      },\n      highlight(token) {\n        this.exit(token);\n      },\n    },\n  };\n}\n","import type { Extension } from \"mdast-util-from-markdown\";\n\nexport function commentFromMarkdown(): Extension {\n  return {\n    enter: {\n      comment(token) {\n        this.enter({ type: \"comment\", value: \"\" }, token);\n      },\n    },\n    exit: {\n      commentContent(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        node.value += this.sliceSerialize(token);\n      },\n      comment(token) {\n        this.exit(token);\n      },\n    },\n  };\n}\n","import type { Extension } from \"mdast-util-from-markdown\";\n\nexport function tagFromMarkdown(): Extension {\n  return {\n    enter: {\n      tag(token) {\n        this.enter({ type: \"tag\", value: \"\" }, token);\n      },\n      tagContent(token) {\n        const node = this.stack[this.stack.length - 1] as any;\n        if (node.type === \"tag\") node.value = this.sliceSerialize(token);\n      },\n    },\n    exit: {\n      tag(token) {\n        this.exit(token);\n      },\n    },\n  };\n}\n","import type { Options } from \"mdast-util-to-markdown\";\nimport type { Wikilink } from \"../types.js\";\n\nexport function wikilinkToMarkdown(): Options {\n  return {\n    handlers: {\n      wikilink(node: Wikilink) {\n        const prefix = node.embedded ? \"!\" : \"\";\n        const heading = node.heading ? `#${node.heading}` : \"\";\n        const alias = node.alias ? `|${node.alias}` : \"\";\n        return `${prefix}[[${node.path}${heading}${alias}]]`;\n      },\n    },\n  };\n}\n","import type { Options, State, Info } from \"mdast-util-to-markdown\";\nimport type { Parents } from \"mdast\";\nimport type { Highlight } from \"../types.js\";\n\nexport function highlightToMarkdown(): Options {\n  return {\n    handlers: {\n      highlight(\n        node: Highlight,\n        _parent: Parents | undefined,\n        state: State,\n        info: Info,\n      ) {\n        const exit = state.enter(\"highlight\" as any);\n        const content = state.containerPhrasing(node, info);\n        exit();\n        return `==${content}==`;\n      },\n    },\n  };\n}\n","import type { Options } from \"mdast-util-to-markdown\";\nimport type { Comment } from \"../types.js\";\n\nexport function commentToMarkdown(): Options {\n  return {\n    handlers: {\n      comment(node: Comment) {\n        return `%%${node.value}%%`;\n      },\n    },\n  };\n}\n","import type { Options } from \"mdast-util-to-markdown\";\nimport type { Tag } from \"../types.js\";\n\nexport function tagToMarkdown(): Options {\n  return {\n    handlers: {\n      tag(node: Tag) {\n        return `#${node.value}`;\n      },\n    },\n  };\n}\n","import type { Root } from \"mdast\";\nimport { visit } from \"unist-util-visit\";\n\nexport function customTaskCharTransform(tree: Root, source?: string) {\n  visit(tree, \"listItem\", (node: any) => {\n    if (typeof node.checked === \"boolean\") {\n      let char = node.checked ? \"x\" : \" \";\n\n      // Recover original character (e.g. \"X\" vs \"x\") from source\n      if (source && node.position?.start?.offset != null) {\n        const slice = source.slice(\n          node.position.start.offset,\n          node.position.start.offset + 20,\n        );\n        const m = slice.match(/\\[([^\\]])\\]/);\n        if (m) {\n          char = m[1];\n        }\n      }\n\n      node.data ??= {};\n      node.data.taskChar = char;\n      node.data.hProperties ??= {};\n      node.data.hProperties.dataTaskChar = char;\n      return;\n    }\n\n    const firstChild = node.children?.[0];\n    if (!firstChild || firstChild.type !== \"paragraph\") return;\n\n    const firstText = firstChild.children?.[0];\n    if (!firstText || firstText.type !== \"text\") return;\n\n    const match = firstText.value.match(/^\\[([^\\]])\\]\\s/);\n    if (!match) return;\n\n    const taskChar = match[1];\n\n    node.checked = taskChar !== \" \";\n    node.data ??= {};\n    node.data.taskChar = taskChar;\n    node.data.hProperties ??= {};\n    node.data.hProperties.dataTaskChar = taskChar;\n\n    firstText.value = firstText.value.slice(match[0].length);\n\n    if (firstText.value.length === 0) {\n      firstChild.children.shift();\n    } else if (\n      firstText.position &&\n      typeof firstText.position.start.offset === \"number\"\n    ) {\n      firstText.position.start.column += match[0].length;\n      firstText.position.start.offset += match[0].length;\n    }\n  });\n}\n","/**\n * @import {Code} from 'micromark-util-types'\n */\n\n/**\n * Check whether the character code represents an ASCII alpha (`a` through `z`,\n * case insensitive).\n *\n * An **ASCII alpha** is an ASCII upper alpha or ASCII lower alpha.\n *\n * An **ASCII upper alpha** is a character in the inclusive range U+0041 (`A`)\n * to U+005A (`Z`).\n *\n * An **ASCII lower alpha** is a character in the inclusive range U+0061 (`a`)\n * to U+007A (`z`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiAlpha = regexCheck(/[A-Za-z]/);\n\n/**\n * Check whether the character code represents an ASCII alphanumeric (`a`\n * through `z`, case insensitive, or `0` through `9`).\n *\n * An **ASCII alphanumeric** is an ASCII digit (see `asciiDigit`) or ASCII alpha\n * (see `asciiAlpha`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiAlphanumeric = regexCheck(/[\\dA-Za-z]/);\n\n/**\n * Check whether the character code represents an ASCII atext.\n *\n * atext is an ASCII alphanumeric (see `asciiAlphanumeric`), or a character in\n * the inclusive ranges U+0023 NUMBER SIGN (`#`) to U+0027 APOSTROPHE (`'`),\n * U+002A ASTERISK (`*`), U+002B PLUS SIGN (`+`), U+002D DASH (`-`), U+002F\n * SLASH (`/`), U+003D EQUALS TO (`=`), U+003F QUESTION MARK (`?`), U+005E\n * CARET (`^`) to U+0060 GRAVE ACCENT (`` ` ``), or U+007B LEFT CURLY BRACE\n * (`{`) to U+007E TILDE (`~`).\n *\n * See:\n * **\\[RFC5322]**:\n * [Internet Message Format](https://tools.ietf.org/html/rfc5322).\n * P. Resnick.\n * IETF.\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiAtext = regexCheck(/[#-'*+\\--9=?A-Z^-~]/);\n\n/**\n * Check whether a character code is an ASCII control character.\n *\n * An **ASCII control** is a character in the inclusive range U+0000 NULL (NUL)\n * to U+001F (US), or U+007F (DEL).\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function asciiControl(code) {\n  return (\n    // Special whitespace codes (which have negative values), C0 and Control\n    // character DEL\n    code !== null && (code < 32 || code === 127)\n  );\n}\n\n/**\n * Check whether the character code represents an ASCII digit (`0` through `9`).\n *\n * An **ASCII digit** is a character in the inclusive range U+0030 (`0`) to\n * U+0039 (`9`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiDigit = regexCheck(/\\d/);\n\n/**\n * Check whether the character code represents an ASCII hex digit (`a` through\n * `f`, case insensitive, or `0` through `9`).\n *\n * An **ASCII hex digit** is an ASCII digit (see `asciiDigit`), ASCII upper hex\n * digit, or an ASCII lower hex digit.\n *\n * An **ASCII upper hex digit** is a character in the inclusive range U+0041\n * (`A`) to U+0046 (`F`).\n *\n * An **ASCII lower hex digit** is a character in the inclusive range U+0061\n * (`a`) to U+0066 (`f`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiHexDigit = regexCheck(/[\\dA-Fa-f]/);\n\n/**\n * Check whether the character code represents ASCII punctuation.\n *\n * An **ASCII punctuation** is a character in the inclusive ranges U+0021\n * EXCLAMATION MARK (`!`) to U+002F SLASH (`/`), U+003A COLON (`:`) to U+0040 AT\n * SIGN (`@`), U+005B LEFT SQUARE BRACKET (`[`) to U+0060 GRAVE ACCENT\n * (`` ` ``), or U+007B LEFT CURLY BRACE (`{`) to U+007E TILDE (`~`).\n *\n * @param code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/);\n\n/**\n * Check whether a character code is a markdown line ending.\n *\n * A **markdown line ending** is the virtual characters M-0003 CARRIAGE RETURN\n * LINE FEED (CRLF), M-0004 LINE FEED (LF) and M-0005 CARRIAGE RETURN (CR).\n *\n * In micromark, the actual character U+000A LINE FEED (LF) and U+000D CARRIAGE\n * RETURN (CR) are replaced by these virtual characters depending on whether\n * they occurred together.\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function markdownLineEnding(code) {\n  return code !== null && code < -2;\n}\n\n/**\n * Check whether a character code is a markdown line ending (see\n * `markdownLineEnding`) or markdown space (see `markdownSpace`).\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function markdownLineEndingOrSpace(code) {\n  return code !== null && (code < 0 || code === 32);\n}\n\n/**\n * Check whether a character code is a markdown space.\n *\n * A **markdown space** is the concrete character U+0020 SPACE (SP) and the\n * virtual characters M-0001 VIRTUAL SPACE (VS) and M-0002 HORIZONTAL TAB (HT).\n *\n * In micromark, the actual character U+0009 CHARACTER TABULATION (HT) is\n * replaced by one M-0002 HORIZONTAL TAB (HT) and between 0 and 3 M-0001 VIRTUAL\n * SPACE (VS) characters, depending on the column at which the tab occurred.\n *\n * @param {Code} code\n *   Code.\n * @returns {boolean}\n *   Whether it matches.\n */\nexport function markdownSpace(code) {\n  return code === -2 || code === -1 || code === 32;\n}\n\n// Size note: removing ASCII from the regex and using `asciiPunctuation` here\n// In fact adds to the bundle size.\n/**\n * Check whether the character code represents Unicode punctuation.\n *\n * A **Unicode punctuation** is a character in the Unicode `Pc` (Punctuation,\n * Connector), `Pd` (Punctuation, Dash), `Pe` (Punctuation, Close), `Pf`\n * (Punctuation, Final quote), `Pi` (Punctuation, Initial quote), `Po`\n * (Punctuation, Other), or `Ps` (Punctuation, Open) categories, or an ASCII\n * punctuation (see `asciiPunctuation`).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n *\n * @param code\n *   Code.\n * @returns\n *   Whether it matches.\n */\nexport const unicodePunctuation = regexCheck(/\\p{P}|\\p{S}/u);\n\n/**\n * Check whether the character code represents Unicode whitespace.\n *\n * Note that this does handle micromark specific markdown whitespace characters.\n * See `markdownLineEndingOrSpace` to check that.\n *\n * A **Unicode whitespace** is a character in the Unicode `Zs` (Separator,\n * Space) category, or U+0009 CHARACTER TABULATION (HT), U+000A LINE FEED (LF),\n * U+000C (FF), or U+000D CARRIAGE RETURN (CR) (**\\[UNICODE]**).\n *\n * See:\n * **\\[UNICODE]**:\n * [The Unicode Standard](https://www.unicode.org/versions/).\n * Unicode Consortium.\n *\n * @param code\n *   Code.\n * @returns\n *   Whether it matches.\n */\nexport const unicodeWhitespace = regexCheck(/\\s/);\n\n/**\n * Create a code check from a regex.\n *\n * @param {RegExp} regex\n *   Expression.\n * @returns {(code: Code) => boolean}\n *   Check.\n */\nfunction regexCheck(regex) {\n  return check;\n\n  /**\n   * Check whether a code matches the bound regex.\n   *\n   * @param {Code} code\n   *   Character code.\n   * @returns {boolean}\n   *   Whether the character code matches the bound regex.\n   */\n  function check(code) {\n    return code !== null && code > -1 && regex.test(String.fromCharCode(code));\n  }\n}","/**\n * @import {Effects, State, TokenType} from 'micromark-util-types'\n */\n\nimport { markdownSpace } from 'micromark-util-character';\n\n// To do: implement `spaceOrTab`, `spaceOrTabMinMax`, `spaceOrTabWithOptions`.\n\n/**\n * Parse spaces and tabs.\n *\n * There is no `nok` parameter:\n *\n * *   spaces in markdown are often optional, in which case this factory can be\n *     used and `ok` will be switched to whether spaces were found or not\n * *   one line ending or space can be detected with `markdownSpace(code)` right\n *     before using `factorySpace`\n *\n * ###### Examples\n *\n * Where `␉` represents a tab (plus how much it expands) and `␠` represents a\n * single space.\n *\n * ```markdown\n * ␉\n * ␠␠␠␠\n * ␉␠\n * ```\n *\n * @param {Effects} effects\n *   Context.\n * @param {State} ok\n *   State switched to when successful.\n * @param {TokenType} type\n *   Type (`' \\t'`).\n * @param {number | undefined} [max=Infinity]\n *   Max (exclusive).\n * @returns {State}\n *   Start state.\n */\nexport function factorySpace(effects, ok, type, max) {\n  const limit = max ? max - 1 : Number.POSITIVE_INFINITY;\n  let size = 0;\n  return start;\n\n  /** @type {State} */\n  function start(code) {\n    if (markdownSpace(code)) {\n      effects.enter(type);\n      return prefix(code);\n    }\n    return ok(code);\n  }\n\n  /** @type {State} */\n  function prefix(code) {\n    if (markdownSpace(code) && size++ < limit) {\n      effects.consume(code);\n      return prefix;\n    }\n    effects.exit(type);\n    return ok(code);\n  }\n}","/**\n * @import {Construct, State, TokenizeContext, Tokenizer} from 'micromark-util-types'\n */\n\nimport { factorySpace } from 'micromark-factory-space';\nimport { markdownLineEnding } from 'micromark-util-character';\n/** @type {Construct} */\nexport const mathFlow = {\n  tokenize: tokenizeMathFenced,\n  concrete: true,\n  name: 'mathFlow'\n};\n\n/** @type {Construct} */\nconst nonLazyContinuation = {\n  tokenize: tokenizeNonLazyContinuation,\n  partial: true\n};\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeMathFenced(effects, ok, nok) {\n  const self = this;\n  const tail = self.events[self.events.length - 1];\n  const initialSize = tail && tail[1].type === \"linePrefix\" ? tail[2].sliceSerialize(tail[1], true).length : 0;\n  let sizeOpen = 0;\n  return start;\n\n  /**\n   * Start of math.\n   *\n   * ```markdown\n   * > | $$\n   *     ^\n   *   | \\frac{1}{2}\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function start(code) {\n    effects.enter('mathFlow');\n    effects.enter('mathFlowFence');\n    effects.enter('mathFlowFenceSequence');\n    return sequenceOpen(code);\n  }\n\n  /**\n   * In opening fence sequence.\n   *\n   * ```markdown\n   * > | $$\n   *      ^\n   *   | \\frac{1}{2}\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function sequenceOpen(code) {\n    if (code === 36) {\n      effects.consume(code);\n      sizeOpen++;\n      return sequenceOpen;\n    }\n    if (sizeOpen < 2) {\n      return nok(code);\n    }\n    effects.exit('mathFlowFenceSequence');\n    return factorySpace(effects, metaBefore, \"whitespace\")(code);\n  }\n\n  /**\n   * In opening fence, before meta.\n   *\n   * ```markdown\n   * > | $$asciimath\n   *       ^\n   *   | x < y\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n\n  function metaBefore(code) {\n    if (code === null || markdownLineEnding(code)) {\n      return metaAfter(code);\n    }\n    effects.enter('mathFlowFenceMeta');\n    effects.enter(\"chunkString\", {\n      contentType: \"string\"\n    });\n    return meta(code);\n  }\n\n  /**\n   * In meta.\n   *\n   * ```markdown\n   * > | $$asciimath\n   *        ^\n   *   | x < y\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function meta(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit(\"chunkString\");\n      effects.exit('mathFlowFenceMeta');\n      return metaAfter(code);\n    }\n    if (code === 36) {\n      return nok(code);\n    }\n    effects.consume(code);\n    return meta;\n  }\n\n  /**\n   * After meta.\n   *\n   * ```markdown\n   * > | $$\n   *       ^\n   *   | \\frac{1}{2}\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function metaAfter(code) {\n    // Guaranteed to be eol/eof.\n    effects.exit('mathFlowFence');\n    if (self.interrupt) {\n      return ok(code);\n    }\n    return effects.attempt(nonLazyContinuation, beforeNonLazyContinuation, after)(code);\n  }\n\n  /**\n   * After eol/eof in math, at a non-lazy closing fence or content.\n   *\n   * ```markdown\n   *   | $$\n   * > | \\frac{1}{2}\n   *     ^\n   * > | $$\n   *     ^\n   * ```\n   *\n   * @type {State}\n   */\n  function beforeNonLazyContinuation(code) {\n    return effects.attempt({\n      tokenize: tokenizeClosingFence,\n      partial: true\n    }, after, contentStart)(code);\n  }\n\n  /**\n   * Before math content, definitely not before a closing fence.\n   *\n   * ```markdown\n   *   | $$\n   * > | \\frac{1}{2}\n   *     ^\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function contentStart(code) {\n    return (initialSize ? factorySpace(effects, beforeContentChunk, \"linePrefix\", initialSize + 1) : beforeContentChunk)(code);\n  }\n\n  /**\n   * Before math content, after optional prefix.\n   *\n   * ```markdown\n   *   | $$\n   * > | \\frac{1}{2}\n   *     ^\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function beforeContentChunk(code) {\n    if (code === null) {\n      return after(code);\n    }\n    if (markdownLineEnding(code)) {\n      return effects.attempt(nonLazyContinuation, beforeNonLazyContinuation, after)(code);\n    }\n    effects.enter('mathFlowValue');\n    return contentChunk(code);\n  }\n\n  /**\n   * In math content.\n   *\n   * ```markdown\n   *   | $$\n   * > | \\frac{1}{2}\n   *      ^\n   *   | $$\n   * ```\n   *\n   * @type {State}\n   */\n  function contentChunk(code) {\n    if (code === null || markdownLineEnding(code)) {\n      effects.exit('mathFlowValue');\n      return beforeContentChunk(code);\n    }\n    effects.consume(code);\n    return contentChunk;\n  }\n\n  /**\n   * After math (ha!).\n   *\n   * ```markdown\n   *   | $$\n   *   | \\frac{1}{2}\n   * > | $$\n   *       ^\n   * ```\n   *\n   * @type {State}\n   */\n  function after(code) {\n    effects.exit('mathFlow');\n    return ok(code);\n  }\n\n  /** @type {Tokenizer} */\n  function tokenizeClosingFence(effects, ok, nok) {\n    let size = 0;\n    /**\n     * Before closing fence, at optional whitespace.\n     *\n     * ```markdown\n     *   | $$\n     *   | \\frac{1}{2}\n     * > | $$\n     *     ^\n     * ```\n     */\n    return factorySpace(effects, beforeSequenceClose, \"linePrefix\", self.parser.constructs.disable.null.includes('codeIndented') ? undefined : 4);\n\n    /**\n     * In closing fence, after optional whitespace, at sequence.\n     *\n     * ```markdown\n     *   | $$\n     *   | \\frac{1}{2}\n     * > | $$\n     *     ^\n     * ```\n     *\n     * @type {State}\n     */\n    function beforeSequenceClose(code) {\n      effects.enter('mathFlowFence');\n      effects.enter('mathFlowFenceSequence');\n      return sequenceClose(code);\n    }\n\n    /**\n     * In closing fence sequence.\n     *\n     * ```markdown\n     *   | $$\n     *   | \\frac{1}{2}\n     * > | $$\n     *      ^\n     * ```\n     *\n     * @type {State}\n     */\n    function sequenceClose(code) {\n      if (code === 36) {\n        size++;\n        effects.consume(code);\n        return sequenceClose;\n      }\n      if (size < sizeOpen) {\n        return nok(code);\n      }\n      effects.exit('mathFlowFenceSequence');\n      return factorySpace(effects, afterSequenceClose, \"whitespace\")(code);\n    }\n\n    /**\n     * After closing fence sequence, after optional whitespace.\n     *\n     * ```markdown\n     *   | $$\n     *   | \\frac{1}{2}\n     * > | $$\n     *       ^\n     * ```\n     *\n     * @type {State}\n     */\n    function afterSequenceClose(code) {\n      if (code === null || markdownLineEnding(code)) {\n        effects.exit('mathFlowFence');\n        return ok(code);\n      }\n      return nok(code);\n    }\n  }\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Tokenizer}\n */\nfunction tokenizeNonLazyContinuation(effects, ok, nok) {\n  const self = this;\n  return start;\n\n  /** @type {State} */\n  function start(code) {\n    if (code === null) {\n      return ok(code);\n    }\n    effects.enter(\"lineEnding\");\n    effects.consume(code);\n    effects.exit(\"lineEnding\");\n    return lineStart;\n  }\n\n  /** @type {State} */\n  function lineStart(code) {\n    return self.parser.lazy[self.now().line] ? nok(code) : ok(code);\n  }\n}","/**\n * @import {Options} from 'micromark-extension-math'\n * @import {Construct, Previous, Resolver, State, Token, TokenizeContext, Tokenizer} from 'micromark-util-types'\n */\n\n// To do: next major: clean spaces in HTML compiler.\n// This has to be coordinated together with `mdast-util-math`.\n\nimport { markdownLineEnding } from 'micromark-util-character';\n/**\n * @param {Options | null | undefined} [options={}]\n *   Configuration (default: `{}`).\n * @returns {Construct}\n *   Construct.\n */\nexport function mathText(options) {\n  const options_ = options || {};\n  let single = options_.singleDollarTextMath;\n  if (single === null || single === undefined) {\n    single = true;\n  }\n  return {\n    tokenize: tokenizeMathText,\n    resolve: resolveMathText,\n    previous,\n    name: 'mathText'\n  };\n\n  /**\n   * @this {TokenizeContext}\n   * @type {Tokenizer}\n   */\n  function tokenizeMathText(effects, ok, nok) {\n    const self = this;\n    let sizeOpen = 0;\n    /** @type {number} */\n    let size;\n    /** @type {Token} */\n    let token;\n    return start;\n\n    /**\n     * Start of math (text).\n     *\n     * ```markdown\n     * > | $a$\n     *     ^\n     * > | \\$a$\n     *      ^\n     * ```\n     *\n     * @type {State}\n     */\n    function start(code) {\n      effects.enter('mathText');\n      effects.enter('mathTextSequence');\n      return sequenceOpen(code);\n    }\n\n    /**\n     * In opening sequence.\n     *\n     * ```markdown\n     * > | $a$\n     *     ^\n     * ```\n     *\n     * @type {State}\n     */\n\n    function sequenceOpen(code) {\n      if (code === 36) {\n        effects.consume(code);\n        sizeOpen++;\n        return sequenceOpen;\n      }\n\n      // Not enough markers in the sequence.\n      if (sizeOpen < 2 && !single) {\n        return nok(code);\n      }\n      effects.exit('mathTextSequence');\n      return between(code);\n    }\n\n    /**\n     * Between something and something else.\n     *\n     * ```markdown\n     * > | $a$\n     *      ^^\n     * ```\n     *\n     * @type {State}\n     */\n    function between(code) {\n      if (code === null) {\n        return nok(code);\n      }\n      if (code === 36) {\n        token = effects.enter('mathTextSequence');\n        size = 0;\n        return sequenceClose(code);\n      }\n\n      // Tabs don’t work, and virtual spaces don’t make sense.\n      if (code === 32) {\n        effects.enter('space');\n        effects.consume(code);\n        effects.exit('space');\n        return between;\n      }\n      if (markdownLineEnding(code)) {\n        effects.enter(\"lineEnding\");\n        effects.consume(code);\n        effects.exit(\"lineEnding\");\n        return between;\n      }\n\n      // Data.\n      effects.enter('mathTextData');\n      return data(code);\n    }\n\n    /**\n     * In data.\n     *\n     * ```markdown\n     * > | $a$\n     *      ^\n     * ```\n     *\n     * @type {State}\n     */\n    function data(code) {\n      if (code === null || code === 32 || code === 36 || markdownLineEnding(code)) {\n        effects.exit('mathTextData');\n        return between(code);\n      }\n      effects.consume(code);\n      return data;\n    }\n\n    /**\n     * In closing sequence.\n     *\n     * ```markdown\n     * > | `a`\n     *       ^\n     * ```\n     *\n     * @type {State}\n     */\n\n    function sequenceClose(code) {\n      // More.\n      if (code === 36) {\n        effects.consume(code);\n        size++;\n        return sequenceClose;\n      }\n\n      // Done!\n      if (size === sizeOpen) {\n        effects.exit('mathTextSequence');\n        effects.exit('mathText');\n        return ok(code);\n      }\n\n      // More or less accents: mark as data.\n      token.type = 'mathTextData';\n      return data(code);\n    }\n  }\n}\n\n/** @type {Resolver} */\nfunction resolveMathText(events) {\n  let tailExitIndex = events.length - 4;\n  let headEnterIndex = 3;\n  /** @type {number} */\n  let index;\n  /** @type {number | undefined} */\n  let enter;\n\n  // If we start and end with an EOL or a space.\n  if ((events[headEnterIndex][1].type === \"lineEnding\" || events[headEnterIndex][1].type === 'space') && (events[tailExitIndex][1].type === \"lineEnding\" || events[tailExitIndex][1].type === 'space')) {\n    index = headEnterIndex;\n\n    // And we have data.\n    while (++index < tailExitIndex) {\n      if (events[index][1].type === 'mathTextData') {\n        // Then we have padding.\n        events[tailExitIndex][1].type = 'mathTextPadding';\n        events[headEnterIndex][1].type = 'mathTextPadding';\n        headEnterIndex += 2;\n        tailExitIndex -= 2;\n        break;\n      }\n    }\n  }\n\n  // Merge adjacent spaces and data.\n  index = headEnterIndex - 1;\n  tailExitIndex++;\n  while (++index <= tailExitIndex) {\n    if (enter === undefined) {\n      if (index !== tailExitIndex && events[index][1].type !== \"lineEnding\") {\n        enter = index;\n      }\n    } else if (index === tailExitIndex || events[index][1].type === \"lineEnding\") {\n      events[enter][1].type = 'mathTextData';\n      if (index !== enter + 2) {\n        events[enter][1].end = events[index - 1][1].end;\n        events.splice(enter + 2, index - enter - 2);\n        tailExitIndex -= index - enter - 2;\n        index = enter + 2;\n      }\n      enter = undefined;\n    }\n  }\n  return events;\n}\n\n/**\n * @this {TokenizeContext}\n * @type {Previous}\n */\nfunction previous(code) {\n  // If there is a previous code, there will always be a tail.\n  return code !== 36 || this.events[this.events.length - 1][1].type === \"characterEscape\";\n}","/**\n * @import {Options} from 'micromark-extension-math'\n * @import {Extension} from 'micromark-util-types'\n */\n\nimport { mathFlow } from './math-flow.js';\nimport { mathText } from './math-text.js';\n\n/**\n * Create an extension for `micromark` to enable math syntax.\n *\n * @param {Options | null | undefined} [options={}]\n *   Configuration (default: `{}`).\n * @returns {Extension}\n *   Extension for `micromark` that can be passed in `extensions`, to\n *   enable math syntax.\n */\nexport function math(options) {\n  return {\n    flow: {\n      [36]: mathFlow\n    },\n    text: {\n      [36]: mathText(options)\n    }\n  };\n}","export function deprecate(fn) {\n  return fn\n}\n\nexport function equal() {}\n\nexport function ok() {}\n\nexport function unreachable() {}\n","/**\n * Get the count of the longest repeating streak of `substring` in `value`.\n *\n * @param {string} value\n *   Content to search in.\n * @param {string} substring\n *   Substring to look for, typically one character.\n * @returns {number}\n *   Count of most frequent adjacent `substring`s in `value`.\n */\nexport function longestStreak(value, substring) {\n  const source = String(value)\n  let index = source.indexOf(substring)\n  let expected = index\n  let count = 0\n  let max = 0\n\n  if (typeof substring !== 'string') {\n    throw new TypeError('Expected substring')\n  }\n\n  while (index !== -1) {\n    if (index === expected) {\n      if (++count > max) {\n        max = count\n      }\n    } else {\n      count = 1\n    }\n\n    expected = index + substring.length\n    index = source.indexOf(substring, expected)\n  }\n\n  return max\n}\n","/**\n * @typedef {import('hast').Element} HastElement\n * @typedef {import('hast').ElementContent} HastElementContent\n * @typedef {import('mdast-util-from-markdown').CompileContext} CompileContext\n * @typedef {import('mdast-util-from-markdown').Extension} FromMarkdownExtension\n * @typedef {import('mdast-util-from-markdown').Handle} FromMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Handle} ToMarkdownHandle\n * @typedef {import('mdast-util-to-markdown').Options} ToMarkdownExtension\n * @typedef {import('../index.js').InlineMath} InlineMath\n * @typedef {import('../index.js').Math} Math\n *\n * @typedef ToOptions\n *   Configuration.\n * @property {boolean | null | undefined} [singleDollarTextMath=true]\n *   Whether to support math (text) with a single dollar (default: `true`).\n *\n *   Single dollars work in Pandoc and many other places, but often interfere\n *   with “normal” dollars in text.\n *   If you turn this off, you can still use two or more dollars for text math.\n */\n\nimport {ok as assert} from 'devlop'\nimport {longestStreak} from 'longest-streak'\n\n/**\n * Create an extension for `mdast-util-from-markdown`.\n *\n * @returns {FromMarkdownExtension}\n *   Extension for `mdast-util-from-markdown`.\n */\nexport function mathFromMarkdown() {\n  return {\n    enter: {\n      mathFlow: enterMathFlow,\n      mathFlowFenceMeta: enterMathFlowMeta,\n      mathText: enterMathText\n    },\n    exit: {\n      mathFlow: exitMathFlow,\n      mathFlowFence: exitMathFlowFence,\n      mathFlowFenceMeta: exitMathFlowMeta,\n      mathFlowValue: exitMathData,\n      mathText: exitMathText,\n      mathTextData: exitMathData\n    }\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function enterMathFlow(token) {\n    /** @type {HastElement} */\n    const code = {\n      type: 'element',\n      tagName: 'code',\n      properties: {className: ['language-math', 'math-display']},\n      children: []\n    }\n    this.enter(\n      {\n        type: 'math',\n        meta: null,\n        value: '',\n        data: {hName: 'pre', hChildren: [code]}\n      },\n      token\n    )\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function enterMathFlowMeta() {\n    this.buffer()\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathFlowMeta() {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    assert(node.type === 'math')\n    node.meta = data\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathFlowFence() {\n    // Exit if this is the closing fence.\n    if (this.data.mathFlowInside) return\n    this.buffer()\n    this.data.mathFlowInside = true\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathFlow(token) {\n    const data = this.resume().replace(/^(\\r?\\n|\\r)|(\\r?\\n|\\r)$/g, '')\n    const node = this.stack[this.stack.length - 1]\n    assert(node.type === 'math')\n    this.exit(token)\n    node.value = data\n    // @ts-expect-error: we defined it in `enterMathFlow`.\n    const code = /** @type {HastElement} */ (node.data.hChildren[0])\n    assert(code.type === 'element')\n    assert(code.tagName === 'code')\n    code.children.push({type: 'text', value: data})\n    this.data.mathFlowInside = undefined\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function enterMathText(token) {\n    this.enter(\n      {\n        type: 'inlineMath',\n        value: '',\n        data: {\n          hName: 'code',\n          hProperties: {className: ['language-math', 'math-inline']},\n          hChildren: []\n        }\n      },\n      token\n    )\n    this.buffer()\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathText(token) {\n    const data = this.resume()\n    const node = this.stack[this.stack.length - 1]\n    assert(node.type === 'inlineMath')\n    this.exit(token)\n    node.value = data\n    const children = /** @type {Array<HastElementContent>} */ (\n      // @ts-expect-error: we defined it in `enterMathFlow`.\n      node.data.hChildren\n    )\n    children.push({type: 'text', value: data})\n  }\n\n  /**\n   * @this {CompileContext}\n   * @type {FromMarkdownHandle}\n   */\n  function exitMathData(token) {\n    this.config.enter.data.call(this, token)\n    this.config.exit.data.call(this, token)\n  }\n}\n\n/**\n * Create an extension for `mdast-util-to-markdown`.\n *\n * @param {ToOptions | null | undefined} [options]\n *   Configuration (optional).\n * @returns {ToMarkdownExtension}\n *   Extension for `mdast-util-to-markdown`.\n */\nexport function mathToMarkdown(options) {\n  let single = (options || {}).singleDollarTextMath\n\n  if (single === null || single === undefined) {\n    single = true\n  }\n\n  inlineMath.peek = inlineMathPeek\n\n  return {\n    unsafe: [\n      {character: '\\r', inConstruct: 'mathFlowMeta'},\n      {character: '\\n', inConstruct: 'mathFlowMeta'},\n      {\n        character: '$',\n        after: single ? undefined : '\\\\$',\n        inConstruct: 'phrasing'\n      },\n      {character: '$', inConstruct: 'mathFlowMeta'},\n      {atBreak: true, character: '$', after: '\\\\$'}\n    ],\n    handlers: {math, inlineMath}\n  }\n\n  /**\n   * @type {ToMarkdownHandle}\n   * @param {Math} node\n   */\n  // Note: fixing this code? Please also fix the similar code for code:\n  // <https://github.com/syntax-tree/mdast-util-to-markdown/blob/main/lib/handle/code.js>\n  function math(node, _, state, info) {\n    const raw = node.value || ''\n    const tracker = state.createTracker(info)\n    const sequence = '$'.repeat(Math.max(longestStreak(raw, '$') + 1, 2))\n    const exit = state.enter('mathFlow')\n    let value = tracker.move(sequence)\n\n    if (node.meta) {\n      const subexit = state.enter('mathFlowMeta')\n      value += tracker.move(\n        state.safe(node.meta, {\n          after: '\\n',\n          before: value,\n          encode: ['$'],\n          ...tracker.current()\n        })\n      )\n      subexit()\n    }\n\n    value += tracker.move('\\n')\n\n    if (raw) {\n      value += tracker.move(raw + '\\n')\n    }\n\n    value += tracker.move(sequence)\n    exit()\n    return value\n  }\n\n  /**\n   * @type {ToMarkdownHandle}\n   * @param {InlineMath} node\n   */\n  // Note: fixing this code? Please also fix the similar code for inline code:\n  // <https://github.com/syntax-tree/mdast-util-to-markdown/blob/main/lib/handle/inline-code.js>\n  function inlineMath(node, _, state) {\n    let value = node.value || ''\n    let size = 1\n\n    if (!single) size++\n\n    // If there is a single dollar sign on its own in the math, use a fence of\n    // two.\n    // If there are two in a row, use one.\n    while (\n      new RegExp('(^|[^$])' + '\\\\$'.repeat(size) + '([^$]|$)').test(value)\n    ) {\n      size++\n    }\n\n    const sequence = '$'.repeat(size)\n\n    // If this is not just spaces or eols (tabs don’t count), and either the\n    // first and last character are a space or eol, or the first or last\n    // character are dollar signs, then pad with spaces.\n    if (\n      // Contains non-space.\n      /[^ \\r\\n]/.test(value) &&\n      // Starts with space and ends with space.\n      ((/^[ \\r\\n]/.test(value) && /[ \\r\\n]$/.test(value)) ||\n        // Starts or ends with dollar.\n        /^\\$|\\$$/.test(value))\n    ) {\n      value = ' ' + value + ' '\n    }\n\n    let index = -1\n\n    // We have a potential problem: certain characters after eols could result in\n    // blocks being seen.\n    // For example, if someone injected the string `'\\n# b'`, then that would\n    // result in an ATX heading.\n    // We can’t escape characters in `inlineMath`, but because eols are\n    // transformed to spaces when going from markdown to HTML anyway, we can swap\n    // them out.\n    while (++index < state.unsafe.length) {\n      const pattern = state.unsafe[index]\n\n      // Only look for `atBreak`s.\n      // Btw: note that `atBreak` patterns will always start the regex at LF or\n      // CR.\n      if (!pattern.atBreak) continue\n\n      const expression = state.compilePattern(pattern)\n      /** @type {RegExpExecArray | null} */\n      let match\n\n      while ((match = expression.exec(value))) {\n        let position = match.index\n\n        // Support CRLF (patterns only look for one of the characters).\n        if (\n          value.codePointAt(position) === 10 /* `\\n` */ &&\n          value.codePointAt(position - 1) === 13 /* `\\r` */\n        ) {\n          position--\n        }\n\n        value = value.slice(0, position) + ' ' + value.slice(match.index + 1)\n      }\n    }\n\n    return sequence + value + sequence\n  }\n\n  /**\n   * @returns {string}\n   */\n  function inlineMathPeek() {\n    return '$'\n  }\n}\n","/// <reference types=\"remark-parse\" />\n/// <reference types=\"remark-stringify\" />\n\nimport type { Root } from \"mdast\";\nimport type { Processor } from \"unified\";\nimport { visit } from \"unist-util-visit\";\n\nimport \"./lib/types.js\";\n\nimport { wikilinkSyntax } from \"./lib/syntax/wikilink.js\";\nimport { highlightSyntax } from \"./lib/syntax/highlight.js\";\nimport { commentSyntax } from \"./lib/syntax/comment.js\";\nimport { tagSyntax } from \"./lib/syntax/tag.js\";\n\nimport { wikilinkFromMarkdown } from \"./lib/mdast/wikilink.js\";\nimport { highlightFromMarkdown } from \"./lib/mdast/highlight.js\";\nimport { commentFromMarkdown } from \"./lib/mdast/comment.js\";\nimport { tagFromMarkdown } from \"./lib/mdast/tag.js\";\nimport { wikilinkToMarkdown } from \"./lib/mdast/wikilink-to-markdown.js\";\nimport { highlightToMarkdown } from \"./lib/mdast/highlight-to-markdown.js\";\nimport { commentToMarkdown } from \"./lib/mdast/comment-to-markdown.js\";\nimport { tagToMarkdown } from \"./lib/mdast/tag-to-markdown.js\";\nimport { customTaskCharTransform } from \"./lib/task-char.js\";\n\nimport { math as mathSyntax } from \"micromark-extension-math\";\nimport { mathFromMarkdown, mathToMarkdown } from \"mdast-util-math\";\n\nexport interface RemarkObsidianOptions {\n  wikilinks?: boolean;\n  highlights?: boolean;\n  comments?: boolean;\n  tags?: boolean;\n  customTaskChars?: boolean;\n  math?: boolean;\n}\n\nconst defaultOptions: Required<RemarkObsidianOptions> = {\n  wikilinks: true,\n  highlights: true,\n  comments: true,\n  tags: true,\n  customTaskChars: true,\n  math: true,\n};\n\nexport default function remarkObsidian(\n  userOpts?: RemarkObsidianOptions,\n): undefined | ((tree: Root, file: any) => void) {\n  const opts = { ...defaultOptions, ...userOpts };\n  // @ts-expect-error - unified `this` context\n  const data = (this as Processor<Root>).data();\n\n  data.micromarkExtensions ??= [];\n  data.fromMarkdownExtensions ??= [];\n  data.toMarkdownExtensions ??= [];\n\n  if (opts.wikilinks) {\n    data.micromarkExtensions.push(wikilinkSyntax());\n    data.fromMarkdownExtensions.push(wikilinkFromMarkdown());\n    data.toMarkdownExtensions.push(wikilinkToMarkdown());\n  }\n  if (opts.comments) {\n    data.micromarkExtensions.push(commentSyntax());\n    data.fromMarkdownExtensions.push(commentFromMarkdown());\n    data.toMarkdownExtensions.push(commentToMarkdown());\n  }\n  if (opts.tags) {\n    data.micromarkExtensions.push(tagSyntax());\n    data.fromMarkdownExtensions.push(tagFromMarkdown());\n    data.toMarkdownExtensions.push(tagToMarkdown());\n  }\n  if (opts.highlights) {\n    data.micromarkExtensions.push(highlightSyntax());\n    data.fromMarkdownExtensions.push(highlightFromMarkdown());\n    data.toMarkdownExtensions.push(highlightToMarkdown());\n  }\n  if (opts.math) {\n    data.micromarkExtensions.push(mathSyntax());\n    data.fromMarkdownExtensions.push(mathFromMarkdown());\n    data.toMarkdownExtensions.push(mathToMarkdown());\n  }\n\n  const needsTransform = opts.comments || opts.customTaskChars;\n  if (!needsTransform) return undefined;\n\n  return (tree: Root, file: any) => {\n    if (opts.comments) {\n      visit(\n        tree,\n        \"comment\",\n        (_node: unknown, index: number | undefined, parent: any) => {\n          if (parent && typeof index === \"number\") {\n            parent.children.splice(index, 1);\n            return index;\n          }\n          return undefined;\n        },\n      );\n    }\n    if (opts.customTaskChars) {\n      customTaskCharTransform(tree, String(file));\n    }\n  };\n}\n\nexport { wikilinkSyntax } from \"./lib/syntax/wikilink.js\";\nexport { highlightSyntax } from \"./lib/syntax/highlight.js\";\nexport { commentSyntax } from \"./lib/syntax/comment.js\";\nexport { tagSyntax } from \"./lib/syntax/tag.js\";\n\nexport { wikilinkFromMarkdown } from \"./lib/mdast/wikilink.js\";\nexport { highlightFromMarkdown } from \"./lib/mdast/highlight.js\";\nexport { commentFromMarkdown } from \"./lib/mdast/comment.js\";\nexport { tagFromMarkdown } from \"./lib/mdast/tag.js\";\nexport { wikilinkToMarkdown } from \"./lib/mdast/wikilink-to-markdown.js\";\nexport { highlightToMarkdown } from \"./lib/mdast/highlight-to-markdown.js\";\nexport { commentToMarkdown } from \"./lib/mdast/comment-to-markdown.js\";\nexport { tagToMarkdown } from \"./lib/mdast/tag-to-markdown.js\";\nexport { customTaskCharTransform } from \"./lib/task-char.js\";\n\nexport type { Wikilink, Highlight, Comment, Tag } from \"./lib/types.js\";\n"],"mappings":";AA4IO,IAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAgBT,SAAU,MAAM;AACd,QAAI,SAAS,QAAQ,SAAS,QAAW;AACvC,aAAO;AAAA,IACT;AAEA,QAAI,OAAO,SAAS,YAAY;AAC9B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,QAAI,OAAO,SAAS,UAAU;AAC5B,aAAO,MAAM,QAAQ,IAAI,IACrB,WAAW,IAAI;AAAA;AAAA;AAAA,QAGf;AAAA;AAAA,UAAwC;AAAA,QAAK;AAAA;AAAA,IACnD;AAEA,QAAI,OAAO,SAAS,UAAU;AAC5B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AAAA;AAOJ,SAAS,WAAW,OAAO;AAEzB,QAAM,SAAS,CAAC;AAChB,MAAI,QAAQ;AAEZ,SAAO,EAAE,QAAQ,MAAM,QAAQ;AAC7B,WAAO,KAAK,IAAI,QAAQ,MAAM,KAAK,CAAC;AAAA,EACtC;AAEA,SAAO,YAAY,GAAG;AAMtB,WAAS,OAAO,YAAY;AAC1B,QAAIA,SAAQ;AAEZ,WAAO,EAAEA,SAAQ,OAAO,QAAQ;AAC9B,UAAI,OAAOA,MAAK,EAAE,MAAM,MAAM,UAAU,EAAG,QAAO;AAAA,IACpD;AAEA,WAAO;AAAA,EACT;AACF;AAQA,SAAS,kBAAkB,OAAO;AAChC,QAAM;AAAA;AAAA,IAAwD;AAAA;AAE9D,SAAO,YAAY,GAAG;AAMtB,WAAS,IAAI,MAAM;AACjB,UAAM;AAAA;AAAA;AAAA,MACoB;AAAA;AAI1B,QAAI;AAEJ,SAAK,OAAO,OAAO;AACjB,UAAI,aAAa,GAAG,MAAM,cAAc,GAAG,EAAG,QAAO;AAAA,IACvD;AAEA,WAAO;AAAA,EACT;AACF;AAQA,SAAS,YAAY,OAAO;AAC1B,SAAO,YAAY,IAAI;AAKvB,WAAS,KAAK,MAAM;AAClB,WAAO,QAAQ,KAAK,SAAS;AAAA,EAC/B;AACF;AAQA,SAAS,YAAY,cAAc;AACjC,SAAO;AAMP,WAAS,MAAM,OAAO,OAAO,QAAQ;AACnC,WAAO;AAAA,MACL,eAAe,KAAK,KAClB,aAAa;AAAA,QACX;AAAA,QACA;AAAA,QACA,OAAO,UAAU,WAAW,QAAQ;AAAA,QACpC,UAAU;AAAA,MACZ;AAAA,IACJ;AAAA,EACF;AACF;AAEA,SAAS,KAAK;AACZ,SAAO;AACT;AAMA,SAAS,eAAe,OAAO;AAC7B,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,UAAU;AAClE;;;ACnSO,SAAS,MAAM,GAAG;AACvB,SAAO,aAAe,IAAI;AAC5B;;;AC0NA,IAAM,QAAQ,CAAC;AAKR,IAAM,WAAW;AAKjB,IAAM,OAAO;AAKb,IAAM,OAAO;AAiDb,SAAS,aAAa,MAAM,MAAM,SAAS,SAAS;AAEzD,MAAI;AAEJ,MAAI,OAAO,SAAS,cAAc,OAAO,YAAY,YAAY;AAC/D,cAAU;AAEV,cAAU;AAAA,EACZ,OAAO;AAEL,YAAQ;AAAA,EACV;AAEA,QAAMC,MAAK,QAAQ,KAAK;AACxB,QAAM,OAAO,UAAU,KAAK;AAE5B,UAAQ,MAAM,QAAW,CAAC,CAAC,EAAE;AAO7B,WAAS,QAAQ,MAAM,OAAO,SAAS;AACrC,UAAM;AAAA;AAAA,MACJ,QAAQ,OAAO,SAAS,WAAW,OAAO,CAAC;AAAA;AAG7C,QAAI,OAAO,MAAM,SAAS,UAAU;AAClC,YAAM;AAAA;AAAA,QAEJ,OAAO,MAAM,YAAY,WACrB,MAAM;AAAA;AAAA,UAEN,OAAO,MAAM,SAAS,WACpB,MAAM,OACN;AAAA;AAAA;AAER,aAAO,eAAeC,QAAO,QAAQ;AAAA,QACnC,OACE,WAAW,MAAM,KAAK,QAAQ,OAAO,MAAM,OAAO,MAAM,GAAG,IAAI;AAAA,MACnE,CAAC;AAAA,IACH;AAEA,WAAOA;AAEP,aAASA,SAAQ;AAEf,UAAI,SAAS;AAEb,UAAI;AAEJ,UAAI;AAEJ,UAAI;AAEJ,UAAI,CAAC,QAAQD,IAAG,MAAM,OAAO,QAAQ,QAAQ,SAAS,CAAC,KAAK,MAAS,GAAG;AAEtE,iBAAS,SAAS,QAAQ,MAAM,OAAO,CAAC;AAExC,YAAI,OAAO,CAAC,MAAM,MAAM;AACtB,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,cAAc,QAAQ,KAAK,UAAU;AACvC,cAAM;AAAA;AAAA,UAA2C;AAAA;AAEjD,YAAI,aAAa,YAAY,OAAO,CAAC,MAAM,MAAM;AAC/C,oBAAU,UAAU,aAAa,SAAS,SAAS,MAAM;AACzD,yBAAe,QAAQ,OAAO,YAAY;AAE1C,iBAAO,SAAS,MAAM,SAAS,aAAa,SAAS,QAAQ;AAC3D,kBAAM,QAAQ,aAAa,SAAS,MAAM;AAE1C,wBAAY,QAAQ,OAAO,QAAQ,YAAY,EAAE;AAEjD,gBAAI,UAAU,CAAC,MAAM,MAAM;AACzB,qBAAO;AAAA,YACT;AAEA,qBACE,OAAO,UAAU,CAAC,MAAM,WAAW,UAAU,CAAC,IAAI,SAAS;AAAA,UAC/D;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAUA,SAAS,SAAS,OAAO;AACvB,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,CAAC,UAAU,KAAK;AAAA,EACzB;AAEA,SAAO,UAAU,QAAQ,UAAU,SAAY,QAAQ,CAAC,KAAK;AAC/D;;;ACzHO,SAAS,MAAM,MAAM,eAAe,kBAAkB,cAAc;AAEzE,MAAI;AAEJ,MAAI;AAEJ,MAAI;AAEJ,MACE,OAAO,kBAAkB,cACzB,OAAO,qBAAqB,YAC5B;AACA,WAAO;AACP,cAAU;AACV,cAAU;AAAA,EACZ,OAAO;AAEL,WAAO;AAEP,cAAU;AACV,cAAU;AAAA,EACZ;AAEA,eAAa,MAAM,MAAM,UAAU,OAAO;AAM1C,WAAS,SAAS,MAAM,SAAS;AAC/B,UAAM,SAAS,QAAQ,QAAQ,SAAS,CAAC;AACzC,UAAM,QAAQ,SAAS,OAAO,SAAS,QAAQ,IAAI,IAAI;AACvD,WAAO,QAAQ,MAAM,OAAO,MAAM;AAAA,EACpC;AACF;;;ACrSO,IAAM;AAAA;AAAA,EAA8B;AAAA,IACzC,gBAAgB;AAAA,IAChB,UAAU;AAAA,IACV,wBAAwB;AAAA,IACxB,eAAe;AAAA,IACf,cAAc;AAAA,IACd,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,IAAI;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,KAAK;AAAA,IACL,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,OAAO;AAAA,IACP,iBAAiB;AAAA;AAAA,IACjB,eAAe;AAAA;AAAA,IACf,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,aAAa;AAAA;AAAA,IACb,WAAW;AAAA;AAAA,IACX,YAAY;AAAA;AAAA,IACZ,iBAAiB;AAAA;AAAA,IACjB,kBAAkB;AAAA;AAAA,IAClB,UAAU;AAAA;AAAA,IACV,UAAU;AAAA;AAAA,IACV,OAAO;AAAA;AAAA,IACP,MAAM;AAAA;AAAA,IACN,KAAK;AAAA;AAAA,IACL,OAAO;AAAA;AAAA,IACP,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,QAAQ;AAAA;AAAA,IACR,OAAO;AAAA;AAAA,IACP,WAAW;AAAA;AAAA,IACX,UAAU;AAAA;AAAA,IACV,UAAU;AAAA;AAAA,IACV,aAAa;AAAA;AAAA,IACb,cAAc;AAAA;AAAA,IACd,QAAQ;AAAA;AAAA,IACR,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,mBAAmB;AAAA;AAAA,IACnB,WAAW;AAAA;AAAA,IACX,oBAAoB;AAAA;AAAA,IACpB,OAAO;AAAA;AAAA,IACP,YAAY;AAAA;AAAA,IACZ,aAAa;AAAA;AAAA,IACb,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,YAAY;AAAA;AAAA,IACZ,gBAAgB;AAAA;AAAA,IAChB,aAAa;AAAA;AAAA,IACb,iBAAiB;AAAA;AAAA,IACjB,OAAO;AAAA;AAAA,IACP,KAAK;AAAA;AAAA,IAEL,iBAAiB;AAAA;AAAA,IAEjB,sBAAsB;AAAA;AAAA,EACxB;AAAA;;;ACpJA,IAAM,cAAc;AACpB,IAAM,OAAO;AACb,IAAM,eAAe;AACrB,IAAM,YAAY;AAClB,IAAM,gBAAgB;AACtB,IAAM,OAAO;AAEb,SAAS,aAAa,MAAqB;AACzC,SAAO,SAAS,MAAM,YAAY,SAAS,MAAM;AACnD;AAEO,SAAS,iBAA4B;AAC1C,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,YAAY,GAAG,EAAE,MAAM,YAAY,SAAS;AAAA,MAC7C,CAAC,WAAW,GAAG,EAAE,MAAM,YAAY,SAAS;AAAA,IAC9C;AAAA,EACF;AACF;AAEA,SAAS,SAEP,SACAE,KACA,KACO;AACP,MAAI,UAAU;AACd,MAAI,aAAa;AACjB,MAAI,WAAW;AAEf,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,aAAa;AACxB,cAAQ,MAAM,UAAU;AACxB,cAAQ,MAAM,qBAAqB;AACnC,cAAQ,QAAQ,IAAI;AACpB,cAAQ,KAAK,qBAAqB;AAClC,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,cAAc;AACzB,cAAQ,MAAM,UAAU;AACxB,aAAO,UAAU,IAAI;AAAA,IACvB;AAEA,WAAO,IAAI,IAAI;AAAA,EACjB;AAEA,WAAS,UAAU,MAA+B;AAChD,QAAI,SAAS,aAAc,QAAO,IAAI,IAAI;AAC1C,YAAQ,MAAM,gBAAgB;AAC9B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,aAAc,QAAO,IAAI,IAAI;AAC1C,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,gBAAgB;AAC7B,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,MAA+B;AAChD,QAAI,SAAS,KAAM,QAAO,cAAc,IAAI;AAC5C,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,QAAI,SAAS,iBAAiB,SAAS,QAAQ,aAAa,IAAI;AAC9D,aAAO,IAAI,IAAI;AACjB,YAAQ,MAAM,cAAc;AAC5B,cAAU;AACV,WAAO,KAAK,IAAI;AAAA,EAClB;AAEA,WAAS,KAAK,MAA+B;AAC3C,QAAI,SAAS,WAAW;AACtB,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,cAAc;AAC3B,aAAO,cAAc,IAAI;AAAA,IAC3B;AAEA,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,cAAc;AAC3B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,QAAI,SAAS,eAAe;AAC1B,cAAQ,KAAK,cAAc;AAC3B,aAAO,WAAW,IAAI;AAAA,IACxB;AAEA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AAExD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,cAAc;AAC3B,aAAO,YAAY,IAAI;AAAA,IACzB;AACA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,cAAc,MAA+B;AACpD,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,YAAQ,MAAM,uBAAuB;AACrC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,uBAAuB;AACpC,WAAO;AAAA,EACT;AAEA,WAAS,aAAa,MAA+B;AACnD,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AAGxD,QAAI,SAAS,eAAe;AAC1B,mBAAa;AACb,aAAO,WAAW,IAAI;AAAA,IACxB;AACA,QAAI,SAAS,MAAM;AACjB,mBAAa;AACb,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,YAAQ,MAAM,iBAAiB;AAC/B,iBAAa;AACb,WAAO,QAAQ,IAAI;AAAA,EACrB;AAEA,WAAS,QAAQ,MAA+B;AAC9C,QAAI,SAAS,WAAW;AACtB,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,iBAAiB;AAC9B,aAAO,YAAY,IAAI;AAAA,IACzB;AAEA,QAAI,SAAS,eAAe;AAC1B,cAAQ,KAAK,iBAAiB;AAC9B,aAAO,WAAW,IAAI;AAAA,IACxB;AAEA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AAExD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,cAAc,MAA+B;AACpD,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,iBAAiB;AAC9B,aAAO,YAAY,IAAI;AAAA,IACzB;AACA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,YAAY,MAA+B;AAClD,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,YAAQ,MAAM,qBAAqB;AACnC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,qBAAqB;AAClC,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,cAAe,QAAO,WAAW,IAAI;AAClD,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,YAAQ,MAAM,eAAe;AAC7B,eAAW;AACX,WAAO,MAAM,IAAI;AAAA,EACnB;AAEA,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,eAAe;AAC1B,cAAQ,KAAK,eAAe;AAC5B,aAAO,WAAW,IAAI;AAAA,IACxB;AAEA,QAAI,SAAS,QAAQ,aAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AAExD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,cAAe,QAAO,IAAI,IAAI;AAC3C,QAAI,CAAC,WAAW,CAAC,cAAc,CAAC,SAAU,QAAO,IAAI,IAAI;AACzD,YAAQ,MAAM,gBAAgB;AAC9B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,YAAY,MAA+B;AAClD,QAAI,SAAS,cAAe,QAAO,IAAI,IAAI;AAC3C,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,gBAAgB;AAC7B,YAAQ,KAAK,UAAU;AACvB,WAAOA;AAAA,EACT;AACF;;;AClNA,IAAM,SAAS;AAEf,SAASC,cAAa,MAAqB;AACzC,SAAO,SAAS,MAAM,YAAY,SAAS,MAAM;AACnD;AAEO,SAAS,kBAA6B;AAC3C,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,MAAM,GAAG,EAAE,MAAM,aAAa,UAAAC,UAAS;AAAA,IAC1C;AAAA,EACF;AACF;AAEA,SAASA,UAEP,SACAC,KACA,KACO;AACP,QAAM,QAAmB,EAAE,UAAU,eAAe,SAAS,KAAK;AAClE,MAAI,aAAa;AACjB,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,OAAQ,QAAO,IAAI,IAAI;AACpC,YAAQ,MAAM,WAAW;AACzB,YAAQ,MAAM,iBAAiB;AAC/B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,OAAQ,QAAO,IAAI,IAAI;AACpC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,iBAAiB;AAC9B,YAAQ,MAAM,kBAAkB;AAChC,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ,MAA+B;AAC9C,QAAI,SAAS,QAAQF,cAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,QAAI,CAAC,cAAc,SAAS,OAAQ,QAAO,IAAI,IAAI;AACnD,QAAI,SAAS;AACX,aAAO,QAAQ,QAAQ,OAAO,YAAY,cAAc,EAAE,IAAI;AAChE,YAAQ,QAAQ,IAAI;AACpB,iBAAa;AACb,WAAO;AAAA,EACT;AAEA,WAAS,eAAe,MAA+B;AACrD,QAAI,SAAS,QAAQA,cAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxD,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,cAEP,cACA,SACA,UACO;AACP,WAAO;AAEP,aAAS,WAAW,WAAoC;AACtD,UAAI,cAAc,OAAQ,QAAO,SAAS,SAAS;AACnD,mBAAa,KAAK,kBAAkB;AACpC,mBAAa,MAAM,iBAAiB;AACpC,mBAAa,QAAQ,SAAS;AAC9B,aAAO;AAAA,IACT;AAEA,aAAS,YAAY,WAAoC;AACvD,UAAI,cAAc,OAAQ,QAAO,SAAS,SAAS;AACnD,mBAAa,QAAQ,SAAS;AAC9B,mBAAa,KAAK,iBAAiB;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,WAAW,MAA+B;AACjD,YAAQ,KAAK,WAAW;AACxB,WAAOE,IAAG,IAAI;AAAA,EAChB;AACF;;;ACrFA,IAAM,UAAU;AAChB,IAAM,YAAY;AAClB,IAAM,kBAAkB;AACxB,IAAM,4BAA4B;AAElC,SAASC,cAAa,MAA4B;AAChD,SACE,SAAS,aACT,SAAS,mBACT,SAAS;AAEb;AAEA,IAAM,cAAyB;AAAA,EAC7B,UAAU;AAAA,EACV,UAAU;AAAA,EACV,MAAM;AACR;AAEA,IAAM,sBAAiC;AAAA,EACrC,UAAU;AAAA,EACV,SAAS;AACX;AAEO,SAAS,gBAA2B;AACzC,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,OAAO,GAAG,EAAE,MAAM,WAAW,UAAU,aAAa;AAAA,IACvD;AAAA,IACA,MAAM;AAAA,MACJ,CAAC,OAAO,GAAG;AAAA,IACb;AAAA,EACF;AACF;AAEA,SAAS,aAEP,SACAC,KACA,KACO;AACP,QAAM,QAAmB,EAAE,UAAU,eAAe,SAAS,KAAK;AAClE,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,QAAS,QAAO,IAAI,IAAI;AACrC,YAAQ,MAAM,SAAS;AACvB,YAAQ,MAAM,eAAe;AAC7B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,QAAS,QAAO,IAAI,IAAI;AACrC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,eAAe;AAC5B,YAAQ,MAAM,gBAAgB;AAC9B,WAAO;AAAA,EACT;AAEA,WAAS,QAAQ,MAA+B;AAC9C,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,QAAI,SAAS;AACX,aAAO,QAAQ,QAAQ,OAAO,YAAY,cAAc,EAAE,IAAI;AAChE,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,eAAe,MAA+B;AACrD,QAAI,SAAS,KAAM,QAAO,IAAI,IAAI;AAClC,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,cAEP,cACA,SACA,UACO;AACP,WAAO;AAEP,aAAS,WAAW,WAAoC;AACtD,UAAI,cAAc,QAAS,QAAO,SAAS,SAAS;AACpD,mBAAa,KAAK,gBAAgB;AAClC,mBAAa,MAAM,eAAe;AAClC,mBAAa,QAAQ,SAAS;AAC9B,aAAO;AAAA,IACT;AAEA,aAAS,YAAY,WAAoC;AACvD,UAAI,cAAc,QAAS,QAAO,SAAS,SAAS;AACpD,mBAAa,QAAQ,SAAS;AAC9B,mBAAa,KAAK,eAAe;AACjC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,WAAW,MAA+B;AACjD,YAAQ,KAAK,SAAS;AACtB,WAAOA,IAAG,IAAI;AAAA,EAChB;AACF;AAEA,SAAS,aAEP,SACAA,KACA,KACO;AACP,QAAM,OAAO;AACb,QAAM,YAAuB;AAAA,IAC3B,UAAU;AAAA,IACV,SAAS;AAAA,EACX;AAEA,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,QAAS,QAAO,IAAI,IAAI;AACrC,YAAQ,MAAM,SAAS;AACvB,YAAQ,MAAM,eAAe;AAC7B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,QAAS,QAAO,IAAI,IAAI;AACrC,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,eAAe;AAC5B,WAAO;AAAA,EACT;AAKA,WAAS,UAAU,MAA+B;AAChD,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,SAAS;AACtB,aAAOA,IAAG,IAAI;AAAA,IAChB;AAEA,QAAID,cAAa,IAAI,GAAG;AACtB,aAAO,QAAQ;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,MACF,EAAE,IAAI;AAAA,IACR;AAEA,YAAQ,MAAM,gBAAgB;AAC9B,WAAO,aAAa,IAAI;AAAA,EAC1B;AAEA,WAAS,mBAAmB,MAA+B;AACzD,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,SAAS;AACtB,aAAOC,IAAG,IAAI;AAAA,IAChB;AAEA,QAAID,cAAa,IAAI,GAAG;AACtB,aAAO,QAAQ;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,MACF,EAAE,IAAI;AAAA,IACR;AAEA,QAAI,SAAS,SAAS;AACpB,aAAO,QAAQ,QAAQ,WAAW,YAAY,YAAY,EAAE,IAAI;AAAA,IAClE;AAEA,YAAQ,MAAM,gBAAgB;AAC9B,WAAO,aAAa,IAAI;AAAA,EAC1B;AAEA,WAAS,aAAa,MAA+B;AACnD,YAAQ,MAAM,gBAAgB;AAC9B,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,aAAa,MAA+B;AACnD,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,gBAAgB;AAC7B,cAAQ,KAAK,SAAS;AACtB,aAAOC,IAAG,IAAI;AAAA,IAChB;AAEA,QAAI,SAAS,SAAS;AACpB,aAAO,QAAQ,QAAQ,WAAW,YAAY,cAAc,EAAE,IAAI;AAAA,IACpE;AAEA,QAAID,cAAa,IAAI,GAAG;AACtB,cAAQ,KAAK,gBAAgB;AAC7B,aAAO,QAAQ;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,MACF,EAAE,IAAI;AAAA,IACR;AAEA,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,eAAe,MAA+B;AACrD,QAAI,SAAS,MAAM;AACjB,cAAQ,KAAK,gBAAgB;AAC7B,cAAQ,KAAK,SAAS;AACtB,aAAOC,IAAG,IAAI;AAAA,IAChB;AACA,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,YAAQ,KAAK,SAAS;AACtB,WAAOA,IAAG,IAAI;AAAA,EAChB;AAGA,WAAS,UAAU,MAA+B;AAChD,YAAQ,KAAK,SAAS;AACtB,WAAOA,IAAG,IAAI;AAAA,EAChB;AAEA,WAAS,kBAEP,cACA,SACA,UACO;AACP,QAAI,YAAY;AAChB,WAAO;AAEP,aAAS,WAAW,WAAoC;AACtD,UAAI,cAAc,QAAS,QAAO,SAAS,SAAS;AACpD,YAAM,UAAU,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAClD,UACE,WACA,QAAQ,CAAC,MAAM,WACf,QAAQ,CAAC,EAAE,SAAS,kBACpB;AACA,qBAAa,KAAK,gBAAgB;AAClC,oBAAY;AAAA,MACd;AACA,mBAAa,MAAM,eAAe;AAClC,mBAAa,QAAQ,SAAS;AAC9B,aAAO;AAAA,IACT;AAEA,aAAS,YAAY,WAAoC;AACvD,UAAI,cAAc,SAAS;AACzB,YAAI,WAAW;AACb,uBAAa,KAAK,eAAe;AACjC,uBAAa,MAAM,gBAAgB;AAAA,QACrC;AACA,eAAO,SAAS,SAAS;AAAA,MAC3B;AACA,mBAAa,QAAQ,SAAS;AAC9B,mBAAa,KAAK,eAAe;AACjC,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,4BAEP,SACAA,KACA,KACO;AACP,QAAM,OAAO;AACb,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,QAAI,SAAS,MAAM;AACjB,aAAOA,IAAG,IAAI;AAAA,IAChB;AACA,QAAI,CAACD,cAAa,IAAI,EAAG,QAAO,IAAI,IAAI;AACxC,YAAQ,MAAM,YAAY;AAC1B,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,YAAY;AACzB,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,MAA+B;AAChD,WAAO,KAAK,OAAO,KAAK,KAAK,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAIC,IAAG,IAAI;AAAA,EAChE;AACF;;;AClSA,IAAMC,QAAO;AACb,IAAM,QAAQ;AACd,IAAM,OAAO;AACb,IAAM,aAAa;AAEnB,IAAM,eAAe;AAErB,SAAS,aAAa,MAAqB;AACzC,SACE,SAAS,MAAM,SACf,SAAS,MAAM,iBACf,SAAS,MAAM,YACf,SAAS,MAAM,kBACf,SAAS,MAAM;AAEnB;AAEA,SAAS,UAAU,MAAqB;AACtC,MAAI,SAAS,QAAQ,OAAO,EAAG,QAAO;AACtC,MAAI,QAAQ,MAAM,QAAQ,GAAI,QAAO;AACrC,MAAI,SAAS,QAAQ,SAAS,WAAY,QAAO;AACjD,SAAO,aAAa,KAAK,OAAO,cAAc,IAAI,CAAC;AACrD;AAEA,SAAS,WAAW,MAAqB;AACvC,MAAI,SAAS,KAAM,QAAO;AAC1B,SAAO,EAAE,QAAQ,MAAM,QAAQ;AACjC;AAEO,SAAS,YAAuB;AACrC,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAACA,KAAI,GAAG,EAAE,MAAM,OAAO,UAAAC,UAAS;AAAA,IAClC;AAAA,EACF;AACF;AAEA,SAASA,UAEP,SACAC,KACA,KACO;AACP,MAAI,cAAc;AAClB,QAAM,UAAU;AAEhB,SAAO;AAEP,WAAS,MAAM,MAA+B;AAC5C,UAAMC,YAAW,QAAQ;AACzB,UAAM,eACJA,cAAa,QAAQ,aAAaA,SAAQ,KAAKA,cAAaH;AAC9D,QAAI,CAAC,aAAc,QAAO,IAAI,IAAI;AAClC,QAAI,SAASA,MAAM,QAAO,IAAI,IAAI;AAClC,YAAQ,MAAM,KAAK;AACnB,YAAQ,MAAM,WAAW;AACzB,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,WAAW;AACxB,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,MAA+B;AAC/C,QAAI,CAAC,UAAU,IAAI,EAAG,QAAO,IAAI,IAAI;AACrC,YAAQ,MAAM,YAAY;AAC1B,QAAI,WAAW,IAAI,EAAG,eAAc;AACpC,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,SAAS,OAAO;AAClB,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAEA,QAAI,UAAU,IAAI,GAAG;AACnB,UAAI,WAAW,IAAI,EAAG,eAAc;AACpC,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAEA,WAAO,IAAI,IAAI;AAAA,EACjB;AAEA,WAAS,WAAW,MAA+B;AACjD,QAAI,CAAC,UAAU,IAAI,EAAG,QAAO,IAAI,IAAI;AACrC,QAAI,WAAW,IAAI,EAAG,eAAc;AACpC,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,MAA+B;AAC1C,QAAI,CAAC,YAAa,QAAO,IAAI,IAAI;AACjC,YAAQ,KAAK,YAAY;AACzB,YAAQ,KAAK,KAAK;AAClB,WAAOE,IAAG,IAAI;AAAA,EAChB;AACF;;;ACxGO,SAAS,uBAAkC;AAChD,SAAO;AAAA,IACL,OAAO;AAAA,MACL,SAAS,OAAO;AACd,aAAK;AAAA,UACH;AAAA,YACE,MAAM;AAAA,YACN,OAAO;AAAA,YACP,UAAU;AAAA,YACV,MAAM;AAAA,YACN,SAAS;AAAA,YACT,OAAO;AAAA,UACT;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,MACA,sBAAsB;AACpB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,WAAW;AAAA,MAClB;AAAA,MACA,aAAa,OAAO;AAClB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,OAAO,KAAK,eAAe,KAAK,EAAE,QAAQ,gBAAgB,IAAI;AAAA,MACrE;AAAA,MACA,gBAAgB,OAAO;AACrB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,UAAU,KAAK,eAAe,KAAK,EAAE,QAAQ,gBAAgB,IAAI;AAAA,MACxE;AAAA,MACA,cAAc,OAAO;AACnB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,QAAQ,KAAK,eAAe,KAAK;AAAA,MACxC;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ,SAAS,OAAO;AACd,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,YAAI,KAAK,OAAO;AACd,cAAI,KAAK,KAAK,SAAS,IAAI,EAAG,MAAK,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAC/D,cAAI,KAAK,QAAQ,SAAS,IAAI;AAC5B,iBAAK,UAAU,KAAK,QAAQ,MAAM,GAAG,EAAE;AAAA,QAC3C;AACA,aAAK,KAAK,KAAK;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACF;;;AC7CO,SAAS,wBAAmC;AACjD,SAAO;AAAA,IACL,OAAO;AAAA,MACL,UAAU,OAAO;AACf,aAAK,MAAM,EAAE,MAAM,aAAa,UAAU,CAAC,EAAE,GAAG,KAAK;AAAA,MACvD;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ,iBAAiB,OAAO;AACtB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,WAAW,CAAC,EAAE,MAAM,QAAQ,OAAO,KAAK,eAAe,KAAK,EAAE,CAAC;AAAA,MACtE;AAAA,MACA,UAAU,OAAO;AACf,aAAK,KAAK,KAAK;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACF;;;ACjBO,SAAS,sBAAiC;AAC/C,SAAO;AAAA,IACL,OAAO;AAAA,MACL,QAAQ,OAAO;AACb,aAAK,MAAM,EAAE,MAAM,WAAW,OAAO,GAAG,GAAG,KAAK;AAAA,MAClD;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ,eAAe,OAAO;AACpB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,aAAK,SAAS,KAAK,eAAe,KAAK;AAAA,MACzC;AAAA,MACA,QAAQ,OAAO;AACb,aAAK,KAAK,KAAK;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACF;;;ACjBO,SAAS,kBAA6B;AAC3C,SAAO;AAAA,IACL,OAAO;AAAA,MACL,IAAI,OAAO;AACT,aAAK,MAAM,EAAE,MAAM,OAAO,OAAO,GAAG,GAAG,KAAK;AAAA,MAC9C;AAAA,MACA,WAAW,OAAO;AAChB,cAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,YAAI,KAAK,SAAS,MAAO,MAAK,QAAQ,KAAK,eAAe,KAAK;AAAA,MACjE;AAAA,IACF;AAAA,IACA,MAAM;AAAA,MACJ,IAAI,OAAO;AACT,aAAK,KAAK,KAAK;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AACF;;;AChBO,SAAS,qBAA8B;AAC5C,SAAO;AAAA,IACL,UAAU;AAAA,MACR,SAAS,MAAgB;AACvB,cAAM,SAAS,KAAK,WAAW,MAAM;AACrC,cAAM,UAAU,KAAK,UAAU,IAAI,KAAK,OAAO,KAAK;AACpD,cAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,KAAK,KAAK;AAC9C,eAAO,GAAG,MAAM,KAAK,KAAK,IAAI,GAAG,OAAO,GAAG,KAAK;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AACF;;;ACVO,SAAS,sBAA+B;AAC7C,SAAO;AAAA,IACL,UAAU;AAAA,MACR,UACE,MACA,SACA,OACA,MACA;AACA,cAAM,OAAO,MAAM,MAAM,WAAkB;AAC3C,cAAM,UAAU,MAAM,kBAAkB,MAAM,IAAI;AAClD,aAAK;AACL,eAAO,KAAK,OAAO;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACF;;;ACjBO,SAAS,oBAA6B;AAC3C,SAAO;AAAA,IACL,UAAU;AAAA,MACR,QAAQ,MAAe;AACrB,eAAO,KAAK,KAAK,KAAK;AAAA,MACxB;AAAA,IACF;AAAA,EACF;AACF;;;ACRO,SAAS,gBAAyB;AACvC,SAAO;AAAA,IACL,UAAU;AAAA,MACR,IAAI,MAAW;AACb,eAAO,IAAI,KAAK,KAAK;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AACF;;;ACRO,SAAS,wBAAwB,MAAY,QAAiB;AACnE,QAAM,MAAM,YAAY,CAAC,SAAc;AACrC,QAAI,OAAO,KAAK,YAAY,WAAW;AACrC,UAAI,OAAO,KAAK,UAAU,MAAM;AAGhC,UAAI,UAAU,KAAK,UAAU,OAAO,UAAU,MAAM;AAClD,cAAM,QAAQ,OAAO;AAAA,UACnB,KAAK,SAAS,MAAM;AAAA,UACpB,KAAK,SAAS,MAAM,SAAS;AAAA,QAC/B;AACA,cAAM,IAAI,MAAM,MAAM,aAAa;AACnC,YAAI,GAAG;AACL,iBAAO,EAAE,CAAC;AAAA,QACZ;AAAA,MACF;AAEA,WAAK,SAAS,CAAC;AACf,WAAK,KAAK,WAAW;AACrB,WAAK,KAAK,gBAAgB,CAAC;AAC3B,WAAK,KAAK,YAAY,eAAe;AACrC;AAAA,IACF;AAEA,UAAM,aAAa,KAAK,WAAW,CAAC;AACpC,QAAI,CAAC,cAAc,WAAW,SAAS,YAAa;AAEpD,UAAM,YAAY,WAAW,WAAW,CAAC;AACzC,QAAI,CAAC,aAAa,UAAU,SAAS,OAAQ;AAE7C,UAAM,QAAQ,UAAU,MAAM,MAAM,gBAAgB;AACpD,QAAI,CAAC,MAAO;AAEZ,UAAM,WAAW,MAAM,CAAC;AAExB,SAAK,UAAU,aAAa;AAC5B,SAAK,SAAS,CAAC;AACf,SAAK,KAAK,WAAW;AACrB,SAAK,KAAK,gBAAgB,CAAC;AAC3B,SAAK,KAAK,YAAY,eAAe;AAErC,cAAU,QAAQ,UAAU,MAAM,MAAM,MAAM,CAAC,EAAE,MAAM;AAEvD,QAAI,UAAU,MAAM,WAAW,GAAG;AAChC,iBAAW,SAAS,MAAM;AAAA,IAC5B,WACE,UAAU,YACV,OAAO,UAAU,SAAS,MAAM,WAAW,UAC3C;AACA,gBAAU,SAAS,MAAM,UAAU,MAAM,CAAC,EAAE;AAC5C,gBAAU,SAAS,MAAM,UAAU,MAAM,CAAC,EAAE;AAAA,IAC9C;AAAA,EACF,CAAC;AACH;;;ACnCO,IAAM,aAAa,WAAW,UAAU;AAcxC,IAAM,oBAAoB,WAAW,YAAY;AAuBjD,IAAM,aAAa,WAAW,qBAAqB;AAgCnD,IAAM,aAAa,WAAW,IAAI;AAoBlC,IAAM,gBAAgB,WAAW,YAAY;AAe7C,IAAM,mBAAmB,WAAW,gBAAgB;AAiBpD,SAAS,mBAAmB,MAAM;AACvC,SAAO,SAAS,QAAQ,OAAO;AACjC;AA8BO,SAAS,cAAc,MAAM;AAClC,SAAO,SAAS,MAAM,SAAS,MAAM,SAAS;AAChD;AAuBO,IAAM,qBAAqB,WAAW,cAAc;AAsBpD,IAAM,oBAAoB,WAAW,IAAI;AAUhD,SAAS,WAAW,OAAO;AACzB,SAAO;AAUP,WAAS,MAAM,MAAM;AACnB,WAAO,SAAS,QAAQ,OAAO,MAAM,MAAM,KAAK,OAAO,aAAa,IAAI,CAAC;AAAA,EAC3E;AACF;;;AC7MO,SAAS,aAAa,SAASE,KAAI,MAAM,KAAK;AACnD,QAAM,QAAQ,MAAM,MAAM,IAAI,OAAO;AACrC,MAAI,OAAO;AACX,SAAO;AAGP,WAAS,MAAM,MAAM;AACnB,QAAI,cAAc,IAAI,GAAG;AACvB,cAAQ,MAAM,IAAI;AAClB,aAAO,OAAO,IAAI;AAAA,IACpB;AACA,WAAOA,IAAG,IAAI;AAAA,EAChB;AAGA,WAAS,OAAO,MAAM;AACpB,QAAI,cAAc,IAAI,KAAK,SAAS,OAAO;AACzC,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AACA,YAAQ,KAAK,IAAI;AACjB,WAAOA,IAAG,IAAI;AAAA,EAChB;AACF;;;ACxDO,IAAM,WAAW;AAAA,EACtB,UAAU;AAAA,EACV,UAAU;AAAA,EACV,MAAM;AACR;AAGA,IAAMC,uBAAsB;AAAA,EAC1B,UAAUC;AAAA,EACV,SAAS;AACX;AAMA,SAAS,mBAAmB,SAASC,KAAI,KAAK;AAC5C,QAAM,OAAO;AACb,QAAM,OAAO,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AAC/C,QAAM,cAAc,QAAQ,KAAK,CAAC,EAAE,SAAS,eAAe,KAAK,CAAC,EAAE,eAAe,KAAK,CAAC,GAAG,IAAI,EAAE,SAAS;AAC3G,MAAI,WAAW;AACf,SAAO;AAcP,WAAS,MAAM,MAAM;AACnB,YAAQ,MAAM,UAAU;AACxB,YAAQ,MAAM,eAAe;AAC7B,YAAQ,MAAM,uBAAuB;AACrC,WAAO,aAAa,IAAI;AAAA,EAC1B;AAcA,WAAS,aAAa,MAAM;AAC1B,QAAI,SAAS,IAAI;AACf,cAAQ,QAAQ,IAAI;AACpB;AACA,aAAO;AAAA,IACT;AACA,QAAI,WAAW,GAAG;AAChB,aAAO,IAAI,IAAI;AAAA,IACjB;AACA,YAAQ,KAAK,uBAAuB;AACpC,WAAO,aAAa,SAAS,YAAY,YAAY,EAAE,IAAI;AAAA,EAC7D;AAeA,WAAS,WAAW,MAAM;AACxB,QAAI,SAAS,QAAQ,mBAAmB,IAAI,GAAG;AAC7C,aAAO,UAAU,IAAI;AAAA,IACvB;AACA,YAAQ,MAAM,mBAAmB;AACjC,YAAQ,MAAM,eAAe;AAAA,MAC3B,aAAa;AAAA,IACf,CAAC;AACD,WAAO,KAAK,IAAI;AAAA,EAClB;AAcA,WAAS,KAAK,MAAM;AAClB,QAAI,SAAS,QAAQ,mBAAmB,IAAI,GAAG;AAC7C,cAAQ,KAAK,aAAa;AAC1B,cAAQ,KAAK,mBAAmB;AAChC,aAAO,UAAU,IAAI;AAAA,IACvB;AACA,QAAI,SAAS,IAAI;AACf,aAAO,IAAI,IAAI;AAAA,IACjB;AACA,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAcA,WAAS,UAAU,MAAM;AAEvB,YAAQ,KAAK,eAAe;AAC5B,QAAI,KAAK,WAAW;AAClB,aAAOA,IAAG,IAAI;AAAA,IAChB;AACA,WAAO,QAAQ,QAAQF,sBAAqB,2BAA2B,KAAK,EAAE,IAAI;AAAA,EACpF;AAeA,WAAS,0BAA0B,MAAM;AACvC,WAAO,QAAQ,QAAQ;AAAA,MACrB,UAAU;AAAA,MACV,SAAS;AAAA,IACX,GAAG,OAAO,YAAY,EAAE,IAAI;AAAA,EAC9B;AAcA,WAAS,aAAa,MAAM;AAC1B,YAAQ,cAAc,aAAa,SAAS,oBAAoB,cAAc,cAAc,CAAC,IAAI,oBAAoB,IAAI;AAAA,EAC3H;AAcA,WAAS,mBAAmB,MAAM;AAChC,QAAI,SAAS,MAAM;AACjB,aAAO,MAAM,IAAI;AAAA,IACnB;AACA,QAAI,mBAAmB,IAAI,GAAG;AAC5B,aAAO,QAAQ,QAAQA,sBAAqB,2BAA2B,KAAK,EAAE,IAAI;AAAA,IACpF;AACA,YAAQ,MAAM,eAAe;AAC7B,WAAO,aAAa,IAAI;AAAA,EAC1B;AAcA,WAAS,aAAa,MAAM;AAC1B,QAAI,SAAS,QAAQ,mBAAmB,IAAI,GAAG;AAC7C,cAAQ,KAAK,eAAe;AAC5B,aAAO,mBAAmB,IAAI;AAAA,IAChC;AACA,YAAQ,QAAQ,IAAI;AACpB,WAAO;AAAA,EACT;AAcA,WAAS,MAAM,MAAM;AACnB,YAAQ,KAAK,UAAU;AACvB,WAAOE,IAAG,IAAI;AAAA,EAChB;AAGA,WAAS,qBAAqBC,UAASD,KAAIE,MAAK;AAC9C,QAAI,OAAO;AAWX,WAAO,aAAaD,UAAS,qBAAqB,cAAc,KAAK,OAAO,WAAW,QAAQ,KAAK,SAAS,cAAc,IAAI,SAAY,CAAC;AAc5I,aAAS,oBAAoB,MAAM;AACjC,MAAAA,SAAQ,MAAM,eAAe;AAC7B,MAAAA,SAAQ,MAAM,uBAAuB;AACrC,aAAO,cAAc,IAAI;AAAA,IAC3B;AAcA,aAAS,cAAc,MAAM;AAC3B,UAAI,SAAS,IAAI;AACf;AACA,QAAAA,SAAQ,QAAQ,IAAI;AACpB,eAAO;AAAA,MACT;AACA,UAAI,OAAO,UAAU;AACnB,eAAOC,KAAI,IAAI;AAAA,MACjB;AACA,MAAAD,SAAQ,KAAK,uBAAuB;AACpC,aAAO,aAAaA,UAAS,oBAAoB,YAAY,EAAE,IAAI;AAAA,IACrE;AAcA,aAAS,mBAAmB,MAAM;AAChC,UAAI,SAAS,QAAQ,mBAAmB,IAAI,GAAG;AAC7C,QAAAA,SAAQ,KAAK,eAAe;AAC5B,eAAOD,IAAG,IAAI;AAAA,MAChB;AACA,aAAOE,KAAI,IAAI;AAAA,IACjB;AAAA,EACF;AACF;AAMA,SAASH,6BAA4B,SAASC,KAAI,KAAK;AACrD,QAAM,OAAO;AACb,SAAO;AAGP,WAAS,MAAM,MAAM;AACnB,QAAI,SAAS,MAAM;AACjB,aAAOA,IAAG,IAAI;AAAA,IAChB;AACA,YAAQ,MAAM,YAAY;AAC1B,YAAQ,QAAQ,IAAI;AACpB,YAAQ,KAAK,YAAY;AACzB,WAAO;AAAA,EACT;AAGA,WAAS,UAAU,MAAM;AACvB,WAAO,KAAK,OAAO,KAAK,KAAK,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAIA,IAAG,IAAI;AAAA,EAChE;AACF;;;ACzUO,SAAS,SAAS,SAAS;AAChC,QAAM,WAAW,WAAW,CAAC;AAC7B,MAAI,SAAS,SAAS;AACtB,MAAI,WAAW,QAAQ,WAAW,QAAW;AAC3C,aAAS;AAAA,EACX;AACA,SAAO;AAAA,IACL,UAAU;AAAA,IACV,SAAS;AAAA,IACT;AAAA,IACA,MAAM;AAAA,EACR;AAMA,WAAS,iBAAiB,SAASG,KAAI,KAAK;AAC1C,UAAM,OAAO;AACb,QAAI,WAAW;AAEf,QAAI;AAEJ,QAAI;AACJ,WAAO;AAcP,aAAS,MAAM,MAAM;AACnB,cAAQ,MAAM,UAAU;AACxB,cAAQ,MAAM,kBAAkB;AAChC,aAAO,aAAa,IAAI;AAAA,IAC1B;AAaA,aAAS,aAAa,MAAM;AAC1B,UAAI,SAAS,IAAI;AACf,gBAAQ,QAAQ,IAAI;AACpB;AACA,eAAO;AAAA,MACT;AAGA,UAAI,WAAW,KAAK,CAAC,QAAQ;AAC3B,eAAO,IAAI,IAAI;AAAA,MACjB;AACA,cAAQ,KAAK,kBAAkB;AAC/B,aAAO,QAAQ,IAAI;AAAA,IACrB;AAYA,aAAS,QAAQ,MAAM;AACrB,UAAI,SAAS,MAAM;AACjB,eAAO,IAAI,IAAI;AAAA,MACjB;AACA,UAAI,SAAS,IAAI;AACf,gBAAQ,QAAQ,MAAM,kBAAkB;AACxC,eAAO;AACP,eAAO,cAAc,IAAI;AAAA,MAC3B;AAGA,UAAI,SAAS,IAAI;AACf,gBAAQ,MAAM,OAAO;AACrB,gBAAQ,QAAQ,IAAI;AACpB,gBAAQ,KAAK,OAAO;AACpB,eAAO;AAAA,MACT;AACA,UAAI,mBAAmB,IAAI,GAAG;AAC5B,gBAAQ,MAAM,YAAY;AAC1B,gBAAQ,QAAQ,IAAI;AACpB,gBAAQ,KAAK,YAAY;AACzB,eAAO;AAAA,MACT;AAGA,cAAQ,MAAM,cAAc;AAC5B,aAAO,KAAK,IAAI;AAAA,IAClB;AAYA,aAAS,KAAK,MAAM;AAClB,UAAI,SAAS,QAAQ,SAAS,MAAM,SAAS,MAAM,mBAAmB,IAAI,GAAG;AAC3E,gBAAQ,KAAK,cAAc;AAC3B,eAAO,QAAQ,IAAI;AAAA,MACrB;AACA,cAAQ,QAAQ,IAAI;AACpB,aAAO;AAAA,IACT;AAaA,aAAS,cAAc,MAAM;AAE3B,UAAI,SAAS,IAAI;AACf,gBAAQ,QAAQ,IAAI;AACpB;AACA,eAAO;AAAA,MACT;AAGA,UAAI,SAAS,UAAU;AACrB,gBAAQ,KAAK,kBAAkB;AAC/B,gBAAQ,KAAK,UAAU;AACvB,eAAOA,IAAG,IAAI;AAAA,MAChB;AAGA,YAAM,OAAO;AACb,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,EACF;AACF;AAGA,SAAS,gBAAgB,QAAQ;AAC/B,MAAI,gBAAgB,OAAO,SAAS;AACpC,MAAI,iBAAiB;AAErB,MAAI;AAEJ,MAAI;AAGJ,OAAK,OAAO,cAAc,EAAE,CAAC,EAAE,SAAS,gBAAgB,OAAO,cAAc,EAAE,CAAC,EAAE,SAAS,aAAa,OAAO,aAAa,EAAE,CAAC,EAAE,SAAS,gBAAgB,OAAO,aAAa,EAAE,CAAC,EAAE,SAAS,UAAU;AACpM,YAAQ;AAGR,WAAO,EAAE,QAAQ,eAAe;AAC9B,UAAI,OAAO,KAAK,EAAE,CAAC,EAAE,SAAS,gBAAgB;AAE5C,eAAO,aAAa,EAAE,CAAC,EAAE,OAAO;AAChC,eAAO,cAAc,EAAE,CAAC,EAAE,OAAO;AACjC,0BAAkB;AAClB,yBAAiB;AACjB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,UAAQ,iBAAiB;AACzB;AACA,SAAO,EAAE,SAAS,eAAe;AAC/B,QAAI,UAAU,QAAW;AACvB,UAAI,UAAU,iBAAiB,OAAO,KAAK,EAAE,CAAC,EAAE,SAAS,cAAc;AACrE,gBAAQ;AAAA,MACV;AAAA,IACF,WAAW,UAAU,iBAAiB,OAAO,KAAK,EAAE,CAAC,EAAE,SAAS,cAAc;AAC5E,aAAO,KAAK,EAAE,CAAC,EAAE,OAAO;AACxB,UAAI,UAAU,QAAQ,GAAG;AACvB,eAAO,KAAK,EAAE,CAAC,EAAE,MAAM,OAAO,QAAQ,CAAC,EAAE,CAAC,EAAE;AAC5C,eAAO,OAAO,QAAQ,GAAG,QAAQ,QAAQ,CAAC;AAC1C,yBAAiB,QAAQ,QAAQ;AACjC,gBAAQ,QAAQ;AAAA,MAClB;AACA,cAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,SAAS,MAAM;AAEtB,SAAO,SAAS,MAAM,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC,EAAE,CAAC,EAAE,SAAS;AACxE;;;ACtNO,SAAS,KAAK,SAAS;AAC5B,SAAO;AAAA,IACL,MAAM;AAAA,MACJ,CAAC,EAAE,GAAG;AAAA,IACR;AAAA,IACA,MAAM;AAAA,MACJ,CAAC,EAAE,GAAG,SAAS,OAAO;AAAA,IACxB;AAAA,EACF;AACF;;;ACpBO,SAASC,MAAK;AAAC;;;ACIf,SAAS,cAAc,OAAO,WAAW;AAC9C,QAAM,SAAS,OAAO,KAAK;AAC3B,MAAI,QAAQ,OAAO,QAAQ,SAAS;AACpC,MAAI,WAAW;AACf,MAAI,QAAQ;AACZ,MAAI,MAAM;AAEV,MAAI,OAAO,cAAc,UAAU;AACjC,UAAM,IAAI,UAAU,oBAAoB;AAAA,EAC1C;AAEA,SAAO,UAAU,IAAI;AACnB,QAAI,UAAU,UAAU;AACtB,UAAI,EAAE,QAAQ,KAAK;AACjB,cAAM;AAAA,MACR;AAAA,IACF,OAAO;AACL,cAAQ;AAAA,IACV;AAEA,eAAW,QAAQ,UAAU;AAC7B,YAAQ,OAAO,QAAQ,WAAW,QAAQ;AAAA,EAC5C;AAEA,SAAO;AACT;;;ACLO,SAAS,mBAAmB;AACjC,SAAO;AAAA,IACL,OAAO;AAAA,MACL,UAAU;AAAA,MACV,mBAAmB;AAAA,MACnB,UAAU;AAAA,IACZ;AAAA,IACA,MAAM;AAAA,MACJ,UAAU;AAAA,MACV,eAAe;AAAA,MACf,mBAAmB;AAAA,MACnB,eAAe;AAAA,MACf,UAAU;AAAA,MACV,cAAc;AAAA,IAChB;AAAA,EACF;AAMA,WAAS,cAAc,OAAO;AAE5B,UAAM,OAAO;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT,YAAY,EAAC,WAAW,CAAC,iBAAiB,cAAc,EAAC;AAAA,MACzD,UAAU,CAAC;AAAA,IACb;AACA,SAAK;AAAA,MACH;AAAA,QACE,MAAM;AAAA,QACN,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM,EAAC,OAAO,OAAO,WAAW,CAAC,IAAI,EAAC;AAAA,MACxC;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAMA,WAAS,oBAAoB;AAC3B,SAAK,OAAO;AAAA,EACd;AAMA,WAAS,mBAAmB;AAC1B,UAAM,OAAO,KAAK,OAAO;AACzB,UAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,IAAAC,IAAO,KAAK,SAAS,MAAM;AAC3B,SAAK,OAAO;AAAA,EACd;AAMA,WAAS,oBAAoB;AAE3B,QAAI,KAAK,KAAK,eAAgB;AAC9B,SAAK,OAAO;AACZ,SAAK,KAAK,iBAAiB;AAAA,EAC7B;AAMA,WAAS,aAAa,OAAO;AAC3B,UAAM,OAAO,KAAK,OAAO,EAAE,QAAQ,4BAA4B,EAAE;AACjE,UAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,IAAAA,IAAO,KAAK,SAAS,MAAM;AAC3B,SAAK,KAAK,KAAK;AACf,SAAK,QAAQ;AAEb,UAAM;AAAA;AAAA,MAAmC,KAAK,KAAK,UAAU,CAAC;AAAA;AAC9D,IAAAA,IAAO,KAAK,SAAS,SAAS;AAC9B,IAAAA,IAAO,KAAK,YAAY,MAAM;AAC9B,SAAK,SAAS,KAAK,EAAC,MAAM,QAAQ,OAAO,KAAI,CAAC;AAC9C,SAAK,KAAK,iBAAiB;AAAA,EAC7B;AAMA,WAAS,cAAc,OAAO;AAC5B,SAAK;AAAA,MACH;AAAA,QACE,MAAM;AAAA,QACN,OAAO;AAAA,QACP,MAAM;AAAA,UACJ,OAAO;AAAA,UACP,aAAa,EAAC,WAAW,CAAC,iBAAiB,aAAa,EAAC;AAAA,UACzD,WAAW,CAAC;AAAA,QACd;AAAA,MACF;AAAA,MACA;AAAA,IACF;AACA,SAAK,OAAO;AAAA,EACd;AAMA,WAAS,aAAa,OAAO;AAC3B,UAAM,OAAO,KAAK,OAAO;AACzB,UAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC;AAC7C,IAAAA,IAAO,KAAK,SAAS,YAAY;AACjC,SAAK,KAAK,KAAK;AACf,SAAK,QAAQ;AACb,UAAM;AAAA;AAAA;AAAA,MAEJ,KAAK,KAAK;AAAA;AAEZ,aAAS,KAAK,EAAC,MAAM,QAAQ,OAAO,KAAI,CAAC;AAAA,EAC3C;AAMA,WAAS,aAAa,OAAO;AAC3B,SAAK,OAAO,MAAM,KAAK,KAAK,MAAM,KAAK;AACvC,SAAK,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK;AAAA,EACxC;AACF;AAUO,SAAS,eAAe,SAAS;AACtC,MAAI,UAAU,WAAW,CAAC,GAAG;AAE7B,MAAI,WAAW,QAAQ,WAAW,QAAW;AAC3C,aAAS;AAAA,EACX;AAEA,aAAW,OAAO;AAElB,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,EAAC,WAAW,MAAM,aAAa,eAAc;AAAA,MAC7C,EAAC,WAAW,MAAM,aAAa,eAAc;AAAA,MAC7C;AAAA,QACE,WAAW;AAAA,QACX,OAAO,SAAS,SAAY;AAAA,QAC5B,aAAa;AAAA,MACf;AAAA,MACA,EAAC,WAAW,KAAK,aAAa,eAAc;AAAA,MAC5C,EAAC,SAAS,MAAM,WAAW,KAAK,OAAO,MAAK;AAAA,IAC9C;AAAA,IACA,UAAU,EAAC,MAAAC,OAAM,WAAU;AAAA,EAC7B;AAQA,WAASA,MAAK,MAAM,GAAG,OAAO,MAAM;AAClC,UAAM,MAAM,KAAK,SAAS;AAC1B,UAAM,UAAU,MAAM,cAAc,IAAI;AACxC,UAAM,WAAW,IAAI,OAAO,KAAK,IAAI,cAAc,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;AACpE,UAAM,OAAO,MAAM,MAAM,UAAU;AACnC,QAAI,QAAQ,QAAQ,KAAK,QAAQ;AAEjC,QAAI,KAAK,MAAM;AACb,YAAM,UAAU,MAAM,MAAM,cAAc;AAC1C,eAAS,QAAQ;AAAA,QACf,MAAM,KAAK,KAAK,MAAM;AAAA,UACpB,OAAO;AAAA,UACP,QAAQ;AAAA,UACR,QAAQ,CAAC,GAAG;AAAA,UACZ,GAAG,QAAQ,QAAQ;AAAA,QACrB,CAAC;AAAA,MACH;AACA,cAAQ;AAAA,IACV;AAEA,aAAS,QAAQ,KAAK,IAAI;AAE1B,QAAI,KAAK;AACP,eAAS,QAAQ,KAAK,MAAM,IAAI;AAAA,IAClC;AAEA,aAAS,QAAQ,KAAK,QAAQ;AAC9B,SAAK;AACL,WAAO;AAAA,EACT;AAQA,WAAS,WAAW,MAAM,GAAG,OAAO;AAClC,QAAI,QAAQ,KAAK,SAAS;AAC1B,QAAI,OAAO;AAEX,QAAI,CAAC,OAAQ;AAKb,WACE,IAAI,OAAO,aAAa,MAAM,OAAO,IAAI,IAAI,UAAU,EAAE,KAAK,KAAK,GACnE;AACA;AAAA,IACF;AAEA,UAAM,WAAW,IAAI,OAAO,IAAI;AAKhC;AAAA;AAAA,MAEE,WAAW,KAAK,KAAK;AAAA,OAEnB,WAAW,KAAK,KAAK,KAAK,WAAW,KAAK,KAAK;AAAA,MAE/C,UAAU,KAAK,KAAK;AAAA,MACtB;AACA,cAAQ,MAAM,QAAQ;AAAA,IACxB;AAEA,QAAI,QAAQ;AASZ,WAAO,EAAE,QAAQ,MAAM,OAAO,QAAQ;AACpC,YAAM,UAAU,MAAM,OAAO,KAAK;AAKlC,UAAI,CAAC,QAAQ,QAAS;AAEtB,YAAM,aAAa,MAAM,eAAe,OAAO;AAE/C,UAAI;AAEJ,aAAQ,QAAQ,WAAW,KAAK,KAAK,GAAI;AACvC,YAAI,WAAW,MAAM;AAGrB,YACE,MAAM,YAAY,QAAQ,MAAM,MAChC,MAAM,YAAY,WAAW,CAAC,MAAM,IACpC;AACA;AAAA,QACF;AAEA,gBAAQ,MAAM,MAAM,GAAG,QAAQ,IAAI,MAAM,MAAM,MAAM,MAAM,QAAQ,CAAC;AAAA,MACtE;AAAA,IACF;AAEA,WAAO,WAAW,QAAQ;AAAA,EAC5B;AAKA,WAAS,iBAAiB;AACxB,WAAO;AAAA,EACT;AACF;;;ACxRA,IAAM,iBAAkD;AAAA,EACtD,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,MAAM;AAAA,EACN,iBAAiB;AAAA,EACjB,MAAM;AACR;AAEe,SAAR,eACL,UAC+C;AAC/C,QAAM,OAAO,EAAE,GAAG,gBAAgB,GAAG,SAAS;AAE9C,QAAM,OAAQ,KAAyB,KAAK;AAE5C,OAAK,wBAAwB,CAAC;AAC9B,OAAK,2BAA2B,CAAC;AACjC,OAAK,yBAAyB,CAAC;AAE/B,MAAI,KAAK,WAAW;AAClB,SAAK,oBAAoB,KAAK,eAAe,CAAC;AAC9C,SAAK,uBAAuB,KAAK,qBAAqB,CAAC;AACvD,SAAK,qBAAqB,KAAK,mBAAmB,CAAC;AAAA,EACrD;AACA,MAAI,KAAK,UAAU;AACjB,SAAK,oBAAoB,KAAK,cAAc,CAAC;AAC7C,SAAK,uBAAuB,KAAK,oBAAoB,CAAC;AACtD,SAAK,qBAAqB,KAAK,kBAAkB,CAAC;AAAA,EACpD;AACA,MAAI,KAAK,MAAM;AACb,SAAK,oBAAoB,KAAK,UAAU,CAAC;AACzC,SAAK,uBAAuB,KAAK,gBAAgB,CAAC;AAClD,SAAK,qBAAqB,KAAK,cAAc,CAAC;AAAA,EAChD;AACA,MAAI,KAAK,YAAY;AACnB,SAAK,oBAAoB,KAAK,gBAAgB,CAAC;AAC/C,SAAK,uBAAuB,KAAK,sBAAsB,CAAC;AACxD,SAAK,qBAAqB,KAAK,oBAAoB,CAAC;AAAA,EACtD;AACA,MAAI,KAAK,MAAM;AACb,SAAK,oBAAoB,KAAK,KAAW,CAAC;AAC1C,SAAK,uBAAuB,KAAK,iBAAiB,CAAC;AACnD,SAAK,qBAAqB,KAAK,eAAe,CAAC;AAAA,EACjD;AAEA,QAAM,iBAAiB,KAAK,YAAY,KAAK;AAC7C,MAAI,CAAC,eAAgB,QAAO;AAE5B,SAAO,CAAC,MAAY,SAAc;AAChC,QAAI,KAAK,UAAU;AACjB;AAAA,QACE;AAAA,QACA;AAAA,QACA,CAAC,OAAgB,OAA2B,WAAgB;AAC1D,cAAI,UAAU,OAAO,UAAU,UAAU;AACvC,mBAAO,SAAS,OAAO,OAAO,CAAC;AAC/B,mBAAO;AAAA,UACT;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,QAAI,KAAK,iBAAiB;AACxB,8BAAwB,MAAM,OAAO,IAAI,CAAC;AAAA,IAC5C;AAAA,EACF;AACF;","names":["index","is","visit","ok","isLineEnding","tokenize","ok","isLineEnding","ok","HASH","tokenize","ok","previous","ok","nonLazyContinuation","tokenizeNonLazyContinuation","ok","effects","nok","ok","ok","ok","math"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@quartz-community/remark-obsidian",
-  "version": "0.2.1",
+  "version": "0.2.3",
   "description": "Remark plugin for Obsidian-flavored markdown syntax (wikilinks, highlights, comments, tags, arrows).",
   "type": "module",
   "license": "MIT",