ember-repl 7.1.0 → 7.1.1

package/declarations/services/known-modules.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"known-modules.d.ts","sourceRoot":"","sources":["../../src/services/known-modules.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAwHrD;;;GAGG;AACH,eAAO,MAAM,OAAO,GAAI,cAAc,SAAS,KAAG,SAMhD,CAAC"}
+{"version":3,"file":"known-modules.d.ts","sourceRoot":"","sources":["../../src/services/known-modules.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAyHrD;;;GAGG;AACH,eAAO,MAAM,OAAO,GAAI,cAAc,SAAS,KAAG,SAMhD,CAAC"}

package/dist/services/compiler.js

@@ -14,7 +14,410 @@ import { Compiler } from 'repl-sdk';
 import { nameFor } from '../compile/utils.js';
 import { modules } from './known-modules.js';
 import { g, i, n } from 'decorator-transforms/runtime-esm';
-import { v as visit } from '../index-Bo3xsMqx.js';
+
+/**
+ * @import {Node, Parent} from 'unist'
+ */
+
+
+/**
+ * Generate an assertion from a test.
+ *
+ * Useful if you’re going to test many nodes, for example when creating a
+ * utility where something else passes a compatible test.
+ *
+ * The created function is a bit faster because it expects valid input only:
+ * a `node`, `index`, and `parent`.
+ *
+ * @param {Test} test
+ *   *   when nullish, checks if `node` is a `Node`.
+ *   *   when `string`, works like passing `(node) => node.type === test`.
+ *   *   when `function` checks if function passed the node is true.
+ *   *   when `object`, checks that all keys in test are in node, and that they have (strictly) equal values.
+ *   *   when `array`, checks if any one of the subtests pass.
+ * @returns {Check}
+ *   An assertion.
+ */
+const convert =
+// Note: overloads in JSDoc can’t yet use different `@template`s.
+/**
+ * @type {(
+ *   (<Condition extends string>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & {type: Condition}) &
+ *   (<Condition extends Props>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Condition) &
+ *   (<Condition extends TestFunction>(test: Condition) => (node: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node & Predicate<Condition, Node>) &
+ *   ((test?: null | undefined) => (node?: unknown, index?: number | null | undefined, parent?: Parent | null | undefined, context?: unknown) => node is Node) &
+ *   ((test?: Test) => Check)
+ * )}
+ */
+
+/**
+ * @param {Test} [test]
+ * @returns {Check}
+ */
+function (test) {
+  if (test === null || test === undefined) {
+    return ok;
+  }
+  if (typeof test === 'function') {
+    return castFactory(test);
+  }
+  if (typeof test === 'object') {
+    return Array.isArray(test) ? anyFactory(test) :
+    // Cast because `ReadonlyArray` goes into the above but `isArray`
+    // narrows to `Array`.
+    propertiesFactory(/** @type {Props} */test);
+  }
+  if (typeof test === 'string') {
+    return typeFactory(test);
+  }
+  throw new Error('Expected function, string, or object as test');
+};
+
+/**
+ * @param {Array<Props | TestFunction | string>} tests
+ * @returns {Check}
+ */
+function anyFactory(tests) {
+  /** @type {Array<Check>} */
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert(tests[index]);
+  }
+  return castFactory(any);
+
+  /**
+   * @this {unknown}
+   * @type {TestFunction}
+   */
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].apply(this, parameters)) return true;
+    }
+    return false;
+  }
+}
+
+/**
+ * Turn an object into a test for a node with a certain fields.
+ *
+ * @param {Props} check
+ * @returns {Check}
+ */
+function propertiesFactory(check) {
+  const checkAsRecord = /** @type {Record<string, unknown>} */check;
+  return castFactory(all);
+
+  /**
+   * @param {Node} node
+   * @returns {boolean}
+   */
+  function all(node) {
+    const nodeAsRecord = /** @type {Record<string, unknown>} */
+    /** @type {unknown} */node;
+
+    /** @type {string} */
+    let key;
+    for (key in check) {
+      if (nodeAsRecord[key] !== checkAsRecord[key]) return false;
+    }
+    return true;
+  }
+}
+
+/**
+ * Turn a string into a test for a node with a certain type.
+ *
+ * @param {string} check
+ * @returns {Check}
+ */
+function typeFactory(check) {
+  return castFactory(type);
+
+  /**
+   * @param {Node} node
+   */
+  function type(node) {
+    return node && node.type === check;
+  }
+}
+
+/**
+ * Turn a custom test into a test for a node that passes that test.
+ *
+ * @param {TestFunction} testFunction
+ * @returns {Check}
+ */
+function castFactory(testFunction) {
+  return check;
+
+  /**
+   * @this {unknown}
+   * @type {Check}
+   */
+  function check(value, index, parent) {
+    return Boolean(looksLikeANode(value) && testFunction.call(this, value, typeof index === 'number' ? index : undefined, parent || undefined));
+  }
+}
+function ok() {
+  return true;
+}
+
+/**
+ * @param {unknown} value
+ * @returns {value is Node}
+ */
+function looksLikeANode(value) {
+  return value !== null && typeof value === 'object' && 'type' in value;
+}
+
+/**
+ * @param {string} d
+ * @returns {string}
+ */
+function color(d) {
+  return d;
+}
+
+/**
+ * @import {Node as UnistNode, Parent as UnistParent} from 'unist'
+ */
+
+
+/** @type {Readonly<ActionTuple>} */
+const empty = [];
+
+/**
+ * Continue traversing as normal.
+ */
+const CONTINUE = true;
+
+/**
+ * Stop traversing immediately.
+ */
+const EXIT = false;
+
+/**
+ * Do not traverse this node’s children.
+ */
+const SKIP = 'skip';
+
+/**
+ * Visit nodes, with ancestral information.
+ *
+ * This algorithm performs *depth-first* *tree traversal* in *preorder*
+ * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).
+ *
+ * You can choose for which nodes `visitor` is called by passing a `test`.
+ * For complex tests, you should test yourself in `visitor`, as it will be
+ * faster and will have improved type information.
+ *
+ * Walking the tree is an intensive task.
+ * Make use of the return values of the visitor when possible.
+ * Instead of walking a tree multiple times, walk it once, use `unist-util-is`
+ * to check if a node matches, and then perform different operations.
+ *
+ * You can change the tree.
+ * See `Visitor` for more info.
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {Check} check
+ * @param {BuildVisitor<Tree, Check>} visitor
+ * @param {boolean | null | undefined} [reverse]
+ * @returns {undefined}
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {BuildVisitor<Tree>} visitor
+ * @param {boolean | null | undefined} [reverse]
+ * @returns {undefined}
+ *
+ * @param {UnistNode} tree
+ *   Tree to traverse.
+ * @param {Visitor | Test} test
+ *   `unist-util-is`-compatible test
+ * @param {Visitor | boolean | null | undefined} [visitor]
+ *   Handle each node.
+ * @param {boolean | null | undefined} [reverse]
+ *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).
+ * @returns {undefined}
+ *   Nothing.
+ *
+ * @template {UnistNode} Tree
+ *   Node type.
+ * @template {Test} Check
+ *   `unist-util-is`-compatible test.
+ */
+function visitParents(tree, test, visitor, reverse) {
+  /** @type {Test} */
+  let check;
+  if (typeof test === 'function' && typeof visitor !== 'function') {
+    reverse = visitor;
+    // @ts-expect-error no visitor given, so `visitor` is test.
+    visitor = test;
+  } else {
+    // @ts-expect-error visitor given, so `test` isn’t a visitor.
+    check = test;
+  }
+  const is = convert(check);
+  const step = reverse ? -1 : 1;
+  factory(tree, undefined, [])();
+
+  /**
+   * @param {UnistNode} node
+   * @param {number | undefined} index
+   * @param {Array<UnistParent>} parents
+   */
+  function factory(node, index, parents) {
+    const value = /** @type {Record<string, unknown>} */
+    node && typeof node === 'object' ? node : {};
+    if (typeof value.type === 'string') {
+      const name =
+      // `hast`
+      typeof value.tagName === 'string' ? value.tagName :
+      // `xast`
+      typeof value.name === 'string' ? value.name : undefined;
+      Object.defineProperty(visit, 'name', {
+        value: 'node (' + color(node.type + (name ? '<' + name + '>' : '')) + ')'
+      });
+    }
+    return visit;
+    function visit() {
+      /** @type {Readonly<ActionTuple>} */
+      let result = empty;
+      /** @type {Readonly<ActionTuple>} */
+      let subresult;
+      /** @type {number} */
+      let offset;
+      /** @type {Array<UnistParent>} */
+      let grandparents;
+      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {
+        // @ts-expect-error: `visitor` is now a visitor.
+        result = toResult(visitor(node, parents));
+        if (result[0] === EXIT) {
+          return result;
+        }
+      }
+      if ('children' in node && node.children) {
+        const nodeAsParent = /** @type {UnistParent} */node;
+        if (nodeAsParent.children && result[0] !== SKIP) {
+          offset = (reverse ? nodeAsParent.children.length : -1) + step;
+          grandparents = parents.concat(nodeAsParent);
+          while (offset > -1 && offset < nodeAsParent.children.length) {
+            const child = nodeAsParent.children[offset];
+            subresult = factory(child, offset, grandparents)();
+            if (subresult[0] === EXIT) {
+              return subresult;
+            }
+            offset = typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+          }
+        }
+      }
+      return result;
+    }
+  }
+}
+
+/**
+ * Turn a return value into a clean result.
+ *
+ * @param {VisitorResult} value
+ *   Valid return values from visitors.
+ * @returns {Readonly<ActionTuple>}
+ *   Clean result.
+ */
+function toResult(value) {
+  if (Array.isArray(value)) {
+    return value;
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE, value];
+  }
+  return value === null || value === undefined ? empty : [value];
+}
+
+/**
+ * @typedef {import('unist').Node} UnistNode
+ * @typedef {import('unist').Parent} UnistParent
+ * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult
+ */
+
+
+/**
+ * Visit nodes.
+ *
+ * This algorithm performs *depth-first* *tree traversal* in *preorder*
+ * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).
+ *
+ * You can choose for which nodes `visitor` is called by passing a `test`.
+ * For complex tests, you should test yourself in `visitor`, as it will be
+ * faster and will have improved type information.
+ *
+ * Walking the tree is an intensive task.
+ * Make use of the return values of the visitor when possible.
+ * Instead of walking a tree multiple times, walk it once, use `unist-util-is`
+ * to check if a node matches, and then perform different operations.
+ *
+ * You can change the tree.
+ * See `Visitor` for more info.
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {Check} check
+ * @param {BuildVisitor<Tree, Check>} visitor
+ * @param {boolean | null | undefined} [reverse]
+ * @returns {undefined}
+ *
+ * @overload
+ * @param {Tree} tree
+ * @param {BuildVisitor<Tree>} visitor
+ * @param {boolean | null | undefined} [reverse]
+ * @returns {undefined}
+ *
+ * @param {UnistNode} tree
+ *   Tree to traverse.
+ * @param {Visitor | Test} testOrVisitor
+ *   `unist-util-is`-compatible test (optional, omit to pass a visitor).
+ * @param {Visitor | boolean | null | undefined} [visitorOrReverse]
+ *   Handle each node (when test is omitted, pass `reverse`).
+ * @param {boolean | null | undefined} [maybeReverse=false]
+ *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).
+ * @returns {undefined}
+ *   Nothing.
+ *
+ * @template {UnistNode} Tree
+ *   Node type.
+ * @template {Test} Check
+ *   `unist-util-is`-compatible test.
+ */
+function visit(tree, testOrVisitor, visitorOrReverse, maybeReverse) {
+  /** @type {boolean | null | undefined} */
+  let reverse;
+  /** @type {Test} */
+  let test;
+  /** @type {Visitor} */
+  let visitor;
+  {
+    // @ts-expect-error: assume the overload with test was given.
+    test = testOrVisitor;
+    // @ts-expect-error: assume the overload with test was given.
+    visitor = visitorOrReverse;
+    reverse = maybeReverse;
+  }
+  visitParents(tree, test, overload, reverse);
+
+  /**
+   * @param {UnistNode} node
+   * @param {Array<UnistParent>} parents
+   */
+  function overload(node, parents) {
+    const parent = parents[parents.length - 1];
+    const index = parent ? parent.children.indexOf(node) : undefined;
+    return visitor(node, index, parent);
+  }
+}
 
 /* eslint-disable getter-return */
 

package/dist/services/compiler.js.map

@@ -1 +1 @@
-{"version":3,"file":"compiler.js","sources":["../../src/services/compiler.ts"],"sourcesContent":["/* eslint-disable getter-return */\n \n// @ts-ignore\nimport { tracked } from '@glimmer/tracking';\nimport { setComponentTemplate } from '@ember/component';\nimport templateOnly from '@ember/component/template-only';\nimport { assert } from '@ember/debug';\nimport { registerDestructor } from '@ember/destroyable';\nimport { array, concat, fn, get, hash } from '@ember/helper';\nimport { on } from '@ember/modifier';\nimport { getOwner } from '@ember/owner';\nimport { precompileTemplate } from '@ember/template-compilation';\nimport { waitFor } from '@ember/test-waiters';\n\nimport { createStore } from 'ember-primitives/store';\nimport { resource } from 'ember-resources';\nimport { Compiler } from 'repl-sdk';\nimport { visit } from 'unist-util-visit';\n\nimport { nameFor } from '../compile/utils.ts';\nimport { modules } from './known-modules.ts';\n\nimport type { CompileResult, ModuleMap } from '../compile/types.ts';\nimport type { ComponentLike } from '@glint/template';\nimport type { EditorView } from 'codemirror';\nimport type { ErrorMessage, InfoMessage, Message } from 'repl-sdk';\n\nexport function getCompiler(context: object) {\n  const owner = getOwner(context) ?? context;\n\n  assert(`Missing owner. Cannot use ember-repl's compiler without an owner.`, owner);\n\n  return createStore(owner, CompilerService);\n}\n\n/**\n * Old way to make static components, because\n * https://github.com/emberjs/ember.js/issues/20913\n *\n * The runtime compiler doesn't allow you to catch compiler errors.\n * This particular component doesn't need to be runtime anyway.\n */\nfunction rendersElement(x: { element: Element; destroy: () => void }): ComponentLike {\n  const render = resource(({ on }) => {\n    on.cleanup(() => {\n      x.destroy();\n    });\n\n    return x.element;\n  });\n\n  return setComponentTemplate(\n    precompileTemplate(`{{render}}`, {\n      strictMode: true,\n      scope: () => ({ render }),\n    }),\n    templateOnly()\n  ) as ComponentLike;\n}\n\ninterface CompilerOptions {\n  hbs?: {\n    scope?: Record<string, unknown>;\n  };\n  md?: {\n    remarkPlugins?: unknown[];\n    rehypePlugins?: unknown[];\n  };\n  gmd?: {\n    scope?: Record<string, unknown>;\n    remarkPlugins?: unknown[];\n    rehypePlugins?: unknown[];\n  };\n}\n\n/**\n * Standard for the REPL, not real apps.\n * HBS isn't used in real apps (that are fully up to date)\n */\nconst standardScope = {\n  // These are only added here because it's convenient for hbs\n  // to have them\n  array,\n  concat,\n  fn,\n  get,\n  hash,\n  on,\n  // The default available scope for gjs:\n  //\n  // We don't use gjs transpilation here, because hbs transpilation\n  // doesn't need to go through the babel infra, so it's faster this way,\n  // even though it's more \"verbose\" and could get out of sync from the\n  // implementations / source-of-truth.\n  //\n  // https://github.com/emberjs/babel-plugin-ember-template-compilation/blob/main/src/scope-locals.ts#L16\n  //\n  // ////////////////\n  // namespaces\n  // ////////////////\n  //   TC39\n  globalThis,\n  Atomics,\n  JSON,\n  Math,\n  Reflect,\n  //   WHATWG\n  localStorage,\n  sessionStorage,\n  URL,\n  // ////////////////\n  // functions / utilities\n  // ////////////////\n  //   TC39\n  isNaN,\n  isFinite,\n  parseInt,\n  parseFloat,\n  decodeURI,\n  decodeURIComponent,\n  encodeURI,\n  encodeURIComponent,\n  //   WHATWG\n  postMessage,\n  structuredClone,\n  // ////////////////\n  // new-less Constructors (still functions)\n  // ////////////////\n  //   TC39\n  Array, // different behavior from (array)\n  BigInt,\n  Boolean,\n  Date,\n  Number,\n  Object, // different behavior from (hash)\n  String,\n  // ////////////////\n  // Values\n  // ////////////////\n  //   TC39\n  Infinity,\n  NaN,\n  //   WHATWG\n  isSecureContext,\n};\n\nexport default class CompilerService {\n  #compiler: Compiler | undefined;\n\n  constructor() {\n    const global = getGlobal();\n\n    global.REPL ||= {};\n\n    if (global.REPL.compiler) {\n      return global.REPL.compiler;\n    }\n\n    global.REPL.compiler = this;\n\n    registerDestructor(this, () => {\n      delete global.REPL?.compiler;\n    });\n  }\n\n  @tracked messages: Message[] = [];\n\n  get lastInfo(): InfoMessage | undefined {\n    const m = this.messages;\n\n    for (let i = m.length - 1; i >= 0; i--) {\n      const current = m[i];\n\n      if (current?.type === 'info') return current;\n    }\n  }\n\n  get lastError(): ErrorMessage | undefined {\n    const m = this.messages;\n\n    for (let i = m.length - 1; i >= 0; i--) {\n      const current = m[i];\n\n      if (current?.type === 'error') return current;\n    }\n  }\n\n  /**\n   * @param {ModuleMap} [ extraModules ]: map of import paths to modules.\n   *  These modules are useful if you need to document a library or a any design system or a styleguide or\n   *  if there are additional modules that could be imported in the passed `code`.\n   * @param {object} [options] optional compiler options for each format/flavor\n   *\n   *  Later on, imports that are not present by default (ember/glimmer) or that\n   *  are not provided by extraModules will be searched on npm to see if a package\n   *  needs to be downloaded before running the `code` / invoking the component\n   */\n  setup = (extraModules: ModuleMap = {}, options: CompilerOptions = {}) => {\n    const localModules = modules(extraModules);\n\n    this.#compiler = new Compiler({\n      logging: location.search.includes('debug'),\n      resolve: {\n        ...localModules,\n      },\n      on: {\n        log: (type: Message['type'], message: string) => {\n          this.messages.push({ type, message });\n          // Waiting on better array primitive\n          // eslint-disable-next-line no-self-assign\n          this.messages = this.messages;\n        },\n      },\n      options: {\n        ...options,\n        gjs: {\n          // owner: getOwner(this),\n          owner: {\n            lookup: () => {},\n            resolveRegistration: () => {},\n          },\n        },\n        gmd: {\n          ...(options.gmd ?? {}),\n          scope: {\n            ...standardScope,\n            ...(options.gmd?.scope ?? {}),\n          },\n          remarkPlugins: [\n            function defaultHbsToEmber() {\n              return function transformer(tree: any) {\n                visit(tree, 'code', (node) => {\n                  if (node.lang === 'hbs') {\n                    if (!node.meta) {\n                      node.meta = 'ember';\n                    } else {\n                      node.meta += ' ember';\n                    }\n\n                    return node;\n                  }\n                });\n\n                return tree;\n              };\n            },\n            ...(options.gmd?.remarkPlugins ?? []),\n          ],\n        },\n        hbs: {\n          ember: {\n            ...(options.hbs ?? {}),\n            scope: {\n              ...standardScope,\n              ...(options.hbs?.scope ?? {}),\n            },\n          },\n        },\n      },\n    });\n  };\n\n  get compiler(): Compiler {\n    /**\n     * This is useful for our own testing.\n     * not sure if this would be a footgun for consumers' usage\n     */\n    if (!this.#compiler) {\n      this.setup();\n    }\n\n    assert(\n      `Expected a compiled to be setup on the compiler service. Use \\`compiler.setup()\\` first.`,\n      this.#compiler\n    );\n\n    return this.#compiler;\n  }\n\n  async createEditor(\n    element: HTMLElement,\n    options: {\n      text: string | null | undefined;\n      format: string;\n      handleUpdate: (text: string) => void;\n      extensions?: unknown[];\n    }\n  ): Promise<{\n    view: EditorView;\n    setText: (text: string, format: string) => Promise<void>;\n    setFormat: (format: string) => Promise<void>;\n  }> {\n    return this.compiler.createEditor(element, options);\n  }\n\n  async #compile(ext: string, text: string, options?: Record<string, unknown>) {\n    /**\n     * Protect from accidental backtracking-render assertions\n     * (infinite loop protection)\n     *\n     * This function doesn't ready any tracked data, so we don't need to\n     * worry about invalidation or anything.\n     */\n    await Promise.resolve();\n\n    this.messages = [];\n\n    return this.compiler.compile(ext, text, options ?? {});\n  }\n\n  /**\n   * @public\n   *\n   * Defers to the underlying repl-SDK and gives us a component we can render.\n   *\n   * @param {string} ext the ext/format to be compiled\n   * @param {string} text the code to be compiled using the configured compiler for the ext\n   */\n  @waitFor\n  async compile(ext: string, text: string, options?: Record<string, unknown>) {\n    const name = nameFor(text);\n    let component: undefined | ComponentLike;\n    let error: undefined | Error;\n\n    try {\n      if (ext === 'hbs') {\n        /**\n         * Are there other hbs-using frameworks?\n         */\n        options ||= {};\n        options.flavor = 'ember';\n      }\n\n      const result = await this.#compile(ext, text, options);\n\n      component = rendersElement(result);\n    } catch (e) {\n      // Put a breakpoint here to debug\n      // debugger;\n      console.error(e);\n      error = e as Error | undefined;\n    }\n\n    return { name, component, error };\n  }\n\n  /**\n   * @public\n   *\n   * Transpiles GlimmerJS (*.gjs) formatted text into and evaluates as a JS Module.\n   * The returned component can be invoked explicitly in the consuming project.\n   *\n   * @param {string} code the code to be compiled\n   */\n  compileGJS(code: string): Promise<CompileResult> {\n    return this.compile('gjs', code);\n  }\n\n  /**\n   * compile a template with an empty scope\n   * to use components, helpers, etc, you will need to compile with JS\n   *\n   * (templates alone do not have a way to import / define complex structures)\n   */\n  @waitFor\n  async compileHBS(\n    source: string,\n    options: {\n      /**\n       * Used for debug viewing\n       */\n      moduleName?: string;\n      /**\n       * Additional values to include in hbs scope.\n       * This is a _strict mode_ hbs component.\n       */\n      scope?: Record<string, unknown>;\n    } = {}\n  ): Promise<CompileResult> {\n    return this.compile('hbs', source, options);\n  }\n\n  @waitFor\n  compileMD(\n    source: string,\n    options?: {\n      remarkPlugins?: unknown[];\n      rehypePlugins?: unknown[];\n    }\n  ): Promise<CompileResult> {\n    return this.compile('md', source, options);\n  }\n}\n\nfunction getGlobal() {\n  return globalThis as {\n    REPL?: {\n      compiler?: CompilerService;\n    };\n  };\n}\n"],"names":["getCompiler","context","owner","getOwner","assert","createStore","CompilerService","rendersElement","x","render","resource","on","cleanup","destroy","element","setComponentTemplate","precompileTemplate","strictMode","scope","templateOnly","standardScope","array","concat","fn","get","hash","globalThis","Atomics","JSON","Math","Reflect","localStorage","sessionStorage","URL","isNaN","isFinite","parseInt","parseFloat","decodeURI","decodeURIComponent","encodeURI","encodeURIComponent","postMessage","structuredClone","Array","BigInt","Boolean","Date","Number","Object","String","Infinity","NaN","isSecureContext","constructor","global","getGlobal","REPL","compiler","registerDestructor","g","prototype","tracked","i","lastInfo","m","messages","length","current","type","lastError","setup","extraModules","options","localModules","modules","Compiler","logging","location","search","includes","resolve","log","message","push","gjs","lookup","resolveRegistration","gmd","remarkPlugins","defaultHbsToEmber","transformer","tree","visit","node","lang","meta","hbs","ember","createEditor","#compile","ext","text","Promise","compile","name","nameFor","component","error","flavor","result","e","console","n","waitFor","compileGJS","code","compileHBS","source","compileMD"],"mappings":";;;;;;;;;;;;;;;;;;AAAA;;AA2BO,SAASA,WAAWA,CAACC,OAAe,EAAE;AAC3C,EAAA,MAAMC,KAAK,GAAGC,QAAQ,CAACF,OAAO,CAAC,IAAIA,OAAO;AAE1CG,EAAAA,MAAM,CAAC,CAAA,iEAAA,CAAmE,EAAEF,KAAK,CAAC;AAElF,EAAA,OAAOG,WAAW,CAACH,KAAK,EAAEI,eAAe,CAAC;AAC5C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,cAAcA,CAACC,CAA4C,EAAiB;AACnF,EAAA,MAAMC,MAAM,GAAGC,QAAQ,CAAC,CAAC;AAAEC,IAAAA;AAAG,GAAC,KAAK;IAClCA,EAAE,CAACC,OAAO,CAAC,MAAM;MACfJ,CAAC,CAACK,OAAO,EAAE;AACb,IAAA,CAAC,CAAC;IAEF,OAAOL,CAAC,CAACM,OAAO;AAClB,EAAA,CAAC,CAAC;AAEF,EAAA,OAAOC,oBAAoB,CACzBC,kBAAkB,CAAC,YAAY,EAAE;AAC/BC,IAAAA,UAAU,EAAE,IAAI;IAChBC,KAAK,EAAEA,OAAO;AAAET,MAAAA;KAAQ;AAC1B,GAAC,CAAC,EACFU,YAAY,EACd,CAAC;AACH;AAiBA;AACA;AACA;AACA;AACA,MAAMC,aAAa,GAAG;AACpB;AACA;EACAC,KAAK;EACLC,MAAM;EACNC,EAAE;EACFC,GAAG;EACHC,IAAI;EACJd,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACAe,UAAU;EACVC,OAAO;EACPC,IAAI;EACJC,IAAI;EACJC,OAAO;AACP;EACAC,YAAY;EACZC,cAAc;EACdC,GAAG;AACH;AACA;AACA;AACA;EACAC,KAAK;EACLC,QAAQ;EACRC,QAAQ;EACRC,UAAU;EACVC,SAAS;EACTC,kBAAkB;EAClBC,SAAS;EACTC,kBAAkB;AAClB;EACAC,WAAW;EACXC,eAAe;AACf;AACA;AACA;AACA;EACAC,KAAK;AAAE;EACPC,MAAM;EACNC,OAAO;EACPC,IAAI;EACJC,MAAM;EACNC,MAAM;AAAE;EACRC,MAAM;AACN;AACA;AACA;AACA;EACAC,QAAQ;EACRC,GAAG;AACH;AACAC,EAAAA;AACF,CAAC;AAEc,MAAM/C,eAAe,CAAC;AACnC,EAAA,SAAS;AAETgD,EAAAA,WAAWA,GAAG;AACZ,IAAA,MAAMC,MAAM,GAAGC,SAAS,EAAE;AAE1BD,IAAAA,MAAM,CAACE,IAAI,KAAK,EAAE;AAElB,IAAA,IAAIF,MAAM,CAACE,IAAI,CAACC,QAAQ,EAAE;AACxB,MAAA,OAAOH,MAAM,CAACE,IAAI,CAACC,QAAQ;AAC7B,IAAA;AAEAH,IAAAA,MAAM,CAACE,IAAI,CAACC,QAAQ,GAAG,IAAI;IAE3BC,kBAAkB,CAAC,IAAI,EAAE,MAAM;AAC7B,MAAA,OAAOJ,MAAM,CAACE,IAAI,EAAEC,QAAQ;AAC9B,IAAA,CAAC,CAAC;AACJ,EAAA;AAAC,EAAA;IAAAE,CAAA,CAAA,IAAA,CAAAC,SAAA,EAAA,UAAA,EAAA,CAEAC,OAAO,CAAA,EAAA,YAAA;AAAA,MAAA,OAAuB,EAAE;AAAA,IAAA,CAAA,CAAA;AAAA;EAAA,SAAA,IAAAC,CAAA,CAAA,IAAA,EAAA,UAAA,CAAA,EAAA,MAAA;EAEjC,IAAIC,QAAQA,GAA4B;AACtC,IAAA,MAAMC,CAAC,GAAG,IAAI,CAACC,QAAQ;AAEvB,IAAA,KAAK,IAAIH,CAAC,GAAGE,CAAC,CAACE,MAAM,GAAG,CAAC,EAAEJ,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;AACtC,MAAA,MAAMK,OAAO,GAAGH,CAAC,CAACF,CAAC,CAAC;AAEpB,MAAA,IAAIK,OAAO,EAAEC,IAAI,KAAK,MAAM,EAAE,OAAOD,OAAO;AAC9C,IAAA;AACF,EAAA;EAEA,IAAIE,SAASA,GAA6B;AACxC,IAAA,MAAML,CAAC,GAAG,IAAI,CAACC,QAAQ;AAEvB,IAAA,KAAK,IAAIH,CAAC,GAAGE,CAAC,CAACE,MAAM,GAAG,CAAC,EAAEJ,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;AACtC,MAAA,MAAMK,OAAO,GAAGH,CAAC,CAACF,CAAC,CAAC;AAEpB,MAAA,IAAIK,OAAO,EAAEC,IAAI,KAAK,OAAO,EAAE,OAAOD,OAAO;AAC/C,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEG,KAAK,GAAGA,CAACC,YAAuB,GAAG,EAAE,EAAEC,OAAwB,GAAG,EAAE,KAAK;AACvE,IAAA,MAAMC,YAAY,GAAGC,OAAO,CAACH,YAAY,CAAC;AAE1C,IAAA,IAAI,CAAC,SAAS,GAAG,IAAII,QAAQ,CAAC;MAC5BC,OAAO,EAAEC,QAAQ,CAACC,MAAM,CAACC,QAAQ,CAAC,OAAO,CAAC;AAC1CC,MAAAA,OAAO,EAAE;QACP,GAAGP;OACJ;AACD/D,MAAAA,EAAE,EAAE;AACFuE,QAAAA,GAAG,EAAEA,CAACb,IAAqB,EAAEc,OAAe,KAAK;AAC/C,UAAA,IAAI,CAACjB,QAAQ,CAACkB,IAAI,CAAC;YAAEf,IAAI;AAAEc,YAAAA;AAAQ,WAAC,CAAC;AACrC;AACA;AACA,UAAA,IAAI,CAACjB,QAAQ,GAAG,IAAI,CAACA,QAAQ;AAC/B,QAAA;OACD;AACDO,MAAAA,OAAO,EAAE;AACP,QAAA,GAAGA,OAAO;AACVY,QAAAA,GAAG,EAAE;AACH;AACAnF,UAAAA,KAAK,EAAE;AACLoF,YAAAA,MAAM,EAAEA,MAAM,CAAC,CAAC;YAChBC,mBAAmB,EAAEA,MAAM,CAAC;AAC9B;SACD;AACDC,QAAAA,GAAG,EAAE;AACH,UAAA,IAAIf,OAAO,CAACe,GAAG,IAAI,EAAE,CAAC;AACtBtE,UAAAA,KAAK,EAAE;AACL,YAAA,GAAGE,aAAa;AAChB,YAAA,IAAIqD,OAAO,CAACe,GAAG,EAAEtE,KAAK,IAAI,EAAE;WAC7B;AACDuE,UAAAA,aAAa,EAAE,CACb,SAASC,iBAAiBA,GAAG;AAC3B,YAAA,OAAO,SAASC,WAAWA,CAACC,IAAS,EAAE;AACrCC,cAAAA,KAAK,CAACD,IAAI,EAAE,MAAM,EAAGE,IAAI,IAAK;AAC5B,gBAAA,IAAIA,IAAI,CAACC,IAAI,KAAK,KAAK,EAAE;AACvB,kBAAA,IAAI,CAACD,IAAI,CAACE,IAAI,EAAE;oBACdF,IAAI,CAACE,IAAI,GAAG,OAAO;AACrB,kBAAA,CAAC,MAAM;oBACLF,IAAI,CAACE,IAAI,IAAI,QAAQ;AACvB,kBAAA;AAEA,kBAAA,OAAOF,IAAI;AACb,gBAAA;AACF,cAAA,CAAC,CAAC;AAEF,cAAA,OAAOF,IAAI;YACb,CAAC;UACH,CAAC,EACD,IAAInB,OAAO,CAACe,GAAG,EAAEC,aAAa,IAAI,EAAE,CAAC;SAExC;AACDQ,QAAAA,GAAG,EAAE;AACHC,UAAAA,KAAK,EAAE;AACL,YAAA,IAAIzB,OAAO,CAACwB,GAAG,IAAI,EAAE,CAAC;AACtB/E,YAAAA,KAAK,EAAE;AACL,cAAA,GAAGE,aAAa;AAChB,cAAA,IAAIqD,OAAO,CAACwB,GAAG,EAAE/E,KAAK,IAAI,EAAE;AAC9B;AACF;AACF;AACF;AACF,KAAC,CAAC;EACJ,CAAC;EAED,IAAIwC,QAAQA,GAAa;AACvB;AACJ;AACA;AACA;AACI,IAAA,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;MACnB,IAAI,CAACa,KAAK,EAAE;AACd,IAAA;AAEAnE,IAAAA,MAAM,CACJ,CAAA,wFAAA,CAA0F,EAC1F,IAAI,CAAC,SACP,CAAC;IAED,OAAO,IAAI,CAAC,SAAS;AACvB,EAAA;AAEA,EAAA,MAAM+F,YAAYA,CAChBrF,OAAoB,EACpB2D,OAKC,EAKA;IACD,OAAO,IAAI,CAACf,QAAQ,CAACyC,YAAY,CAACrF,OAAO,EAAE2D,OAAO,CAAC;AACrD,EAAA;EAEA,MAAM,QAAQ2B,CAACC,GAAW,EAAEC,IAAY,EAAE7B,OAAiC,EAAE;AAC3E;AACJ;AACA;AACA;AACA;AACA;AACA;AACI,IAAA,MAAM8B,OAAO,CAACtB,OAAO,EAAE;IAEvB,IAAI,CAACf,QAAQ,GAAG,EAAE;AAElB,IAAA,OAAO,IAAI,CAACR,QAAQ,CAAC8C,OAAO,CAACH,GAAG,EAAEC,IAAI,EAAE7B,OAAO,IAAI,EAAE,CAAC;AACxD,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,MACM+B,OAAOA,CAACH,GAAW,EAAEC,IAAY,EAAE7B,OAAiC,EAAE;AAC1E,IAAA,MAAMgC,IAAI,GAAGC,OAAO,CAACJ,IAAI,CAAC;AAC1B,IAAA,IAAIK,SAAoC;AACxC,IAAA,IAAIC,KAAwB;IAE5B,IAAI;MACF,IAAIP,GAAG,KAAK,KAAK,EAAE;AACjB;AACR;AACA;QACQ5B,OAAO,KAAK,EAAE;QACdA,OAAO,CAACoC,MAAM,GAAG,OAAO;AAC1B,MAAA;AAEA,MAAA,MAAMC,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAACT,GAAG,EAAEC,IAAI,EAAE7B,OAAO,CAAC;AAEtDkC,MAAAA,SAAS,GAAGpG,cAAc,CAACuG,MAAM,CAAC;IACpC,CAAC,CAAC,OAAOC,CAAC,EAAE;AACV;AACA;AACAC,MAAAA,OAAO,CAACJ,KAAK,CAACG,CAAC,CAAC;AAChBH,MAAAA,KAAK,GAAGG,CAAsB;AAChC,IAAA;IAEA,OAAO;MAAEN,IAAI;MAAEE,SAAS;AAAEC,MAAAA;KAAO;AACnC,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AAPE,EAAA;IAAAK,CAAA,CAAA,IAAA,CAAApD,SAAA,EAAA,SAAA,EAAA,CA5BCqD,OAAO,CAAA,CAAA;AAAA;EAoCRC,UAAUA,CAACC,IAAY,EAA0B;AAC/C,IAAA,OAAO,IAAI,CAACZ,OAAO,CAAC,KAAK,EAAEY,IAAI,CAAC;AAClC,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,MACMC,UAAUA,CACdC,MAAc,EACd7C,OAUC,GAAG,EAAE,EACkB;IACxB,OAAO,IAAI,CAAC+B,OAAO,CAAC,KAAK,EAAEc,MAAM,EAAE7C,OAAO,CAAC;AAC7C,EAAA;AAAC,EAAA;IAAAwC,CAAA,CAAA,IAAA,CAAApD,SAAA,EAAA,YAAA,EAAA,CAhBAqD,OAAO,CAAA,CAAA;AAAA;AAmBRK,EAAAA,SAASA,CACPD,MAAc,EACd7C,OAGC,EACuB;IACxB,OAAO,IAAI,CAAC+B,OAAO,CAAC,IAAI,EAAEc,MAAM,EAAE7C,OAAO,CAAC;AAC5C,EAAA;AAAC,EAAA;IAAAwC,CAAA,CAAA,IAAA,CAAApD,SAAA,EAAA,WAAA,EAAA,CATAqD,OAAO,CAAA,CAAA;AAAA;AAUV;AAEA,SAAS1D,SAASA,GAAG;AACnB,EAAA,OAAO9B,UAAU;AAKnB;;;;"}
+{"version":3,"file":"compiler.js","sources":["../../../../node_modules/.pnpm/unist-util-is@6.0.1/node_modules/unist-util-is/lib/index.js","../../../../node_modules/.pnpm/unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/color.js","../../../../node_modules/.pnpm/unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/index.js","../../../../node_modules/.pnpm/unist-util-visit@5.0.0/node_modules/unist-util-visit/lib/index.js","../../src/services/compiler.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 d\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 * @typedef {import('unist').Node} UnistNode\n * @typedef {import('unist').Parent} UnistParent\n * @typedef {import('unist-util-visit-parents').VisitorResult} VisitorResult\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 Array<any>\n *   ? MatchesOne<Value, Check[keyof Check]>\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","/* eslint-disable getter-return */\n \n// @ts-ignore\nimport { tracked } from '@glimmer/tracking';\nimport { setComponentTemplate } from '@ember/component';\nimport templateOnly from '@ember/component/template-only';\nimport { assert } from '@ember/debug';\nimport { registerDestructor } from '@ember/destroyable';\nimport { array, concat, fn, get, hash } from '@ember/helper';\nimport { on } from '@ember/modifier';\nimport { getOwner } from '@ember/owner';\nimport { precompileTemplate } from '@ember/template-compilation';\nimport { waitFor } from '@ember/test-waiters';\n\nimport { createStore } from 'ember-primitives/store';\nimport { resource } from 'ember-resources';\nimport { Compiler } from 'repl-sdk';\nimport { visit } from 'unist-util-visit';\n\nimport { nameFor } from '../compile/utils.ts';\nimport { modules } from './known-modules.ts';\n\nimport type { CompileResult, ModuleMap } from '../compile/types.ts';\nimport type { ComponentLike } from '@glint/template';\nimport type { EditorView } from 'codemirror';\nimport type { ErrorMessage, InfoMessage, Message } from 'repl-sdk';\n\nexport function getCompiler(context: object) {\n  const owner = getOwner(context) ?? context;\n\n  assert(`Missing owner. Cannot use ember-repl's compiler without an owner.`, owner);\n\n  return createStore(owner, CompilerService);\n}\n\n/**\n * Old way to make static components, because\n * https://github.com/emberjs/ember.js/issues/20913\n *\n * The runtime compiler doesn't allow you to catch compiler errors.\n * This particular component doesn't need to be runtime anyway.\n */\nfunction rendersElement(x: { element: Element; destroy: () => void }): ComponentLike {\n  const render = resource(({ on }) => {\n    on.cleanup(() => {\n      x.destroy();\n    });\n\n    return x.element;\n  });\n\n  return setComponentTemplate(\n    precompileTemplate(`{{render}}`, {\n      strictMode: true,\n      scope: () => ({ render }),\n    }),\n    templateOnly()\n  ) as ComponentLike;\n}\n\ninterface CompilerOptions {\n  hbs?: {\n    scope?: Record<string, unknown>;\n  };\n  md?: {\n    remarkPlugins?: unknown[];\n    rehypePlugins?: unknown[];\n  };\n  gmd?: {\n    scope?: Record<string, unknown>;\n    remarkPlugins?: unknown[];\n    rehypePlugins?: unknown[];\n  };\n}\n\n/**\n * Standard for the REPL, not real apps.\n * HBS isn't used in real apps (that are fully up to date)\n */\nconst standardScope = {\n  // These are only added here because it's convenient for hbs\n  // to have them\n  array,\n  concat,\n  fn,\n  get,\n  hash,\n  on,\n  // The default available scope for gjs:\n  //\n  // We don't use gjs transpilation here, because hbs transpilation\n  // doesn't need to go through the babel infra, so it's faster this way,\n  // even though it's more \"verbose\" and could get out of sync from the\n  // implementations / source-of-truth.\n  //\n  // https://github.com/emberjs/babel-plugin-ember-template-compilation/blob/main/src/scope-locals.ts#L16\n  //\n  // ////////////////\n  // namespaces\n  // ////////////////\n  //   TC39\n  globalThis,\n  Atomics,\n  JSON,\n  Math,\n  Reflect,\n  //   WHATWG\n  localStorage,\n  sessionStorage,\n  URL,\n  // ////////////////\n  // functions / utilities\n  // ////////////////\n  //   TC39\n  isNaN,\n  isFinite,\n  parseInt,\n  parseFloat,\n  decodeURI,\n  decodeURIComponent,\n  encodeURI,\n  encodeURIComponent,\n  //   WHATWG\n  postMessage,\n  structuredClone,\n  // ////////////////\n  // new-less Constructors (still functions)\n  // ////////////////\n  //   TC39\n  Array, // different behavior from (array)\n  BigInt,\n  Boolean,\n  Date,\n  Number,\n  Object, // different behavior from (hash)\n  String,\n  // ////////////////\n  // Values\n  // ////////////////\n  //   TC39\n  Infinity,\n  NaN,\n  //   WHATWG\n  isSecureContext,\n};\n\nexport default class CompilerService {\n  #compiler: Compiler | undefined;\n\n  constructor() {\n    const global = getGlobal();\n\n    global.REPL ||= {};\n\n    if (global.REPL.compiler) {\n      return global.REPL.compiler;\n    }\n\n    global.REPL.compiler = this;\n\n    registerDestructor(this, () => {\n      delete global.REPL?.compiler;\n    });\n  }\n\n  @tracked messages: Message[] = [];\n\n  get lastInfo(): InfoMessage | undefined {\n    const m = this.messages;\n\n    for (let i = m.length - 1; i >= 0; i--) {\n      const current = m[i];\n\n      if (current?.type === 'info') return current;\n    }\n  }\n\n  get lastError(): ErrorMessage | undefined {\n    const m = this.messages;\n\n    for (let i = m.length - 1; i >= 0; i--) {\n      const current = m[i];\n\n      if (current?.type === 'error') return current;\n    }\n  }\n\n  /**\n   * @param {ModuleMap} [ extraModules ]: map of import paths to modules.\n   *  These modules are useful if you need to document a library or a any design system or a styleguide or\n   *  if there are additional modules that could be imported in the passed `code`.\n   * @param {object} [options] optional compiler options for each format/flavor\n   *\n   *  Later on, imports that are not present by default (ember/glimmer) or that\n   *  are not provided by extraModules will be searched on npm to see if a package\n   *  needs to be downloaded before running the `code` / invoking the component\n   */\n  setup = (extraModules: ModuleMap = {}, options: CompilerOptions = {}) => {\n    const localModules = modules(extraModules);\n\n    this.#compiler = new Compiler({\n      logging: location.search.includes('debug'),\n      resolve: {\n        ...localModules,\n      },\n      on: {\n        log: (type: Message['type'], message: string) => {\n          this.messages.push({ type, message });\n          // Waiting on better array primitive\n          // eslint-disable-next-line no-self-assign\n          this.messages = this.messages;\n        },\n      },\n      options: {\n        ...options,\n        gjs: {\n          // owner: getOwner(this),\n          owner: {\n            lookup: () => {},\n            resolveRegistration: () => {},\n          },\n        },\n        gmd: {\n          ...(options.gmd ?? {}),\n          scope: {\n            ...standardScope,\n            ...(options.gmd?.scope ?? {}),\n          },\n          remarkPlugins: [\n            function defaultHbsToEmber() {\n              return function transformer(tree: any) {\n                visit(tree, 'code', (node) => {\n                  if (node.lang === 'hbs') {\n                    if (!node.meta) {\n                      node.meta = 'ember';\n                    } else {\n                      node.meta += ' ember';\n                    }\n\n                    return node;\n                  }\n                });\n\n                return tree;\n              };\n            },\n            ...(options.gmd?.remarkPlugins ?? []),\n          ],\n        },\n        hbs: {\n          ember: {\n            ...(options.hbs ?? {}),\n            scope: {\n              ...standardScope,\n              ...(options.hbs?.scope ?? {}),\n            },\n          },\n        },\n      },\n    });\n  };\n\n  get compiler(): Compiler {\n    /**\n     * This is useful for our own testing.\n     * not sure if this would be a footgun for consumers' usage\n     */\n    if (!this.#compiler) {\n      this.setup();\n    }\n\n    assert(\n      `Expected a compiled to be setup on the compiler service. Use \\`compiler.setup()\\` first.`,\n      this.#compiler\n    );\n\n    return this.#compiler;\n  }\n\n  async createEditor(\n    element: HTMLElement,\n    options: {\n      text: string | null | undefined;\n      format: string;\n      handleUpdate: (text: string) => void;\n      extensions?: unknown[];\n    }\n  ): Promise<{\n    view: EditorView;\n    setText: (text: string, format: string) => Promise<void>;\n    setFormat: (format: string) => Promise<void>;\n  }> {\n    return this.compiler.createEditor(element, options);\n  }\n\n  async #compile(ext: string, text: string, options?: Record<string, unknown>) {\n    /**\n     * Protect from accidental backtracking-render assertions\n     * (infinite loop protection)\n     *\n     * This function doesn't ready any tracked data, so we don't need to\n     * worry about invalidation or anything.\n     */\n    await Promise.resolve();\n\n    this.messages = [];\n\n    return this.compiler.compile(ext, text, options ?? {});\n  }\n\n  /**\n   * @public\n   *\n   * Defers to the underlying repl-SDK and gives us a component we can render.\n   *\n   * @param {string} ext the ext/format to be compiled\n   * @param {string} text the code to be compiled using the configured compiler for the ext\n   */\n  @waitFor\n  async compile(ext: string, text: string, options?: Record<string, unknown>) {\n    const name = nameFor(text);\n    let component: undefined | ComponentLike;\n    let error: undefined | Error;\n\n    try {\n      if (ext === 'hbs') {\n        /**\n         * Are there other hbs-using frameworks?\n         */\n        options ||= {};\n        options.flavor = 'ember';\n      }\n\n      const result = await this.#compile(ext, text, options);\n\n      component = rendersElement(result);\n    } catch (e) {\n      // Put a breakpoint here to debug\n      // debugger;\n      console.error(e);\n      error = e as Error | undefined;\n    }\n\n    return { name, component, error };\n  }\n\n  /**\n   * @public\n   *\n   * Transpiles GlimmerJS (*.gjs) formatted text into and evaluates as a JS Module.\n   * The returned component can be invoked explicitly in the consuming project.\n   *\n   * @param {string} code the code to be compiled\n   */\n  compileGJS(code: string): Promise<CompileResult> {\n    return this.compile('gjs', code);\n  }\n\n  /**\n   * compile a template with an empty scope\n   * to use components, helpers, etc, you will need to compile with JS\n   *\n   * (templates alone do not have a way to import / define complex structures)\n   */\n  @waitFor\n  async compileHBS(\n    source: string,\n    options: {\n      /**\n       * Used for debug viewing\n       */\n      moduleName?: string;\n      /**\n       * Additional values to include in hbs scope.\n       * This is a _strict mode_ hbs component.\n       */\n      scope?: Record<string, unknown>;\n    } = {}\n  ): Promise<CompileResult> {\n    return this.compile('hbs', source, options);\n  }\n\n  @waitFor\n  compileMD(\n    source: string,\n    options?: {\n      remarkPlugins?: unknown[];\n      rehypePlugins?: unknown[];\n    }\n  ): Promise<CompileResult> {\n    return this.compile('md', source, options);\n  }\n}\n\nfunction getGlobal() {\n  return globalThis as {\n    REPL?: {\n      compiler?: CompilerService;\n    };\n  };\n}\n"],"names":["convert","test","undefined","ok","castFactory","Array","isArray","anyFactory","propertiesFactory","typeFactory","Error","tests","checks","index","length","any","parameters","apply","check","checkAsRecord","all","node","nodeAsRecord","key","type","testFunction","value","parent","Boolean","looksLikeANode","call","color","d","empty","CONTINUE","EXIT","SKIP","visitParents","tree","visitor","reverse","is","step","factory","parents","name","tagName","Object","defineProperty","visit","result","subresult","offset","grandparents","toResult","children","nodeAsParent","concat","child","testOrVisitor","visitorOrReverse","maybeReverse","overload","indexOf","getCompiler","context","owner","getOwner","assert","createStore","CompilerService","rendersElement","x","render","resource","on","cleanup","destroy","element","setComponentTemplate","precompileTemplate","strictMode","scope","templateOnly","standardScope","array","fn","get","hash","globalThis","Atomics","JSON","Math","Reflect","localStorage","sessionStorage","URL","isNaN","isFinite","parseInt","parseFloat","decodeURI","decodeURIComponent","encodeURI","encodeURIComponent","postMessage","structuredClone","BigInt","Date","Number","String","Infinity","NaN","isSecureContext","constructor","global","getGlobal","REPL","compiler","registerDestructor","g","prototype","tracked","i","lastInfo","m","messages","current","lastError","setup","extraModules","options","localModules","modules","Compiler","logging","location","search","includes","resolve","log","message","push","gjs","lookup","resolveRegistration","gmd","remarkPlugins","defaultHbsToEmber","transformer","lang","meta","hbs","ember","createEditor","#compile","ext","text","Promise","compile","nameFor","component","error","flavor","e","console","n","waitFor","compileGJS","code","compileHBS","source","compileMD"],"mappings":";;;;;;;;;;;;;;;;;AAAA;AACA;AACA;;;AAwHA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMA,OAAO;AAClB;AACA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEI;AACJ;AACA;AACA;AACI,UAAUC,IAAI,EAAE;AACd,EAAA,IAAIA,IAAI,KAAK,IAAI,IAAIA,IAAI,KAAKC,SAAS,EAAE;AACvC,IAAA,OAAOC,EAAE;AACX,EAAA;AAEA,EAAA,IAAI,OAAOF,IAAI,KAAK,UAAU,EAAE;IAC9B,OAAOG,WAAW,CAACH,IAAI,CAAC;AAC1B,EAAA;AAEA,EAAA,IAAI,OAAOA,IAAI,KAAK,QAAQ,EAAE;IAC5B,OAAOI,KAAK,CAACC,OAAO,CAACL,IAAI,CAAC,GACtBM,UAAU,CAACN,IAAI,CAAC;AAChB;AACA;IACAO,iBAAiB,qBAAuBP,IAAK,CAAC;AACpD,EAAA;AAEA,EAAA,IAAI,OAAOA,IAAI,KAAK,QAAQ,EAAE;IAC5B,OAAOQ,WAAW,CAACR,IAAI,CAAC;AAC1B,EAAA;AAEA,EAAA,MAAM,IAAIS,KAAK,CAAC,8CAA8C,CAAC;AACjE,CACD;;AAEH;AACA;AACA;AACA;AACA,SAASH,UAAUA,CAACI,KAAK,EAAE;AACzB;EACA,MAAMC,MAAM,GAAG,EAAE;EACjB,IAAIC,KAAK,GAAG,EAAE;AAEd,EAAA,OAAO,EAAEA,KAAK,GAAGF,KAAK,CAACG,MAAM,EAAE;IAC7BF,MAAM,CAACC,KAAK,CAAC,GAAGb,OAAO,CAACW,KAAK,CAACE,KAAK,CAAC,CAAC;AACvC,EAAA;EAEA,OAAOT,WAAW,CAACW,GAAG,CAAC;;AAEvB;AACF;AACA;AACA;AACE,EAAA,SAASA,GAAGA,CAAC,GAAGC,UAAU,EAAE;IAC1B,IAAIH,KAAK,GAAG,EAAE;AAEd,IAAA,OAAO,EAAEA,KAAK,GAAGD,MAAM,CAACE,MAAM,EAAE;AAC9B,MAAA,IAAIF,MAAM,CAACC,KAAK,CAAC,CAACI,KAAK,CAAC,IAAI,EAAED,UAAU,CAAC,EAAE,OAAO,IAAI;AACxD,IAAA;AAEA,IAAA,OAAO,KAAK;AACd,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASR,iBAAiBA,CAACU,KAAK,EAAE;EAChC,MAAMC,aAAa,yCAA2CD,KAAM;EAEpE,OAAOd,WAAW,CAACgB,GAAG,CAAC;;AAEvB;AACF;AACA;AACA;EACE,SAASA,GAAGA,CAACC,IAAI,EAAE;AACjB,IAAA,MAAMC,YAAY;AAChB,0BAAwBD,IACzB;;AAED;AACA,IAAA,IAAIE,GAAG;IAEP,KAAKA,GAAG,IAAIL,KAAK,EAAE;MACjB,IAAII,YAAY,CAACC,GAAG,CAAC,KAAKJ,aAAa,CAACI,GAAG,CAAC,EAAE,OAAO,KAAK;AAC5D,IAAA;AAEA,IAAA,OAAO,IAAI;AACb,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASd,WAAWA,CAACS,KAAK,EAAE;EAC1B,OAAOd,WAAW,CAACoB,IAAI,CAAC;;AAExB;AACF;AACA;EACE,SAASA,IAAIA,CAACH,IAAI,EAAE;AAClB,IAAA,OAAOA,IAAI,IAAIA,IAAI,CAACG,IAAI,KAAKN,KAAK;AACpC,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASd,WAAWA,CAACqB,YAAY,EAAE;AACjC,EAAA,OAAOP,KAAK;;AAEZ;AACF;AACA;AACA;AACE,EAAA,SAASA,KAAKA,CAACQ,KAAK,EAAEb,KAAK,EAAEc,MAAM,EAAE;AACnC,IAAA,OAAOC,OAAO,CACZC,cAAc,CAACH,KAAK,CAAC,IACnBD,YAAY,CAACK,IAAI,CACf,IAAI,EACJJ,KAAK,EACL,OAAOb,KAAK,KAAK,QAAQ,GAAGA,KAAK,GAAGX,SAAS,EAC7CyB,MAAM,IAAIzB,SACZ,CACJ,CAAC;AACH,EAAA;AACF;AAEA,SAASC,EAAEA,GAAG;AACZ,EAAA,OAAO,IAAI;AACb;;AAEA;AACA;AACA;AACA;AACA,SAAS0B,cAAcA,CAACH,KAAK,EAAE;EAC7B,OAAOA,KAAK,KAAK,IAAI,IAAI,OAAOA,KAAK,KAAK,QAAQ,IAAI,MAAM,IAAIA,KAAK;AACvE;;ACvSA;AACA;AACA;AACA;AACO,SAASK,KAAKA,CAACC,CAAC,EAAE;AACvB,EAAA,OAAOA,CAAC;AACV;;ACNA;AACA;AACA;;;AA6NA;AACA,MAAMC,KAAK,GAAG,EAAE;;AAEhB;AACA;AACA;AACO,MAAMC,QAAQ,GAAG,IAAI;;AAE5B;AACA;AACA;AACO,MAAMC,IAAI,GAAG,KAAK;;AAEzB;AACA;AACA;AACO,MAAMC,IAAI,GAAG,MAAM;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,YAAYA,CAACC,IAAI,EAAErC,IAAI,EAAEsC,OAAO,EAAEC,OAAO,EAAE;AACzD;AACA,EAAA,IAAItB,KAAK;EAET,IAAI,OAAOjB,IAAI,KAAK,UAAU,IAAI,OAAOsC,OAAO,KAAK,UAAU,EAAE;AAC/DC,IAAAA,OAAO,GAAGD,OAAO;AACjB;AACAA,IAAAA,OAAO,GAAGtC,IAAI;AAChB,EAAA,CAAC,MAAM;AACL;AACAiB,IAAAA,KAAK,GAAGjB,IAAI;AACd,EAAA;AAEA,EAAA,MAAMwC,EAAE,GAAGzC,OAAO,CAACkB,KAAK,CAAC;AACzB,EAAA,MAAMwB,IAAI,GAAGF,OAAO,GAAG,EAAE,GAAG,CAAC;EAE7BG,OAAO,CAACL,IAAI,EAAEpC,SAAS,EAAE,EAAE,CAAC,EAAE;;AAE9B;AACF;AACA;AACA;AACA;AACE,EAAA,SAASyC,OAAOA,CAACtB,IAAI,EAAER,KAAK,EAAE+B,OAAO,EAAE;AACrC,IAAA,MAAMlB,KAAK;IACTL,IAAI,IAAI,OAAOA,IAAI,KAAK,QAAQ,GAAGA,IAAI,GAAG,EAC3C;AAED,IAAA,IAAI,OAAOK,KAAK,CAACF,IAAI,KAAK,QAAQ,EAAE;AAClC,MAAA,MAAMqB,IAAI;AACR;MACA,OAAOnB,KAAK,CAACoB,OAAO,KAAK,QAAQ,GAC7BpB,KAAK,CAACoB,OAAO;AACb;MACA,OAAOpB,KAAK,CAACmB,IAAI,KAAK,QAAQ,GAC5BnB,KAAK,CAACmB,IAAI,GACV3C,SAAS;AAEjB6C,MAAAA,MAAM,CAACC,cAAc,CAACC,KAAK,EAAE,MAAM,EAAE;QACnCvB,KAAK,EACH,QAAQ,GAAGK,KAAK,CAACV,IAAI,CAACG,IAAI,IAAIqB,IAAI,GAAG,GAAG,GAAGA,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG;AACnE,OAAC,CAAC;AACJ,IAAA;AAEA,IAAA,OAAOI,KAAK;IAEZ,SAASA,KAAKA,GAAG;AACf;MACA,IAAIC,MAAM,GAAGjB,KAAK;AAClB;AACA,MAAA,IAAIkB,SAAS;AACb;AACA,MAAA,IAAIC,MAAM;AACV;AACA,MAAA,IAAIC,YAAY;MAEhB,IAAI,CAACpD,IAAI,IAAIwC,EAAE,CAACpB,IAAI,EAAER,KAAK,EAAE+B,OAAO,CAACA,OAAO,CAAC9B,MAAM,GAAG,CAAC,CAAC,IAAIZ,SAAS,CAAC,EAAE;AACtE;QACAgD,MAAM,GAAGI,QAAQ,CAACf,OAAO,CAAClB,IAAI,EAAEuB,OAAO,CAAC,CAAC;AAEzC,QAAA,IAAIM,MAAM,CAAC,CAAC,CAAC,KAAKf,IAAI,EAAE;AACtB,UAAA,OAAOe,MAAM;AACf,QAAA;AACF,MAAA;AAEA,MAAA,IAAI,UAAU,IAAI7B,IAAI,IAAIA,IAAI,CAACkC,QAAQ,EAAE;QACvC,MAAMC,YAAY,6BAA+BnC,IAAK;QAEtD,IAAImC,YAAY,CAACD,QAAQ,IAAIL,MAAM,CAAC,CAAC,CAAC,KAAKd,IAAI,EAAE;AAC/CgB,UAAAA,MAAM,GAAG,CAACZ,OAAO,GAAGgB,YAAY,CAACD,QAAQ,CAACzC,MAAM,GAAG,EAAE,IAAI4B,IAAI;AAC7DW,UAAAA,YAAY,GAAGT,OAAO,CAACa,MAAM,CAACD,YAAY,CAAC;AAE3C,UAAA,OAAOJ,MAAM,GAAG,EAAE,IAAIA,MAAM,GAAGI,YAAY,CAACD,QAAQ,CAACzC,MAAM,EAAE;AAC3D,YAAA,MAAM4C,KAAK,GAAGF,YAAY,CAACD,QAAQ,CAACH,MAAM,CAAC;YAE3CD,SAAS,GAAGR,OAAO,CAACe,KAAK,EAAEN,MAAM,EAAEC,YAAY,CAAC,EAAE;AAElD,YAAA,IAAIF,SAAS,CAAC,CAAC,CAAC,KAAKhB,IAAI,EAAE;AACzB,cAAA,OAAOgB,SAAS;AAClB,YAAA;AAEAC,YAAAA,MAAM,GACJ,OAAOD,SAAS,CAAC,CAAC,CAAC,KAAK,QAAQ,GAAGA,SAAS,CAAC,CAAC,CAAC,GAAGC,MAAM,GAAGV,IAAI;AACnE,UAAA;AACF,QAAA;AACF,MAAA;AAEA,MAAA,OAAOQ,MAAM;AACf,IAAA;AACF,EAAA;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASI,QAAQA,CAAC5B,KAAK,EAAE;AACvB,EAAA,IAAIrB,KAAK,CAACC,OAAO,CAACoB,KAAK,CAAC,EAAE;AACxB,IAAA,OAAOA,KAAK;AACd,EAAA;AAEA,EAAA,IAAI,OAAOA,KAAK,KAAK,QAAQ,EAAE;AAC7B,IAAA,OAAO,CAACQ,QAAQ,EAAER,KAAK,CAAC;AAC1B,EAAA;AAEA,EAAA,OAAOA,KAAK,KAAK,IAAI,IAAIA,KAAK,KAAKxB,SAAS,GAAG+B,KAAK,GAAG,CAACP,KAAK,CAAC;AAChE;;AC9YA;AACA;AACA;AACA;AACA;;;AAmOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASuB,KAAKA,CAACX,IAAI,EAAEqB,aAAa,EAAEC,gBAAgB,EAAEC,YAAY,EAAE;AACzE;AACA,EAAA,IAAIrB,OAAO;AACX;AACA,EAAA,IAAIvC,IAAI;AACR;AACA,EAAA,IAAIsC,OAAO;EASJ;AACL;AACAtC,IAAAA,IAAI,GAAG0D,aAAa;AACpB;AACApB,IAAAA,OAAO,GAAGqB,gBAAgB;AAC1BpB,IAAAA,OAAO,GAAGqB,YAAY;AACxB,EAAA;EAEAxB,YAAY,CAACC,IAAI,EAAErC,IAAI,EAAE6D,QAAQ,EAAEtB,OAAO,CAAC;;AAE3C;AACF;AACA;AACA;AACE,EAAA,SAASsB,QAAQA,CAACzC,IAAI,EAAEuB,OAAO,EAAE;IAC/B,MAAMjB,MAAM,GAAGiB,OAAO,CAACA,OAAO,CAAC9B,MAAM,GAAG,CAAC,CAAC;AAC1C,IAAA,MAAMD,KAAK,GAAGc,MAAM,GAAGA,MAAM,CAAC4B,QAAQ,CAACQ,OAAO,CAAC1C,IAAI,CAAC,GAAGnB,SAAS;AAChE,IAAA,OAAOqC,OAAO,CAAClB,IAAI,EAAER,KAAK,EAAEc,MAAM,CAAC;AACrC,EAAA;AACF;;ACxTA;;AA2BO,SAASqC,WAAWA,CAACC,OAAe,EAAE;AAC3C,EAAA,MAAMC,KAAK,GAAGC,QAAQ,CAACF,OAAO,CAAC,IAAIA,OAAO;AAE1CG,EAAAA,MAAM,CAAC,CAAA,iEAAA,CAAmE,EAAEF,KAAK,CAAC;AAElF,EAAA,OAAOG,WAAW,CAACH,KAAK,EAAEI,eAAe,CAAC;AAC5C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,cAAcA,CAACC,CAA4C,EAAiB;AACnF,EAAA,MAAMC,MAAM,GAAGC,QAAQ,CAAC,CAAC;AAAEC,IAAAA;AAAG,GAAC,KAAK;IAClCA,EAAE,CAACC,OAAO,CAAC,MAAM;MACfJ,CAAC,CAACK,OAAO,EAAE;AACb,IAAA,CAAC,CAAC;IAEF,OAAOL,CAAC,CAACM,OAAO;AAClB,EAAA,CAAC,CAAC;AAEF,EAAA,OAAOC,oBAAoB,CACzBC,kBAAkB,CAAC,YAAY,EAAE;AAC/BC,IAAAA,UAAU,EAAE,IAAI;IAChBC,KAAK,EAAEA,OAAO;AAAET,MAAAA;KAAQ;AAC1B,GAAC,CAAC,EACFU,YAAY,EACd,CAAC;AACH;AAiBA;AACA;AACA;AACA;AACA,MAAMC,aAAa,GAAG;AACpB;AACA;EACAC,KAAK;EACL5B,MAAM;EACN6B,EAAE;EACFC,GAAG;EACHC,IAAI;EACJb,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACAc,UAAU;EACVC,OAAO;EACPC,IAAI;EACJC,IAAI;EACJC,OAAO;AACP;EACAC,YAAY;EACZC,cAAc;EACdC,GAAG;AACH;AACA;AACA;AACA;EACAC,KAAK;EACLC,QAAQ;EACRC,QAAQ;EACRC,UAAU;EACVC,SAAS;EACTC,kBAAkB;EAClBC,SAAS;EACTC,kBAAkB;AAClB;EACAC,WAAW;EACXC,eAAe;AACf;AACA;AACA;AACA;EACArG,KAAK;AAAE;EACPsG,MAAM;EACN/E,OAAO;EACPgF,IAAI;EACJC,MAAM;EACN9D,MAAM;AAAE;EACR+D,MAAM;AACN;AACA;AACA;AACA;EACAC,QAAQ;EACRC,GAAG;AACH;AACAC,EAAAA;AACF,CAAC;AAEc,MAAM3C,eAAe,CAAC;AACnC,EAAA,SAAS;AAET4C,EAAAA,WAAWA,GAAG;AACZ,IAAA,MAAMC,MAAM,GAAGC,SAAS,EAAE;AAE1BD,IAAAA,MAAM,CAACE,IAAI,KAAK,EAAE;AAElB,IAAA,IAAIF,MAAM,CAACE,IAAI,CAACC,QAAQ,EAAE;AACxB,MAAA,OAAOH,MAAM,CAACE,IAAI,CAACC,QAAQ;AAC7B,IAAA;AAEAH,IAAAA,MAAM,CAACE,IAAI,CAACC,QAAQ,GAAG,IAAI;IAE3BC,kBAAkB,CAAC,IAAI,EAAE,MAAM;AAC7B,MAAA,OAAOJ,MAAM,CAACE,IAAI,EAAEC,QAAQ;AAC9B,IAAA,CAAC,CAAC;AACJ,EAAA;AAAC,EAAA;IAAAE,CAAA,CAAA,IAAA,CAAAC,SAAA,EAAA,UAAA,EAAA,CAEAC,OAAO,CAAA,EAAA,YAAA;AAAA,MAAA,OAAuB,EAAE;AAAA,IAAA,CAAA,CAAA;AAAA;EAAA,SAAA,IAAAC,CAAA,CAAA,IAAA,EAAA,UAAA,CAAA,EAAA,MAAA;EAEjC,IAAIC,QAAQA,GAA4B;AACtC,IAAA,MAAMC,CAAC,GAAG,IAAI,CAACC,QAAQ;AAEvB,IAAA,KAAK,IAAIH,CAAC,GAAGE,CAAC,CAAC/G,MAAM,GAAG,CAAC,EAAE6G,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;AACtC,MAAA,MAAMI,OAAO,GAAGF,CAAC,CAACF,CAAC,CAAC;AAEpB,MAAA,IAAII,OAAO,EAAEvG,IAAI,KAAK,MAAM,EAAE,OAAOuG,OAAO;AAC9C,IAAA;AACF,EAAA;EAEA,IAAIC,SAASA,GAA6B;AACxC,IAAA,MAAMH,CAAC,GAAG,IAAI,CAACC,QAAQ;AAEvB,IAAA,KAAK,IAAIH,CAAC,GAAGE,CAAC,CAAC/G,MAAM,GAAG,CAAC,EAAE6G,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;AACtC,MAAA,MAAMI,OAAO,GAAGF,CAAC,CAACF,CAAC,CAAC;AAEpB,MAAA,IAAII,OAAO,EAAEvG,IAAI,KAAK,OAAO,EAAE,OAAOuG,OAAO;AAC/C,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEE,KAAK,GAAGA,CAACC,YAAuB,GAAG,EAAE,EAAEC,OAAwB,GAAG,EAAE,KAAK;AACvE,IAAA,MAAMC,YAAY,GAAGC,OAAO,CAACH,YAAY,CAAC;AAE1C,IAAA,IAAI,CAAC,SAAS,GAAG,IAAII,QAAQ,CAAC;MAC5BC,OAAO,EAAEC,QAAQ,CAACC,MAAM,CAACC,QAAQ,CAAC,OAAO,CAAC;AAC1CC,MAAAA,OAAO,EAAE;QACP,GAAGP;OACJ;AACDzD,MAAAA,EAAE,EAAE;AACFiE,QAAAA,GAAG,EAAEA,CAACpH,IAAqB,EAAEqH,OAAe,KAAK;AAC/C,UAAA,IAAI,CAACf,QAAQ,CAACgB,IAAI,CAAC;YAAEtH,IAAI;AAAEqH,YAAAA;AAAQ,WAAC,CAAC;AACrC;AACA;AACA,UAAA,IAAI,CAACf,QAAQ,GAAG,IAAI,CAACA,QAAQ;AAC/B,QAAA;OACD;AACDK,MAAAA,OAAO,EAAE;AACP,QAAA,GAAGA,OAAO;AACVY,QAAAA,GAAG,EAAE;AACH;AACA7E,UAAAA,KAAK,EAAE;AACL8E,YAAAA,MAAM,EAAEA,MAAM,CAAC,CAAC;YAChBC,mBAAmB,EAAEA,MAAM,CAAC;AAC9B;SACD;AACDC,QAAAA,GAAG,EAAE;AACH,UAAA,IAAIf,OAAO,CAACe,GAAG,IAAI,EAAE,CAAC;AACtBhE,UAAAA,KAAK,EAAE;AACL,YAAA,GAAGE,aAAa;AAChB,YAAA,IAAI+C,OAAO,CAACe,GAAG,EAAEhE,KAAK,IAAI,EAAE;WAC7B;AACDiE,UAAAA,aAAa,EAAE,CACb,SAASC,iBAAiBA,GAAG;AAC3B,YAAA,OAAO,SAASC,WAAWA,CAAC/G,IAAS,EAAE;AACrCW,cAAAA,KAAK,CAACX,IAAI,EAAE,MAAM,EAAGjB,IAAI,IAAK;AAC5B,gBAAA,IAAIA,IAAI,CAACiI,IAAI,KAAK,KAAK,EAAE;AACvB,kBAAA,IAAI,CAACjI,IAAI,CAACkI,IAAI,EAAE;oBACdlI,IAAI,CAACkI,IAAI,GAAG,OAAO;AACrB,kBAAA,CAAC,MAAM;oBACLlI,IAAI,CAACkI,IAAI,IAAI,QAAQ;AACvB,kBAAA;AAEA,kBAAA,OAAOlI,IAAI;AACb,gBAAA;AACF,cAAA,CAAC,CAAC;AAEF,cAAA,OAAOiB,IAAI;YACb,CAAC;UACH,CAAC,EACD,IAAI6F,OAAO,CAACe,GAAG,EAAEC,aAAa,IAAI,EAAE,CAAC;SAExC;AACDK,QAAAA,GAAG,EAAE;AACHC,UAAAA,KAAK,EAAE;AACL,YAAA,IAAItB,OAAO,CAACqB,GAAG,IAAI,EAAE,CAAC;AACtBtE,YAAAA,KAAK,EAAE;AACL,cAAA,GAAGE,aAAa;AAChB,cAAA,IAAI+C,OAAO,CAACqB,GAAG,EAAEtE,KAAK,IAAI,EAAE;AAC9B;AACF;AACF;AACF;AACF,KAAC,CAAC;EACJ,CAAC;EAED,IAAIoC,QAAQA,GAAa;AACvB;AACJ;AACA;AACA;AACI,IAAA,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;MACnB,IAAI,CAACW,KAAK,EAAE;AACd,IAAA;AAEA7D,IAAAA,MAAM,CACJ,CAAA,wFAAA,CAA0F,EAC1F,IAAI,CAAC,SACP,CAAC;IAED,OAAO,IAAI,CAAC,SAAS;AACvB,EAAA;AAEA,EAAA,MAAMsF,YAAYA,CAChB5E,OAAoB,EACpBqD,OAKC,EAKA;IACD,OAAO,IAAI,CAACb,QAAQ,CAACoC,YAAY,CAAC5E,OAAO,EAAEqD,OAAO,CAAC;AACrD,EAAA;EAEA,MAAM,QAAQwB,CAACC,GAAW,EAAEC,IAAY,EAAE1B,OAAiC,EAAE;AAC3E;AACJ;AACA;AACA;AACA;AACA;AACA;AACI,IAAA,MAAM2B,OAAO,CAACnB,OAAO,EAAE;IAEvB,IAAI,CAACb,QAAQ,GAAG,EAAE;AAElB,IAAA,OAAO,IAAI,CAACR,QAAQ,CAACyC,OAAO,CAACH,GAAG,EAAEC,IAAI,EAAE1B,OAAO,IAAI,EAAE,CAAC;AACxD,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,MACM4B,OAAOA,CAACH,GAAW,EAAEC,IAAY,EAAE1B,OAAiC,EAAE;AAC1E,IAAA,MAAMtF,IAAI,GAAGmH,OAAO,CAACH,IAAI,CAAC;AAC1B,IAAA,IAAII,SAAoC;AACxC,IAAA,IAAIC,KAAwB;IAE5B,IAAI;MACF,IAAIN,GAAG,KAAK,KAAK,EAAE;AACjB;AACR;AACA;QACQzB,OAAO,KAAK,EAAE;QACdA,OAAO,CAACgC,MAAM,GAAG,OAAO;AAC1B,MAAA;AAEA,MAAA,MAAMjH,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC0G,GAAG,EAAEC,IAAI,EAAE1B,OAAO,CAAC;AAEtD8B,MAAAA,SAAS,GAAG1F,cAAc,CAACrB,MAAM,CAAC;IACpC,CAAC,CAAC,OAAOkH,CAAC,EAAE;AACV;AACA;AACAC,MAAAA,OAAO,CAACH,KAAK,CAACE,CAAC,CAAC;AAChBF,MAAAA,KAAK,GAAGE,CAAsB;AAChC,IAAA;IAEA,OAAO;MAAEvH,IAAI;MAAEoH,SAAS;AAAEC,MAAAA;KAAO;AACnC,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AAPE,EAAA;IAAAI,CAAA,CAAA,IAAA,CAAA7C,SAAA,EAAA,SAAA,EAAA,CA5BC8C,OAAO,CAAA,CAAA;AAAA;EAoCRC,UAAUA,CAACC,IAAY,EAA0B;AAC/C,IAAA,OAAO,IAAI,CAACV,OAAO,CAAC,KAAK,EAAEU,IAAI,CAAC;AAClC,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,MACMC,UAAUA,CACdC,MAAc,EACdxC,OAUC,GAAG,EAAE,EACkB;IACxB,OAAO,IAAI,CAAC4B,OAAO,CAAC,KAAK,EAAEY,MAAM,EAAExC,OAAO,CAAC;AAC7C,EAAA;AAAC,EAAA;IAAAmC,CAAA,CAAA,IAAA,CAAA7C,SAAA,EAAA,YAAA,EAAA,CAhBA8C,OAAO,CAAA,CAAA;AAAA;AAmBRK,EAAAA,SAASA,CACPD,MAAc,EACdxC,OAGC,EACuB;IACxB,OAAO,IAAI,CAAC4B,OAAO,CAAC,IAAI,EAAEY,MAAM,EAAExC,OAAO,CAAC;AAC5C,EAAA;AAAC,EAAA;IAAAmC,CAAA,CAAA,IAAA,CAAA7C,SAAA,EAAA,WAAA,EAAA,CATA8C,OAAO,CAAA,CAAA;AAAA;AAUV;AAEA,SAASnD,SAASA,GAAG;AACnB,EAAA,OAAO3B,UAAU;AAKnB;;;;","x_google_ignoreList":[0,1,2,3]}

package/dist/services/known-modules.js

@@ -96,13 +96,14 @@ const emberCompilationModules = {
   })
 };
 const markdownCompilationModules = {
-  'rehype-raw': () => import('../index-C-twRw93.js'),
-  'rehype-stringify': () => import('../index-C371bO_b.js'),
-  'remark-gfm': () => import('../index-Bm1Y84Cu.js'),
-  'remark-parse': () => import('../index-CDSIcg03.js'),
-  'remark-rehype': () => import('../index-CGDqu098.js'),
-  unified: () => import('../index-DMSCybEq.js'),
-  'unist-util-visit': () => import('../index-DIRpUv6Z.js')
+  // Provided directly in repl-sdk, but could be overridden
+  // 'rehype-raw': () => import('rehype-raw'),
+  // 'rehype-stringify': () => import('rehype-stringify'),
+  // 'remark-gfm': () => import('remark-gfm'),
+  // 'remark-parse': () => import('remark-parse'),
+  // 'remark-rehype': () => import('remark-rehype'),
+  // unified: () => import('unified'),
+  // 'unist-util-visit': () => import('unist-util-visit'),
 };
 
 /**