@scalar/agent-chat 0.2.2 → 0.2.5

package/dist/node_modules/.pnpm/@codemirror_language@6.11.3/node_modules/@codemirror/language/dist/index.js

@@ -1,1243 +0,0 @@
-import { Tree as T, NodeProp as w, IterMode as Te, TreeFragment as O, Parser as Ce, NodeType as J } from "../../../../../@lezer_common@1.3.0/node_modules/@lezer/common/dist/index.js";
-import { Facet as b, Prec as Ae, EditorState as D, StateField as V, RangeSetBuilder as le, combineConfig as ae, StateEffect as z, countColumn as Pe, RangeSet as De } from "../../../../../@codemirror_state@6.5.2/node_modules/@codemirror/state/dist/index.js";
-import { EditorView as y, ViewPlugin as K, gutter as Ie, Decoration as p, GutterMarker as Oe, logException as Me, WidgetType as ce, Direction as Y } from "../../../../../@codemirror_view@6.38.6/node_modules/@codemirror/view/dist/index.js";
-import { tagHighlighter as Be, tags as u, highlightTree as Ne, styleTags as Ee } from "../../../../../@lezer_highlight@1.2.3/node_modules/@lezer/highlight/dist/index.js";
-import { StyleModule as Z } from "../../../../../style-mod@4.1.3/node_modules/style-mod/src/style-mod.js";
-var F;
-const C = /* @__PURE__ */ new w();
-function Fe(n) {
-  return b.define({
-    combine: n ? (e) => e.concat(n) : void 0
-  });
-}
-const Le = /* @__PURE__ */ new w();
-class g {
-  /**
-  Construct a language object. If you need to invoke this
-  directly, first define a data facet with
-  [`defineLanguageFacet`](https://codemirror.net/6/docs/ref/#language.defineLanguageFacet), and then
-  configure your parser to [attach](https://codemirror.net/6/docs/ref/#language.languageDataProp) it
-  to the language's outer syntax node.
-  */
-  constructor(e, t, r = [], i = "") {
-    this.data = e, this.name = i, D.prototype.hasOwnProperty("tree") || Object.defineProperty(D.prototype, "tree", { get() {
-      return k(this);
-    } }), this.parser = t, this.extension = [
-      v.of(this),
-      D.languageData.of((s, o, a) => {
-        let l = _(s, o, a), c = l.type.prop(C);
-        if (!c)
-          return [];
-        let f = s.facet(c), h = l.type.prop(Le);
-        if (h) {
-          let m = l.resolve(o - l.from, a);
-          for (let d of h)
-            if (d.test(m, s)) {
-              let x = s.facet(d.facet);
-              return d.type == "replace" ? x : x.concat(f);
-            }
-        }
-        return f;
-      })
-    ].concat(r);
-  }
-  /**
-  Query whether this language is active at the given position.
-  */
-  isActiveAt(e, t, r = -1) {
-    return _(e, t, r).type.prop(C) == this.data;
-  }
-  /**
-  Find the document regions that were parsed using this language.
-  The returned regions will _include_ any nested languages rooted
-  in this language, when those exist.
-  */
-  findRegions(e) {
-    let t = e.facet(v);
-    if (t?.data == this.data)
-      return [{ from: 0, to: e.doc.length }];
-    if (!t || !t.allowsNesting)
-      return [];
-    let r = [], i = (s, o) => {
-      if (s.prop(C) == this.data) {
-        r.push({ from: o, to: o + s.length });
-        return;
-      }
-      let a = s.prop(w.mounted);
-      if (a) {
-        if (a.tree.prop(C) == this.data) {
-          if (a.overlay)
-            for (let l of a.overlay)
-              r.push({ from: l.from + o, to: l.to + o });
-          else
-            r.push({ from: o, to: o + s.length });
-          return;
-        } else if (a.overlay) {
-          let l = r.length;
-          if (i(a.tree, a.overlay[0].from + o), r.length > l)
-            return;
-        }
-      }
-      for (let l = 0; l < s.children.length; l++) {
-        let c = s.children[l];
-        c instanceof T && i(c, s.positions[l] + o);
-      }
-    };
-    return i(k(e), 0), r;
-  }
-  /**
-  Indicates whether this language allows nested languages. The
-  default implementation returns true.
-  */
-  get allowsNesting() {
-    return !0;
-  }
-}
-g.setState = /* @__PURE__ */ z.define();
-function _(n, e, t) {
-  let r = n.facet(v), i = k(n).topNode;
-  if (!r || r.allowsNesting)
-    for (let s = i; s; s = s.enter(e, t, Te.ExcludeBuffers))
-      s.type.isTop && (i = s);
-  return i;
-}
-class U extends g {
-  constructor(e, t, r) {
-    super(e, t, [], r), this.parser = t;
-  }
-  /**
-  Define a language from a parser.
-  */
-  static define(e) {
-    let t = Fe(e.languageData);
-    return new U(t, e.parser.configure({
-      props: [C.add((r) => r.isTop ? t : void 0)]
-    }), e.name);
-  }
-  /**
-  Create a new instance of this language with a reconfigured
-  version of its parser and optionally a new name.
-  */
-  configure(e, t) {
-    return new U(this.data, this.parser.configure(e), t || this.name);
-  }
-  get allowsNesting() {
-    return this.parser.hasWrappers();
-  }
-}
-function k(n) {
-  let e = n.field(g.state, !1);
-  return e ? e.tree : T.empty;
-}
-class He {
-  /**
-  Create an input object for the given document.
-  */
-  constructor(e) {
-    this.doc = e, this.cursorPos = 0, this.string = "", this.cursor = e.iter();
-  }
-  get length() {
-    return this.doc.length;
-  }
-  syncTo(e) {
-    return this.string = this.cursor.next(e - this.cursorPos).value, this.cursorPos = e + this.string.length, this.cursorPos - this.string.length;
-  }
-  chunk(e) {
-    return this.syncTo(e), this.string;
-  }
-  get lineChunks() {
-    return !0;
-  }
-  read(e, t) {
-    let r = this.cursorPos - this.string.length;
-    return e < r || t >= this.cursorPos ? this.doc.sliceString(e, t) : this.string.slice(e - r, t - r);
-  }
-}
-let P = null;
-class M {
-  constructor(e, t, r = [], i, s, o, a, l) {
-    this.parser = e, this.state = t, this.fragments = r, this.tree = i, this.treeLen = s, this.viewport = o, this.skipped = a, this.scheduleOn = l, this.parse = null, this.tempSkipped = [];
-  }
-  /**
-  @internal
-  */
-  static create(e, t, r) {
-    return new M(e, t, [], T.empty, 0, r, [], null);
-  }
-  startParse() {
-    return this.parser.startParse(new He(this.state.doc), this.fragments);
-  }
-  /**
-  @internal
-  */
-  work(e, t) {
-    return t != null && t >= this.state.doc.length && (t = void 0), this.tree != T.empty && this.isDone(t ?? this.state.doc.length) ? (this.takeTree(), !0) : this.withContext(() => {
-      var r;
-      if (typeof e == "number") {
-        let i = Date.now() + e;
-        e = () => Date.now() > i;
-      }
-      for (this.parse || (this.parse = this.startParse()), t != null && (this.parse.stoppedAt == null || this.parse.stoppedAt > t) && t < this.state.doc.length && this.parse.stopAt(t); ; ) {
-        let i = this.parse.advance();
-        if (i)
-          if (this.fragments = this.withoutTempSkipped(O.addTree(i, this.fragments, this.parse.stoppedAt != null)), this.treeLen = (r = this.parse.stoppedAt) !== null && r !== void 0 ? r : this.state.doc.length, this.tree = i, this.parse = null, this.treeLen < (t ?? this.state.doc.length))
-            this.parse = this.startParse();
-          else
-            return !0;
-        if (e())
-          return !1;
-      }
-    });
-  }
-  /**
-  @internal
-  */
-  takeTree() {
-    let e, t;
-    this.parse && (e = this.parse.parsedPos) >= this.treeLen && ((this.parse.stoppedAt == null || this.parse.stoppedAt > e) && this.parse.stopAt(e), this.withContext(() => {
-      for (; !(t = this.parse.advance()); )
-        ;
-    }), this.treeLen = e, this.tree = t, this.fragments = this.withoutTempSkipped(O.addTree(this.tree, this.fragments, !0)), this.parse = null);
-  }
-  withContext(e) {
-    let t = P;
-    P = this;
-    try {
-      return e();
-    } finally {
-      P = t;
-    }
-  }
-  withoutTempSkipped(e) {
-    for (let t; t = this.tempSkipped.pop(); )
-      e = ee(e, t.from, t.to);
-    return e;
-  }
-  /**
-  @internal
-  */
-  changes(e, t) {
-    let { fragments: r, tree: i, treeLen: s, viewport: o, skipped: a } = this;
-    if (this.takeTree(), !e.empty) {
-      let l = [];
-      if (e.iterChangedRanges((c, f, h, m) => l.push({ fromA: c, toA: f, fromB: h, toB: m })), r = O.applyChanges(r, l), i = T.empty, s = 0, o = { from: e.mapPos(o.from, -1), to: e.mapPos(o.to, 1) }, this.skipped.length) {
-        a = [];
-        for (let c of this.skipped) {
-          let f = e.mapPos(c.from, 1), h = e.mapPos(c.to, -1);
-          f < h && a.push({ from: f, to: h });
-        }
-      }
-    }
-    return new M(this.parser, t, r, i, s, o, a, this.scheduleOn);
-  }
-  /**
-  @internal
-  */
-  updateViewport(e) {
-    if (this.viewport.from == e.from && this.viewport.to == e.to)
-      return !1;
-    this.viewport = e;
-    let t = this.skipped.length;
-    for (let r = 0; r < this.skipped.length; r++) {
-      let { from: i, to: s } = this.skipped[r];
-      i < e.to && s > e.from && (this.fragments = ee(this.fragments, i, s), this.skipped.splice(r--, 1));
-    }
-    return this.skipped.length >= t ? !1 : (this.reset(), !0);
-  }
-  /**
-  @internal
-  */
-  reset() {
-    this.parse && (this.takeTree(), this.parse = null);
-  }
-  /**
-  Notify the parse scheduler that the given region was skipped
-  because it wasn't in view, and the parse should be restarted
-  when it comes into view.
-  */
-  skipUntilInView(e, t) {
-    this.skipped.push({ from: e, to: t });
-  }
-  /**
-  Returns a parser intended to be used as placeholder when
-  asynchronously loading a nested parser. It'll skip its input and
-  mark it as not-really-parsed, so that the next update will parse
-  it again.
-  
-  When `until` is given, a reparse will be scheduled when that
-  promise resolves.
-  */
-  static getSkippingParser(e) {
-    return new class extends Ce {
-      createParse(t, r, i) {
-        let s = i[0].from, o = i[i.length - 1].to;
-        return {
-          parsedPos: s,
-          advance() {
-            let l = P;
-            if (l) {
-              for (let c of i)
-                l.tempSkipped.push(c);
-              e && (l.scheduleOn = l.scheduleOn ? Promise.all([l.scheduleOn, e]) : e);
-            }
-            return this.parsedPos = o, new T(J.none, [], [], o - s);
-          },
-          stoppedAt: null,
-          stopAt() {
-          }
-        };
-      }
-    }();
-  }
-  /**
-  @internal
-  */
-  isDone(e) {
-    e = Math.min(e, this.state.doc.length);
-    let t = this.fragments;
-    return this.treeLen >= e && t.length && t[0].from == 0 && t[0].to >= e;
-  }
-  /**
-  Get the context for the current parse, or `null` if no editor
-  parse is in progress.
-  */
-  static get() {
-    return P;
-  }
-}
-function ee(n, e, t) {
-  return O.applyChanges(n, [{ fromA: e, toA: t, fromB: e, toB: t }]);
-}
-class A {
-  constructor(e) {
-    this.context = e, this.tree = e.tree;
-  }
-  apply(e) {
-    if (!e.docChanged && this.tree == this.context.tree)
-      return this;
-    let t = this.context.changes(e.changes, e.state), r = this.context.treeLen == e.startState.doc.length ? void 0 : Math.max(e.changes.mapPos(this.context.treeLen), t.viewport.to);
-    return t.work(20, r) || t.takeTree(), new A(t);
-  }
-  static init(e) {
-    let t = Math.min(3e3, e.doc.length), r = M.create(e.facet(v).parser, e, { from: 0, to: t });
-    return r.work(20, t) || r.takeTree(), new A(r);
-  }
-}
-g.state = /* @__PURE__ */ V.define({
-  create: A.init,
-  update(n, e) {
-    for (let t of e.effects)
-      if (t.is(g.setState))
-        return t.value;
-    return e.startState.facet(v) != e.state.facet(v) ? A.init(e.state) : n.apply(e);
-  }
-});
-let fe = (n) => {
-  let e = setTimeout(
-    () => n(),
-    500
-    /* Work.MaxPause */
-  );
-  return () => clearTimeout(e);
-};
-typeof requestIdleCallback < "u" && (fe = (n) => {
-  let e = -1, t = setTimeout(
-    () => {
-      e = requestIdleCallback(n, {
-        timeout: 400
-        /* Work.MinPause */
-      });
-    },
-    100
-    /* Work.MinPause */
-  );
-  return () => e < 0 ? clearTimeout(t) : cancelIdleCallback(e);
-});
-const L = typeof navigator < "u" && (!((F = navigator.scheduling) === null || F === void 0) && F.isInputPending) ? () => navigator.scheduling.isInputPending() : null, We = /* @__PURE__ */ K.fromClass(class {
-  constructor(e) {
-    this.view = e, this.working = null, this.workScheduled = 0, this.chunkEnd = -1, this.chunkBudget = -1, this.work = this.work.bind(this), this.scheduleWork();
-  }
-  update(e) {
-    let t = this.view.state.field(g.state).context;
-    (t.updateViewport(e.view.viewport) || this.view.viewport.to > t.treeLen) && this.scheduleWork(), (e.docChanged || e.selectionSet) && (this.view.hasFocus && (this.chunkBudget += 50), this.scheduleWork()), this.checkAsyncSchedule(t);
-  }
-  scheduleWork() {
-    if (this.working)
-      return;
-    let { state: e } = this.view, t = e.field(g.state);
-    (t.tree != t.context.tree || !t.context.isDone(e.doc.length)) && (this.working = fe(this.work));
-  }
-  work(e) {
-    this.working = null;
-    let t = Date.now();
-    if (this.chunkEnd < t && (this.chunkEnd < 0 || this.view.hasFocus) && (this.chunkEnd = t + 3e4, this.chunkBudget = 3e3), this.chunkBudget <= 0)
-      return;
-    let { state: r, viewport: { to: i } } = this.view, s = r.field(g.state);
-    if (s.tree == s.context.tree && s.context.isDone(
-      i + 1e5
-      /* Work.MaxParseAhead */
-    ))
-      return;
-    let o = Date.now() + Math.min(this.chunkBudget, 100, e && !L ? Math.max(25, e.timeRemaining() - 5) : 1e9), a = s.context.treeLen < i && r.doc.length > i + 1e3, l = s.context.work(() => L && L() || Date.now() > o, i + (a ? 0 : 1e5));
-    this.chunkBudget -= Date.now() - t, (l || this.chunkBudget <= 0) && (s.context.takeTree(), this.view.dispatch({ effects: g.setState.of(new A(s.context)) })), this.chunkBudget > 0 && !(l && !a) && this.scheduleWork(), this.checkAsyncSchedule(s.context);
-  }
-  checkAsyncSchedule(e) {
-    e.scheduleOn && (this.workScheduled++, e.scheduleOn.then(() => this.scheduleWork()).catch((t) => Me(this.view.state, t)).then(() => this.workScheduled--), e.scheduleOn = null);
-  }
-  destroy() {
-    this.working && this.working();
-  }
-  isWorking() {
-    return !!(this.working || this.workScheduled > 0);
-  }
-}, {
-  eventHandlers: { focus() {
-    this.scheduleWork();
-  } }
-}), v = /* @__PURE__ */ b.define({
-  combine(n) {
-    return n.length ? n[0] : null;
-  },
-  enables: (n) => [
-    g.state,
-    We,
-    y.contentAttributes.compute([n], (e) => {
-      let t = e.facet(n);
-      return t && t.name ? { "data-language": t.name } : {};
-    })
-  ]
-});
-class Pt {
-  /**
-  Create a language support object.
-  */
-  constructor(e, t = []) {
-    this.language = e, this.support = t, this.extension = [e, t];
-  }
-}
-const Re = /* @__PURE__ */ b.define(), ue = /* @__PURE__ */ b.define({
-  combine: (n) => {
-    if (!n.length)
-      return "  ";
-    let e = n[0];
-    if (!e || /\S/.test(e) || Array.from(e).some((t) => t != e[0]))
-      throw new Error("Invalid indent unit: " + JSON.stringify(n[0]));
-    return e;
-  }
-});
-function Ue(n) {
-  let e = n.facet(ue);
-  return e.charCodeAt(0) == 9 ? n.tabSize * e.length : e.length;
-}
-function qe(n, e) {
-  let t = "", r = n.tabSize, i = n.facet(ue)[0];
-  if (i == "	") {
-    for (; e >= r; )
-      t += "	", e -= r;
-    i = " ";
-  }
-  for (let s = 0; s < e; s++)
-    t += i;
-  return t;
-}
-function je(n, e) {
-  n instanceof D && (n = new he(n));
-  for (let r of n.state.facet(Re)) {
-    let i = r(n, e);
-    if (i !== void 0)
-      return i;
-  }
-  let t = k(n.state);
-  return t.length >= e ? Ge(n, t, e) : null;
-}
-class he {
-  /**
-  Create an indent context.
-  */
-  constructor(e, t = {}) {
-    this.state = e, this.options = t, this.unit = Ue(e);
-  }
-  /**
-  Get a description of the line at the given position, taking
-  [simulated line
-  breaks](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)
-  into account. If there is such a break at `pos`, the `bias`
-  argument determines whether the part of the line line before or
-  after the break is used.
-  */
-  lineAt(e, t = 1) {
-    let r = this.state.doc.lineAt(e), { simulateBreak: i, simulateDoubleBreak: s } = this.options;
-    return i != null && i >= r.from && i <= r.to ? s && i == e ? { text: "", from: e } : (t < 0 ? i < e : i <= e) ? { text: r.text.slice(i - r.from), from: i } : { text: r.text.slice(0, i - r.from), from: r.from } : r;
-  }
-  /**
-  Get the text directly after `pos`, either the entire line
-  or the next 100 characters, whichever is shorter.
-  */
-  textAfterPos(e, t = 1) {
-    if (this.options.simulateDoubleBreak && e == this.options.simulateBreak)
-      return "";
-    let { text: r, from: i } = this.lineAt(e, t);
-    return r.slice(e - i, Math.min(r.length, e + 100 - i));
-  }
-  /**
-  Find the column for the given position.
-  */
-  column(e, t = 1) {
-    let { text: r, from: i } = this.lineAt(e, t), s = this.countColumn(r, e - i), o = this.options.overrideIndentation ? this.options.overrideIndentation(i) : -1;
-    return o > -1 && (s += o - this.countColumn(r, r.search(/\S|$/))), s;
-  }
-  /**
-  Find the column position (taking tabs into account) of the given
-  position in the given string.
-  */
-  countColumn(e, t = e.length) {
-    return Pe(e, this.state.tabSize, t);
-  }
-  /**
-  Find the indentation column of the line at the given point.
-  */
-  lineIndent(e, t = 1) {
-    let { text: r, from: i } = this.lineAt(e, t), s = this.options.overrideIndentation;
-    if (s) {
-      let o = s(i);
-      if (o > -1)
-        return o;
-    }
-    return this.countColumn(r, r.search(/\S|$/));
-  }
-  /**
-  Returns the [simulated line
-  break](https://codemirror.net/6/docs/ref/#language.IndentContext.constructor^options.simulateBreak)
-  for this context, if any.
-  */
-  get simulatedBreak() {
-    return this.options.simulateBreak || null;
-  }
-}
-const $e = /* @__PURE__ */ new w();
-function Ge(n, e, t) {
-  let r = e.resolveStack(t), i = e.resolveInner(t, -1).resolve(t, 0).enterUnfinishedNodesBefore(t);
-  if (i != r.node) {
-    let s = [];
-    for (let o = i; o && !(o.from < r.node.from || o.to > r.node.to || o.from == r.node.from && o.type == r.node.type); o = o.parent)
-      s.push(o);
-    for (let o = s.length - 1; o >= 0; o--)
-      r = { node: s[o], next: r };
-  }
-  return de(r, n, t);
-}
-function de(n, e, t) {
-  for (let r = n; r; r = r.next) {
-    let i = Ve(r.node);
-    if (i)
-      return i(Q.create(e, t, r));
-  }
-  return 0;
-}
-function Je(n) {
-  return n.pos == n.options.simulateBreak && n.options.simulateDoubleBreak;
-}
-function Ve(n) {
-  let e = n.type.prop($e);
-  if (e)
-    return e;
-  let t = n.firstChild, r;
-  if (t && (r = t.type.prop(w.closedBy))) {
-    let i = n.lastChild, s = i && r.indexOf(i.name) > -1;
-    return (o) => pe(o, !0, 1, void 0, s && !Je(o) ? i.from : void 0);
-  }
-  return n.parent == null ? ze : null;
-}
-function ze() {
-  return 0;
-}
-class Q extends he {
-  constructor(e, t, r) {
-    super(e.state, e.options), this.base = e, this.pos = t, this.context = r;
-  }
-  /**
-  The syntax tree node to which the indentation strategy
-  applies.
-  */
-  get node() {
-    return this.context.node;
-  }
-  /**
-  @internal
-  */
-  static create(e, t, r) {
-    return new Q(e, t, r);
-  }
-  /**
-  Get the text directly after `this.pos`, either the entire line
-  or the next 100 characters, whichever is shorter.
-  */
-  get textAfter() {
-    return this.textAfterPos(this.pos);
-  }
-  /**
-  Get the indentation at the reference line for `this.node`, which
-  is the line on which it starts, unless there is a node that is
-  _not_ a parent of this node covering the start of that line. If
-  so, the line at the start of that node is tried, again skipping
-  on if it is covered by another such node.
-  */
-  get baseIndent() {
-    return this.baseIndentFor(this.node);
-  }
-  /**
-  Get the indentation for the reference line of the given node
-  (see [`baseIndent`](https://codemirror.net/6/docs/ref/#language.TreeIndentContext.baseIndent)).
-  */
-  baseIndentFor(e) {
-    let t = this.state.doc.lineAt(e.from);
-    for (; ; ) {
-      let r = e.resolve(t.from);
-      for (; r.parent && r.parent.from == r.from; )
-        r = r.parent;
-      if (Ke(r, e))
-        break;
-      t = this.state.doc.lineAt(r.from);
-    }
-    return this.lineIndent(t.from);
-  }
-  /**
-  Continue looking for indentations in the node's parent nodes,
-  and return the result of that.
-  */
-  continue() {
-    return de(this.context.next, this.base, this.pos);
-  }
-}
-function Ke(n, e) {
-  for (let t = e; t; t = t.parent)
-    if (n == t)
-      return !0;
-  return !1;
-}
-function Qe(n) {
-  let e = n.node, t = e.childAfter(e.from), r = e.lastChild;
-  if (!t)
-    return null;
-  let i = n.options.simulateBreak, s = n.state.doc.lineAt(t.from), o = i == null || i <= s.from ? s.to : Math.min(s.to, i);
-  for (let a = t.to; ; ) {
-    let l = e.childAfter(a);
-    if (!l || l == r)
-      return null;
-    if (!l.type.isSkipped) {
-      if (l.from >= o)
-        return null;
-      let c = /^ */.exec(s.text.slice(t.to - s.from))[0].length;
-      return { from: t.from, to: t.to + c };
-    }
-    a = l.to;
-  }
-}
-function Dt({ closing: n, align: e = !0, units: t = 1 }) {
-  return (r) => pe(r, e, t, n);
-}
-function pe(n, e, t, r, i) {
-  let s = n.textAfter, o = s.match(/^\s*/)[0].length, a = r && s.slice(o, o + r.length) == r || i == n.pos + o, l = e ? Qe(n) : null;
-  return l ? a ? n.column(l.from) : n.column(l.to) : n.baseIndent + (a ? 0 : n.unit * t);
-}
-const It = (n) => n.baseIndent;
-function Ot({ except: n, units: e = 1 } = {}) {
-  return (t) => {
-    let r = n && n.test(t.textAfter);
-    return t.baseIndent + (r ? 0 : e * t.unit);
-  };
-}
-const Xe = 200;
-function Mt() {
-  return D.transactionFilter.of((n) => {
-    if (!n.docChanged || !n.isUserEvent("input.type") && !n.isUserEvent("input.complete"))
-      return n;
-    let e = n.startState.languageDataAt("indentOnInput", n.startState.selection.main.head);
-    if (!e.length)
-      return n;
-    let t = n.newDoc, { head: r } = n.newSelection.main, i = t.lineAt(r);
-    if (r > i.from + Xe)
-      return n;
-    let s = t.sliceString(i.from, r);
-    if (!e.some((c) => c.test(s)))
-      return n;
-    let { state: o } = n, a = -1, l = [];
-    for (let { head: c } of o.selection.ranges) {
-      let f = o.doc.lineAt(c);
-      if (f.from == a)
-        continue;
-      a = f.from;
-      let h = je(o, f.from);
-      if (h == null)
-        continue;
-      let m = /^\s*/.exec(f.text)[0], d = qe(o, h);
-      m != d && l.push({ from: f.from, to: f.from + m.length, insert: d });
-    }
-    return l.length ? [n, { changes: l, sequential: !0 }] : n;
-  });
-}
-const Ye = /* @__PURE__ */ b.define(), Ze = /* @__PURE__ */ new w();
-function Bt(n) {
-  let e = n.firstChild, t = n.lastChild;
-  return e && e.to < t.from ? { from: e.to, to: t.type.isError ? n.to : t.from } : null;
-}
-function _e(n, e, t) {
-  let r = k(n);
-  if (r.length < t)
-    return null;
-  let i = r.resolveStack(t, 1), s = null;
-  for (let o = i; o; o = o.next) {
-    let a = o.node;
-    if (a.to <= t || a.from > t)
-      continue;
-    if (s && a.from < e)
-      break;
-    let l = a.type.prop(Ze);
-    if (l && (a.to < r.length - 50 || r.length == n.doc.length || !et(a))) {
-      let c = l(a, n);
-      c && c.from <= t && c.from >= e && c.to > t && (s = c);
-    }
-  }
-  return s;
-}
-function et(n) {
-  let e = n.lastChild;
-  return e && e.to == n.to && e.type.isError;
-}
-function te(n, e, t) {
-  for (let r of n.facet(Ye)) {
-    let i = r(n, e, t);
-    if (i)
-      return i;
-  }
-  return _e(n, e, t);
-}
-function me(n, e) {
-  let t = e.mapPos(n.from, 1), r = e.mapPos(n.to, -1);
-  return t >= r ? void 0 : { from: t, to: r };
-}
-const ge = /* @__PURE__ */ z.define({ map: me }), X = /* @__PURE__ */ z.define({ map: me }), B = /* @__PURE__ */ V.define({
-  create() {
-    return p.none;
-  },
-  update(n, e) {
-    e.isUserEvent("delete") && e.changes.iterChangedRanges((t, r) => n = ne(n, t, r)), n = n.map(e.changes);
-    for (let t of e.effects)
-      if (t.is(ge) && !tt(n, t.value.from, t.value.to)) {
-        let { preparePlaceholder: r } = e.state.facet(ke), i = r ? p.replace({ widget: new it(r(e.state, t.value)) }) : re;
-        n = n.update({ add: [i.range(t.value.from, t.value.to)] });
-      } else t.is(X) && (n = n.update({
-        filter: (r, i) => t.value.from != r || t.value.to != i,
-        filterFrom: t.value.from,
-        filterTo: t.value.to
-      }));
-    return e.selection && (n = ne(n, e.selection.main.head)), n;
-  },
-  provide: (n) => y.decorations.from(n),
-  toJSON(n, e) {
-    let t = [];
-    return n.between(0, e.doc.length, (r, i) => {
-      t.push(r, i);
-    }), t;
-  },
-  fromJSON(n) {
-    if (!Array.isArray(n) || n.length % 2)
-      throw new RangeError("Invalid JSON for fold state");
-    let e = [];
-    for (let t = 0; t < n.length; ) {
-      let r = n[t++], i = n[t++];
-      if (typeof r != "number" || typeof i != "number")
-        throw new RangeError("Invalid JSON for fold state");
-      e.push(re.range(r, i));
-    }
-    return p.set(e, !0);
-  }
-});
-function ne(n, e, t = e) {
-  let r = !1;
-  return n.between(e, t, (i, s) => {
-    i < t && s > e && (r = !0);
-  }), r ? n.update({
-    filterFrom: e,
-    filterTo: t,
-    filter: (i, s) => i >= t || s <= e
-  }) : n;
-}
-function q(n, e, t) {
-  var r;
-  let i = null;
-  return (r = n.field(B, !1)) === null || r === void 0 || r.between(e, t, (s, o) => {
-    (!i || i.from > s) && (i = { from: s, to: o });
-  }), i;
-}
-function tt(n, e, t) {
-  let r = !1;
-  return n.between(e, e, (i, s) => {
-    i == e && s == t && (r = !0);
-  }), r;
-}
-const nt = {
-  placeholderDOM: null,
-  preparePlaceholder: null,
-  placeholderText: "…"
-}, ke = /* @__PURE__ */ b.define({
-  combine(n) {
-    return ae(n, nt);
-  }
-});
-function rt(n) {
-  return [B, st];
-}
-function we(n, e) {
-  let { state: t } = n, r = t.facet(ke), i = (o) => {
-    let a = n.lineBlockAt(n.posAtDOM(o.target)), l = q(n.state, a.from, a.to);
-    l && n.dispatch({ effects: X.of(l) }), o.preventDefault();
-  };
-  if (r.placeholderDOM)
-    return r.placeholderDOM(n, i, e);
-  let s = document.createElement("span");
-  return s.textContent = r.placeholderText, s.setAttribute("aria-label", t.phrase("folded code")), s.title = t.phrase("unfold"), s.className = "cm-foldPlaceholder", s.onclick = i, s;
-}
-const re = /* @__PURE__ */ p.replace({ widget: /* @__PURE__ */ new class extends ce {
-  toDOM(n) {
-    return we(n, null);
-  }
-}() });
-class it extends ce {
-  constructor(e) {
-    super(), this.value = e;
-  }
-  eq(e) {
-    return this.value == e.value;
-  }
-  toDOM(e) {
-    return we(e, this.value);
-  }
-}
-const ot = {
-  openText: "⌄",
-  closedText: "›",
-  markerDOM: null,
-  domEventHandlers: {},
-  foldingChanged: () => !1
-};
-class H extends Oe {
-  constructor(e, t) {
-    super(), this.config = e, this.open = t;
-  }
-  eq(e) {
-    return this.config == e.config && this.open == e.open;
-  }
-  toDOM(e) {
-    if (this.config.markerDOM)
-      return this.config.markerDOM(this.open);
-    let t = document.createElement("span");
-    return t.textContent = this.open ? this.config.openText : this.config.closedText, t.title = e.state.phrase(this.open ? "Fold line" : "Unfold line"), t;
-  }
-}
-function Nt(n = {}) {
-  let e = { ...ot, ...n }, t = new H(e, !0), r = new H(e, !1), i = K.fromClass(class {
-    constructor(o) {
-      this.from = o.viewport.from, this.markers = this.buildMarkers(o);
-    }
-    update(o) {
-      (o.docChanged || o.viewportChanged || o.startState.facet(v) != o.state.facet(v) || o.startState.field(B, !1) != o.state.field(B, !1) || k(o.startState) != k(o.state) || e.foldingChanged(o)) && (this.markers = this.buildMarkers(o.view));
-    }
-    buildMarkers(o) {
-      let a = new le();
-      for (let l of o.viewportLineBlocks) {
-        let c = q(o.state, l.from, l.to) ? r : te(o.state, l.from, l.to) ? t : null;
-        c && a.add(l.from, l.from, c);
-      }
-      return a.finish();
-    }
-  }), { domEventHandlers: s } = e;
-  return [
-    i,
-    Ie({
-      class: "cm-foldGutter",
-      markers(o) {
-        var a;
-        return ((a = o.plugin(i)) === null || a === void 0 ? void 0 : a.markers) || De.empty;
-      },
-      initialSpacer() {
-        return new H(e, !1);
-      },
-      domEventHandlers: {
-        ...s,
-        click: (o, a, l) => {
-          if (s.click && s.click(o, a, l))
-            return !0;
-          let c = q(o.state, a.from, a.to);
-          if (c)
-            return o.dispatch({ effects: X.of(c) }), !0;
-          let f = te(o.state, a.from, a.to);
-          return f ? (o.dispatch({ effects: ge.of(f) }), !0) : !1;
-        }
-      }
-    }),
-    rt()
-  ];
-}
-const st = /* @__PURE__ */ y.baseTheme({
-  ".cm-foldPlaceholder": {
-    backgroundColor: "#eee",
-    border: "1px solid #ddd",
-    color: "#888",
-    borderRadius: ".2em",
-    margin: "0 1px",
-    padding: "0 1px",
-    cursor: "pointer"
-  },
-  ".cm-foldGutter span": {
-    padding: "0 1px",
-    cursor: "pointer"
-  }
-});
-class N {
-  constructor(e, t) {
-    this.specs = e;
-    let r;
-    function i(a) {
-      let l = Z.newName();
-      return (r || (r = /* @__PURE__ */ Object.create(null)))["." + l] = a, l;
-    }
-    const s = typeof t.all == "string" ? t.all : t.all ? i(t.all) : void 0, o = t.scope;
-    this.scope = o instanceof g ? (a) => a.prop(C) == o.data : o ? (a) => a == o : void 0, this.style = Be(e.map((a) => ({
-      tag: a.tag,
-      class: a.class || i(Object.assign({}, a, { tag: null }))
-    })), {
-      all: s
-    }).style, this.module = r ? new Z(r) : null, this.themeType = t.themeType;
-  }
-  /**
-  Create a highlighter style that associates the given styles to
-  the given tags. The specs must be objects that hold a style tag
-  or array of tags in their `tag` property, and either a single
-  `class` property providing a static CSS class (for highlighter
-  that rely on external styling), or a
-  [`style-mod`](https://github.com/marijnh/style-mod#documentation)-style
-  set of CSS properties (which define the styling for those tags).
-  
-  The CSS rules created for a highlighter will be emitted in the
-  order of the spec's properties. That means that for elements that
-  have multiple tags associated with them, styles defined further
-  down in the list will have a higher CSS precedence than styles
-  defined earlier.
-  */
-  static define(e, t) {
-    return new N(e, t || {});
-  }
-}
-const j = /* @__PURE__ */ b.define(), be = /* @__PURE__ */ b.define({
-  combine(n) {
-    return n.length ? [n[0]] : null;
-  }
-});
-function W(n) {
-  let e = n.facet(j);
-  return e.length ? e : n.facet(be);
-}
-function Et(n, e) {
-  let t = [at], r;
-  return n instanceof N && (n.module && t.push(y.styleModule.of(n.module)), r = n.themeType), e?.fallback ? t.push(be.of(n)) : r ? t.push(j.computeN([y.darkTheme], (i) => i.facet(y.darkTheme) == (r == "dark") ? [n] : [])) : t.push(j.of(n)), t;
-}
-class lt {
-  constructor(e) {
-    this.markCache = /* @__PURE__ */ Object.create(null), this.tree = k(e.state), this.decorations = this.buildDeco(e, W(e.state)), this.decoratedTo = e.viewport.to;
-  }
-  update(e) {
-    let t = k(e.state), r = W(e.state), i = r != W(e.startState), { viewport: s } = e.view, o = e.changes.mapPos(this.decoratedTo, 1);
-    t.length < s.to && !i && t.type == this.tree.type && o >= s.to ? (this.decorations = this.decorations.map(e.changes), this.decoratedTo = o) : (t != this.tree || e.viewportChanged || i) && (this.tree = t, this.decorations = this.buildDeco(e.view, r), this.decoratedTo = s.to);
-  }
-  buildDeco(e, t) {
-    if (!t || !this.tree.length)
-      return p.none;
-    let r = new le();
-    for (let { from: i, to: s } of e.visibleRanges)
-      Ne(this.tree, t, (o, a, l) => {
-        r.add(o, a, this.markCache[l] || (this.markCache[l] = p.mark({ class: l })));
-      }, i, s);
-    return r.finish();
-  }
-}
-const at = /* @__PURE__ */ Ae.high(/* @__PURE__ */ K.fromClass(lt, {
-  decorations: (n) => n.decorations
-})), Ft = /* @__PURE__ */ N.define([
-  {
-    tag: u.meta,
-    color: "#404740"
-  },
-  {
-    tag: u.link,
-    textDecoration: "underline"
-  },
-  {
-    tag: u.heading,
-    textDecoration: "underline",
-    fontWeight: "bold"
-  },
-  {
-    tag: u.emphasis,
-    fontStyle: "italic"
-  },
-  {
-    tag: u.strong,
-    fontWeight: "bold"
-  },
-  {
-    tag: u.strikethrough,
-    textDecoration: "line-through"
-  },
-  {
-    tag: u.keyword,
-    color: "#708"
-  },
-  {
-    tag: [u.atom, u.bool, u.url, u.contentSeparator, u.labelName],
-    color: "#219"
-  },
-  {
-    tag: [u.literal, u.inserted],
-    color: "#164"
-  },
-  {
-    tag: [u.string, u.deleted],
-    color: "#a11"
-  },
-  {
-    tag: [u.regexp, u.escape, /* @__PURE__ */ u.special(u.string)],
-    color: "#e40"
-  },
-  {
-    tag: /* @__PURE__ */ u.definition(u.variableName),
-    color: "#00f"
-  },
-  {
-    tag: /* @__PURE__ */ u.local(u.variableName),
-    color: "#30a"
-  },
-  {
-    tag: [u.typeName, u.namespace],
-    color: "#085"
-  },
-  {
-    tag: u.className,
-    color: "#167"
-  },
-  {
-    tag: [/* @__PURE__ */ u.special(u.variableName), u.macroName],
-    color: "#256"
-  },
-  {
-    tag: /* @__PURE__ */ u.definition(u.propertyName),
-    color: "#00c"
-  },
-  {
-    tag: u.comment,
-    color: "#940"
-  },
-  {
-    tag: u.invalid,
-    color: "#f00"
-  }
-]), ct = /* @__PURE__ */ y.baseTheme({
-  "&.cm-focused .cm-matchingBracket": { backgroundColor: "#328c8252" },
-  "&.cm-focused .cm-nonmatchingBracket": { backgroundColor: "#bb555544" }
-}), ye = 1e4, ve = "()[]{}", xe = /* @__PURE__ */ b.define({
-  combine(n) {
-    return ae(n, {
-      afterCursor: !0,
-      brackets: ve,
-      maxScanDistance: ye,
-      renderMatch: ht
-    });
-  }
-}), ft = /* @__PURE__ */ p.mark({ class: "cm-matchingBracket" }), ut = /* @__PURE__ */ p.mark({ class: "cm-nonmatchingBracket" });
-function ht(n) {
-  let e = [], t = n.matched ? ft : ut;
-  return e.push(t.range(n.start.from, n.start.to)), n.end && e.push(t.range(n.end.from, n.end.to)), e;
-}
-const dt = /* @__PURE__ */ V.define({
-  create() {
-    return p.none;
-  },
-  update(n, e) {
-    if (!e.docChanged && !e.selection)
-      return n;
-    let t = [], r = e.state.facet(xe);
-    for (let i of e.state.selection.ranges) {
-      if (!i.empty)
-        continue;
-      let s = I(e.state, i.head, -1, r) || i.head > 0 && I(e.state, i.head - 1, 1, r) || r.afterCursor && (I(e.state, i.head, 1, r) || i.head < e.state.doc.length && I(e.state, i.head + 1, -1, r));
-      s && (t = t.concat(r.renderMatch(s, e.state)));
-    }
-    return p.set(t, !0);
-  },
-  provide: (n) => y.decorations.from(n)
-}), pt = [
-  dt,
-  ct
-];
-function Lt(n = {}) {
-  return [xe.of(n), pt];
-}
-const mt = /* @__PURE__ */ new w();
-function $(n, e, t) {
-  let r = n.prop(e < 0 ? w.openedBy : w.closedBy);
-  if (r)
-    return r;
-  if (n.name.length == 1) {
-    let i = t.indexOf(n.name);
-    if (i > -1 && i % 2 == (e < 0 ? 1 : 0))
-      return [t[i + e]];
-  }
-  return null;
-}
-function G(n) {
-  let e = n.type.prop(mt);
-  return e ? e(n.node) : n;
-}
-function I(n, e, t, r = {}) {
-  let i = r.maxScanDistance || ye, s = r.brackets || ve, o = k(n), a = o.resolveInner(e, t);
-  for (let l = a; l; l = l.parent) {
-    let c = $(l.type, t, s);
-    if (c && l.from < l.to) {
-      let f = G(l);
-      if (f && (t > 0 ? e >= f.from && e < f.to : e > f.from && e <= f.to))
-        return gt(n, e, t, l, f, c, s);
-    }
-  }
-  return kt(n, e, t, o, a.type, i, s);
-}
-function gt(n, e, t, r, i, s, o) {
-  let a = r.parent, l = { from: i.from, to: i.to }, c = 0, f = a?.cursor();
-  if (f && (t < 0 ? f.childBefore(r.from) : f.childAfter(r.to)))
-    do
-      if (t < 0 ? f.to <= r.from : f.from >= r.to) {
-        if (c == 0 && s.indexOf(f.type.name) > -1 && f.from < f.to) {
-          let h = G(f);
-          return { start: l, end: h ? { from: h.from, to: h.to } : void 0, matched: !0 };
-        } else if ($(f.type, t, o))
-          c++;
-        else if ($(f.type, -t, o)) {
-          if (c == 0) {
-            let h = G(f);
-            return {
-              start: l,
-              end: h && h.from < h.to ? { from: h.from, to: h.to } : void 0,
-              matched: !1
-            };
-          }
-          c--;
-        }
-      }
-    while (t < 0 ? f.prevSibling() : f.nextSibling());
-  return { start: l, matched: !1 };
-}
-function kt(n, e, t, r, i, s, o) {
-  let a = t < 0 ? n.sliceDoc(e - 1, e) : n.sliceDoc(e, e + 1), l = o.indexOf(a);
-  if (l < 0 || l % 2 == 0 != t > 0)
-    return null;
-  let c = { from: t < 0 ? e - 1 : e, to: t > 0 ? e + 1 : e }, f = n.doc.iterRange(e, t > 0 ? n.doc.length : 0), h = 0;
-  for (let m = 0; !f.next().done && m <= s; ) {
-    let d = f.value;
-    t < 0 && (m += d.length);
-    let x = e + m * t;
-    for (let S = t > 0 ? 0 : d.length - 1, Se = t > 0 ? d.length : -1; S != Se; S += t) {
-      let E = o.indexOf(d[S]);
-      if (!(E < 0 || r.resolveInner(x + S, 1).type != i))
-        if (E % 2 == 0 == t > 0)
-          h++;
-        else {
-          if (h == 1)
-            return { start: c, end: { from: x + S, to: x + S + 1 }, matched: E >> 1 == l >> 1 };
-          h--;
-        }
-    }
-    t > 0 && (m += d.length);
-  }
-  return f.done ? { start: c, matched: !1 } : null;
-}
-const wt = /* @__PURE__ */ Object.create(null), ie = [J.none], oe = [], se = /* @__PURE__ */ Object.create(null), bt = /* @__PURE__ */ Object.create(null);
-for (let [n, e] of [
-  ["variable", "variableName"],
-  ["variable-2", "variableName.special"],
-  ["string-2", "string.special"],
-  ["def", "variableName.definition"],
-  ["tag", "tagName"],
-  ["attribute", "attributeName"],
-  ["type", "typeName"],
-  ["builtin", "variableName.standard"],
-  ["qualifier", "modifier"],
-  ["error", "invalid"],
-  ["header", "heading"],
-  ["property", "propertyName"]
-])
-  bt[n] = /* @__PURE__ */ yt(wt, e);
-function R(n, e) {
-  oe.indexOf(n) > -1 || (oe.push(n), console.warn(e));
-}
-function yt(n, e) {
-  let t = [];
-  for (let a of e.split(" ")) {
-    let l = [];
-    for (let c of a.split(".")) {
-      let f = n[c] || u[c];
-      f ? typeof f == "function" ? l.length ? l = l.map(f) : R(c, `Modifier ${c} used at start of tag`) : l.length ? R(c, `Tag ${c} used as modifier`) : l = Array.isArray(f) ? f : [f] : R(c, `Unknown highlighting tag ${c}`);
-    }
-    for (let c of l)
-      t.push(c);
-  }
-  if (!t.length)
-    return 0;
-  let r = e.replace(/ /g, "_"), i = r + " " + t.map((a) => a.id), s = se[i];
-  if (s)
-    return s.id;
-  let o = se[i] = J.define({
-    id: ie.length,
-    name: r,
-    props: [Ee({ [r]: t })]
-  });
-  return ie.push(o), o.id;
-}
-Y.RTL, Y.LTR;
-export {
-  He as DocInput,
-  N as HighlightStyle,
-  he as IndentContext,
-  U as LRLanguage,
-  g as Language,
-  Pt as LanguageSupport,
-  M as ParseContext,
-  Q as TreeIndentContext,
-  Lt as bracketMatching,
-  mt as bracketMatchingHandle,
-  rt as codeFolding,
-  Ot as continuedIndent,
-  Ft as defaultHighlightStyle,
-  Fe as defineLanguageFacet,
-  Dt as delimitedIndent,
-  It as flatIndent,
-  ge as foldEffect,
-  Nt as foldGutter,
-  Bt as foldInside,
-  Ze as foldNodeProp,
-  Ye as foldService,
-  B as foldState,
-  te as foldable,
-  Ue as getIndentUnit,
-  je as getIndentation,
-  $e as indentNodeProp,
-  Mt as indentOnInput,
-  Re as indentService,
-  qe as indentString,
-  ue as indentUnit,
-  v as language,
-  C as languageDataProp,
-  I as matchBrackets,
-  Le as sublanguageProp,
-  Et as syntaxHighlighting,
-  k as syntaxTree,
-  X as unfoldEffect
-};