@mlightcad/dxf-json-converter 1.10.0 → 1.10.2

package/dist/dxf-parser-worker.js

@@ -61,83 +61,83 @@ var Vr = [
     });
   }
   return new (a || (a = Promise))(function(o, c) {
-    function f(m) {
+    function m(f) {
       try {
-        l(t.next(m));
+        d(t.next(f));
       } catch (b) {
         c(b);
       }
     }
-    function d(m) {
+    function l(f) {
       try {
-        l(t.throw(m));
+        d(t.throw(f));
       } catch (b) {
         c(b);
       }
     }
-    function l(m) {
-      m.done ? o(m.value) : s(m.value).then(f, d);
+    function d(f) {
+      f.done ? o(f.value) : s(f.value).then(m, l);
     }
-    l((t = t.apply(e, n || [])).next());
+    d((t = t.apply(e, n || [])).next());
   });
 }, un = function(e, n) {
   var a = { label: 0, sent: function() {
     if (o[0] & 1) throw o[1];
     return o[1];
   }, trys: [], ops: [] }, t, s, o, c;
-  return c = { next: f(0), throw: f(1), return: f(2) }, typeof Symbol == "function" && (c[Symbol.iterator] = function() {
+  return c = { next: m(0), throw: m(1), return: m(2) }, typeof Symbol == "function" && (c[Symbol.iterator] = function() {
     return this;
   }), c;
-  function f(l) {
-    return function(m) {
-      return d([l, m]);
+  function m(d) {
+    return function(f) {
+      return l([d, f]);
     };
   }
-  function d(l) {
+  function l(d) {
     if (t) throw new TypeError("Generator is already executing.");
-    for (; c && (c = 0, l[0] && (a = 0)), a; ) try {
-      if (t = 1, s && (o = l[0] & 2 ? s.return : l[0] ? s.throw || ((o = s.return) && o.call(s), 0) : s.next) && !(o = o.call(s, l[1])).done) return o;
-      switch (s = 0, o && (l = [l[0] & 2, o.value]), l[0]) {
+    for (; c && (c = 0, d[0] && (a = 0)), a; ) try {
+      if (t = 1, s && (o = d[0] & 2 ? s.return : d[0] ? s.throw || ((o = s.return) && o.call(s), 0) : s.next) && !(o = o.call(s, d[1])).done) return o;
+      switch (s = 0, o && (d = [d[0] & 2, o.value]), d[0]) {
         case 0:
         case 1:
-          o = l;
+          o = d;
           break;
         case 4:
-          return a.label++, { value: l[1], done: !1 };
+          return a.label++, { value: d[1], done: !1 };
         case 5:
-          a.label++, s = l[1], l = [0];
+          a.label++, s = d[1], d = [0];
           continue;
         case 7:
-          l = a.ops.pop(), a.trys.pop();
+          d = a.ops.pop(), a.trys.pop();
           continue;
         default:
-          if (o = a.trys, !(o = o.length > 0 && o[o.length - 1]) && (l[0] === 6 || l[0] === 2)) {
+          if (o = a.trys, !(o = o.length > 0 && o[o.length - 1]) && (d[0] === 6 || d[0] === 2)) {
             a = 0;
             continue;
           }
-          if (l[0] === 3 && (!o || l[1] > o[0] && l[1] < o[3])) {
-            a.label = l[1];
+          if (d[0] === 3 && (!o || d[1] > o[0] && d[1] < o[3])) {
+            a.label = d[1];
             break;
           }
-          if (l[0] === 6 && a.label < o[1]) {
-            a.label = o[1], o = l;
+          if (d[0] === 6 && a.label < o[1]) {
+            a.label = o[1], o = d;
             break;
           }
           if (o && a.label < o[2]) {
-            a.label = o[2], a.ops.push(l);
+            a.label = o[2], a.ops.push(d);
             break;
           }
           o[2] && a.ops.pop(), a.trys.pop();
           continue;
       }
-      l = n.call(e, a);
-    } catch (m) {
-      l = [6, m], s = 0;
+      d = n.call(e, a);
+    } catch (f) {
+      d = [6, f], s = 0;
     } finally {
       t = o = 0;
     }
-    if (l[0] & 5) throw l[1];
-    return { value: l[0] ? l[1] : void 0, done: !0 };
+    if (d[0] & 5) throw d[1];
+    return { value: d[0] ? d[1] : void 0, done: !0 };
   }
 }, mn = function() {
   function e() {
@@ -147,31 +147,45 @@ var Vr = [
     var n = this;
     self.onmessage = function(a) {
       return pn(n, void 0, void 0, function() {
-        var t, s, o, c, f;
-        return un(this, function(d) {
-          switch (d.label) {
+        var t, s, o, c, m;
+        return un(this, function(l) {
+          switch (l.label) {
             case 0:
-              t = a.data, s = t.id, o = t.input, d.label = 1;
+              t = a.data, s = t.id, o = t.input, l.label = 1;
             case 1:
-              return d.trys.push([1, 3, , 4]), [4, this.executeTask(o)];
+              return l.trys.push([1, 3, , 4]), [4, this.executeTask(o)];
             case 2:
-              return c = d.sent(), this.sendResponse(s, !0, c), [3, 4];
+              return c = l.sent(), this.sendResponse(s, !0, c), [3, 4];
             case 3:
-              return f = d.sent(), this.sendResponse(s, !1, void 0, f instanceof Error ? f.message : String(f)), [3, 4];
+              return m = l.sent(), this.sendResponse(s, !1, void 0, m instanceof Error ? m.message : String(m)), [3, 4];
             case 4:
               return [2];
           }
         });
       });
     };
-  }, e.prototype.sendResponse = function(n, a, t, s) {
-    var o = {
+  }, e.prototype.sendResponse = function(n, a, t, s, o) {
+    var c = {
       id: n,
       success: a,
       data: t,
-      error: s
+      error: s,
+      errorCode: o
     };
-    self.postMessage(o);
+    try {
+      self.postMessage(c);
+    } catch (l) {
+      var m = l instanceof Error ? l.message : String(l);
+      self.postMessage({
+        id: n,
+        success: !1,
+        error: m,
+        errorCode: this.classifyPostMessageError(m)
+      });
+    }
+  }, e.prototype.classifyPostMessageError = function(n) {
+    var a = n.toLowerCase();
+    return a.includes("out of memory") || a.includes("data cannot be cloned") ? "worker_oom" : "worker_error";
   }, e;
 }(), Mr;
 (function(e) {
@@ -270,30 +284,30 @@ function he(e) {
 let ar = Symbol();
 function u(e, n) {
   return (a, t, s) => {
-    let o = function(d, l = !1) {
-      return d.reduce((m, b) => {
-        b.pushContext && m.push({});
-        let y = m[m.length - 1];
+    let o = function(l, d = !1) {
+      return l.reduce((f, b) => {
+        b.pushContext && f.push({});
+        let y = f[f.length - 1];
         for (let g of typeof b.code == "number" ? [b.code] : b.code) {
           let S = y[g] ?? (y[g] = []);
           b.isMultiple && S.length, S.push(b);
         }
-        return m;
+        return f;
       }, [{}]);
-    }(e, t.debug), c = !1, f = o.length - 1;
+    }(e, t.debug), c = !1, m = o.length - 1;
     for (; !h(a, 0, "EOF"); ) {
-      let d = function(A, w, V) {
+      let l = function(A, w, V) {
         return A.find((Pe, F) => {
           var _;
           return F >= V && ((_ = Pe[w]) == null ? void 0 : _.length);
         });
-      }(o, a.code, f), l = d == null ? void 0 : d[a.code], m = l == null ? void 0 : l[l.length - 1];
-      if (!d || !m) {
+      }(o, a.code, m), d = l == null ? void 0 : l[a.code], f = d == null ? void 0 : d[d.length - 1];
+      if (!l || !f) {
         t.rewind();
         break;
       }
-      m.isMultiple || d[a.code].pop();
-      let { name: b, parser: y, isMultiple: g, isReducible: S } = m, v = y == null ? void 0 : y(a, t, s);
+      f.isMultiple || l[a.code].pop();
+      let { name: b, parser: y, isMultiple: g, isReducible: S } = f, v = y == null ? void 0 : y(a, t, s);
       if (v === ar) {
         t.rewind();
         break;
@@ -302,7 +316,7 @@ function u(e, n) {
         let [A, w] = yn(s, b);
         g && !S ? (Object.prototype.hasOwnProperty.call(A, w) || (A[w] = []), A[w].push(v)) : A[w] = v;
       }
-      m.pushContext && (f -= 1), c = !0, a = t.next();
+      f.pushContext && (m -= 1), c = !0, a = t.next();
     }
     return n && Object.setPrototypeOf(s, n), c;
   };
@@ -345,14 +359,14 @@ function J(e, n, a) {
     var t;
     let s = e.value;
     if (e = n.next(), !s.startsWith("{")) {
-      n.debug, function(c, f) {
-        for (; !h(c, 102) && !h(c, 0, "EOF"); ) c = f.next();
+      n.debug, function(c, m) {
+        for (; !h(c, 102) && !h(c, 0, "EOF"); ) c = m.next();
       }(e, n), e = n.next();
       continue;
     }
     let o = s.slice(1).trim();
-    a.extensions ?? (a.extensions = {}), (t = a.extensions)[o] ?? (t[o] = []), function(c, f, d) {
-      for (; !h(c, 102, "}") && !h(c, 0, "EOF"); ) d.push(c), c = f.next();
+    a.extensions ?? (a.extensions = {}), (t = a.extensions)[o] ?? (t[o] = []), function(c, m, l) {
+      for (; !h(c, 102, "}") && !h(c, 0, "EOF"); ) l.push(c), c = m.next();
     }(e, n, a.extensions[o]), e = n.next();
   }
   n.rewind();
@@ -799,8 +813,8 @@ function _r(e, n, a = !1) {
     let c = o.trim().toLowerCase();
     if (c === "" || c === "0" || c === "false" || c === "f" || c === "no") return !1;
     if (c === "1" || c === "true" || c === "t" || c === "yes") return !0;
-    let f = Number.parseFloat(c);
-    if (!Number.isNaN(f)) return f !== 0;
+    let m = Number.parseFloat(c);
+    if (!Number.isNaN(m)) return m !== 0;
     throw TypeError("String '" + o + "' cannot be cast to Boolean type");
   }(n.trim()) : e >= 300 && e <= 369 ? s : e >= 370 && e <= 389 ? parseInt(n.trim()) : e >= 390 && e <= 399 ? s : e >= 400 && e <= 409 ? parseInt(n.trim()) : e >= 410 && e <= 419 ? s : e >= 420 && e <= 429 ? parseInt(n.trim()) : e >= 430 && e <= 439 ? s : e >= 440 && e <= 459 ? parseInt(n.trim()) : e >= 460 && e <= 469 ? parseFloat(n.trim()) : e >= 470 && e <= 481 || e === 999 || e >= 1e3 && e <= 1009 ? s : e >= 1010 && e <= 1059 ? parseFloat(n.trim()) : e >= 1060 && e <= 1071 ? parseInt(n.trim()) : s;
 }
@@ -822,25 +836,25 @@ let ma = [{ code: 330, name: "sourceBoundaryObjects", parser: r, isMultiple: !0
 function lt(e, n) {
   let a = { boundaryPathTypeFlag: e.value }, t = !!(a.boundaryPathTypeFlag & gn.Polyline), s = n.getReadIndex();
   return e = n.next(), !t && function(o, c) {
-    let f = Math.min(o.length, c + 120), d = c;
-    for (; d < f - 1; ) {
-      let l = parseInt(o[d], 10);
-      if (Number.isNaN(l)) break;
-      if (l === 93) {
-        if (d + 3 >= o.length || parseInt(o[d + 2], 10) !== 72) return !1;
-        let m = _r(72, o[d + 3]);
-        if (m === 0) return !0;
-        if (m === 1) {
-          if (d + 5 < o.length && parseInt(o[d + 4], 10) === 73) return !0;
-          if (d + 8 < o.length && parseInt(o[d + 4], 10) === 10) {
-            let b = parseInt(o[d + 8], 10);
+    let m = Math.min(o.length, c + 120), l = c;
+    for (; l < m - 1; ) {
+      let d = parseInt(o[l], 10);
+      if (Number.isNaN(d)) break;
+      if (d === 93) {
+        if (l + 3 >= o.length || parseInt(o[l + 2], 10) !== 72) return !1;
+        let f = _r(72, o[l + 3]);
+        if (f === 0) return !0;
+        if (f === 1) {
+          if (l + 5 < o.length && parseInt(o[l + 4], 10) === 73) return !0;
+          if (l + 8 < o.length && parseInt(o[l + 4], 10) === 10) {
+            let b = parseInt(o[l + 8], 10);
             if (b === 10 || b === 42) return !0;
           }
         }
         break;
       }
-      if (l === 0) break;
-      d += 2;
+      if (d === 0) break;
+      l += 2;
     }
     return !1;
   }(n.getLines(), s) && (t = !0), t ? u(ct)(e, n, a) : u(it)(e, n, a), a;
@@ -984,7 +998,7 @@ let Dt = [{ code: 90, name: "overridenSubEntityCount", parser: r }, { code: 140,
   let s = 0;
   for (; s < t.length; ) {
     let o = t[s++], c = [];
-    for (let f = 0; f < o; ++f) c.push(t[s++]);
+    for (let m = 0; m < o; ++m) c.push(t[s++]);
     a.faceIndices.push(c);
   }
 } }, { code: 10, name: "vertices", parser: i, isMultiple: !0 }, { code: 92, name: "verticesCount", parser: r }, { code: 91, name: "subdivisionLevel", parser: r }, { code: 40, name: "blendCrease", parser: r }, { code: 72, name: "isBlendCreased", parser: p }, { code: 71, name: "version", parser: r }, { code: 100, name: "subclassMarker", parser: vn, pushContext: !0 }, ...E];
@@ -1150,42 +1164,42 @@ let Mt = {}, wt = [{ code: 300, parser: function(e, n, a) {
         a.planeNormalReversed = t.value;
         break;
       case 302:
-        t.value === "LEADER{" && (a.leaderSections ?? (a.leaderSections = []), a.leaderSections.push(function(c, f) {
-          let d, l;
+        t.value === "LEADER{" && (a.leaderSections ?? (a.leaderSections = []), a.leaderSections.push(function(c, m) {
+          let l, d;
           if (c.value !== "LEADER{") return { leaderLines: [] };
-          let m = { leaderLines: [] };
-          for (; f.hasNext(); ) {
-            if ((l = f.next()).code === 303) {
-              tr(m, d);
+          let f = { leaderLines: [] };
+          for (; m.hasNext(); ) {
+            if ((d = m.next()).code === 303) {
+              tr(f, l);
               break;
             }
-            switch (l.code) {
+            switch (d.code) {
               case 290:
-                m.lastLeaderLinePointSet = l.value;
+                f.lastLeaderLinePointSet = d.value;
                 break;
               case 291:
-                m.doglegVectorSet = l.value;
+                f.doglegVectorSet = d.value;
                 break;
               case 10:
-                m.lastLeaderLinePoint = C(l, f);
+                f.lastLeaderLinePoint = C(d, m);
                 break;
               case 11:
-                m.doglegVector = C(l, f);
+                f.doglegVector = C(d, m);
                 break;
               case 12:
-                d ?? (d = {}), d.start = C(l, f);
+                l ?? (l = {}), l.start = C(d, m);
                 break;
               case 13:
-                d ?? (d = {}), d.end = C(l, f), tr(m, d), d = void 0;
+                l ?? (l = {}), l.end = C(d, m), tr(f, l), l = void 0;
                 break;
               case 90:
-                m.leaderBranchIndex = l.value;
+                f.leaderBranchIndex = d.value;
                 break;
               case 40:
-                m.doglegLength = l.value;
+                f.doglegLength = d.value;
                 break;
               case 304:
-                l.value === "LEADER_LINE{" && m.leaderLines.push(function(b, y) {
+                d.value === "LEADER_LINE{" && f.leaderLines.push(function(b, y) {
                   let g, S;
                   if (b.value !== "LEADER_LINE{") return { vertices: [] };
                   let v = { vertices: [] };
@@ -1212,10 +1226,10 @@ let Mt = {}, wt = [{ code: 300, parser: function(e, n, a) {
                     }
                   }
                   return v;
-                }(l, f));
+                }(d, m));
             }
           }
-          return m;
+          return f;
         }(t, n)));
         break;
       case 304:
@@ -1494,102 +1508,102 @@ class mr {
           break;
         case 171:
           t.cells ?? (t.cells = []), t.cells.push(function(s, o) {
-            let c = !1, f = !1, d = {};
-            for (; !s.isEOF() && o.code !== 0 && !f; ) switch (o.code) {
+            let c = !1, m = !1, l = {};
+            for (; !s.isEOF() && o.code !== 0 && !m; ) switch (o.code) {
               case 171:
                 if (c) {
-                  f = !0;
+                  m = !0;
                   continue;
                 }
-                d.cellType = o.value, c = !0, o = s.next();
+                l.cellType = o.value, c = !0, o = s.next();
                 break;
               case 172:
-                d.flagValue = o.value, o = s.next();
+                l.flagValue = o.value, o = s.next();
                 break;
               case 173:
-                d.mergedValue = o.value, o = s.next();
+                l.mergedValue = o.value, o = s.next();
                 break;
               case 174:
-                d.autoFit = o.value, o = s.next();
+                l.autoFit = o.value, o = s.next();
                 break;
               case 175:
-                d.borderWidth = o.value, o = s.next();
+                l.borderWidth = o.value, o = s.next();
                 break;
               case 176:
-                d.borderHeight = o.value, o = s.next();
+                l.borderHeight = o.value, o = s.next();
                 break;
               case 91:
-                d.overrideFlag = o.value, o = s.next();
+                l.overrideFlag = o.value, o = s.next();
                 break;
               case 178:
-                d.virtualEdgeFlag = o.value, o = s.next();
+                l.virtualEdgeFlag = o.value, o = s.next();
                 break;
               case 145:
-                d.rotation = o.value, o = s.next();
+                l.rotation = o.value, o = s.next();
                 break;
               case 345:
-                d.fieldObjetId = o.value, o = s.next();
+                l.fieldObjetId = o.value, o = s.next();
                 break;
               case 340:
-                d.blockTableRecordId = o.value, o = s.next();
+                l.blockTableRecordId = o.value, o = s.next();
                 break;
               case 146:
-                d.blockScale = o.value, o = s.next();
+                l.blockScale = o.value, o = s.next();
                 break;
               case 177:
-                d.blockAttrNum = o.value, o = s.next();
+                l.blockAttrNum = o.value, o = s.next();
                 break;
               case 7:
-                d.textStyle = o.value, o = s.next();
+                l.textStyle = o.value, o = s.next();
                 break;
               case 140:
-                d.textHeight = o.value, o = s.next();
+                l.textHeight = o.value, o = s.next();
                 break;
               case 170:
-                d.attachmentPoint = o.value, o = s.next();
+                l.attachmentPoint = o.value, o = s.next();
                 break;
               case 92:
-                d.extendedCellFlags = o.value, o = s.next();
+                l.extendedCellFlags = o.value, o = s.next();
                 break;
               case 285:
-                d.rightBorderVisibility = !!(o.value ?? !0), o = s.next();
+                l.rightBorderVisibility = !!(o.value ?? !0), o = s.next();
                 break;
               case 286:
-                d.bottomBorderVisibility = !!(o.value ?? !0), o = s.next();
+                l.bottomBorderVisibility = !!(o.value ?? !0), o = s.next();
                 break;
               case 288:
-                d.leftBorderVisibility = !!(o.value ?? !0), o = s.next();
+                l.leftBorderVisibility = !!(o.value ?? !0), o = s.next();
                 break;
               case 289:
-                d.topBorderVisibility = !!(o.value ?? !0), o = s.next();
+                l.topBorderVisibility = !!(o.value ?? !0), o = s.next();
                 break;
               case 301:
-                (function(l, m, b) {
+                (function(d, f, b) {
                   for (; b.code !== 304; ) switch (b.code) {
                     case 301:
                     case 93:
                     case 90:
                     case 94:
-                      b = m.next();
+                      b = f.next();
                       break;
                     case 1:
-                      l.text = b.value, b = m.next();
+                      d.text = b.value, b = f.next();
                       break;
                     case 300:
-                      l.attrText = b.value, b = m.next();
+                      d.attrText = b.value, b = f.next();
                       break;
                     case 302:
-                      l.text = b.value ? b.value : l.text, b = m.next();
+                      d.text = b.value ? b.value : d.text, b = f.next();
                       break;
                     default:
-                      b = m.next();
+                      b = f.next();
                   }
-                })(d, s, o), o = s.next();
+                })(l, s, o), o = s.next();
                 break;
               default:
-                return d;
+                return l;
             }
-            return c = !1, f = !1, d;
+            return c = !1, m = !1, l;
           }(n, a)), a = n.lastReadGroup;
           break;
         default:
@@ -1878,20 +1892,20 @@ function Wo(e) {
 }
 function jo(e, n = {}) {
   if (!Br(e)) throw Error("Not a binary DXF file.");
-  let { dxfVersion: a, encoding: t, r12: s } = function(l, m, b) {
+  let { dxfVersion: a, encoding: t, r12: s } = function(d, f, b) {
     let y, g = !function(F) {
       let _ = Re.length;
       return F.length < _ + 9 || (F[_] === 0 && F[_ + 1] === 0 ? Yr(F.subarray(_ + 2, _ + 9)) === "SECTION" : F[_] !== 0 || Yr(F.subarray(_ + 1, _ + 8)) !== "SECTION");
-    }(l), S = new DataView(l.buffer, l.byteOffset, l.byteLength), v = jr(b), A = "AC1009", w = m, V = Re.length, Pe = Math.min(l.length, V + 8192);
+    }(d), S = new DataView(d.buffer, d.byteOffset, d.byteLength), v = jr(b), A = "AC1009", w = f, V = Re.length, Pe = Math.min(d.length, V + 8192);
     for (; V < Pe; ) {
-      let [F, _] = sr(l, V, g), [Ie, Er] = ir(l, S, _, F, w, v);
+      let [F, _] = sr(d, V, g), [Ie, Er] = ir(d, S, _, F, w, v);
       if (F === 9 && Ie === "$ACADVER") {
-        let [_e, gr] = sr(l, Er, g), [xr, yr] = ir(l, S, gr, _e, "utf-8", v);
+        let [_e, gr] = sr(d, Er, g), [xr, yr] = ir(d, S, gr, _e, "utf-8", v);
         _e === 1 && (A = xr), V = yr;
         continue;
       }
       if (F === 9 && Ie === "$DWGCODEPAGE") {
-        let [_e, gr] = sr(l, Er, g), [xr, yr] = ir(l, S, gr, _e, "ascii", v);
+        let [_e, gr] = sr(d, Er, g), [xr, yr] = ir(d, S, gr, _e, "ascii", v);
         (_e === 3 || _e === 1) && (y = xr), V = yr;
         continue;
       }
@@ -1902,13 +1916,13 @@ function jo(e, n = {}) {
       if (!_) return;
       let Ie = _[1];
       return Ie === "1252" ? "windows-1252" : Ie === "949" ? "euc-kr" : `windows-${Ie}`;
-    }(y) ?? m), { dxfVersion: A, encoding: w, r12: g };
-  }(e, n.encoding ?? "windows-1252", n.encodingFailureFatal ?? !1), o = [], c = new DataView(e.buffer, e.byteOffset, e.byteLength), f = jr(n.encodingFailureFatal ?? !1), d = Re.length;
-  for (; d < e.length; ) {
-    let [l, m] = sr(e, d, s), [b, y] = ir(e, c, d = m, l, t, f);
-    if (d = y, o.push(String(l), b), l === 0 && b === "EOF") break;
+    }(y) ?? f), { dxfVersion: A, encoding: w, r12: g };
+  }(e, n.encoding ?? "windows-1252", n.encodingFailureFatal ?? !1), o = [], c = new DataView(e.buffer, e.byteOffset, e.byteLength), m = jr(n.encodingFailureFatal ?? !1), l = Re.length;
+  for (; l < e.length; ) {
+    let [d, f] = sr(e, l, s), [b, y] = ir(e, c, l = f, d, t, m);
+    if (l = y, o.push(String(d), b), d === 0 && b === "EOF") break;
   }
-  if (o.length < 2 || o[o.length - 1] !== "EOF") throw Error(`Binary DXF ended without EOF group (version ${a}, offset ${d}).`);
+  if (o.length < 2 || o[o.length - 1] !== "EOF") throw Error(`Binary DXF ended without EOF group (version ${a}, offset ${l}).`);
   return o;
 }
 function sr(e, n, a) {
@@ -1919,8 +1933,8 @@ function sr(e, n, a) {
   return [e[n] | e[n + 1] << 8, n + 2];
 }
 function ir(e, n, a, t, s, o) {
-  var c, f;
-  let d;
+  var c, m;
+  let l;
   if (Go.has(t)) {
     let b = e[a];
     a += 1;
@@ -1936,9 +1950,9 @@ function ir(e, n, a, t, s, o) {
   if (Vo.has(t)) return [String(n.getInt32(a, !0)), a + 4];
   if (Uo.has(t)) return [String(Number(n.getBigInt64(a, !0))), a + 8];
   if (Ho.has(t)) return [String(n.getFloat64(a, !0)), a + 8];
-  let l = a, m = l;
-  for (; m < e.length && e[m] !== 0; ) m++;
-  return [(c = o, f = s, (d = c.byEncoding.get(f)) || (d = new TextDecoder(f, { fatal: c.fatal }), c.byEncoding.set(f, d)), d).decode(e.subarray(l, m)), m + 1];
+  let d = a, f = d;
+  for (; f < e.length && e[f] !== 0; ) f++;
+  return [(c = o, m = s, (l = c.byEncoding.get(m)) || (l = new TextDecoder(m, { fatal: c.fatal }), c.byEncoding.set(m, l)), l).decode(e.subarray(d, f)), f + 1];
 }
 function jr(e) {
   return { fatal: e, byEncoding: /* @__PURE__ */ new Map() };
@@ -1980,9 +1994,9 @@ class zo extends EventTarget {
         typeof c == "string" ? a.push(new TextEncoder().encode(c)) : a.push(c);
       }), n.on("end", () => {
         try {
-          let c = a.reduce((l, m) => l + m.length, 0), f = new Uint8Array(c), d = 0;
-          for (let l of a) f.set(l, d), d += l.length;
-          s(t.parseBuffer(f));
+          let c = a.reduce((d, f) => d + f.length, 0), m = new Uint8Array(c), l = 0;
+          for (let d of a) m.set(d, l), l += d.length;
+          s(t.parseBuffer(m));
         } catch (c) {
           o(c);
         }
@@ -2006,22 +2020,22 @@ class zo extends EventTarget {
   parseAll(n) {
     let a = { header: {}, blocks: {}, entities: [], tables: {}, objects: { byName: {}, byTree: void 0 } }, t = n.next();
     for (; !h(t, 0, "EOF"); ) h(t, 0, "SECTION") && (h(t = n.next(), 2, "HEADER") ? a.header = oo(t = n.next(), n) : h(t, 2, "CLASSES") ? Nn(t = n.next(), n, a) : h(t, 2, "BLOCKS") ? a.blocks = So(t = n.next(), n) : h(t, 2, "ENTITIES") ? a.entities = sn(t = n.next(), n) : h(t, 2, "TABLES") ? a.tables = vo(t = n.next(), n) : h(t, 2, "OBJECTS") ? a.objects = Ro(t = n.next(), n) : h(t, 2, "THUMBNAILIMAGE") && (a.thumbnailImage = function(s, o, c = "base64") {
-      let f, d = "", l = 0;
-      for (; !h(s, 0, "EOF") && !h(s, 0, "ENDSEC"); ) s.code === 90 ? l = s.value : s.code === 310 && (d += s.value), s = o.next();
-      if (c === "hex") f = d;
+      let m, l = "", d = 0;
+      for (; !h(s, 0, "EOF") && !h(s, 0, "ENDSEC"); ) s.code === 90 ? d = s.value : s.code === 310 && (l += s.value), s = o.next();
+      if (c === "hex") m = l;
       else {
-        let m = function(b) {
+        let f = function(b) {
           let y = b.length / 2, g = new Uint8Array(y);
           for (let S = 0; S < y; S++) g[S] = parseInt(b.substr(2 * S, 2), 16);
           return g;
-        }(d);
-        f = c === "buffer" ? m : function(b) {
+        }(l);
+        m = c === "buffer" ? f : function(b) {
           let y = "";
           for (let g = 0; g < b.length; g++) y += String.fromCharCode(b[g]);
           return btoa(y);
-        }(m);
+        }(f);
       }
-      return { size: l, data: f };
+      return { size: d, data: m };
     }(t = n.next(), n, this._options.thumbnailImageFormat))), t = n.next();
     return a;
   }
@@ -2052,9 +2066,9 @@ class Ko {
     return s.version && s.version.value <= 23 && s.encoding ? o = new TextDecoder(s.encoding).decode(n) : o = new TextDecoder().decode(n), t.parseSync(o);
   }
   getDxfInfoFromBuffer(n) {
-    var l, m, b;
+    var d, f, b;
     const t = new TextDecoder("utf-8");
-    let s = 0, o = "", c = null, f = null, d = !1;
+    let s = 0, o = "", c = null, m = null, l = !1;
     for (; s < n.byteLength; ) {
       const y = Math.min(s + 65536, n.byteLength), g = n.slice(s, y);
       s = y;
@@ -2062,25 +2076,25 @@ class Ko {
       o = v.pop() ?? "";
       for (let A = 0; A < v.length; A++) {
         const w = v[A].trim();
-        if (w === "SECTION" && ((l = v[A + 2]) == null ? void 0 : l.trim()) === "HEADER")
-          d = !0;
-        else if (w === "ENDSEC" && d)
-          return { version: c, encoding: f };
-        if (d && w === "$ACADVER") {
-          const V = (m = v[A + 2]) == null ? void 0 : m.trim();
+        if (w === "SECTION" && ((d = v[A + 2]) == null ? void 0 : d.trim()) === "HEADER")
+          l = !0;
+        else if (w === "ENDSEC" && l)
+          return { version: c, encoding: m };
+        if (l && w === "$ACADVER") {
+          const V = (f = v[A + 2]) == null ? void 0 : f.trim();
           V && (c = new dn(V));
-        } else if (d && w === "$DWGCODEPAGE") {
+        } else if (l && w === "$DWGCODEPAGE") {
           const V = (b = v[A + 2]) == null ? void 0 : b.trim();
           if (V) {
             const Pe = Mr[V];
-            f = bn(Pe);
+            m = bn(Pe);
           }
         }
-        if (c && f)
-          return { version: c, encoding: f };
+        if (c && m)
+          return { version: c, encoding: m };
       }
     }
-    return { version: c, encoding: f };
+    return { version: c, encoding: m };
   }
 }
 class Zo extends mn {