@gobolt/genesis 0.1.2 → 0.1.5

package/dist/{magic-string.es-BKBb7z-1.js → magic-string.es-D4UQQyt0.js}

@@ -1,257 +1,258 @@
-import { c as ht } from "./_commonjsHelpers-BkfeUUK-.js";
-var q = { exports: {} };
-(function(E, t) {
-  (function(e, n) {
-    n(t);
-  })(ht, function(e) {
-    const r = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", u = new Uint8Array(64), f = new Uint8Array(128);
-    for (let a = 0; a < r.length; a++) {
-      const h = r.charCodeAt(a);
-      u[a] = h, f[h] = a;
-    }
-    function o(a, h) {
-      let i = 0, l = 0, d = 0;
-      do {
-        const b = a.next();
-        d = f[b], i |= (d & 31) << l, l += 5;
-      } while (d & 32);
-      const g = i & 1;
-      return i >>>= 1, g && (i = -2147483648 | -i), h + i;
-    }
-    function c(a, h, i) {
-      let l = h - i;
-      l = l < 0 ? -l << 1 | 1 : l << 1;
-      do {
-        let d = l & 31;
-        l >>>= 5, l > 0 && (d |= 32), a.write(u[d]);
-      } while (l > 0);
-      return h;
-    }
-    function k(a, h) {
-      return a.pos >= h ? !1 : a.peek() !== 44;
-    }
-    const O = 1024 * 16, z = typeof TextDecoder < "u" ? /* @__PURE__ */ new TextDecoder() : typeof Buffer < "u" ? {
-      decode(a) {
-        return Buffer.from(a.buffer, a.byteOffset, a.byteLength).toString();
-      }
-    } : {
-      decode(a) {
-        let h = "";
-        for (let i = 0; i < a.length; i++)
-          h += String.fromCharCode(a[i]);
-        return h;
-      }
-    };
-    class P {
-      constructor() {
-        this.pos = 0, this.out = "", this.buffer = new Uint8Array(O);
-      }
-      write(h) {
-        const { buffer: i } = this;
-        i[this.pos++] = h, this.pos === O && (this.out += z.decode(i), this.pos = 0);
-      }
-      flush() {
-        const { buffer: h, out: i, pos: l } = this;
-        return l > 0 ? i + z.decode(h.subarray(0, l)) : i;
-      }
-    }
-    class G {
-      constructor(h) {
-        this.pos = 0, this.buffer = h;
+var M = { exports: {} }, lt = M.exports, K;
+function ut() {
+  return K || (K = 1, function(E, t) {
+    (function(e, n) {
+      n(t);
+    })(lt, function(e) {
+      const r = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", u = new Uint8Array(64), f = new Uint8Array(128);
+      for (let a = 0; a < r.length; a++) {
+        const h = r.charCodeAt(a);
+        u[a] = h, f[h] = a;
       }
-      next() {
-        return this.buffer.charCodeAt(this.pos++);
+      function o(a, h) {
+        let i = 0, l = 0, d = 0;
+        do {
+          const b = a.next();
+          d = f[b], i |= (d & 31) << l, l += 5;
+        } while (d & 32);
+        const g = i & 1;
+        return i >>>= 1, g && (i = -2147483648 | -i), h + i;
       }
-      peek() {
-        return this.buffer.charCodeAt(this.pos);
+      function c(a, h, i) {
+        let l = h - i;
+        l = l < 0 ? -l << 1 | 1 : l << 1;
+        do {
+          let d = l & 31;
+          l >>>= 5, l > 0 && (d |= 32), a.write(u[d]);
+        } while (l > 0);
+        return h;
       }
-      indexOf(h) {
-        const { buffer: i, pos: l } = this, d = i.indexOf(h, l);
-        return d === -1 ? i.length : d;
+      function k(a, h) {
+        return a.pos >= h ? !1 : a.peek() !== 44;
       }
-    }
-    const F = [];
-    function X(a) {
-      const { length: h } = a, i = new G(a), l = [], d = [];
-      let g = 0;
-      for (; i.pos < h; i.pos++) {
-        g = o(i, g);
-        const b = o(i, 0);
-        if (!k(i, h)) {
-          const v = d.pop();
-          v[2] = g, v[3] = b;
-          continue;
+      const O = 1024 * 16, z = typeof TextDecoder < "u" ? /* @__PURE__ */ new TextDecoder() : typeof Buffer < "u" ? {
+        decode(a) {
+          return Buffer.from(a.buffer, a.byteOffset, a.byteLength).toString();
+        }
+      } : {
+        decode(a) {
+          let h = "";
+          for (let i = 0; i < a.length; i++)
+            h += String.fromCharCode(a[i]);
+          return h;
+        }
+      };
+      class D {
+        constructor() {
+          this.pos = 0, this.out = "", this.buffer = new Uint8Array(O);
         }
-        const m = o(i, 0), w = o(i, 0) & 1 ? [g, b, 0, 0, m, o(i, 0)] : [g, b, 0, 0, m];
-        let y = F;
-        if (k(i, h)) {
-          y = [];
-          do {
-            const v = o(i, 0);
-            y.push(v);
-          } while (k(i, h));
+        write(h) {
+          const { buffer: i } = this;
+          i[this.pos++] = h, this.pos === O && (this.out += z.decode(i), this.pos = 0);
+        }
+        flush() {
+          const { buffer: h, out: i, pos: l } = this;
+          return l > 0 ? i + z.decode(h.subarray(0, l)) : i;
         }
-        w.vars = y, l.push(w), d.push(w);
       }
-      return l;
-    }
-    function Z(a) {
-      const h = new P();
-      for (let i = 0; i < a.length; )
-        i = H(a, i, h, [0]);
-      return h.flush();
-    }
-    function H(a, h, i, l) {
-      const d = a[h], { 0: g, 1: b, 2: m, 3: S, 4: C, vars: w } = d;
-      h > 0 && i.write(44), l[0] = c(i, g, l[0]), c(i, b, 0), c(i, C, 0);
-      const y = d.length === 6 ? 1 : 0;
-      c(i, y, 0), d.length === 6 && c(i, d[5], 0);
-      for (const v of w)
-        c(i, v, 0);
-      for (h++; h < a.length; ) {
-        const v = a[h], { 0: p, 1: x } = v;
-        if (p > m || p === m && x >= S)
-          break;
-        h = H(a, h, i, l);
+      class G {
+        constructor(h) {
+          this.pos = 0, this.buffer = h;
+        }
+        next() {
+          return this.buffer.charCodeAt(this.pos++);
+        }
+        peek() {
+          return this.buffer.charCodeAt(this.pos);
+        }
+        indexOf(h) {
+          const { buffer: i, pos: l } = this, d = i.indexOf(h, l);
+          return d === -1 ? i.length : d;
+        }
       }
-      return i.write(44), l[0] = c(i, m, l[0]), c(i, S, 0), h;
-    }
-    function V(a) {
-      const { length: h } = a, i = new G(a), l = [], d = [];
-      let g = 0, b = 0, m = 0, S = 0, C = 0, w = 0, y = 0, v = 0;
-      do {
-        const p = i.indexOf(";");
-        let x = 0;
-        for (; i.pos < p; i.pos++) {
-          if (x = o(i, x), !k(i, p)) {
-            const L = d.pop();
-            L[2] = g, L[3] = x;
+      const F = [];
+      function Z(a) {
+        const { length: h } = a, i = new G(a), l = [], d = [];
+        let g = 0;
+        for (; i.pos < h; i.pos++) {
+          g = o(i, g);
+          const b = o(i, 0);
+          if (!k(i, h)) {
+            const v = d.pop();
+            v[2] = g, v[3] = b;
             continue;
           }
-          const R = o(i, 0), U = R & 1, A = R & 2, T = R & 4;
-          let Y = null, D = F, _;
-          if (U) {
-            const L = o(i, b);
-            m = o(i, b === L ? m : 0), b = L, _ = [g, x, 0, 0, L, m];
-          } else
-            _ = [g, x, 0, 0];
-          if (_.isScope = !!T, A) {
-            const L = S, I = C;
-            S = o(i, S);
-            const j = L === S;
-            C = o(i, j ? C : 0), w = o(i, j && I === C ? w : 0), Y = [S, C, w];
-          }
-          if (_.callsite = Y, k(i, p)) {
-            D = [];
+          const m = o(i, 0), w = o(i, 0) & 1 ? [g, b, 0, 0, m, o(i, 0)] : [g, b, 0, 0, m];
+          let y = F;
+          if (k(i, h)) {
+            y = [];
             do {
-              y = g, v = x;
-              const L = o(i, 0);
-              let I;
-              if (L < -1) {
-                I = [[o(i, 0)]];
-                for (let j = -1; j > L; j--) {
-                  const rt = y;
-                  y = o(i, y), v = o(i, y === rt ? v : 0);
-                  const ot = o(i, 0);
-                  I.push([ot, y, v]);
-                }
-              } else
-                I = [[L]];
-              D.push(I);
-            } while (k(i, p));
+              const v = o(i, 0);
+              y.push(v);
+            } while (k(i, h));
           }
-          _.bindings = D, l.push(_), d.push(_);
+          w.vars = y, l.push(w), d.push(w);
         }
-        g++, i.pos = p + 1;
-      } while (i.pos < h);
-      return l;
-    }
-    function tt(a) {
-      if (a.length === 0)
-        return "";
-      const h = new P();
-      for (let i = 0; i < a.length; )
-        i = J(a, i, h, [0, 0, 0, 0, 0, 0, 0]);
-      return h.flush();
-    }
-    function J(a, h, i, l) {
-      const d = a[h], { 0: g, 1: b, 2: m, 3: S, isScope: C, callsite: w, bindings: y } = d;
-      l[0] < g ? (W(i, l[0], g), l[0] = g, l[1] = 0) : h > 0 && i.write(44), l[1] = c(i, d[1], l[1]);
-      const v = (d.length === 6 ? 1 : 0) | (w ? 2 : 0) | (C ? 4 : 0);
-      if (c(i, v, 0), d.length === 6) {
-        const { 4: p, 5: x } = d;
-        p !== l[2] && (l[3] = 0), l[2] = c(i, p, l[2]), l[3] = c(i, x, l[3]);
+        return l;
       }
-      if (w) {
-        const { 0: p, 1: x, 2: R } = d.callsite;
-        p !== l[4] ? (l[5] = 0, l[6] = 0) : x !== l[5] && (l[6] = 0), l[4] = c(i, p, l[4]), l[5] = c(i, x, l[5]), l[6] = c(i, R, l[6]);
+      function V(a) {
+        const h = new D();
+        for (let i = 0; i < a.length; )
+          i = H(a, i, h, [0]);
+        return h.flush();
       }
-      if (y)
-        for (const p of y) {
-          p.length > 1 && c(i, -p.length, 0);
-          const x = p[0][0];
-          c(i, x, 0);
-          let R = g, U = b;
-          for (let A = 1; A < p.length; A++) {
-            const T = p[A];
-            R = c(i, T[1], R), U = c(i, T[2], U), c(i, T[0], 0);
-          }
+      function H(a, h, i, l) {
+        const d = a[h], { 0: g, 1: b, 2: m, 3: S, 4: C, vars: w } = d;
+        h > 0 && i.write(44), l[0] = c(i, g, l[0]), c(i, b, 0), c(i, C, 0);
+        const y = d.length === 6 ? 1 : 0;
+        c(i, y, 0), d.length === 6 && c(i, d[5], 0);
+        for (const v of w)
+          c(i, v, 0);
+        for (h++; h < a.length; ) {
+          const v = a[h], { 0: p, 1: x } = v;
+          if (p > m || p === m && x >= S)
+            break;
+          h = H(a, h, i, l);
         }
-      for (h++; h < a.length; ) {
-        const p = a[h], { 0: x, 1: R } = p;
-        if (x > m || x === m && R >= S)
-          break;
-        h = J(a, h, i, l);
+        return i.write(44), l[0] = c(i, m, l[0]), c(i, S, 0), h;
       }
-      return l[0] < m ? (W(i, l[0], m), l[0] = m, l[1] = 0) : i.write(44), l[1] = c(i, S, l[1]), h;
-    }
-    function W(a, h, i) {
-      do
-        a.write(59);
-      while (++h < i);
-    }
-    function et(a) {
-      const { length: h } = a, i = new G(a), l = [];
-      let d = 0, g = 0, b = 0, m = 0, S = 0;
-      do {
-        const C = i.indexOf(";"), w = [];
-        let y = !0, v = 0;
-        for (d = 0; i.pos < C; ) {
-          let p;
-          d = o(i, d), d < v && (y = !1), v = d, k(i, C) ? (g = o(i, g), b = o(i, b), m = o(i, m), k(i, C) ? (S = o(i, S), p = [d, g, b, m, S]) : p = [d, g, b, m]) : p = [d], w.push(p), i.pos++;
+      function tt(a) {
+        const { length: h } = a, i = new G(a), l = [], d = [];
+        let g = 0, b = 0, m = 0, S = 0, C = 0, w = 0, y = 0, v = 0;
+        do {
+          const p = i.indexOf(";");
+          let x = 0;
+          for (; i.pos < p; i.pos++) {
+            if (x = o(i, x), !k(i, p)) {
+              const L = d.pop();
+              L[2] = g, L[3] = x;
+              continue;
+            }
+            const R = o(i, 0), B = R & 1, A = R & 2, T = R & 4;
+            let Y = null, q = F, _;
+            if (B) {
+              const L = o(i, b);
+              m = o(i, b === L ? m : 0), b = L, _ = [g, x, 0, 0, L, m];
+            } else
+              _ = [g, x, 0, 0];
+            if (_.isScope = !!T, A) {
+              const L = S, I = C;
+              S = o(i, S);
+              const j = L === S;
+              C = o(i, j ? C : 0), w = o(i, j && I === C ? w : 0), Y = [S, C, w];
+            }
+            if (_.callsite = Y, k(i, p)) {
+              q = [];
+              do {
+                y = g, v = x;
+                const L = o(i, 0);
+                let I;
+                if (L < -1) {
+                  I = [[o(i, 0)]];
+                  for (let j = -1; j > L; j--) {
+                    const ot = y;
+                    y = o(i, y), v = o(i, y === ot ? v : 0);
+                    const ht = o(i, 0);
+                    I.push([ht, y, v]);
+                  }
+                } else
+                  I = [[L]];
+                q.push(I);
+              } while (k(i, p));
+            }
+            _.bindings = q, l.push(_), d.push(_);
+          }
+          g++, i.pos = p + 1;
+        } while (i.pos < h);
+        return l;
+      }
+      function et(a) {
+        if (a.length === 0)
+          return "";
+        const h = new D();
+        for (let i = 0; i < a.length; )
+          i = J(a, i, h, [0, 0, 0, 0, 0, 0, 0]);
+        return h.flush();
+      }
+      function J(a, h, i, l) {
+        const d = a[h], { 0: g, 1: b, 2: m, 3: S, isScope: C, callsite: w, bindings: y } = d;
+        l[0] < g ? (W(i, l[0], g), l[0] = g, l[1] = 0) : h > 0 && i.write(44), l[1] = c(i, d[1], l[1]);
+        const v = (d.length === 6 ? 1 : 0) | (w ? 2 : 0) | (C ? 4 : 0);
+        if (c(i, v, 0), d.length === 6) {
+          const { 4: p, 5: x } = d;
+          p !== l[2] && (l[3] = 0), l[2] = c(i, p, l[2]), l[3] = c(i, x, l[3]);
         }
-        y || nt(w), l.push(w), i.pos = C + 1;
-      } while (i.pos <= h);
-      return l;
-    }
-    function nt(a) {
-      a.sort(it);
-    }
-    function it(a, h) {
-      return a[0] - h[0];
-    }
-    function st(a) {
-      const h = new P();
-      let i = 0, l = 0, d = 0, g = 0;
-      for (let b = 0; b < a.length; b++) {
-        const m = a[b];
-        if (b > 0 && h.write(59), m.length === 0)
-          continue;
-        let S = 0;
-        for (let C = 0; C < m.length; C++) {
-          const w = m[C];
-          C > 0 && h.write(44), S = c(h, w[0], S), w.length !== 1 && (i = c(h, w[1], i), l = c(h, w[2], l), d = c(h, w[3], d), w.length !== 4 && (g = c(h, w[4], g)));
+        if (w) {
+          const { 0: p, 1: x, 2: R } = d.callsite;
+          p !== l[4] ? (l[5] = 0, l[6] = 0) : x !== l[5] && (l[6] = 0), l[4] = c(i, p, l[4]), l[5] = c(i, x, l[5]), l[6] = c(i, R, l[6]);
+        }
+        if (y)
+          for (const p of y) {
+            p.length > 1 && c(i, -p.length, 0);
+            const x = p[0][0];
+            c(i, x, 0);
+            let R = g, B = b;
+            for (let A = 1; A < p.length; A++) {
+              const T = p[A];
+              R = c(i, T[1], R), B = c(i, T[2], B), c(i, T[0], 0);
+            }
+          }
+        for (h++; h < a.length; ) {
+          const p = a[h], { 0: x, 1: R } = p;
+          if (x > m || x === m && R >= S)
+            break;
+          h = J(a, h, i, l);
         }
+        return l[0] < m ? (W(i, l[0], m), l[0] = m, l[1] = 0) : i.write(44), l[1] = c(i, S, l[1]), h;
       }
-      return h.flush();
-    }
-    e.decode = et, e.decodeGeneratedRanges = V, e.decodeOriginalScopes = X, e.encode = st, e.encodeGeneratedRanges = tt, e.encodeOriginalScopes = Z, Object.defineProperty(e, "__esModule", { value: !0 });
-  });
-})(q, q.exports);
-var lt = q.exports;
-class B {
+      function W(a, h, i) {
+        do
+          a.write(59);
+        while (++h < i);
+      }
+      function nt(a) {
+        const { length: h } = a, i = new G(a), l = [];
+        let d = 0, g = 0, b = 0, m = 0, S = 0;
+        do {
+          const C = i.indexOf(";"), w = [];
+          let y = !0, v = 0;
+          for (d = 0; i.pos < C; ) {
+            let p;
+            d = o(i, d), d < v && (y = !1), v = d, k(i, C) ? (g = o(i, g), b = o(i, b), m = o(i, m), k(i, C) ? (S = o(i, S), p = [d, g, b, m, S]) : p = [d, g, b, m]) : p = [d], w.push(p), i.pos++;
+          }
+          y || it(w), l.push(w), i.pos = C + 1;
+        } while (i.pos <= h);
+        return l;
+      }
+      function it(a) {
+        a.sort(st);
+      }
+      function st(a, h) {
+        return a[0] - h[0];
+      }
+      function rt(a) {
+        const h = new D();
+        let i = 0, l = 0, d = 0, g = 0;
+        for (let b = 0; b < a.length; b++) {
+          const m = a[b];
+          if (b > 0 && h.write(59), m.length === 0)
+            continue;
+          let S = 0;
+          for (let C = 0; C < m.length; C++) {
+            const w = m[C];
+            C > 0 && h.write(44), S = c(h, w[0], S), w.length !== 1 && (i = c(h, w[1], i), l = c(h, w[2], l), d = c(h, w[3], d), w.length !== 4 && (g = c(h, w[4], g)));
+          }
+        }
+        return h.flush();
+      }
+      e.decode = nt, e.decodeGeneratedRanges = tt, e.decodeOriginalScopes = Z, e.encode = rt, e.encodeGeneratedRanges = et, e.encodeOriginalScopes = V, Object.defineProperty(e, "__esModule", { value: !0 });
+    });
+  }(M, M.exports)), M.exports;
+}
+var ct = ut();
+class P {
   constructor(t) {
-    this.bits = t instanceof B ? t.bits.slice() : [];
+    this.bits = t instanceof P ? t.bits.slice() : [];
   }
   add(t) {
     this.bits[t >> 5] |= 1 << (t & 31);
@@ -260,7 +261,7 @@ class B {
     return !!(this.bits[t >> 5] & 1 << (t & 31));
   }
 }
-class M {
+class U {
   constructor(t, e, n) {
     this.start = t, this.end = e, this.original = n, this.intro = "", this.outro = "", this.content = n, this.storeName = !1, this.edited = !1, this.previous = null, this.next = null;
   }
@@ -271,7 +272,7 @@ class M {
     this.intro = this.intro + t;
   }
   clone() {
-    const t = new M(this.start, this.end, this.original);
+    const t = new U(this.start, this.end, this.original);
     return t.intro = this.intro, t.outro = this.outro, t.content = this.content, t.storeName = this.storeName, t.edited = this.edited, t;
   }
   contains(t) {
@@ -302,7 +303,7 @@ class M {
   split(t) {
     const e = t - this.start, n = this.original.slice(0, e), s = this.original.slice(e);
     this.original = n;
-    const r = new M(t, this.end, s);
+    const r = new U(t, this.end, s);
     return r.outro = this.outro, this.outro = "", this.end = t, this.edited ? (r.edit("", !1), this.content = "") : this.content = n, r.next = this.next, r.next && (r.next.previous = r), r.previous = this, this.next = r, r;
   }
   toString() {
@@ -327,24 +328,24 @@ class M {
     } else if (this.edit("", void 0, !0), this.outro = this.outro.replace(t, ""), this.outro.length) return !0;
   }
 }
-function ut() {
+function at() {
   return typeof globalThis < "u" && typeof globalThis.btoa == "function" ? (E) => globalThis.btoa(unescape(encodeURIComponent(E))) : typeof Buffer == "function" ? (E) => Buffer.from(E, "utf-8").toString("base64") : () => {
     throw new Error("Unsupported environment: `window.btoa` or `Buffer` should be supported.");
   };
 }
-const ct = /* @__PURE__ */ ut();
-class at {
+const ft = /* @__PURE__ */ at();
+class dt {
   constructor(t) {
-    this.version = 3, this.file = t.file, this.sources = t.sources, this.sourcesContent = t.sourcesContent, this.names = t.names, this.mappings = lt.encode(t.mappings), typeof t.x_google_ignoreList < "u" && (this.x_google_ignoreList = t.x_google_ignoreList), typeof t.debugId < "u" && (this.debugId = t.debugId);
+    this.version = 3, this.file = t.file, this.sources = t.sources, this.sourcesContent = t.sourcesContent, this.names = t.names, this.mappings = ct.encode(t.mappings), typeof t.x_google_ignoreList < "u" && (this.x_google_ignoreList = t.x_google_ignoreList), typeof t.debugId < "u" && (this.debugId = t.debugId);
   }
   toString() {
     return JSON.stringify(this);
   }
   toUrl() {
-    return "data:application/json;charset=utf-8;base64," + ct(this.toString());
+    return "data:application/json;charset=utf-8;base64," + ft(this.toString());
   }
 }
-function ft(E) {
+function gt(E) {
   const t = E.split(`
 `), e = t.filter((r) => /^\t+/.test(r)), n = t.filter((r) => /^ {2,}/.test(r));
   if (e.length === 0 && n.length === 0)
@@ -357,7 +358,7 @@ function ft(E) {
   }, 1 / 0);
   return new Array(s + 1).join(" ");
 }
-function dt(E, t) {
+function pt(E, t) {
   const e = E.split(/[/\\]/), n = t.split(/[/\\]/);
   for (e.pop(); e[0] === n[0]; )
     e.shift(), n.shift();
@@ -367,11 +368,11 @@ function dt(E, t) {
   }
   return e.concat(n).join("/");
 }
-const gt = Object.prototype.toString;
-function pt(E) {
-  return gt.call(E) === "[object Object]";
+const mt = Object.prototype.toString;
+function wt(E) {
+  return mt.call(E) === "[object Object]";
 }
-function K(E) {
+function Q(E) {
   const t = E.split(`
 `), e = [];
   for (let n = 0, s = 0; n < t.length; n++)
@@ -386,8 +387,8 @@ function K(E) {
     return { line: f, column: o };
   };
 }
-const mt = /\w/;
-class wt {
+const bt = /\w/;
+class Ct {
   constructor(t) {
     this.hires = t, this.generatedCodeLine = 0, this.generatedCodeColumn = 0, this.raw = [], this.rawSegments = this.raw[this.generatedCodeLine] = [], this.pending = null;
   }
@@ -415,7 +416,7 @@ class wt {
       else {
         if (this.hires || f || r.has(u)) {
           const c = [this.generatedCodeColumn, t, s.line, s.column];
-          this.hires === "boundary" ? mt.test(n[u]) ? o || (this.rawSegments.push(c), o = !0) : (this.rawSegments.push(c), o = !1) : this.rawSegments.push(c);
+          this.hires === "boundary" ? bt.test(n[u]) ? o || (this.rawSegments.push(c), o = !0) : (this.rawSegments.push(c), o = !1) : this.rawSegments.push(c);
         }
         s.column += 1, this.generatedCodeColumn += 1, f = !1;
       }
@@ -441,9 +442,9 @@ const $ = `
   insertRight: !1,
   storeName: !1
 };
-class Q {
+class X {
   constructor(t, e = {}) {
-    const n = new M(0, t.length, t);
+    const n = new U(0, t.length, t);
     Object.defineProperties(this, {
       original: { writable: !0, value: t },
       outro: { writable: !0, value: "" },
@@ -455,7 +456,7 @@ class Q {
       byEnd: { writable: !0, value: {} },
       filename: { writable: !0, value: e.filename },
       indentExclusionRanges: { writable: !0, value: e.indentExclusionRanges },
-      sourcemapLocations: { writable: !0, value: new B() },
+      sourcemapLocations: { writable: !0, value: new P() },
       storedNames: { writable: !0, value: {} },
       indentStr: { writable: !0, value: void 0 },
       ignoreList: { writable: !0, value: e.ignoreList },
@@ -482,18 +483,18 @@ class Q {
     return n ? n.appendRight(e) : this.outro += e, this;
   }
   clone() {
-    const t = new Q(this.original, { filename: this.filename, offset: this.offset });
+    const t = new X(this.original, { filename: this.filename, offset: this.offset });
     let e = this.firstChunk, n = t.firstChunk = t.lastSearchedChunk = e.clone();
     for (; e; ) {
       t.byStart[n.start] = n, t.byEnd[n.end] = n;
       const s = e.next, r = s && s.clone();
       r && (n.next = r, r.previous = n, n = r), e = s;
     }
-    return t.lastChunk = n, this.indentExclusionRanges && (t.indentExclusionRanges = this.indentExclusionRanges.slice()), t.sourcemapLocations = new B(this.sourcemapLocations), t.intro = this.intro, t.outro = this.outro, t;
+    return t.lastChunk = n, this.indentExclusionRanges && (t.indentExclusionRanges = this.indentExclusionRanges.slice()), t.sourcemapLocations = new P(this.sourcemapLocations), t.intro = this.intro, t.outro = this.outro, t;
   }
   generateDecodedMap(t) {
     t = t || {};
-    const e = 0, n = Object.keys(this.storedNames), s = new wt(t.hires), r = K(this.original);
+    const e = 0, n = Object.keys(this.storedNames), s = new Ct(t.hires), r = Q(this.original);
     return this.intro && s.advance(this.intro), this.firstChunk.eachNext((u) => {
       const f = r(u.start);
       u.intro.length && s.advance(u.intro), u.edited ? s.addEdit(
@@ -505,7 +506,7 @@ class Q {
     }), {
       file: t.file ? t.file.split(/[/\\]/).pop() : void 0,
       sources: [
-        t.source ? dt(t.file || "", t.source) : t.file || ""
+        t.source ? pt(t.file || "", t.source) : t.file || ""
       ],
       sourcesContent: t.includeContent ? [this.original] : void 0,
       names: n,
@@ -514,10 +515,10 @@ class Q {
     };
   }
   generateMap(t) {
-    return new at(this.generateDecodedMap(t));
+    return new dt(this.generateDecodedMap(t));
   }
   _ensureindentStr() {
-    this.indentStr === void 0 && (this.indentStr = ft(this.original));
+    this.indentStr === void 0 && (this.indentStr = gt(this.original));
   }
   _getRawIndentString() {
     return this._ensureindentStr(), this.indentStr;
@@ -527,7 +528,7 @@ class Q {
   }
   indent(t, e) {
     const n = /^[^\r\n]/gm;
-    if (pt(t) && (e = t, t = void 0), t === void 0 && (this._ensureindentStr(), t = this.indentStr || "	"), t === "") return this;
+    if (wt(t) && (e = t, t = void 0), t === void 0 && (this._ensureindentStr(), t = this.indentStr || "	"), t === "") return this;
     e = e || {};
     const s = {};
     e.exclude && (typeof e.exclude[0] == "number" ? [e.exclude] : e.exclude).forEach((k) => {
@@ -615,7 +616,7 @@ class Q {
       }
       f.edit(n, r, !u);
     } else {
-      const c = new M(t, e, "").edit(n, r);
+      const c = new U(t, e, "").edit(n, r);
       o.next = c, c.previous = o;
     }
     return this;
@@ -736,7 +737,7 @@ class Q {
   }
   _splitChunk(t, e) {
     if (t.edited && t.content.length) {
-      const s = K(this.original)(e);
+      const s = Q(this.original)(e);
       throw new Error(
         `Cannot split a chunk that has already been edited (${s.line}:${s.column} – "${t.original}")`
       );
@@ -853,6 +854,6 @@ class Q {
   }
 }
 export {
-  at as SourceMap,
-  Q as default
+  dt as SourceMap,
+  X as default
 };