@gsc-basic/components 1.0.1 → 1.0.3

package/dist/es/node_modules/@codemirror/state/dist/index.js

@@ -1,4 +1,4 @@
-import { findClusterBreak as Le } from "../../../@marijn/find-cluster-break/src/index.js";
+import { findClusterBreak as Ve } from "../../../@marijn/find-cluster-break/src/index.js";
 class x {
   /**
   Get the line description around the given position.
@@ -85,7 +85,7 @@ class x {
   iterator will run in reverse.
   */
   iterRange(e, t = this.length) {
-    return new Se(this, e, t);
+    return new Ie(this, e, t);
   }
   /**
   Return a cursor that iterates over the given range of lines,
@@ -103,7 +103,7 @@ class x {
       let i = this.line(e).from;
       n = this.iterRange(i, Math.max(i, t == this.lines + 1 ? this.length : t <= 1 ? 0 : this.line(t - 1).to));
     }
-    return new Ie(n);
+    return new Pe(n);
   }
   /**
   Return the document as a string, using newline characters to
@@ -135,7 +135,7 @@ class x {
   }
 }
 class m extends x {
-  constructor(e, t = Ve(e)) {
+  constructor(e, t = Ne(e)) {
     super(), this.text = e, this.length = t;
   }
   get lines() {
@@ -148,12 +148,12 @@ class m extends x {
     for (let s = 0; ; s++) {
       let r = this.text[s], h = i + r.length;
       if ((t ? n : h) >= e)
-        return new Ne(i, h, n, r);
+        return new De(i, h, n, r);
       i = h + 1, n++;
     }
   }
   decompose(e, t, n, i) {
-    let s = e <= 0 && t >= this.length ? this : new m(we(this.text, e, t), Math.min(t, this.length) - Math.max(0, e));
+    let s = e <= 0 && t >= this.length ? this : new m(ve(this.text, e, t), Math.min(t, this.length) - Math.max(0, e));
     if (i & 1) {
       let r = n.pop(), h = Q(s.text, r.text.slice(), 0, s.length);
       if (h.length <= 32)
@@ -169,7 +169,7 @@ class m extends x {
     if (!(n instanceof m))
       return super.replace(e, t, n);
     [e, t] = J(this, e, t);
-    let i = Q(this.text, Q(n.text, we(this.text, 0, e)), t), s = this.length + n.length - (t - e);
+    let i = Q(this.text, Q(n.text, ve(this.text, 0, e)), t), s = this.length + n.length - (t - e);
     return i.length <= 32 ? new m(i, s) : O.from(m.split(i, []), s);
   }
   sliceString(e, t = this.length, n = `
@@ -227,8 +227,8 @@ class O extends x {
         if (e >= s && t <= h) {
           let o = r.replace(e - s, t - s, n), a = this.lines - r.lines + o.lines;
           if (o.lines < a >> 4 && o.lines > a >> 6) {
-            let f = this.children.slice();
-            return f[i] = o, new O(f, this.length - (t - e) + n.length);
+            let u = this.children.slice();
+            return u[i] = o, new O(u, this.length - (t - e) + n.length);
           }
           return super.replace(s, h, o);
         }
@@ -265,36 +265,36 @@ class O extends x {
   }
   static from(e, t = e.reduce((n, i) => n + i.length + 1, -1)) {
     let n = 0;
-    for (let d of e)
-      n += d.lines;
+    for (let c of e)
+      n += c.lines;
     if (n < 32) {
-      let d = [];
-      for (let p of e)
-        p.flatten(d);
-      return new m(d, t);
+      let c = [];
+      for (let g of e)
+        g.flatten(c);
+      return new m(c, t);
     }
     let i = Math.max(
       32,
       n >> 5
       /* Tree.BranchShift */
-    ), s = i << 1, r = i >> 1, h = [], o = 0, a = -1, f = [];
-    function u(d) {
-      let p;
-      if (d.lines > s && d instanceof O)
-        for (let E of d.children)
-          u(E);
-      else d.lines > r && (o > r || !o) ? (c(), h.push(d)) : d instanceof m && o && (p = f[f.length - 1]) instanceof m && d.lines + p.lines <= 32 ? (o += d.lines, a += d.length + 1, f[f.length - 1] = new m(p.text.concat(d.text), p.length + 1 + d.length)) : (o + d.lines > i && c(), o += d.lines, a += d.length + 1, f.push(d));
+    ), s = i << 1, r = i >> 1, h = [], o = 0, a = -1, u = [];
+    function f(c) {
+      let g;
+      if (c.lines > s && c instanceof O)
+        for (let E of c.children)
+          f(E);
+      else c.lines > r && (o > r || !o) ? (d(), h.push(c)) : c instanceof m && o && (g = u[u.length - 1]) instanceof m && c.lines + g.lines <= 32 ? (o += c.lines, a += c.length + 1, u[u.length - 1] = new m(g.text.concat(c.text), g.length + 1 + c.length)) : (o + c.lines > i && d(), o += c.lines, a += c.length + 1, u.push(c));
     }
-    function c() {
-      o != 0 && (h.push(f.length == 1 ? f[0] : O.from(f, a)), a = -1, o = f.length = 0);
+    function d() {
+      o != 0 && (h.push(u.length == 1 ? u[0] : O.from(u, a)), a = -1, o = u.length = 0);
     }
-    for (let d of e)
-      u(d);
-    return c(), h.length == 1 ? h[0] : new O(h, t);
+    for (let c of e)
+      f(c);
+    return d(), h.length == 1 ? h[0] : new O(h, t);
   }
 }
 x.empty = /* @__PURE__ */ new m([""], 0);
-function Ve(l) {
+function Ne(l) {
   let e = -1;
   for (let t of l)
     e += t.length + 1;
@@ -307,7 +307,7 @@ function Q(l, e, t = 0, n = 1e9) {
   }
   return e;
 }
-function we(l, e, t) {
+function ve(l, e, t) {
   return Q(l, [""], e, t);
 }
 class D {
@@ -341,7 +341,7 @@ class D {
     return e < 0 && (this.nextInner(-e, -this.dir), e = this.value.length), this.nextInner(e, this.dir);
   }
 }
-class Se {
+class Ie {
   constructor(e, t, n) {
     this.value = "", this.done = !1, this.cursor = new D(e, t > n ? -1 : 1), this.pos = t > n ? e.length : 0, this.from = Math.min(t, n), this.to = Math.max(t, n);
   }
@@ -361,7 +361,7 @@ class Se {
     return this.cursor.lineBreak && this.value != "";
   }
 }
-class Ie {
+class Pe {
   constructor(e) {
     this.inner = e, this.afterBreak = !0, this.value = "", this.done = !1;
   }
@@ -375,10 +375,10 @@ class Ie {
 }
 typeof Symbol < "u" && (x.prototype[Symbol.iterator] = function() {
   return this.iter();
-}, D.prototype[Symbol.iterator] = Se.prototype[Symbol.iterator] = Ie.prototype[Symbol.iterator] = function() {
+}, D.prototype[Symbol.iterator] = Ie.prototype[Symbol.iterator] = Pe.prototype[Symbol.iterator] = function() {
   return this;
 });
-class Ne {
+class De {
   /**
   @internal
   */
@@ -396,25 +396,25 @@ function J(l, e, t) {
   return e = Math.max(0, Math.min(l.length, e)), [e, Math.max(e, Math.min(l.length, t))];
 }
 function Y(l, e, t = !0, n = !0) {
-  return Le(l, e, t, n);
+  return Ve(l, e, t, n);
 }
-function De(l) {
+function $e(l) {
   return l >= 56320 && l < 57344;
 }
-function $e(l) {
+function ze(l) {
   return l >= 55296 && l < 56320;
 }
-function et(l, e) {
+function tt(l, e) {
   let t = l.charCodeAt(e);
-  if (!$e(t) || e + 1 == l.length)
+  if (!ze(t) || e + 1 == l.length)
     return t;
   let n = l.charCodeAt(e + 1);
-  return De(n) ? (t - 55296 << 10) + (n - 56320) + 65536 : t;
+  return $e(n) ? (t - 55296 << 10) + (n - 56320) + 65536 : t;
 }
-function tt(l) {
+function nt(l) {
   return l <= 65535 ? String.fromCharCode(l) : (l -= 65536, String.fromCharCode((l >> 10) + 55296, (l & 1023) + 56320));
 }
-function nt(l) {
+function it(l) {
   return l < 65536 ? 1 : 2;
 }
 const se = /\r\n?|\n/;
@@ -502,7 +502,7 @@ class C {
   match the length before `other`.
   */
   composeDesc(e) {
-    return this.empty ? e : e.empty ? this : Pe(this, e);
+    return this.empty ? e : e.empty ? this : Ae(this, e);
   }
   /**
   Map this description, which should start with the same document
@@ -625,7 +625,7 @@ class y extends C {
   returned value will represent the change `docA` → `docC`.
   */
   compose(e) {
-    return this.empty ? e : e.empty ? this : Pe(this, e, !0);
+    return this.empty ? e : e.empty ? this : Ae(this, e, !0);
   }
   /**
   Given another change set starting in the same document, maps this
@@ -666,23 +666,23 @@ class y extends C {
   @internal
   */
   filter(e) {
-    let t = [], n = [], i = [], s = new q(this);
+    let t = [], n = [], i = [], s = new z(this);
     e: for (let r = 0, h = 0; ; ) {
       let o = r == e.length ? 1e9 : e[r++];
       for (; h < o || h == o && s.len == 0; ) {
         if (s.done)
           break e;
-        let f = Math.min(s.len, o - h);
-        k(i, f, -1);
-        let u = s.ins == -1 ? -1 : s.off == 0 ? s.ins : 0;
-        k(t, f, u), u > 0 && b(n, t, s.text), s.forward(f), h += f;
+        let u = Math.min(s.len, o - h);
+        k(i, u, -1);
+        let f = s.ins == -1 ? -1 : s.off == 0 ? s.ins : 0;
+        k(t, u, f), f > 0 && b(n, t, s.text), s.forward(u), h += u;
       }
       let a = e[r++];
       for (; h < a; ) {
         if (s.done)
           break e;
-        let f = Math.min(s.len, a - h);
-        k(t, f, -1), k(i, f, s.ins == -1 ? -1 : s.off == 0 ? s.ins : 0), s.forward(f), h += f;
+        let u = Math.min(s.len, a - h);
+        k(t, u, -1), k(i, u, s.ins == -1 ? -1 : s.off == 0 ? s.ins : 0), s.forward(u), h += u;
       }
     }
     return {
@@ -707,29 +707,29 @@ class y extends C {
   */
   static of(e, t, n) {
     let i = [], s = [], r = 0, h = null;
-    function o(f = !1) {
-      if (!f && !i.length)
+    function o(u = !1) {
+      if (!u && !i.length)
         return;
       r < t && k(i, t - r, -1);
-      let u = new y(i, s);
-      h = h ? h.compose(u.map(h)) : u, i = [], s = [], r = 0;
+      let f = new y(i, s);
+      h = h ? h.compose(f.map(h)) : f, i = [], s = [], r = 0;
     }
-    function a(f) {
-      if (Array.isArray(f))
-        for (let u of f)
-          a(u);
-      else if (f instanceof y) {
-        if (f.length != t)
-          throw new RangeError(`Mismatched change set length (got ${f.length}, expected ${t})`);
-        o(), h = h ? h.compose(f.map(h)) : f;
+    function a(u) {
+      if (Array.isArray(u))
+        for (let f of u)
+          a(f);
+      else if (u instanceof y) {
+        if (u.length != t)
+          throw new RangeError(`Mismatched change set length (got ${u.length}, expected ${t})`);
+        o(), h = h ? h.compose(u.map(h)) : u;
       } else {
-        let { from: u, to: c = u, insert: d } = f;
-        if (u > c || u < 0 || c > t)
-          throw new RangeError(`Invalid change range ${u} to ${c} (in doc of length ${t})`);
-        let p = d ? typeof d == "string" ? x.of(d.split(n || se)) : d : x.empty, E = p.length;
-        if (u == c && E == 0)
+        let { from: f, to: d = f, insert: c } = u;
+        if (f > d || f < 0 || d > t)
+          throw new RangeError(`Invalid change range ${f} to ${d} (in doc of length ${t})`);
+        let g = c ? typeof c == "string" ? x.of(c.split(n || se)) : c : x.empty, E = g.length;
+        if (f == d && E == 0)
           return;
-        u < r && o(), u > r && k(i, u - r, -1), k(i, c - u, E), b(s, i, p), r = c;
+        f < r && o(), f > r && k(i, f - r, -1), k(i, d - f, E), b(s, i, g), r = d;
       }
     }
     return a(e), o(!h), h;
@@ -798,15 +798,15 @@ function re(l, e, t) {
     if (o < 0)
       i += h, s += h;
     else {
-      let a = i, f = s, u = x.empty;
-      for (; a += h, f += o, o && n && (u = u.append(n[r - 2 >> 1])), !(t || r == l.sections.length || l.sections[r + 1] < 0); )
+      let a = i, u = s, f = x.empty;
+      for (; a += h, u += o, o && n && (f = f.append(n[r - 2 >> 1])), !(t || r == l.sections.length || l.sections[r + 1] < 0); )
         h = l.sections[r++], o = l.sections[r++];
-      e(i, a, s, f, u), i = a, s = f;
+      e(i, a, s, u, f), i = a, s = u;
     }
   }
 }
 function le(l, e, t, n = !1) {
-  let i = [], s = n ? [] : null, r = new q(l), h = new q(e);
+  let i = [], s = n ? [] : null, r = new z(l), h = new z(e);
   for (let o = -1; ; ) {
     if (r.done && h.len || h.done && r.len)
       throw new Error("Mismatched change set lengths");
@@ -816,21 +816,21 @@ function le(l, e, t, n = !1) {
     } else if (h.ins >= 0 && (r.ins < 0 || o == r.i || r.off == 0 && (h.len < r.len || h.len == r.len && !t))) {
       let a = h.len;
       for (k(i, h.ins, -1); a; ) {
-        let f = Math.min(r.len, a);
-        r.ins >= 0 && o < r.i && r.len <= f && (k(i, 0, r.ins), s && b(s, i, r.text), o = r.i), r.forward(f), a -= f;
+        let u = Math.min(r.len, a);
+        r.ins >= 0 && o < r.i && r.len <= u && (k(i, 0, r.ins), s && b(s, i, r.text), o = r.i), r.forward(u), a -= u;
       }
       h.next();
     } else if (r.ins >= 0) {
-      let a = 0, f = r.len;
-      for (; f; )
+      let a = 0, u = r.len;
+      for (; u; )
         if (h.ins == -1) {
-          let u = Math.min(f, h.len);
-          a += u, f -= u, h.forward(u);
-        } else if (h.ins == 0 && h.len < f)
-          f -= h.len, h.next();
+          let f = Math.min(u, h.len);
+          a += f, u -= f, h.forward(f);
+        } else if (h.ins == 0 && h.len < u)
+          u -= h.len, h.next();
         else
           break;
-      k(i, a, o < r.i ? r.ins : 0), s && o < r.i && b(s, i, r.text), o = r.i, r.forward(r.len - f);
+      k(i, a, o < r.i ? r.ins : 0), s && o < r.i && b(s, i, r.text), o = r.i, r.forward(r.len - u);
     } else {
       if (r.done && h.done)
         return s ? y.createSet(i, s) : C.create(i);
@@ -838,8 +838,8 @@ function le(l, e, t, n = !1) {
     }
   }
 }
-function Pe(l, e, t = !1) {
-  let n = [], i = t ? [] : null, s = new q(l), r = new q(e);
+function Ae(l, e, t = !1) {
+  let n = [], i = t ? [] : null, s = new z(l), r = new z(e);
   for (let h = !1; ; ) {
     if (s.done && r.done)
       return i ? y.createSet(n, i) : C.create(n);
@@ -853,15 +853,15 @@ function Pe(l, e, t = !1) {
       {
         let o = Math.min(s.len2, r.len), a = n.length;
         if (s.ins == -1) {
-          let f = r.ins == -1 ? -1 : r.off ? 0 : r.ins;
-          k(n, o, f, h), i && f && b(i, n, r.text);
+          let u = r.ins == -1 ? -1 : r.off ? 0 : r.ins;
+          k(n, o, u, h), i && u && b(i, n, r.text);
         } else r.ins == -1 ? (k(n, s.off ? 0 : s.len, o, h), i && b(i, n, s.textBit(o))) : (k(n, s.off ? 0 : s.len, r.off ? 0 : r.ins, h), i && !r.off && b(i, n, r.text));
         h = (s.ins > o || r.ins >= 0 && r.len > o) && (h || n.length > a), s.forward2(o), r.forward(o);
       }
     }
   }
 }
-class q {
+class z {
   constructor(e) {
     this.set = e, this.i = 0, this.next();
   }
@@ -954,15 +954,15 @@ class B {
   */
   extend(e, t = e) {
     if (e <= this.anchor && t >= this.anchor)
-      return g.range(e, t);
+      return p.range(e, t);
     let n = Math.abs(e - this.anchor) > Math.abs(t - this.anchor) ? e : t;
-    return g.range(this.anchor, n);
+    return p.range(this.anchor, n);
   }
   /**
   Compare this range to another range.
   */
   eq(e, t = !1) {
-    return this.anchor == e.anchor && this.head == e.head && (!t || !this.empty || this.assoc == e.assoc);
+    return this.anchor == e.anchor && this.head == e.head && this.goalColumn == e.goalColumn && (!t || !this.empty || this.assoc == e.assoc);
   }
   /**
   Return a JSON-serializable object representing the range.
@@ -977,7 +977,7 @@ class B {
   static fromJSON(e) {
     if (!e || typeof e.anchor != "number" || typeof e.head != "number")
       throw new RangeError("Invalid JSON representation for SelectionRange");
-    return g.range(e.anchor, e.head);
+    return p.range(e.anchor, e.head);
   }
   /**
   @internal
@@ -986,7 +986,7 @@ class B {
     return new B(e, t, n);
   }
 }
-class g {
+class p {
   constructor(e, t) {
     this.ranges = e, this.mainIndex = t;
   }
@@ -995,7 +995,7 @@ class g {
   position for changes.
   */
   map(e, t = -1) {
-    return e.empty ? this : g.create(this.ranges.map((n) => n.map(e, t)), this.mainIndex);
+    return e.empty ? this : p.create(this.ranges.map((n) => n.map(e, t)), this.mainIndex);
   }
   /**
   Compare this selection to another selection. By default, ranges
@@ -1024,13 +1024,13 @@ class g {
   holding only the main range from this selection.
   */
   asSingle() {
-    return this.ranges.length == 1 ? this : new g([this.main], 0);
+    return this.ranges.length == 1 ? this : new p([this.main], 0);
   }
   /**
   Extend this selection with an extra range.
   */
   addRange(e, t = !0) {
-    return g.create([e].concat(this.ranges), t ? 0 : this.mainIndex + 1);
+    return p.create([e].concat(this.ranges), t ? 0 : this.mainIndex + 1);
   }
   /**
   Replace a given range with another range, and then normalize the
@@ -1038,7 +1038,7 @@ class g {
   */
   replaceRange(e, t = this.mainIndex) {
     let n = this.ranges.slice();
-    return n[t] = e, g.create(n, this.mainIndex);
+    return n[t] = e, p.create(n, this.mainIndex);
   }
   /**
   Convert this selection to an object that can be serialized to
@@ -1053,13 +1053,13 @@ class g {
   static fromJSON(e) {
     if (!e || !Array.isArray(e.ranges) || typeof e.main != "number" || e.main >= e.ranges.length)
       throw new RangeError("Invalid JSON representation for EditorSelection");
-    return new g(e.ranges.map((t) => B.fromJSON(t)), e.main);
+    return new p(e.ranges.map((t) => B.fromJSON(t)), e.main);
   }
   /**
   Create a selection holding a single range.
   */
   static single(e, t = e) {
-    return new g([g.range(e, t)], 0);
+    return new p([p.range(e, t)], 0);
   }
   /**
   Sort and merge the given set of ranges, creating a valid
@@ -1071,10 +1071,10 @@ class g {
     for (let n = 0, i = 0; i < e.length; i++) {
       let s = e[i];
       if (s.empty ? s.from <= n : s.from < n)
-        return g.normalized(e.slice(), t);
+        return p.normalized(e.slice(), t);
       n = s.to;
     }
-    return new g(e, t);
+    return new p(e, t);
   }
   /**
   Create a cursor selection range at the given position. You can
@@ -1100,13 +1100,13 @@ class g {
       let s = e[i], r = e[i - 1];
       if (s.empty ? s.from <= r.to : s.from < r.to) {
         let h = r.from, o = Math.max(s.to, r.to);
-        i <= t && t--, e.splice(--i, 2, s.anchor > s.head ? g.range(o, h) : g.range(h, o));
+        i <= t && t--, e.splice(--i, 2, s.anchor > s.head ? p.range(o, h) : p.range(h, o));
       }
     }
-    return new g(e, t);
+    return new p(e, t);
   }
 }
-function Ae(l, e) {
+function Ee(l, e) {
   for (let t of l.ranges)
     if (t.to > e)
       throw new RangeError("Selection points outside of document");
@@ -1171,35 +1171,35 @@ class X {
   }
   dynamicSlot(e) {
     var t;
-    let n = this.value, i = this.facet.compareInput, s = this.id, r = e[s] >> 1, h = this.type == 2, o = !1, a = !1, f = [];
-    for (let u of this.dependencies)
-      u == "doc" ? o = !0 : u == "selection" ? a = !0 : (((t = e[u.id]) !== null && t !== void 0 ? t : 1) & 1) == 0 && f.push(e[u.id]);
+    let n = this.value, i = this.facet.compareInput, s = this.id, r = e[s] >> 1, h = this.type == 2, o = !1, a = !1, u = [];
+    for (let f of this.dependencies)
+      f == "doc" ? o = !0 : f == "selection" ? a = !0 : (((t = e[f.id]) !== null && t !== void 0 ? t : 1) & 1) == 0 && u.push(e[f.id]);
     return {
-      create(u) {
-        return u.values[r] = n(u), 1;
+      create(f) {
+        return f.values[r] = n(f), 1;
       },
-      update(u, c) {
-        if (o && c.docChanged || a && (c.docChanged || c.selection) || he(u, f)) {
-          let d = n(u);
-          if (h ? !ve(d, u.values[r], i) : !i(d, u.values[r]))
-            return u.values[r] = d, 1;
+      update(f, d) {
+        if (o && d.docChanged || a && (d.docChanged || d.selection) || he(f, u)) {
+          let c = n(f);
+          if (h ? !xe(c, f.values[r], i) : !i(c, f.values[r]))
+            return f.values[r] = c, 1;
         }
         return 0;
       },
-      reconfigure: (u, c) => {
-        let d, p = c.config.address[s];
-        if (p != null) {
-          let E = j(c, p);
-          if (this.dependencies.every((v) => v instanceof A ? c.facet(v) === u.facet(v) : v instanceof L ? c.field(v, !1) == u.field(v, !1) : !0) || (h ? ve(d = n(u), E, i) : i(d = n(u), E)))
-            return u.values[r] = E, 0;
+      reconfigure: (f, d) => {
+        let c, g = d.config.address[s];
+        if (g != null) {
+          let E = j(d, g);
+          if (this.dependencies.every((v) => v instanceof A ? d.facet(v) === f.facet(v) : v instanceof L ? d.field(v, !1) == f.field(v, !1) : !0) || (h ? xe(c = n(f), E, i) : i(c = n(f), E)))
+            return f.values[r] = E, 0;
         } else
-          d = n(u);
-        return u.values[r] = d, 1;
+          c = n(f);
+        return f.values[r] = c, 1;
       }
     };
   }
 }
-function ve(l, e, t) {
+function xe(l, e, t) {
   if (l.length != e.length)
     return !1;
   for (let n = 0; n < l.length; n++)
@@ -1217,13 +1217,13 @@ function qe(l, e, t) {
   let n = t.map((o) => l[o.id]), i = t.map((o) => o.type), s = n.filter((o) => !(o & 1)), r = l[e.id] >> 1;
   function h(o) {
     let a = [];
-    for (let f = 0; f < n.length; f++) {
-      let u = j(o, n[f]);
-      if (i[f] == 2)
-        for (let c of u)
-          a.push(c);
+    for (let u = 0; u < n.length; u++) {
+      let f = j(o, n[u]);
+      if (i[u] == 2)
+        for (let d of f)
+          a.push(d);
       else
-        a.push(u);
+        a.push(f);
     }
     return e.combine(a);
   }
@@ -1236,15 +1236,15 @@ function qe(l, e, t) {
     update(o, a) {
       if (!he(o, s))
         return 0;
-      let f = h(o);
-      return e.compare(f, o.values[r]) ? 0 : (o.values[r] = f, 1);
+      let u = h(o);
+      return e.compare(u, o.values[r]) ? 0 : (o.values[r] = u, 1);
     },
     reconfigure(o, a) {
-      let f = he(o, n), u = a.config.facets[e.id], c = a.facet(e);
-      if (u && !f && pe(t, u))
-        return o.values[r] = c, 0;
-      let d = h(o);
-      return e.compare(d, c) ? (o.values[r] = c, 0) : (o.values[r] = d, 1);
+      let u = he(o, n), f = a.config.facets[e.id], d = a.facet(e);
+      if (f && !u && pe(t, f))
+        return o.values[r] = d, 0;
+      let c = h(o);
+      return e.compare(c, d) ? (o.values[r] = d, 0) : (o.values[r] = c, 1);
     }
   };
 }
@@ -1300,9 +1300,9 @@ class L {
 }
 const T = { lowest: 4, low: 3, default: 2, high: 1, highest: 0 };
 function V(l) {
-  return (e) => new Ee(e, l);
+  return (e) => new Oe(e, l);
 }
-const it = {
+const st = {
   /**
   The highest precedence level, for extensions that should end up
   near the start of the precedence ordering.
@@ -1328,7 +1328,7 @@ const it = {
   */
   lowest: /* @__PURE__ */ V(T.lowest)
 };
-class Ee {
+class Oe {
   constructor(e, t) {
     this.inner = e, this.prec = t;
   }
@@ -1375,35 +1375,35 @@ class Z {
   }
   static resolve(e, t, n) {
     let i = [], s = /* @__PURE__ */ Object.create(null), r = /* @__PURE__ */ new Map();
-    for (let c of ze(e, t, r))
-      c instanceof L ? i.push(c) : (s[c.facet.id] || (s[c.facet.id] = [])).push(c);
+    for (let d of We(e, t, r))
+      d instanceof L ? i.push(d) : (s[d.facet.id] || (s[d.facet.id] = [])).push(d);
     let h = /* @__PURE__ */ Object.create(null), o = [], a = [];
-    for (let c of i)
-      h[c.id] = a.length << 1, a.push((d) => c.slot(d));
-    let f = n?.config.facets;
-    for (let c in s) {
-      let d = s[c], p = d[0].facet, E = f && f[c] || [];
-      if (d.every(
+    for (let d of i)
+      h[d.id] = a.length << 1, a.push((c) => d.slot(c));
+    let u = n?.config.facets;
+    for (let d in s) {
+      let c = s[d], g = c[0].facet, E = u && u[d] || [];
+      if (c.every(
         (v) => v.type == 0
         /* Provider.Static */
       ))
-        if (h[p.id] = o.length << 1 | 1, pe(E, d))
-          o.push(n.facet(p));
+        if (h[g.id] = o.length << 1 | 1, pe(E, c))
+          o.push(n.facet(g));
         else {
-          let v = p.combine(d.map((ne) => ne.value));
-          o.push(n && p.compare(v, n.facet(p)) ? n.facet(p) : v);
+          let v = g.combine(c.map((ne) => ne.value));
+          o.push(n && g.compare(v, n.facet(g)) ? n.facet(g) : v);
         }
       else {
-        for (let v of d)
+        for (let v of c)
           v.type == 0 ? (h[v.id] = o.length << 1 | 1, o.push(v.value)) : (h[v.id] = a.length << 1, a.push((ne) => v.dynamicSlot(ne)));
-        h[p.id] = a.length << 1, a.push((v) => qe(v, p, d));
+        h[g.id] = a.length << 1, a.push((v) => qe(v, g, c));
       }
     }
-    let u = a.map((c) => c(h));
-    return new Z(e, r, u, h, o, s);
+    let f = a.map((d) => d(h));
+    return new Z(e, r, f, h, o, s);
   }
 }
-function ze(l, e, t) {
+function We(l, e, t) {
   let n = [[], [], [], [], []], i = /* @__PURE__ */ new Map();
   function s(r, h) {
     let o = i.get(r);
@@ -1421,7 +1421,7 @@ function ze(l, e, t) {
         throw new RangeError("Duplicate use of compartment in extensions");
       let a = e.get(r.compartment) || r.inner;
       t.set(r.compartment, a), s(a, h);
-    } else if (r instanceof Ee)
+    } else if (r instanceof Oe)
       s(r.inner, r.prec);
     else if (r instanceof L)
       n[h].push(r), r.provides && s(r.provides, h);
@@ -1451,13 +1451,13 @@ function $(l, e) {
 function j(l, e) {
   return e & 1 ? l.config.staticValues[e >> 1] : l.values[e >> 1];
 }
-const Oe = /* @__PURE__ */ A.define(), ae = /* @__PURE__ */ A.define({
+const Ce = /* @__PURE__ */ A.define(), ae = /* @__PURE__ */ A.define({
   combine: (l) => l.some((e) => e),
   static: !0
-}), Ce = /* @__PURE__ */ A.define({
+}), Me = /* @__PURE__ */ A.define({
   combine: (l) => l.length ? l[0] : void 0,
   static: !0
-}), Me = /* @__PURE__ */ A.define(), be = /* @__PURE__ */ A.define(), Re = /* @__PURE__ */ A.define(), Te = /* @__PURE__ */ A.define({
+}), be = /* @__PURE__ */ A.define(), Re = /* @__PURE__ */ A.define(), Te = /* @__PURE__ */ A.define(), Be = /* @__PURE__ */ A.define({
   combine: (l) => l.length ? l[0] : !1
 });
 class U {
@@ -1471,10 +1471,10 @@ class U {
   Define a new type of annotation.
   */
   static define() {
-    return new We();
+    return new Ue();
   }
 }
-class We {
+class Ue {
   /**
   Create an instance of this annotation.
   */
@@ -1482,7 +1482,7 @@ class We {
     return new U(this, e);
   }
 }
-class Ue {
+class Ge {
   /**
   @internal
   */
@@ -1527,7 +1527,7 @@ class I {
   removed.
   */
   static define(e = {}) {
-    return new Ue(e.map || ((t) => t));
+    return new Ge(e.map || ((t) => t));
   }
   /**
   Map an array of effects through a change set.
@@ -1547,7 +1547,7 @@ I.reconfigure = /* @__PURE__ */ I.define();
 I.appendConfig = /* @__PURE__ */ I.define();
 class P {
   constructor(e, t, n, i, s, r) {
-    this.startState = e, this.changes = t, this.selection = n, this.effects = i, this.annotations = s, this.scrollIntoView = r, this._doc = null, this._state = null, n && Ae(n, t.newLength), s.some((h) => h.type == P.time) || (this.annotations = s.concat(P.time.of(Date.now())));
+    this.startState = e, this.changes = t, this.selection = n, this.effects = i, this.annotations = s, this.scrollIntoView = r, this._doc = null, this._state = null, n && Ee(n, t.newLength), s.some((h) => h.type == P.time) || (this.annotations = s.concat(P.time.of(Date.now())));
   }
   /**
   @internal
@@ -1623,7 +1623,7 @@ P.time = /* @__PURE__ */ U.define();
 P.userEvent = /* @__PURE__ */ U.define();
 P.addToHistory = /* @__PURE__ */ U.define();
 P.remote = /* @__PURE__ */ U.define();
-function Ge(l, e) {
+function He(l, e) {
   let t = [];
   for (let n = 0, i = 0; ; ) {
     let s, r;
@@ -1636,7 +1636,7 @@ function Ge(l, e) {
     !t.length || t[t.length - 1] < s ? t.push(s, r) : t[t.length - 1] < r && (t[t.length - 1] = r);
   }
 }
-function Be(l, e, t) {
+function Fe(l, e, t) {
   var n;
   let i, s, r;
   return t ? (i = e.changes, s = y.empty(e.changes.length), r = l.changes.compose(e.changes)) : (i = e.changes.map(l.changes), s = l.changes.mapDesc(e.changes, !0), r = l.changes.compose(i)), {
@@ -1647,36 +1647,36 @@ function Be(l, e, t) {
     scrollIntoView: l.scrollIntoView || e.scrollIntoView
   };
 }
-function fe(l, e, t) {
+function ue(l, e, t) {
   let n = e.selection, i = F(e.annotations);
   return e.userEvent && (i = i.concat(P.userEvent.of(e.userEvent))), {
-    changes: e.changes instanceof y ? e.changes : y.of(e.changes || [], t, l.facet(Ce)),
-    selection: n && (n instanceof g ? n : g.single(n.anchor, n.head)),
+    changes: e.changes instanceof y ? e.changes : y.of(e.changes || [], t, l.facet(Me)),
+    selection: n && (n instanceof p ? n : p.single(n.anchor, n.head)),
     effects: F(e.effects),
     annotations: i,
     scrollIntoView: !!e.scrollIntoView
   };
 }
-function Fe(l, e, t) {
-  let n = fe(l, e.length ? e[0] : {}, l.doc.length);
+function Je(l, e, t) {
+  let n = ue(l, e.length ? e[0] : {}, l.doc.length);
   e.length && e[0].filter === !1 && (t = !1);
   for (let s = 1; s < e.length; s++) {
     e[s].filter === !1 && (t = !1);
     let r = !!e[s].sequential;
-    n = Be(n, fe(l, e[s], r ? n.changes.newLength : l.doc.length), r);
+    n = Fe(n, ue(l, e[s], r ? n.changes.newLength : l.doc.length), r);
   }
   let i = P.create(l, n.changes, n.selection, n.effects, n.annotations, n.scrollIntoView);
-  return Ke(t ? He(i) : i);
+  return Qe(t ? Ke(i) : i);
 }
-function He(l) {
+function Ke(l) {
   let e = l.startState, t = !0;
-  for (let i of e.facet(Me)) {
+  for (let i of e.facet(be)) {
     let s = i(l);
     if (s === !1) {
       t = !1;
       break;
     }
-    Array.isArray(s) && (t = t === !0 ? s : Ge(t, s));
+    Array.isArray(s) && (t = t === !0 ? s : He(t, s));
   }
   if (t !== !0) {
     let i, s;
@@ -1688,49 +1688,49 @@ function He(l) {
     }
     l = P.create(e, i, l.selection && l.selection.map(s), I.mapEffects(l.effects, s), l.annotations, l.scrollIntoView);
   }
-  let n = e.facet(be);
+  let n = e.facet(Re);
   for (let i = n.length - 1; i >= 0; i--) {
     let s = n[i](l);
-    s instanceof P ? l = s : Array.isArray(s) && s.length == 1 && s[0] instanceof P ? l = s[0] : l = Fe(e, F(s), !1);
+    s instanceof P ? l = s : Array.isArray(s) && s.length == 1 && s[0] instanceof P ? l = s[0] : l = Je(e, F(s), !1);
   }
   return l;
 }
-function Ke(l) {
-  let e = l.startState, t = e.facet(Re), n = l;
+function Qe(l) {
+  let e = l.startState, t = e.facet(Te), n = l;
   for (let i = t.length - 1; i >= 0; i--) {
     let s = t[i](l);
-    s && Object.keys(s).length && (n = Be(n, fe(e, s, l.changes.newLength), !0));
+    s && Object.keys(s).length && (n = Fe(n, ue(e, s, l.changes.newLength), !0));
   }
   return n == l ? l : P.create(e, l.changes, l.selection, n.effects, n.annotations, n.scrollIntoView);
 }
-const Qe = [];
+const Xe = [];
 function F(l) {
-  return l == null ? Qe : Array.isArray(l) ? l : [l];
+  return l == null ? Xe : Array.isArray(l) ? l : [l];
 }
 var R = /* @__PURE__ */ (function(l) {
   return l[l.Word = 0] = "Word", l[l.Space = 1] = "Space", l[l.Other = 2] = "Other", l;
 })(R || (R = {}));
-const Xe = /[\u00df\u0587\u0590-\u05f4\u0600-\u06ff\u3040-\u309f\u30a0-\u30ff\u3400-\u4db5\u4e00-\u9fcc\uac00-\ud7af]/;
-let ue;
+const Ye = /[\u00df\u0587\u0590-\u05f4\u0600-\u06ff\u3040-\u309f\u30a0-\u30ff\u3400-\u4db5\u4e00-\u9fcc\uac00-\ud7af]/;
+let fe;
 try {
-  ue = /* @__PURE__ */ new RegExp("[\\p{Alphabetic}\\p{Number}_]", "u");
+  fe = /* @__PURE__ */ new RegExp("[\\p{Alphabetic}\\p{Number}_]", "u");
 } catch {
 }
-function Ye(l) {
-  if (ue)
-    return ue.test(l);
+function Ze(l) {
+  if (fe)
+    return fe.test(l);
   for (let e = 0; e < l.length; e++) {
     let t = l[e];
-    if (/\w/.test(t) || t > "€" && (t.toUpperCase() != t.toLowerCase() || Xe.test(t)))
+    if (/\w/.test(t) || t > "€" && (t.toUpperCase() != t.toLowerCase() || Ye.test(t)))
       return !0;
   }
   return !1;
 }
-function Ze(l) {
+function je(l) {
   return (e) => {
     if (!/\S/.test(e))
       return R.Space;
-    if (Ye(e))
+    if (Ze(e))
       return R.Word;
     for (let t = 0; t < l.length; t++)
       if (e.indexOf(l[t]) > -1)
@@ -1770,7 +1770,7 @@ class w {
   specs take precedence over earlier ones.
   */
   update(...e) {
-    return Fe(this, e, !0);
+    return Je(this, e, !0);
   }
   /**
   @internal
@@ -1791,7 +1791,7 @@ class w {
   replaceSelection(e) {
     return typeof e == "string" && (e = this.toText(e)), this.changeByRange((t) => ({
       changes: { from: t.from, to: t.to, insert: e },
-      range: g.cursor(t.from + e.length)
+      range: p.cursor(t.from + e.length)
     }));
   }
   /**
@@ -1808,15 +1808,15 @@ class w {
   changeByRange(e) {
     let t = this.selection, n = e(t.ranges[0]), i = this.changes(n.changes), s = [n.range], r = F(n.effects);
     for (let h = 1; h < t.ranges.length; h++) {
-      let o = e(t.ranges[h]), a = this.changes(o.changes), f = a.map(i);
-      for (let c = 0; c < h; c++)
-        s[c] = s[c].map(f);
-      let u = i.mapDesc(a, !0);
-      s.push(o.range.map(u)), i = i.compose(f), r = I.mapEffects(r, f).concat(I.mapEffects(F(o.effects), u));
+      let o = e(t.ranges[h]), a = this.changes(o.changes), u = a.map(i);
+      for (let d = 0; d < h; d++)
+        s[d] = s[d].map(u);
+      let f = i.mapDesc(a, !0);
+      s.push(o.range.map(f)), i = i.compose(u), r = I.mapEffects(r, u).concat(I.mapEffects(F(o.effects), f));
     }
     return {
       changes: i,
-      selection: g.create(s, t.mainIndex),
+      selection: p.create(s, t.mainIndex),
       effects: r
     };
   }
@@ -1886,7 +1886,7 @@ class w {
     }
     return w.create({
       doc: e.doc,
-      selection: g.fromJSON(e.selection),
+      selection: p.fromJSON(e.selection),
       extensions: t.extensions ? i.concat([t.extensions]) : i
     });
   }
@@ -1896,8 +1896,8 @@ class w {
   transactions.
   */
   static create(e = {}) {
-    let t = Z.resolve(e.extensions || [], /* @__PURE__ */ new Map()), n = e.doc instanceof x ? e.doc : x.of((e.doc || "").split(t.staticFacet(w.lineSeparator) || se)), i = e.selection ? e.selection instanceof g ? e.selection : g.single(e.selection.anchor, e.selection.head) : g.single(0);
-    return Ae(i, n.length), t.staticFacet(ae) || (i = i.asSingle()), new w(t, n, i, t.dynamicSlots.map(() => null), (s, r) => r.create(s), null);
+    let t = Z.resolve(e.extensions || [], /* @__PURE__ */ new Map()), n = e.doc instanceof x ? e.doc : x.of((e.doc || "").split(t.staticFacet(w.lineSeparator) || se)), i = e.selection ? e.selection instanceof p ? e.selection : p.single(e.selection.anchor, e.selection.head) : p.single(0);
+    return Ee(i, n.length), t.staticFacet(ae) || (i = i.asSingle()), new w(t, n, i, t.dynamicSlots.map(() => null), (s, r) => r.create(s), null);
   }
   /**
   The size (in columns) of a tab in the document, determined by
@@ -1919,7 +1919,7 @@ class w {
   [configured](https://codemirror.net/6/docs/ref/#state.EditorState^readOnly) to be read-only.
   */
   get readOnly() {
-    return this.facet(Te);
+    return this.facet(Be);
   }
   /**
   Look up a translation for the given phrase (via the
@@ -1962,7 +1962,7 @@ class w {
   */
   languageDataAt(e, t, n = -1) {
     let i = [];
-    for (let s of this.facet(Oe))
+    for (let s of this.facet(Ce))
       for (let r of s(this, t, n))
         Object.prototype.hasOwnProperty.call(r, e) && i.push(r[e]);
     return i;
@@ -1979,7 +1979,8 @@ class w {
    - Other (anything else)
   */
   charCategorizer(e) {
-    return Ze(this.languageDataAt("wordChars", e).join(""));
+    let t = this.languageDataAt("wordChars", e);
+    return je(t.length ? t[0] : "");
   }
   /**
   Find the word at the given position, meaning the range
@@ -2001,27 +2002,27 @@ class w {
         break;
       h = o;
     }
-    return r == h ? null : g.range(r + n, h + n);
+    return r == h ? null : p.range(r + n, h + n);
   }
 }
 w.allowMultipleSelections = ae;
 w.tabSize = /* @__PURE__ */ A.define({
   combine: (l) => l.length ? l[0] : 4
 });
-w.lineSeparator = Ce;
-w.readOnly = Te;
+w.lineSeparator = Me;
+w.readOnly = Be;
 w.phrases = /* @__PURE__ */ A.define({
   compare(l, e) {
     let t = Object.keys(l), n = Object.keys(e);
     return t.length == n.length && t.every((i) => l[i] == e[i]);
   }
 });
-w.languageData = Oe;
-w.changeFilter = Me;
-w.transactionFilter = be;
-w.transactionExtender = Re;
+w.languageData = Ce;
+w.changeFilter = be;
+w.transactionFilter = Re;
+w.transactionExtender = Te;
 te.reconfigure = /* @__PURE__ */ I.define();
-function st(l, e, t = {}) {
+function rt(l, e, t = {}) {
   let n = {};
   for (let i of l)
     for (let s of Object.keys(i)) {
@@ -2052,13 +2053,16 @@ class _ {
   Create a [range](https://codemirror.net/6/docs/ref/#state.Range) with this value.
   */
   range(e, t = e) {
-    return z.create(e, t, this);
+    return q.create(e, t, this);
   }
 }
 _.prototype.startSide = _.prototype.endSide = 0;
 _.prototype.point = !1;
 _.prototype.mapMode = M.TrackDel;
-class z {
+function me(l, e) {
+  return l == e || l.constructor == e.constructor && l.eq(e);
+}
+class q {
   constructor(e, t, n) {
     this.from = e, this.to = t, this.value = n;
   }
@@ -2066,13 +2070,13 @@ class z {
   @internal
   */
   static create(e, t, n) {
-    return new z(e, t, n);
+    return new q(e, t, n);
   }
 }
 function ce(l, e) {
   return l.from - e.from || l.value.startSide - e.value.startSide;
 }
-class me {
+class we {
   constructor(e, t, n, i) {
     this.from = e, this.to = t, this.value = n, this.maxPoint = i;
   }
@@ -2100,16 +2104,16 @@ class me {
   map(e, t) {
     let n = [], i = [], s = [], r = -1, h = -1;
     for (let o = 0; o < this.value.length; o++) {
-      let a = this.value[o], f = this.from[o] + e, u = this.to[o] + e, c, d;
-      if (f == u) {
-        let p = t.mapPos(f, a.startSide, a.mapMode);
-        if (p == null || (c = d = p, a.startSide != a.endSide && (d = t.mapPos(f, a.endSide), d < c)))
+      let a = this.value[o], u = this.from[o] + e, f = this.to[o] + e, d, c;
+      if (u == f) {
+        let g = t.mapPos(u, a.startSide, a.mapMode);
+        if (g == null || (d = c = g, a.startSide != a.endSide && (c = t.mapPos(u, a.endSide), c < d)))
           continue;
-      } else if (c = t.mapPos(f, a.startSide), d = t.mapPos(u, a.endSide), c > d || c == d && a.startSide > 0 && a.endSide <= 0)
+      } else if (d = t.mapPos(u, a.startSide), c = t.mapPos(f, a.endSide), d > c || d == c && a.startSide > 0 && a.endSide <= 0)
         continue;
-      (d - c || a.endSide - a.startSide) < 0 || (r < 0 && (r = c), a.point && (h = Math.max(h, d - c)), n.push(a), i.push(c - r), s.push(d - r));
+      (c - d || a.endSide - a.startSide) < 0 || (r < 0 && (r = d), a.point && (h = Math.max(h, c - d)), n.push(a), i.push(d - r), s.push(c - r));
     }
-    return { mapped: n.length ? new me(i, s, n, h) : null, pos: r };
+    return { mapped: n.length ? new we(i, s, n, h) : null, pos: r };
   }
 }
 class S {
@@ -2161,13 +2165,13 @@ class S {
       return this;
     if (n && (t = t.slice().sort(ce)), this.isEmpty)
       return t.length ? S.of(t) : this;
-    let h = new Je(this, null, -1).goto(0), o = 0, a = [], f = new ee();
+    let h = new Le(this, null, -1).goto(0), o = 0, a = [], u = new ee();
     for (; h.value || o < t.length; )
       if (o < t.length && (h.from - t[o].from || h.startSide - t[o].value.startSide) >= 0) {
-        let u = t[o++];
-        f.addInner(u.from, u.to, u.value) || a.push(u);
-      } else h.rangeIndex == 1 && h.chunkIndex < this.chunk.length && (o == t.length || this.chunkEnd(h.chunkIndex) < t[o].from) && (!r || i > this.chunkEnd(h.chunkIndex) || s < this.chunkPos[h.chunkIndex]) && f.addChunk(this.chunkPos[h.chunkIndex], this.chunk[h.chunkIndex]) ? h.nextChunk() : ((!r || i > h.to || s < h.from || r(h.from, h.to, h.value)) && (f.addInner(h.from, h.to, h.value) || a.push(z.create(h.from, h.to, h.value))), h.next());
-    return f.finishInner(this.nextLayer.isEmpty && !a.length ? S.empty : this.nextLayer.update({ add: a, filter: r, filterFrom: i, filterTo: s }));
+        let f = t[o++];
+        u.addInner(f.from, f.to, f.value) || a.push(f);
+      } else h.rangeIndex == 1 && h.chunkIndex < this.chunk.length && (o == t.length || this.chunkEnd(h.chunkIndex) < t[o].from) && (!r || i > this.chunkEnd(h.chunkIndex) || s < this.chunkPos[h.chunkIndex]) && u.addChunk(this.chunkPos[h.chunkIndex], this.chunk[h.chunkIndex]) ? h.nextChunk() : ((!r || i > h.to || s < h.from || r(h.from, h.to, h.value)) && (u.addInner(h.from, h.to, h.value) || a.push(q.create(h.from, h.to, h.value))), h.next());
+    return u.finishInner(this.nextLayer.isEmpty && !a.length ? S.empty : this.nextLayer.update({ add: a, filter: r, filterFrom: i, filterTo: s }));
   }
   /**
   Map this range set through a set of changes, return the new set.
@@ -2181,8 +2185,8 @@ class S {
       if (a === !1)
         i = Math.max(i, o.maxPoint), t.push(o), n.push(e.mapPos(h));
       else if (a === !0) {
-        let { mapped: f, pos: u } = o.map(h, e);
-        f && (i = Math.max(i, f.maxPoint), t.push(f), n.push(u));
+        let { mapped: u, pos: f } = o.map(h, e);
+        u && (i = Math.max(i, u.maxPoint), t.push(u), n.push(f));
       }
     }
     let s = this.nextLayer.map(e);
@@ -2229,8 +2233,8 @@ class S {
   to notify it of possible differences.
   */
   static compare(e, t, n, i, s = -1) {
-    let r = e.filter((u) => u.maxPoint > 0 || !u.isEmpty && u.maxPoint >= s), h = t.filter((u) => u.maxPoint > 0 || !u.isEmpty && u.maxPoint >= s), o = xe(r, h, n), a = new N(r, o, s), f = new N(h, o, s);
-    n.iterGaps((u, c, d) => ye(a, u, f, c, d, i)), n.empty && n.length == 0 && ye(a, 0, f, 0, 0, i);
+    let r = e.filter((f) => f.maxPoint > 0 || !f.isEmpty && f.maxPoint >= s), h = t.filter((f) => f.maxPoint > 0 || !f.isEmpty && f.maxPoint >= s), o = ye(r, h, n), a = new N(r, o, s), u = new N(h, o, s);
+    n.iterGaps((f, d, c) => ke(a, f, u, d, c, i)), n.empty && n.length == 0 && ke(a, 0, u, 0, 0, i);
   }
   /**
   Compare the contents of two groups of range sets, returning true
@@ -2238,14 +2242,14 @@ class S {
   */
   static eq(e, t, n = 0, i) {
     i == null && (i = 999999999);
-    let s = e.filter((f) => !f.isEmpty && t.indexOf(f) < 0), r = t.filter((f) => !f.isEmpty && e.indexOf(f) < 0);
+    let s = e.filter((u) => !u.isEmpty && t.indexOf(u) < 0), r = t.filter((u) => !u.isEmpty && e.indexOf(u) < 0);
     if (s.length != r.length)
       return !1;
     if (!s.length)
       return !0;
-    let h = xe(s, r), o = new N(s, h, 0).goto(n), a = new N(r, h, 0).goto(n);
+    let h = ye(s, r), o = new N(s, h, 0).goto(n), a = new N(r, h, 0).goto(n);
     for (; ; ) {
-      if (o.to != a.to || !de(o.active, a.active) || o.point && (!a.point || !o.point.eq(a.point)))
+      if (o.to != a.to || !de(o.active, a.active) || o.point && (!a.point || !me(o.point, a.point)))
         return !1;
       if (o.to > i)
         return !0;
@@ -2264,8 +2268,8 @@ class S {
     for (; ; ) {
       let a = Math.min(r.to, n);
       if (r.point) {
-        let f = r.activeForPoint(r.to), u = r.pointFrom < t ? f.length + 1 : r.point.startSide < 0 ? f.length : Math.min(f.length, o);
-        i.point(h, a, r.point, f, u, r.pointRank), o = Math.min(r.openEnd(a), f.length);
+        let u = r.activeForPoint(r.to), f = r.pointFrom < t ? u.length + 1 : r.point.startSide < 0 ? u.length : Math.min(u.length, o);
+        i.point(h, a, r.point, u, f, r.pointRank), o = Math.min(r.openEnd(a), u.length);
       } else a > h && (i.span(h, a, r.active, o), o = r.openEnd(a));
       if (r.to > n)
         return o + (r.point && r.to > n ? 1 : 0);
@@ -2281,7 +2285,7 @@ class S {
   */
   static of(e, t = !1) {
     let n = new ee();
-    for (let i of e instanceof z ? [e] : t ? je(e) : e)
+    for (let i of e instanceof q ? [e] : t ? _e(e) : e)
       n.add(i.from, i.to, i.value);
     return n.finish();
   }
@@ -2299,7 +2303,7 @@ class S {
   }
 }
 S.empty = /* @__PURE__ */ new S([], [], null, -1);
-function je(l) {
+function _e(l) {
   if (l.length > 1)
     for (let e = l[0], t = 1; t < l.length; t++) {
       let n = l[t];
@@ -2312,7 +2316,7 @@ function je(l) {
 S.empty.nextLayer = S.empty;
 class ee {
   finishChunk(e) {
-    this.chunks.push(new me(this.from, this.to, this.value, this.maxPoint)), this.chunkPos.push(this.chunkStart), this.chunkStart = -1, this.setMaxPoint = Math.max(this.setMaxPoint, this.maxPoint), this.maxPoint = -1, e && (this.from = [], this.to = [], this.value = []);
+    this.chunks.push(new we(this.from, this.to, this.value, this.maxPoint)), this.chunkPos.push(this.chunkStart), this.chunkStart = -1, this.setMaxPoint = Math.max(this.setMaxPoint, this.maxPoint), this.maxPoint = -1, e && (this.from = [], this.to = [], this.value = []);
   }
   /**
   Create an empty builder.
@@ -2363,7 +2367,7 @@ class ee {
     return this.from = null, t;
   }
 }
-function xe(l, e, t) {
+function ye(l, e, t) {
   let n = /* @__PURE__ */ new Map();
   for (let s of l)
     for (let r = 0; r < s.chunk.length; r++)
@@ -2376,7 +2380,7 @@ function xe(l, e, t) {
     }
   return i;
 }
-class Je {
+class Le {
   constructor(e, t, n, i = 0) {
     this.layer = e, this.skip = t, this.minPoint = n, this.rank = i;
   }
@@ -2440,7 +2444,7 @@ class W {
     let i = [];
     for (let s = 0; s < e.length; s++)
       for (let r = e[s]; !r.isEmpty; r = r.nextLayer)
-        r.maxPoint >= n && i.push(new Je(r, t, n, s));
+        r.maxPoint >= n && i.push(new Le(r, t, n, s));
     return i.length == 1 ? i[0] : new W(i);
   }
   get startSide() {
@@ -2493,13 +2497,13 @@ class N {
     this.cursor.forward(e, t);
   }
   removeActive(e) {
-    H(this.active, e), H(this.activeTo, e), H(this.activeRank, e), this.minActive = ke(this.active, this.activeTo);
+    H(this.active, e), H(this.activeTo, e), H(this.activeRank, e), this.minActive = Se(this.active, this.activeTo);
   }
   addActive(e) {
     let t = 0, { value: n, to: i, rank: s } = this.cursor;
     for (; t < this.activeRank.length && (s - this.activeRank[t] || i - this.activeTo[t]) > 0; )
       t++;
-    K(this.active, t, n), K(this.activeTo, t, i), K(this.activeRank, t, s), e && K(e, t, this.cursor.from), this.minActive = ke(this.active, this.activeTo);
+    K(this.active, t, n), K(this.activeTo, t, i), K(this.activeRank, t, s), e && K(e, t, this.cursor.from), this.minActive = Se(this.active, this.activeTo);
   }
   // After calling this, if `this.point` != null, the next range is a
   // point. Otherwise, it's a regular range, covered by `this.active`.
@@ -2556,21 +2560,21 @@ class N {
     return t;
   }
 }
-function ye(l, e, t, n, i, s) {
+function ke(l, e, t, n, i, s) {
   l.goto(e), t.goto(n);
-  let r = n + i, h = n, o = n - e;
-  for (; ; ) {
-    let a = l.to + o - t.to, f = a || l.endSide - t.endSide, u = f < 0 ? l.to + o : t.to, c = Math.min(u, r);
-    if (l.point || t.point ? l.point && t.point && (l.point == t.point || l.point.eq(t.point)) && de(l.activeForPoint(l.to), t.activeForPoint(t.to)) || s.comparePoint(h, c, l.point, t.point) : c > h && !de(l.active, t.active) && s.compareRange(h, c, l.active, t.active), u > r)
+  let r = n + i, h = n, o = n - e, a = !!s.boundChange;
+  for (let u = !1; ; ) {
+    let f = l.to + o - t.to, d = f || l.endSide - t.endSide, c = d < 0 ? l.to + o : t.to, g = Math.min(c, r);
+    if (l.point || t.point ? (l.point && t.point && me(l.point, t.point) && de(l.activeForPoint(l.to), t.activeForPoint(t.to)) || s.comparePoint(h, g, l.point, t.point), u = !1) : (u && s.boundChange(h), g > h && !de(l.active, t.active) && s.compareRange(h, g, l.active, t.active), a && g < r && (f || l.openEnd(c) != t.openEnd(c)) && (u = !0)), c > r)
       break;
-    (a || l.openEnd != t.openEnd) && s.boundChange && s.boundChange(u), h = u, f <= 0 && l.next(), f >= 0 && t.next();
+    h = c, d <= 0 && l.next(), d >= 0 && t.next();
   }
 }
 function de(l, e) {
   if (l.length != e.length)
     return !1;
   for (let t = 0; t < l.length; t++)
-    if (l[t] != e[t] && !l[t].eq(e[t]))
+    if (l[t] != e[t] && !me(l[t], e[t]))
       return !1;
   return !0;
 }
@@ -2584,19 +2588,19 @@ function K(l, e, t) {
     l[n + 1] = l[n];
   l[e] = t;
 }
-function ke(l, e) {
+function Se(l, e) {
   let t = -1, n = 1e9;
   for (let i = 0; i < e.length; i++)
     (e[i] - n || l[i].endSide - l[t].endSide) < 0 && (t = i, n = e[i]);
   return t;
 }
-function rt(l, e, t = l.length) {
+function lt(l, e, t = l.length) {
   let n = 0;
   for (let i = 0; i < t && i < l.length; )
     l.charCodeAt(i) == 9 ? (n += e - n % e, i++) : (n++, i = Y(l, i));
   return n;
 }
-function lt(l, e, t, n) {
+function ht(l, e, t, n) {
   for (let i = 0, s = 0; ; ) {
     if (s >= e)
       return i;
@@ -2608,32 +2612,32 @@ function lt(l, e, t, n) {
 }
 export {
   U as Annotation,
-  We as AnnotationType,
+  Ue as AnnotationType,
   C as ChangeDesc,
   y as ChangeSet,
   R as CharCategory,
   te as Compartment,
-  g as EditorSelection,
+  p as EditorSelection,
   w as EditorState,
   A as Facet,
-  Ne as Line,
+  De as Line,
   M as MapMode,
-  it as Prec,
-  z as Range,
+  st as Prec,
+  q as Range,
   S as RangeSet,
   ee as RangeSetBuilder,
   _ as RangeValue,
   B as SelectionRange,
   I as StateEffect,
-  Ue as StateEffectType,
+  Ge as StateEffectType,
   L as StateField,
   x as Text,
   P as Transaction,
-  et as codePointAt,
-  nt as codePointSize,
-  st as combineConfig,
-  rt as countColumn,
+  tt as codePointAt,
+  it as codePointSize,
+  rt as combineConfig,
+  lt as countColumn,
   Y as findClusterBreak,
-  lt as findColumn,
-  tt as fromCodePoint
+  ht as findColumn,
+  nt as fromCodePoint
 };