iflow-engine-base 3.8.3 → 3.8.4

package/dist2d/dwg-preview.es.js

@@ -3301,24 +3301,24 @@ function Et() {
           c.pending_buf[c.pending++] = O >>> 8 & 255, c.pending_buf[c.pending++] = 255 & O;
         }
         function Y(c, O) {
-          var z, x, w = c.max_chain_length, I = c.strstart, U = c.prev_length, j = c.nice_match, T = c.strstart > c.w_size - q ? c.strstart - (c.w_size - q) : 0, H = c.window, $ = c.w_mask, Z = c.prev, K = c.strstart + W, se = H[I + U - 1], ne = H[I + U];
-          c.prev_length >= c.good_match && (w >>= 2), j > c.lookahead && (j = c.lookahead);
+          var z, x, w = c.max_chain_length, I = c.strstart, j = c.prev_length, U = c.nice_match, T = c.strstart > c.w_size - q ? c.strstart - (c.w_size - q) : 0, H = c.window, $ = c.w_mask, Z = c.prev, K = c.strstart + W, se = H[I + j - 1], ne = H[I + j];
+          c.prev_length >= c.good_match && (w >>= 2), U > c.lookahead && (U = c.lookahead);
           do
-            if (H[(z = O) + U] === ne && H[z + U - 1] === se && H[z] === H[I] && H[++z] === H[I + 1]) {
+            if (H[(z = O) + j] === ne && H[z + j - 1] === se && H[z] === H[I] && H[++z] === H[I + 1]) {
               I += 2, z++;
               do
                 ;
               while (H[++I] === H[++z] && H[++I] === H[++z] && H[++I] === H[++z] && H[++I] === H[++z] && H[++I] === H[++z] && H[++I] === H[++z] && H[++I] === H[++z] && H[++I] === H[++z] && I < K);
-              if (x = W - (K - I), I = K - W, U < x) {
-                if (c.match_start = O, j <= (U = x)) break;
-                se = H[I + U - 1], ne = H[I + U];
+              if (x = W - (K - I), I = K - W, j < x) {
+                if (c.match_start = O, U <= (j = x)) break;
+                se = H[I + j - 1], ne = H[I + j];
               }
             }
           while ((O = Z[O & $]) > T && --w != 0);
-          return U <= c.lookahead ? U : c.lookahead;
+          return j <= c.lookahead ? j : c.lookahead;
         }
         function ae(c) {
-          var O, z, x, w, I, U, j, T, H, $, Z = c.w_size;
+          var O, z, x, w, I, j, U, T, H, $, Z = c.w_size;
           do {
             if (w = c.window_size - c.lookahead - c.strstart, c.strstart >= Z + (Z - q)) {
               for (s.arraySet(c.window, c.window, Z, Z, 0), c.match_start -= Z, c.strstart -= Z, c.block_start -= Z, O = z = c.hash_size; x = c.head[--O], c.head[O] = Z <= x ? x - Z : 0, --z; ) ;
@@ -3326,7 +3326,7 @@ function Et() {
               w += Z;
             }
             if (c.strm.avail_in === 0) break;
-            if (U = c.strm, j = c.window, T = c.strstart + c.lookahead, H = w, $ = void 0, $ = U.avail_in, H < $ && ($ = H), z = $ === 0 ? 0 : (U.avail_in -= $, s.arraySet(j, U.input, U.next_in, $, T), U.state.wrap === 1 ? U.adler = a(U.adler, j, $, T) : U.state.wrap === 2 && (U.adler = h(U.adler, j, $, T)), U.next_in += $, U.total_in += $, $), c.lookahead += z, c.lookahead + c.insert >= B) for (I = c.strstart - c.insert, c.ins_h = c.window[I], c.ins_h = (c.ins_h << c.hash_shift ^ c.window[I + 1]) & c.hash_mask; c.insert && (c.ins_h = (c.ins_h << c.hash_shift ^ c.window[I + B - 1]) & c.hash_mask, c.prev[I & c.w_mask] = c.head[c.ins_h], c.head[c.ins_h] = I, I++, c.insert--, !(c.lookahead + c.insert < B)); ) ;
+            if (j = c.strm, U = c.window, T = c.strstart + c.lookahead, H = w, $ = void 0, $ = j.avail_in, H < $ && ($ = H), z = $ === 0 ? 0 : (j.avail_in -= $, s.arraySet(U, j.input, j.next_in, $, T), j.state.wrap === 1 ? j.adler = a(j.adler, U, $, T) : j.state.wrap === 2 && (j.adler = h(j.adler, U, $, T)), j.next_in += $, j.total_in += $, $), c.lookahead += z, c.lookahead + c.insert >= B) for (I = c.strstart - c.insert, c.ins_h = c.window[I], c.ins_h = (c.ins_h << c.hash_shift ^ c.window[I + 1]) & c.hash_mask; c.insert && (c.ins_h = (c.ins_h << c.hash_shift ^ c.window[I + B - 1]) & c.hash_mask, c.prev[I & c.w_mask] = c.head[c.ins_h], c.head[c.ins_h] = I, I++, c.insert--, !(c.lookahead + c.insert < B)); ) ;
           } while (c.lookahead < q && c.strm.avail_in !== 0);
         }
         function ue(c, O) {
@@ -3377,11 +3377,11 @@ function Et() {
         }
         function me(c, O, z, x, w, I) {
           if (!c) return b;
-          var U = 1;
-          if (O === l && (O = 6), x < 0 ? (U = 0, x = -x) : 15 < x && (U = 2, x -= 16), w < 1 || _ < w || z !== v || x < 8 || 15 < x || O < 0 || 9 < O || I < 0 || p < I) return te(c, b);
+          var j = 1;
+          if (O === l && (O = 6), x < 0 ? (j = 0, x = -x) : 15 < x && (j = 2, x -= 16), w < 1 || _ < w || z !== v || x < 8 || 15 < x || O < 0 || 9 < O || I < 0 || p < I) return te(c, b);
           x === 8 && (x = 9);
-          var j = new de();
-          return (c.state = j).strm = c, j.wrap = U, j.gzhead = null, j.w_bits = x, j.w_size = 1 << j.w_bits, j.w_mask = j.w_size - 1, j.hash_bits = w + 7, j.hash_size = 1 << j.hash_bits, j.hash_mask = j.hash_size - 1, j.hash_shift = ~~((j.hash_bits + B - 1) / B), j.window = new s.Buf8(2 * j.w_size), j.head = new s.Buf16(j.hash_size), j.prev = new s.Buf16(j.w_size), j.lit_bufsize = 1 << w + 6, j.pending_buf_size = 4 * j.lit_bufsize, j.pending_buf = new s.Buf8(j.pending_buf_size), j.d_buf = 1 * j.lit_bufsize, j.l_buf = 3 * j.lit_bufsize, j.level = O, j.strategy = I, j.method = z, ge(c);
+          var U = new de();
+          return (c.state = U).strm = c, U.wrap = j, U.gzhead = null, U.w_bits = x, U.w_size = 1 << U.w_bits, U.w_mask = U.w_size - 1, U.hash_bits = w + 7, U.hash_size = 1 << U.hash_bits, U.hash_mask = U.hash_size - 1, U.hash_shift = ~~((U.hash_bits + B - 1) / B), U.window = new s.Buf8(2 * U.w_size), U.head = new s.Buf16(U.hash_size), U.prev = new s.Buf16(U.w_size), U.lit_bufsize = 1 << w + 6, U.pending_buf_size = 4 * U.lit_bufsize, U.pending_buf = new s.Buf8(U.pending_buf_size), U.d_buf = 1 * U.lit_bufsize, U.l_buf = 3 * U.lit_bufsize, U.level = O, U.strategy = I, U.method = z, ge(c);
         }
         r = [new re(0, 0, 0, 0, function(c, O) {
           var z = 65535;
@@ -3405,8 +3405,8 @@ function Et() {
           if (x = c.state, !c.output || !c.input && c.avail_in !== 0 || x.status === 666 && O !== g) return te(c, c.avail_out === 0 ? -5 : b);
           if (x.strm = c, z = x.last_flush, x.last_flush = O, x.status === M) if (x.wrap === 2) c.adler = 0, J(x, 31), J(x, 139), J(x, 8), x.gzhead ? (J(x, (x.gzhead.text ? 1 : 0) + (x.gzhead.hcrc ? 2 : 0) + (x.gzhead.extra ? 4 : 0) + (x.gzhead.name ? 8 : 0) + (x.gzhead.comment ? 16 : 0)), J(x, 255 & x.gzhead.time), J(x, x.gzhead.time >> 8 & 255), J(x, x.gzhead.time >> 16 & 255), J(x, x.gzhead.time >> 24 & 255), J(x, x.level === 9 ? 2 : 2 <= x.strategy || x.level < 2 ? 4 : 0), J(x, 255 & x.gzhead.os), x.gzhead.extra && x.gzhead.extra.length && (J(x, 255 & x.gzhead.extra.length), J(x, x.gzhead.extra.length >> 8 & 255)), x.gzhead.hcrc && (c.adler = h(c.adler, x.pending_buf, x.pending, 0)), x.gzindex = 0, x.status = 69) : (J(x, 0), J(x, 0), J(x, 0), J(x, 0), J(x, 0), J(x, x.level === 9 ? 2 : 2 <= x.strategy || x.level < 2 ? 4 : 0), J(x, 3), x.status = R);
           else {
-            var U = v + (x.w_bits - 8 << 4) << 8;
-            U |= (2 <= x.strategy || x.level < 2 ? 0 : x.level < 6 ? 1 : x.level === 6 ? 2 : 3) << 6, x.strstart !== 0 && (U |= 32), U += 31 - U % 31, x.status = R, X(x, U), x.strstart !== 0 && (X(x, c.adler >>> 16), X(x, 65535 & c.adler)), c.adler = 1;
+            var j = v + (x.w_bits - 8 << 4) << 8;
+            j |= (2 <= x.strategy || x.level < 2 ? 0 : x.level < 6 ? 1 : x.level === 6 ? 2 : 3) << 6, x.strstart !== 0 && (j |= 32), j += 31 - j % 31, x.status = R, X(x, j), x.strstart !== 0 && (X(x, c.adler >>> 16), X(x, 65535 & c.adler)), c.adler = 1;
           }
           if (x.status === 69) if (x.gzhead.extra) {
             for (w = x.pending; x.gzindex < (65535 & x.gzhead.extra.length) && (x.pending !== x.pending_buf_size || (x.gzhead.hcrc && x.pending > w && (c.adler = h(c.adler, x.pending_buf, x.pending - w, w)), L(c), w = x.pending, x.pending !== x.pending_buf_size)); ) J(x, 255 & x.gzhead.extra[x.gzindex]), x.gzindex++;
@@ -3439,7 +3439,7 @@ function Et() {
           } else if (c.avail_in === 0 && G(O) <= G(z) && O !== g) return te(c, -5);
           if (x.status === 666 && c.avail_in !== 0) return te(c, -5);
           if (c.avail_in !== 0 || x.lookahead !== 0 || O !== f && x.status !== 666) {
-            var j = x.strategy === 2 ? (function(T, H) {
+            var U = x.strategy === 2 ? (function(T, H) {
               for (var $; ; ) {
                 if (T.lookahead === 0 && (ae(T), T.lookahead === 0)) {
                   if (H === f) return m;
@@ -3465,21 +3465,21 @@ function Et() {
               }
               return T.insert = 0, H === g ? (A(T, !0), T.strm.avail_out === 0 ? ee : V) : T.last_lit && (A(T, !1), T.strm.avail_out === 0) ? m : N;
             })(x, O) : r[x.level].func(x, O);
-            if (j !== ee && j !== V || (x.status = 666), j === m || j === ee) return c.avail_out === 0 && (x.last_flush = -1), d;
-            if (j === N && (O === 1 ? o._tr_align(x) : O !== 5 && (o._tr_stored_block(x, 0, 0, !1), O === 3 && (Q(x.head), x.lookahead === 0 && (x.strstart = 0, x.block_start = 0, x.insert = 0))), L(c), c.avail_out === 0)) return x.last_flush = -1, d;
+            if (U !== ee && U !== V || (x.status = 666), U === m || U === ee) return c.avail_out === 0 && (x.last_flush = -1), d;
+            if (U === N && (O === 1 ? o._tr_align(x) : O !== 5 && (o._tr_stored_block(x, 0, 0, !1), O === 3 && (Q(x.head), x.lookahead === 0 && (x.strstart = 0, x.block_start = 0, x.insert = 0))), L(c), c.avail_out === 0)) return x.last_flush = -1, d;
           }
           return O !== g ? d : x.wrap <= 0 ? 1 : (x.wrap === 2 ? (J(x, 255 & c.adler), J(x, c.adler >> 8 & 255), J(x, c.adler >> 16 & 255), J(x, c.adler >> 24 & 255), J(x, 255 & c.total_in), J(x, c.total_in >> 8 & 255), J(x, c.total_in >> 16 & 255), J(x, c.total_in >> 24 & 255)) : (X(x, c.adler >>> 16), X(x, 65535 & c.adler)), L(c), 0 < x.wrap && (x.wrap = -x.wrap), x.pending !== 0 ? d : 1);
         }, n.deflateEnd = function(c) {
           var O;
           return c && c.state ? (O = c.state.status) !== M && O !== 69 && O !== 73 && O !== 91 && O !== 103 && O !== R && O !== 666 ? te(c, b) : (c.state = null, O === R ? te(c, -3) : d) : b;
         }, n.deflateSetDictionary = function(c, O) {
-          var z, x, w, I, U, j, T, H, $ = O.length;
+          var z, x, w, I, j, U, T, H, $ = O.length;
           if (!c || !c.state || (I = (z = c.state).wrap) === 2 || I === 1 && z.status !== M || z.lookahead) return b;
-          for (I === 1 && (c.adler = a(c.adler, O, $, 0)), z.wrap = 0, $ >= z.w_size && (I === 0 && (Q(z.head), z.strstart = 0, z.block_start = 0, z.insert = 0), H = new s.Buf8(z.w_size), s.arraySet(H, O, $ - z.w_size, z.w_size, 0), O = H, $ = z.w_size), U = c.avail_in, j = c.next_in, T = c.input, c.avail_in = $, c.next_in = 0, c.input = O, ae(z); z.lookahead >= B; ) {
+          for (I === 1 && (c.adler = a(c.adler, O, $, 0)), z.wrap = 0, $ >= z.w_size && (I === 0 && (Q(z.head), z.strstart = 0, z.block_start = 0, z.insert = 0), H = new s.Buf8(z.w_size), s.arraySet(H, O, $ - z.w_size, z.w_size, 0), O = H, $ = z.w_size), j = c.avail_in, U = c.next_in, T = c.input, c.avail_in = $, c.next_in = 0, c.input = O, ae(z); z.lookahead >= B; ) {
             for (x = z.strstart, w = z.lookahead - (B - 1); z.ins_h = (z.ins_h << z.hash_shift ^ z.window[x + B - 1]) & z.hash_mask, z.prev[x & z.w_mask] = z.head[z.ins_h], z.head[z.ins_h] = x, x++, --w; ) ;
             z.strstart = x, z.lookahead = B - 1, ae(z);
           }
-          return z.strstart += z.lookahead, z.block_start = z.strstart, z.insert = z.lookahead, z.lookahead = 0, z.match_length = z.prev_length = B - 1, z.match_available = 0, c.next_in = j, c.input = T, c.avail_in = U, z.wrap = I, d;
+          return z.strstart += z.lookahead, z.block_start = z.strstart, z.insert = z.lookahead, z.lookahead = 0, z.match_length = z.prev_length = B - 1, z.match_available = 0, c.next_in = U, c.input = T, c.avail_in = j, z.wrap = I, d;
         }, n.deflateInfo = "pako deflate (from Nodeca project)";
       }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(t, i, n) {
         i.exports = function() {
@@ -3600,7 +3600,7 @@ function Et() {
         n.inflateReset = S, n.inflateReset2 = E, n.inflateResetKeep = _, n.inflateInit = function(M) {
           return D(M, 15);
         }, n.inflateInit2 = D, n.inflate = function(M, R) {
-          var m, N, ee, V, te, G, Q, L, A, J, X, Y, ae, ue, ie, re, de, le, ge, me, c, O, z, x, w = 0, I = new r.Buf8(4), U = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+          var m, N, ee, V, te, G, Q, L, A, J, X, Y, ae, ue, ie, re, de, le, ge, me, c, O, z, x, w = 0, I = new r.Buf8(4), j = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
           if (!M || !M.state || !M.output || !M.input && M.avail_in !== 0) return d;
           (m = M.state).mode === 12 && (m.mode = 13), te = M.next_out, ee = M.output, Q = M.avail_out, V = M.next_in, N = M.input, G = M.avail_in, L = m.hold, A = m.bits, J = G, X = Q, O = g;
           e: for (; ; ) switch (m.mode) {
@@ -3770,9 +3770,9 @@ function Et() {
                   if (G === 0) break e;
                   G--, L += N[V++] << A, A += 8;
                 }
-                m.lens[U[m.have++]] = 7 & L, L >>>= 3, A -= 3;
+                m.lens[j[m.have++]] = 7 & L, L >>>= 3, A -= 3;
               }
-              for (; m.have < 19; ) m.lens[U[m.have++]] = 0;
+              for (; m.have < 19; ) m.lens[j[m.have++]] = 0;
               if (m.lencode = m.lendyn, m.lenbits = 7, z = { bits: m.lenbits }, O = h(0, m.lens, 0, 19, m.lencode, 0, m.work, z), m.lenbits = z.bits, O) {
                 M.msg = "invalid code lengths set", m.mode = 30;
                 break;
@@ -4013,8 +4013,8 @@ function Et() {
         var N = new Array(u);
         a(N);
         var ee, V, te, G = new Array(d);
-        function Q(w, I, U, j, T) {
-          this.static_tree = w, this.extra_bits = I, this.extra_base = U, this.elems = j, this.max_length = T, this.has_stree = w && w.length;
+        function Q(w, I, j, U, T) {
+          this.static_tree = w, this.extra_bits = I, this.extra_base = j, this.elems = U, this.max_length = T, this.has_stree = w && w.length;
         }
         function L(w, I) {
           this.dyn_tree = w, this.max_code = 0, this.stat_desc = I;
@@ -4025,19 +4025,19 @@ function Et() {
         function J(w, I) {
           w.pending_buf[w.pending++] = 255 & I, w.pending_buf[w.pending++] = I >>> 8 & 255;
         }
-        function X(w, I, U) {
-          w.bi_valid > y - U ? (w.bi_buf |= I << w.bi_valid & 65535, J(w, w.bi_buf), w.bi_buf = I >> y - w.bi_valid, w.bi_valid += U - y) : (w.bi_buf |= I << w.bi_valid & 65535, w.bi_valid += U);
+        function X(w, I, j) {
+          w.bi_valid > y - j ? (w.bi_buf |= I << w.bi_valid & 65535, J(w, w.bi_buf), w.bi_buf = I >> y - w.bi_valid, w.bi_valid += j - y) : (w.bi_buf |= I << w.bi_valid & 65535, w.bi_valid += j);
         }
-        function Y(w, I, U) {
-          X(w, U[2 * I], U[2 * I + 1]);
+        function Y(w, I, j) {
+          X(w, j[2 * I], j[2 * I + 1]);
         }
         function ae(w, I) {
-          for (var U = 0; U |= 1 & w, w >>>= 1, U <<= 1, 0 < --I; ) ;
-          return U >>> 1;
+          for (var j = 0; j |= 1 & w, w >>>= 1, j <<= 1, 0 < --I; ) ;
+          return j >>> 1;
         }
-        function ue(w, I, U) {
-          var j, T, H = new Array(p + 1), $ = 0;
-          for (j = 1; j <= p; j++) H[j] = $ = $ + U[j - 1] << 1;
+        function ue(w, I, j) {
+          var U, T, H = new Array(p + 1), $ = 0;
+          for (U = 1; U <= p; U++) H[U] = $ = $ + j[U - 1] << 1;
           for (T = 0; T <= I; T++) {
             var Z = w[2 * T + 1];
             Z !== 0 && (w[2 * T] = ae(H[Z]++, Z));
@@ -4053,25 +4053,25 @@ function Et() {
         function re(w) {
           8 < w.bi_valid ? J(w, w.bi_buf) : 0 < w.bi_valid && (w.pending_buf[w.pending++] = w.bi_buf), w.bi_buf = 0, w.bi_valid = 0;
         }
-        function de(w, I, U, j) {
-          var T = 2 * I, H = 2 * U;
-          return w[T] < w[H] || w[T] === w[H] && j[I] <= j[U];
+        function de(w, I, j, U) {
+          var T = 2 * I, H = 2 * j;
+          return w[T] < w[H] || w[T] === w[H] && U[I] <= U[j];
         }
-        function le(w, I, U) {
-          for (var j = w.heap[U], T = U << 1; T <= w.heap_len && (T < w.heap_len && de(I, w.heap[T + 1], w.heap[T], w.depth) && T++, !de(I, j, w.heap[T], w.depth)); ) w.heap[U] = w.heap[T], U = T, T <<= 1;
-          w.heap[U] = j;
+        function le(w, I, j) {
+          for (var U = w.heap[j], T = j << 1; T <= w.heap_len && (T < w.heap_len && de(I, w.heap[T + 1], w.heap[T], w.depth) && T++, !de(I, U, w.heap[T], w.depth)); ) w.heap[j] = w.heap[T], j = T, T <<= 1;
+          w.heap[j] = U;
         }
-        function ge(w, I, U) {
-          var j, T, H, $, Z = 0;
-          if (w.last_lit !== 0) for (; j = w.pending_buf[w.d_buf + 2 * Z] << 8 | w.pending_buf[w.d_buf + 2 * Z + 1], T = w.pending_buf[w.l_buf + Z], Z++, j === 0 ? Y(w, T, I) : (Y(w, (H = m[T]) + f + 1, I), ($ = P[H]) !== 0 && X(w, T -= N[H], $), Y(w, H = A(--j), U), ($ = F[H]) !== 0 && X(w, j -= G[H], $)), Z < w.last_lit; ) ;
+        function ge(w, I, j) {
+          var U, T, H, $, Z = 0;
+          if (w.last_lit !== 0) for (; U = w.pending_buf[w.d_buf + 2 * Z] << 8 | w.pending_buf[w.d_buf + 2 * Z + 1], T = w.pending_buf[w.l_buf + Z], Z++, U === 0 ? Y(w, T, I) : (Y(w, (H = m[T]) + f + 1, I), ($ = P[H]) !== 0 && X(w, T -= N[H], $), Y(w, H = A(--U), j), ($ = F[H]) !== 0 && X(w, U -= G[H], $)), Z < w.last_lit; ) ;
           Y(w, _, I);
         }
         function me(w, I) {
-          var U, j, T, H = I.dyn_tree, $ = I.stat_desc.static_tree, Z = I.stat_desc.has_stree, K = I.stat_desc.elems, se = -1;
-          for (w.heap_len = 0, w.heap_max = l, U = 0; U < K; U++) H[2 * U] !== 0 ? (w.heap[++w.heap_len] = se = U, w.depth[U] = 0) : H[2 * U + 1] = 0;
+          var j, U, T, H = I.dyn_tree, $ = I.stat_desc.static_tree, Z = I.stat_desc.has_stree, K = I.stat_desc.elems, se = -1;
+          for (w.heap_len = 0, w.heap_max = l, j = 0; j < K; j++) H[2 * j] !== 0 ? (w.heap[++w.heap_len] = se = j, w.depth[j] = 0) : H[2 * j + 1] = 0;
           for (; w.heap_len < 2; ) H[2 * (T = w.heap[++w.heap_len] = se < 2 ? ++se : 0)] = 1, w.depth[T] = 0, w.opt_len--, Z && (w.static_len -= $[2 * T + 1]);
-          for (I.max_code = se, U = w.heap_len >> 1; 1 <= U; U--) le(w, H, U);
-          for (T = K; U = w.heap[1], w.heap[1] = w.heap[w.heap_len--], le(w, H, 1), j = w.heap[1], w.heap[--w.heap_max] = U, w.heap[--w.heap_max] = j, H[2 * T] = H[2 * U] + H[2 * j], w.depth[T] = (w.depth[U] >= w.depth[j] ? w.depth[U] : w.depth[j]) + 1, H[2 * U + 1] = H[2 * j + 1] = T, w.heap[1] = T++, le(w, H, 1), 2 <= w.heap_len; ) ;
+          for (I.max_code = se, j = w.heap_len >> 1; 1 <= j; j--) le(w, H, j);
+          for (T = K; j = w.heap[1], w.heap[1] = w.heap[w.heap_len--], le(w, H, 1), U = w.heap[1], w.heap[--w.heap_max] = j, w.heap[--w.heap_max] = U, H[2 * T] = H[2 * j] + H[2 * U], w.depth[T] = (w.depth[j] >= w.depth[U] ? w.depth[j] : w.depth[U]) + 1, H[2 * j + 1] = H[2 * U + 1] = T, w.heap[1] = T++, le(w, H, 1), 2 <= w.heap_len; ) ;
           w.heap[--w.heap_max] = w.heap[1], (function(ne, fe) {
             var xe, ye, _e, he, Ce, Le, be = fe.dyn_tree, Re = fe.max_code, $e = fe.stat_desc.static_tree, Ke = fe.stat_desc.has_stree, qe = fe.stat_desc.extra_bits, De = fe.stat_desc.extra_base, Me = fe.stat_desc.max_length, Ee = 0;
             for (he = 0; he <= p; he++) ne.bl_count[he] = 0;
@@ -4085,13 +4085,13 @@ function Et() {
             }
           })(w, I), ue(H, se, w.bl_count);
         }
-        function c(w, I, U) {
-          var j, T, H = -1, $ = I[1], Z = 0, K = 7, se = 4;
-          for ($ === 0 && (K = 138, se = 3), I[2 * (U + 1) + 1] = 65535, j = 0; j <= U; j++) T = $, $ = I[2 * (j + 1) + 1], ++Z < K && T === $ || (Z < se ? w.bl_tree[2 * T] += Z : T !== 0 ? (T !== H && w.bl_tree[2 * T]++, w.bl_tree[2 * S]++) : Z <= 10 ? w.bl_tree[2 * E]++ : w.bl_tree[2 * D]++, H = T, se = (Z = 0) === $ ? (K = 138, 3) : T === $ ? (K = 6, 3) : (K = 7, 4));
+        function c(w, I, j) {
+          var U, T, H = -1, $ = I[1], Z = 0, K = 7, se = 4;
+          for ($ === 0 && (K = 138, se = 3), I[2 * (j + 1) + 1] = 65535, U = 0; U <= j; U++) T = $, $ = I[2 * (U + 1) + 1], ++Z < K && T === $ || (Z < se ? w.bl_tree[2 * T] += Z : T !== 0 ? (T !== H && w.bl_tree[2 * T]++, w.bl_tree[2 * S]++) : Z <= 10 ? w.bl_tree[2 * E]++ : w.bl_tree[2 * D]++, H = T, se = (Z = 0) === $ ? (K = 138, 3) : T === $ ? (K = 6, 3) : (K = 7, 4));
         }
-        function O(w, I, U) {
-          var j, T, H = -1, $ = I[1], Z = 0, K = 7, se = 4;
-          for ($ === 0 && (K = 138, se = 3), j = 0; j <= U; j++) if (T = $, $ = I[2 * (j + 1) + 1], !(++Z < K && T === $)) {
+        function O(w, I, j) {
+          var U, T, H = -1, $ = I[1], Z = 0, K = 7, se = 4;
+          for ($ === 0 && (K = 138, se = 3), U = 0; U <= j; U++) if (T = $, $ = I[2 * (U + 1) + 1], !(++Z < K && T === $)) {
             if (Z < se) for (; Y(w, T, w.bl_tree), --Z != 0; ) ;
             else T !== 0 ? (T !== H && (Y(w, T, w.bl_tree), Z--), Y(w, S, w.bl_tree), X(w, Z - 3, 2)) : Z <= 10 ? (Y(w, E, w.bl_tree), X(w, Z - 3, 3)) : (Y(w, D, w.bl_tree), X(w, Z - 11, 7));
             H = T, se = (Z = 0) === $ ? (K = 138, 3) : T === $ ? (K = 6, 3) : (K = 7, 4);
@@ -4099,18 +4099,18 @@ function Et() {
         }
         a(G);
         var z = !1;
-        function x(w, I, U, j) {
-          X(w, (h << 1) + (j ? 1 : 0), 3), (function(T, H, $, Z) {
+        function x(w, I, j, U) {
+          X(w, (h << 1) + (U ? 1 : 0), 3), (function(T, H, $, Z) {
             re(T), J(T, $), J(T, ~$), r.arraySet(T.pending_buf, T.window, H, $, T.pending), T.pending += $;
-          })(w, I, U);
+          })(w, I, j);
         }
         n._tr_init = function(w) {
           z || ((function() {
-            var I, U, j, T, H, $ = new Array(p + 1);
-            for (T = j = 0; T < u - 1; T++) for (N[T] = j, I = 0; I < 1 << P[T]; I++) m[j++] = T;
-            for (m[j - 1] = T, T = H = 0; T < 16; T++) for (G[T] = H, I = 0; I < 1 << F[T]; I++) R[H++] = T;
+            var I, j, U, T, H, $ = new Array(p + 1);
+            for (T = U = 0; T < u - 1; T++) for (N[T] = U, I = 0; I < 1 << P[T]; I++) m[U++] = T;
+            for (m[U - 1] = T, T = H = 0; T < 16; T++) for (G[T] = H, I = 0; I < 1 << F[T]; I++) R[H++] = T;
             for (H >>= 7; T < d; T++) for (G[T] = H << 7, I = 0; I < 1 << F[T] - 7; I++) R[256 + H++] = T;
-            for (U = 0; U <= p; U++) $[U] = 0;
+            for (j = 0; j <= p; j++) $[j] = 0;
             for (I = 0; I <= 143; ) q[2 * I + 1] = 8, I++, $[8]++;
             for (; I <= 255; ) q[2 * I + 1] = 9, I++, $[9]++;
             for (; I <= 279; ) q[2 * I + 1] = 7, I++, $[7]++;
@@ -4118,7 +4118,7 @@ function Et() {
             for (ue(q, g + 1, $), I = 0; I < d; I++) M[2 * I + 1] = 5, M[2 * I] = ae(I, 5);
             ee = new Q(q, P, f + 1, g, p), V = new Q(M, F, 0, d, p), te = new Q(new Array(0), B, 0, b, v);
           })(), z = !0), w.l_desc = new L(w.dyn_ltree, ee), w.d_desc = new L(w.dyn_dtree, V), w.bl_desc = new L(w.bl_tree, te), w.bi_buf = 0, w.bi_valid = 0, ie(w);
-        }, n._tr_stored_block = x, n._tr_flush_block = function(w, I, U, j) {
+        }, n._tr_stored_block = x, n._tr_flush_block = function(w, I, j, U) {
           var T, H, $ = 0;
           0 < w.level ? (w.strm.data_type === 2 && (w.strm.data_type = (function(Z) {
             var K, se = 4093624447;
@@ -4130,13 +4130,13 @@ function Et() {
             var K;
             for (c(Z, Z.dyn_ltree, Z.l_desc.max_code), c(Z, Z.dyn_dtree, Z.d_desc.max_code), me(Z, Z.bl_desc), K = b - 1; 3 <= K && Z.bl_tree[2 * W[K] + 1] === 0; K--) ;
             return Z.opt_len += 3 * (K + 1) + 5 + 5 + 4, K;
-          })(w), T = w.opt_len + 3 + 7 >>> 3, (H = w.static_len + 3 + 7 >>> 3) <= T && (T = H)) : T = H = U + 5, U + 4 <= T && I !== -1 ? x(w, I, U, j) : w.strategy === 4 || H === T ? (X(w, 2 + (j ? 1 : 0), 3), ge(w, q, M)) : (X(w, 4 + (j ? 1 : 0), 3), (function(Z, K, se, ne) {
+          })(w), T = w.opt_len + 3 + 7 >>> 3, (H = w.static_len + 3 + 7 >>> 3) <= T && (T = H)) : T = H = j + 5, j + 4 <= T && I !== -1 ? x(w, I, j, U) : w.strategy === 4 || H === T ? (X(w, 2 + (U ? 1 : 0), 3), ge(w, q, M)) : (X(w, 4 + (U ? 1 : 0), 3), (function(Z, K, se, ne) {
             var fe;
             for (X(Z, K - 257, 5), X(Z, se - 1, 5), X(Z, ne - 4, 4), fe = 0; fe < ne; fe++) X(Z, Z.bl_tree[2 * W[fe] + 1], 3);
             O(Z, Z.dyn_ltree, K - 1), O(Z, Z.dyn_dtree, se - 1);
-          })(w, w.l_desc.max_code + 1, w.d_desc.max_code + 1, $ + 1), ge(w, w.dyn_ltree, w.dyn_dtree)), ie(w), j && re(w);
-        }, n._tr_tally = function(w, I, U) {
-          return w.pending_buf[w.d_buf + 2 * w.last_lit] = I >>> 8 & 255, w.pending_buf[w.d_buf + 2 * w.last_lit + 1] = 255 & I, w.pending_buf[w.l_buf + w.last_lit] = 255 & U, w.last_lit++, I === 0 ? w.dyn_ltree[2 * U]++ : (w.matches++, I--, w.dyn_ltree[2 * (m[U] + f + 1)]++, w.dyn_dtree[2 * A(I)]++), w.last_lit === w.lit_bufsize - 1;
+          })(w, w.l_desc.max_code + 1, w.d_desc.max_code + 1, $ + 1), ge(w, w.dyn_ltree, w.dyn_dtree)), ie(w), U && re(w);
+        }, n._tr_tally = function(w, I, j) {
+          return w.pending_buf[w.d_buf + 2 * w.last_lit] = I >>> 8 & 255, w.pending_buf[w.d_buf + 2 * w.last_lit + 1] = 255 & I, w.pending_buf[w.l_buf + w.last_lit] = 255 & j, w.last_lit++, I === 0 ? w.dyn_ltree[2 * j]++ : (w.matches++, I--, w.dyn_ltree[2 * (m[j] + f + 1)]++, w.dyn_dtree[2 * A(I)]++), w.last_lit === w.lit_bufsize - 1;
         }, n._tr_align = function(w) {
           X(w, 2, 3), Y(w, _, q), (function(I) {
             I.bi_valid === 16 ? (J(I, I.bi_buf), I.bi_buf = 0, I.bi_valid = 0) : 8 <= I.bi_valid && (I.pending_buf[I.pending++] = 255 & I.bi_buf, I.bi_buf >>= 8, I.bi_valid -= 8);
@@ -4232,12 +4232,7 @@ class Tt {
   zipObjectUrls = [];
   /** 加载新版 manifest 分包数据，并返回 Loader 可消费的 DWGData 结构。 */
   async load(e) {
-    if (this.clearZipObjectUrls(), this.is2dZipUrl(e))
-      return this.loadZipData(e);
-    const t = this.isManifestUrl(e) ? e : this.joinUrl(this.normalizeDirectoryUrl(e), "manifest.json"), i = await this.fetchJson(t);
-    if (!this.isSplitManifest(i))
-      throw new Error("[LoaderModule2d] Expected split CAD manifest data.");
-    return this.loadSplitData(this.getBaseUrl(t), i);
+    return this.clearZipObjectUrls(), this.loadZipData(e);
   }
   /** 拉取 JSON 资源；保留为 public，方便后续按视口动态加载 tile。 */
   async fetchJson(e) {
@@ -4643,7 +4638,7 @@ function ke(C, e = !1) {
     a.setIndex(f);
   }
   for (const u in r) {
-    const f = Ue(r[u]);
+    const f = je(r[u]);
     if (!f)
       return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the " + u + " attribute."), null;
     a.setAttribute(u, f);
@@ -4656,7 +4651,7 @@ function ke(C, e = !1) {
       const d = [];
       for (let l = 0; l < s[u].length; ++l)
         d.push(s[u][l][g]);
-      const b = Ue(d);
+      const b = je(d);
       if (!b)
         return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the " + u + " morphAttribute."), null;
       a.morphAttributes[u].push(b);
@@ -4664,7 +4659,7 @@ function ke(C, e = !1) {
   }
   return a;
 }
-function Ue(C) {
+function je(C) {
   let e, t, i, n = -1, r = 0;
   for (let h = 0; h < C.length; ++h) {
     const u = C[h];
@@ -4695,8 +4690,8 @@ function Ue(C) {
   }
   return n !== void 0 && (o.gpuType = n), o;
 }
-const oe = 1e-8, je = 1e-3, Nt = 8421504;
-class Ut {
+const oe = 1e-8, Ue = 1e-3, Nt = 8421504;
+class jt {
   constructor(e) {
     this.engine = e;
   }
@@ -4909,8 +4904,8 @@ class Ut {
           const g = this.createPatternFamilySegments(e, f, a, i.holes, h, u, r - s);
           g.forEach(([d, b]) => {
             n.push(
-              new k.Vector3(d.x, d.y, je),
-              new k.Vector3(b.x, b.y, je)
+              new k.Vector3(d.x, d.y, Ue),
+              new k.Vector3(b.x, b.y, Ue)
             );
           }), s += g.length;
         }
@@ -5077,9 +5072,9 @@ class Ut {
     }), i;
   }
 }
-class jt {
+class Ut {
   constructor(e, t) {
-    this.engine = e, this.textFactory = t, this.hatchRenderer = new Ut(e);
+    this.engine = e, this.textFactory = t, this.hatchRenderer = new jt(e);
   }
   hatchRenderer;
   /** 根据实体类型分发到线、文字、填充、图片等具体几何生成逻辑。 */
@@ -5626,7 +5621,7 @@ class Gt {
   /** 构建 2D 场景：字体 -> block 展开 -> 每个 octree tile 单独合批到一个 THREE.Group。 */
   async buildScene(e, t = {}) {
     this.clearModelGroup(), this.model = this.createEmptyModel(), this.model.layers = e.layers, this._emitProgress(30, "加载字体..."), this.font = await this.loadFont(e), this._emitProgress(45, "生成图元...");
-    const i = new Vt(this.engine, this.font), n = new jt(this.engine, i), r = new Ct(n);
+    const i = new Vt(this.engine, this.font), n = new Ut(this.engine, i), r = new Ct(n);
     r.setBlocks(e.blocks ?? []);
     const s = e.tiles ?? [], o = Math.max(s.length, 1), a = Math.max(1, t.chunkSize ?? 2e3), h = t.enableChunkedLoading ?? !0;
     for (let u = 0; u < s.length; u += 1) {