@zhangdali1996/lr-map-viewer 0.0.2 → 0.0.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/lr-map-viewer.js +846 -841
- package/package.json +1 -1
package/dist/lr-map-viewer.js
CHANGED
|
@@ -80,8 +80,8 @@ function j(e = {}) {
|
|
|
80
80
|
}
|
|
81
81
|
//#endregion
|
|
82
82
|
//#region packages/lr-map-viewer/src/adapters/lr2d/index.js
|
|
83
|
-
var
|
|
84
|
-
function
|
|
83
|
+
var oe = null;
|
|
84
|
+
function se(e, t = "") {
|
|
85
85
|
if (e?.dataset) {
|
|
86
86
|
if (t) {
|
|
87
87
|
e.dataset.mapMode = t;
|
|
@@ -90,20 +90,20 @@ function oe(e, t = "") {
|
|
|
90
90
|
delete e.dataset.mapMode;
|
|
91
91
|
}
|
|
92
92
|
}
|
|
93
|
-
function
|
|
93
|
+
function ce(e) {
|
|
94
94
|
return e?.getContainer?.() || null;
|
|
95
95
|
}
|
|
96
|
-
function
|
|
96
|
+
function M() {
|
|
97
97
|
return x();
|
|
98
98
|
}
|
|
99
|
-
async function
|
|
99
|
+
async function N({ map: e, config: t = {} } = {}) {
|
|
100
100
|
if (!e) throw Error("未找到 2D 地图实例");
|
|
101
101
|
let n = j(t), r = k(n);
|
|
102
102
|
if (r.length) throw Error(`2D 地图配置不完整,缺少:${r.join("、")}`);
|
|
103
|
-
let i =
|
|
103
|
+
let i = ce(e), { behavior: a, options: o } = n, { setMap: s, initLayer: c, showLayer: l, getLayerTree: u } = M();
|
|
104
104
|
await s(e);
|
|
105
105
|
let d = [];
|
|
106
|
-
return a.autoInitLayer && await c(), a.captureLayerTree && (d = await u()), a.autoShowLayer && o.layerName && await l(o.layerName, o.layerCode || ""),
|
|
106
|
+
return a.autoInitLayer && await c(), a.captureLayerTree && (d = await u()), a.autoShowLayer && o.layerName && await l(o.layerName, o.layerCode || ""), oe = {
|
|
107
107
|
mode: "2d",
|
|
108
108
|
ready: !0,
|
|
109
109
|
engineType: "lr-map",
|
|
@@ -113,37 +113,37 @@ async function P({ map: e, config: t = {} } = {}) {
|
|
|
113
113
|
options: { ...o },
|
|
114
114
|
behavior: { ...a },
|
|
115
115
|
layerTree: d
|
|
116
|
-
},
|
|
116
|
+
}, se(i, "2d"), oe;
|
|
117
117
|
}
|
|
118
|
-
function
|
|
119
|
-
return
|
|
120
|
-
}
|
|
121
|
-
function ce() {
|
|
122
|
-
M?.host && oe(M.host), M = null;
|
|
118
|
+
function P() {
|
|
119
|
+
return oe;
|
|
123
120
|
}
|
|
124
121
|
function le() {
|
|
125
|
-
|
|
122
|
+
oe?.host && se(oe.host), oe = null;
|
|
123
|
+
}
|
|
124
|
+
function ue() {
|
|
125
|
+
let e = oe?.map;
|
|
126
126
|
return e?.invalidateSize ? (e.invalidateSize(), !0) : !1;
|
|
127
127
|
}
|
|
128
128
|
//#endregion
|
|
129
129
|
//#region packages/lr-map-viewer/src/utils/loadScript.js
|
|
130
|
-
var
|
|
131
|
-
function
|
|
130
|
+
var de = /* @__PURE__ */ new Map();
|
|
131
|
+
function fe(e) {
|
|
132
132
|
return new URL(e, window.location.origin).toString();
|
|
133
133
|
}
|
|
134
|
-
function
|
|
134
|
+
function pe(e) {
|
|
135
135
|
return document.querySelector(`script[data-script-src="${e}"]`);
|
|
136
136
|
}
|
|
137
|
-
function
|
|
137
|
+
function me(e, t = {}) {
|
|
138
138
|
if (!e) return Promise.reject(/* @__PURE__ */ Error("脚本地址不能为空"));
|
|
139
139
|
if (typeof window > "u" || typeof document > "u") return Promise.reject(/* @__PURE__ */ Error("当前环境不支持动态加载脚本"));
|
|
140
|
-
let n =
|
|
141
|
-
if (
|
|
140
|
+
let n = fe(e);
|
|
141
|
+
if (de.has(n)) return de.get(n);
|
|
142
142
|
let r = new Promise((r, i) => {
|
|
143
|
-
let a =
|
|
143
|
+
let a = pe(n), o = (e) => {
|
|
144
144
|
e.dataset.loadState = "loaded", r(e);
|
|
145
145
|
}, s = (t) => {
|
|
146
|
-
t.dataset.loadState = "error",
|
|
146
|
+
t.dataset.loadState = "error", de.delete(n), i(/* @__PURE__ */ Error(`脚本加载失败: ${e}`));
|
|
147
147
|
};
|
|
148
148
|
if (a) {
|
|
149
149
|
if (a.dataset.loadState === "loaded") {
|
|
@@ -158,11 +158,11 @@ function pe(e, t = {}) {
|
|
|
158
158
|
c.setAttribute(e, t);
|
|
159
159
|
}), c.addEventListener("load", () => o(c), { once: !0 }), c.addEventListener("error", () => s(c), { once: !0 }), document.head.appendChild(c);
|
|
160
160
|
});
|
|
161
|
-
return
|
|
161
|
+
return de.set(n, r), r;
|
|
162
162
|
}
|
|
163
163
|
//#endregion
|
|
164
164
|
//#region packages/lr-map-viewer/src/config/lr3d.js
|
|
165
|
-
var
|
|
165
|
+
var he = {
|
|
166
166
|
sdk: {
|
|
167
167
|
basePath: "/editorapp",
|
|
168
168
|
scriptSrc: "/editorapp/editorapp.bundle.js",
|
|
@@ -235,48 +235,53 @@ var me = {
|
|
|
235
235
|
}
|
|
236
236
|
}
|
|
237
237
|
};
|
|
238
|
-
function
|
|
238
|
+
function F(e) {
|
|
239
239
|
return Object.prototype.toString.call(e) === "[object Object]";
|
|
240
240
|
}
|
|
241
|
-
function
|
|
242
|
-
return Array.isArray(e) ? e.map((e) =>
|
|
241
|
+
function I(e) {
|
|
242
|
+
return Array.isArray(e) ? e.map((e) => I(e)) : F(e) ? Object.keys(e).reduce((t, n) => (t[n] = I(e[n]), t), {}) : e;
|
|
243
243
|
}
|
|
244
244
|
function L(e, t) {
|
|
245
|
-
if (Array.isArray(t)) return t.map((e) =>
|
|
246
|
-
if (!
|
|
247
|
-
let n = { ...
|
|
245
|
+
if (Array.isArray(t)) return t.map((e) => I(e));
|
|
246
|
+
if (!F(e) || !F(t)) return I(t === void 0 ? e : t);
|
|
247
|
+
let n = { ...I(e) };
|
|
248
248
|
return Object.keys(t).forEach((r) => {
|
|
249
249
|
let i = t[r];
|
|
250
250
|
i !== void 0 && (n[r] = L(e[r], i));
|
|
251
251
|
}), n;
|
|
252
252
|
}
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
253
|
+
function ge(e = {}) {
|
|
254
|
+
if (!F(e)) return {};
|
|
255
|
+
let { sdk: t, scene: n, initOptions: r, dataSource: i, cloud: a, type: o, autoLoad: s, loadMode: c, ...l } = e, u = { ...l }, d = F(i) ? I(i) : {}, f = L(F(d.cloud) ? d.cloud : {}, F(a) ? a : {});
|
|
256
|
+
return t !== void 0 && (u.sdk = I(t)), n !== void 0 && (u.scene = I(n)), r !== void 0 && (u.initOptions = I(r)), o !== void 0 && (d.type = o), s !== void 0 && (d.autoLoad = s), c !== void 0 && (d.loadMode = c), Object.keys(f).length > 0 && (d.cloud = f), Object.keys(d).length > 0 && (u.dataSource = d), u;
|
|
256
257
|
}
|
|
258
|
+
var _e = I(he);
|
|
257
259
|
function ve() {
|
|
258
|
-
return he
|
|
260
|
+
return I(he);
|
|
261
|
+
}
|
|
262
|
+
function R() {
|
|
263
|
+
return I(_e);
|
|
259
264
|
}
|
|
260
265
|
function ye() {
|
|
261
|
-
return
|
|
266
|
+
return R().sdk;
|
|
262
267
|
}
|
|
263
268
|
function be() {
|
|
264
|
-
return
|
|
269
|
+
return R().scene;
|
|
265
270
|
}
|
|
266
271
|
function xe() {
|
|
267
|
-
return
|
|
272
|
+
return R().initOptions;
|
|
268
273
|
}
|
|
269
274
|
function Se() {
|
|
270
|
-
return
|
|
275
|
+
return R().dataSource;
|
|
271
276
|
}
|
|
272
277
|
function Ce(e = {}) {
|
|
273
|
-
return
|
|
278
|
+
return _e = L(he, ge(e)), R();
|
|
274
279
|
}
|
|
275
280
|
function we() {
|
|
276
|
-
return
|
|
281
|
+
return _e = I(he), R();
|
|
277
282
|
}
|
|
278
283
|
function Te(e = {}) {
|
|
279
|
-
return L(
|
|
284
|
+
return L(he, ge(e));
|
|
280
285
|
}
|
|
281
286
|
//#endregion
|
|
282
287
|
//#region node_modules/pako/dist/pako.esm.mjs
|
|
@@ -285,7 +290,7 @@ function Ae(e) {
|
|
|
285
290
|
let t = e.length;
|
|
286
291
|
for (; --t >= 0;) e[t] = 0;
|
|
287
292
|
}
|
|
288
|
-
var je = 0, Me = 1, Ne = 2, Pe = 3, Fe = 258, Ie = 29, Le = 256, Re = Le + 1 + Ie, ze = 30, Be = 19, Ve = 2 * Re + 1, He = 15, Ue = 16, We = 7, Ge = 256,
|
|
293
|
+
var je = 0, Me = 1, Ne = 2, Pe = 3, Fe = 258, Ie = 29, Le = 256, Re = Le + 1 + Ie, ze = 30, Be = 19, Ve = 2 * Re + 1, He = 15, Ue = 16, We = 7, Ge = 256, z = 16, Ke = 17, qe = 18, Je = new Uint8Array([
|
|
289
294
|
0,
|
|
290
295
|
0,
|
|
291
296
|
0,
|
|
@@ -407,19 +412,19 @@ function lt(e, t) {
|
|
|
407
412
|
}
|
|
408
413
|
var ut = (e) => e < 256 ? tt[e] : tt[256 + (e >>> 7)], dt = (e, t) => {
|
|
409
414
|
e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
|
|
410
|
-
},
|
|
415
|
+
}, B = (e, t, n) => {
|
|
411
416
|
e.bi_valid > Ue - n ? (e.bi_buf |= t << e.bi_valid & 65535, dt(e, e.bi_buf), e.bi_buf = t >> Ue - e.bi_valid, e.bi_valid += n - Ue) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
|
|
412
|
-
},
|
|
413
|
-
|
|
414
|
-
},
|
|
417
|
+
}, V = (e, t, n) => {
|
|
418
|
+
B(e, n[t * 2], n[t * 2 + 1]);
|
|
419
|
+
}, ft = (e, t) => {
|
|
415
420
|
let n = 0;
|
|
416
421
|
do
|
|
417
422
|
n |= e & 1, e >>>= 1, n <<= 1;
|
|
418
423
|
while (--t > 0);
|
|
419
424
|
return n >>> 1;
|
|
420
|
-
},
|
|
425
|
+
}, pt = (e) => {
|
|
421
426
|
e.bi_valid === 16 ? (dt(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
|
|
422
|
-
},
|
|
427
|
+
}, mt = (e, t) => {
|
|
423
428
|
let n = t.dyn_tree, r = t.max_code, i = t.stat_desc.static_tree, a = t.stat_desc.has_stree, o = t.stat_desc.extra_bits, s = t.stat_desc.extra_base, c = t.stat_desc.max_length, l, u, d, f, p, m, h = 0;
|
|
424
429
|
for (f = 0; f <= He; f++) e.bl_count[f] = 0;
|
|
425
430
|
for (n[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < Ve; l++) u = e.heap[l], f = n[n[u * 2 + 1] * 2 + 1] + 1, f > c && (f = c, h++), n[u * 2 + 1] = f, !(u > r) && (e.bl_count[f]++, p = 0, u >= s && (p = o[u - s]), m = n[u * 2], e.opt_len += m * (f + p), a && (e.static_len += m * (i[u * 2 + 1] + p)));
|
|
@@ -430,14 +435,14 @@ var ut = (e) => e < 256 ? tt[e] : tt[256 + (e >>> 7)], dt = (e, t) => {
|
|
|
430
435
|
} while (h > 0);
|
|
431
436
|
for (f = c; f !== 0; f--) for (u = e.bl_count[f]; u !== 0;) d = e.heap[--l], !(d > r) && (n[d * 2 + 1] !== f && (e.opt_len += (f - n[d * 2 + 1]) * n[d * 2], n[d * 2 + 1] = f), u--);
|
|
432
437
|
}
|
|
433
|
-
},
|
|
438
|
+
}, ht = (e, t, n) => {
|
|
434
439
|
let r = Array(He + 1), i = 0, a, o;
|
|
435
440
|
for (a = 1; a <= He; a++) i = i + n[a - 1] << 1, r[a] = i;
|
|
436
441
|
for (o = 0; o <= t; o++) {
|
|
437
442
|
let t = e[o * 2 + 1];
|
|
438
|
-
t !== 0 && (e[o * 2] =
|
|
443
|
+
t !== 0 && (e[o * 2] = ft(r[t]++, t));
|
|
439
444
|
}
|
|
440
|
-
},
|
|
445
|
+
}, gt = () => {
|
|
441
446
|
let e, t, n, r, i, a = Array(He + 1);
|
|
442
447
|
for (n = 0, r = 0; r < Ie - 1; r++) for (rt[r] = n, e = 0; e < 1 << Je[r]; e++) nt[n++] = r;
|
|
443
448
|
for (nt[n - 1] = r, i = 0, r = 0; r < 16; r++) for (it[r] = i, e = 0; e < 1 << Ye[r]; e++) tt[i++] = r;
|
|
@@ -447,81 +452,81 @@ var ut = (e) => e < 256 ? tt[e] : tt[256 + (e >>> 7)], dt = (e, t) => {
|
|
|
447
452
|
for (; e <= 255;) $e[e * 2 + 1] = 9, e++, a[9]++;
|
|
448
453
|
for (; e <= 279;) $e[e * 2 + 1] = 7, e++, a[7]++;
|
|
449
454
|
for (; e <= 287;) $e[e * 2 + 1] = 8, e++, a[8]++;
|
|
450
|
-
for (
|
|
455
|
+
for (ht($e, Re + 1, a), e = 0; e < ze; e++) et[e * 2 + 1] = 5, et[e * 2] = ft(e, 5);
|
|
451
456
|
ot = new at($e, Je, Le + 1, Re, He), st = new at(et, Ye, 0, ze, He), ct = new at([], Xe, 0, Be, We);
|
|
452
|
-
},
|
|
457
|
+
}, _t = (e) => {
|
|
453
458
|
let t;
|
|
454
459
|
for (t = 0; t < Re; t++) e.dyn_ltree[t * 2] = 0;
|
|
455
460
|
for (t = 0; t < ze; t++) e.dyn_dtree[t * 2] = 0;
|
|
456
461
|
for (t = 0; t < Be; t++) e.bl_tree[t * 2] = 0;
|
|
457
462
|
e.dyn_ltree[Ge * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0;
|
|
458
|
-
},
|
|
463
|
+
}, vt = (e) => {
|
|
459
464
|
e.bi_valid > 8 ? dt(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
|
|
460
|
-
},
|
|
465
|
+
}, yt = (e, t, n, r) => {
|
|
461
466
|
let i = t * 2, a = n * 2;
|
|
462
467
|
return e[i] < e[a] || e[i] === e[a] && r[t] <= r[n];
|
|
463
|
-
},
|
|
468
|
+
}, bt = (e, t, n) => {
|
|
464
469
|
let r = e.heap[n], i = n << 1;
|
|
465
|
-
for (; i <= e.heap_len && (i < e.heap_len &&
|
|
470
|
+
for (; i <= e.heap_len && (i < e.heap_len && yt(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !yt(t, r, e.heap[i], e.depth));) e.heap[n] = e.heap[i], n = i, i <<= 1;
|
|
466
471
|
e.heap[n] = r;
|
|
467
|
-
},
|
|
472
|
+
}, xt = (e, t, n) => {
|
|
468
473
|
let r, i, a = 0, o, s;
|
|
469
474
|
if (e.sym_next !== 0) do
|
|
470
|
-
r = e.pending_buf[e.sym_buf + a++] & 255, r += (e.pending_buf[e.sym_buf + a++] & 255) << 8, i = e.pending_buf[e.sym_buf + a++], r === 0 ?
|
|
475
|
+
r = e.pending_buf[e.sym_buf + a++] & 255, r += (e.pending_buf[e.sym_buf + a++] & 255) << 8, i = e.pending_buf[e.sym_buf + a++], r === 0 ? V(e, i, t) : (o = nt[i], V(e, o + Le + 1, t), s = Je[o], s !== 0 && (i -= rt[o], B(e, i, s)), r--, o = ut(r), V(e, o, n), s = Ye[o], s !== 0 && (r -= it[o], B(e, r, s)));
|
|
471
476
|
while (a < e.sym_next);
|
|
472
|
-
|
|
473
|
-
},
|
|
477
|
+
V(e, Ge, t);
|
|
478
|
+
}, St = (e, t) => {
|
|
474
479
|
let n = t.dyn_tree, r = t.stat_desc.static_tree, i = t.stat_desc.has_stree, a = t.stat_desc.elems, o, s, c = -1, l;
|
|
475
480
|
for (e.heap_len = 0, e.heap_max = Ve, o = 0; o < a; o++) n[o * 2] === 0 ? n[o * 2 + 1] = 0 : (e.heap[++e.heap_len] = c = o, e.depth[o] = 0);
|
|
476
481
|
for (; e.heap_len < 2;) l = e.heap[++e.heap_len] = c < 2 ? ++c : 0, n[l * 2] = 1, e.depth[l] = 0, e.opt_len--, i && (e.static_len -= r[l * 2 + 1]);
|
|
477
|
-
for (t.max_code = c, o = e.heap_len >> 1; o >= 1; o--)
|
|
482
|
+
for (t.max_code = c, o = e.heap_len >> 1; o >= 1; o--) bt(e, n, o);
|
|
478
483
|
l = a;
|
|
479
484
|
do
|
|
480
|
-
o = e.heap[1], e.heap[1] = e.heap[e.heap_len--],
|
|
485
|
+
o = e.heap[1], e.heap[1] = e.heap[e.heap_len--], bt(e, n, 1), s = e.heap[1], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = s, n[l * 2] = n[o * 2] + n[s * 2], e.depth[l] = (e.depth[o] >= e.depth[s] ? e.depth[o] : e.depth[s]) + 1, n[o * 2 + 1] = n[s * 2 + 1] = l, e.heap[1] = l++, bt(e, n, 1);
|
|
481
486
|
while (e.heap_len >= 2);
|
|
482
|
-
e.heap[--e.heap_max] = e.heap[1],
|
|
483
|
-
},
|
|
487
|
+
e.heap[--e.heap_max] = e.heap[1], mt(e, t), ht(n, c, e.bl_count);
|
|
488
|
+
}, Ct = (e, t, n) => {
|
|
484
489
|
let r, i = -1, a, o = t[1], s = 0, c = 7, l = 4;
|
|
485
|
-
for (o === 0 && (c = 138, l = 3), t[(n + 1) * 2 + 1] = 65535, r = 0; r <= n; r++) a = o, o = t[(r + 1) * 2 + 1], !(++s < c && a === o) && (s < l ? e.bl_tree[a * 2] += s : a === 0 ? s <= 10 ? e.bl_tree[
|
|
486
|
-
},
|
|
490
|
+
for (o === 0 && (c = 138, l = 3), t[(n + 1) * 2 + 1] = 65535, r = 0; r <= n; r++) a = o, o = t[(r + 1) * 2 + 1], !(++s < c && a === o) && (s < l ? e.bl_tree[a * 2] += s : a === 0 ? s <= 10 ? e.bl_tree[Ke * 2]++ : e.bl_tree[qe * 2]++ : (a !== i && e.bl_tree[a * 2]++, e.bl_tree[z * 2]++), s = 0, i = a, o === 0 ? (c = 138, l = 3) : a === o ? (c = 6, l = 3) : (c = 7, l = 4));
|
|
491
|
+
}, wt = (e, t, n) => {
|
|
487
492
|
let r, i = -1, a, o = t[1], s = 0, c = 7, l = 4;
|
|
488
493
|
for (o === 0 && (c = 138, l = 3), r = 0; r <= n; r++) if (a = o, o = t[(r + 1) * 2 + 1], !(++s < c && a === o)) {
|
|
489
494
|
if (s < l) do
|
|
490
|
-
|
|
495
|
+
V(e, a, e.bl_tree);
|
|
491
496
|
while (--s !== 0);
|
|
492
|
-
else a === 0 ? s <= 10 ? (
|
|
497
|
+
else a === 0 ? s <= 10 ? (V(e, Ke, e.bl_tree), B(e, s - 3, 3)) : (V(e, qe, e.bl_tree), B(e, s - 11, 7)) : (a !== i && (V(e, a, e.bl_tree), s--), V(e, z, e.bl_tree), B(e, s - 3, 2));
|
|
493
498
|
s = 0, i = a, o === 0 ? (c = 138, l = 3) : a === o ? (c = 6, l = 3) : (c = 7, l = 4);
|
|
494
499
|
}
|
|
495
|
-
},
|
|
500
|
+
}, Tt = (e) => {
|
|
496
501
|
let t;
|
|
497
|
-
for (
|
|
502
|
+
for (Ct(e, e.dyn_ltree, e.l_desc.max_code), Ct(e, e.dyn_dtree, e.d_desc.max_code), St(e, e.bl_desc), t = Be - 1; t >= 3 && e.bl_tree[Ze[t] * 2 + 1] === 0; t--);
|
|
498
503
|
return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
|
|
499
|
-
},
|
|
504
|
+
}, Et = (e, t, n, r) => {
|
|
500
505
|
let i;
|
|
501
|
-
for (
|
|
502
|
-
|
|
503
|
-
},
|
|
506
|
+
for (B(e, t - 257, 5), B(e, n - 1, 5), B(e, r - 4, 4), i = 0; i < r; i++) B(e, e.bl_tree[Ze[i] * 2 + 1], 3);
|
|
507
|
+
wt(e, e.dyn_ltree, t - 1), wt(e, e.dyn_dtree, n - 1);
|
|
508
|
+
}, Dt = (e) => {
|
|
504
509
|
let t = 4093624447, n;
|
|
505
510
|
for (n = 0; n <= 31; n++, t >>>= 1) if (t & 1 && e.dyn_ltree[n * 2] !== 0) return De;
|
|
506
511
|
if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0) return Oe;
|
|
507
512
|
for (n = 32; n < Le; n++) if (e.dyn_ltree[n * 2] !== 0) return Oe;
|
|
508
513
|
return De;
|
|
509
|
-
},
|
|
510
|
-
|
|
511
|
-
},
|
|
512
|
-
|
|
513
|
-
},
|
|
514
|
-
_tr_init:
|
|
515
|
-
_tr_stored_block:
|
|
514
|
+
}, Ot = !1, kt = (e) => {
|
|
515
|
+
Ot ||= (gt(), !0), e.l_desc = new lt(e.dyn_ltree, ot), e.d_desc = new lt(e.dyn_dtree, st), e.bl_desc = new lt(e.bl_tree, ct), e.bi_buf = 0, e.bi_valid = 0, _t(e);
|
|
516
|
+
}, At = (e, t, n, r) => {
|
|
517
|
+
B(e, (je << 1) + (r ? 1 : 0), 3), vt(e), dt(e, n), dt(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
|
|
518
|
+
}, jt = {
|
|
519
|
+
_tr_init: kt,
|
|
520
|
+
_tr_stored_block: At,
|
|
516
521
|
_tr_flush_block: (e, t, n, r) => {
|
|
517
522
|
let i, a, o = 0;
|
|
518
|
-
e.level > 0 ? (e.strm.data_type === ke && (e.strm.data_type =
|
|
523
|
+
e.level > 0 ? (e.strm.data_type === ke && (e.strm.data_type = Dt(e)), St(e, e.l_desc), St(e, e.d_desc), o = Tt(e), i = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= i && (i = a)) : i = a = n + 5, n + 4 <= i && t !== -1 ? At(e, t, n, r) : e.strategy === Ee || a === i ? (B(e, (Me << 1) + (r ? 1 : 0), 3), xt(e, $e, et)) : (B(e, (Ne << 1) + (r ? 1 : 0), 3), Et(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), xt(e, e.dyn_ltree, e.dyn_dtree)), _t(e), r && vt(e);
|
|
519
524
|
},
|
|
520
525
|
_tr_tally: (e, t, n) => (e.pending_buf[e.sym_buf + e.sym_next++] = t, e.pending_buf[e.sym_buf + e.sym_next++] = t >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = n, t === 0 ? e.dyn_ltree[n * 2]++ : (e.matches++, t--, e.dyn_ltree[(nt[n] + Le + 1) * 2]++, e.dyn_dtree[ut(t) * 2]++), e.sym_next === e.sym_end),
|
|
521
526
|
_tr_align: (e) => {
|
|
522
|
-
|
|
527
|
+
B(e, Me << 1, 3), V(e, Ge, $e), pt(e);
|
|
523
528
|
}
|
|
524
|
-
},
|
|
529
|
+
}, Mt = (e, t, n, r) => {
|
|
525
530
|
let i = e & 65535 | 0, a = e >>> 16 & 65535 | 0, o = 0;
|
|
526
531
|
for (; n !== 0;) {
|
|
527
532
|
o = n > 2e3 ? 2e3 : n, n -= o;
|
|
@@ -531,7 +536,7 @@ var ut = (e) => e < 256 ? tt[e] : tt[256 + (e >>> 7)], dt = (e, t) => {
|
|
|
531
536
|
i %= 65521, a %= 65521;
|
|
532
537
|
}
|
|
533
538
|
return i | a << 16 | 0;
|
|
534
|
-
},
|
|
539
|
+
}, Nt = new Uint32Array((() => {
|
|
535
540
|
let e, t = [];
|
|
536
541
|
for (var n = 0; n < 256; n++) {
|
|
537
542
|
e = n;
|
|
@@ -539,12 +544,12 @@ var ut = (e) => e < 256 ? tt[e] : tt[256 + (e >>> 7)], dt = (e, t) => {
|
|
|
539
544
|
t[n] = e;
|
|
540
545
|
}
|
|
541
546
|
return t;
|
|
542
|
-
})()),
|
|
543
|
-
let i =
|
|
547
|
+
})()), H = (e, t, n, r) => {
|
|
548
|
+
let i = Nt, a = r + n;
|
|
544
549
|
e ^= -1;
|
|
545
550
|
for (let n = r; n < a; n++) e = e >>> 8 ^ i[(e ^ t[n]) & 255];
|
|
546
551
|
return e ^ -1;
|
|
547
|
-
},
|
|
552
|
+
}, Pt = {
|
|
548
553
|
2: "need dictionary",
|
|
549
554
|
1: "stream end",
|
|
550
555
|
0: "",
|
|
@@ -554,7 +559,7 @@ var ut = (e) => e < 256 ? tt[e] : tt[256 + (e >>> 7)], dt = (e, t) => {
|
|
|
554
559
|
"-4": "insufficient memory",
|
|
555
560
|
"-5": "buffer error",
|
|
556
561
|
"-6": "incompatible version"
|
|
557
|
-
},
|
|
562
|
+
}, Ft = {
|
|
558
563
|
Z_NO_FLUSH: 0,
|
|
559
564
|
Z_PARTIAL_FLUSH: 1,
|
|
560
565
|
Z_SYNC_FLUSH: 2,
|
|
@@ -583,10 +588,10 @@ var ut = (e) => e < 256 ? tt[e] : tt[256 + (e >>> 7)], dt = (e, t) => {
|
|
|
583
588
|
Z_TEXT: 1,
|
|
584
589
|
Z_UNKNOWN: 2,
|
|
585
590
|
Z_DEFLATED: 8
|
|
586
|
-
}, { _tr_init:
|
|
591
|
+
}, { _tr_init: It, _tr_stored_block: Lt, _tr_flush_block: Rt, _tr_tally: zt, _tr_align: Bt } = jt, { Z_NO_FLUSH: Vt, Z_PARTIAL_FLUSH: Ht, Z_FULL_FLUSH: Ut, Z_FINISH: U, Z_BLOCK: Wt, Z_OK: W, Z_STREAM_END: Gt, Z_STREAM_ERROR: Kt, Z_DATA_ERROR: qt, Z_BUF_ERROR: Jt, Z_DEFAULT_COMPRESSION: Yt, Z_FILTERED: Xt, Z_HUFFMAN_ONLY: Zt, Z_RLE: Qt, Z_FIXED: $t, Z_DEFAULT_STRATEGY: en, Z_UNKNOWN: tn, Z_DEFLATED: nn } = Ft, rn = 9, an = 15, on = 8, sn = 286, cn = 30, ln = 19, un = 2 * sn + 1, dn = 15, G = 3, fn = 258, pn = fn + G + 1, mn = 32, hn = 42, gn = 57, _n = 69, vn = 73, yn = 91, bn = 103, xn = 113, Sn = 666, K = 1, Cn = 2, wn = 3, Tn = 4, En = 3, Dn = (e, t) => (e.msg = Pt[t], t), On = (e) => e * 2 - (e > 4 ? 9 : 0), kn = (e) => {
|
|
587
592
|
let t = e.length;
|
|
588
593
|
for (; --t >= 0;) e[t] = 0;
|
|
589
|
-
},
|
|
594
|
+
}, An = (e) => {
|
|
590
595
|
let t, n, r, i = e.w_size;
|
|
591
596
|
t = e.hash_size, r = t;
|
|
592
597
|
do
|
|
@@ -596,20 +601,20 @@ var ut = (e) => e < 256 ? tt[e] : tt[256 + (e >>> 7)], dt = (e, t) => {
|
|
|
596
601
|
do
|
|
597
602
|
n = e.prev[--r], e.prev[r] = n >= i ? n - i : 0;
|
|
598
603
|
while (--t);
|
|
599
|
-
},
|
|
604
|
+
}, jn = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, q = (e) => {
|
|
600
605
|
let t = e.state, n = t.pending;
|
|
601
606
|
n > e.avail_out && (n = e.avail_out), n !== 0 && (e.output.set(t.pending_buf.subarray(t.pending_out, t.pending_out + n), e.next_out), e.next_out += n, t.pending_out += n, e.total_out += n, e.avail_out -= n, t.pending -= n, t.pending === 0 && (t.pending_out = 0));
|
|
602
607
|
}, J = (e, t) => {
|
|
603
|
-
|
|
608
|
+
Rt(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, q(e.strm);
|
|
604
609
|
}, Y = (e, t) => {
|
|
605
610
|
e.pending_buf[e.pending++] = t;
|
|
606
|
-
},
|
|
611
|
+
}, Mn = (e, t) => {
|
|
607
612
|
e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = t & 255;
|
|
608
|
-
},
|
|
613
|
+
}, Nn = (e, t, n, r) => {
|
|
609
614
|
let i = e.avail_in;
|
|
610
|
-
return i > r && (i = r), i === 0 ? 0 : (e.avail_in -= i, t.set(e.input.subarray(e.next_in, e.next_in + i), n), e.state.wrap === 1 ? e.adler =
|
|
611
|
-
},
|
|
612
|
-
let n = e.max_chain_length, r = e.strstart, i, a, o = e.prev_length, s = e.nice_match, c = e.strstart > e.w_size -
|
|
615
|
+
return i > r && (i = r), i === 0 ? 0 : (e.avail_in -= i, t.set(e.input.subarray(e.next_in, e.next_in + i), n), e.state.wrap === 1 ? e.adler = Mt(e.adler, t, i, n) : e.state.wrap === 2 && (e.adler = H(e.adler, t, i, n)), e.next_in += i, e.total_in += i, i);
|
|
616
|
+
}, Pn = (e, t) => {
|
|
617
|
+
let n = e.max_chain_length, r = e.strstart, i, a, o = e.prev_length, s = e.nice_match, c = e.strstart > e.w_size - pn ? e.strstart - (e.w_size - pn) : 0, l = e.window, u = e.w_mask, d = e.prev, f = e.strstart + fn, p = l[r + o - 1], m = l[r + o];
|
|
613
618
|
e.prev_length >= e.good_match && (n >>= 2), s > e.lookahead && (s = e.lookahead);
|
|
614
619
|
do {
|
|
615
620
|
if (i = t, l[i + o] !== m || l[i + o - 1] !== p || l[i] !== l[r] || l[++i] !== l[r + 1]) continue;
|
|
@@ -622,233 +627,233 @@ while (l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] ===
|
|
|
622
627
|
}
|
|
623
628
|
} while ((t = d[t & u]) > c && --n !== 0);
|
|
624
629
|
return o <= e.lookahead ? o : e.lookahead;
|
|
625
|
-
},
|
|
630
|
+
}, Fn = (e) => {
|
|
626
631
|
let t = e.w_size, n, r, i;
|
|
627
632
|
do {
|
|
628
|
-
if (r = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t -
|
|
629
|
-
if (n =
|
|
630
|
-
} while (e.lookahead <
|
|
631
|
-
},
|
|
633
|
+
if (r = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - pn) && (e.window.set(e.window.subarray(t, t + t - r), 0), e.match_start -= t, e.strstart -= t, e.block_start -= t, e.insert > e.strstart && (e.insert = e.strstart), An(e), r += t), e.strm.avail_in === 0) break;
|
|
634
|
+
if (n = Nn(e.strm, e.window, e.strstart + e.lookahead, r), e.lookahead += n, e.lookahead + e.insert >= G) for (i = e.strstart - e.insert, e.ins_h = e.window[i], e.ins_h = jn(e, e.ins_h, e.window[i + 1]); e.insert && (e.ins_h = jn(e, e.ins_h, e.window[i + G - 1]), e.prev[i & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = i, i++, e.insert--, !(e.lookahead + e.insert < G)););
|
|
635
|
+
} while (e.lookahead < pn && e.strm.avail_in !== 0);
|
|
636
|
+
}, In = (e, t) => {
|
|
632
637
|
let n = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, r, i, a, o = 0, s = e.strm.avail_in;
|
|
633
638
|
do {
|
|
634
|
-
if (r = 65535, a = e.bi_valid + 42 >> 3, e.strm.avail_out < a || (a = e.strm.avail_out - a, i = e.strstart - e.block_start, r > i + e.strm.avail_in && (r = i + e.strm.avail_in), r > a && (r = a), r < n && (r === 0 && t !==
|
|
635
|
-
o = t ===
|
|
639
|
+
if (r = 65535, a = e.bi_valid + 42 >> 3, e.strm.avail_out < a || (a = e.strm.avail_out - a, i = e.strstart - e.block_start, r > i + e.strm.avail_in && (r = i + e.strm.avail_in), r > a && (r = a), r < n && (r === 0 && t !== U || t === Vt || r !== i + e.strm.avail_in))) break;
|
|
640
|
+
o = t === U && r === i + e.strm.avail_in ? 1 : 0, Lt(e, 0, 0, o), e.pending_buf[e.pending - 4] = r, e.pending_buf[e.pending - 3] = r >> 8, e.pending_buf[e.pending - 2] = ~r, e.pending_buf[e.pending - 1] = ~r >> 8, q(e.strm), i && (i > r && (i = r), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + i), e.strm.next_out), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i, e.block_start += i, r -= i), r && (Nn(e.strm, e.strm.output, e.strm.next_out, r), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r);
|
|
636
641
|
} while (o === 0);
|
|
637
|
-
return s -= e.strm.avail_in, s && (s >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= s && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ?
|
|
638
|
-
},
|
|
642
|
+
return s -= e.strm.avail_in, s && (s >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= s && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ? Tn : t !== Vt && t !== U && e.strm.avail_in === 0 && e.strstart === e.block_start ? Cn : (a = e.window_size - e.strstart, e.strm.avail_in > a && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, a += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), a > e.strm.avail_in && (a = e.strm.avail_in), a && (Nn(e.strm, e.window, e.strstart, a), e.strstart += a, e.insert += a > e.w_size - e.insert ? e.w_size - e.insert : a), e.high_water < e.strstart && (e.high_water = e.strstart), a = e.bi_valid + 42 >> 3, a = e.pending_buf_size - a > 65535 ? 65535 : e.pending_buf_size - a, n = a > e.w_size ? e.w_size : a, i = e.strstart - e.block_start, (i >= n || (i || t === U) && t !== Vt && e.strm.avail_in === 0 && i <= a) && (r = i > a ? a : i, o = t === U && e.strm.avail_in === 0 && r === i ? 1 : 0, Lt(e, e.block_start, r, o), e.block_start += r, q(e.strm)), o ? wn : K);
|
|
643
|
+
}, Ln = (e, t) => {
|
|
639
644
|
let n, r;
|
|
640
645
|
for (;;) {
|
|
641
|
-
if (e.lookahead <
|
|
642
|
-
if (
|
|
646
|
+
if (e.lookahead < pn) {
|
|
647
|
+
if (Fn(e), e.lookahead < pn && t === Vt) return K;
|
|
643
648
|
if (e.lookahead === 0) break;
|
|
644
649
|
}
|
|
645
|
-
if (n = 0, e.lookahead >=
|
|
650
|
+
if (n = 0, e.lookahead >= G && (e.ins_h = jn(e, e.ins_h, e.window[e.strstart + G - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), n !== 0 && e.strstart - n <= e.w_size - pn && (e.match_length = Pn(e, n)), e.match_length >= G) if (r = zt(e, e.strstart - e.match_start, e.match_length - G), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= G) {
|
|
646
651
|
e.match_length--;
|
|
647
652
|
do
|
|
648
|
-
e.strstart++, e.ins_h =
|
|
653
|
+
e.strstart++, e.ins_h = jn(e, e.ins_h, e.window[e.strstart + G - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
|
|
649
654
|
while (--e.match_length !== 0);
|
|
650
655
|
e.strstart++;
|
|
651
|
-
} else e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h =
|
|
652
|
-
else r =
|
|
656
|
+
} else e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = jn(e, e.ins_h, e.window[e.strstart + 1]);
|
|
657
|
+
else r = zt(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
|
|
653
658
|
if (r && (J(e, !1), e.strm.avail_out === 0)) return K;
|
|
654
659
|
}
|
|
655
|
-
return e.insert = e.strstart <
|
|
656
|
-
},
|
|
660
|
+
return e.insert = e.strstart < G - 1 ? e.strstart : G - 1, t === U ? (J(e, !0), e.strm.avail_out === 0 ? wn : Tn) : e.sym_next && (J(e, !1), e.strm.avail_out === 0) ? K : Cn;
|
|
661
|
+
}, Rn = (e, t) => {
|
|
657
662
|
let n, r, i;
|
|
658
663
|
for (;;) {
|
|
659
|
-
if (e.lookahead <
|
|
660
|
-
if (
|
|
664
|
+
if (e.lookahead < pn) {
|
|
665
|
+
if (Fn(e), e.lookahead < pn && t === Vt) return K;
|
|
661
666
|
if (e.lookahead === 0) break;
|
|
662
667
|
}
|
|
663
|
-
if (n = 0, e.lookahead >=
|
|
664
|
-
i = e.strstart + e.lookahead -
|
|
668
|
+
if (n = 0, e.lookahead >= G && (e.ins_h = jn(e, e.ins_h, e.window[e.strstart + G - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = G - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - pn && (e.match_length = Pn(e, n), e.match_length <= 5 && (e.strategy === Xt || e.match_length === G && e.strstart - e.match_start > 4096) && (e.match_length = G - 1)), e.prev_length >= G && e.match_length <= e.prev_length) {
|
|
669
|
+
i = e.strstart + e.lookahead - G, r = zt(e, e.strstart - 1 - e.prev_match, e.prev_length - G), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
|
|
665
670
|
do
|
|
666
|
-
++e.strstart <= i && (e.ins_h =
|
|
671
|
+
++e.strstart <= i && (e.ins_h = jn(e, e.ins_h, e.window[e.strstart + G - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
|
|
667
672
|
while (--e.prev_length !== 0);
|
|
668
|
-
if (e.match_available = 0, e.match_length =
|
|
673
|
+
if (e.match_available = 0, e.match_length = G - 1, e.strstart++, r && (J(e, !1), e.strm.avail_out === 0)) return K;
|
|
669
674
|
} else if (e.match_available) {
|
|
670
|
-
if (r =
|
|
675
|
+
if (r = zt(e, 0, e.window[e.strstart - 1]), r && J(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return K;
|
|
671
676
|
} else e.match_available = 1, e.strstart++, e.lookahead--;
|
|
672
677
|
}
|
|
673
|
-
return e.match_available &&= (r =
|
|
674
|
-
},
|
|
678
|
+
return e.match_available &&= (r = zt(e, 0, e.window[e.strstart - 1]), 0), e.insert = e.strstart < G - 1 ? e.strstart : G - 1, t === U ? (J(e, !0), e.strm.avail_out === 0 ? wn : Tn) : e.sym_next && (J(e, !1), e.strm.avail_out === 0) ? K : Cn;
|
|
679
|
+
}, zn = (e, t) => {
|
|
675
680
|
let n, r, i, a, o = e.window;
|
|
676
681
|
for (;;) {
|
|
677
682
|
if (e.lookahead <= fn) {
|
|
678
|
-
if (
|
|
683
|
+
if (Fn(e), e.lookahead <= fn && t === Vt) return K;
|
|
679
684
|
if (e.lookahead === 0) break;
|
|
680
685
|
}
|
|
681
|
-
if (e.match_length = 0, e.lookahead >=
|
|
686
|
+
if (e.match_length = 0, e.lookahead >= G && e.strstart > 0 && (i = e.strstart - 1, r = o[i], r === o[++i] && r === o[++i] && r === o[++i])) {
|
|
682
687
|
a = e.strstart + fn;
|
|
683
688
|
do ;
|
|
684
689
|
while (r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && i < a);
|
|
685
690
|
e.match_length = fn - (a - i), e.match_length > e.lookahead && (e.match_length = e.lookahead);
|
|
686
691
|
}
|
|
687
|
-
if (e.match_length >=
|
|
692
|
+
if (e.match_length >= G ? (n = zt(e, 1, e.match_length - G), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = zt(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (J(e, !1), e.strm.avail_out === 0)) return K;
|
|
688
693
|
}
|
|
689
|
-
return e.insert = 0, t ===
|
|
690
|
-
},
|
|
694
|
+
return e.insert = 0, t === U ? (J(e, !0), e.strm.avail_out === 0 ? wn : Tn) : e.sym_next && (J(e, !1), e.strm.avail_out === 0) ? K : Cn;
|
|
695
|
+
}, Bn = (e, t) => {
|
|
691
696
|
let n;
|
|
692
697
|
for (;;) {
|
|
693
|
-
if (e.lookahead === 0 && (
|
|
694
|
-
if (t ===
|
|
698
|
+
if (e.lookahead === 0 && (Fn(e), e.lookahead === 0)) {
|
|
699
|
+
if (t === Vt) return K;
|
|
695
700
|
break;
|
|
696
701
|
}
|
|
697
|
-
if (e.match_length = 0, n =
|
|
702
|
+
if (e.match_length = 0, n = zt(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (J(e, !1), e.strm.avail_out === 0)) return K;
|
|
698
703
|
}
|
|
699
|
-
return e.insert = 0, t ===
|
|
704
|
+
return e.insert = 0, t === U ? (J(e, !0), e.strm.avail_out === 0 ? wn : Tn) : e.sym_next && (J(e, !1), e.strm.avail_out === 0) ? K : Cn;
|
|
700
705
|
};
|
|
701
|
-
function
|
|
706
|
+
function Vn(e, t, n, r, i) {
|
|
702
707
|
this.good_length = e, this.max_lazy = t, this.nice_length = n, this.max_chain = r, this.func = i;
|
|
703
708
|
}
|
|
704
|
-
var
|
|
705
|
-
new
|
|
706
|
-
new
|
|
707
|
-
new
|
|
708
|
-
new
|
|
709
|
-
new
|
|
710
|
-
new
|
|
711
|
-
new
|
|
712
|
-
new
|
|
713
|
-
new
|
|
714
|
-
new
|
|
715
|
-
],
|
|
716
|
-
e.window_size = 2 * e.w_size,
|
|
709
|
+
var Hn = [
|
|
710
|
+
new Vn(0, 0, 0, 0, In),
|
|
711
|
+
new Vn(4, 4, 8, 4, Ln),
|
|
712
|
+
new Vn(4, 5, 16, 8, Ln),
|
|
713
|
+
new Vn(4, 6, 32, 32, Ln),
|
|
714
|
+
new Vn(4, 4, 16, 16, Rn),
|
|
715
|
+
new Vn(8, 16, 32, 32, Rn),
|
|
716
|
+
new Vn(8, 16, 128, 128, Rn),
|
|
717
|
+
new Vn(8, 32, 128, 256, Rn),
|
|
718
|
+
new Vn(32, 128, 258, 1024, Rn),
|
|
719
|
+
new Vn(32, 258, 258, 4096, Rn)
|
|
720
|
+
], Un = (e) => {
|
|
721
|
+
e.window_size = 2 * e.w_size, kn(e.head), e.max_lazy_match = Hn[e.level].max_lazy, e.good_match = Hn[e.level].good_length, e.nice_match = Hn[e.level].nice_length, e.max_chain_length = Hn[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = G - 1, e.match_available = 0, e.ins_h = 0;
|
|
717
722
|
};
|
|
718
|
-
function
|
|
719
|
-
this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = nn, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(un * 2), this.dyn_dtree = new Uint16Array((2 * cn + 1) * 2), this.bl_tree = new Uint16Array((2 * ln + 1) * 2),
|
|
723
|
+
function Wn() {
|
|
724
|
+
this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = nn, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(un * 2), this.dyn_dtree = new Uint16Array((2 * cn + 1) * 2), this.bl_tree = new Uint16Array((2 * ln + 1) * 2), kn(this.dyn_ltree), kn(this.dyn_dtree), kn(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(dn + 1), this.heap = new Uint16Array(2 * sn + 1), kn(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * sn + 1), kn(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
|
|
720
725
|
}
|
|
721
|
-
var
|
|
726
|
+
var Gn = (e) => {
|
|
722
727
|
if (!e) return 1;
|
|
723
728
|
let t = e.state;
|
|
724
|
-
return !t || t.strm !== e || t.status !==
|
|
725
|
-
},
|
|
726
|
-
if (
|
|
729
|
+
return !t || t.strm !== e || t.status !== hn && t.status !== gn && t.status !== _n && t.status !== vn && t.status !== yn && t.status !== bn && t.status !== xn && t.status !== Sn ? 1 : 0;
|
|
730
|
+
}, Kn = (e) => {
|
|
731
|
+
if (Gn(e)) return Dn(e, Kt);
|
|
727
732
|
e.total_in = e.total_out = 0, e.data_type = tn;
|
|
728
733
|
let t = e.state;
|
|
729
|
-
return t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap === 2 ?
|
|
730
|
-
},
|
|
731
|
-
let t =
|
|
732
|
-
return t ===
|
|
733
|
-
},
|
|
734
|
-
if (!e) return
|
|
734
|
+
return t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap === 2 ? gn : t.wrap ? hn : xn, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, It(t), W;
|
|
735
|
+
}, qn = (e) => {
|
|
736
|
+
let t = Kn(e);
|
|
737
|
+
return t === W && Un(e.state), t;
|
|
738
|
+
}, Jn = (e, t) => Gn(e) || e.state.wrap !== 2 ? Kt : (e.state.gzhead = t, W), Yn = (e, t, n, r, i, a) => {
|
|
739
|
+
if (!e) return Kt;
|
|
735
740
|
let o = 1;
|
|
736
|
-
if (t === Yt && (t = 6), r < 0 ? (o = 0, r = -r) : r > 15 && (o = 2, r -= 16), i < 1 || i > rn || n !== nn || r < 8 || r > 15 || t < 0 || t > 9 || a < 0 || a > $t || r === 8 && o !== 1) return
|
|
741
|
+
if (t === Yt && (t = 6), r < 0 ? (o = 0, r = -r) : r > 15 && (o = 2, r -= 16), i < 1 || i > rn || n !== nn || r < 8 || r > 15 || t < 0 || t > 9 || a < 0 || a > $t || r === 8 && o !== 1) return Dn(e, Kt);
|
|
737
742
|
r === 8 && (r = 9);
|
|
738
|
-
let s = new
|
|
739
|
-
return e.state = s, s.strm = e, s.status =
|
|
740
|
-
},
|
|
741
|
-
deflateInit: (e, t) =>
|
|
742
|
-
deflateInit2:
|
|
743
|
-
deflateReset:
|
|
744
|
-
deflateResetKeep:
|
|
745
|
-
deflateSetHeader:
|
|
743
|
+
let s = new Wn();
|
|
744
|
+
return e.state = s, s.strm = e, s.status = hn, s.wrap = o, s.gzhead = null, s.w_bits = r, s.w_size = 1 << s.w_bits, s.w_mask = s.w_size - 1, s.hash_bits = i + 7, s.hash_size = 1 << s.hash_bits, s.hash_mask = s.hash_size - 1, s.hash_shift = ~~((s.hash_bits + G - 1) / G), s.window = new Uint8Array(s.w_size * 2), s.head = new Uint16Array(s.hash_size), s.prev = new Uint16Array(s.w_size), s.lit_bufsize = 1 << i + 6, s.pending_buf_size = s.lit_bufsize * 4, s.pending_buf = new Uint8Array(s.pending_buf_size), s.sym_buf = s.lit_bufsize, s.sym_end = (s.lit_bufsize - 1) * 3, s.level = t, s.strategy = a, s.method = n, qn(e);
|
|
745
|
+
}, Xn = {
|
|
746
|
+
deflateInit: (e, t) => Yn(e, t, nn, an, on, en),
|
|
747
|
+
deflateInit2: Yn,
|
|
748
|
+
deflateReset: qn,
|
|
749
|
+
deflateResetKeep: Kn,
|
|
750
|
+
deflateSetHeader: Jn,
|
|
746
751
|
deflate: (e, t) => {
|
|
747
|
-
if (
|
|
752
|
+
if (Gn(e) || t > Wt || t < 0) return e ? Dn(e, Kt) : Kt;
|
|
748
753
|
let n = e.state;
|
|
749
|
-
if (!e.output || e.avail_in !== 0 && !e.input || n.status ===
|
|
754
|
+
if (!e.output || e.avail_in !== 0 && !e.input || n.status === Sn && t !== U) return Dn(e, e.avail_out === 0 ? Jt : Kt);
|
|
750
755
|
let r = n.last_flush;
|
|
751
756
|
if (n.last_flush = t, n.pending !== 0) {
|
|
752
|
-
if (q(e), e.avail_out === 0) return n.last_flush = -1,
|
|
753
|
-
} else if (e.avail_in === 0 &&
|
|
754
|
-
if (n.status ===
|
|
755
|
-
if (n.status ===
|
|
757
|
+
if (q(e), e.avail_out === 0) return n.last_flush = -1, W;
|
|
758
|
+
} else if (e.avail_in === 0 && On(t) <= On(r) && t !== U) return Dn(e, Jt);
|
|
759
|
+
if (n.status === Sn && e.avail_in !== 0) return Dn(e, Jt);
|
|
760
|
+
if (n.status === hn && n.wrap === 0 && (n.status = xn), n.status === hn) {
|
|
756
761
|
let t = nn + (n.w_bits - 8 << 4) << 8, r = -1;
|
|
757
|
-
if (r = n.strategy >= Zt || n.level < 2 ? 0 : n.level < 6 ? 1 : n.level === 6 ? 2 : 3, t |= r << 6, n.strstart !== 0 && (t |=
|
|
758
|
-
}
|
|
759
|
-
if (n.status === hn) {
|
|
760
|
-
if (e.adler = 0, Y(n, 31), Y(n, 139), Y(n, 8), n.gzhead) Y(n, (n.gzhead.text ? 1 : 0) + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)), Y(n, n.gzhead.time & 255), Y(n, n.gzhead.time >> 8 & 255), Y(n, n.gzhead.time >> 16 & 255), Y(n, n.gzhead.time >> 24 & 255), Y(n, n.level === 9 ? 2 : n.strategy >= Zt || n.level < 2 ? 4 : 0), Y(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && (Y(n, n.gzhead.extra.length & 255), Y(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = B(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = gn;
|
|
761
|
-
else if (Y(n, 0), Y(n, 0), Y(n, 0), Y(n, 0), Y(n, 0), Y(n, n.level === 9 ? 2 : n.strategy >= Zt || n.level < 2 ? 4 : 0), Y(n, Tn), n.status = bn, q(e), n.pending !== 0) return n.last_flush = -1, H;
|
|
762
|
+
if (r = n.strategy >= Zt || n.level < 2 ? 0 : n.level < 6 ? 1 : n.level === 6 ? 2 : 3, t |= r << 6, n.strstart !== 0 && (t |= mn), t += 31 - t % 31, Mn(n, t), n.strstart !== 0 && (Mn(n, e.adler >>> 16), Mn(n, e.adler & 65535)), e.adler = 1, n.status = xn, q(e), n.pending !== 0) return n.last_flush = -1, W;
|
|
762
763
|
}
|
|
763
764
|
if (n.status === gn) {
|
|
765
|
+
if (e.adler = 0, Y(n, 31), Y(n, 139), Y(n, 8), n.gzhead) Y(n, (n.gzhead.text ? 1 : 0) + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)), Y(n, n.gzhead.time & 255), Y(n, n.gzhead.time >> 8 & 255), Y(n, n.gzhead.time >> 16 & 255), Y(n, n.gzhead.time >> 24 & 255), Y(n, n.level === 9 ? 2 : n.strategy >= Zt || n.level < 2 ? 4 : 0), Y(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && (Y(n, n.gzhead.extra.length & 255), Y(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = H(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = _n;
|
|
766
|
+
else if (Y(n, 0), Y(n, 0), Y(n, 0), Y(n, 0), Y(n, 0), Y(n, n.level === 9 ? 2 : n.strategy >= Zt || n.level < 2 ? 4 : 0), Y(n, En), n.status = xn, q(e), n.pending !== 0) return n.last_flush = -1, W;
|
|
767
|
+
}
|
|
768
|
+
if (n.status === _n) {
|
|
764
769
|
if (n.gzhead.extra) {
|
|
765
770
|
let t = n.pending, r = (n.gzhead.extra.length & 65535) - n.gzindex;
|
|
766
771
|
for (; n.pending + r > n.pending_buf_size;) {
|
|
767
772
|
let i = n.pending_buf_size - n.pending;
|
|
768
|
-
if (n.pending_buf.set(n.gzhead.extra.subarray(n.gzindex, n.gzindex + i), n.pending), n.pending = n.pending_buf_size, n.gzhead.hcrc && n.pending > t && (e.adler =
|
|
773
|
+
if (n.pending_buf.set(n.gzhead.extra.subarray(n.gzindex, n.gzindex + i), n.pending), n.pending = n.pending_buf_size, n.gzhead.hcrc && n.pending > t && (e.adler = H(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex += i, q(e), n.pending !== 0) return n.last_flush = -1, W;
|
|
769
774
|
t = 0, r -= i;
|
|
770
775
|
}
|
|
771
776
|
let i = new Uint8Array(n.gzhead.extra);
|
|
772
|
-
n.pending_buf.set(i.subarray(n.gzindex, n.gzindex + r), n.pending), n.pending += r, n.gzhead.hcrc && n.pending > t && (e.adler =
|
|
777
|
+
n.pending_buf.set(i.subarray(n.gzindex, n.gzindex + r), n.pending), n.pending += r, n.gzhead.hcrc && n.pending > t && (e.adler = H(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex = 0;
|
|
773
778
|
}
|
|
774
|
-
n.status =
|
|
779
|
+
n.status = vn;
|
|
775
780
|
}
|
|
776
|
-
if (n.status ===
|
|
781
|
+
if (n.status === vn) {
|
|
777
782
|
if (n.gzhead.name) {
|
|
778
783
|
let t = n.pending, r;
|
|
779
784
|
do {
|
|
780
785
|
if (n.pending === n.pending_buf_size) {
|
|
781
|
-
if (n.gzhead.hcrc && n.pending > t && (e.adler =
|
|
786
|
+
if (n.gzhead.hcrc && n.pending > t && (e.adler = H(e.adler, n.pending_buf, n.pending - t, t)), q(e), n.pending !== 0) return n.last_flush = -1, W;
|
|
782
787
|
t = 0;
|
|
783
788
|
}
|
|
784
789
|
r = n.gzindex < n.gzhead.name.length ? n.gzhead.name.charCodeAt(n.gzindex++) & 255 : 0, Y(n, r);
|
|
785
790
|
} while (r !== 0);
|
|
786
|
-
n.gzhead.hcrc && n.pending > t && (e.adler =
|
|
791
|
+
n.gzhead.hcrc && n.pending > t && (e.adler = H(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex = 0;
|
|
787
792
|
}
|
|
788
|
-
n.status =
|
|
793
|
+
n.status = yn;
|
|
789
794
|
}
|
|
790
|
-
if (n.status ===
|
|
795
|
+
if (n.status === yn) {
|
|
791
796
|
if (n.gzhead.comment) {
|
|
792
797
|
let t = n.pending, r;
|
|
793
798
|
do {
|
|
794
799
|
if (n.pending === n.pending_buf_size) {
|
|
795
|
-
if (n.gzhead.hcrc && n.pending > t && (e.adler =
|
|
800
|
+
if (n.gzhead.hcrc && n.pending > t && (e.adler = H(e.adler, n.pending_buf, n.pending - t, t)), q(e), n.pending !== 0) return n.last_flush = -1, W;
|
|
796
801
|
t = 0;
|
|
797
802
|
}
|
|
798
803
|
r = n.gzindex < n.gzhead.comment.length ? n.gzhead.comment.charCodeAt(n.gzindex++) & 255 : 0, Y(n, r);
|
|
799
804
|
} while (r !== 0);
|
|
800
|
-
n.gzhead.hcrc && n.pending > t && (e.adler =
|
|
805
|
+
n.gzhead.hcrc && n.pending > t && (e.adler = H(e.adler, n.pending_buf, n.pending - t, t));
|
|
801
806
|
}
|
|
802
|
-
n.status =
|
|
807
|
+
n.status = bn;
|
|
803
808
|
}
|
|
804
|
-
if (n.status ===
|
|
809
|
+
if (n.status === bn) {
|
|
805
810
|
if (n.gzhead.hcrc) {
|
|
806
|
-
if (n.pending + 2 > n.pending_buf_size && (q(e), n.pending !== 0)) return n.last_flush = -1,
|
|
811
|
+
if (n.pending + 2 > n.pending_buf_size && (q(e), n.pending !== 0)) return n.last_flush = -1, W;
|
|
807
812
|
Y(n, e.adler & 255), Y(n, e.adler >> 8 & 255), e.adler = 0;
|
|
808
813
|
}
|
|
809
|
-
if (n.status =
|
|
814
|
+
if (n.status = xn, q(e), n.pending !== 0) return n.last_flush = -1, W;
|
|
810
815
|
}
|
|
811
|
-
if (e.avail_in !== 0 || n.lookahead !== 0 || t !==
|
|
812
|
-
let r = n.level === 0 ?
|
|
813
|
-
if ((r ===
|
|
814
|
-
if (r ===
|
|
816
|
+
if (e.avail_in !== 0 || n.lookahead !== 0 || t !== Vt && n.status !== Sn) {
|
|
817
|
+
let r = n.level === 0 ? In(n, t) : n.strategy === Zt ? Bn(n, t) : n.strategy === Qt ? zn(n, t) : Hn[n.level].func(n, t);
|
|
818
|
+
if ((r === wn || r === Tn) && (n.status = Sn), r === K || r === wn) return e.avail_out === 0 && (n.last_flush = -1), W;
|
|
819
|
+
if (r === Cn && (t === Ht ? Bt(n) : t !== Wt && (Lt(n, 0, 0, !1), t === Ut && (kn(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), q(e), e.avail_out === 0)) return n.last_flush = -1, W;
|
|
815
820
|
}
|
|
816
|
-
return t ===
|
|
821
|
+
return t === U ? n.wrap <= 0 ? Gt : (n.wrap === 2 ? (Y(n, e.adler & 255), Y(n, e.adler >> 8 & 255), Y(n, e.adler >> 16 & 255), Y(n, e.adler >> 24 & 255), Y(n, e.total_in & 255), Y(n, e.total_in >> 8 & 255), Y(n, e.total_in >> 16 & 255), Y(n, e.total_in >> 24 & 255)) : (Mn(n, e.adler >>> 16), Mn(n, e.adler & 65535)), q(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending === 0 ? Gt : W) : W;
|
|
817
822
|
},
|
|
818
823
|
deflateEnd: (e) => {
|
|
819
|
-
if (
|
|
824
|
+
if (Gn(e)) return Kt;
|
|
820
825
|
let t = e.state.status;
|
|
821
|
-
return e.state = null, t ===
|
|
826
|
+
return e.state = null, t === xn ? Dn(e, qt) : W;
|
|
822
827
|
},
|
|
823
828
|
deflateSetDictionary: (e, t) => {
|
|
824
829
|
let n = t.length;
|
|
825
|
-
if (
|
|
830
|
+
if (Gn(e)) return Kt;
|
|
826
831
|
let r = e.state, i = r.wrap;
|
|
827
|
-
if (i === 2 || i === 1 && r.status !==
|
|
828
|
-
if (i === 1 && (e.adler =
|
|
829
|
-
i === 0 && (
|
|
832
|
+
if (i === 2 || i === 1 && r.status !== hn || r.lookahead) return Kt;
|
|
833
|
+
if (i === 1 && (e.adler = Mt(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
|
|
834
|
+
i === 0 && (kn(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0);
|
|
830
835
|
let e = new Uint8Array(r.w_size);
|
|
831
836
|
e.set(t.subarray(n - r.w_size, n), 0), t = e, n = r.w_size;
|
|
832
837
|
}
|
|
833
838
|
let a = e.avail_in, o = e.next_in, s = e.input;
|
|
834
|
-
for (e.avail_in = n, e.next_in = 0, e.input = t,
|
|
835
|
-
let e = r.strstart, t = r.lookahead - (
|
|
839
|
+
for (e.avail_in = n, e.next_in = 0, e.input = t, Fn(r); r.lookahead >= G;) {
|
|
840
|
+
let e = r.strstart, t = r.lookahead - (G - 1);
|
|
836
841
|
do
|
|
837
|
-
r.ins_h =
|
|
842
|
+
r.ins_h = jn(r, r.ins_h, r.window[e + G - 1]), r.prev[e & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = e, e++;
|
|
838
843
|
while (--t);
|
|
839
|
-
r.strstart = e, r.lookahead =
|
|
844
|
+
r.strstart = e, r.lookahead = G - 1, Fn(r);
|
|
840
845
|
}
|
|
841
|
-
return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length =
|
|
846
|
+
return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = G - 1, r.match_available = 0, e.next_in = o, e.input = s, e.avail_in = a, r.wrap = i, W;
|
|
842
847
|
},
|
|
843
848
|
deflateInfo: "pako deflate (from Nodeca project)"
|
|
844
|
-
},
|
|
849
|
+
}, Zn = (e, t) => Object.prototype.hasOwnProperty.call(e, t), Qn = {
|
|
845
850
|
assign: function(e) {
|
|
846
851
|
let t = Array.prototype.slice.call(arguments, 1);
|
|
847
852
|
for (; t.length;) {
|
|
848
853
|
let n = t.shift();
|
|
849
854
|
if (n) {
|
|
850
855
|
if (typeof n != "object") throw TypeError(n + "must be non-object");
|
|
851
|
-
for (let t in n)
|
|
856
|
+
for (let t in n) Zn(n, t) && (e[t] = n[t]);
|
|
852
857
|
}
|
|
853
858
|
}
|
|
854
859
|
return e;
|
|
@@ -863,28 +868,28 @@ var Wn = (e) => {
|
|
|
863
868
|
}
|
|
864
869
|
return n;
|
|
865
870
|
}
|
|
866
|
-
},
|
|
871
|
+
}, $n = !0;
|
|
867
872
|
try {
|
|
868
873
|
String.fromCharCode.apply(null, new Uint8Array(1));
|
|
869
874
|
} catch {
|
|
870
|
-
|
|
875
|
+
$n = !1;
|
|
871
876
|
}
|
|
872
|
-
var
|
|
873
|
-
for (let e = 0; e < 256; e++)
|
|
874
|
-
|
|
875
|
-
var
|
|
877
|
+
var er = new Uint8Array(256);
|
|
878
|
+
for (let e = 0; e < 256; e++) er[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
|
|
879
|
+
er[254] = er[254] = 1;
|
|
880
|
+
var tr = (e) => {
|
|
876
881
|
if (typeof TextEncoder == "function" && TextEncoder.prototype.encode) return new TextEncoder().encode(e);
|
|
877
882
|
let t, n, r, i, a, o = e.length, s = 0;
|
|
878
883
|
for (i = 0; i < o; i++) n = e.charCodeAt(i), (n & 64512) == 55296 && i + 1 < o && (r = e.charCodeAt(i + 1), (r & 64512) == 56320 && (n = 65536 + (n - 55296 << 10) + (r - 56320), i++)), s += n < 128 ? 1 : n < 2048 ? 2 : n < 65536 ? 3 : 4;
|
|
879
884
|
for (t = new Uint8Array(s), a = 0, i = 0; a < s; i++) n = e.charCodeAt(i), (n & 64512) == 55296 && i + 1 < o && (r = e.charCodeAt(i + 1), (r & 64512) == 56320 && (n = 65536 + (n - 55296 << 10) + (r - 56320), i++)), n < 128 ? t[a++] = n : n < 2048 ? (t[a++] = 192 | n >>> 6, t[a++] = 128 | n & 63) : n < 65536 ? (t[a++] = 224 | n >>> 12, t[a++] = 128 | n >>> 6 & 63, t[a++] = 128 | n & 63) : (t[a++] = 240 | n >>> 18, t[a++] = 128 | n >>> 12 & 63, t[a++] = 128 | n >>> 6 & 63, t[a++] = 128 | n & 63);
|
|
880
885
|
return t;
|
|
881
|
-
},
|
|
882
|
-
if (t < 65534 && e.subarray &&
|
|
886
|
+
}, nr = (e, t) => {
|
|
887
|
+
if (t < 65534 && e.subarray && $n) return String.fromCharCode.apply(null, e.length === t ? e : e.subarray(0, t));
|
|
883
888
|
let n = "";
|
|
884
889
|
for (let r = 0; r < t; r++) n += String.fromCharCode(e[r]);
|
|
885
890
|
return n;
|
|
886
|
-
},
|
|
887
|
-
string2buf:
|
|
891
|
+
}, rr = {
|
|
892
|
+
string2buf: tr,
|
|
888
893
|
buf2string: (e, t) => {
|
|
889
894
|
let n = t || e.length;
|
|
890
895
|
if (typeof TextDecoder == "function" && TextDecoder.prototype.decode) return new TextDecoder().decode(e.subarray(0, t));
|
|
@@ -895,7 +900,7 @@ var er = (e) => {
|
|
|
895
900
|
a[i++] = t;
|
|
896
901
|
continue;
|
|
897
902
|
}
|
|
898
|
-
let o =
|
|
903
|
+
let o = er[t];
|
|
899
904
|
if (o > 4) {
|
|
900
905
|
a[i++] = 65533, r += o - 1;
|
|
901
906
|
continue;
|
|
@@ -907,47 +912,47 @@ var er = (e) => {
|
|
|
907
912
|
}
|
|
908
913
|
t < 65536 ? a[i++] = t : (t -= 65536, a[i++] = 55296 | t >> 10 & 1023, a[i++] = 56320 | t & 1023);
|
|
909
914
|
}
|
|
910
|
-
return
|
|
915
|
+
return nr(a, i);
|
|
911
916
|
},
|
|
912
917
|
utf8border: (e, t) => {
|
|
913
918
|
t ||= e.length, t > e.length && (t = e.length);
|
|
914
919
|
let n = t - 1;
|
|
915
920
|
for (; n >= 0 && (e[n] & 192) == 128;) n--;
|
|
916
|
-
return n < 0 || n === 0 ? t : n +
|
|
921
|
+
return n < 0 || n === 0 ? t : n + er[e[n]] > t ? n : t;
|
|
917
922
|
}
|
|
918
923
|
};
|
|
919
|
-
function
|
|
924
|
+
function ir() {
|
|
920
925
|
this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
|
|
921
926
|
}
|
|
922
|
-
var
|
|
923
|
-
function
|
|
924
|
-
this.options =
|
|
925
|
-
level:
|
|
926
|
-
method:
|
|
927
|
+
var ar = ir, or = Object.prototype.toString, { Z_NO_FLUSH: sr, Z_SYNC_FLUSH: cr, Z_FULL_FLUSH: lr, Z_FINISH: ur, Z_OK: dr, Z_STREAM_END: fr, Z_DEFAULT_COMPRESSION: pr, Z_DEFAULT_STRATEGY: mr, Z_DEFLATED: hr } = Ft;
|
|
928
|
+
function gr(e) {
|
|
929
|
+
this.options = Qn.assign({
|
|
930
|
+
level: pr,
|
|
931
|
+
method: hr,
|
|
927
932
|
chunkSize: 16384,
|
|
928
933
|
windowBits: 15,
|
|
929
934
|
memLevel: 8,
|
|
930
|
-
strategy:
|
|
935
|
+
strategy: mr
|
|
931
936
|
}, e || {});
|
|
932
937
|
let t = this.options;
|
|
933
|
-
t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new
|
|
934
|
-
let n =
|
|
935
|
-
if (n !==
|
|
936
|
-
if (t.header &&
|
|
938
|
+
t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new ar(), this.strm.avail_out = 0;
|
|
939
|
+
let n = Xn.deflateInit2(this.strm, t.level, t.method, t.windowBits, t.memLevel, t.strategy);
|
|
940
|
+
if (n !== dr) throw Error(Pt[n]);
|
|
941
|
+
if (t.header && Xn.deflateSetHeader(this.strm, t.header), t.dictionary) {
|
|
937
942
|
let e;
|
|
938
|
-
if (e = typeof t.dictionary == "string" ?
|
|
943
|
+
if (e = typeof t.dictionary == "string" ? rr.string2buf(t.dictionary) : or.call(t.dictionary) === "[object ArrayBuffer]" ? new Uint8Array(t.dictionary) : t.dictionary, n = Xn.deflateSetDictionary(this.strm, e), n !== dr) throw Error(Pt[n]);
|
|
939
944
|
this._dict_set = !0;
|
|
940
945
|
}
|
|
941
946
|
}
|
|
942
|
-
|
|
947
|
+
gr.prototype.push = function(e, t) {
|
|
943
948
|
let n = this.strm, r = this.options.chunkSize, i, a;
|
|
944
949
|
if (this.ended) return !1;
|
|
945
|
-
for (a = t === ~~t ? t : t === !0 ?
|
|
946
|
-
if (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), (a ===
|
|
950
|
+
for (a = t === ~~t ? t : t === !0 ? ur : sr, typeof e == "string" ? n.input = rr.string2buf(e) : or.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length;;) {
|
|
951
|
+
if (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), (a === cr || a === lr) && n.avail_out <= 6) {
|
|
947
952
|
this.onData(n.output.subarray(0, n.next_out)), n.avail_out = 0;
|
|
948
953
|
continue;
|
|
949
954
|
}
|
|
950
|
-
if (i =
|
|
955
|
+
if (i = Xn.deflate(n, a), i === fr) return n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), i = Xn.deflateEnd(this.strm), this.onEnd(i), this.ended = !0, i === dr;
|
|
951
956
|
if (n.avail_out === 0) {
|
|
952
957
|
this.onData(n.output);
|
|
953
958
|
continue;
|
|
@@ -959,29 +964,29 @@ hr.prototype.push = function(e, t) {
|
|
|
959
964
|
if (n.avail_in === 0) break;
|
|
960
965
|
}
|
|
961
966
|
return !0;
|
|
962
|
-
},
|
|
967
|
+
}, gr.prototype.onData = function(e) {
|
|
963
968
|
this.chunks.push(e);
|
|
964
|
-
},
|
|
965
|
-
e ===
|
|
969
|
+
}, gr.prototype.onEnd = function(e) {
|
|
970
|
+
e === dr && (this.result = Qn.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
|
|
966
971
|
};
|
|
967
|
-
function gr(e, t) {
|
|
968
|
-
let n = new hr(t);
|
|
969
|
-
if (n.push(e, !0), n.err) throw n.msg || Ft[n.err];
|
|
970
|
-
return n.result;
|
|
971
|
-
}
|
|
972
972
|
function _r(e, t) {
|
|
973
|
-
|
|
973
|
+
let n = new gr(t);
|
|
974
|
+
if (n.push(e, !0), n.err) throw n.msg || Pt[n.err];
|
|
975
|
+
return n.result;
|
|
974
976
|
}
|
|
975
977
|
function vr(e, t) {
|
|
976
|
-
return t ||= {}, t.
|
|
977
|
-
}
|
|
978
|
-
|
|
979
|
-
|
|
980
|
-
|
|
981
|
-
|
|
982
|
-
|
|
983
|
-
|
|
984
|
-
|
|
978
|
+
return t ||= {}, t.raw = !0, _r(e, t);
|
|
979
|
+
}
|
|
980
|
+
function yr(e, t) {
|
|
981
|
+
return t ||= {}, t.gzip = !0, _r(e, t);
|
|
982
|
+
}
|
|
983
|
+
var br = {
|
|
984
|
+
Deflate: gr,
|
|
985
|
+
deflate: _r,
|
|
986
|
+
deflateRaw: vr,
|
|
987
|
+
gzip: yr,
|
|
988
|
+
constants: Ft
|
|
989
|
+
}, xr = 16209, Sr = 16191, Cr = function(e, t) {
|
|
985
990
|
let n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T, E = e.state;
|
|
986
991
|
n = e.next_in, w = e.input, r = n + (e.avail_in - 5), i = e.next_out, T = e.output, a = i - (t - e.avail_out), o = i + (e.avail_out - 257), s = E.dmax, c = E.wsize, l = E.whave, u = E.wnext, d = E.window, f = E.hold, p = E.bits, m = E.lencode, h = E.distcode, g = (1 << E.lenbits) - 1, _ = (1 << E.distbits) - 1;
|
|
987
992
|
top: do {
|
|
@@ -993,12 +998,12 @@ var yr = {
|
|
|
993
998
|
dodist: for (;;) {
|
|
994
999
|
if (y = v >>> 24, f >>>= y, p -= y, y = v >>> 16 & 255, y & 16) {
|
|
995
1000
|
if (x = v & 65535, y &= 15, p < y && (f += w[n++] << p, p += 8, p < y && (f += w[n++] << p, p += 8)), x += f & (1 << y) - 1, x > s) {
|
|
996
|
-
e.msg = "invalid distance too far back", E.mode =
|
|
1001
|
+
e.msg = "invalid distance too far back", E.mode = xr;
|
|
997
1002
|
break top;
|
|
998
1003
|
}
|
|
999
1004
|
if (f >>>= y, p -= y, y = i - a, x > y) {
|
|
1000
1005
|
if (y = x - y, y > l && E.sane) {
|
|
1001
|
-
e.msg = "invalid distance too far back", E.mode =
|
|
1006
|
+
e.msg = "invalid distance too far back", E.mode = xr;
|
|
1002
1007
|
break top;
|
|
1003
1008
|
}
|
|
1004
1009
|
if (S = 0, C = d, u === 0) {
|
|
@@ -1040,7 +1045,7 @@ var yr = {
|
|
|
1040
1045
|
b && (T[i++] = T[S++], b > 1 && (T[i++] = T[S++]));
|
|
1041
1046
|
}
|
|
1042
1047
|
} else if (y & 64) {
|
|
1043
|
-
e.msg = "invalid distance code", E.mode =
|
|
1048
|
+
e.msg = "invalid distance code", E.mode = xr;
|
|
1044
1049
|
break top;
|
|
1045
1050
|
} else {
|
|
1046
1051
|
v = h[(v & 65535) + (f & (1 << y) - 1)];
|
|
@@ -1052,17 +1057,17 @@ var yr = {
|
|
|
1052
1057
|
v = m[(v & 65535) + (f & (1 << y) - 1)];
|
|
1053
1058
|
continue dolen;
|
|
1054
1059
|
} else if (y & 32) {
|
|
1055
|
-
E.mode =
|
|
1060
|
+
E.mode = Sr;
|
|
1056
1061
|
break top;
|
|
1057
1062
|
} else {
|
|
1058
|
-
e.msg = "invalid literal/length code", E.mode =
|
|
1063
|
+
e.msg = "invalid literal/length code", E.mode = xr;
|
|
1059
1064
|
break top;
|
|
1060
1065
|
}
|
|
1061
1066
|
break;
|
|
1062
1067
|
}
|
|
1063
1068
|
} while (n < r && i < o);
|
|
1064
1069
|
b = p >> 3, n -= b, p -= b << 3, f &= (1 << p) - 1, e.next_in = n, e.next_out = i, e.avail_in = n < r ? 5 + (r - n) : 5 - (n - r), e.avail_out = i < o ? 257 + (o - i) : 257 - (i - o), E.hold = f, E.bits = p;
|
|
1065
|
-
},
|
|
1070
|
+
}, wr = 15, Tr = 852, Er = 592, Dr = 0, Or = 1, kr = 2, Ar = new Uint16Array([
|
|
1066
1071
|
3,
|
|
1067
1072
|
4,
|
|
1068
1073
|
5,
|
|
@@ -1094,7 +1099,7 @@ var yr = {
|
|
|
1094
1099
|
258,
|
|
1095
1100
|
0,
|
|
1096
1101
|
0
|
|
1097
|
-
]),
|
|
1102
|
+
]), jr = new Uint8Array([
|
|
1098
1103
|
16,
|
|
1099
1104
|
16,
|
|
1100
1105
|
16,
|
|
@@ -1126,7 +1131,7 @@ var yr = {
|
|
|
1126
1131
|
16,
|
|
1127
1132
|
72,
|
|
1128
1133
|
78
|
|
1129
|
-
]),
|
|
1134
|
+
]), Mr = new Uint16Array([
|
|
1130
1135
|
1,
|
|
1131
1136
|
2,
|
|
1132
1137
|
3,
|
|
@@ -1159,7 +1164,7 @@ var yr = {
|
|
|
1159
1164
|
24577,
|
|
1160
1165
|
0,
|
|
1161
1166
|
0
|
|
1162
|
-
]),
|
|
1167
|
+
]), Nr = new Uint8Array([
|
|
1163
1168
|
16,
|
|
1164
1169
|
16,
|
|
1165
1170
|
16,
|
|
@@ -1192,18 +1197,18 @@ var yr = {
|
|
|
1192
1197
|
29,
|
|
1193
1198
|
64,
|
|
1194
1199
|
64
|
|
1195
|
-
]),
|
|
1196
|
-
let c = s.bits, l = 0, u = 0, d = 0, f = 0, p = 0, m = 0, h = 0, g = 0, _ = 0, v = 0, y, b, x, S, C, w = null, T, E = new Uint16Array(
|
|
1197
|
-
for (l = 0; l <=
|
|
1200
|
+
]), Pr = (e, t, n, r, i, a, o, s) => {
|
|
1201
|
+
let c = s.bits, l = 0, u = 0, d = 0, f = 0, p = 0, m = 0, h = 0, g = 0, _ = 0, v = 0, y, b, x, S, C, w = null, T, E = new Uint16Array(wr + 1), D = new Uint16Array(wr + 1), O = null, k, ee, te;
|
|
1202
|
+
for (l = 0; l <= wr; l++) E[l] = 0;
|
|
1198
1203
|
for (u = 0; u < r; u++) E[t[n + u]]++;
|
|
1199
|
-
for (p = c, f =
|
|
1204
|
+
for (p = c, f = wr; f >= 1 && E[f] === 0; f--);
|
|
1200
1205
|
if (p > f && (p = f), f === 0) return i[a++] = 20971520, i[a++] = 20971520, s.bits = 1, 0;
|
|
1201
1206
|
for (d = 1; d < f && E[d] === 0; d++);
|
|
1202
|
-
for (p < d && (p = d), g = 1, l = 1; l <=
|
|
1203
|
-
if (g > 0 && (e ===
|
|
1204
|
-
for (D[1] = 0, l = 1; l <
|
|
1207
|
+
for (p < d && (p = d), g = 1, l = 1; l <= wr; l++) if (g <<= 1, g -= E[l], g < 0) return -1;
|
|
1208
|
+
if (g > 0 && (e === Dr || f !== 1)) return -1;
|
|
1209
|
+
for (D[1] = 0, l = 1; l < wr; l++) D[l + 1] = D[l] + E[l];
|
|
1205
1210
|
for (u = 0; u < r; u++) t[n + u] !== 0 && (o[D[t[n + u]]++] = u);
|
|
1206
|
-
if (e ===
|
|
1211
|
+
if (e === Dr ? (w = O = o, T = 20) : e === Or ? (w = Ar, O = jr, T = 257) : (w = Mr, O = Nr, T = 0), v = 0, u = 0, l = d, C = a, m = p, h = 0, x = -1, _ = 1 << p, S = _ - 1, e === Or && _ > Tr || e === kr && _ > Er) return 1;
|
|
1207
1212
|
for (;;) {
|
|
1208
1213
|
k = l - h, o[u] + 1 < T ? (ee = 0, te = o[u]) : o[u] >= T ? (ee = O[o[u] - T], te = w[o[u] - T]) : (ee = 96, te = 0), y = 1 << l - h, b = 1 << m, d = b;
|
|
1209
1214
|
do
|
|
@@ -1216,59 +1221,59 @@ var yr = {
|
|
|
1216
1221
|
}
|
|
1217
1222
|
if (l > p && (v & S) !== x) {
|
|
1218
1223
|
for (h === 0 && (h = p), C += d, m = l - h, g = 1 << m; m + h < f && (g -= E[m + h], !(g <= 0));) m++, g <<= 1;
|
|
1219
|
-
if (_ += 1 << m, e ===
|
|
1224
|
+
if (_ += 1 << m, e === Or && _ > Tr || e === kr && _ > Er) return 1;
|
|
1220
1225
|
x = v & S, i[x] = p << 24 | m << 16 | C - a | 0;
|
|
1221
1226
|
}
|
|
1222
1227
|
}
|
|
1223
1228
|
return v !== 0 && (i[C + v] = l - h << 24 | 4194304), s.bits = p, 0;
|
|
1224
|
-
},
|
|
1225
|
-
function
|
|
1229
|
+
}, Fr = 0, Ir = 1, Lr = 2, { Z_FINISH: Rr, Z_BLOCK: zr, Z_TREES: Br, Z_OK: Vr, Z_STREAM_END: Hr, Z_NEED_DICT: Ur, Z_STREAM_ERROR: X, Z_DATA_ERROR: Wr, Z_MEM_ERROR: Gr, Z_BUF_ERROR: Kr, Z_DEFLATED: qr } = Ft, Jr = 16180, Yr = 16181, Xr = 16182, Zr = 16183, Qr = 16184, $r = 16185, ei = 16186, ti = 16187, ni = 16188, ri = 16189, ii = 16190, ai = 16191, oi = 16192, si = 16193, ci = 16194, li = 16195, ui = 16196, di = 16197, fi = 16198, pi = 16199, mi = 16200, hi = 16201, gi = 16202, _i = 16203, vi = 16204, yi = 16205, bi = 16206, xi = 16207, Si = 16208, Z = 16209, Ci = 16210, wi = 16211, Ti = 852, Ei = 592, Di = 15, Oi = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
|
|
1230
|
+
function ki() {
|
|
1226
1231
|
this.strm = null, this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
|
|
1227
1232
|
}
|
|
1228
|
-
var
|
|
1233
|
+
var Ai = (e) => {
|
|
1229
1234
|
if (!e) return 1;
|
|
1230
1235
|
let t = e.state;
|
|
1231
|
-
return !t || t.strm !== e || t.mode <
|
|
1232
|
-
}, Ai = (e) => {
|
|
1233
|
-
if (ki(e)) return X;
|
|
1234
|
-
let t = e.state;
|
|
1235
|
-
return e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = qr, t.last = 0, t.havedict = 0, t.flags = -1, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new Int32Array(wi), t.distcode = t.distdyn = new Int32Array(Ti), t.sane = 1, t.back = -1, Br;
|
|
1236
|
+
return !t || t.strm !== e || t.mode < Jr || t.mode > wi ? 1 : 0;
|
|
1236
1237
|
}, ji = (e) => {
|
|
1237
|
-
if (
|
|
1238
|
+
if (Ai(e)) return X;
|
|
1239
|
+
let t = e.state;
|
|
1240
|
+
return e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = Jr, t.last = 0, t.havedict = 0, t.flags = -1, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new Int32Array(Ti), t.distcode = t.distdyn = new Int32Array(Ei), t.sane = 1, t.back = -1, Vr;
|
|
1241
|
+
}, Mi = (e) => {
|
|
1242
|
+
if (Ai(e)) return X;
|
|
1238
1243
|
let t = e.state;
|
|
1239
|
-
return t.wsize = 0, t.whave = 0, t.wnext = 0,
|
|
1240
|
-
},
|
|
1244
|
+
return t.wsize = 0, t.whave = 0, t.wnext = 0, ji(e);
|
|
1245
|
+
}, Ni = (e, t) => {
|
|
1241
1246
|
let n;
|
|
1242
|
-
if (
|
|
1247
|
+
if (Ai(e)) return X;
|
|
1243
1248
|
let r = e.state;
|
|
1244
|
-
return t < 0 ? (n = 0, t = -t) : (n = (t >> 4) + 5, t < 48 && (t &= 15)), t && (t < 8 || t > 15) ? X : (r.window !== null && r.wbits !== t && (r.window = null), r.wrap = n, r.wbits = t,
|
|
1245
|
-
},
|
|
1249
|
+
return t < 0 ? (n = 0, t = -t) : (n = (t >> 4) + 5, t < 48 && (t &= 15)), t && (t < 8 || t > 15) ? X : (r.window !== null && r.wbits !== t && (r.window = null), r.wrap = n, r.wbits = t, Mi(e));
|
|
1250
|
+
}, Pi = (e, t) => {
|
|
1246
1251
|
if (!e) return X;
|
|
1247
|
-
let n = new
|
|
1248
|
-
e.state = n, n.strm = e, n.window = null, n.mode =
|
|
1249
|
-
let r =
|
|
1250
|
-
return r !==
|
|
1251
|
-
},
|
|
1252
|
-
if (
|
|
1253
|
-
|
|
1252
|
+
let n = new ki();
|
|
1253
|
+
e.state = n, n.strm = e, n.window = null, n.mode = Jr;
|
|
1254
|
+
let r = Ni(e, t);
|
|
1255
|
+
return r !== Vr && (e.state = null), r;
|
|
1256
|
+
}, Fi = (e) => Pi(e, Di), Ii = !0, Li, Ri, zi = (e) => {
|
|
1257
|
+
if (Ii) {
|
|
1258
|
+
Li = new Int32Array(512), Ri = new Int32Array(32);
|
|
1254
1259
|
let t = 0;
|
|
1255
1260
|
for (; t < 144;) e.lens[t++] = 8;
|
|
1256
1261
|
for (; t < 256;) e.lens[t++] = 9;
|
|
1257
1262
|
for (; t < 280;) e.lens[t++] = 7;
|
|
1258
1263
|
for (; t < 288;) e.lens[t++] = 8;
|
|
1259
|
-
for (
|
|
1260
|
-
|
|
1264
|
+
for (Pr(Ir, e.lens, 0, 288, Li, 0, e.work, { bits: 9 }), t = 0; t < 32;) e.lens[t++] = 5;
|
|
1265
|
+
Pr(Lr, e.lens, 0, 32, Ri, 0, e.work, { bits: 5 }), Ii = !1;
|
|
1261
1266
|
}
|
|
1262
|
-
e.lencode =
|
|
1263
|
-
},
|
|
1267
|
+
e.lencode = Li, e.lenbits = 9, e.distcode = Ri, e.distbits = 5;
|
|
1268
|
+
}, Bi = (e, t, n, r) => {
|
|
1264
1269
|
let i, a = e.state;
|
|
1265
1270
|
return a.window === null && (a.wsize = 1 << a.wbits, a.wnext = 0, a.whave = 0, a.window = new Uint8Array(a.wsize)), r >= a.wsize ? (a.window.set(t.subarray(n - a.wsize, n), 0), a.wnext = 0, a.whave = a.wsize) : (i = a.wsize - a.wnext, i > r && (i = r), a.window.set(t.subarray(n - r, n - r + i), a.wnext), r -= i, r ? (a.window.set(t.subarray(n - r, n), 0), a.wnext = r, a.whave = a.wsize) : (a.wnext += i, a.wnext === a.wsize && (a.wnext = 0), a.whave < a.wsize && (a.whave += i))), 0;
|
|
1266
|
-
},
|
|
1267
|
-
inflateReset:
|
|
1268
|
-
inflateReset2:
|
|
1269
|
-
inflateResetKeep:
|
|
1270
|
-
inflateInit:
|
|
1271
|
-
inflateInit2:
|
|
1271
|
+
}, Vi = {
|
|
1272
|
+
inflateReset: Mi,
|
|
1273
|
+
inflateReset2: Ni,
|
|
1274
|
+
inflateResetKeep: ji,
|
|
1275
|
+
inflateInit: Fi,
|
|
1276
|
+
inflateInit2: Pi,
|
|
1272
1277
|
inflate: (e, t) => {
|
|
1273
1278
|
let n, r, i, a, o, s, c, l, u, d, f, p, m, h, g = 0, _, v, y, b, x, S, C, w, T = new Uint8Array(4), E, D, O = new Uint8Array([
|
|
1274
1279
|
16,
|
|
@@ -1291,12 +1296,12 @@ var ki = (e) => {
|
|
|
1291
1296
|
1,
|
|
1292
1297
|
15
|
|
1293
1298
|
]);
|
|
1294
|
-
if (
|
|
1295
|
-
n = e.state, n.mode ===
|
|
1299
|
+
if (Ai(e) || !e.output || !e.input && e.avail_in !== 0) return X;
|
|
1300
|
+
n = e.state, n.mode === ai && (n.mode = oi), o = e.next_out, i = e.output, c = e.avail_out, a = e.next_in, r = e.input, s = e.avail_in, l = n.hold, u = n.bits, d = s, f = c, w = Vr;
|
|
1296
1301
|
inf_leave: for (;;) switch (n.mode) {
|
|
1297
|
-
case
|
|
1302
|
+
case Jr:
|
|
1298
1303
|
if (n.wrap === 0) {
|
|
1299
|
-
n.mode =
|
|
1304
|
+
n.mode = oi;
|
|
1300
1305
|
break;
|
|
1301
1306
|
}
|
|
1302
1307
|
for (; u < 16;) {
|
|
@@ -1304,14 +1309,14 @@ var ki = (e) => {
|
|
|
1304
1309
|
s--, l += r[a++] << u, u += 8;
|
|
1305
1310
|
}
|
|
1306
1311
|
if (n.wrap & 2 && l === 35615) {
|
|
1307
|
-
n.wbits === 0 && (n.wbits = 15), n.check = 0, T[0] = l & 255, T[1] = l >>> 8 & 255, n.check =
|
|
1312
|
+
n.wbits === 0 && (n.wbits = 15), n.check = 0, T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = H(n.check, T, 2, 0), l = 0, u = 0, n.mode = Yr;
|
|
1308
1313
|
break;
|
|
1309
1314
|
}
|
|
1310
1315
|
if (n.head && (n.head.done = !1), !(n.wrap & 1) || (((l & 255) << 8) + (l >> 8)) % 31) {
|
|
1311
1316
|
e.msg = "incorrect header check", n.mode = Z;
|
|
1312
1317
|
break;
|
|
1313
1318
|
}
|
|
1314
|
-
if ((l & 15) !==
|
|
1319
|
+
if ((l & 15) !== qr) {
|
|
1315
1320
|
e.msg = "unknown compression method", n.mode = Z;
|
|
1316
1321
|
break;
|
|
1317
1322
|
}
|
|
@@ -1319,14 +1324,14 @@ var ki = (e) => {
|
|
|
1319
1324
|
e.msg = "invalid window size", n.mode = Z;
|
|
1320
1325
|
break;
|
|
1321
1326
|
}
|
|
1322
|
-
n.dmax = 1 << n.wbits, n.flags = 0, e.adler = n.check = 1, n.mode = l & 512 ?
|
|
1327
|
+
n.dmax = 1 << n.wbits, n.flags = 0, e.adler = n.check = 1, n.mode = l & 512 ? ri : ai, l = 0, u = 0;
|
|
1323
1328
|
break;
|
|
1324
|
-
case
|
|
1329
|
+
case Yr:
|
|
1325
1330
|
for (; u < 16;) {
|
|
1326
1331
|
if (s === 0) break inf_leave;
|
|
1327
1332
|
s--, l += r[a++] << u, u += 8;
|
|
1328
1333
|
}
|
|
1329
|
-
if (n.flags = l, (n.flags & 255) !==
|
|
1334
|
+
if (n.flags = l, (n.flags & 255) !== qr) {
|
|
1330
1335
|
e.msg = "unknown compression method", n.mode = Z;
|
|
1331
1336
|
break;
|
|
1332
1337
|
}
|
|
@@ -1334,52 +1339,52 @@ var ki = (e) => {
|
|
|
1334
1339
|
e.msg = "unknown header flags set", n.mode = Z;
|
|
1335
1340
|
break;
|
|
1336
1341
|
}
|
|
1337
|
-
n.head && (n.head.text = l >> 8 & 1), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check =
|
|
1338
|
-
case
|
|
1342
|
+
n.head && (n.head.text = l >> 8 & 1), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = H(n.check, T, 2, 0)), l = 0, u = 0, n.mode = Xr;
|
|
1343
|
+
case Xr:
|
|
1339
1344
|
for (; u < 32;) {
|
|
1340
1345
|
if (s === 0) break inf_leave;
|
|
1341
1346
|
s--, l += r[a++] << u, u += 8;
|
|
1342
1347
|
}
|
|
1343
|
-
n.head && (n.head.time = l), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, T[2] = l >>> 16 & 255, T[3] = l >>> 24 & 255, n.check =
|
|
1344
|
-
case
|
|
1348
|
+
n.head && (n.head.time = l), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, T[2] = l >>> 16 & 255, T[3] = l >>> 24 & 255, n.check = H(n.check, T, 4, 0)), l = 0, u = 0, n.mode = Zr;
|
|
1349
|
+
case Zr:
|
|
1345
1350
|
for (; u < 16;) {
|
|
1346
1351
|
if (s === 0) break inf_leave;
|
|
1347
1352
|
s--, l += r[a++] << u, u += 8;
|
|
1348
1353
|
}
|
|
1349
|
-
n.head && (n.head.xflags = l & 255, n.head.os = l >> 8), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check =
|
|
1350
|
-
case
|
|
1354
|
+
n.head && (n.head.xflags = l & 255, n.head.os = l >> 8), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = H(n.check, T, 2, 0)), l = 0, u = 0, n.mode = Qr;
|
|
1355
|
+
case Qr:
|
|
1351
1356
|
if (n.flags & 1024) {
|
|
1352
1357
|
for (; u < 16;) {
|
|
1353
1358
|
if (s === 0) break inf_leave;
|
|
1354
1359
|
s--, l += r[a++] << u, u += 8;
|
|
1355
1360
|
}
|
|
1356
|
-
n.length = l, n.head && (n.head.extra_len = l), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check =
|
|
1361
|
+
n.length = l, n.head && (n.head.extra_len = l), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = H(n.check, T, 2, 0)), l = 0, u = 0;
|
|
1357
1362
|
} else n.head && (n.head.extra = null);
|
|
1358
|
-
n.mode =
|
|
1359
|
-
case Qr:
|
|
1360
|
-
if (n.flags & 1024 && (p = n.length, p > s && (p = s), p && (n.head && (C = n.head.extra_len - n.length, n.head.extra || (n.head.extra = new Uint8Array(n.head.extra_len)), n.head.extra.set(r.subarray(a, a + p), C)), n.flags & 512 && n.wrap & 4 && (n.check = B(n.check, r, p, a)), s -= p, a += p, n.length -= p), n.length)) break inf_leave;
|
|
1361
|
-
n.length = 0, n.mode = $r;
|
|
1363
|
+
n.mode = $r;
|
|
1362
1364
|
case $r:
|
|
1365
|
+
if (n.flags & 1024 && (p = n.length, p > s && (p = s), p && (n.head && (C = n.head.extra_len - n.length, n.head.extra || (n.head.extra = new Uint8Array(n.head.extra_len)), n.head.extra.set(r.subarray(a, a + p), C)), n.flags & 512 && n.wrap & 4 && (n.check = H(n.check, r, p, a)), s -= p, a += p, n.length -= p), n.length)) break inf_leave;
|
|
1366
|
+
n.length = 0, n.mode = ei;
|
|
1367
|
+
case ei:
|
|
1363
1368
|
if (n.flags & 2048) {
|
|
1364
1369
|
if (s === 0) break inf_leave;
|
|
1365
1370
|
p = 0;
|
|
1366
1371
|
do
|
|
1367
1372
|
C = r[a + p++], n.head && C && n.length < 65536 && (n.head.name += String.fromCharCode(C));
|
|
1368
1373
|
while (C && p < s);
|
|
1369
|
-
if (n.flags & 512 && n.wrap & 4 && (n.check =
|
|
1374
|
+
if (n.flags & 512 && n.wrap & 4 && (n.check = H(n.check, r, p, a)), s -= p, a += p, C) break inf_leave;
|
|
1370
1375
|
} else n.head && (n.head.name = null);
|
|
1371
|
-
n.length = 0, n.mode =
|
|
1372
|
-
case
|
|
1376
|
+
n.length = 0, n.mode = ti;
|
|
1377
|
+
case ti:
|
|
1373
1378
|
if (n.flags & 4096) {
|
|
1374
1379
|
if (s === 0) break inf_leave;
|
|
1375
1380
|
p = 0;
|
|
1376
1381
|
do
|
|
1377
1382
|
C = r[a + p++], n.head && C && n.length < 65536 && (n.head.comment += String.fromCharCode(C));
|
|
1378
1383
|
while (C && p < s);
|
|
1379
|
-
if (n.flags & 512 && n.wrap & 4 && (n.check =
|
|
1384
|
+
if (n.flags & 512 && n.wrap & 4 && (n.check = H(n.check, r, p, a)), s -= p, a += p, C) break inf_leave;
|
|
1380
1385
|
} else n.head && (n.head.comment = null);
|
|
1381
|
-
n.mode =
|
|
1382
|
-
case
|
|
1386
|
+
n.mode = ni;
|
|
1387
|
+
case ni:
|
|
1383
1388
|
if (n.flags & 512) {
|
|
1384
1389
|
for (; u < 16;) {
|
|
1385
1390
|
if (s === 0) break inf_leave;
|
|
@@ -1391,21 +1396,21 @@ var ki = (e) => {
|
|
|
1391
1396
|
}
|
|
1392
1397
|
l = 0, u = 0;
|
|
1393
1398
|
}
|
|
1394
|
-
n.head && (n.head.hcrc = n.flags >> 9 & 1, n.head.done = !0), e.adler = n.check = 0, n.mode =
|
|
1399
|
+
n.head && (n.head.hcrc = n.flags >> 9 & 1, n.head.done = !0), e.adler = n.check = 0, n.mode = ai;
|
|
1395
1400
|
break;
|
|
1396
|
-
case
|
|
1401
|
+
case ri:
|
|
1397
1402
|
for (; u < 32;) {
|
|
1398
1403
|
if (s === 0) break inf_leave;
|
|
1399
1404
|
s--, l += r[a++] << u, u += 8;
|
|
1400
1405
|
}
|
|
1401
|
-
e.adler = n.check =
|
|
1402
|
-
case
|
|
1403
|
-
if (n.havedict === 0) return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u,
|
|
1404
|
-
e.adler = n.check = 1, n.mode =
|
|
1405
|
-
case
|
|
1406
|
-
case
|
|
1406
|
+
e.adler = n.check = Oi(l), l = 0, u = 0, n.mode = ii;
|
|
1407
|
+
case ii:
|
|
1408
|
+
if (n.havedict === 0) return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, Ur;
|
|
1409
|
+
e.adler = n.check = 1, n.mode = ai;
|
|
1410
|
+
case ai: if (t === zr || t === Br) break inf_leave;
|
|
1411
|
+
case oi:
|
|
1407
1412
|
if (n.last) {
|
|
1408
|
-
l >>>= u & 7, u -= u & 7, n.mode =
|
|
1413
|
+
l >>>= u & 7, u -= u & 7, n.mode = bi;
|
|
1409
1414
|
break;
|
|
1410
1415
|
}
|
|
1411
1416
|
for (; u < 3;) {
|
|
@@ -1414,22 +1419,22 @@ var ki = (e) => {
|
|
|
1414
1419
|
}
|
|
1415
1420
|
switch (n.last = l & 1, l >>>= 1, --u, l & 3) {
|
|
1416
1421
|
case 0:
|
|
1417
|
-
n.mode =
|
|
1422
|
+
n.mode = si;
|
|
1418
1423
|
break;
|
|
1419
1424
|
case 1:
|
|
1420
|
-
if (
|
|
1425
|
+
if (zi(n), n.mode = pi, t === Br) {
|
|
1421
1426
|
l >>>= 2, u -= 2;
|
|
1422
1427
|
break inf_leave;
|
|
1423
1428
|
}
|
|
1424
1429
|
break;
|
|
1425
1430
|
case 2:
|
|
1426
|
-
n.mode =
|
|
1431
|
+
n.mode = ui;
|
|
1427
1432
|
break;
|
|
1428
1433
|
case 3: e.msg = "invalid block type", n.mode = Z;
|
|
1429
1434
|
}
|
|
1430
1435
|
l >>>= 2, u -= 2;
|
|
1431
1436
|
break;
|
|
1432
|
-
case
|
|
1437
|
+
case si:
|
|
1433
1438
|
for (l >>>= u & 7, u -= u & 7; u < 32;) {
|
|
1434
1439
|
if (s === 0) break inf_leave;
|
|
1435
1440
|
s--, l += r[a++] << u, u += 8;
|
|
@@ -1438,17 +1443,17 @@ var ki = (e) => {
|
|
|
1438
1443
|
e.msg = "invalid stored block lengths", n.mode = Z;
|
|
1439
1444
|
break;
|
|
1440
1445
|
}
|
|
1441
|
-
if (n.length = l & 65535, l = 0, u = 0, n.mode =
|
|
1442
|
-
case
|
|
1443
|
-
case
|
|
1446
|
+
if (n.length = l & 65535, l = 0, u = 0, n.mode = ci, t === Br) break inf_leave;
|
|
1447
|
+
case ci: n.mode = li;
|
|
1448
|
+
case li:
|
|
1444
1449
|
if (p = n.length, p) {
|
|
1445
1450
|
if (p > s && (p = s), p > c && (p = c), p === 0) break inf_leave;
|
|
1446
1451
|
i.set(r.subarray(a, a + p), o), s -= p, a += p, c -= p, o += p, n.length -= p;
|
|
1447
1452
|
break;
|
|
1448
1453
|
}
|
|
1449
|
-
n.mode =
|
|
1454
|
+
n.mode = ai;
|
|
1450
1455
|
break;
|
|
1451
|
-
case
|
|
1456
|
+
case ui:
|
|
1452
1457
|
for (; u < 14;) {
|
|
1453
1458
|
if (s === 0) break inf_leave;
|
|
1454
1459
|
s--, l += r[a++] << u, u += 8;
|
|
@@ -1457,8 +1462,8 @@ var ki = (e) => {
|
|
|
1457
1462
|
e.msg = "too many length or distance symbols", n.mode = Z;
|
|
1458
1463
|
break;
|
|
1459
1464
|
}
|
|
1460
|
-
n.have = 0, n.mode =
|
|
1461
|
-
case
|
|
1465
|
+
n.have = 0, n.mode = di;
|
|
1466
|
+
case di:
|
|
1462
1467
|
for (; n.have < n.ncode;) {
|
|
1463
1468
|
for (; u < 3;) {
|
|
1464
1469
|
if (s === 0) break inf_leave;
|
|
@@ -1467,12 +1472,12 @@ var ki = (e) => {
|
|
|
1467
1472
|
n.lens[O[n.have++]] = l & 7, l >>>= 3, u -= 3;
|
|
1468
1473
|
}
|
|
1469
1474
|
for (; n.have < 19;) n.lens[O[n.have++]] = 0;
|
|
1470
|
-
if (n.lencode = n.lendyn, n.lenbits = 7, E = { bits: n.lenbits }, w =
|
|
1475
|
+
if (n.lencode = n.lendyn, n.lenbits = 7, E = { bits: n.lenbits }, w = Pr(Fr, n.lens, 0, 19, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
|
|
1471
1476
|
e.msg = "invalid code lengths set", n.mode = Z;
|
|
1472
1477
|
break;
|
|
1473
1478
|
}
|
|
1474
|
-
n.have = 0, n.mode =
|
|
1475
|
-
case
|
|
1479
|
+
n.have = 0, n.mode = fi;
|
|
1480
|
+
case fi:
|
|
1476
1481
|
for (; n.have < n.nlen + n.ndist;) {
|
|
1477
1482
|
for (; g = n.lencode[l & (1 << n.lenbits) - 1], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(_ <= u);) {
|
|
1478
1483
|
if (s === 0) break inf_leave;
|
|
@@ -1515,19 +1520,19 @@ var ki = (e) => {
|
|
|
1515
1520
|
e.msg = "invalid code -- missing end-of-block", n.mode = Z;
|
|
1516
1521
|
break;
|
|
1517
1522
|
}
|
|
1518
|
-
if (n.lenbits = 9, E = { bits: n.lenbits }, w =
|
|
1523
|
+
if (n.lenbits = 9, E = { bits: n.lenbits }, w = Pr(Ir, n.lens, 0, n.nlen, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
|
|
1519
1524
|
e.msg = "invalid literal/lengths set", n.mode = Z;
|
|
1520
1525
|
break;
|
|
1521
1526
|
}
|
|
1522
|
-
if (n.distbits = 6, n.distcode = n.distdyn, E = { bits: n.distbits }, w =
|
|
1527
|
+
if (n.distbits = 6, n.distcode = n.distdyn, E = { bits: n.distbits }, w = Pr(Lr, n.lens, n.nlen, n.ndist, n.distcode, 0, n.work, E), n.distbits = E.bits, w) {
|
|
1523
1528
|
e.msg = "invalid distances set", n.mode = Z;
|
|
1524
1529
|
break;
|
|
1525
1530
|
}
|
|
1526
|
-
if (n.mode =
|
|
1527
|
-
case
|
|
1528
|
-
case
|
|
1531
|
+
if (n.mode = pi, t === Br) break inf_leave;
|
|
1532
|
+
case pi: n.mode = mi;
|
|
1533
|
+
case mi:
|
|
1529
1534
|
if (s >= 6 && c >= 258) {
|
|
1530
|
-
e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u,
|
|
1535
|
+
e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, Cr(e, f), o = e.next_out, i = e.output, c = e.avail_out, a = e.next_in, r = e.input, s = e.avail_in, l = n.hold, u = n.bits, n.mode === ai && (n.back = -1);
|
|
1531
1536
|
break;
|
|
1532
1537
|
}
|
|
1533
1538
|
for (n.back = 0; g = n.lencode[l & (1 << n.lenbits) - 1], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(_ <= u);) {
|
|
@@ -1542,19 +1547,19 @@ var ki = (e) => {
|
|
|
1542
1547
|
l >>>= b, u -= b, n.back += b;
|
|
1543
1548
|
}
|
|
1544
1549
|
if (l >>>= _, u -= _, n.back += _, n.length = y, v === 0) {
|
|
1545
|
-
n.mode =
|
|
1550
|
+
n.mode = yi;
|
|
1546
1551
|
break;
|
|
1547
1552
|
}
|
|
1548
1553
|
if (v & 32) {
|
|
1549
|
-
n.back = -1, n.mode =
|
|
1554
|
+
n.back = -1, n.mode = ai;
|
|
1550
1555
|
break;
|
|
1551
1556
|
}
|
|
1552
1557
|
if (v & 64) {
|
|
1553
1558
|
e.msg = "invalid literal/length code", n.mode = Z;
|
|
1554
1559
|
break;
|
|
1555
1560
|
}
|
|
1556
|
-
n.extra = v & 15, n.mode =
|
|
1557
|
-
case
|
|
1561
|
+
n.extra = v & 15, n.mode = hi;
|
|
1562
|
+
case hi:
|
|
1558
1563
|
if (n.extra) {
|
|
1559
1564
|
for (D = n.extra; u < D;) {
|
|
1560
1565
|
if (s === 0) break inf_leave;
|
|
@@ -1562,8 +1567,8 @@ var ki = (e) => {
|
|
|
1562
1567
|
}
|
|
1563
1568
|
n.length += l & (1 << n.extra) - 1, l >>>= n.extra, u -= n.extra, n.back += n.extra;
|
|
1564
1569
|
}
|
|
1565
|
-
n.was = n.length, n.mode =
|
|
1566
|
-
case
|
|
1570
|
+
n.was = n.length, n.mode = gi;
|
|
1571
|
+
case gi:
|
|
1567
1572
|
for (; g = n.distcode[l & (1 << n.distbits) - 1], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(_ <= u);) {
|
|
1568
1573
|
if (s === 0) break inf_leave;
|
|
1569
1574
|
s--, l += r[a++] << u, u += 8;
|
|
@@ -1579,8 +1584,8 @@ var ki = (e) => {
|
|
|
1579
1584
|
e.msg = "invalid distance code", n.mode = Z;
|
|
1580
1585
|
break;
|
|
1581
1586
|
}
|
|
1582
|
-
n.offset = y, n.extra = v & 15, n.mode =
|
|
1583
|
-
case
|
|
1587
|
+
n.offset = y, n.extra = v & 15, n.mode = _i;
|
|
1588
|
+
case _i:
|
|
1584
1589
|
if (n.extra) {
|
|
1585
1590
|
for (D = n.extra; u < D;) {
|
|
1586
1591
|
if (s === 0) break inf_leave;
|
|
@@ -1592,8 +1597,8 @@ var ki = (e) => {
|
|
|
1592
1597
|
e.msg = "invalid distance too far back", n.mode = Z;
|
|
1593
1598
|
break;
|
|
1594
1599
|
}
|
|
1595
|
-
n.mode =
|
|
1596
|
-
case
|
|
1600
|
+
n.mode = vi;
|
|
1601
|
+
case vi:
|
|
1597
1602
|
if (c === 0) break inf_leave;
|
|
1598
1603
|
if (p = f - c, n.offset > p) {
|
|
1599
1604
|
if (p = n.offset - p, p > n.whave && n.sane) {
|
|
@@ -1606,26 +1611,26 @@ var ki = (e) => {
|
|
|
1606
1611
|
do
|
|
1607
1612
|
i[o++] = h[m++];
|
|
1608
1613
|
while (--p);
|
|
1609
|
-
n.length === 0 && (n.mode =
|
|
1614
|
+
n.length === 0 && (n.mode = mi);
|
|
1610
1615
|
break;
|
|
1611
|
-
case
|
|
1616
|
+
case yi:
|
|
1612
1617
|
if (c === 0) break inf_leave;
|
|
1613
|
-
i[o++] = n.length, c--, n.mode =
|
|
1618
|
+
i[o++] = n.length, c--, n.mode = mi;
|
|
1614
1619
|
break;
|
|
1615
|
-
case
|
|
1620
|
+
case bi:
|
|
1616
1621
|
if (n.wrap) {
|
|
1617
1622
|
for (; u < 32;) {
|
|
1618
1623
|
if (s === 0) break inf_leave;
|
|
1619
1624
|
s--, l |= r[a++] << u, u += 8;
|
|
1620
1625
|
}
|
|
1621
|
-
if (f -= c, e.total_out += f, n.total += f, n.wrap & 4 && f && (e.adler = n.check = n.flags ?
|
|
1626
|
+
if (f -= c, e.total_out += f, n.total += f, n.wrap & 4 && f && (e.adler = n.check = n.flags ? H(n.check, i, f, o - f) : Mt(n.check, i, f, o - f)), f = c, n.wrap & 4 && (n.flags ? l : Oi(l)) !== n.check) {
|
|
1622
1627
|
e.msg = "incorrect data check", n.mode = Z;
|
|
1623
1628
|
break;
|
|
1624
1629
|
}
|
|
1625
1630
|
l = 0, u = 0;
|
|
1626
1631
|
}
|
|
1627
|
-
n.mode =
|
|
1628
|
-
case
|
|
1632
|
+
n.mode = xi;
|
|
1633
|
+
case xi:
|
|
1629
1634
|
if (n.wrap && n.flags) {
|
|
1630
1635
|
for (; u < 32;) {
|
|
1631
1636
|
if (s === 0) break inf_leave;
|
|
@@ -1637,121 +1642,121 @@ var ki = (e) => {
|
|
|
1637
1642
|
}
|
|
1638
1643
|
l = 0, u = 0;
|
|
1639
1644
|
}
|
|
1640
|
-
n.mode =
|
|
1641
|
-
case
|
|
1642
|
-
w =
|
|
1645
|
+
n.mode = Si;
|
|
1646
|
+
case Si:
|
|
1647
|
+
w = Hr;
|
|
1643
1648
|
break inf_leave;
|
|
1644
1649
|
case Z:
|
|
1645
|
-
w =
|
|
1650
|
+
w = Wr;
|
|
1646
1651
|
break inf_leave;
|
|
1647
|
-
case
|
|
1648
|
-
case
|
|
1652
|
+
case Ci: return Gr;
|
|
1653
|
+
case wi:
|
|
1649
1654
|
default: return X;
|
|
1650
1655
|
}
|
|
1651
|
-
return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, (n.wsize || f !== e.avail_out && n.mode < Z && (n.mode <
|
|
1656
|
+
return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, (n.wsize || f !== e.avail_out && n.mode < Z && (n.mode < bi || t !== Rr)) && Bi(e, e.output, e.next_out, f - e.avail_out), d -= e.avail_in, f -= e.avail_out, e.total_in += d, e.total_out += f, n.total += f, n.wrap & 4 && f && (e.adler = n.check = n.flags ? H(n.check, i, f, e.next_out - f) : Mt(n.check, i, f, e.next_out - f)), e.data_type = n.bits + (n.last ? 64 : 0) + (n.mode === ai ? 128 : 0) + (n.mode === pi || n.mode === ci ? 256 : 0), (d === 0 && f === 0 || t === Rr) && w === Vr && (w = Kr), w;
|
|
1652
1657
|
},
|
|
1653
1658
|
inflateEnd: (e) => {
|
|
1654
|
-
if (
|
|
1659
|
+
if (Ai(e)) return X;
|
|
1655
1660
|
let t = e.state;
|
|
1656
|
-
return t.window &&= null, e.state = null,
|
|
1661
|
+
return t.window &&= null, e.state = null, Vr;
|
|
1657
1662
|
},
|
|
1658
1663
|
inflateGetHeader: (e, t) => {
|
|
1659
|
-
if (
|
|
1664
|
+
if (Ai(e)) return X;
|
|
1660
1665
|
let n = e.state;
|
|
1661
|
-
return n.wrap & 2 ? (n.head = t, t.done = !1,
|
|
1666
|
+
return n.wrap & 2 ? (n.head = t, t.done = !1, Vr) : X;
|
|
1662
1667
|
},
|
|
1663
1668
|
inflateSetDictionary: (e, t) => {
|
|
1664
1669
|
let n = t.length, r, i, a;
|
|
1665
|
-
return
|
|
1670
|
+
return Ai(e) || (r = e.state, r.wrap !== 0 && r.mode !== ii) ? X : r.mode === ii && (i = 1, i = Mt(i, t, n, 0), i !== r.check) ? Wr : (a = Bi(e, t, n, n), a ? (r.mode = Ci, Gr) : (r.havedict = 1, Vr));
|
|
1666
1671
|
},
|
|
1667
1672
|
inflateInfo: "pako inflate (from Nodeca project)"
|
|
1668
1673
|
};
|
|
1669
|
-
function
|
|
1674
|
+
function Hi() {
|
|
1670
1675
|
this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1;
|
|
1671
1676
|
}
|
|
1672
|
-
var
|
|
1673
|
-
function
|
|
1674
|
-
this.options =
|
|
1677
|
+
var Ui = Hi, Wi = Object.prototype.toString, { Z_NO_FLUSH: Gi, Z_FINISH: Ki, Z_OK: qi, Z_STREAM_END: Ji, Z_NEED_DICT: Yi, Z_STREAM_ERROR: Xi, Z_DATA_ERROR: Zi, Z_MEM_ERROR: Qi } = Ft;
|
|
1678
|
+
function $i(e) {
|
|
1679
|
+
this.options = Qn.assign({
|
|
1675
1680
|
chunkSize: 1024 * 64,
|
|
1676
1681
|
windowBits: 15,
|
|
1677
1682
|
to: ""
|
|
1678
1683
|
}, e || {});
|
|
1679
1684
|
let t = this.options;
|
|
1680
|
-
t.raw && t.windowBits >= 0 && t.windowBits < 16 && (t.windowBits = -t.windowBits, t.windowBits === 0 && (t.windowBits = -15)), t.windowBits >= 0 && t.windowBits < 16 && !(e && e.windowBits) && (t.windowBits += 32), t.windowBits > 15 && t.windowBits < 48 && (t.windowBits & 15 || (t.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new
|
|
1681
|
-
let n =
|
|
1682
|
-
if (n !==
|
|
1685
|
+
t.raw && t.windowBits >= 0 && t.windowBits < 16 && (t.windowBits = -t.windowBits, t.windowBits === 0 && (t.windowBits = -15)), t.windowBits >= 0 && t.windowBits < 16 && !(e && e.windowBits) && (t.windowBits += 32), t.windowBits > 15 && t.windowBits < 48 && (t.windowBits & 15 || (t.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new ar(), this.strm.avail_out = 0;
|
|
1686
|
+
let n = Vi.inflateInit2(this.strm, t.windowBits);
|
|
1687
|
+
if (n !== qi || (this.header = new Ui(), Vi.inflateGetHeader(this.strm, this.header), t.dictionary && (typeof t.dictionary == "string" ? t.dictionary = rr.string2buf(t.dictionary) : Wi.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary)), t.raw && (n = Vi.inflateSetDictionary(this.strm, t.dictionary), n !== qi)))) throw Error(Pt[n]);
|
|
1683
1688
|
}
|
|
1684
|
-
|
|
1689
|
+
$i.prototype.push = function(e, t) {
|
|
1685
1690
|
let n = this.strm, r = this.options.chunkSize, i = this.options.dictionary, a, o, s;
|
|
1686
1691
|
if (this.ended) return !1;
|
|
1687
|
-
for (o = t === ~~t ? t : t === !0 ?
|
|
1688
|
-
for (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), a =
|
|
1692
|
+
for (o = t === ~~t ? t : t === !0 ? Ki : Gi, Wi.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length;;) {
|
|
1693
|
+
for (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), a = Vi.inflate(n, o), a === Yi && i && (a = Vi.inflateSetDictionary(n, i), a === qi ? a = Vi.inflate(n, o) : a === Zi && (a = Yi)); n.avail_in > 0 && a === Ji && n.state.wrap > 0 && e[n.next_in] !== 0;) Vi.inflateReset(n), a = Vi.inflate(n, o);
|
|
1689
1694
|
switch (a) {
|
|
1690
|
-
case Yi:
|
|
1691
1695
|
case Xi:
|
|
1692
|
-
case
|
|
1693
|
-
case
|
|
1696
|
+
case Zi:
|
|
1697
|
+
case Yi:
|
|
1698
|
+
case Qi: return this.onEnd(a), this.ended = !0, !1;
|
|
1694
1699
|
}
|
|
1695
|
-
if (s = n.avail_out, n.next_out && (n.avail_out === 0 || a ===
|
|
1696
|
-
let e =
|
|
1700
|
+
if (s = n.avail_out, n.next_out && (n.avail_out === 0 || a === Ji)) if (this.options.to === "string") {
|
|
1701
|
+
let e = rr.utf8border(n.output, n.next_out), t = n.next_out - e, i = rr.buf2string(n.output, e);
|
|
1697
1702
|
n.next_out = t, n.avail_out = r - t, t && n.output.set(n.output.subarray(e, e + t), 0), this.onData(i);
|
|
1698
1703
|
} else this.onData(n.output.length === n.next_out ? n.output : n.output.subarray(0, n.next_out));
|
|
1699
|
-
if (!(a ===
|
|
1700
|
-
if (a ===
|
|
1704
|
+
if (!(a === qi && s === 0)) {
|
|
1705
|
+
if (a === Ji) return a = Vi.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, !0;
|
|
1701
1706
|
if (n.avail_in === 0) break;
|
|
1702
1707
|
}
|
|
1703
1708
|
}
|
|
1704
1709
|
return !0;
|
|
1705
|
-
},
|
|
1710
|
+
}, $i.prototype.onData = function(e) {
|
|
1706
1711
|
this.chunks.push(e);
|
|
1707
|
-
},
|
|
1708
|
-
e ===
|
|
1712
|
+
}, $i.prototype.onEnd = function(e) {
|
|
1713
|
+
e === qi && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = Qn.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
|
|
1709
1714
|
};
|
|
1710
|
-
function
|
|
1711
|
-
let n = new
|
|
1712
|
-
if (n.push(e), n.err) throw n.msg ||
|
|
1715
|
+
function ea(e, t) {
|
|
1716
|
+
let n = new $i(t);
|
|
1717
|
+
if (n.push(e), n.err) throw n.msg || Pt[n.err];
|
|
1713
1718
|
return n.result;
|
|
1714
1719
|
}
|
|
1715
|
-
function
|
|
1716
|
-
return t ||= {}, t.raw = !0,
|
|
1717
|
-
}
|
|
1718
|
-
var
|
|
1719
|
-
Inflate:
|
|
1720
|
-
inflate:
|
|
1721
|
-
inflateRaw:
|
|
1722
|
-
ungzip:
|
|
1723
|
-
constants:
|
|
1724
|
-
}, { Deflate:
|
|
1725
|
-
Deflate:
|
|
1726
|
-
deflate:
|
|
1727
|
-
deflateRaw:
|
|
1728
|
-
gzip:
|
|
1729
|
-
Inflate:
|
|
1730
|
-
inflate:
|
|
1731
|
-
inflateRaw:
|
|
1732
|
-
ungzip:
|
|
1733
|
-
constants:
|
|
1720
|
+
function ta(e, t) {
|
|
1721
|
+
return t ||= {}, t.raw = !0, ea(e, t);
|
|
1722
|
+
}
|
|
1723
|
+
var na = {
|
|
1724
|
+
Inflate: $i,
|
|
1725
|
+
inflate: ea,
|
|
1726
|
+
inflateRaw: ta,
|
|
1727
|
+
ungzip: ea,
|
|
1728
|
+
constants: Ft
|
|
1729
|
+
}, { Deflate: ra, deflate: ia, deflateRaw: aa, gzip: oa } = br, { Inflate: sa, inflate: ca, inflateRaw: la, ungzip: ua } = na, da = {
|
|
1730
|
+
Deflate: ra,
|
|
1731
|
+
deflate: ia,
|
|
1732
|
+
deflateRaw: aa,
|
|
1733
|
+
gzip: oa,
|
|
1734
|
+
Inflate: sa,
|
|
1735
|
+
inflate: ca,
|
|
1736
|
+
inflateRaw: la,
|
|
1737
|
+
ungzip: ua,
|
|
1738
|
+
constants: Ft
|
|
1734
1739
|
};
|
|
1735
1740
|
//#endregion
|
|
1736
1741
|
//#region packages/lr-map-viewer/src/sdk/lr3d/CLoudDataLoader.js
|
|
1737
|
-
function
|
|
1742
|
+
function fa(e) {
|
|
1738
1743
|
let t = window.atob(e), n = t.length, r = new Uint8Array(n);
|
|
1739
1744
|
for (let e = 0; e < n; e++) r[e] = t.charCodeAt(e);
|
|
1740
1745
|
return r;
|
|
1741
1746
|
}
|
|
1742
|
-
function
|
|
1747
|
+
function pa(e) {
|
|
1743
1748
|
return e[0] === 31 && e[1] === 139 ? "gzip" : e[0] === 120 ? "zlib" : "deflate";
|
|
1744
1749
|
}
|
|
1745
|
-
function
|
|
1746
|
-
let t =
|
|
1750
|
+
function ma(e) {
|
|
1751
|
+
let t = fa(e).slice(4), n = pa(t), r;
|
|
1747
1752
|
try {
|
|
1748
|
-
r = n === "gzip" ?
|
|
1753
|
+
r = n === "gzip" ? da.ungzip(t) : n === "zlib" ? da.inflate(t) : da.inflate(t, { raw: !0 });
|
|
1749
1754
|
} catch (e) {
|
|
1750
1755
|
console.error("Decompression failed:", e);
|
|
1751
1756
|
}
|
|
1752
1757
|
if (r) return new DataView(r.buffer);
|
|
1753
1758
|
}
|
|
1754
|
-
var
|
|
1759
|
+
var ha = class {
|
|
1755
1760
|
constructor(e = {}) {
|
|
1756
1761
|
this.params = e, window.lr3dapp && (this.editorApp = window.lr3dapp), this.coalLayers = [], this.geofaultLayers = [];
|
|
1757
1762
|
}
|
|
@@ -2312,9 +2317,9 @@ var ma = class {
|
|
|
2312
2317
|
if (!Object.prototype.hasOwnProperty.call(e, "_tin_data") || !Object.prototype.hasOwnProperty.call(e, "_tri_model")) return !1;
|
|
2313
2318
|
let r = !0;
|
|
2314
2319
|
Object.prototype.hasOwnProperty.call(e, "_tin_hd") || (r = !1);
|
|
2315
|
-
let i =
|
|
2316
|
-
r && (a =
|
|
2317
|
-
let o =
|
|
2320
|
+
let i = ma(e._tin_data.data), a;
|
|
2321
|
+
r && (a = ma(e._tin_hd.data));
|
|
2322
|
+
let o = ma(e._tri_model.data), s = n.triData, c = n.pntData, l = n.edgeData, u = 0;
|
|
2318
2323
|
u += 20;
|
|
2319
2324
|
let d = o.getUint32(u, !0);
|
|
2320
2325
|
u += 4;
|
|
@@ -2378,7 +2383,7 @@ var ma = class {
|
|
|
2378
2383
|
triData: [],
|
|
2379
2384
|
pntData: []
|
|
2380
2385
|
}
|
|
2381
|
-
}, r =
|
|
2386
|
+
}, r = ma(e._tin_data.data), i = ma(e._tin_id_value.data), a = ma(e._tri_model.data), o = n.data.triData, s = n.data.pntData, c = 0;
|
|
2382
2387
|
c += 20;
|
|
2383
2388
|
let l = a.getUint32(c, !0);
|
|
2384
2389
|
c += 4;
|
|
@@ -2490,18 +2495,18 @@ var ma = class {
|
|
|
2490
2495
|
});
|
|
2491
2496
|
});
|
|
2492
2497
|
}
|
|
2493
|
-
},
|
|
2498
|
+
}, ga = [
|
|
2494
2499
|
"0202030030",
|
|
2495
2500
|
"0106020009",
|
|
2496
2501
|
"0202030004",
|
|
2497
2502
|
"0202030006"
|
|
2498
|
-
],
|
|
2503
|
+
], _a = {
|
|
2499
2504
|
"0202030030": "工作面",
|
|
2500
2505
|
"0106020009": "积水区",
|
|
2501
2506
|
"0202030004": "回采工作面",
|
|
2502
2507
|
"0202030006": "采空区"
|
|
2503
|
-
},
|
|
2504
|
-
function
|
|
2508
|
+
}, va = /* @__PURE__ */ new Map(), Q = null;
|
|
2509
|
+
function ya(e = ye().globalNames) {
|
|
2505
2510
|
if (typeof window > "u") return null;
|
|
2506
2511
|
for (let t of e) if (window[t]) return {
|
|
2507
2512
|
name: t,
|
|
@@ -2509,7 +2514,7 @@ function va(e = ye().globalNames) {
|
|
|
2509
2514
|
};
|
|
2510
2515
|
return null;
|
|
2511
2516
|
}
|
|
2512
|
-
function
|
|
2517
|
+
function ba(e = []) {
|
|
2513
2518
|
if (typeof window > "u") return null;
|
|
2514
2519
|
for (let t of e) if (window[t]) return {
|
|
2515
2520
|
name: t,
|
|
@@ -2517,40 +2522,40 @@ function ya(e = []) {
|
|
|
2517
2522
|
};
|
|
2518
2523
|
return null;
|
|
2519
2524
|
}
|
|
2520
|
-
async function
|
|
2525
|
+
async function xa(e, t = {}) {
|
|
2521
2526
|
let { src: n, globalNames: r = [] } = e;
|
|
2522
2527
|
if (!n) throw Error("存在未配置脚本地址的 SDK 前置依赖");
|
|
2523
2528
|
try {
|
|
2524
|
-
await
|
|
2529
|
+
await me(n, t);
|
|
2525
2530
|
} catch {
|
|
2526
2531
|
throw Error(`SDK 前置依赖加载失败: ${n}`);
|
|
2527
2532
|
}
|
|
2528
|
-
if (r.length > 0 && !
|
|
2533
|
+
if (r.length > 0 && !ba(r)) throw Error(`SDK 前置依赖已加载,但未检测到全局对象: ${r.join(", ")} (${n})`);
|
|
2529
2534
|
}
|
|
2530
|
-
function
|
|
2531
|
-
return
|
|
2535
|
+
function Sa(e = ye().globalNames) {
|
|
2536
|
+
return ya(e);
|
|
2532
2537
|
}
|
|
2533
|
-
async function
|
|
2538
|
+
async function Ca(e = {}) {
|
|
2534
2539
|
let t = ye(), n = t.scriptSrc, r = t.globalNames, i = t.dependencies ?? [], { src: a = n, globalNames: o = r, dependencies: s = i, validateGlobal: c = !0, scriptOptions: l = {} } = e, u = `${a}::${s.map(({ src: e }) => e).join("|")}`;
|
|
2535
|
-
if (
|
|
2540
|
+
if (va.has(u)) return va.get(u);
|
|
2536
2541
|
let d = (async () => {
|
|
2537
|
-
for (let e of s) await
|
|
2538
|
-
await
|
|
2539
|
-
let e =
|
|
2542
|
+
for (let e of s) await xa(e, l);
|
|
2543
|
+
await me(a, l);
|
|
2544
|
+
let e = ya(o);
|
|
2540
2545
|
if (c && !e) throw Error(`龙软 GIS SDK 脚本已加载,但未检测到全局对象: ${o.join(", ")}`);
|
|
2541
2546
|
return {
|
|
2542
2547
|
src: a,
|
|
2543
2548
|
global: e
|
|
2544
2549
|
};
|
|
2545
2550
|
})();
|
|
2546
|
-
|
|
2551
|
+
va.set(u, d);
|
|
2547
2552
|
try {
|
|
2548
2553
|
return await d;
|
|
2549
2554
|
} catch (e) {
|
|
2550
|
-
throw
|
|
2555
|
+
throw va.delete(u), e;
|
|
2551
2556
|
}
|
|
2552
2557
|
}
|
|
2553
|
-
function
|
|
2558
|
+
function wa(e) {
|
|
2554
2559
|
return [
|
|
2555
2560
|
e?.value?.EditorApp,
|
|
2556
2561
|
e?.value,
|
|
@@ -2558,81 +2563,81 @@ function Ca(e) {
|
|
|
2558
2563
|
window.EditorApp
|
|
2559
2564
|
].find((e) => typeof e == "function") ?? null;
|
|
2560
2565
|
}
|
|
2561
|
-
function
|
|
2566
|
+
function Ta(e) {
|
|
2562
2567
|
e && e.replaceChildren();
|
|
2563
2568
|
}
|
|
2564
|
-
function
|
|
2569
|
+
function Ea() {
|
|
2565
2570
|
return Q;
|
|
2566
2571
|
}
|
|
2567
|
-
function
|
|
2572
|
+
function Da() {
|
|
2568
2573
|
Q && typeof Q.onWindowResize == "function" && Q.onWindowResize();
|
|
2569
2574
|
}
|
|
2570
|
-
function
|
|
2571
|
-
typeof window < "u" && Q && typeof Q.onWindowResize == "function" && window.removeEventListener("resize", Q.onWindowResize, !1), typeof window < "u" && window.lr3dapp === Q && delete window.lr3dapp,
|
|
2575
|
+
function Oa(e = null) {
|
|
2576
|
+
typeof window < "u" && Q && typeof Q.onWindowResize == "function" && window.removeEventListener("resize", Q.onWindowResize, !1), typeof window < "u" && window.lr3dapp === Q && delete window.lr3dapp, Ta(e), Q = null;
|
|
2572
2577
|
}
|
|
2573
|
-
async function
|
|
2578
|
+
async function ka(e, t = {}) {
|
|
2574
2579
|
let n = be(), r = xe();
|
|
2575
2580
|
if (!e) throw Error(`未找到场景容器: ${n.containerId}`);
|
|
2576
|
-
|
|
2577
|
-
let { initOptions: i = {}, autoResize: a = n.autoResize } = t, { global: o } = await
|
|
2581
|
+
Oa(e);
|
|
2582
|
+
let { initOptions: i = {}, autoResize: a = n.autoResize } = t, { global: o } = await Ca(), s = wa(o);
|
|
2578
2583
|
if (!s) throw Error("未检测到可用的 EditorApp 构造器");
|
|
2579
2584
|
return Q = new s({
|
|
2580
2585
|
...r,
|
|
2581
2586
|
...i,
|
|
2582
2587
|
dom: e
|
|
2583
|
-
}), typeof window < "u" && (window.lr3dapp = Q), a &&
|
|
2588
|
+
}), typeof window < "u" && (window.lr3dapp = Q), a && Da(), {
|
|
2584
2589
|
instance: Q,
|
|
2585
2590
|
globalName: o?.name ?? "未知"
|
|
2586
2591
|
};
|
|
2587
2592
|
}
|
|
2588
|
-
function
|
|
2589
|
-
let e =
|
|
2593
|
+
function Aa() {
|
|
2594
|
+
let e = Ea();
|
|
2590
2595
|
if (!e) throw Error("龙软 GIS 三维实例不存在,请先完成场景初始化");
|
|
2591
2596
|
return e;
|
|
2592
2597
|
}
|
|
2593
|
-
function Aa() {
|
|
2594
|
-
return ka();
|
|
2595
|
-
}
|
|
2596
2598
|
function ja() {
|
|
2597
|
-
|
|
2599
|
+
return Aa();
|
|
2600
|
+
}
|
|
2601
|
+
function Ma() {
|
|
2602
|
+
let e = Aa();
|
|
2598
2603
|
if (!e.editor) throw Error("当前三维实例缺少 editor 对象");
|
|
2599
2604
|
return e.editor;
|
|
2600
2605
|
}
|
|
2601
|
-
function
|
|
2602
|
-
let e =
|
|
2606
|
+
function Na() {
|
|
2607
|
+
let e = Aa();
|
|
2603
2608
|
if (!e.interfaces) throw Error("当前三维实例缺少 interfaces 对象");
|
|
2604
2609
|
return e.interfaces;
|
|
2605
2610
|
}
|
|
2606
|
-
function
|
|
2607
|
-
|
|
2611
|
+
function Pa() {
|
|
2612
|
+
Da();
|
|
2608
2613
|
}
|
|
2609
|
-
function
|
|
2614
|
+
function Fa(e) {
|
|
2610
2615
|
e?.interfaces?.signals?.sceneGraphChanged?.dispatch?.(), e?.editor?.signals?.sceneGraphChanged?.dispatch?.();
|
|
2611
2616
|
}
|
|
2612
|
-
function
|
|
2613
|
-
|
|
2617
|
+
function Ia() {
|
|
2618
|
+
Fa(Aa());
|
|
2614
2619
|
}
|
|
2615
|
-
async function
|
|
2620
|
+
async function La(e, t = null) {
|
|
2616
2621
|
if (!e || typeof e != "string") throw Error("toolName 必须是非空字符串");
|
|
2617
|
-
let n =
|
|
2622
|
+
let n = Aa();
|
|
2618
2623
|
if (typeof n.activeTool != "function") throw Error("当前三维实例不支持 activeTool 接口");
|
|
2619
2624
|
return n.activeTool(e, t);
|
|
2620
2625
|
}
|
|
2621
|
-
function
|
|
2626
|
+
function Ra(e) {
|
|
2622
2627
|
return e.endsWith("/") ? e.slice(0, -1) : e;
|
|
2623
2628
|
}
|
|
2624
|
-
function
|
|
2625
|
-
return `${
|
|
2629
|
+
function za(e, t) {
|
|
2630
|
+
return `${Ra(e)}/map/getMeta?dsname=${encodeURIComponent(t)}`;
|
|
2626
2631
|
}
|
|
2627
|
-
function
|
|
2632
|
+
function Ba(e) {
|
|
2628
2633
|
let t = Number(e?.laneSize?.width), n = Number(e?.laneSize?.height);
|
|
2629
2634
|
return {
|
|
2630
2635
|
width: Number.isFinite(t) && t > 0 ? t : 10,
|
|
2631
2636
|
height: Number.isFinite(n) && n > 0 ? n : 10
|
|
2632
2637
|
};
|
|
2633
2638
|
}
|
|
2634
|
-
function
|
|
2635
|
-
let t = Se(), n = e.loadMode ?? t?.loadMode ?? "all", r = e.enableRegionAssist ?? t?.cloud?.enableRegionAssist ?? !1, i = e.regionFeatureTypes ?? t?.cloud?.regionFeatureTypes ??
|
|
2639
|
+
function Va(e = {}) {
|
|
2640
|
+
let t = Se(), n = e.loadMode ?? t?.loadMode ?? "all", r = e.enableRegionAssist ?? t?.cloud?.enableRegionAssist ?? !1, i = e.regionFeatureTypes ?? t?.cloud?.regionFeatureTypes ?? ga, a = e.enableLane ?? t?.cloud?.enableLane ?? !1, o = {
|
|
2636
2641
|
...t?.cloud ?? {},
|
|
2637
2642
|
...e,
|
|
2638
2643
|
loadMode: n,
|
|
@@ -2662,38 +2667,38 @@ function Ba(e = {}) {
|
|
|
2662
2667
|
loadMode: n,
|
|
2663
2668
|
enableRegionAssist: !!o.enableRegionAssist,
|
|
2664
2669
|
enableLane: !!o.enableLane,
|
|
2665
|
-
laneSize:
|
|
2670
|
+
laneSize: Ba(o),
|
|
2666
2671
|
coalLayers: o.coalLayers.map((e) => typeof e == "string" ? e.trim() : "").filter(Boolean),
|
|
2667
2672
|
layers: (o.layers ?? []).map((e) => typeof e == "string" ? e.trim() : "").filter(Boolean),
|
|
2668
2673
|
geofaultLayers: (o.geofaultLayers ?? []).map((e) => typeof e == "string" ? e.trim() : "").filter(Boolean),
|
|
2669
|
-
regionFeatureTypes: c.length > 0 ? c : [...
|
|
2674
|
+
regionFeatureTypes: c.length > 0 ? c : [...ga],
|
|
2670
2675
|
workfaceFeatureTypes: s
|
|
2671
2676
|
};
|
|
2672
2677
|
}
|
|
2673
|
-
function
|
|
2678
|
+
function Ha(e) {
|
|
2674
2679
|
return e?.attributes?.FEATURETYPE?.data ?? e?.attributes?.FeatureType?.data ?? "";
|
|
2675
2680
|
}
|
|
2676
2681
|
function $(e, t) {
|
|
2677
2682
|
let n = e?.attributes?.[t]?.data;
|
|
2678
2683
|
return typeof n == "string" ? n.trim() : "";
|
|
2679
2684
|
}
|
|
2680
|
-
function
|
|
2685
|
+
function Ua(e) {
|
|
2681
2686
|
return $(e, "工作面名称") || $(e, "FEATUREID") || $(e, "名称") || $(e, "FEATURENAME") || "";
|
|
2682
2687
|
}
|
|
2683
|
-
function
|
|
2684
|
-
return
|
|
2688
|
+
function Wa(e) {
|
|
2689
|
+
return _a[e] ?? `类型 ${e || "未知"}`;
|
|
2685
2690
|
}
|
|
2686
|
-
function
|
|
2687
|
-
return t === "0202030030" ?
|
|
2691
|
+
function Ga(e, t) {
|
|
2692
|
+
return t === "0202030030" ? Ua(e) : $(e, "FEATUREID") || $(e, "名称") || $(e, "FEATURENAME") || $(e, "工作面名称") || "";
|
|
2688
2693
|
}
|
|
2689
|
-
function
|
|
2690
|
-
let t =
|
|
2694
|
+
function Ka(e) {
|
|
2695
|
+
let t = uo(e), n = [];
|
|
2691
2696
|
return t.forEach((e) => {
|
|
2692
2697
|
let t = typeof e?.layer == "string" ? e.layer : "";
|
|
2693
2698
|
!t || !Array.isArray(e?.features) || e.features.forEach((e) => {
|
|
2694
2699
|
let r = String(e?.id ?? "").trim();
|
|
2695
2700
|
if (!r) return;
|
|
2696
|
-
let i = String(
|
|
2701
|
+
let i = String(Ha(e)).trim(), a = $(e, "FEATUREID"), o = $(e, "FEATURENAME"), s = $(e, "工作面名称"), c = Wa(i), l = Ga(e, i) || `${c}-${r}`, u = `${t}::${r}`;
|
|
2697
2702
|
n.push({
|
|
2698
2703
|
key: u,
|
|
2699
2704
|
featureType: i,
|
|
@@ -2708,10 +2713,10 @@ function Ga(e) {
|
|
|
2708
2713
|
});
|
|
2709
2714
|
}), n;
|
|
2710
2715
|
}
|
|
2711
|
-
function
|
|
2716
|
+
function qa(e) {
|
|
2712
2717
|
return $(e, "FEATURENAME") || $(e, "名称") || $(e, "ID") || $(e, "FEATUREID") || "";
|
|
2713
2718
|
}
|
|
2714
|
-
function
|
|
2719
|
+
function Ja(e) {
|
|
2715
2720
|
if (e?.geometry?.type === "Point" && Array.isArray(e?.geometry?.coordinates)) {
|
|
2716
2721
|
let [t, n, r] = e.geometry.coordinates;
|
|
2717
2722
|
return [{
|
|
@@ -2726,14 +2731,14 @@ function qa(e) {
|
|
|
2726
2731
|
z: Number(n)
|
|
2727
2732
|
})) : [];
|
|
2728
2733
|
}
|
|
2729
|
-
function
|
|
2730
|
-
let t =
|
|
2734
|
+
function Ya(e) {
|
|
2735
|
+
let t = uo(e), n = [];
|
|
2731
2736
|
return t.forEach((e) => {
|
|
2732
2737
|
let t = typeof e?.layer == "string" ? e.layer : "";
|
|
2733
2738
|
!t || !Array.isArray(e?.features) || e.features.forEach((e) => {
|
|
2734
2739
|
let r = String(e?.id ?? "").trim();
|
|
2735
2740
|
if (!r) return;
|
|
2736
|
-
let i = $(e, "FEATUREID"), a = $(e, "FEATURENAME"), o = String(
|
|
2741
|
+
let i = $(e, "FEATUREID"), a = $(e, "FEATURENAME"), o = String(Ha(e)).trim(), s = qa(e) || `巷道-${r}`, c = `${t}::${r}`;
|
|
2737
2742
|
n.push({
|
|
2738
2743
|
key: c,
|
|
2739
2744
|
layerName: t,
|
|
@@ -2743,12 +2748,12 @@ function Ja(e) {
|
|
|
2743
2748
|
featureType: o,
|
|
2744
2749
|
typeLabel: "巷道",
|
|
2745
2750
|
displayName: s,
|
|
2746
|
-
coordinates:
|
|
2751
|
+
coordinates: Ja(e)
|
|
2747
2752
|
});
|
|
2748
2753
|
});
|
|
2749
2754
|
}), n;
|
|
2750
2755
|
}
|
|
2751
|
-
function
|
|
2756
|
+
function Xa(e, t = []) {
|
|
2752
2757
|
let n = new Set(t), r = e?.data?.featureGroups;
|
|
2753
2758
|
if (!Array.isArray(r)) return {
|
|
2754
2759
|
...e ?? {},
|
|
@@ -2759,7 +2764,7 @@ function Ya(e, t = []) {
|
|
|
2759
2764
|
}
|
|
2760
2765
|
};
|
|
2761
2766
|
let i = r.map((e) => {
|
|
2762
|
-
let t = Array.isArray(e?.features) ? e.features.filter((e) => n.has(String(
|
|
2767
|
+
let t = Array.isArray(e?.features) ? e.features.filter((e) => n.has(String(Ha(e)).trim())) : [];
|
|
2763
2768
|
return {
|
|
2764
2769
|
...e,
|
|
2765
2770
|
features: t
|
|
@@ -2773,7 +2778,7 @@ function Ya(e, t = []) {
|
|
|
2773
2778
|
}
|
|
2774
2779
|
};
|
|
2775
2780
|
}
|
|
2776
|
-
function
|
|
2781
|
+
function Za(e, t = []) {
|
|
2777
2782
|
let n = new Set(t.map((e) => typeof e == "string" ? e.trim() : "").filter(Boolean)), r = e?.data?.featureGroups;
|
|
2778
2783
|
if (n.size === 0) return e;
|
|
2779
2784
|
if (!Array.isArray(r)) return {
|
|
@@ -2794,28 +2799,28 @@ function Xa(e, t = []) {
|
|
|
2794
2799
|
}
|
|
2795
2800
|
};
|
|
2796
2801
|
}
|
|
2797
|
-
function
|
|
2798
|
-
return
|
|
2802
|
+
function Qa(e, t) {
|
|
2803
|
+
return Xa(e, t);
|
|
2799
2804
|
}
|
|
2800
|
-
function
|
|
2805
|
+
function $a(e) {
|
|
2801
2806
|
return e.reduce((e, t) => e + (Array.isArray(t?.features) ? t.features.length : 0), 0);
|
|
2802
2807
|
}
|
|
2803
|
-
function
|
|
2808
|
+
function eo(e) {
|
|
2804
2809
|
let t = e?.result?.extent;
|
|
2805
2810
|
if (!Array.isArray(t) || t.length < 4) throw Error("map/getMeta 返回结果缺少有效 extent");
|
|
2806
2811
|
return t;
|
|
2807
2812
|
}
|
|
2808
|
-
function
|
|
2813
|
+
function to(e) {
|
|
2809
2814
|
return {
|
|
2810
2815
|
x: .5 * (Number(e[0]) + Number(e[2])),
|
|
2811
2816
|
y: .5 * (Number(e[1]) + Number(e[3])),
|
|
2812
2817
|
z: 0
|
|
2813
2818
|
};
|
|
2814
2819
|
}
|
|
2815
|
-
function
|
|
2820
|
+
function no(e, t) {
|
|
2816
2821
|
e && (e.basePoint && typeof e.basePoint.copy == "function" ? e.basePoint.copy(t) : e.basePoint = { ...t }, e.isSetBasePoint = !0);
|
|
2817
2822
|
}
|
|
2818
|
-
function
|
|
2823
|
+
function ro(e, t) {
|
|
2819
2824
|
!e || typeof e.getLayerGroup != "function" || t.forEach((t) => {
|
|
2820
2825
|
let n = t?.layer;
|
|
2821
2826
|
if (typeof n != "string" || !n) return;
|
|
@@ -2823,17 +2828,17 @@ function no(e, t) {
|
|
|
2823
2828
|
r && (r.visible = !0);
|
|
2824
2829
|
});
|
|
2825
2830
|
}
|
|
2826
|
-
function
|
|
2831
|
+
function io(e) {
|
|
2827
2832
|
return e?.editor?.manager?.modules?.regionmodule ?? e?.interfaces?.manager?.modules?.regionmodule;
|
|
2828
2833
|
}
|
|
2829
|
-
function
|
|
2834
|
+
function ao(e) {
|
|
2830
2835
|
return e?.editor?.manager?.modules?.lanemodulen ?? e?.interfaces?.manager?.modules?.lanemodulen;
|
|
2831
2836
|
}
|
|
2832
|
-
function
|
|
2837
|
+
function oo(e) {
|
|
2833
2838
|
return [...new Set(e.map((e) => e?.layer).filter((e) => typeof e == "string" && e))];
|
|
2834
2839
|
}
|
|
2835
|
-
function
|
|
2836
|
-
let a =
|
|
2840
|
+
function so(e, t, n, r = 1500, i = 50) {
|
|
2841
|
+
let a = oo(n);
|
|
2837
2842
|
if (a.length === 0) return Promise.resolve(!1);
|
|
2838
2843
|
let o = Date.now();
|
|
2839
2844
|
return new Promise((n) => {
|
|
@@ -2855,7 +2860,7 @@ function oo(e, t, n, r = 1500, i = 50) {
|
|
|
2855
2860
|
s();
|
|
2856
2861
|
});
|
|
2857
2862
|
}
|
|
2858
|
-
function
|
|
2863
|
+
function co() {
|
|
2859
2864
|
return new Promise((e) => {
|
|
2860
2865
|
if (typeof requestAnimationFrame == "function") {
|
|
2861
2866
|
requestAnimationFrame(() => e());
|
|
@@ -2864,31 +2869,31 @@ function so() {
|
|
|
2864
2869
|
setTimeout(e, 16);
|
|
2865
2870
|
});
|
|
2866
2871
|
}
|
|
2867
|
-
async function
|
|
2868
|
-
let t =
|
|
2872
|
+
async function lo(e) {
|
|
2873
|
+
let t = za(e.mapServerUrl, e.dsname), n = await fetch(t);
|
|
2869
2874
|
if (!n.ok) throw Error(`map/getMeta 请求失败: ${n.status}`);
|
|
2870
2875
|
return n.json();
|
|
2871
2876
|
}
|
|
2872
|
-
function
|
|
2877
|
+
function uo(e) {
|
|
2873
2878
|
return Array.isArray(e?.data?.featureGroups) ? e.data.featureGroups : [];
|
|
2874
2879
|
}
|
|
2875
|
-
function
|
|
2876
|
-
let t =
|
|
2880
|
+
function fo(e) {
|
|
2881
|
+
let t = uo(e);
|
|
2877
2882
|
return {
|
|
2878
2883
|
featureGroupCount: t.length,
|
|
2879
|
-
featureCount:
|
|
2884
|
+
featureCount: $a(t),
|
|
2880
2885
|
featureGroups: t
|
|
2881
2886
|
};
|
|
2882
2887
|
}
|
|
2883
|
-
async function
|
|
2888
|
+
async function po(e) {
|
|
2884
2889
|
let t = await e.queryFeatureDict();
|
|
2885
2890
|
t?.code === 0 && Array.isArray(t?.data?.Features) && (e.featureDict = t.data.Features);
|
|
2886
2891
|
}
|
|
2887
|
-
async function
|
|
2888
|
-
t && (
|
|
2892
|
+
async function mo(e, t = !0) {
|
|
2893
|
+
t && (Fa(e), await co()), e.editor && typeof e.editor.focusScene == "function" && e.editor.focusScene();
|
|
2889
2894
|
}
|
|
2890
|
-
async function
|
|
2891
|
-
let t =
|
|
2895
|
+
async function ho(e = {}) {
|
|
2896
|
+
let t = Aa(), n = Va(e), r = eo(await lo(n)), i = to(r), a = new ha({
|
|
2892
2897
|
server: n.server,
|
|
2893
2898
|
username: n.username,
|
|
2894
2899
|
password: n.password,
|
|
@@ -2899,7 +2904,7 @@ async function mo(e = {}) {
|
|
|
2899
2904
|
typeof window < "u" && (window.lr3dLoader = a);
|
|
2900
2905
|
let o = await a.getDatasource();
|
|
2901
2906
|
if (!o) throw Error("云 GIS 数据源认证失败或未返回数据源列表");
|
|
2902
|
-
return
|
|
2907
|
+
return no(t, i), {
|
|
2903
2908
|
app: t,
|
|
2904
2909
|
config: n,
|
|
2905
2910
|
datasource: o,
|
|
@@ -2907,18 +2912,18 @@ async function mo(e = {}) {
|
|
|
2907
2912
|
basePointCenter: i
|
|
2908
2913
|
};
|
|
2909
2914
|
}
|
|
2910
|
-
async function
|
|
2911
|
-
let { app: t, config: n, datasource: r, loader: i, basePointCenter: a } = await
|
|
2915
|
+
async function go(e = {}) {
|
|
2916
|
+
let { app: t, config: n, datasource: r, loader: i, basePointCenter: a } = await ho(e);
|
|
2912
2917
|
if (n.loadMode === "workfaceOnly") {
|
|
2913
|
-
let e = Xa(
|
|
2918
|
+
let e = Za(Xa(await i.queryRegionData(), n.regionFeatureTypes), n.layers), o = uo(e), s = uo(Qa(e, n.workfaceFeatureTypes)), c = Ka(e), l = new Set(n.workfaceFeatureTypes), u = c.filter((e) => l.has(e.featureType)), d = {
|
|
2914
2919
|
featureGroupCount: s.length,
|
|
2915
|
-
featureCount:
|
|
2920
|
+
featureCount: $a(s),
|
|
2916
2921
|
featureTypes: n.workfaceFeatureTypes,
|
|
2917
2922
|
items: u,
|
|
2918
2923
|
renderReady: !1
|
|
2919
2924
|
}, f = {
|
|
2920
2925
|
featureGroupCount: o.length,
|
|
2921
|
-
featureCount:
|
|
2926
|
+
featureCount: $a(o),
|
|
2922
2927
|
featureTypes: n.regionFeatureTypes,
|
|
2923
2928
|
items: c
|
|
2924
2929
|
}, p = {
|
|
@@ -2928,11 +2933,11 @@ async function ho(e = {}) {
|
|
|
2928
2933
|
items: [],
|
|
2929
2934
|
renderReady: !1
|
|
2930
2935
|
};
|
|
2931
|
-
if (f.featureGroupCount > 0 && (await i.addRegionData(e), d.renderReady = await
|
|
2932
|
-
let e =
|
|
2933
|
-
p.featureGroupCount = r.length, p.featureCount =
|
|
2936
|
+
if (f.featureGroupCount > 0 && (await i.addRegionData(e), d.renderReady = await so(io, t, o) && d.featureGroupCount > 0, ro(io(t), o)), n.enableLane) {
|
|
2937
|
+
let e = Za(await i.queryLaneData(), n.layers), r = uo(e);
|
|
2938
|
+
p.featureGroupCount = r.length, p.featureCount = $a(r), p.items = Ya(e), p.featureGroupCount > 0 && (await i.addLaneData(e), p.renderReady = await so(ao, t, r), ro(ao(t), r));
|
|
2934
2939
|
}
|
|
2935
|
-
return await
|
|
2940
|
+
return await mo(t, f.featureGroupCount > 0 || p.featureGroupCount > 0), {
|
|
2936
2941
|
loadMode: n.loadMode,
|
|
2937
2942
|
datasource: r,
|
|
2938
2943
|
regions: f,
|
|
@@ -2944,7 +2949,7 @@ async function ho(e = {}) {
|
|
|
2944
2949
|
i.coalLayers = n.coalLayers, i.geofaultLayers = n.geofaultLayers;
|
|
2945
2950
|
let o = await i.load();
|
|
2946
2951
|
if (!o) throw Error("云 GIS 数据加载失败");
|
|
2947
|
-
return await
|
|
2952
|
+
return await mo(t, !0), {
|
|
2948
2953
|
loadMode: n.loadMode,
|
|
2949
2954
|
layers: o,
|
|
2950
2955
|
datasource: r,
|
|
@@ -2952,9 +2957,9 @@ async function ho(e = {}) {
|
|
|
2952
2957
|
geofaultLayers: n.geofaultLayers
|
|
2953
2958
|
};
|
|
2954
2959
|
}
|
|
2955
|
-
async function
|
|
2956
|
-
let { app: t, datasource: n, loader: r, basePointCenter: i } = await
|
|
2957
|
-
return o > 0 && await r.addRegionAssistData(a), await
|
|
2960
|
+
async function _o(e = {}) {
|
|
2961
|
+
let { app: t, datasource: n, loader: r, basePointCenter: i } = await ho(e), a = await r.queryRegionAssistData(), { featureGroupCount: o, featureCount: s } = fo(a);
|
|
2962
|
+
return o > 0 && await r.addRegionAssistData(a), await mo(t, o > 0), {
|
|
2958
2963
|
datasource: n,
|
|
2959
2964
|
basePoint: i,
|
|
2960
2965
|
featureGroupCount: o,
|
|
@@ -2962,11 +2967,11 @@ async function go(e = {}) {
|
|
|
2962
2967
|
loadSuccess: o > 0
|
|
2963
2968
|
};
|
|
2964
2969
|
}
|
|
2965
|
-
async function
|
|
2966
|
-
let { app: t, datasource: n, loader: r, basePointCenter: i } = await
|
|
2967
|
-
await
|
|
2968
|
-
let a = await r.queryCoalResversData(), { featureGroupCount: o, featureCount: s } =
|
|
2969
|
-
return o > 0 && await r.addCoalResversData(a), await
|
|
2970
|
+
async function vo(e = {}) {
|
|
2971
|
+
let { app: t, datasource: n, loader: r, basePointCenter: i } = await ho(e);
|
|
2972
|
+
await po(r);
|
|
2973
|
+
let a = await r.queryCoalResversData(), { featureGroupCount: o, featureCount: s } = fo(a);
|
|
2974
|
+
return o > 0 && await r.addCoalResversData(a), await mo(t, o > 0), {
|
|
2970
2975
|
datasource: n,
|
|
2971
2976
|
basePoint: i,
|
|
2972
2977
|
featureGroupCount: o,
|
|
@@ -2974,9 +2979,9 @@ async function _o(e = {}) {
|
|
|
2974
2979
|
loadSuccess: o > 0
|
|
2975
2980
|
};
|
|
2976
2981
|
}
|
|
2977
|
-
async function
|
|
2978
|
-
let { app: t, datasource: n, loader: r, basePointCenter: i } = await
|
|
2979
|
-
return o > 0 && await r.addBoundaryData(a), await
|
|
2982
|
+
async function yo(e = {}) {
|
|
2983
|
+
let { app: t, datasource: n, loader: r, basePointCenter: i } = await ho(e), a = await r.queryBoundaryData(), { featureGroupCount: o, featureCount: s } = fo(a);
|
|
2984
|
+
return o > 0 && await r.addBoundaryData(a), await mo(t, o > 0), {
|
|
2980
2985
|
datasource: n,
|
|
2981
2986
|
basePoint: i,
|
|
2982
2987
|
featureGroupCount: o,
|
|
@@ -2984,9 +2989,9 @@ async function vo(e = {}) {
|
|
|
2984
2989
|
loadSuccess: o > 0
|
|
2985
2990
|
};
|
|
2986
2991
|
}
|
|
2987
|
-
async function
|
|
2988
|
-
let { app: t, datasource: n, loader: r, basePointCenter: i } = await
|
|
2989
|
-
return o > 0 && await r.addGeologyData(a), await
|
|
2992
|
+
async function bo(e = {}) {
|
|
2993
|
+
let { app: t, datasource: n, loader: r, basePointCenter: i } = await ho(e), a = await r.queryGeologyData(), { featureGroupCount: o, featureCount: s } = fo(a);
|
|
2994
|
+
return o > 0 && await r.addGeologyData(a), await mo(t, o > 0), {
|
|
2990
2995
|
datasource: n,
|
|
2991
2996
|
basePoint: i,
|
|
2992
2997
|
featureGroupCount: o,
|
|
@@ -2994,9 +2999,9 @@ async function yo(e = {}) {
|
|
|
2994
2999
|
loadSuccess: o > 0
|
|
2995
3000
|
};
|
|
2996
3001
|
}
|
|
2997
|
-
async function
|
|
2998
|
-
let { app: t, datasource: n, loader: r, basePointCenter: i } = await
|
|
2999
|
-
return o > 0 && await r.addPointSymbolData(a), await
|
|
3002
|
+
async function xo(e = {}) {
|
|
3003
|
+
let { app: t, datasource: n, loader: r, basePointCenter: i } = await ho(e), a = await r.queryPointSymbolData(), { featureGroupCount: o, featureCount: s } = fo(a);
|
|
3004
|
+
return o > 0 && await r.addPointSymbolData(a), await mo(t, o > 0), {
|
|
3000
3005
|
datasource: n,
|
|
3001
3006
|
basePoint: i,
|
|
3002
3007
|
featureGroupCount: o,
|
|
@@ -3004,13 +3009,13 @@ async function bo(e = {}) {
|
|
|
3004
3009
|
loadSuccess: o > 0
|
|
3005
3010
|
};
|
|
3006
3011
|
}
|
|
3007
|
-
async function
|
|
3008
|
-
let { app: t, config: n, datasource: r, loader: i, basePointCenter: a } = await
|
|
3012
|
+
async function So(e = {}) {
|
|
3013
|
+
let { app: t, config: n, datasource: r, loader: i, basePointCenter: a } = await ho(e), o = n.coalLayers, s = [];
|
|
3009
3014
|
for (let e of o) {
|
|
3010
3015
|
let t = await i.queryCoalData(e);
|
|
3011
3016
|
t?.data?.attributes && (await i.addCoalData(t, e), s.push(e));
|
|
3012
3017
|
}
|
|
3013
|
-
return await
|
|
3018
|
+
return await mo(t, s.length > 0), {
|
|
3014
3019
|
datasource: r,
|
|
3015
3020
|
basePoint: a,
|
|
3016
3021
|
configuredLayerNames: o,
|
|
@@ -3020,13 +3025,13 @@ async function xo(e = {}) {
|
|
|
3020
3025
|
loadSuccess: s.length > 0
|
|
3021
3026
|
};
|
|
3022
3027
|
}
|
|
3023
|
-
async function
|
|
3024
|
-
let { app: t, config: n, datasource: r, loader: i, basePointCenter: a } = await
|
|
3028
|
+
async function Co(e = {}) {
|
|
3029
|
+
let { app: t, config: n, datasource: r, loader: i, basePointCenter: a } = await ho(e), o = n.geofaultLayers, s = [];
|
|
3025
3030
|
for (let e of o) {
|
|
3026
3031
|
let t = await i.queryGeoFaultData(e);
|
|
3027
3032
|
t?.data?.attributes && (await i.addGeoFaultData(t, e), s.push(e));
|
|
3028
3033
|
}
|
|
3029
|
-
return await
|
|
3034
|
+
return await mo(t, s.length > 0), {
|
|
3030
3035
|
datasource: r,
|
|
3031
3036
|
basePoint: a,
|
|
3032
3037
|
configuredLayerNames: o,
|
|
@@ -3038,44 +3043,44 @@ async function So(e = {}) {
|
|
|
3038
3043
|
}
|
|
3039
3044
|
//#endregion
|
|
3040
3045
|
//#region packages/lr-map-viewer/src/core/mode-manager.js
|
|
3041
|
-
var
|
|
3042
|
-
function
|
|
3043
|
-
return [...
|
|
3046
|
+
var wo = "3d", To = ["2d", "3d"];
|
|
3047
|
+
function Eo() {
|
|
3048
|
+
return [...To];
|
|
3044
3049
|
}
|
|
3045
|
-
function
|
|
3046
|
-
if (typeof e != "string") return
|
|
3050
|
+
function Do(e) {
|
|
3051
|
+
if (typeof e != "string") return wo;
|
|
3047
3052
|
let t = e.trim().toLowerCase();
|
|
3048
|
-
return
|
|
3053
|
+
return To.includes(t) ? t : wo;
|
|
3049
3054
|
}
|
|
3050
|
-
function
|
|
3051
|
-
if (!Array.isArray(e) || e.length === 0) return [
|
|
3055
|
+
function Oo(e = []) {
|
|
3056
|
+
if (!Array.isArray(e) || e.length === 0) return [wo];
|
|
3052
3057
|
let t = [];
|
|
3053
3058
|
return e.forEach((e) => {
|
|
3054
3059
|
if (typeof e != "string") return;
|
|
3055
3060
|
let n = e.trim().toLowerCase();
|
|
3056
|
-
|
|
3057
|
-
}), t.length > 0 ? t : [
|
|
3061
|
+
To.includes(n) && (t.includes(n) || t.push(n));
|
|
3062
|
+
}), t.length > 0 ? t : [wo];
|
|
3058
3063
|
}
|
|
3059
|
-
function
|
|
3060
|
-
let n =
|
|
3064
|
+
function ko(e, t = []) {
|
|
3065
|
+
let n = Oo(t), r = Do(e);
|
|
3061
3066
|
return n.includes(r) ? r : n[0];
|
|
3062
3067
|
}
|
|
3063
|
-
function
|
|
3064
|
-
return
|
|
3068
|
+
function Ao(e, t = []) {
|
|
3069
|
+
return Oo(t).includes(Do(e));
|
|
3065
3070
|
}
|
|
3066
3071
|
//#endregion
|
|
3067
3072
|
//#region \0plugin-vue:export-helper
|
|
3068
|
-
var
|
|
3073
|
+
var jo = (e, t) => {
|
|
3069
3074
|
let n = e.__vccOpts || e;
|
|
3070
3075
|
for (let [e, r] of t) n[e] = r;
|
|
3071
3076
|
return n;
|
|
3072
|
-
},
|
|
3077
|
+
}, Mo = { class: "lr2d-viewer" }, No = {
|
|
3073
3078
|
key: 0,
|
|
3074
3079
|
class: "lr2d-viewer__error"
|
|
3075
|
-
},
|
|
3080
|
+
}, Po = {
|
|
3076
3081
|
key: 1,
|
|
3077
3082
|
class: "lr2d-viewer__placeholder"
|
|
3078
|
-
},
|
|
3083
|
+
}, Fo = /* @__PURE__ */ jo({
|
|
3079
3084
|
__name: "Lr2dViewer",
|
|
3080
3085
|
props: { config: {
|
|
3081
3086
|
type: Object,
|
|
@@ -3085,7 +3090,7 @@ var Ao = (e, t) => {
|
|
|
3085
3090
|
let o = e, s = p(""), c = t(() => o.config?.options || {}), u = t(() => k(o.config)), d = t(() => u.value.length ? `2D 地图配置不完整,缺少:${u.value.join("、")}` : ""), m = t(() => s.value || d.value);
|
|
3086
3091
|
async function _(e) {
|
|
3087
3092
|
if (s.value = "", !u.value.length) try {
|
|
3088
|
-
await
|
|
3093
|
+
await N({
|
|
3089
3094
|
map: e,
|
|
3090
3095
|
config: o.config
|
|
3091
3096
|
});
|
|
@@ -3094,15 +3099,15 @@ var Ao = (e, t) => {
|
|
|
3094
3099
|
}
|
|
3095
3100
|
}
|
|
3096
3101
|
return l(() => {
|
|
3097
|
-
|
|
3098
|
-
}), (e, t) => (f(), i("section",
|
|
3102
|
+
le();
|
|
3103
|
+
}), (e, t) => (f(), i("section", Mo, [m.value ? (f(), i("div", No, h(m.value), 1)) : r("", !0), d.value ? (f(), i("div", Po, [...t[0] ||= [a("p", null, "2D 地图配置待补充", -1), a("small", null, "请通过 `map2dConfig.options` 传入云 GIS 图纸所需参数。", -1)]])) : (f(), n(g(b), {
|
|
3099
3104
|
key: 2,
|
|
3100
3105
|
class: "lr2d-viewer__map",
|
|
3101
3106
|
options: c.value,
|
|
3102
3107
|
onInitMap: _
|
|
3103
3108
|
}, null, 8, ["options"]))]));
|
|
3104
3109
|
}
|
|
3105
|
-
}, [["__scopeId", "data-v-34a88c66"]]),
|
|
3110
|
+
}, [["__scopeId", "data-v-34a88c66"]]), Io = {
|
|
3106
3111
|
regionAssist: "掘进辅助",
|
|
3107
3112
|
coalResvers: "储量块段",
|
|
3108
3113
|
boundary: "矿井边界",
|
|
@@ -3110,31 +3115,31 @@ var Ao = (e, t) => {
|
|
|
3110
3115
|
pointSymbol: "点符号",
|
|
3111
3116
|
coal: "煤层",
|
|
3112
3117
|
geofault: "断层"
|
|
3113
|
-
},
|
|
3114
|
-
regionAssist:
|
|
3115
|
-
coalResvers:
|
|
3116
|
-
boundary:
|
|
3117
|
-
geology:
|
|
3118
|
-
pointSymbol:
|
|
3119
|
-
coal:
|
|
3120
|
-
geofault:
|
|
3118
|
+
}, Lo = {
|
|
3119
|
+
regionAssist: _o,
|
|
3120
|
+
coalResvers: vo,
|
|
3121
|
+
boundary: yo,
|
|
3122
|
+
geology: bo,
|
|
3123
|
+
pointSymbol: xo,
|
|
3124
|
+
coal: So,
|
|
3125
|
+
geofault: Co
|
|
3121
3126
|
};
|
|
3122
|
-
function
|
|
3127
|
+
function Ro(e) {
|
|
3123
3128
|
return e == null ? "" : String(e).trim().toLowerCase();
|
|
3124
3129
|
}
|
|
3125
|
-
function
|
|
3126
|
-
let t =
|
|
3130
|
+
function zo(e) {
|
|
3131
|
+
let t = Ro(e?.layerName), n = Ro(e?.entityId), r = Ro(e?.featureId), i = Ro(e?.displayName);
|
|
3127
3132
|
return t && r ? `layer-feature::${t}::${r}` : t && i ? `layer-name::${t}::${i}` : t && n ? `layer-entity::${t}::${n}` : "";
|
|
3128
3133
|
}
|
|
3129
|
-
function
|
|
3130
|
-
let t =
|
|
3134
|
+
function Bo(e) {
|
|
3135
|
+
let t = Ro(e?.layerName), n = Ro(e?.entityId), r = Ro(e?.featureId), i = Ro(e?.displayName);
|
|
3131
3136
|
return t && r ? `lane-feature::${t}::${r}` : t && i ? `lane-name::${t}::${i}` : t && n ? `lane-entity::${t}::${n}` : "";
|
|
3132
3137
|
}
|
|
3133
|
-
function
|
|
3138
|
+
function Vo(e) {
|
|
3134
3139
|
if (!Array.isArray(e) || e.length === 0) return [];
|
|
3135
3140
|
let t = [], n = /* @__PURE__ */ new Set();
|
|
3136
3141
|
return e.forEach((e) => {
|
|
3137
|
-
let r =
|
|
3142
|
+
let r = zo(e);
|
|
3138
3143
|
if (!r) {
|
|
3139
3144
|
t.push(e);
|
|
3140
3145
|
return;
|
|
@@ -3142,11 +3147,11 @@ function Bo(e) {
|
|
|
3142
3147
|
n.has(r) || (n.add(r), t.push(e));
|
|
3143
3148
|
}), t;
|
|
3144
3149
|
}
|
|
3145
|
-
function
|
|
3150
|
+
function Ho(e) {
|
|
3146
3151
|
if (!Array.isArray(e) || e.length === 0) return [];
|
|
3147
3152
|
let t = [], n = /* @__PURE__ */ new Set();
|
|
3148
3153
|
return e.forEach((e) => {
|
|
3149
|
-
let r =
|
|
3154
|
+
let r = Bo(e);
|
|
3150
3155
|
if (!r) {
|
|
3151
3156
|
t.push(e);
|
|
3152
3157
|
return;
|
|
@@ -3154,69 +3159,69 @@ function Vo(e) {
|
|
|
3154
3159
|
n.has(r) || (n.add(r), t.push(e));
|
|
3155
3160
|
}), t;
|
|
3156
3161
|
}
|
|
3157
|
-
function
|
|
3162
|
+
function Uo(e) {
|
|
3158
3163
|
return e?.data?.featureGroups?.length ?? 0;
|
|
3159
3164
|
}
|
|
3160
|
-
function
|
|
3165
|
+
function Wo(e) {
|
|
3161
3166
|
if (e.loadMode === "workfaceOnly") {
|
|
3162
3167
|
let t = e.regions?.featureGroupCount ?? 0, n = e.regions?.featureCount ?? 0, r = e.workface?.featureGroupCount ?? 0, i = e.workface?.featureCount ?? 0, a = e.workface?.featureTypes?.join(", ") ?? "", o = e.workface?.renderReady === !0 ? "是" : "否", s = e.lane?.enabled === !0, c = e.lane?.featureGroupCount ?? 0, l = e.lane?.featureCount ?? 0, u = e.lane?.renderReady === !0 ? "是" : "否", d = s ? `巷道 图层组 ${c},要素 ${l},渲染就绪 ${u}` : "巷道 未启用";
|
|
3163
3168
|
return `区域要素 图层组 ${t},要素 ${n};工作面 图层组 ${r},要素 ${i},要素编码 ${a || "未配置"},渲染就绪 ${o};${d}`;
|
|
3164
3169
|
}
|
|
3165
|
-
let t =
|
|
3170
|
+
let t = Uo(e.layers?.laneData), n = Uo(e.layers?.regionAssistData), r = Uo(e.layers?.regionData), i = Uo(e.layers?.coalResversData), a = Uo(e.layers?.boundaryData), o = Uo(e.layers?.geologyData), s = Uo(e.layers?.pointSymbolData), c = Array.isArray(e.layers?.coalData) ? e.layers.coalData.length : 0, l = Array.isArray(e.layers?.geofaultData) ? e.layers.geofaultData.length : 0;
|
|
3166
3171
|
return `云GIS全量加载完成:巷道组 ${t},工作面辅助组 ${n},区域组 ${r},煤量组 ${i},边界组 ${a},地质体组 ${o},点符号组 ${s},煤层 ${c}(配置煤层 ${Array.isArray(e.coalLayers) ? e.coalLayers.length : 0}),断层 ${l}(配置断层 ${Array.isArray(e.geofaultLayers) ? e.geofaultLayers.length : 0})`;
|
|
3167
3172
|
}
|
|
3168
|
-
function
|
|
3169
|
-
let n =
|
|
3173
|
+
function Go(e, t) {
|
|
3174
|
+
let n = Io[e] ?? e;
|
|
3170
3175
|
if (e === "coal" || e === "geofault") {
|
|
3171
3176
|
let e = t?.configuredLayerCount ?? 0, r = t?.loadedLayerCount ?? 0;
|
|
3172
3177
|
return e === 0 ? `${n}未加载:未配置图层名` : `${n}加载完成:已加载图层 ${r}/${e}`;
|
|
3173
3178
|
}
|
|
3174
3179
|
return `${n}加载完成:图层组 ${t?.featureGroupCount ?? 0},要素 ${t?.featureCount ?? 0},加载成功 ${t?.loadSuccess === !0 ? "是" : "否"}`;
|
|
3175
3180
|
}
|
|
3176
|
-
async function
|
|
3177
|
-
let t = await
|
|
3181
|
+
async function Ko(e = {}) {
|
|
3182
|
+
let t = await go(e), n = Vo(t?.regions?.items ?? []), r = Array.isArray(t?.lane?.items) ? t.lane.items : [];
|
|
3178
3183
|
return {
|
|
3179
3184
|
result: t,
|
|
3180
3185
|
regionItems: n,
|
|
3181
|
-
laneItems:
|
|
3186
|
+
laneItems: Ho(t?.lane?.items ?? []),
|
|
3182
3187
|
lanePathItems: r,
|
|
3183
|
-
summary:
|
|
3188
|
+
summary: Wo(t)
|
|
3184
3189
|
};
|
|
3185
3190
|
}
|
|
3186
|
-
async function
|
|
3187
|
-
let n =
|
|
3191
|
+
async function qo(e, t = {}) {
|
|
3192
|
+
let n = Lo[e];
|
|
3188
3193
|
if (!n) throw Error(`未找到手动加载类型: ${e}`);
|
|
3189
3194
|
let r = await n(t);
|
|
3190
3195
|
return {
|
|
3191
3196
|
result: r,
|
|
3192
3197
|
loaded: r?.loadSuccess === !0,
|
|
3193
|
-
summary:
|
|
3198
|
+
summary: Go(e, r)
|
|
3194
3199
|
};
|
|
3195
3200
|
}
|
|
3196
3201
|
//#endregion
|
|
3197
3202
|
//#region packages/lr-map-viewer/src/components/Lr3dViewer.vue
|
|
3198
|
-
var
|
|
3203
|
+
var Jo = { class: "lr3d-viewer" }, Yo = { class: "lr3d-viewer__canvas" }, Xo = ["id"], Zo = { class: "lr3d-workface-panel__header" }, Qo = {
|
|
3199
3204
|
key: 0,
|
|
3200
3205
|
class: "lr3d-workface-panel__body"
|
|
3201
|
-
},
|
|
3206
|
+
}, $o = { class: "lr3d-workface-panel__meta" }, es = { class: "lr3d-workface-panel__actions" }, ts = { class: "lr3d-workface-panel__status" }, ns = {
|
|
3202
3207
|
key: 0,
|
|
3203
3208
|
class: "lr3d-workface-panel__empty"
|
|
3204
|
-
},
|
|
3209
|
+
}, rs = {
|
|
3205
3210
|
key: 1,
|
|
3206
3211
|
class: "lr3d-workface-panel__groups"
|
|
3207
|
-
},
|
|
3212
|
+
}, is = { class: "lr3d-workface-panel__group-title" }, as = { class: "lr3d-workface-panel__list" }, os = { class: "lr3d-workface-panel__label" }, ss = ["checked", "onChange"], cs = {
|
|
3208
3213
|
key: 0,
|
|
3209
3214
|
class: "lr3d-workface-panel__group"
|
|
3210
|
-
},
|
|
3215
|
+
}, ls = { class: "lr3d-workface-panel__group-title" }, us = { class: "lr3d-workface-panel__list" }, ds = { class: "lr3d-workface-panel__label" }, fs = ["checked", "onChange"], ps = {
|
|
3211
3216
|
key: 1,
|
|
3212
3217
|
class: "lr3d-viewer__placeholder"
|
|
3213
|
-
},
|
|
3218
|
+
}, ms = {
|
|
3214
3219
|
key: 2,
|
|
3215
3220
|
class: "lr3d-viewer__placeholder lr3d-viewer__placeholder--error"
|
|
3216
|
-
},
|
|
3221
|
+
}, hs = {
|
|
3217
3222
|
key: 0,
|
|
3218
3223
|
class: "lr3d-debug-panel"
|
|
3219
|
-
},
|
|
3224
|
+
}, gs = { class: "lr3d-debug-panel__actions" }, _s = { class: "lr3d-debug-panel__actions" }, vs = ["disabled"], ys = ["disabled"], bs = ["disabled"], xs = ["disabled"], Ss = ["disabled"], Cs = ["disabled"], ws = ["disabled"], Ts = { class: "lr3d-debug-panel__tool" }, Es = { class: "lr3d-debug-panel__log" }, Ds = "demo-person", Os = /* @__PURE__ */ jo({
|
|
3220
3225
|
__name: "Lr3dViewer",
|
|
3221
3226
|
props: {
|
|
3222
3227
|
config: {
|
|
@@ -3233,10 +3238,10 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3233
3238
|
}
|
|
3234
3239
|
},
|
|
3235
3240
|
setup(n, { expose: o }) {
|
|
3236
|
-
let s = n, l = p(Te(s.config)), g = t(() => l.value.scene.containerId), b = p(null), x = p("idle"), S = p("eval_route_gene"), C = p("等待调试操作"), w = p(!1), T = p(!1), E = p(!1), D = p(!1), O = p(!0), k = p(null), ee = p(null), te = p(!1), A = p("等待操作"), ne = p([]), re = p([]), ie = p(null), ae = p(() => {}), j = p(null),
|
|
3241
|
+
let s = n, l = p(Te(s.config)), g = t(() => l.value.scene.containerId), b = p(null), x = p("idle"), S = p("eval_route_gene"), C = p("等待调试操作"), w = p(!1), T = p(!1), E = p(!1), D = p(!1), O = p(!0), k = p(null), ee = p(null), te = p(!1), A = p("等待操作"), ne = p([]), re = p([]), ie = p(null), ae = p(() => {}), j = p(null), oe = p({
|
|
3237
3242
|
key: "",
|
|
3238
3243
|
timestamp: 0
|
|
3239
|
-
}),
|
|
3244
|
+
}), se = p({
|
|
3240
3245
|
regionAssist: {
|
|
3241
3246
|
loading: !1,
|
|
3242
3247
|
loaded: !1
|
|
@@ -3265,12 +3270,12 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3265
3270
|
loading: !1,
|
|
3266
3271
|
loaded: !1
|
|
3267
3272
|
}
|
|
3268
|
-
}),
|
|
3273
|
+
}), ce = p([]), M = p({}), N = p([]), P = p({}), le = [
|
|
3269
3274
|
"0202030030",
|
|
3270
3275
|
"0106020009",
|
|
3271
3276
|
"0202030004",
|
|
3272
3277
|
"0202030006"
|
|
3273
|
-
],
|
|
3278
|
+
], ue = {
|
|
3274
3279
|
"0202030030": "工作面",
|
|
3275
3280
|
"0106020009": "积水区",
|
|
3276
3281
|
"0202030004": "回采工作面",
|
|
@@ -3282,10 +3287,10 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3282
3287
|
deep: !0,
|
|
3283
3288
|
immediate: !0
|
|
3284
3289
|
});
|
|
3285
|
-
let
|
|
3290
|
+
let de = t(() => ce.value), fe = t(() => {
|
|
3286
3291
|
let e = /* @__PURE__ */ new Map();
|
|
3287
|
-
|
|
3288
|
-
let n = t?.featureType || "unknown", r = t?.typeLabel ||
|
|
3292
|
+
de.value.forEach((t) => {
|
|
3293
|
+
let n = t?.featureType || "unknown", r = t?.typeLabel || ue[n] || `类型 ${n}`;
|
|
3289
3294
|
e.has(n) || e.set(n, {
|
|
3290
3295
|
featureType: n,
|
|
3291
3296
|
typeLabel: r,
|
|
@@ -3294,25 +3299,25 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3294
3299
|
});
|
|
3295
3300
|
let t = Array.from(e.values());
|
|
3296
3301
|
return t.sort((e, t) => {
|
|
3297
|
-
let n =
|
|
3302
|
+
let n = le.indexOf(e.featureType), r = le.indexOf(t.featureType), i = n === -1 ? 2 ** 53 - 1 : n, a = r === -1 ? 2 ** 53 - 1 : r;
|
|
3298
3303
|
return i === a ? e.typeLabel.localeCompare(t.typeLabel, "zh-CN") : i - a;
|
|
3299
3304
|
}), t;
|
|
3300
|
-
}),
|
|
3305
|
+
}), pe = t(() => fe.value.length > 0 || N.value.length > 0), me = t(() => l.value?.dataSource?.type === "cloud" && l.value?.dataSource?.autoLoad === !0), he = t(() => l.value?.dataSource?.cloud?.demoPerson ?? {});
|
|
3301
3306
|
t(() => {
|
|
3302
|
-
let e =
|
|
3307
|
+
let e = he.value?.layer;
|
|
3303
3308
|
return typeof e == "string" ? e.trim() : "";
|
|
3304
3309
|
}), t(() => {
|
|
3305
|
-
let e =
|
|
3310
|
+
let e = he.value?.startPoint, t = Number(e?.x), n = Number(e?.y), r = Number(e?.z);
|
|
3306
3311
|
return !Number.isFinite(t) || !Number.isFinite(n) || !Number.isFinite(r) ? null : {
|
|
3307
3312
|
x: t,
|
|
3308
3313
|
y: n,
|
|
3309
3314
|
z: r
|
|
3310
3315
|
};
|
|
3311
3316
|
});
|
|
3312
|
-
function
|
|
3317
|
+
function F(e) {
|
|
3313
3318
|
C.value = `${(/* @__PURE__ */ new Date()).toLocaleTimeString()} - ${e}`;
|
|
3314
3319
|
}
|
|
3315
|
-
function
|
|
3320
|
+
function I(e) {
|
|
3316
3321
|
let t = (/* @__PURE__ */ new Date()).toLocaleTimeString();
|
|
3317
3322
|
C.value = `${C.value}\n${t} - ${e}`;
|
|
3318
3323
|
}
|
|
@@ -3327,9 +3332,9 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3327
3332
|
return window.THREE;
|
|
3328
3333
|
}
|
|
3329
3334
|
function ve() {
|
|
3330
|
-
|
|
3335
|
+
Ma()?.signals?.sceneBackgroundChanged?.dispatch?.("Gradientcolor", null, null, null, null, "#696969", "#696969");
|
|
3331
3336
|
}
|
|
3332
|
-
function
|
|
3337
|
+
function R(e) {
|
|
3333
3338
|
let t = [], n = e?.userData ?? {}, r = n?.attrs ?? n?.info ?? n ?? {};
|
|
3334
3339
|
return [
|
|
3335
3340
|
"实体ID",
|
|
@@ -3347,11 +3352,11 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3347
3352
|
n != null && String(n).trim() && t.push(String(n));
|
|
3348
3353
|
}), typeof e?.name == "string" && e.name.trim() && t.push(e.name), e?.id !== null && e?.id !== void 0 && t.push(String(e.id)), t.map((e) => ge(e)).filter(Boolean);
|
|
3349
3354
|
}
|
|
3350
|
-
function
|
|
3355
|
+
function ye(...e) {
|
|
3351
3356
|
for (let t of e) if (t != null && String(t).trim()) return t;
|
|
3352
3357
|
return "";
|
|
3353
3358
|
}
|
|
3354
|
-
function
|
|
3359
|
+
function be(e) {
|
|
3355
3360
|
let t = {
|
|
3356
3361
|
ids: [],
|
|
3357
3362
|
names: [],
|
|
@@ -3364,22 +3369,22 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3364
3369
|
}
|
|
3365
3370
|
return t;
|
|
3366
3371
|
}
|
|
3367
|
-
function
|
|
3372
|
+
function xe(e, t = "selection") {
|
|
3368
3373
|
let n = e?.object ?? e ?? null;
|
|
3369
3374
|
if (!n || typeof n != "object") return null;
|
|
3370
|
-
let r =
|
|
3375
|
+
let r = be(n), i = n?.position, a = i && Number.isFinite(Number(i.x)) ? {
|
|
3371
3376
|
x: Number(i.x),
|
|
3372
3377
|
y: Number(i.y),
|
|
3373
3378
|
z: Number(i.z)
|
|
3374
3379
|
} : null;
|
|
3375
3380
|
return {
|
|
3376
|
-
id:
|
|
3377
|
-
name:
|
|
3378
|
-
layerName:
|
|
3381
|
+
id: ye(...r.ids) || null,
|
|
3382
|
+
name: ye(...r.names) || null,
|
|
3383
|
+
layerName: ye(...r.layerNames) || null,
|
|
3379
3384
|
position: a
|
|
3380
3385
|
};
|
|
3381
3386
|
}
|
|
3382
|
-
function
|
|
3387
|
+
function Se(e) {
|
|
3383
3388
|
let t = ie.value;
|
|
3384
3389
|
if (typeof t != "function" || !e) return !1;
|
|
3385
3390
|
let n = [
|
|
@@ -3388,12 +3393,12 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3388
3393
|
e?.layerName ?? "",
|
|
3389
3394
|
e?.type ?? ""
|
|
3390
3395
|
].join("::"), r = Date.now();
|
|
3391
|
-
return n && n ===
|
|
3396
|
+
return n && n === oe.value.key && r - oe.value.timestamp < 150 ? !1 : (oe.value = {
|
|
3392
3397
|
key: n,
|
|
3393
3398
|
timestamp: r
|
|
3394
3399
|
}, t(e), !0);
|
|
3395
3400
|
}
|
|
3396
|
-
function
|
|
3401
|
+
function we() {
|
|
3397
3402
|
ae.value?.();
|
|
3398
3403
|
let e = [];
|
|
3399
3404
|
if (b.value) {
|
|
@@ -3401,8 +3406,8 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3401
3406
|
j.value !== null && window.clearTimeout(j.value), j.value = window.setTimeout(() => {
|
|
3402
3407
|
j.value = null;
|
|
3403
3408
|
try {
|
|
3404
|
-
let e =
|
|
3405
|
-
|
|
3409
|
+
let e = xe(Ma()?.selected, "click-fallback");
|
|
3410
|
+
Se(e) && F(`模型信息查询触发:${e?.name || e?.id || "未命名对象"}`);
|
|
3406
3411
|
} catch {}
|
|
3407
3412
|
}, 0);
|
|
3408
3413
|
};
|
|
@@ -3412,38 +3417,38 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3412
3417
|
e.forEach((e) => e()), j.value !== null && (window.clearTimeout(j.value), j.value = null);
|
|
3413
3418
|
};
|
|
3414
3419
|
}
|
|
3415
|
-
function
|
|
3420
|
+
function Ee(e) {
|
|
3416
3421
|
if (e != null && typeof e != "function") throw Error("模型信息查询回调必须是函数");
|
|
3417
3422
|
return ie.value = typeof e == "function" ? e : null, ie.value !== null;
|
|
3418
3423
|
}
|
|
3419
|
-
function
|
|
3424
|
+
function De(e) {
|
|
3420
3425
|
return [ge(e?.entityId), ge(e?.featureId)].filter(Boolean);
|
|
3421
3426
|
}
|
|
3422
|
-
function
|
|
3423
|
-
|
|
3427
|
+
function Oe(e) {
|
|
3428
|
+
ce.value = Array.isArray(e) ? e : [];
|
|
3424
3429
|
let t = {};
|
|
3425
|
-
|
|
3430
|
+
ce.value.forEach((e) => {
|
|
3426
3431
|
t[e.key] = !0;
|
|
3427
|
-
}),
|
|
3432
|
+
}), M.value = t;
|
|
3428
3433
|
}
|
|
3429
|
-
function
|
|
3430
|
-
|
|
3434
|
+
function ke(e) {
|
|
3435
|
+
N.value = Array.isArray(e) ? e : [];
|
|
3431
3436
|
let t = {};
|
|
3432
|
-
|
|
3437
|
+
N.value.forEach((e) => {
|
|
3433
3438
|
t[e.key] = !0;
|
|
3434
|
-
}),
|
|
3439
|
+
}), P.value = t;
|
|
3435
3440
|
}
|
|
3436
|
-
function
|
|
3441
|
+
function Ae(e) {
|
|
3437
3442
|
ne.value = Array.isArray(e) ? e : [];
|
|
3438
3443
|
}
|
|
3439
|
-
function
|
|
3444
|
+
function je() {
|
|
3440
3445
|
k.value !== null && (window.clearInterval(k.value), k.value = null), te.value = !1, ee.value = null, re.value = [], ne.value = [];
|
|
3441
3446
|
try {
|
|
3442
|
-
let e =
|
|
3443
|
-
e?.PersonModuleInterfaces?.stopPerLoop?.(), e?.PersonModuleInterfaces?.deletePersonAll?.(
|
|
3447
|
+
let e = Ma();
|
|
3448
|
+
e?.PersonModuleInterfaces?.stopPerLoop?.(), e?.PersonModuleInterfaces?.deletePersonAll?.(Ds);
|
|
3444
3449
|
} catch {}
|
|
3445
3450
|
}
|
|
3446
|
-
function
|
|
3451
|
+
function Me(e, t, n) {
|
|
3447
3452
|
let r = Number(e), i = Number(t), a = Number(n);
|
|
3448
3453
|
return !Number.isFinite(r) || !Number.isFinite(i) || !Number.isFinite(a) ? null : {
|
|
3449
3454
|
x: r,
|
|
@@ -3451,27 +3456,27 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3451
3456
|
z: a
|
|
3452
3457
|
};
|
|
3453
3458
|
}
|
|
3454
|
-
function
|
|
3459
|
+
function Ne(e, t) {
|
|
3455
3460
|
try {
|
|
3456
|
-
let n = _e(), r =
|
|
3461
|
+
let n = _e(), r = ja(), i = Ma(), a = r?.basePoint ?? {
|
|
3457
3462
|
x: 0,
|
|
3458
3463
|
y: 0,
|
|
3459
3464
|
z: 0
|
|
3460
3465
|
}, o = new n.Vector3(Number(e.x) - Number(a.x ?? 0), Number(e.y) - Number(a.y ?? 0), Number(e.z) - Number(a.z ?? 0));
|
|
3461
|
-
if (
|
|
3462
|
-
return i.focusPoint(null, o), A.value = "聚焦接口已调用",
|
|
3466
|
+
if (I(`准备聚焦${t}:绝对坐标(${Number(e.x).toFixed(2)}, ${Number(e.y).toFixed(2)}, ${Number(e.z).toFixed(2)}),basePoint(${Number(a.x ?? 0).toFixed(2)}, ${Number(a.y ?? 0).toFixed(2)}, ${Number(a.z ?? 0).toFixed(2)}),相对坐标(${o.x.toFixed(2)}, ${o.y.toFixed(2)}, ${o.z.toFixed(2)})`), A.value = `准备聚焦:${Number(e.x).toFixed(2)}, ${Number(e.y).toFixed(2)}, ${Number(e.z).toFixed(2)}`, typeof i?.focusPoint != "function") throw Error("editor.focusPoint 不存在");
|
|
3467
|
+
return i.focusPoint(null, o), A.value = "聚焦接口已调用", F(`已聚焦到${t}:${Number(e.x).toFixed(2)}, ${Number(e.y).toFixed(2)}, ${Number(e.z).toFixed(2)}`), !0;
|
|
3463
3468
|
} catch (e) {
|
|
3464
|
-
return A.value = `聚焦失败:${L(e)}`,
|
|
3469
|
+
return A.value = `聚焦失败:${L(e)}`, F(`聚焦${t}失败:${L(e)}`), !1;
|
|
3465
3470
|
}
|
|
3466
3471
|
}
|
|
3467
|
-
function
|
|
3472
|
+
function Pe(e, t, n) {
|
|
3468
3473
|
A.value = `点击移动视角:${(/* @__PURE__ */ new Date()).toLocaleTimeString()}`;
|
|
3469
|
-
let r =
|
|
3470
|
-
return r ?
|
|
3474
|
+
let r = Me(e, t, n);
|
|
3475
|
+
return r ? Ne(r, "目标点") : (A.value = "移动视角失败:坐标参数无效", F("移动视角失败:坐标参数无效"), !1);
|
|
3471
3476
|
}
|
|
3472
|
-
function
|
|
3477
|
+
function Fe(e) {
|
|
3473
3478
|
if (!Array.isArray(e) || e.length === 0) return;
|
|
3474
|
-
let t =
|
|
3479
|
+
let t = Ma()?.manager?.modules?.lanemodulen;
|
|
3475
3480
|
if (!t || typeof t.toggleLaneMaterial != "function") throw Error("当前三维实例缺少巷道材质切换接口");
|
|
3476
3481
|
[...new Set(e.map((e) => typeof e?.layerName == "string" ? e.layerName.trim() : "").filter(Boolean))].forEach((e) => {
|
|
3477
3482
|
t.toggleLaneMaterial(e, "glass");
|
|
@@ -3481,328 +3486,328 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3481
3486
|
e && (e.transparent = !0, e.opacity = .4, e.needsUpdate = !0);
|
|
3482
3487
|
});
|
|
3483
3488
|
});
|
|
3484
|
-
}),
|
|
3489
|
+
}), Ia();
|
|
3485
3490
|
}
|
|
3486
|
-
function
|
|
3487
|
-
let n = (
|
|
3491
|
+
function Ie(e, t) {
|
|
3492
|
+
let n = (Ma()?.manager?.modules?.regionmodule)?.getLayerGroup?.(e.layerName);
|
|
3488
3493
|
if (!n) return !1;
|
|
3489
|
-
let r = new Set(
|
|
3494
|
+
let r = new Set(De(e)), i = !1;
|
|
3490
3495
|
return n.traverse?.((e) => {
|
|
3491
|
-
|
|
3496
|
+
R(e).some((e) => r.has(e)) && (e.visible = t, i = !0);
|
|
3492
3497
|
}), !i && Array.isArray(n.children) && n.children.forEach((e) => {
|
|
3493
|
-
|
|
3498
|
+
R(e).some((e) => r.has(e)) && (e.visible = t, i = !0);
|
|
3494
3499
|
}), i;
|
|
3495
3500
|
}
|
|
3496
|
-
function
|
|
3501
|
+
function Le(e, t) {
|
|
3497
3502
|
if (!Array.isArray(e) || e.length === 0) return 0;
|
|
3498
|
-
let n = { ...
|
|
3503
|
+
let n = { ...M.value }, r = 0;
|
|
3499
3504
|
return e.forEach((e) => {
|
|
3500
|
-
|
|
3501
|
-
}),
|
|
3505
|
+
Ie(e, t) && (n[e.key] = t, r += 1);
|
|
3506
|
+
}), M.value = n, D.value = t, Ia(), r;
|
|
3502
3507
|
}
|
|
3503
|
-
function
|
|
3504
|
-
let n = t?.target, r = n?.checked === !0, i =
|
|
3505
|
-
|
|
3506
|
-
...
|
|
3508
|
+
function Re(e, t) {
|
|
3509
|
+
let n = t?.target, r = n?.checked === !0, i = M.value[e.key] !== !1;
|
|
3510
|
+
M.value = {
|
|
3511
|
+
...M.value,
|
|
3507
3512
|
[e.key]: r
|
|
3508
3513
|
};
|
|
3509
3514
|
try {
|
|
3510
|
-
if (!
|
|
3511
|
-
|
|
3515
|
+
if (!Ie(e, r)) throw Error(`未找到区域对象: ${e.displayName}`);
|
|
3516
|
+
Ia(), D.value = de.value.some((e) => M.value[e.key] !== !1), F(`${e.typeLabel || "区域"}显隐已更新:${e.displayName} -> ${r ? "显示" : "隐藏"}`);
|
|
3512
3517
|
} catch (t) {
|
|
3513
|
-
|
|
3514
|
-
...
|
|
3518
|
+
M.value = {
|
|
3519
|
+
...M.value,
|
|
3515
3520
|
[e.key]: i
|
|
3516
|
-
}, n && (n.checked = i),
|
|
3521
|
+
}, n && (n.checked = i), F(`区域要素显隐更新失败:${L(t)}`);
|
|
3517
3522
|
}
|
|
3518
3523
|
}
|
|
3519
|
-
function
|
|
3520
|
-
let n = (
|
|
3524
|
+
function ze(e, t) {
|
|
3525
|
+
let n = (Ma()?.manager?.modules?.lanemodulen)?.getLayerGroup?.(e.layerName);
|
|
3521
3526
|
if (!n) return !1;
|
|
3522
3527
|
t && (n.visible = !0);
|
|
3523
|
-
let r = new Set(
|
|
3528
|
+
let r = new Set(De(e));
|
|
3524
3529
|
[ge(e?.featureName), ge(e?.displayName)].filter(Boolean).forEach((e) => r.add(e));
|
|
3525
3530
|
let i = !1;
|
|
3526
3531
|
return n.traverse?.((e) => {
|
|
3527
|
-
|
|
3532
|
+
R(e).some((e) => r.has(e)) && (e.visible = t, i = !0);
|
|
3528
3533
|
}), !i && Array.isArray(n.children) && n.children.forEach((e) => {
|
|
3529
|
-
|
|
3534
|
+
R(e).some((e) => r.has(e)) && (e.visible = t, i = !0);
|
|
3530
3535
|
}), i ||= (n.visible = t, !0), i;
|
|
3531
3536
|
}
|
|
3532
|
-
function
|
|
3533
|
-
let n = t?.target, r = n?.checked === !0, i =
|
|
3534
|
-
|
|
3535
|
-
...
|
|
3537
|
+
function Be(e, t) {
|
|
3538
|
+
let n = t?.target, r = n?.checked === !0, i = P.value[e.key] !== !1;
|
|
3539
|
+
P.value = {
|
|
3540
|
+
...P.value,
|
|
3536
3541
|
[e.key]: r
|
|
3537
3542
|
};
|
|
3538
3543
|
try {
|
|
3539
|
-
if (!
|
|
3540
|
-
|
|
3544
|
+
if (!ze(e, r)) throw Error(`未找到巷道对象: ${e.displayName}`);
|
|
3545
|
+
Ia(), O.value = N.value.some((e) => P.value[e.key] !== !1), F(`巷道显隐已更新:${e.displayName} -> ${r ? "显示" : "隐藏"}`);
|
|
3541
3546
|
} catch (t) {
|
|
3542
|
-
|
|
3543
|
-
...
|
|
3547
|
+
P.value = {
|
|
3548
|
+
...P.value,
|
|
3544
3549
|
[e.key]: i
|
|
3545
|
-
}, n && (n.checked = i),
|
|
3550
|
+
}, n && (n.checked = i), F(`巷道显隐更新失败:${L(t)}`);
|
|
3546
3551
|
}
|
|
3547
3552
|
}
|
|
3548
|
-
function
|
|
3553
|
+
function Ve(e, t) {
|
|
3549
3554
|
if (!Array.isArray(e) || e.length === 0) return 0;
|
|
3550
|
-
let n =
|
|
3555
|
+
let n = Ma()?.manager?.modules?.lanemodulen, r = [...new Set(e.map((e) => typeof e?.layerName == "string" ? e.layerName.trim() : "").filter(Boolean))], i = 0;
|
|
3551
3556
|
r.forEach((e) => {
|
|
3552
3557
|
let r = n?.getLayerGroup?.(e);
|
|
3553
3558
|
r && (r.traverse?.((e) => {
|
|
3554
3559
|
e !== r && (e.visible = t, i += 1);
|
|
3555
3560
|
}), r.visible = !0);
|
|
3556
3561
|
});
|
|
3557
|
-
let a = { ...
|
|
3562
|
+
let a = { ...P.value };
|
|
3558
3563
|
return e.forEach((e) => {
|
|
3559
3564
|
a[e.key] = t;
|
|
3560
|
-
}),
|
|
3565
|
+
}), P.value = a, O.value = t, Ia(), i;
|
|
3561
3566
|
}
|
|
3562
|
-
function
|
|
3563
|
-
if (
|
|
3567
|
+
function He() {
|
|
3568
|
+
if (N.value.length === 0) {
|
|
3564
3569
|
A.value = "当前没有可切换的巷道";
|
|
3565
3570
|
return;
|
|
3566
3571
|
}
|
|
3567
|
-
let e = !O.value, t =
|
|
3568
|
-
A.value = e ? `已显示 ${t} 条巷道` : `已隐藏 ${t} 条巷道`,
|
|
3572
|
+
let e = !O.value, t = Ve(N.value, e);
|
|
3573
|
+
A.value = e ? `已显示 ${t} 条巷道` : `已隐藏 ${t} 条巷道`, F(e ? `已批量显示巷道:${t} 条` : `已批量隐藏巷道:${t} 条`);
|
|
3569
3574
|
}
|
|
3570
|
-
function
|
|
3571
|
-
if (
|
|
3575
|
+
function Ue() {
|
|
3576
|
+
if (de.value.length === 0) {
|
|
3572
3577
|
A.value = "当前没有可切换的区域";
|
|
3573
3578
|
return;
|
|
3574
3579
|
}
|
|
3575
|
-
let e = !D.value, t =
|
|
3576
|
-
A.value = e ? `已显示 ${t} 个区域` : `已隐藏 ${t} 个区域,当前仅保留巷道显示`,
|
|
3580
|
+
let e = !D.value, t = Le(de.value, e);
|
|
3581
|
+
A.value = e ? `已显示 ${t} 个区域` : `已隐藏 ${t} 个区域,当前仅保留巷道显示`, F(e ? `已批量显示区域:${t} 个` : `已批量隐藏区域:${t} 个,保留巷道显示`);
|
|
3577
3582
|
}
|
|
3578
|
-
async function
|
|
3579
|
-
let t =
|
|
3583
|
+
async function We(e) {
|
|
3584
|
+
let t = Io[e] ?? e, n = se.value[e];
|
|
3580
3585
|
if (!n) throw Error(`未找到手动加载类型: ${e}`);
|
|
3581
3586
|
if (n.loading) {
|
|
3582
|
-
|
|
3587
|
+
F(`${t}正在加载,已忽略重复请求`);
|
|
3583
3588
|
return;
|
|
3584
3589
|
}
|
|
3585
3590
|
if (n.loaded) {
|
|
3586
|
-
|
|
3591
|
+
F(`${t}已加载,跳过重复请求`);
|
|
3587
3592
|
return;
|
|
3588
3593
|
}
|
|
3589
|
-
n.loading = !0,
|
|
3594
|
+
n.loading = !0, F(`开始手动加载:${t}`);
|
|
3590
3595
|
try {
|
|
3591
|
-
let t = await
|
|
3592
|
-
n.loaded = t.loaded,
|
|
3596
|
+
let t = await qo(e);
|
|
3597
|
+
n.loaded = t.loaded, F(t.summary);
|
|
3593
3598
|
} finally {
|
|
3594
3599
|
n.loading = !1;
|
|
3595
3600
|
}
|
|
3596
3601
|
}
|
|
3597
|
-
async function
|
|
3598
|
-
if (w.value) return
|
|
3599
|
-
if (T.value && !t) return
|
|
3602
|
+
async function Ge({ trigger: e = "manual", forceReload: t = !1 } = {}) {
|
|
3603
|
+
if (w.value) return F("数据源正在加载,已忽略重复请求"), null;
|
|
3604
|
+
if (T.value && !t) return F("区域要素与巷道已加载,跳过重复请求"), null;
|
|
3600
3605
|
let n = e === "auto" ? "自动" : "手动";
|
|
3601
|
-
w.value = !0,
|
|
3606
|
+
w.value = !0, F(`${n}加载开始:区域要素与巷道`);
|
|
3602
3607
|
try {
|
|
3603
|
-
let e = await
|
|
3604
|
-
return T.value = !0,
|
|
3608
|
+
let e = await Ko();
|
|
3609
|
+
return T.value = !0, Oe(e.regionItems), ke(e.laneItems), Ae(e.lanePathItems), Fe(e.laneItems), je(), D.value = e.regionItems.length > 0, O.value = e.laneItems.length > 0, F(`${n}加载完成:${e.summary}`), e.result;
|
|
3605
3610
|
} finally {
|
|
3606
3611
|
w.value = !1;
|
|
3607
3612
|
}
|
|
3608
3613
|
}
|
|
3609
|
-
async function
|
|
3614
|
+
async function z(e) {
|
|
3610
3615
|
try {
|
|
3611
3616
|
if (e === "resize") {
|
|
3612
|
-
|
|
3617
|
+
Pa(), F("已触发场景 resize");
|
|
3613
3618
|
return;
|
|
3614
3619
|
}
|
|
3615
3620
|
if (e === "editor") {
|
|
3616
|
-
|
|
3621
|
+
F(`editor 可用,当前 selected id: ${Ma()?.selected?.id ?? "none"}`);
|
|
3617
3622
|
return;
|
|
3618
3623
|
}
|
|
3619
3624
|
if (e === "interfaces") {
|
|
3620
|
-
let e =
|
|
3621
|
-
|
|
3625
|
+
let e = Na();
|
|
3626
|
+
F(`interfaces 可用,activingTool 字段存在: ${Object.prototype.hasOwnProperty.call(e, "activingTool")}`);
|
|
3622
3627
|
return;
|
|
3623
3628
|
}
|
|
3624
3629
|
if (e === "refresh") {
|
|
3625
|
-
|
|
3630
|
+
Ia(), F("已触发 sceneGraphChanged 刷新");
|
|
3626
3631
|
return;
|
|
3627
3632
|
}
|
|
3628
3633
|
if (e === "tool") {
|
|
3629
3634
|
let e = S.value.trim();
|
|
3630
3635
|
if (!e) throw Error("请先输入工具名称");
|
|
3631
|
-
await
|
|
3636
|
+
await La(e), F(`activeTool 调用完成: ${e}`);
|
|
3632
3637
|
return;
|
|
3633
3638
|
}
|
|
3634
3639
|
if (e === "datasource") {
|
|
3635
|
-
await
|
|
3640
|
+
await Ge({ trigger: "manual" });
|
|
3636
3641
|
return;
|
|
3637
3642
|
}
|
|
3638
3643
|
if (e === "regionAssist") {
|
|
3639
|
-
await
|
|
3644
|
+
await We("regionAssist");
|
|
3640
3645
|
return;
|
|
3641
3646
|
}
|
|
3642
3647
|
if (e === "coalResvers") {
|
|
3643
|
-
await
|
|
3648
|
+
await We("coalResvers");
|
|
3644
3649
|
return;
|
|
3645
3650
|
}
|
|
3646
3651
|
if (e === "boundary") {
|
|
3647
|
-
await
|
|
3652
|
+
await We("boundary");
|
|
3648
3653
|
return;
|
|
3649
3654
|
}
|
|
3650
3655
|
if (e === "geology") {
|
|
3651
|
-
await
|
|
3656
|
+
await We("geology");
|
|
3652
3657
|
return;
|
|
3653
3658
|
}
|
|
3654
3659
|
if (e === "pointSymbol") {
|
|
3655
|
-
await
|
|
3660
|
+
await We("pointSymbol");
|
|
3656
3661
|
return;
|
|
3657
3662
|
}
|
|
3658
3663
|
if (e === "coal") {
|
|
3659
|
-
await
|
|
3664
|
+
await We("coal");
|
|
3660
3665
|
return;
|
|
3661
3666
|
}
|
|
3662
3667
|
if (e === "geofault") {
|
|
3663
|
-
await
|
|
3668
|
+
await We("geofault");
|
|
3664
3669
|
return;
|
|
3665
3670
|
}
|
|
3666
3671
|
} catch (e) {
|
|
3667
|
-
|
|
3672
|
+
F(`调试失败: ${L(e)}`);
|
|
3668
3673
|
}
|
|
3669
3674
|
}
|
|
3670
|
-
async function
|
|
3675
|
+
async function Ke() {
|
|
3671
3676
|
if (!b.value) {
|
|
3672
|
-
x.value = "error",
|
|
3677
|
+
x.value = "error", F(`场景初始化失败:未找到场景容器 ${g.value}`);
|
|
3673
3678
|
return;
|
|
3674
3679
|
}
|
|
3675
|
-
x.value = "loading",
|
|
3680
|
+
x.value = "loading", F("开始加载龙软 GIS SDK 脚本");
|
|
3676
3681
|
try {
|
|
3677
|
-
x.value = "initializing",
|
|
3678
|
-
let { globalName: e } = await
|
|
3679
|
-
if (ve(),
|
|
3680
|
-
await
|
|
3682
|
+
x.value = "initializing", F("SDK 脚本加载完成,开始创建 EditorApp 实例");
|
|
3683
|
+
let { globalName: e } = await ka(b.value);
|
|
3684
|
+
if (ve(), we(), x.value = "ready", F(`场景初始化成功,检测到全局对象:${e}`), me.value) try {
|
|
3685
|
+
await Ge({ trigger: "auto" });
|
|
3681
3686
|
} catch (e) {
|
|
3682
|
-
|
|
3687
|
+
F(`场景初始化成功,自动加载失败:${L(e)}`);
|
|
3683
3688
|
}
|
|
3684
|
-
else
|
|
3689
|
+
else F("场景初始化成功,未开启自动云数据加载");
|
|
3685
3690
|
} catch (e) {
|
|
3686
|
-
x.value = "error",
|
|
3691
|
+
x.value = "error", F(`场景初始化失败:${L(e)}`), Oe([]), ke([]), Ae([]), Oa(b.value);
|
|
3687
3692
|
}
|
|
3688
3693
|
}
|
|
3689
3694
|
return u(() => {
|
|
3690
|
-
|
|
3695
|
+
Ke();
|
|
3691
3696
|
}), d(() => {
|
|
3692
|
-
ae.value?.(),
|
|
3697
|
+
ae.value?.(), je(), Oe([]), ke([]), Ae([]), Oa(b.value);
|
|
3693
3698
|
}), o({
|
|
3694
|
-
moveView:
|
|
3695
|
-
registerModelInfoQuery:
|
|
3696
|
-
}), (t, n) => (f(), i("section",
|
|
3699
|
+
moveView: Pe,
|
|
3700
|
+
registerModelInfoQuery: Ee
|
|
3701
|
+
}), (t, n) => (f(), i("section", Jo, [a("div", { class: c(["lr3d-viewer__stage", { "lr3d-viewer__stage--with-debug": s.showDebugPanel }]) }, [a("div", Yo, [
|
|
3697
3702
|
a("div", {
|
|
3698
3703
|
id: g.value,
|
|
3699
3704
|
ref_key: "viewerHost",
|
|
3700
3705
|
ref: b,
|
|
3701
3706
|
class: "lr3d-viewer__host"
|
|
3702
|
-
}, null, 8,
|
|
3707
|
+
}, null, 8, Xo),
|
|
3703
3708
|
s.showRegionPanel && x.value === "ready" ? (f(), i("aside", {
|
|
3704
3709
|
key: 0,
|
|
3705
3710
|
class: c(["lr3d-workface-panel", { "lr3d-workface-panel--expanded": E.value }])
|
|
3706
|
-
}, [a("div",
|
|
3711
|
+
}, [a("div", Zo, [n[15] ||= a("h3", { class: "lr3d-workface-panel__title" }, "图层控制", -1), a("button", {
|
|
3707
3712
|
type: "button",
|
|
3708
3713
|
class: "lr3d-workface-panel__toggle",
|
|
3709
3714
|
onClick: n[0] ||= (e) => E.value = !E.value
|
|
3710
|
-
}, h(E.value ? "收起" : "展开"), 1)]), E.value ? (f(), i("div",
|
|
3711
|
-
a("p",
|
|
3712
|
-
a("div",
|
|
3715
|
+
}, h(E.value ? "收起" : "展开"), 1)]), E.value ? (f(), i("div", Qo, [
|
|
3716
|
+
a("p", $o, " 当前区域要素数量:" + h(de.value.length) + ",巷道数量:" + h(N.value.length), 1),
|
|
3717
|
+
a("div", es, [a("button", {
|
|
3713
3718
|
type: "button",
|
|
3714
3719
|
class: "lr3d-workface-panel__action lr3d-workface-panel__action--secondary",
|
|
3715
|
-
onClick:
|
|
3720
|
+
onClick: Ue
|
|
3716
3721
|
}, h(D.value ? "隐藏区域" : "显示区域"), 1), a("button", {
|
|
3717
3722
|
type: "button",
|
|
3718
3723
|
class: "lr3d-workface-panel__action lr3d-workface-panel__action--secondary",
|
|
3719
|
-
onClick:
|
|
3724
|
+
onClick: He
|
|
3720
3725
|
}, h(O.value ? "隐藏巷道" : "显示巷道"), 1)]),
|
|
3721
|
-
a("p",
|
|
3722
|
-
|
|
3726
|
+
a("p", ts, h(A.value), 1),
|
|
3727
|
+
pe.value ? (f(), i("div", rs, [(f(!0), i(e, null, m(fe.value, (t) => (f(), i("section", {
|
|
3723
3728
|
key: t.featureType,
|
|
3724
3729
|
class: "lr3d-workface-panel__group"
|
|
3725
|
-
}, [a("h4",
|
|
3730
|
+
}, [a("h4", is, h(t.typeLabel) + "(" + h(t.items.length) + ") ", 1), a("ul", as, [(f(!0), i(e, null, m(t.items, (e) => (f(), i("li", {
|
|
3726
3731
|
key: e.key,
|
|
3727
3732
|
class: "lr3d-workface-panel__item"
|
|
3728
|
-
}, [a("label",
|
|
3733
|
+
}, [a("label", os, [a("input", {
|
|
3729
3734
|
type: "checkbox",
|
|
3730
|
-
checked:
|
|
3731
|
-
onChange: (t) =>
|
|
3732
|
-
}, null, 40,
|
|
3735
|
+
checked: M.value[e.key] !== !1,
|
|
3736
|
+
onChange: (t) => Re(e, t)
|
|
3737
|
+
}, null, 40, ss), a("span", null, h(e.displayName), 1)])]))), 128))])]))), 128)), N.value.length > 0 ? (f(), i("section", cs, [a("h4", ls, " 巷道(" + h(N.value.length) + ") ", 1), a("ul", us, [(f(!0), i(e, null, m(N.value, (e) => (f(), i("li", {
|
|
3733
3738
|
key: e.key,
|
|
3734
3739
|
class: "lr3d-workface-panel__item"
|
|
3735
|
-
}, [a("label",
|
|
3740
|
+
}, [a("label", ds, [a("input", {
|
|
3736
3741
|
type: "checkbox",
|
|
3737
|
-
checked:
|
|
3738
|
-
onChange: (t) =>
|
|
3739
|
-
}, null, 40,
|
|
3742
|
+
checked: P.value[e.key] !== !1,
|
|
3743
|
+
onChange: (t) => Be(e, t)
|
|
3744
|
+
}, null, 40, fs), a("span", null, h(e.displayName), 1)])]))), 128))])])) : r("", !0)])) : (f(), i("div", ns, " 暂无可控制的区域要素或巷道 "))
|
|
3740
3745
|
])) : r("", !0)], 2)) : r("", !0),
|
|
3741
|
-
x.value === "idle" || x.value === "loading" ? (f(), i("div",
|
|
3742
|
-
x.value === "error" ? (f(), i("div",
|
|
3743
|
-
]), s.showDebugPanel ? (f(), i("section",
|
|
3746
|
+
x.value === "idle" || x.value === "loading" ? (f(), i("div", ps, [...n[16] ||= [a("p", null, "正在准备三维场景", -1), a("small", null, "SDK 脚本加载完成后会在当前容器内创建最小场景实例", -1)]])) : r("", !0),
|
|
3747
|
+
x.value === "error" ? (f(), i("div", ms, [...n[17] ||= [a("p", null, "最小初始化未完成", -1), a("small", null, "请根据状态信息检查 SDK 依赖或资源路径", -1)]])) : r("", !0)
|
|
3748
|
+
]), s.showDebugPanel ? (f(), i("section", hs, [
|
|
3744
3749
|
n[19] ||= a("div", { class: "lr3d-debug-panel__header" }, [a("h2", null, "基础调试面板"), a("p", null, "用于验证基础 API 是否可调用")], -1),
|
|
3745
|
-
a("div",
|
|
3750
|
+
a("div", gs, [
|
|
3746
3751
|
a("button", {
|
|
3747
3752
|
type: "button",
|
|
3748
|
-
onClick: n[1] ||= (e) =>
|
|
3753
|
+
onClick: n[1] ||= (e) => z("resize")
|
|
3749
3754
|
}, "Resize 场景"),
|
|
3750
3755
|
a("button", {
|
|
3751
3756
|
type: "button",
|
|
3752
|
-
onClick: n[2] ||= (e) =>
|
|
3757
|
+
onClick: n[2] ||= (e) => z("refresh")
|
|
3753
3758
|
}, "测试刷新(sceneGraphChanged)"),
|
|
3754
3759
|
a("button", {
|
|
3755
3760
|
type: "button",
|
|
3756
|
-
onClick: n[3] ||= (e) =>
|
|
3761
|
+
onClick: n[3] ||= (e) => z("editor")
|
|
3757
3762
|
}, "检查 editor"),
|
|
3758
3763
|
a("button", {
|
|
3759
3764
|
type: "button",
|
|
3760
|
-
onClick: n[4] ||= (e) =>
|
|
3765
|
+
onClick: n[4] ||= (e) => z("interfaces")
|
|
3761
3766
|
}, "检查 interfaces"),
|
|
3762
3767
|
a("button", {
|
|
3763
3768
|
type: "button",
|
|
3764
|
-
onClick: n[5] ||= (e) =>
|
|
3769
|
+
onClick: n[5] ||= (e) => z("datasource")
|
|
3765
3770
|
}, "手动重试加载区域+巷道")
|
|
3766
3771
|
]),
|
|
3767
3772
|
n[20] ||= a("div", { class: "lr3d-debug-panel__header" }, [a("h2", null, "手动加载其他类型"), a("p", null, "默认不自动加载,按按钮逐项触发")], -1),
|
|
3768
|
-
a("div",
|
|
3773
|
+
a("div", _s, [
|
|
3769
3774
|
a("button", {
|
|
3770
3775
|
type: "button",
|
|
3771
|
-
disabled:
|
|
3772
|
-
onClick: n[6] ||= (e) =>
|
|
3773
|
-
}, " 加载掘进辅助 ", 8,
|
|
3776
|
+
disabled: se.value.regionAssist.loading,
|
|
3777
|
+
onClick: n[6] ||= (e) => z("regionAssist")
|
|
3778
|
+
}, " 加载掘进辅助 ", 8, vs),
|
|
3774
3779
|
a("button", {
|
|
3775
3780
|
type: "button",
|
|
3776
|
-
disabled:
|
|
3777
|
-
onClick: n[7] ||= (e) =>
|
|
3778
|
-
}, " 加载储量块段 ", 8,
|
|
3781
|
+
disabled: se.value.coalResvers.loading,
|
|
3782
|
+
onClick: n[7] ||= (e) => z("coalResvers")
|
|
3783
|
+
}, " 加载储量块段 ", 8, ys),
|
|
3779
3784
|
a("button", {
|
|
3780
3785
|
type: "button",
|
|
3781
|
-
disabled:
|
|
3782
|
-
onClick: n[8] ||= (e) =>
|
|
3783
|
-
}, " 加载矿井边界 ", 8,
|
|
3786
|
+
disabled: se.value.boundary.loading,
|
|
3787
|
+
onClick: n[8] ||= (e) => z("boundary")
|
|
3788
|
+
}, " 加载矿井边界 ", 8, bs),
|
|
3784
3789
|
a("button", {
|
|
3785
3790
|
type: "button",
|
|
3786
|
-
disabled:
|
|
3787
|
-
onClick: n[9] ||= (e) =>
|
|
3788
|
-
}, " 加载地质体 ", 8,
|
|
3791
|
+
disabled: se.value.geology.loading,
|
|
3792
|
+
onClick: n[9] ||= (e) => z("geology")
|
|
3793
|
+
}, " 加载地质体 ", 8, xs),
|
|
3789
3794
|
a("button", {
|
|
3790
3795
|
type: "button",
|
|
3791
|
-
disabled:
|
|
3792
|
-
onClick: n[10] ||= (e) =>
|
|
3793
|
-
}, " 加载点符号 ", 8,
|
|
3796
|
+
disabled: se.value.pointSymbol.loading,
|
|
3797
|
+
onClick: n[10] ||= (e) => z("pointSymbol")
|
|
3798
|
+
}, " 加载点符号 ", 8, Ss),
|
|
3794
3799
|
a("button", {
|
|
3795
3800
|
type: "button",
|
|
3796
|
-
disabled:
|
|
3797
|
-
onClick: n[11] ||= (e) =>
|
|
3798
|
-
}, " 加载煤层 ", 8,
|
|
3801
|
+
disabled: se.value.coal.loading,
|
|
3802
|
+
onClick: n[11] ||= (e) => z("coal")
|
|
3803
|
+
}, " 加载煤层 ", 8, Cs),
|
|
3799
3804
|
a("button", {
|
|
3800
3805
|
type: "button",
|
|
3801
|
-
disabled:
|
|
3802
|
-
onClick: n[12] ||= (e) =>
|
|
3803
|
-
}, " 加载断层 ", 8,
|
|
3806
|
+
disabled: se.value.geofault.loading,
|
|
3807
|
+
onClick: n[12] ||= (e) => z("geofault")
|
|
3808
|
+
}, " 加载断层 ", 8, ws)
|
|
3804
3809
|
]),
|
|
3805
|
-
a("div",
|
|
3810
|
+
a("div", Ts, [
|
|
3806
3811
|
n[18] ||= a("label", { for: "lr3d-tool-input" }, "activeTool 名称", -1),
|
|
3807
3812
|
y(a("input", {
|
|
3808
3813
|
id: "lr3d-tool-input",
|
|
@@ -3812,13 +3817,13 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3812
3817
|
}, null, 512), [[_, S.value]]),
|
|
3813
3818
|
a("button", {
|
|
3814
3819
|
type: "button",
|
|
3815
|
-
onClick: n[14] ||= (e) =>
|
|
3820
|
+
onClick: n[14] ||= (e) => z("tool")
|
|
3816
3821
|
}, "执行 activeTool")
|
|
3817
3822
|
]),
|
|
3818
|
-
a("pre",
|
|
3823
|
+
a("pre", Es, h(C.value), 1)
|
|
3819
3824
|
])) : r("", !0)], 2)]));
|
|
3820
3825
|
}
|
|
3821
|
-
}, [["__scopeId", "data-v-4ea74269"]]),
|
|
3826
|
+
}, [["__scopeId", "data-v-4ea74269"]]), ks = { class: "lr-map-viewer" }, As = { class: "lr-map-viewer__stack" }, js = /* @__PURE__ */ jo({
|
|
3822
3827
|
__name: "LrMapViewer",
|
|
3823
3828
|
props: {
|
|
3824
3829
|
mode: {
|
|
@@ -3848,7 +3853,7 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3848
3853
|
},
|
|
3849
3854
|
emits: ["mode-change"],
|
|
3850
3855
|
setup(e, { expose: n, emit: u }) {
|
|
3851
|
-
let d = e, m = u, h = p(
|
|
3856
|
+
let d = e, m = u, h = p(ko(d.mode, d.modes)), g = p(null), _ = p(null), y = t(() => Oo(d.modes)), b = t(() => y.value.includes("2d")), x = t(() => y.value.includes("3d")), S = t(() => j(d.map2dConfig)), C = t(() => Te(d.lr3dConfig));
|
|
3852
3857
|
function w(e, t) {
|
|
3853
3858
|
m("mode-change", {
|
|
3854
3859
|
mode: e,
|
|
@@ -3864,13 +3869,13 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3864
3869
|
}
|
|
3865
3870
|
async function E(e) {
|
|
3866
3871
|
if (await s(), e === "2d") {
|
|
3867
|
-
|
|
3872
|
+
ue();
|
|
3868
3873
|
return;
|
|
3869
3874
|
}
|
|
3870
|
-
e === "3d" &&
|
|
3875
|
+
e === "3d" && Ea() && Pa();
|
|
3871
3876
|
}
|
|
3872
3877
|
function D(e) {
|
|
3873
|
-
let t =
|
|
3878
|
+
let t = ko(e, y.value);
|
|
3874
3879
|
if (t === h.value) return h.value;
|
|
3875
3880
|
let n = h.value;
|
|
3876
3881
|
return h.value = t, w(t, n), t;
|
|
@@ -3879,19 +3884,19 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3879
3884
|
return h.value;
|
|
3880
3885
|
}
|
|
3881
3886
|
function k() {
|
|
3882
|
-
return
|
|
3887
|
+
return P();
|
|
3883
3888
|
}
|
|
3884
3889
|
function ee() {
|
|
3885
|
-
return
|
|
3890
|
+
return Ea();
|
|
3886
3891
|
}
|
|
3887
3892
|
function te() {
|
|
3888
3893
|
return h.value === "2d" ? k() : ee();
|
|
3889
3894
|
}
|
|
3890
3895
|
function A() {
|
|
3891
|
-
return h.value === "2d" ?
|
|
3896
|
+
return h.value === "2d" ? ue() : Ea() ? (Pa(), !0) : !1;
|
|
3892
3897
|
}
|
|
3893
3898
|
function ne() {
|
|
3894
|
-
return h.value !== "3d" || !
|
|
3899
|
+
return h.value !== "3d" || !Ea() ? !1 : (Ia(), !0);
|
|
3895
3900
|
}
|
|
3896
3901
|
function re(e, t, n) {
|
|
3897
3902
|
return !g.value || typeof g.value.moveView != "function" ? !1 : g.value.moveView(e, t, n);
|
|
@@ -3901,7 +3906,7 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3901
3906
|
return _.value = typeof e == "function" ? e : null, g.value && typeof g.value.registerModelInfoQuery == "function" ? g.value.registerModelInfoQuery(_.value) : !1;
|
|
3902
3907
|
}
|
|
3903
3908
|
return v(() => [d.mode, d.modes], ([e, t]) => {
|
|
3904
|
-
let n =
|
|
3909
|
+
let n = ko(e, t);
|
|
3905
3910
|
if (n === h.value) return;
|
|
3906
3911
|
let r = h.value;
|
|
3907
3912
|
h.value = n, w(n, r);
|
|
@@ -3910,7 +3915,7 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3910
3915
|
}, { immediate: !0 }), v(g, (e) => {
|
|
3911
3916
|
e && typeof e.registerModelInfoQuery == "function" && _.value && e.registerModelInfoQuery(_.value);
|
|
3912
3917
|
}, { immediate: !0 }), l(() => {
|
|
3913
|
-
|
|
3918
|
+
le(), Oa();
|
|
3914
3919
|
}), n({
|
|
3915
3920
|
switchMode: D,
|
|
3916
3921
|
getCurrentMode: O,
|
|
@@ -3921,13 +3926,13 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3921
3926
|
refreshScene: ne,
|
|
3922
3927
|
moveView: re,
|
|
3923
3928
|
registerModelInfoQuery: ie
|
|
3924
|
-
}), (t, n) => (f(), i("section",
|
|
3929
|
+
}), (t, n) => (f(), i("section", ks, [a("div", As, [b.value ? (f(), i("div", {
|
|
3925
3930
|
key: 0,
|
|
3926
3931
|
class: c(["lr-map-viewer__layer", T("2d")])
|
|
3927
|
-
}, [o(
|
|
3932
|
+
}, [o(Fo, { config: S.value }, null, 8, ["config"])], 2)) : r("", !0), x.value ? (f(), i("div", {
|
|
3928
3933
|
key: 1,
|
|
3929
3934
|
class: c(["lr-map-viewer__layer", T("3d")])
|
|
3930
|
-
}, [o(
|
|
3935
|
+
}, [o(Os, {
|
|
3931
3936
|
ref_key: "lr3dViewerRef",
|
|
3932
3937
|
ref: g,
|
|
3933
3938
|
config: C.value,
|
|
@@ -3939,10 +3944,10 @@ var qo = { class: "lr3d-viewer" }, Jo = { class: "lr3d-viewer__canvas" }, Yo = [
|
|
|
3939
3944
|
"show-debug-panel"
|
|
3940
3945
|
])], 2)) : r("", !0)])]));
|
|
3941
3946
|
}
|
|
3942
|
-
}, [["__scopeId", "data-v-bb4c5174"]]),
|
|
3943
|
-
function
|
|
3944
|
-
!e || typeof e.component != "function" || e.component(
|
|
3947
|
+
}, [["__scopeId", "data-v-bb4c5174"]]), Ms = "LrMapViewer";
|
|
3948
|
+
function Ns(e) {
|
|
3949
|
+
!e || typeof e.component != "function" || e.component(Ms, js);
|
|
3945
3950
|
}
|
|
3946
|
-
var
|
|
3951
|
+
var Ps = { install: Ns };
|
|
3947
3952
|
//#endregion
|
|
3948
|
-
export {
|
|
3953
|
+
export { Fo as Lr2dViewer, Os as Lr3dViewer, js as LrMapViewer, Ao as canSwitchMapMode, N as createLr2dAdapter, ka as createLr3dInstance, Ps as default, le as destroyLr2dAdapter, Oa as destroyLr3dInstance, A as getDefaultLr2dConfig, ve as getDefaultLr3dConfig, P as getLr2dAdapterInstance, ne as getLr2dConfig, re as getLr2dMapOptions, ja as getLr3dApp, R as getLr3dConfig, Ma as getLr3dEditor, Sa as getLr3dGlobal, Ea as getLr3dInstance, Na as getLr3dInterfaces, k as getMissingLr2dOptionFields, O as getRequiredLr2dOptionFields, Eo as getSupportedMapModes, Io as gisManualLoadLabels, Ns as install, ee as isLr2dConfigReady, Ko as loadGisCloudDataSource, qo as loadGisManualData, yo as loadLr3dBoundaryData, go as loadLr3dCloudDataSource, So as loadLr3dCoalData, vo as loadLr3dCoalResversData, Co as loadLr3dGeoFaultData, bo as loadLr3dGeologyData, xo as loadLr3dPointSymbolData, _o as loadLr3dRegionAssistData, Ca as loadLr3dSdk, Do as normalizeMapMode, Ia as refreshLr3dSceneGraph, ae as resetLr2dConfig, we as resetLr3dConfig, ue as resizeLr2dAdapter, Pa as resizeLr3d, Da as resizeLr3dInstance, ko as resolveInitialMapMode, j as resolveLr2dConfig, Te as resolveLr3dConfig, Oo as resolveMapModes, La as runLr3dTool, ie as setLr2dConfig, Ce as setLr3dConfig };
|