@gsc-basic/components 1.0.1 → 1.0.3

package/dist/es/node_modules/@lezer/common/dist/index.js

@@ -43,9 +43,9 @@ k.isolate = new k({ deserialize: (l) => {
 k.contextHash = new k({ perNode: !0 });
 k.lookAhead = new k({ perNode: !0 });
 k.mounted = new k({ perNode: !0 });
-class X {
-  constructor(e, t, r) {
-    this.tree = e, this.overlay = t, this.parser = r;
+class V {
+  constructor(e, t, r, i = !1) {
+    this.tree = e, this.overlay = t, this.parser = r, this.bracketed = i;
   }
   /**
   @internal
@@ -175,8 +175,8 @@ class ae {
         let s = n(r);
         if (s) {
           i || (i = Object.assign({}, r.props));
-          let h = s[1], o = s[0];
-          o.combine && o.id in i && (h = o.combine(i[o.id], h)), i[o.id] = h;
+          let h = s[1], u = s[0];
+          u.combine && u.id in i && (h = u.combine(i[u.id], h)), i[u.id] = h;
         }
       }
       t.push(i ? new j(r.name, i, r.id, r.flags) : r);
@@ -184,12 +184,12 @@ class ae {
     return new ae(t);
   }
 }
-const K = /* @__PURE__ */ new WeakMap(), fe = /* @__PURE__ */ new WeakMap();
-var N;
+const Q = /* @__PURE__ */ new WeakMap(), fe = /* @__PURE__ */ new WeakMap();
+var _;
 (function(l) {
-  l[l.ExcludeBuffers = 1] = "ExcludeBuffers", l[l.IncludeAnonymous = 2] = "IncludeAnonymous", l[l.IgnoreMounts = 4] = "IgnoreMounts", l[l.IgnoreOverlays = 8] = "IgnoreOverlays";
-})(N || (N = {}));
-class O {
+  l[l.ExcludeBuffers = 1] = "ExcludeBuffers", l[l.IncludeAnonymous = 2] = "IncludeAnonymous", l[l.IgnoreMounts = 4] = "IgnoreMounts", l[l.IgnoreOverlays = 8] = "IgnoreOverlays", l[l.EnterBracketed = 16] = "EnterBracketed";
+})(_ || (_ = {}));
+class P {
   /**
   Construct a new tree. See also [`Tree.build`](#common.Tree^build).
   */
@@ -204,7 +204,7 @@ class O {
   @internal
   */
   toString() {
-    let e = X.get(this);
+    let e = V.get(this);
     if (e && !e.overlay)
       return e.tree.toString();
     let t = "";
@@ -228,8 +228,8 @@ class O {
   [`moveTo`](#common.TreeCursor.moveTo).
   */
   cursorAt(e, t = 0, r = 0) {
-    let i = K.get(this) || this.topNode, n = new te(i);
-    return n.moveTo(e, t), K.set(this, n._tree), n;
+    let i = Q.get(this) || this.topNode, n = new te(i);
+    return n.moveTo(e, t), Q.set(this, n._tree), n;
   }
   /**
   Get a [syntax node](#common.SyntaxNode) object for the top of the
@@ -250,8 +250,8 @@ class O {
   [`resolveInner`](#common.Tree.resolveInner) instead.
   */
   resolve(e, t = 0) {
-    let r = V(K.get(this) || this.topNode, e, t, !1);
-    return K.set(this, r), r;
+    let r = $(Q.get(this) || this.topNode, e, t, !1);
+    return Q.set(this, r), r;
   }
   /**
   Like [`resolve`](#common.Tree.resolve), but will enter
@@ -261,7 +261,7 @@ class O {
   the host trees).
   */
   resolveInner(e, t = 0) {
-    let r = V(fe.get(this) || this.topNode, e, t, !0);
+    let r = $(fe.get(this) || this.topNode, e, t, !0);
     return fe.set(this, r), r;
   }
   /**
@@ -282,16 +282,16 @@ class O {
   not have its children iterated over (or `leave` called).
   */
   iterate(e) {
-    let { enter: t, leave: r, from: i = 0, to: n = this.length } = e, s = e.mode || 0, h = (s & N.IncludeAnonymous) > 0;
-    for (let o = this.cursor(s | N.IncludeAnonymous); ; ) {
+    let { enter: t, leave: r, from: i = 0, to: n = this.length } = e, s = e.mode || 0, h = (s & _.IncludeAnonymous) > 0;
+    for (let u = this.cursor(s | _.IncludeAnonymous); ; ) {
       let C = !1;
-      if (o.from <= n && o.to >= i && (!h && o.type.isAnonymous || t(o) !== !1)) {
-        if (o.firstChild())
+      if (u.from <= n && u.to >= i && (!h && u.type.isAnonymous || t(u) !== !1)) {
+        if (u.firstChild())
           continue;
         C = !0;
       }
-      for (; C && r && (h || !o.type.isAnonymous) && r(o), !o.nextSibling(); ) {
-        if (!o.parent())
+      for (; C && r && (h || !u.type.isAnonymous) && r(u), !u.nextSibling(); ) {
+        if (!u.parent())
           return;
         C = !0;
       }
@@ -322,7 +322,7 @@ class O {
   [`NodeType.none`](#common.NodeType^none).
   */
   balance(e = {}) {
-    return this.children.length <= 8 ? this : se(j.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, r, i) => new O(this.type, t, r, i, this.propValues), e.makeTree || ((t, r, i) => new O(j.none, t, r, i)));
+    return this.children.length <= 8 ? this : se(j.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, r, i) => new P(this.type, t, r, i, this.propValues), e.makeTree || ((t, r, i) => new P(j.none, t, r, i)));
   }
   /**
   Build a tree from a postfix-ordered buffer of node information,
@@ -332,7 +332,7 @@ class O {
     return we(e);
   }
 }
-O.empty = new O(j.none, [], [], 0);
+P.empty = new P(j.none, [], [], 0);
 class ie {
   constructor(e, t) {
     this.buffer = e, this.index = t;
@@ -359,7 +359,7 @@ class ie {
     return new ie(this.buffer, this.index);
   }
 }
-class W {
+class M {
   /**
   Create a tree buffer.
   */
@@ -398,7 +398,7 @@ class W {
   */
   findChild(e, t, r, i, n) {
     let { buffer: s } = this, h = -1;
-    for (let o = e; o != t && !(pe(n, i, s[o + 1], s[o + 2]) && (h = o, r > 0)); o = s[o + 3])
+    for (let u = e; u != t && !(pe(n, i, s[u + 1], s[u + 2]) && (h = u, r > 0)); u = s[u + 3])
       ;
     return h;
   }
@@ -407,12 +407,12 @@ class W {
   */
   slice(e, t, r) {
     let i = this.buffer, n = new Uint16Array(t - e), s = 0;
-    for (let h = e, o = 0; h < t; ) {
-      n[o++] = i[h++], n[o++] = i[h++] - r;
-      let C = n[o++] = i[h++] - r;
-      n[o++] = i[h++] - e, s = Math.max(s, C);
+    for (let h = e, u = 0; h < t; ) {
+      n[u++] = i[h++], n[u++] = i[h++] - r;
+      let C = n[u++] = i[h++] - r;
+      n[u++] = i[h++] - e, s = Math.max(s, C);
     }
-    return new W(n, s, this.set);
+    return new M(n, s, this.set);
   }
 }
 function pe(l, e, t, r) {
@@ -431,14 +431,14 @@ function pe(l, e, t, r) {
       return !0;
   }
 }
-function V(l, e, t, r) {
+function $(l, e, t, r) {
   for (var i; l.from == l.to || (t < 1 ? l.from >= e : l.from > e) || (t > -1 ? l.to <= e : l.to < e); ) {
     let s = !r && l instanceof z && l.index < 0 ? null : l.parent;
     if (!s)
       return l;
     l = s;
   }
-  let n = r ? 0 : N.IgnoreOverlays;
+  let n = r ? 0 : _.IgnoreOverlays;
   if (r)
     for (let s = l, h = s.parent; h; s = h, h = s.parent)
       s instanceof z && s.index < 0 && ((i = h.enter(e, t, n)) === null || i === void 0 ? void 0 : i.from) != s.from && (l = h);
@@ -461,10 +461,10 @@ class de {
     return ue(this, e, t, r);
   }
   resolve(e, t = 0) {
-    return V(this, e, t, !1);
+    return $(this, e, t, !1);
   }
   resolveInner(e, t = 0) {
-    return V(this, e, t, !0);
+    return $(this, e, t, !0);
   }
   matchContext(e) {
     return ee(this.parent, e);
@@ -500,26 +500,27 @@ class z extends de {
     return this.from + this._tree.length;
   }
   nextChild(e, t, r, i, n = 0) {
-    for (let s = this; ; ) {
-      for (let { children: h, positions: o } = s._tree, C = t > 0 ? h.length : -1; e != C; e += t) {
-        let d = h[e], S = o[e] + s.from;
-        if (pe(i, r, S, S + d.length)) {
-          if (d instanceof W) {
-            if (n & N.ExcludeBuffers)
+    var s;
+    for (let h = this; ; ) {
+      for (let { children: u, positions: C } = h._tree, v = t > 0 ? u.length : -1; e != v; e += t) {
+        let p = u[e], x = C[e] + h.from;
+        if (!(!(n & _.EnterBracketed && p instanceof P && ((s = V.get(p)) === null || s === void 0 ? void 0 : s.overlay) === null && (x >= r || x + p.length <= r)) && !pe(i, r, x, x + p.length))) {
+          if (p instanceof M) {
+            if (n & _.ExcludeBuffers)
               continue;
-            let w = d.findChild(0, d.buffer.length, t, r - S, i);
-            if (w > -1)
-              return new E(new ye(s, d, e, S), null, w);
-          } else if (n & N.IncludeAnonymous || !d.type.isAnonymous || ne(d)) {
-            let w;
-            if (!(n & N.IgnoreMounts) && (w = X.get(d)) && !w.overlay)
-              return new z(w.tree, S, e, s);
-            let I = new z(d, S, e, s);
-            return n & N.IncludeAnonymous || !I.type.isAnonymous ? I : I.nextChild(t < 0 ? d.children.length - 1 : 0, t, r, i);
+            let N = p.findChild(0, p.buffer.length, t, r - x, i);
+            if (N > -1)
+              return new O(new be(h, p, e, x), null, N);
+          } else if (n & _.IncludeAnonymous || !p.type.isAnonymous || ne(p)) {
+            let N;
+            if (!(n & _.IgnoreMounts) && (N = V.get(p)) && !N.overlay)
+              return new z(N.tree, x, e, h);
+            let S = new z(p, x, e, h);
+            return n & _.IncludeAnonymous || !S.type.isAnonymous ? S : S.nextChild(t < 0 ? p.children.length - 1 : 0, t, r, i, n);
           }
         }
       }
-      if (n & N.IncludeAnonymous || !s.type.isAnonymous || (s.index >= 0 ? e = s.index + t : e = t < 0 ? -1 : s._parent._tree.children.length, s = s._parent, !s))
+      if (n & _.IncludeAnonymous || !h.type.isAnonymous || (h.index >= 0 ? e = h.index + t : e = t < 0 ? -1 : h._parent._tree.children.length, h = h._parent, !h))
         return null;
     }
   }
@@ -564,10 +565,10 @@ class z extends de {
   }
   enter(e, t, r = 0) {
     let i;
-    if (!(r & N.IgnoreOverlays) && (i = X.get(this._tree)) && i.overlay) {
-      let n = e - this.from;
-      for (let { from: s, to: h } of i.overlay)
-        if ((t > 0 ? s <= n : s < n) && (t < 0 ? h >= n : h > n))
+    if (!(r & _.IgnoreOverlays) && (i = V.get(this._tree)) && i.overlay) {
+      let n = e - this.from, s = r & _.EnterBracketed && i.bracketed;
+      for (let { from: h, to: u } of i.overlay)
+        if ((t > 0 || s ? h <= n : h < n) && (t < 0 || s ? u >= n : u > n))
           return new z(i.tree, i.overlay[0].from + this.from, -1, this);
     }
     return this.nextChild(0, 1, e, t, r);
@@ -640,12 +641,12 @@ function ee(l, e, t = e.length - 1) {
   }
   return !0;
 }
-class ye {
+class be {
   constructor(e, t, r, i) {
     this.parent = e, this.buffer = t, this.index = r, this.start = i;
   }
 }
-class E extends de {
+class O extends de {
   get name() {
     return this.type.name;
   }
@@ -660,7 +661,7 @@ class E extends de {
   }
   child(e, t, r) {
     let { buffer: i } = this.context, n = i.findChild(this.index + 4, i.buffer[this.index + 3], e, t - this.context.start, r);
-    return n < 0 ? null : new E(this.context, this, n);
+    return n < 0 ? null : new O(this.context, this, n);
   }
   get firstChild() {
     return this.child(
@@ -698,10 +699,10 @@ class E extends de {
     return this.type.prop(e);
   }
   enter(e, t, r = 0) {
-    if (r & N.ExcludeBuffers)
+    if (r & _.ExcludeBuffers)
       return null;
     let { buffer: i } = this.context, n = i.findChild(this.index + 4, i.buffer[this.index + 3], t > 0 ? 1 : -1, e - this.context.start, t);
-    return n < 0 ? null : new E(this.context, this, n);
+    return n < 0 ? null : new O(this.context, this, n);
   }
   get parent() {
     return this._parent || this.context.parent.nextSignificantParent();
@@ -717,11 +718,11 @@ class E extends de {
   }
   get nextSibling() {
     let { buffer: e } = this.context, t = e.buffer[this.index + 3];
-    return t < (this._parent ? e.buffer[this._parent.index + 3] : e.buffer.length) ? new E(this.context, this._parent, t) : this.externalSibling(1);
+    return t < (this._parent ? e.buffer[this._parent.index + 3] : e.buffer.length) ? new O(this.context, this._parent, t) : this.externalSibling(1);
   }
   get prevSibling() {
     let { buffer: e } = this.context, t = this._parent ? this._parent.index + 4 : 0;
-    return this.index == t ? this.externalSibling(-1) : new E(this.context, this._parent, e.findChild(
+    return this.index == t ? this.externalSibling(-1) : new O(this.context, this._parent, e.findChild(
       t,
       this.index,
       -1,
@@ -739,7 +740,7 @@ class E extends de {
       let s = r.buffer[this.index + 1];
       e.push(r.slice(i, n, s)), t.push(0);
     }
-    return new O(this.type, e, t, this.to - this.from);
+    return new P(this.type, e, t, this.to - this.from);
   }
   /**
   @internal
@@ -757,9 +758,9 @@ function ce(l) {
     (s.from > t.from || s.to < t.to) && (t = s, e = n);
   }
   let r = t instanceof z && t.index < 0 ? null : t.parent, i = l.slice();
-  return r ? i[e] = r : i.splice(e, 1), new be(i, t);
+  return r ? i[e] = r : i.splice(e, 1), new ye(i, t);
 }
-class be {
+class ye {
   constructor(e, t) {
     this.heads = e, this.node = t;
   }
@@ -774,10 +775,10 @@ function me(l, e, t) {
       let s = n.parent;
       (i || (i = [r])).push(s.resolve(e, t)), n = s;
     } else {
-      let s = X.get(n.tree);
+      let s = V.get(n.tree);
       if (s && s.overlay && s.overlay[0].from <= e && s.overlay[s.overlay.length - 1].to >= e) {
         let h = new z(s.tree, s.overlay[0].from + n.from, -1, n);
-        (i || (i = [r])).push(V(h, e, t, !1));
+        (i || (i = [r])).push($(h, e, t, !1));
       }
     }
   return i ? ce(i) : r;
@@ -793,7 +794,7 @@ class te {
   @internal
   */
   constructor(e, t = 0) {
-    if (this.mode = t, this.buffer = null, this.stack = [], this.index = 0, this.bufferNode = null, e instanceof z)
+    if (this.buffer = null, this.stack = [], this.index = 0, this.bufferNode = null, this.mode = t & ~_.EnterBracketed, e instanceof z)
       this.yieldNode(e);
     else {
       this._tree = e.context.parent, this.buffer = e.context;
@@ -884,17 +885,17 @@ class te {
   set to false.
   */
   enter(e, t, r = this.mode) {
-    return this.buffer ? r & N.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, r));
+    return this.buffer ? r & _.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, r));
   }
   /**
   Move to the node's parent node, if this isn't the top node.
   */
   parent() {
     if (!this.buffer)
-      return this.yieldNode(this.mode & N.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+      return this.yieldNode(this.mode & _.IncludeAnonymous ? this._tree._parent : this._tree.parent);
     if (this.stack.length)
       return this.yieldBuf(this.stack.pop());
-    let e = this.mode & N.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
+    let e = this.mode & _.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
     return this.buffer = null, this.yieldNode(e);
   }
   /**
@@ -951,7 +952,7 @@ class te {
       if (t > -1)
         for (let n = t + e, s = e < 0 ? -1 : r._tree.children.length; n != s; n += e) {
           let h = r._tree.children[n];
-          if (this.mode & N.IncludeAnonymous || h instanceof W || !h.type.isAnonymous || ne(h))
+          if (this.mode & _.IncludeAnonymous || h instanceof M || !h.type.isAnonymous || ne(h))
             return !1;
         }
     return !0;
@@ -1022,8 +1023,8 @@ class te {
         i = this.stack[--n];
       }
     for (let i = r; i < this.stack.length; i++)
-      t = new E(this.buffer, t, this.stack[i]);
-    return this.bufferNode = new E(this.buffer, t, this.index);
+      t = new O(this.buffer, t, this.stack[i]);
+    return this.bufferNode = new O(this.buffer, t, this.index);
   }
   /**
   Get the [tree](#common.Tree) that represents the current node, if
@@ -1081,187 +1082,187 @@ class te {
   }
 }
 function ne(l) {
-  return l.children.some((e) => e instanceof W || !e.type.isAnonymous || ne(e));
+  return l.children.some((e) => e instanceof M || !e.type.isAnonymous || ne(e));
 }
 function we(l) {
   var e;
-  let { buffer: t, nodeSet: r, maxBufferLength: i = 1024, reused: n = [], minRepeatType: s = r.types.length } = l, h = Array.isArray(t) ? new ie(t, t.length) : t, o = r.types, C = 0, d = 0;
-  function S(c, x, f, b, p, m) {
-    let { id: a, start: u, end: g, size: y } = h, _ = d, L = C;
+  let { buffer: t, nodeSet: r, maxBufferLength: i = 1024, reused: n = [], minRepeatType: s = r.types.length } = l, h = Array.isArray(t) ? new ie(t, t.length) : t, u = r.types, C = 0, v = 0;
+  function p(c, b, f, m, d, w) {
+    let { id: a, start: o, end: g, size: y } = h, A = v, W = C;
     if (y < 0)
       if (h.next(), y == -1) {
         let R = n[a];
-        f.push(R), b.push(u - c);
+        f.push(R), m.push(o - c);
         return;
       } else if (y == -3) {
         C = a;
         return;
       } else if (y == -4) {
-        d = a;
+        v = a;
         return;
       } else
         throw new RangeError(`Unrecognized record size: ${y}`);
-    let J = o[a], $, D, le = u - c;
-    if (g - u <= i && (D = Y(h.pos - x, p))) {
-      let R = new Uint16Array(D.size - D.skip), B = h.pos - D.size, P = R.length;
-      for (; h.pos > B; )
-        P = G(D.start, R, P);
-      $ = new W(R, g - D.start, r), le = D.start - c;
+    let J = u[a], q, D, le = o - c;
+    if (g - o <= i && (D = Y(h.pos - b, d))) {
+      let R = new Uint16Array(D.size - D.skip), I = h.pos - D.size, E = R.length;
+      for (; h.pos > I; )
+        E = G(D.start, R, E);
+      q = new M(R, g - D.start, r), le = D.start - c;
     } else {
       let R = h.pos - y;
       h.next();
-      let B = [], P = [], F = a >= s ? a : -1, H = 0, q = g;
+      let I = [], E = [], F = a >= s ? a : -1, H = 0, K = g;
       for (; h.pos > R; )
-        F >= 0 && h.id == F && h.size >= 0 ? (h.end <= q - i && (A(B, P, u, H, h.end, q, F, _, L), H = B.length, q = h.end), h.next()) : m > 2500 ? w(u, R, B, P) : S(u, R, B, P, F, m + 1);
-      if (F >= 0 && H > 0 && H < B.length && A(B, P, u, H, u, q, F, _, L), B.reverse(), P.reverse(), F > -1 && H > 0) {
-        let he = I(J, L);
-        $ = se(J, B, P, 0, B.length, 0, g - u, he, he);
+        F >= 0 && h.id == F && h.size >= 0 ? (h.end <= K - i && (S(I, E, o, H, h.end, K, F, A, W), H = I.length, K = h.end), h.next()) : w > 2500 ? x(o, R, I, E) : p(o, R, I, E, F, w + 1);
+      if (F >= 0 && H > 0 && H < I.length && S(I, E, o, H, o, K, F, A, W), I.reverse(), E.reverse(), F > -1 && H > 0) {
+        let he = N(J, W);
+        q = se(J, I, E, 0, I.length, 0, g - o, he, he);
       } else
-        $ = M(J, B, P, g - u, _ - g, L);
+        q = L(J, I, E, g - o, A - g, W);
     }
-    f.push($), b.push(le);
+    f.push(q), m.push(le);
   }
-  function w(c, x, f, b) {
-    let p = [], m = 0, a = -1;
-    for (; h.pos > x; ) {
-      let { id: u, start: g, end: y, size: _ } = h;
-      if (_ > 4)
+  function x(c, b, f, m) {
+    let d = [], w = 0, a = -1;
+    for (; h.pos > b; ) {
+      let { id: o, start: g, end: y, size: A } = h;
+      if (A > 4)
         h.next();
       else {
         if (a > -1 && g < a)
           break;
-        a < 0 && (a = y - i), p.push(u, g, y), m++, h.next();
+        a < 0 && (a = y - i), d.push(o, g, y), w++, h.next();
       }
     }
-    if (m) {
-      let u = new Uint16Array(m * 4), g = p[p.length - 2];
-      for (let y = p.length - 3, _ = 0; y >= 0; y -= 3)
-        u[_++] = p[y], u[_++] = p[y + 1] - g, u[_++] = p[y + 2] - g, u[_++] = _;
-      f.push(new W(u, p[2] - g, r)), b.push(g - c);
+    if (w) {
+      let o = new Uint16Array(w * 4), g = d[d.length - 2];
+      for (let y = d.length - 3, A = 0; y >= 0; y -= 3)
+        o[A++] = d[y], o[A++] = d[y + 1] - g, o[A++] = d[y + 2] - g, o[A++] = A;
+      f.push(new M(o, d[2] - g, r)), m.push(g - c);
     }
   }
-  function I(c, x) {
-    return (f, b, p) => {
-      let m = 0, a = f.length - 1, u, g;
-      if (a >= 0 && (u = f[a]) instanceof O) {
-        if (!a && u.type == c && u.length == p)
-          return u;
-        (g = u.prop(k.lookAhead)) && (m = b[a] + u.length + g);
+  function N(c, b) {
+    return (f, m, d) => {
+      let w = 0, a = f.length - 1, o, g;
+      if (a >= 0 && (o = f[a]) instanceof P) {
+        if (!a && o.type == c && o.length == d)
+          return o;
+        (g = o.prop(k.lookAhead)) && (w = m[a] + o.length + g);
       }
-      return M(c, f, b, p, m, x);
+      return L(c, f, m, d, w, b);
     };
   }
-  function A(c, x, f, b, p, m, a, u, g) {
-    let y = [], _ = [];
-    for (; c.length > b; )
-      y.push(c.pop()), _.push(x.pop() + f - p);
-    c.push(M(r.types[a], y, _, m - p, u - m, g)), x.push(p - f);
+  function S(c, b, f, m, d, w, a, o, g) {
+    let y = [], A = [];
+    for (; c.length > m; )
+      y.push(c.pop()), A.push(b.pop() + f - d);
+    c.push(L(r.types[a], y, A, w - d, o - w, g)), b.push(d - f);
   }
-  function M(c, x, f, b, p, m, a) {
-    if (m) {
-      let u = [k.contextHash, m];
-      a = a ? [u].concat(a) : [u];
+  function L(c, b, f, m, d, w, a) {
+    if (w) {
+      let o = [k.contextHash, w];
+      a = a ? [o].concat(a) : [o];
     }
-    if (p > 25) {
-      let u = [k.lookAhead, p];
-      a = a ? [u].concat(a) : [u];
+    if (d > 25) {
+      let o = [k.lookAhead, d];
+      a = a ? [o].concat(a) : [o];
     }
-    return new O(c, x, f, b, a);
+    return new P(c, b, f, m, a);
   }
-  function Y(c, x) {
-    let f = h.fork(), b = 0, p = 0, m = 0, a = f.end - i, u = { size: 0, start: 0, skip: 0 };
+  function Y(c, b) {
+    let f = h.fork(), m = 0, d = 0, w = 0, a = f.end - i, o = { size: 0, start: 0, skip: 0 };
     e: for (let g = f.pos - c; f.pos > g; ) {
       let y = f.size;
-      if (f.id == x && y >= 0) {
-        u.size = b, u.start = p, u.skip = m, m += 4, b += 4, f.next();
+      if (f.id == b && y >= 0) {
+        o.size = m, o.start = d, o.skip = w, w += 4, m += 4, f.next();
         continue;
       }
-      let _ = f.pos - y;
-      if (y < 0 || _ < g || f.start < a)
+      let A = f.pos - y;
+      if (y < 0 || A < g || f.start < a)
         break;
-      let L = f.id >= s ? 4 : 0, J = f.start;
-      for (f.next(); f.pos > _; ) {
+      let W = f.id >= s ? 4 : 0, J = f.start;
+      for (f.next(); f.pos > A; ) {
         if (f.size < 0)
           if (f.size == -3 || f.size == -4)
-            L += 4;
+            W += 4;
           else
             break e;
-        else f.id >= s && (L += 4);
+        else f.id >= s && (W += 4);
         f.next();
       }
-      p = J, b += y, m += L;
+      d = J, m += y, w += W;
     }
-    return (x < 0 || b == c) && (u.size = b, u.start = p, u.skip = m), u.size > 4 ? u : void 0;
+    return (b < 0 || m == c) && (o.size = m, o.start = d, o.skip = w), o.size > 4 ? o : void 0;
   }
-  function G(c, x, f) {
-    let { id: b, start: p, end: m, size: a } = h;
-    if (h.next(), a >= 0 && b < s) {
-      let u = f;
+  function G(c, b, f) {
+    let { id: m, start: d, end: w, size: a } = h;
+    if (h.next(), a >= 0 && m < s) {
+      let o = f;
       if (a > 4) {
         let g = h.pos - (a - 4);
         for (; h.pos > g; )
-          f = G(c, x, f);
+          f = G(c, b, f);
       }
-      x[--f] = u, x[--f] = m - c, x[--f] = p - c, x[--f] = b;
-    } else a == -3 ? C = b : a == -4 && (d = b);
+      b[--f] = o, b[--f] = w - c, b[--f] = d - c, b[--f] = m;
+    } else a == -3 ? C = m : a == -4 && (v = m);
     return f;
   }
-  let T = [], v = [];
+  let T = [], B = [];
   for (; h.pos > 0; )
-    S(l.start || 0, l.bufferStart || 0, T, v, -1, 0);
-  let U = (e = l.length) !== null && e !== void 0 ? e : T.length ? v[0] + T[0].length : 0;
-  return new O(o[l.topID], T.reverse(), v.reverse(), U);
+    p(l.start || 0, l.bufferStart || 0, T, B, -1, 0);
+  let U = (e = l.length) !== null && e !== void 0 ? e : T.length ? B[0] + T[0].length : 0;
+  return new P(u[l.topID], T.reverse(), B.reverse(), U);
 }
 const oe = /* @__PURE__ */ new WeakMap();
-function Q(l, e) {
-  if (!l.isAnonymous || e instanceof W || e.type != l)
+function X(l, e) {
+  if (!l.isAnonymous || e instanceof M || e.type != l)
     return 1;
   let t = oe.get(e);
   if (t == null) {
     t = 1;
     for (let r of e.children) {
-      if (r.type != l || !(r instanceof O)) {
+      if (r.type != l || !(r instanceof P)) {
         t = 1;
         break;
       }
-      t += Q(l, r);
+      t += X(l, r);
     }
     oe.set(e, t);
   }
   return t;
 }
-function se(l, e, t, r, i, n, s, h, o) {
+function se(l, e, t, r, i, n, s, h, u) {
   let C = 0;
-  for (let A = r; A < i; A++)
-    C += Q(l, e[A]);
-  let d = Math.ceil(
+  for (let S = r; S < i; S++)
+    C += X(l, e[S]);
+  let v = Math.ceil(
     C * 1.5 / 8
     /* Balance.BranchFactor */
-  ), S = [], w = [];
-  function I(A, M, Y, G, T) {
-    for (let v = Y; v < G; ) {
-      let U = v, c = M[v], x = Q(l, A[v]);
-      for (v++; v < G; v++) {
-        let f = Q(l, A[v]);
-        if (x + f >= d)
+  ), p = [], x = [];
+  function N(S, L, Y, G, T) {
+    for (let B = Y; B < G; ) {
+      let U = B, c = L[B], b = X(l, S[B]);
+      for (B++; B < G; B++) {
+        let f = X(l, S[B]);
+        if (b + f >= v)
           break;
-        x += f;
+        b += f;
       }
-      if (v == U + 1) {
-        if (x > d) {
-          let f = A[U];
-          I(f.children, f.positions, 0, f.children.length, M[U] + T);
+      if (B == U + 1) {
+        if (b > v) {
+          let f = S[U];
+          N(f.children, f.positions, 0, f.children.length, L[U] + T);
           continue;
         }
-        S.push(A[U]);
+        p.push(S[U]);
       } else {
-        let f = M[v - 1] + A[v - 1].length - c;
-        S.push(se(l, A, M, U, v, c, f, null, o));
+        let f = L[B - 1] + S[B - 1].length - c;
+        p.push(se(l, S, L, U, B, c, f, null, u));
       }
-      w.push(c + T - n);
+      x.push(c + T - n);
     }
   }
-  return I(e, t, r, i, 0), (h || o)(S, w, s);
+  return N(e, t, r, i, 0), (h || u)(p, x, s);
 }
 class Se {
   constructor() {
@@ -1279,13 +1280,13 @@ class Se {
   Set the value for this syntax node.
   */
   set(e, t) {
-    e instanceof E ? this.setBuffer(e.context.buffer, e.index, t) : e instanceof z && this.map.set(e.tree, t);
+    e instanceof O ? this.setBuffer(e.context.buffer, e.index, t) : e instanceof z && this.map.set(e.tree, t);
   }
   /**
   Retrieve value for this syntax node, if it exists in the map.
   */
   get(e) {
-    return e instanceof E ? this.getBuffer(e.context.buffer, e.index) : e instanceof z ? this.map.get(e.tree) : void 0;
+    return e instanceof O ? this.getBuffer(e.context.buffer, e.index) : e instanceof z ? this.map.get(e.tree) : void 0;
   }
   /**
   Set the value for the node that a cursor currently points to.
@@ -1350,22 +1351,22 @@ class re {
     if (!t.length)
       return e;
     let i = [], n = 1, s = e.length ? e[0] : null;
-    for (let h = 0, o = 0, C = 0; ; h++) {
-      let d = h < t.length ? t[h] : null, S = d ? d.fromA : 1e9;
-      if (S - o >= r)
-        for (; s && s.from < S; ) {
-          let w = s;
-          if (o >= w.from || S <= w.to || C) {
-            let I = Math.max(w.from, o) - C, A = Math.min(w.to, S) - C;
-            w = I >= A ? null : new re(I, A, w.tree, w.offset + C, h > 0, !!d);
+    for (let h = 0, u = 0, C = 0; ; h++) {
+      let v = h < t.length ? t[h] : null, p = v ? v.fromA : 1e9;
+      if (p - u >= r)
+        for (; s && s.from < p; ) {
+          let x = s;
+          if (u >= x.from || p <= x.to || C) {
+            let N = Math.max(x.from, u) - C, S = Math.min(x.to, p) - C;
+            x = N >= S ? null : new re(N, S, x.tree, x.offset + C, h > 0, !!v);
           }
-          if (w && i.push(w), s.to > S)
+          if (x && i.push(x), s.to > p)
             break;
           s = n < e.length ? e[n++] : null;
         }
-      if (!d)
+      if (!v)
         break;
-      o = d.toA, C = d.toA - d.toB;
+      u = v.toA, C = v.toA - v.toB;
     }
     return i;
   }
@@ -1416,15 +1417,15 @@ class ke {
 new k({ perNode: !0 });
 export {
   Ce as DefaultBufferLength,
-  N as IterMode,
-  X as MountedTree,
+  _ as IterMode,
+  V as MountedTree,
   k as NodeProp,
   ae as NodeSet,
   j as NodeType,
   Se as NodeWeakMap,
   _e as Parser,
-  O as Tree,
-  W as TreeBuffer,
+  P as Tree,
+  M as TreeBuffer,
   te as TreeCursor,
   re as TreeFragment
 };