hlrender 0.0.83 → 0.0.85
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/{affix-widget-3f5672c3.js → affix-widget-8d450f63.js} +9 -9
- package/{alert-widget-0f6b36c1.js → alert-widget-f381467c.js} +9 -9
- package/{anchor-widget-74c8f73f.js → anchor-widget-59c13b56.js} +6 -6
- package/{auto-complete-widget-4ce3e381.js → auto-complete-widget-5daaf057.js} +8 -8
- package/{avatar-widget-eb4d9e3f.js → avatar-widget-1a7302dc.js} +9 -9
- package/{backtop-widget-ffb60a75.js → backtop-widget-80517c94.js} +9 -9
- package/{badge-widget-c8770497.js → badge-widget-049c8b8e.js} +9 -9
- package/{baseImp-11bc4ced.js → baseImp-7dec7b0d.js} +939 -934
- package/{breadcrumb-widget-e78de93e.js → breadcrumb-widget-b5d64577.js} +6 -6
- package/{button-widget-e44e1a8b.js → button-widget-3c83e630.js} +9 -9
- package/{cache-widget-ad5ab47e.js → cache-widget-85cbe183.js} +7 -7
- package/{card-widget-a00c43d8.js → card-widget-33594eec.js} +7 -7
- package/{carousel-widget-d142cc6d.js → carousel-widget-942f3177.js} +6 -6
- package/{cascader-widget-5592fb87.js → cascader-widget-e8221f79.js} +7 -7
- package/{chart-widget-93a8978e.js → chart-widget-831d0ecc.js} +6 -6
- package/{checkbox-widget-dd4135c2.js → checkbox-widget-a389c6c2.js} +7 -7
- package/{collapse-widget-14bb8869.js → collapse-widget-4b25d54d.js} +6 -6
- package/{color-picker-widget-9e01df72.js → color-picker-widget-a0e4dc01.js} +7 -7
- package/{cont-cell-widget-4fb0d397.js → cont-cell-widget-d9e9f2b2.js} +1 -1
- package/{cont-cell-widget.vue_vue_type_script_setup_true_name_cont-cell-widget_lang-b811311f.js → cont-cell-widget.vue_vue_type_script_setup_true_name_cont-cell-widget_lang-5631c230.js} +4 -4
- package/{cont-widget-2c8ce264.js → cont-widget-d8aa0215.js} +4 -4
- package/{content-wrapper-98e04e12.js → content-wrapper-f399ad7f.js} +2 -2
- package/{content-wrapper.vue_vue_type_script_setup_true_lang-e3422c7b.js → content-wrapper.vue_vue_type_script_setup_true_lang-68b00192.js} +1 -1
- package/{date-picker-range-widget-f51b8cf0.js → date-picker-range-widget-849c6a77.js} +7 -7
- package/{date-picker-widget-c1bf9d37.js → date-picker-widget-d1c4003e.js} +7 -7
- package/{default-slot-widget-5e099ef9.js → default-slot-widget-8fe68bf4.js} +7 -7
- package/{default-slot-widget.vue_vue_type_script_setup_true_name_default-slot-widget_lang-a5732bc4.js → default-slot-widget.vue_vue_type_script_setup_true_name_default-slot-widget_lang-9fce132b.js} +4 -4
- package/{descriptions-widget-e4224e81.js → descriptions-widget-ff38d263.js} +7 -7
- package/{dialog-widget-4556ca58.js → dialog-widget-653dea28.js} +8 -8
- package/{divider-widget-0887a5b2.js → divider-widget-099a446c.js} +9 -9
- package/{drag-wrapper-b922da1e.js → drag-wrapper-03c58f87.js} +4 -4
- package/{drawer-widget-23d137e0.js → drawer-widget-8a8be719.js} +8 -8
- package/{dropdown-widget-1942c56e.js → dropdown-widget-d6fba833.js} +7 -7
- package/{empty-widget-924e34d6.js → empty-widget-c5414121.js} +9 -9
- package/{feedback-widget-04d3e2db.js → feedback-widget-b356fa90.js} +8 -8
- package/{feedback-widget.vue_vue_type_script_setup_true_name_feedback-widget_lang-827b3e04.js → feedback-widget.vue_vue_type_script_setup_true_name_feedback-widget_lang-834393f6.js} +4 -4
- package/{file-upload-widget-f4531e69.js → file-upload-widget-933c7ca0.js} +8 -8
- package/{form-item-wrapper-c00a3cb3.js → form-item-wrapper-9439f4d0.js} +3 -3
- package/form-widget-53d1ff43.js +219 -0
- package/{grid-col-widget-9d6ebef7.js → grid-col-widget-6aeaf21e.js} +1 -1
- package/{grid-col-widget.vue_vue_type_script_setup_true_name_grid-col-widget_lang-2f9cf439.js → grid-col-widget.vue_vue_type_script_setup_true_name_grid-col-widget_lang-24f04c67.js} +4 -4
- package/{grid-widget-1cb5cf17.js → grid-widget-9ce937dd.js} +4 -4
- package/{html-text-widget-c51e5c09.js → html-text-widget-fb549efe.js} +7 -7
- package/{iframe-widget-4345b288.js → iframe-widget-48b8224f.js} +6 -6
- package/{image-widget-1da3b1e5.js → image-widget-59278a92.js} +6 -6
- package/{index-39e7f591.js → index-9219e73c.js} +29 -1
- package/{input-number-widget-a4fab64e.js → input-number-widget-66e783be.js} +7 -7
- package/{input-widget-fcc93050.js → input-widget-5d613bbd.js} +8 -8
- package/{link-widget-f38119c8.js → link-widget-75477c60.js} +9 -9
- package/{ltable-col-widget-da8fa342.js → ltable-col-widget-9887499f.js} +1 -1
- package/{ltable-col-widget.vue_vue_type_script_setup_true_name_ltable-col-widget_lang-962a9439.js → ltable-col-widget.vue_vue_type_script_setup_true_name_ltable-col-widget_lang-152a1478.js} +6 -6
- package/ltable-widget-8dfd7a0c.js +77 -0
- package/{menu-widget-5373be8d.js → menu-widget-d764bcd6.js} +7 -7
- package/{model-widget-d6c76e97.js → model-widget-1a192b55.js} +6 -6
- package/{multirow-0bdbfe67.js → multirow-ba01fb1b.js} +3 -3
- package/{multirow-widget-475d34b9.js → multirow-widget-bdf558d6.js} +7 -7
- package/package.json +1 -1
- package/{pagination-widget-8df18178.js → pagination-widget-b17a40e0.js} +6 -6
- package/{picture-upload-widget-fa5b59d6.js → picture-upload-widget-abfff928.js} +8 -8
- package/{progress-widget-cac6ef65.js → progress-widget-91d9d948.js} +7 -7
- package/{radio-widget-7b91026e.js → radio-widget-0faf6dd2.js} +7 -7
- package/{range-widget-a5ecaa9d.js → range-widget-7275c1cd.js} +8 -8
- package/{rate-widget-bda46935.js → rate-widget-bff39302.js} +7 -7
- package/render.es.js +23 -23
- package/render.style.css +1 -1
- package/render.umd.js +449 -449
- package/{result-widget-d9dae014.js → result-widget-13282818.js} +7 -7
- package/{rich-editor-widget-e1b757f1.js → rich-editor-widget-106f5e89.js} +7 -7
- package/{router-widget-7cda8886.js → router-widget-1e3bb9cf.js} +6 -6
- package/{select-widget-5466157a.js → select-widget-59e532f4.js} +7 -7
- package/{sfc-2e1ef01d.js → sfc-97dc4b34.js} +3 -3
- package/share-field-4ae4070a.js +775 -0
- package/{share-file-8bb5ce3d.js → share-file-96559250.js} +2 -2
- package/{slider-widget-da230209.js → slider-widget-10c3588a.js} +7 -7
- package/{slot-1cfdfc83.js → slot-47652b09.js} +1 -1
- package/{static-text-widget-2dd9386c.js → static-text-widget-ada658ae.js} +7 -7
- package/{steps-widget-96f5fff1.js → steps-widget-ce62972e.js} +6 -6
- package/{subMenu-widget-b13ffc1c.js → subMenu-widget-043bf454.js} +2 -2
- package/{subMenu-widget.vue_vue_type_script_setup_true_lang-3bc10707.js → subMenu-widget.vue_vue_type_script_setup_true_lang-82b80fdb.js} +1 -1
- package/{switch-widget-c7445cae.js → switch-widget-7673f698.js} +7 -7
- package/{tab-pane-widget-c9e7fa16.js → tab-pane-widget-7297d672.js} +1 -1
- package/{tab-pane-widget.vue_vue_type_script_setup_true_name_tab-pane-widget_lang-ed43b214.js → tab-pane-widget.vue_vue_type_script_setup_true_name_tab-pane-widget_lang-c3d384ea.js} +4 -4
- package/{table-col-widget-8534bfb0.js → table-col-widget-b6986869.js} +7 -7
- package/table-col-widget.vue_vue_type_script_setup_true_name_table-col-widget_lang-57aaf42b.js +80 -0
- package/{table-widget-7f29d416.js → table-widget-12275489.js} +42 -42
- package/tabs-widget-dea7bc88.js +82 -0
- package/{tag-widget-5f778906.js → tag-widget-e1a13638.js} +9 -9
- package/{text-widget-370530e6.js → text-widget-a27b749f.js} +9 -9
- package/{textarea-widget-74dd6d9e.js → textarea-widget-de9299e8.js} +7 -7
- package/{time-picker-range-widget-bbadfa95.js → time-picker-range-widget-f474889f.js} +7 -7
- package/{time-picker-widget-e38d87ce.js → time-picker-widget-da85aae8.js} +7 -7
- package/{time-select-widget-7afa99b2.js → time-select-widget-b9453d1e.js} +7 -7
- package/tmpl-widget-4be1e5c0.js +95 -0
- package/{tree-select-widget-62ebe4a4.js → tree-select-widget-40bad1ae.js} +7 -7
- package/{tree-widget-e261627b.js → tree-widget-62a10a62.js} +6 -6
- package/{widget-wrapper.vue_vue_type_script_setup_true_name_form-item-wrapper_lang-d0148992.js → widget-wrapper.vue_vue_type_script_setup_true_name_form-item-wrapper_lang-ca115d68.js} +2 -2
- package/wrapper-widget-b0f5b71f.js +84 -0
- package/form-widget-aa9932f4.js +0 -216
- package/ltable-widget-2e1017ae.js +0 -69
- package/share-field-d01750c9.js +0 -763
- package/table-col-widget.vue_vue_type_script_setup_true_name_table-col-widget_lang-fb1fc229.js +0 -80
- package/tabs-widget-b56973bc.js +0 -76
- package/tmpl-widget-043c95bc.js +0 -92
- package/wrapper-widget-a7fa3824.js +0 -77
|
@@ -1,16 +1,16 @@
|
|
|
1
1
|
var ra = Object.defineProperty;
|
|
2
2
|
var na = (t, e, r) => e in t ? ra(t, e, { enumerable: !0, configurable: !0, writable: !0, value: r }) : t[e] = r;
|
|
3
3
|
var j = (t, e, r) => (na(t, typeof e != "symbol" ? e + "" : e, r), r);
|
|
4
|
-
import { b as G0, c as Cn, e as
|
|
5
|
-
import { u as si, t as
|
|
6
|
-
import { O as ga, C as X, E as xt, a as Ea, b as en, V as i0, F as
|
|
4
|
+
import { b as G0, c as Cn, e as I0, t as M0, f as Q0, h as _r, j as Rt, o as Pt, k as ei, d as ht, B as xe, l as Ht, m as Sr, s as sa, a as B0, n as E0, p as ia, q as oa, r as aa, u as ca, v as xa, w as fa, x as ft, y as W0, z as ua, A as _t, C as ri, D as la, E as ha, F as ni, G as da, H as pa } from "./enum-type-83a1c63e.js";
|
|
5
|
+
import { u as si, t as pe, a as va, c as u0, g as Ba } from "./uuid-85671611.js";
|
|
6
|
+
import { O as ga, C as X, E as xt, a as Ea, b as en, V as i0, F as Ut, P as rn, c as ya, d as nn, S as ma, D as ii, e as ba } from "./enum-type-966ff1e0.js";
|
|
7
7
|
import { u as sn, r as Aa, a as oi } from "./icon-e9532b43.js";
|
|
8
8
|
import * as Fa from "vue";
|
|
9
|
-
import { isRef as
|
|
10
|
-
import { c as Te, I as ai, e as wa, d as
|
|
9
|
+
import { isRef as $t, defineAsyncComponent as Ca, h as Gn, watch as Me, computed as R0, ref as Et, reactive as on, shallowRef as Da } from "vue";
|
|
10
|
+
import { c as Te, I as ai, e as wa, d as St, g as rt, f as tt, h as _a, u as Sa, j as Ta } from "./expression-a789517c.js";
|
|
11
11
|
import { o as Ra } from "./dialog-610eab4e.js";
|
|
12
12
|
import { c as s0, g as ka } from "./_commonjsHelpers-e7ea1525.js";
|
|
13
|
-
import { ElMessage as
|
|
13
|
+
import { ElMessage as fe, ElMessageBox as ci, ElNotification as ue } from "element-plus";
|
|
14
14
|
const je = "#";
|
|
15
15
|
function Oa() {
|
|
16
16
|
return {
|
|
@@ -44,14 +44,14 @@ function Dn() {
|
|
|
44
44
|
return Cn(d) && (d != null && d[v]) ? d == null ? void 0 : d[v] : v;
|
|
45
45
|
}) : x, s = (x, d) => G0(x) ? x == null ? void 0 : x.replace(e, function(h, v) {
|
|
46
46
|
var f = v, l = d[f];
|
|
47
|
-
return
|
|
47
|
+
return I0(l) ? t(" ") : t(l);
|
|
48
48
|
}) : x, i = (x, d) => G0(x) ? x == null ? void 0 : x.replaceAll(e, function(h, v) {
|
|
49
49
|
var f = v, l = d[f];
|
|
50
|
-
return !
|
|
50
|
+
return !Rt(f) && !Rt(l) ? r(l) : h;
|
|
51
51
|
}) : x, o = (x, d, h, v = e) => G0(x) ? x == null ? void 0 : x.replaceAll(v, function(f, l) {
|
|
52
52
|
var g;
|
|
53
|
-
var
|
|
54
|
-
return
|
|
53
|
+
var y = l, A = (g = Pt(d)) != null && g.includes(y) ? d == null ? void 0 : d[y] : null;
|
|
54
|
+
return Rt(y) ? f : h ? h(y, A) : Rt(A) ? null : A;
|
|
55
55
|
}) : x;
|
|
56
56
|
return {
|
|
57
57
|
transFormula: n,
|
|
@@ -64,7 +64,7 @@ function Dn() {
|
|
|
64
64
|
return h;
|
|
65
65
|
},
|
|
66
66
|
updateFomulaName: (x, d, h) => {
|
|
67
|
-
if (
|
|
67
|
+
if (I0(x))
|
|
68
68
|
return x;
|
|
69
69
|
let v = M0(x);
|
|
70
70
|
return v != null && v.includes(d) ? (v = i(v, { [d]: h }), Q0(v)) : x;
|
|
@@ -99,7 +99,7 @@ class yt {
|
|
|
99
99
|
class Jl extends yt {
|
|
100
100
|
constructor(r) {
|
|
101
101
|
super(r);
|
|
102
|
-
j(this, "type",
|
|
102
|
+
j(this, "type", xe.any);
|
|
103
103
|
r && ht(this, r);
|
|
104
104
|
}
|
|
105
105
|
}
|
|
@@ -126,7 +126,7 @@ const Na = (t) => t ? xi.test(t) : !1, La = (t) => {
|
|
|
126
126
|
try {
|
|
127
127
|
return new Function(e == null ? void 0 : e.params.join(","), e == null ? void 0 : e.body);
|
|
128
128
|
} catch (r) {
|
|
129
|
-
|
|
129
|
+
Ht.error("stringToFunc", r);
|
|
130
130
|
}
|
|
131
131
|
}
|
|
132
132
|
}, za = (t) => {
|
|
@@ -138,7 +138,7 @@ const Na = (t) => t ? xi.test(t) : !1, La = (t) => {
|
|
|
138
138
|
let i = ((r = e.groups) == null ? void 0 : r.name) || "", o = ((n = e.groups) == null ? void 0 : n.param) || "", a = ((s = e.groups) == null ? void 0 : s.body) || "";
|
|
139
139
|
return { params: Ua(o), body: a };
|
|
140
140
|
} catch (i) {
|
|
141
|
-
|
|
141
|
+
Ht.error("getFuncSplit", i);
|
|
142
142
|
}
|
|
143
143
|
}
|
|
144
144
|
}, Ua = (t) => {
|
|
@@ -162,7 +162,7 @@ const Na = (t) => t ? xi.test(t) : !1, La = (t) => {
|
|
|
162
162
|
var r = e ? Object.values(e) : [];
|
|
163
163
|
return t.call(t, ...r);
|
|
164
164
|
} catch (n) {
|
|
165
|
-
|
|
165
|
+
Ht.error("callFunc", n);
|
|
166
166
|
}
|
|
167
167
|
}, Ma = (t, e) => {
|
|
168
168
|
var r = [];
|
|
@@ -174,7 +174,7 @@ const Na = (t) => t ? xi.test(t) : !1, La = (t) => {
|
|
|
174
174
|
let r = La(t);
|
|
175
175
|
if (r)
|
|
176
176
|
return fi(r, e);
|
|
177
|
-
},
|
|
177
|
+
}, It = (t, e) => {
|
|
178
178
|
if (t)
|
|
179
179
|
return Na(t) ? ja(t, e) : Ma(t, e);
|
|
180
180
|
}, ui = (t) => {
|
|
@@ -184,11 +184,11 @@ const Na = (t) => t ? xi.test(t) : !1, La = (t) => {
|
|
|
184
184
|
}
|
|
185
185
|
}, Wa = (t, e) => {
|
|
186
186
|
let r = ui(t);
|
|
187
|
-
var n = e ?
|
|
187
|
+
var n = e ? Pt(e) : [];
|
|
188
188
|
return r = `function(${n.join(",")}){${r}}`, new Function("return " + r);
|
|
189
189
|
}, wn = (t, e) => {
|
|
190
190
|
var i;
|
|
191
|
-
var r = Wa(t, e), n = e ? (i = Object.entries(e)) == null ? void 0 : i.map(([o, a]) =>
|
|
191
|
+
var r = Wa(t, e), n = e ? (i = Object.entries(e)) == null ? void 0 : i.map(([o, a]) => $t(a) ? a.value : a) : [];
|
|
192
192
|
try {
|
|
193
193
|
var s = r == null ? void 0 : r();
|
|
194
194
|
if (s != null) {
|
|
@@ -196,9 +196,9 @@ const Na = (t) => t ? xi.test(t) : !1, La = (t) => {
|
|
|
196
196
|
return s == null ? void 0 : s(...n);
|
|
197
197
|
s == null || s();
|
|
198
198
|
} else
|
|
199
|
-
|
|
199
|
+
Ht.info("evalExpression", "function is empty", { expression: t, data: e });
|
|
200
200
|
} catch (o) {
|
|
201
|
-
|
|
201
|
+
Ht.error("evalExpression", o, { expression: t, data: e });
|
|
202
202
|
return;
|
|
203
203
|
}
|
|
204
204
|
}, Za = (t, e) => {
|
|
@@ -206,7 +206,7 @@ const Na = (t) => t ? xi.test(t) : !1, La = (t) => {
|
|
|
206
206
|
if (!(t == null || !G0(t))) {
|
|
207
207
|
var n = t == null ? void 0 : t.replace(r, function(s, i, o) {
|
|
208
208
|
var a = s, B = a.substring(1, a.length - 1), c = wn(B, e);
|
|
209
|
-
return
|
|
209
|
+
return I0(c) ? '""' : Sr(c) ? M0(c) : `"${c}"`;
|
|
210
210
|
});
|
|
211
211
|
return n;
|
|
212
212
|
}
|
|
@@ -215,7 +215,7 @@ const Na = (t) => t ? xi.test(t) : !1, La = (t) => {
|
|
|
215
215
|
if (!(t == null || !G0(t))) {
|
|
216
216
|
var n = t == null ? void 0 : t.replace(r, function(s, i, o) {
|
|
217
217
|
var a = s, B = wn(a, e);
|
|
218
|
-
return
|
|
218
|
+
return I0(B) ? "" : B;
|
|
219
219
|
});
|
|
220
220
|
return n;
|
|
221
221
|
}
|
|
@@ -277,9 +277,9 @@ function di(t, e) {
|
|
|
277
277
|
const { toString: Ya } = Object.prototype, { getPrototypeOf: _n } = Object, Tr = ((t) => (e) => {
|
|
278
278
|
const r = Ya.call(e);
|
|
279
279
|
return t[r] || (t[r] = r.slice(8, -1).toLowerCase());
|
|
280
|
-
})(/* @__PURE__ */ Object.create(null)), dt = (t) => (t = t.toLowerCase(), (e) => Tr(e) === t), Rr = (t) => (e) => typeof e === t, { isArray:
|
|
280
|
+
})(/* @__PURE__ */ Object.create(null)), dt = (t) => (t = t.toLowerCase(), (e) => Tr(e) === t), Rr = (t) => (e) => typeof e === t, { isArray: ne } = Array, ve = Rr("undefined");
|
|
281
281
|
function Ja(t) {
|
|
282
|
-
return t !== null && !
|
|
282
|
+
return t !== null && !ve(t) && t.constructor !== null && !ve(t.constructor) && X0(t.constructor.isBuffer) && t.constructor.isBuffer(t);
|
|
283
283
|
}
|
|
284
284
|
const pi = dt("ArrayBuffer");
|
|
285
285
|
function tc(t) {
|
|
@@ -295,11 +295,11 @@ const ec = Rr("string"), X0 = Rr("function"), vi = Rr("number"), kr = (t) => t !
|
|
|
295
295
|
let e;
|
|
296
296
|
return t && (typeof FormData == "function" && t instanceof FormData || X0(t.append) && ((e = Tr(t)) === "formdata" || e === "object" && X0(t.toString) && t.toString() === "[object FormData]"));
|
|
297
297
|
}, xc = dt("URLSearchParams"), fc = (t) => t.trim ? t.trim() : t.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
|
|
298
|
-
function
|
|
298
|
+
function ge(t, e, { allOwnKeys: r = !1 } = {}) {
|
|
299
299
|
if (t === null || typeof t > "u")
|
|
300
300
|
return;
|
|
301
301
|
let n, s;
|
|
302
|
-
if (typeof t != "object" && (t = [t]),
|
|
302
|
+
if (typeof t != "object" && (t = [t]), ne(t))
|
|
303
303
|
for (n = 0, s = t.length; n < s; n++)
|
|
304
304
|
e.call(null, t[n], n, t);
|
|
305
305
|
else {
|
|
@@ -318,17 +318,17 @@ function Bi(t, e) {
|
|
|
318
318
|
return s;
|
|
319
319
|
return null;
|
|
320
320
|
}
|
|
321
|
-
const gi = (() => typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : global)(), Ei = (t) => !
|
|
321
|
+
const gi = (() => typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : global)(), Ei = (t) => !ve(t) && t !== gi;
|
|
322
322
|
function pn() {
|
|
323
323
|
const { caseless: t } = Ei(this) && this || {}, e = {}, r = (n, s) => {
|
|
324
324
|
const i = t && Bi(e, s) || s;
|
|
325
|
-
Ie(e[i]) && Ie(n) ? e[i] = pn(e[i], n) : Ie(n) ? e[i] = pn({}, n) :
|
|
325
|
+
Ie(e[i]) && Ie(n) ? e[i] = pn(e[i], n) : Ie(n) ? e[i] = pn({}, n) : ne(n) ? e[i] = n.slice() : e[i] = n;
|
|
326
326
|
};
|
|
327
327
|
for (let n = 0, s = arguments.length; n < s; n++)
|
|
328
|
-
arguments[n] &&
|
|
328
|
+
arguments[n] && ge(arguments[n], r);
|
|
329
329
|
return e;
|
|
330
330
|
}
|
|
331
|
-
const uc = (t, e, r, { allOwnKeys: n } = {}) => (
|
|
331
|
+
const uc = (t, e, r, { allOwnKeys: n } = {}) => (ge(e, (s, i) => {
|
|
332
332
|
r && X0(s) ? t[i] = di(s, r) : t[i] = s;
|
|
333
333
|
}, { allOwnKeys: n }), t), lc = (t) => (t.charCodeAt(0) === 65279 && (t = t.slice(1)), t), hc = (t, e, r, n) => {
|
|
334
334
|
t.prototype = Object.create(e.prototype, n), t.prototype.constructor = t, Object.defineProperty(t, "super", {
|
|
@@ -352,7 +352,7 @@ const uc = (t, e, r, { allOwnKeys: n } = {}) => (Be(e, (s, i) => {
|
|
|
352
352
|
}, vc = (t) => {
|
|
353
353
|
if (!t)
|
|
354
354
|
return null;
|
|
355
|
-
if (
|
|
355
|
+
if (ne(t))
|
|
356
356
|
return t;
|
|
357
357
|
let e = t.length;
|
|
358
358
|
if (!vi(e))
|
|
@@ -381,7 +381,7 @@ const uc = (t, e, r, { allOwnKeys: n } = {}) => (Be(e, (s, i) => {
|
|
|
381
381
|
}
|
|
382
382
|
), Qn = (({ hasOwnProperty: t }) => (e, r) => t.call(e, r))(Object.prototype), bc = dt("RegExp"), yi = (t, e) => {
|
|
383
383
|
const r = Object.getOwnPropertyDescriptors(t), n = {};
|
|
384
|
-
|
|
384
|
+
ge(r, (s, i) => {
|
|
385
385
|
e(s, i, t) !== !1 && (n[i] = s);
|
|
386
386
|
}), Object.defineProperties(t, n);
|
|
387
387
|
}, Ac = (t) => {
|
|
@@ -405,7 +405,7 @@ const uc = (t, e, r, { allOwnKeys: n } = {}) => (Be(e, (s, i) => {
|
|
|
405
405
|
r[i] = !0;
|
|
406
406
|
});
|
|
407
407
|
};
|
|
408
|
-
return
|
|
408
|
+
return ne(t) ? n(t) : n(String(t).split(e)), r;
|
|
409
409
|
}, Cc = () => {
|
|
410
410
|
}, Dc = (t, e) => (t = +t, Number.isFinite(t) ? t : e), an = "abcdefghijklmnopqrstuvwxyz", Vn = "0123456789", mi = {
|
|
411
411
|
DIGIT: Vn,
|
|
@@ -428,10 +428,10 @@ const Sc = (t) => {
|
|
|
428
428
|
return;
|
|
429
429
|
if (!("toJSON" in n)) {
|
|
430
430
|
e[s] = n;
|
|
431
|
-
const i =
|
|
432
|
-
return
|
|
431
|
+
const i = ne(n) ? [] : {};
|
|
432
|
+
return ge(n, (o, a) => {
|
|
433
433
|
const B = r(o, s + 1);
|
|
434
|
-
!
|
|
434
|
+
!ve(B) && (i[a] = B);
|
|
435
435
|
}), e[s] = void 0, i;
|
|
436
436
|
}
|
|
437
437
|
}
|
|
@@ -439,7 +439,7 @@ const Sc = (t) => {
|
|
|
439
439
|
};
|
|
440
440
|
return r(t, 0);
|
|
441
441
|
}, Tc = dt("AsyncFunction"), Rc = (t) => t && (kr(t) || X0(t)) && X0(t.then) && X0(t.catch), P = {
|
|
442
|
-
isArray:
|
|
442
|
+
isArray: ne,
|
|
443
443
|
isArrayBuffer: pi,
|
|
444
444
|
isBuffer: Ja,
|
|
445
445
|
isFormData: cc,
|
|
@@ -449,7 +449,7 @@ const Sc = (t) => {
|
|
|
449
449
|
isBoolean: rc,
|
|
450
450
|
isObject: kr,
|
|
451
451
|
isPlainObject: Ie,
|
|
452
|
-
isUndefined:
|
|
452
|
+
isUndefined: ve,
|
|
453
453
|
isDate: nc,
|
|
454
454
|
isFile: sc,
|
|
455
455
|
isBlob: ic,
|
|
@@ -459,7 +459,7 @@ const Sc = (t) => {
|
|
|
459
459
|
isURLSearchParams: xc,
|
|
460
460
|
isTypedArray: Bc,
|
|
461
461
|
isFileList: oc,
|
|
462
|
-
forEach:
|
|
462
|
+
forEach: ge,
|
|
463
463
|
merge: pn,
|
|
464
464
|
extend: uc,
|
|
465
465
|
trim: fc,
|
|
@@ -567,8 +567,8 @@ function Or(t, e, r) {
|
|
|
567
567
|
metaTokens: !0,
|
|
568
568
|
dots: !1,
|
|
569
569
|
indexes: !1
|
|
570
|
-
}, !1, function(l,
|
|
571
|
-
return !P.isUndefined(
|
|
570
|
+
}, !1, function(l, y) {
|
|
571
|
+
return !P.isUndefined(y[l]);
|
|
572
572
|
});
|
|
573
573
|
const n = r.metaTokens, s = r.visitor || x, i = r.dots, o = r.indexes, B = (r.Blob || typeof Blob < "u" && Blob) && P.isSpecCompliantForm(e);
|
|
574
574
|
if (!P.isFunction(s))
|
|
@@ -582,21 +582,21 @@ function Or(t, e, r) {
|
|
|
582
582
|
throw new c0("Blob is not supported. Use a Buffer instead.");
|
|
583
583
|
return P.isArrayBuffer(f) || P.isTypedArray(f) ? B && typeof Blob == "function" ? new Blob([f]) : Buffer.from(f) : f;
|
|
584
584
|
}
|
|
585
|
-
function x(f, l,
|
|
585
|
+
function x(f, l, y) {
|
|
586
586
|
let A = f;
|
|
587
|
-
if (f && !
|
|
587
|
+
if (f && !y && typeof f == "object") {
|
|
588
588
|
if (P.endsWith(l, "{}"))
|
|
589
589
|
l = n ? l : l.slice(0, -2), f = JSON.stringify(f);
|
|
590
590
|
else if (P.isArray(f) && Oc(f) || (P.isFileList(f) || P.endsWith(l, "[]")) && (A = P.toArray(f)))
|
|
591
|
-
return l = Fi(l), A.forEach(function(
|
|
592
|
-
!(P.isUndefined(
|
|
591
|
+
return l = Fi(l), A.forEach(function(E, b) {
|
|
592
|
+
!(P.isUndefined(E) || E === null) && e.append(
|
|
593
593
|
// eslint-disable-next-line no-nested-ternary
|
|
594
594
|
o === !0 ? Yn([l], b, i) : o === null ? l : l + "[]",
|
|
595
|
-
c(
|
|
595
|
+
c(E)
|
|
596
596
|
);
|
|
597
597
|
}), !1;
|
|
598
598
|
}
|
|
599
|
-
return vn(f) ? !0 : (e.append(Yn(
|
|
599
|
+
return vn(f) ? !0 : (e.append(Yn(y, l, i), c(f)), !1);
|
|
600
600
|
}
|
|
601
601
|
const d = [], h = Object.assign(Pc, {
|
|
602
602
|
defaultVisitor: x,
|
|
@@ -879,7 +879,7 @@ const Tn = Pr, Kc = P.toObjectSet([
|
|
|
879
879
|
s = o.indexOf(":"), r = o.substring(0, s).trim().toLowerCase(), n = o.substring(s + 1).trim(), !(!r || e[r] && Kc[r]) && (r === "set-cookie" ? e[r] ? e[r].push(n) : e[r] = [n] : e[r] = e[r] ? e[r] + ", " + n : n);
|
|
880
880
|
}), e;
|
|
881
881
|
}, es = Symbol("internals");
|
|
882
|
-
function
|
|
882
|
+
function ae(t) {
|
|
883
883
|
return t && String(t).trim().toLowerCase();
|
|
884
884
|
}
|
|
885
885
|
function qe(t) {
|
|
@@ -924,7 +924,7 @@ class Hr {
|
|
|
924
924
|
set(e, r, n) {
|
|
925
925
|
const s = this;
|
|
926
926
|
function i(a, B, c) {
|
|
927
|
-
const x =
|
|
927
|
+
const x = ae(B);
|
|
928
928
|
if (!x)
|
|
929
929
|
throw new Error("header name must be a non-empty string");
|
|
930
930
|
const d = P.findKey(s, x);
|
|
@@ -934,7 +934,7 @@ class Hr {
|
|
|
934
934
|
return P.isPlainObject(e) || e instanceof this.constructor ? o(e, r) : P.isString(e) && (e = e.trim()) && !Qc(e) ? o(Gc(e), r) : e != null && i(r, e, n), this;
|
|
935
935
|
}
|
|
936
936
|
get(e, r) {
|
|
937
|
-
if (e =
|
|
937
|
+
if (e = ae(e), e) {
|
|
938
938
|
const n = P.findKey(this, e);
|
|
939
939
|
if (n) {
|
|
940
940
|
const s = this[n];
|
|
@@ -951,7 +951,7 @@ class Hr {
|
|
|
951
951
|
}
|
|
952
952
|
}
|
|
953
953
|
has(e, r) {
|
|
954
|
-
if (e =
|
|
954
|
+
if (e = ae(e), e) {
|
|
955
955
|
const n = P.findKey(this, e);
|
|
956
956
|
return !!(n && this[n] !== void 0 && (!r || cn(this, this[n], n, r)));
|
|
957
957
|
}
|
|
@@ -961,7 +961,7 @@ class Hr {
|
|
|
961
961
|
const n = this;
|
|
962
962
|
let s = !1;
|
|
963
963
|
function i(o) {
|
|
964
|
-
if (o =
|
|
964
|
+
if (o = ae(o), o) {
|
|
965
965
|
const a = P.findKey(n, o);
|
|
966
966
|
a && (!r || cn(n, n[a], a, r)) && (delete n[a], s = !0);
|
|
967
967
|
}
|
|
@@ -1020,7 +1020,7 @@ class Hr {
|
|
|
1020
1020
|
accessors: {}
|
|
1021
1021
|
}).accessors, s = this.prototype;
|
|
1022
1022
|
function i(o) {
|
|
1023
|
-
const a =
|
|
1023
|
+
const a = ae(o);
|
|
1024
1024
|
n[a] || (Yc(s, o), n[a] = !0);
|
|
1025
1025
|
}
|
|
1026
1026
|
return P.isArray(e) ? e.forEach(i) : i(e), this;
|
|
@@ -1040,10 +1040,10 @@ function xn(t, e) {
|
|
|
1040
1040
|
function Si(t) {
|
|
1041
1041
|
return !!(t && t.__CANCEL__);
|
|
1042
1042
|
}
|
|
1043
|
-
function
|
|
1043
|
+
function Ee(t, e, r) {
|
|
1044
1044
|
c0.call(this, t ?? "canceled", c0.ERR_CANCELED, e, r), this.name = "CanceledError";
|
|
1045
1045
|
}
|
|
1046
|
-
P.inherits(
|
|
1046
|
+
P.inherits(Ee, c0, {
|
|
1047
1047
|
__CANCEL__: !0
|
|
1048
1048
|
});
|
|
1049
1049
|
function Jc(t, e, r) {
|
|
@@ -1210,7 +1210,7 @@ const ox = typeof XMLHttpRequest < "u", ax = ox && function(t) {
|
|
|
1210
1210
|
s === void 0 && i.setContentType(null), "setRequestHeader" in c && P.forEach(i.toJSON(), function(f, l) {
|
|
1211
1211
|
c.setRequestHeader(l, f);
|
|
1212
1212
|
}), P.isUndefined(t.withCredentials) || (c.withCredentials = !!t.withCredentials), o && o !== "json" && (c.responseType = t.responseType), typeof t.onDownloadProgress == "function" && c.addEventListener("progress", rs(t.onDownloadProgress, !0)), typeof t.onUploadProgress == "function" && c.upload && c.upload.addEventListener("progress", rs(t.onUploadProgress)), (t.cancelToken || t.signal) && (a = (v) => {
|
|
1213
|
-
c && (n(!v || v.type ? new
|
|
1213
|
+
c && (n(!v || v.type ? new Ee(null, t, c) : v), c.abort(), c = null);
|
|
1214
1214
|
}, t.cancelToken && t.cancelToken.subscribe(a), t.signal && (t.signal.aborted ? a() : t.signal.addEventListener("abort", a)));
|
|
1215
1215
|
const h = sx(x);
|
|
1216
1216
|
if (h && lt.protocols.indexOf(h) === -1) {
|
|
@@ -1254,7 +1254,7 @@ const cx = {
|
|
|
1254
1254
|
};
|
|
1255
1255
|
function fn(t) {
|
|
1256
1256
|
if (t.cancelToken && t.cancelToken.throwIfRequested(), t.signal && t.signal.aborted)
|
|
1257
|
-
throw new
|
|
1257
|
+
throw new Ee(null, t);
|
|
1258
1258
|
}
|
|
1259
1259
|
function ns(t) {
|
|
1260
1260
|
return fn(t), t.headers = mt.from(t.headers), t.data = xn.call(
|
|
@@ -1275,7 +1275,7 @@ function ns(t) {
|
|
|
1275
1275
|
});
|
|
1276
1276
|
}
|
|
1277
1277
|
const ss = (t) => t instanceof mt ? t.toJSON() : t;
|
|
1278
|
-
function
|
|
1278
|
+
function Jt(t, e) {
|
|
1279
1279
|
e = e || {};
|
|
1280
1280
|
const r = {};
|
|
1281
1281
|
function n(c, x, d) {
|
|
@@ -1385,7 +1385,7 @@ function xx(t, e, r) {
|
|
|
1385
1385
|
const Bn = {
|
|
1386
1386
|
assertOptions: xx,
|
|
1387
1387
|
validators: Rn
|
|
1388
|
-
},
|
|
1388
|
+
}, Dt = Bn.validators;
|
|
1389
1389
|
class We {
|
|
1390
1390
|
constructor(e) {
|
|
1391
1391
|
this.defaults = e, this.interceptors = {
|
|
@@ -1402,17 +1402,17 @@ class We {
|
|
|
1402
1402
|
* @returns {Promise} The Promise to be fulfilled
|
|
1403
1403
|
*/
|
|
1404
1404
|
request(e, r) {
|
|
1405
|
-
typeof e == "string" ? (r = r || {}, r.url = e) : r = e || {}, r =
|
|
1405
|
+
typeof e == "string" ? (r = r || {}, r.url = e) : r = e || {}, r = Jt(this.defaults, r);
|
|
1406
1406
|
const { transitional: n, paramsSerializer: s, headers: i } = r;
|
|
1407
1407
|
n !== void 0 && Bn.assertOptions(n, {
|
|
1408
|
-
silentJSONParsing:
|
|
1409
|
-
forcedJSONParsing:
|
|
1410
|
-
clarifyTimeoutError:
|
|
1408
|
+
silentJSONParsing: Dt.transitional(Dt.boolean),
|
|
1409
|
+
forcedJSONParsing: Dt.transitional(Dt.boolean),
|
|
1410
|
+
clarifyTimeoutError: Dt.transitional(Dt.boolean)
|
|
1411
1411
|
}, !1), s != null && (P.isFunction(s) ? r.paramsSerializer = {
|
|
1412
1412
|
serialize: s
|
|
1413
1413
|
} : Bn.assertOptions(s, {
|
|
1414
|
-
encode:
|
|
1415
|
-
serialize:
|
|
1414
|
+
encode: Dt.function,
|
|
1415
|
+
serialize: Dt.function
|
|
1416
1416
|
}, !0)), r.method = (r.method || this.defaults.method || "get").toLowerCase();
|
|
1417
1417
|
let o;
|
|
1418
1418
|
o = i && P.merge(
|
|
@@ -1446,8 +1446,8 @@ class We {
|
|
|
1446
1446
|
const f = a[d++], l = a[d++];
|
|
1447
1447
|
try {
|
|
1448
1448
|
v = f(v);
|
|
1449
|
-
} catch (
|
|
1450
|
-
l.call(this,
|
|
1449
|
+
} catch (y) {
|
|
1450
|
+
l.call(this, y);
|
|
1451
1451
|
break;
|
|
1452
1452
|
}
|
|
1453
1453
|
}
|
|
@@ -1461,14 +1461,14 @@ class We {
|
|
|
1461
1461
|
return x;
|
|
1462
1462
|
}
|
|
1463
1463
|
getUri(e) {
|
|
1464
|
-
e =
|
|
1464
|
+
e = Jt(this.defaults, e);
|
|
1465
1465
|
const r = Ti(e.baseURL, e.url);
|
|
1466
1466
|
return Di(r, e.params, e.paramsSerializer);
|
|
1467
1467
|
}
|
|
1468
1468
|
}
|
|
1469
1469
|
P.forEach(["delete", "get", "head", "options"], function(e) {
|
|
1470
1470
|
We.prototype[e] = function(r, n) {
|
|
1471
|
-
return this.request(
|
|
1471
|
+
return this.request(Jt(n || {}, {
|
|
1472
1472
|
method: e,
|
|
1473
1473
|
url: r,
|
|
1474
1474
|
data: (n || {}).data
|
|
@@ -1478,7 +1478,7 @@ P.forEach(["delete", "get", "head", "options"], function(e) {
|
|
|
1478
1478
|
P.forEach(["post", "put", "patch"], function(e) {
|
|
1479
1479
|
function r(n) {
|
|
1480
1480
|
return function(i, o, a) {
|
|
1481
|
-
return this.request(
|
|
1481
|
+
return this.request(Jt(a || {}, {
|
|
1482
1482
|
method: e,
|
|
1483
1483
|
headers: n ? {
|
|
1484
1484
|
"Content-Type": "multipart/form-data"
|
|
@@ -1516,7 +1516,7 @@ class kn {
|
|
|
1516
1516
|
n.unsubscribe(i);
|
|
1517
1517
|
}, o;
|
|
1518
1518
|
}, e(function(i, o, a) {
|
|
1519
|
-
n.reason || (n.reason = new
|
|
1519
|
+
n.reason || (n.reason = new Ee(i, o, a), r(n.reason));
|
|
1520
1520
|
});
|
|
1521
1521
|
}
|
|
1522
1522
|
/**
|
|
@@ -1640,12 +1640,12 @@ const hx = gn;
|
|
|
1640
1640
|
function ki(t) {
|
|
1641
1641
|
const e = new Le(t), r = di(Le.prototype.request, e);
|
|
1642
1642
|
return P.extend(r, Le.prototype, e, { allOwnKeys: !0 }), P.extend(r, e, null, { allOwnKeys: !0 }), r.create = function(s) {
|
|
1643
|
-
return ki(
|
|
1643
|
+
return ki(Jt(t, s));
|
|
1644
1644
|
}, r;
|
|
1645
1645
|
}
|
|
1646
1646
|
const b0 = ki(Tn);
|
|
1647
1647
|
b0.Axios = Le;
|
|
1648
|
-
b0.CanceledError =
|
|
1648
|
+
b0.CanceledError = Ee;
|
|
1649
1649
|
b0.CancelToken = fx;
|
|
1650
1650
|
b0.isCancel = Si;
|
|
1651
1651
|
b0.VERSION = Ri;
|
|
@@ -1657,7 +1657,7 @@ b0.all = function(e) {
|
|
|
1657
1657
|
};
|
|
1658
1658
|
b0.spread = ux;
|
|
1659
1659
|
b0.isAxiosError = lx;
|
|
1660
|
-
b0.mergeConfig =
|
|
1660
|
+
b0.mergeConfig = Jt;
|
|
1661
1661
|
b0.AxiosHeaders = mt;
|
|
1662
1662
|
b0.formToJSON = (t) => _i(P.isHTMLForm(t) ? new FormData(t) : t);
|
|
1663
1663
|
b0.HttpStatusCode = hx;
|
|
@@ -1735,23 +1735,23 @@ const Oi = b0, dx = (t) => {
|
|
|
1735
1735
|
}, mx = () => {
|
|
1736
1736
|
function t(B, c, x = "", d = !1) {
|
|
1737
1737
|
const h = (S) => {
|
|
1738
|
-
const [
|
|
1738
|
+
const [R, q = ""] = S.split("#", 2), [w, C = ""] = R.split("?", 2);
|
|
1739
1739
|
return {
|
|
1740
1740
|
path: w.replace(/^#/, "").replace(/\/+$/, ""),
|
|
1741
1741
|
// 规范化路径
|
|
1742
1742
|
searchParams: new URLSearchParams(C),
|
|
1743
|
-
hashFragment:
|
|
1743
|
+
hashFragment: q
|
|
1744
1744
|
};
|
|
1745
1745
|
}, v = h(B), f = h(c), l = d ? new URLSearchParams(v.searchParams) : new URLSearchParams();
|
|
1746
|
-
f.searchParams.forEach((S,
|
|
1747
|
-
l.set(
|
|
1746
|
+
f.searchParams.forEach((S, R) => {
|
|
1747
|
+
l.set(R, S);
|
|
1748
1748
|
});
|
|
1749
|
-
const
|
|
1750
|
-
const
|
|
1749
|
+
const y = (S, R) => {
|
|
1750
|
+
const q = S.split("/").filter(Boolean), w = R.split("/").filter(Boolean);
|
|
1751
1751
|
for (const C of w)
|
|
1752
|
-
C !== "." && (C === ".." ?
|
|
1753
|
-
return `/${
|
|
1754
|
-
}, g = ((S,
|
|
1752
|
+
C !== "." && (C === ".." ? q.length > 0 && q.pop() : q.push(C));
|
|
1753
|
+
return `/${q.join("/")}`;
|
|
1754
|
+
}, g = ((S, R) => R.startsWith("/") ? `/${R.replace(/^\/+/, "")}` : y(S, f.path))(v.path, f.path), E = l.toString(), F = `${`${g}${E ? `?${E}` : ""}`}${f.hashFragment ? `#${f.hashFragment}` : ""}`;
|
|
1755
1755
|
return (s() ? `/${x}#/${F}` : F).replace(/\/+/g, "/").replace(/^#\//, "#").replace(/%20/g, "+").replace(/[?#]/g, (S) => S);
|
|
1756
1756
|
}
|
|
1757
1757
|
function e(B, c, x = "") {
|
|
@@ -1776,7 +1776,7 @@ const Oi = b0, dx = (t) => {
|
|
|
1776
1776
|
return i(o(x));
|
|
1777
1777
|
}
|
|
1778
1778
|
};
|
|
1779
|
-
}, { resolveByCurrentUrl: bx } = mx(),
|
|
1779
|
+
}, { resolveByCurrentUrl: bx } = mx(), Qt = {
|
|
1780
1780
|
buildUrl: qi,
|
|
1781
1781
|
getBaseUrl: Ii,
|
|
1782
1782
|
getQueryParam: Pi,
|
|
@@ -1918,12 +1918,12 @@ function Li() {
|
|
|
1918
1918
|
sendToParent: Cx
|
|
1919
1919
|
};
|
|
1920
1920
|
}
|
|
1921
|
-
var
|
|
1921
|
+
var te = {}, wx = {
|
|
1922
1922
|
get exports() {
|
|
1923
|
-
return
|
|
1923
|
+
return te;
|
|
1924
1924
|
},
|
|
1925
1925
|
set exports(t) {
|
|
1926
|
-
|
|
1926
|
+
te = t;
|
|
1927
1927
|
}
|
|
1928
1928
|
};
|
|
1929
1929
|
(function(t, e) {
|
|
@@ -1935,26 +1935,26 @@ var Jt = {}, wx = {
|
|
|
1935
1935
|
function o() {
|
|
1936
1936
|
return new i(null);
|
|
1937
1937
|
}
|
|
1938
|
-
function a(u, p, m, D,
|
|
1938
|
+
function a(u, p, m, D, I, $) {
|
|
1939
1939
|
for (; --$ >= 0; ) {
|
|
1940
|
-
var W = p * this[u++] + m[D] +
|
|
1941
|
-
|
|
1940
|
+
var W = p * this[u++] + m[D] + I;
|
|
1941
|
+
I = Math.floor(W / 67108864), m[D++] = W & 67108863;
|
|
1942
1942
|
}
|
|
1943
|
-
return
|
|
1943
|
+
return I;
|
|
1944
1944
|
}
|
|
1945
|
-
function B(u, p, m, D,
|
|
1945
|
+
function B(u, p, m, D, I, $) {
|
|
1946
1946
|
for (var W = p & 32767, G = p >> 15; --$ >= 0; ) {
|
|
1947
1947
|
var v0 = this[u] & 32767, C0 = this[u++] >> 15, j0 = G * v0 + C0 * W;
|
|
1948
|
-
v0 = W * v0 + ((j0 & 32767) << 15) + m[D] + (
|
|
1948
|
+
v0 = W * v0 + ((j0 & 32767) << 15) + m[D] + (I & 1073741823), I = (v0 >>> 30) + (j0 >>> 15) + G * C0 + (I >>> 30), m[D++] = v0 & 1073741823;
|
|
1949
1949
|
}
|
|
1950
|
-
return
|
|
1950
|
+
return I;
|
|
1951
1951
|
}
|
|
1952
|
-
function c(u, p, m, D,
|
|
1952
|
+
function c(u, p, m, D, I, $) {
|
|
1953
1953
|
for (var W = p & 16383, G = p >> 14; --$ >= 0; ) {
|
|
1954
1954
|
var v0 = this[u] & 16383, C0 = this[u++] >> 14, j0 = G * v0 + C0 * W;
|
|
1955
|
-
v0 = W * v0 + ((j0 & 16383) << 14) + m[D] +
|
|
1955
|
+
v0 = W * v0 + ((j0 & 16383) << 14) + m[D] + I, I = (v0 >> 28) + (j0 >> 14) + G * C0, m[D++] = v0 & 268435455;
|
|
1956
1956
|
}
|
|
1957
|
-
return
|
|
1957
|
+
return I;
|
|
1958
1958
|
}
|
|
1959
1959
|
var x = typeof navigator < "u";
|
|
1960
1960
|
x && s && navigator.appName == "Microsoft Internet Explorer" ? (i.prototype.am = B, r = 30) : x && s && navigator.appName != "Netscape" ? (i.prototype.am = a, r = 26) : (i.prototype.am = c, r = 28), i.prototype.DB = r, i.prototype.DM = (1 << r) - 1, i.prototype.DV = 1 << r;
|
|
@@ -1967,7 +1967,7 @@ var Jt = {}, wx = {
|
|
|
1967
1967
|
v[f++] = l;
|
|
1968
1968
|
for (f = "A".charCodeAt(0), l = 10; l < 36; ++l)
|
|
1969
1969
|
v[f++] = l;
|
|
1970
|
-
function
|
|
1970
|
+
function y(u) {
|
|
1971
1971
|
return h.charAt(u);
|
|
1972
1972
|
}
|
|
1973
1973
|
function A(u, p) {
|
|
@@ -1979,7 +1979,7 @@ var Jt = {}, wx = {
|
|
|
1979
1979
|
u[p] = this[p];
|
|
1980
1980
|
u.t = this.t, u.s = this.s;
|
|
1981
1981
|
}
|
|
1982
|
-
function
|
|
1982
|
+
function E(u) {
|
|
1983
1983
|
this.t = 1, this.s = u < 0 ? -1 : 0, u > 0 ? this[0] = u : u < -1 ? this[0] = u + this.DV : this.t = 0;
|
|
1984
1984
|
}
|
|
1985
1985
|
function b(u) {
|
|
@@ -2005,15 +2005,15 @@ var Jt = {}, wx = {
|
|
|
2005
2005
|
return;
|
|
2006
2006
|
}
|
|
2007
2007
|
this.t = 0, this.s = 0;
|
|
2008
|
-
for (var D = u.length,
|
|
2008
|
+
for (var D = u.length, I = !1, $ = 0; --D >= 0; ) {
|
|
2009
2009
|
var W = m == 8 ? u[D] & 255 : A(u, D);
|
|
2010
2010
|
if (W < 0) {
|
|
2011
|
-
u.charAt(D) == "-" && (
|
|
2011
|
+
u.charAt(D) == "-" && (I = !0);
|
|
2012
2012
|
continue;
|
|
2013
2013
|
}
|
|
2014
|
-
|
|
2014
|
+
I = !1, $ == 0 ? this[this.t++] = W : $ + m > this.DB ? (this[this.t - 1] |= (W & (1 << this.DB - $) - 1) << $, this[this.t++] = W >> this.DB - $) : this[this.t - 1] |= W << $, $ += m, $ >= this.DB && ($ -= this.DB);
|
|
2015
2015
|
}
|
|
2016
|
-
m == 8 && u[0] & 128 && (this.s = -1, $ > 0 && (this[this.t - 1] |= (1 << this.DB - $) - 1 << $)), this.clamp(),
|
|
2016
|
+
m == 8 && u[0] & 128 && (this.s = -1, $ > 0 && (this[this.t - 1] |= (1 << this.DB - $) - 1 << $)), this.clamp(), I && i.ZERO.subTo(this, this);
|
|
2017
2017
|
}
|
|
2018
2018
|
function _() {
|
|
2019
2019
|
for (var u = this.s & this.DM; this.t > 0 && this[this.t - 1] == u; )
|
|
@@ -2035,17 +2035,17 @@ var Jt = {}, wx = {
|
|
|
2035
2035
|
p = 2;
|
|
2036
2036
|
else
|
|
2037
2037
|
return this.toRadix(u);
|
|
2038
|
-
var m = (1 << p) - 1, D,
|
|
2038
|
+
var m = (1 << p) - 1, D, I = !1, $ = "", W = this.t, G = this.DB - W * this.DB % p;
|
|
2039
2039
|
if (W-- > 0)
|
|
2040
|
-
for (G < this.DB && (D = this[W] >> G) > 0 && (
|
|
2041
|
-
G < p ? (D = (this[W] & (1 << G) - 1) << p - G, D |= this[--W] >> (G += this.DB - p)) : (D = this[W] >> (G -= p) & m, G <= 0 && (G += this.DB, --W)), D > 0 && (
|
|
2042
|
-
return
|
|
2040
|
+
for (G < this.DB && (D = this[W] >> G) > 0 && (I = !0, $ = y(D)); W >= 0; )
|
|
2041
|
+
G < p ? (D = (this[W] & (1 << G) - 1) << p - G, D |= this[--W] >> (G += this.DB - p)) : (D = this[W] >> (G -= p) & m, G <= 0 && (G += this.DB, --W)), D > 0 && (I = !0), I && ($ += y(D));
|
|
2042
|
+
return I ? $ : "0";
|
|
2043
2043
|
}
|
|
2044
|
-
function
|
|
2044
|
+
function R() {
|
|
2045
2045
|
var u = o();
|
|
2046
2046
|
return i.ZERO.subTo(this, u), u;
|
|
2047
2047
|
}
|
|
2048
|
-
function
|
|
2048
|
+
function q() {
|
|
2049
2049
|
return this.s < 0 ? this.negate() : this;
|
|
2050
2050
|
}
|
|
2051
2051
|
function w(u) {
|
|
@@ -2081,9 +2081,9 @@ var Jt = {}, wx = {
|
|
|
2081
2081
|
p.t = Math.max(this.t - u, 0), p.s = this.s;
|
|
2082
2082
|
}
|
|
2083
2083
|
function J(u, p) {
|
|
2084
|
-
var m = u % this.DB, D = this.DB - m,
|
|
2084
|
+
var m = u % this.DB, D = this.DB - m, I = (1 << D) - 1, $ = Math.floor(u / this.DB), W = this.s << m & this.DM, G;
|
|
2085
2085
|
for (G = this.t - 1; G >= 0; --G)
|
|
2086
|
-
p[G + $ + 1] = this[G] >> D | W, W = (this[G] &
|
|
2086
|
+
p[G + $ + 1] = this[G] >> D | W, W = (this[G] & I) << m;
|
|
2087
2087
|
for (G = $ - 1; G >= 0; --G)
|
|
2088
2088
|
p[G] = 0;
|
|
2089
2089
|
p[$] = W, p.t = this.t + $ + 1, p.s = this.s, p.clamp();
|
|
@@ -2095,14 +2095,14 @@ var Jt = {}, wx = {
|
|
|
2095
2095
|
p.t = 0;
|
|
2096
2096
|
return;
|
|
2097
2097
|
}
|
|
2098
|
-
var D = u % this.DB,
|
|
2098
|
+
var D = u % this.DB, I = this.DB - D, $ = (1 << D) - 1;
|
|
2099
2099
|
p[0] = this[m] >> D;
|
|
2100
2100
|
for (var W = m + 1; W < this.t; ++W)
|
|
2101
|
-
p[W - m - 1] |= (this[W] & $) <<
|
|
2102
|
-
D > 0 && (p[this.t - m - 1] |= (this.s & $) <<
|
|
2101
|
+
p[W - m - 1] |= (this[W] & $) << I, p[W - m] = this[W] >> D;
|
|
2102
|
+
D > 0 && (p[this.t - m - 1] |= (this.s & $) << I), p.t = this.t - m, p.clamp();
|
|
2103
2103
|
}
|
|
2104
2104
|
function l0(u, p) {
|
|
2105
|
-
for (var m = 0, D = 0,
|
|
2105
|
+
for (var m = 0, D = 0, I = Math.min(u.t, this.t); m < I; )
|
|
2106
2106
|
D += this[m] - u[m], p[m++] = D & this.DM, D >>= this.DB;
|
|
2107
2107
|
if (u.t < this.t) {
|
|
2108
2108
|
for (D -= u.s; m < this.t; )
|
|
@@ -2116,11 +2116,11 @@ var Jt = {}, wx = {
|
|
|
2116
2116
|
p.s = D < 0 ? -1 : 0, D < -1 ? p[m++] = this.DV + D : D > 0 && (p[m++] = D), p.t = m, p.clamp();
|
|
2117
2117
|
}
|
|
2118
2118
|
function Y(u, p) {
|
|
2119
|
-
var m = this.abs(), D = u.abs(),
|
|
2120
|
-
for (p.t =
|
|
2121
|
-
p[
|
|
2122
|
-
for (
|
|
2123
|
-
p[
|
|
2119
|
+
var m = this.abs(), D = u.abs(), I = m.t;
|
|
2120
|
+
for (p.t = I + D.t; --I >= 0; )
|
|
2121
|
+
p[I] = 0;
|
|
2122
|
+
for (I = 0; I < D.t; ++I)
|
|
2123
|
+
p[I + m.t] = m.am(0, D[I], p, I, 0, m.t);
|
|
2124
2124
|
p.s = 0, p.clamp(), this.s != u.s && i.ZERO.subTo(p, p);
|
|
2125
2125
|
}
|
|
2126
2126
|
function h0(u) {
|
|
@@ -2135,24 +2135,24 @@ var Jt = {}, wx = {
|
|
|
2135
2135
|
function a0(u, p, m) {
|
|
2136
2136
|
var D = u.abs();
|
|
2137
2137
|
if (!(D.t <= 0)) {
|
|
2138
|
-
var
|
|
2139
|
-
if (
|
|
2138
|
+
var I = this.abs();
|
|
2139
|
+
if (I.t < D.t) {
|
|
2140
2140
|
p != null && p.fromInt(0), m != null && this.copyTo(m);
|
|
2141
2141
|
return;
|
|
2142
2142
|
}
|
|
2143
2143
|
m == null && (m = o());
|
|
2144
2144
|
var $ = o(), W = this.s, G = u.s, v0 = this.DB - C(D[D.t - 1]);
|
|
2145
|
-
v0 > 0 ? (D.lShiftTo(v0, $),
|
|
2145
|
+
v0 > 0 ? (D.lShiftTo(v0, $), I.lShiftTo(v0, m)) : (D.copyTo($), I.copyTo(m));
|
|
2146
2146
|
var C0 = $.t, j0 = $[C0 - 1];
|
|
2147
2147
|
if (j0 != 0) {
|
|
2148
|
-
var
|
|
2149
|
-
for ($.dlShiftTo(Se,
|
|
2148
|
+
var z0 = j0 * (1 << this.F1) + (C0 > 1 ? $[C0 - 2] >> this.F2 : 0), gt = this.FV / z0, _e = (1 << this.F1) / z0, Y0 = 1 << this.F2, J0 = m.t, Se = J0 - C0, Ct = p ?? o();
|
|
2149
|
+
for ($.dlShiftTo(Se, Ct), m.compareTo(Ct) >= 0 && (m[m.t++] = 1, m.subTo(Ct, m)), i.ONE.dlShiftTo(C0, Ct), Ct.subTo($, $); $.t < C0; )
|
|
2150
2150
|
$[$.t++] = 0;
|
|
2151
2151
|
for (; --Se >= 0; ) {
|
|
2152
2152
|
var tn = m[--J0] == j0 ? this.DM : Math.floor(m[J0] * gt + (m[J0 - 1] + Y0) * _e);
|
|
2153
2153
|
if ((m[J0] += $.am(0, tn, m, Se, 0, C0)) < tn)
|
|
2154
|
-
for ($.dlShiftTo(Se,
|
|
2155
|
-
m.subTo(
|
|
2154
|
+
for ($.dlShiftTo(Se, Ct), m.subTo(Ct, m); m[J0] < --tn; )
|
|
2155
|
+
m.subTo(Ct, m);
|
|
2156
2156
|
}
|
|
2157
2157
|
p != null && (m.drShiftTo(C0, p), W != G && i.ZERO.subTo(p, p)), m.t = C0, m.clamp(), v0 > 0 && m.rShiftTo(v0, m), W < 0 && i.ZERO.subTo(m, m);
|
|
2158
2158
|
}
|
|
@@ -2197,7 +2197,7 @@ var Jt = {}, wx = {
|
|
|
2197
2197
|
var p = o();
|
|
2198
2198
|
return u.abs().dlShiftTo(this.m.t, p), p.divRemTo(this.m, null, p), u.s < 0 && p.compareTo(i.ZERO) > 0 && this.m.subTo(p, p), p;
|
|
2199
2199
|
}
|
|
2200
|
-
function
|
|
2200
|
+
function Nt(u) {
|
|
2201
2201
|
var p = o();
|
|
2202
2202
|
return u.copyTo(p), this.reduce(p), p;
|
|
2203
2203
|
}
|
|
@@ -2217,17 +2217,17 @@ var Jt = {}, wx = {
|
|
|
2217
2217
|
function w0(u, p, m) {
|
|
2218
2218
|
u.multiplyTo(p, m), this.reduce(m);
|
|
2219
2219
|
}
|
|
2220
|
-
T0.prototype.convert = st, T0.prototype.revert =
|
|
2220
|
+
T0.prototype.convert = st, T0.prototype.revert = Nt, T0.prototype.reduce = pt, T0.prototype.mulTo = w0, T0.prototype.sqrTo = O0;
|
|
2221
2221
|
function bt() {
|
|
2222
2222
|
return (this.t > 0 ? this[0] & 1 : this.s) == 0;
|
|
2223
2223
|
}
|
|
2224
2224
|
function it(u, p) {
|
|
2225
2225
|
if (u > 4294967295 || u < 1)
|
|
2226
2226
|
return i.ONE;
|
|
2227
|
-
var m = o(), D = o(),
|
|
2228
|
-
for (
|
|
2227
|
+
var m = o(), D = o(), I = p.convert(this), $ = C(u) - 1;
|
|
2228
|
+
for (I.copyTo(m); --$ >= 0; )
|
|
2229
2229
|
if (p.sqrTo(m, D), (u & 1 << $) > 0)
|
|
2230
|
-
p.mulTo(D,
|
|
2230
|
+
p.mulTo(D, I, m);
|
|
2231
2231
|
else {
|
|
2232
2232
|
var W = m;
|
|
2233
2233
|
m = D, D = W;
|
|
@@ -2238,12 +2238,12 @@ var Jt = {}, wx = {
|
|
|
2238
2238
|
var m;
|
|
2239
2239
|
return u < 256 || p.isEven() ? m = new z(p) : m = new T0(p), this.exp(u, m);
|
|
2240
2240
|
}
|
|
2241
|
-
i.prototype.copyTo = g, i.prototype.fromInt =
|
|
2241
|
+
i.prototype.copyTo = g, i.prototype.fromInt = E, i.prototype.fromString = F, i.prototype.clamp = _, i.prototype.dlShiftTo = L, i.prototype.drShiftTo = Q, i.prototype.lShiftTo = J, i.prototype.rShiftTo = r0, i.prototype.subTo = l0, i.prototype.multiplyTo = Y, i.prototype.squareTo = h0, i.prototype.divRemTo = a0, i.prototype.invDigit = e0, i.prototype.isEven = bt, i.prototype.exp = it, i.prototype.toString = S, i.prototype.negate = R, i.prototype.abs = q, i.prototype.compareTo = w, i.prototype.bitLength = N, i.prototype.mod = O, i.prototype.modPowInt = vt, i.ZERO = b(0), i.ONE = b(1);
|
|
2242
2242
|
function ot() {
|
|
2243
2243
|
var u = o();
|
|
2244
2244
|
return this.copyTo(u), u;
|
|
2245
2245
|
}
|
|
2246
|
-
function
|
|
2246
|
+
function Zt() {
|
|
2247
2247
|
if (this.s < 0) {
|
|
2248
2248
|
if (this.t == 1)
|
|
2249
2249
|
return this[0] - this.DV;
|
|
@@ -2260,7 +2260,7 @@ var Jt = {}, wx = {
|
|
|
2260
2260
|
function At() {
|
|
2261
2261
|
return this.t == 0 ? this.s : this[0] << 24 >> 24;
|
|
2262
2262
|
}
|
|
2263
|
-
function
|
|
2263
|
+
function T() {
|
|
2264
2264
|
return this.t == 0 ? this.s : this[0] << 16 >> 16;
|
|
2265
2265
|
}
|
|
2266
2266
|
function H(u) {
|
|
@@ -2269,25 +2269,25 @@ var Jt = {}, wx = {
|
|
|
2269
2269
|
function k() {
|
|
2270
2270
|
return this.s < 0 ? -1 : this.t <= 0 || this.t == 1 && this[0] <= 0 ? 0 : 1;
|
|
2271
2271
|
}
|
|
2272
|
-
function
|
|
2272
|
+
function Z(u) {
|
|
2273
2273
|
if (u == null && (u = 10), this.signum() == 0 || u < 2 || u > 36)
|
|
2274
2274
|
return "0";
|
|
2275
|
-
var p = this.chunkSize(u), m = Math.pow(u, p), D = b(m),
|
|
2276
|
-
for (this.divRemTo(D,
|
|
2277
|
-
W = (m + $.intValue()).toString(u).substr(1) + W,
|
|
2275
|
+
var p = this.chunkSize(u), m = Math.pow(u, p), D = b(m), I = o(), $ = o(), W = "";
|
|
2276
|
+
for (this.divRemTo(D, I, $); I.signum() > 0; )
|
|
2277
|
+
W = (m + $.intValue()).toString(u).substr(1) + W, I.divRemTo(D, I, $);
|
|
2278
2278
|
return $.intValue().toString(u) + W;
|
|
2279
2279
|
}
|
|
2280
2280
|
function V(u, p) {
|
|
2281
2281
|
this.fromInt(0), p == null && (p = 10);
|
|
2282
|
-
for (var m = this.chunkSize(p), D = Math.pow(p, m),
|
|
2282
|
+
for (var m = this.chunkSize(p), D = Math.pow(p, m), I = !1, $ = 0, W = 0, G = 0; G < u.length; ++G) {
|
|
2283
2283
|
var v0 = A(u, G);
|
|
2284
2284
|
if (v0 < 0) {
|
|
2285
|
-
u.charAt(G) == "-" && this.signum() == 0 && (
|
|
2285
|
+
u.charAt(G) == "-" && this.signum() == 0 && (I = !0);
|
|
2286
2286
|
continue;
|
|
2287
2287
|
}
|
|
2288
2288
|
W = p * W + v0, ++$ >= m && (this.dMultiply(D), this.dAddOffset(W, 0), $ = 0, W = 0);
|
|
2289
2289
|
}
|
|
2290
|
-
$ > 0 && (this.dMultiply(Math.pow(p, $)), this.dAddOffset(W, 0)),
|
|
2290
|
+
$ > 0 && (this.dMultiply(Math.pow(p, $)), this.dAddOffset(W, 0)), I && i.ZERO.subTo(this, this);
|
|
2291
2291
|
}
|
|
2292
2292
|
function t0(u, p, m) {
|
|
2293
2293
|
if (typeof p == "number")
|
|
@@ -2297,17 +2297,17 @@ var Jt = {}, wx = {
|
|
|
2297
2297
|
for (this.fromNumber(u, m), this.testBit(u - 1) || this.bitwiseTo(i.ONE.shiftLeft(u - 1), at, this), this.isEven() && this.dAddOffset(1, 0); !this.isProbablePrime(p); )
|
|
2298
2298
|
this.dAddOffset(2, 0), this.bitLength() > u && this.subTo(i.ONE.shiftLeft(u - 1), this);
|
|
2299
2299
|
else {
|
|
2300
|
-
var D = new Array(),
|
|
2301
|
-
D.length = (u >> 3) + 1, p.nextBytes(D),
|
|
2300
|
+
var D = new Array(), I = u & 7;
|
|
2301
|
+
D.length = (u >> 3) + 1, p.nextBytes(D), I > 0 ? D[0] &= (1 << I) - 1 : D[0] = 0, this.fromString(D, 256);
|
|
2302
2302
|
}
|
|
2303
2303
|
}
|
|
2304
2304
|
function x0() {
|
|
2305
2305
|
var u = this.t, p = new Array();
|
|
2306
2306
|
p[0] = this.s;
|
|
2307
|
-
var m = this.DB - u * this.DB % 8, D,
|
|
2307
|
+
var m = this.DB - u * this.DB % 8, D, I = 0;
|
|
2308
2308
|
if (u-- > 0)
|
|
2309
|
-
for (m < this.DB && (D = this[u] >> m) != (this.s & this.DM) >> m && (p[
|
|
2310
|
-
m < 8 ? (D = (this[u] & (1 << m) - 1) << 8 - m, D |= this[--u] >> (m += this.DB - 8)) : (D = this[u] >> (m -= 8) & 255, m <= 0 && (m += this.DB, --u)), D & 128 && (D |= -256),
|
|
2309
|
+
for (m < this.DB && (D = this[u] >> m) != (this.s & this.DM) >> m && (p[I++] = D | this.s << this.DB - m); u >= 0; )
|
|
2310
|
+
m < 8 ? (D = (this[u] & (1 << m) - 1) << 8 - m, D |= this[--u] >> (m += this.DB - 8)) : (D = this[u] >> (m -= 8) & 255, m <= 0 && (m += this.DB, --u)), D & 128 && (D |= -256), I == 0 && (this.s & 128) != (D & 128) && ++I, (I > 0 || D != this.s) && (p[I++] = D);
|
|
2311
2311
|
return p;
|
|
2312
2312
|
}
|
|
2313
2313
|
function f0(u) {
|
|
@@ -2320,47 +2320,47 @@ var Jt = {}, wx = {
|
|
|
2320
2320
|
return this.compareTo(u) > 0 ? this : u;
|
|
2321
2321
|
}
|
|
2322
2322
|
function g0(u, p, m) {
|
|
2323
|
-
var D,
|
|
2323
|
+
var D, I, $ = Math.min(u.t, this.t);
|
|
2324
2324
|
for (D = 0; D < $; ++D)
|
|
2325
2325
|
m[D] = p(this[D], u[D]);
|
|
2326
2326
|
if (u.t < this.t) {
|
|
2327
|
-
for (
|
|
2328
|
-
m[D] = p(this[D],
|
|
2327
|
+
for (I = u.s & this.DM, D = $; D < this.t; ++D)
|
|
2328
|
+
m[D] = p(this[D], I);
|
|
2329
2329
|
m.t = this.t;
|
|
2330
2330
|
} else {
|
|
2331
|
-
for (
|
|
2332
|
-
m[D] = p(
|
|
2331
|
+
for (I = this.s & this.DM, D = $; D < u.t; ++D)
|
|
2332
|
+
m[D] = p(I, u[D]);
|
|
2333
2333
|
m.t = u.t;
|
|
2334
2334
|
}
|
|
2335
2335
|
m.s = p(this.s, u.s), m.clamp();
|
|
2336
2336
|
}
|
|
2337
|
-
function
|
|
2337
|
+
function N0(u, p) {
|
|
2338
2338
|
return u & p;
|
|
2339
2339
|
}
|
|
2340
2340
|
function Bt(u) {
|
|
2341
2341
|
var p = o();
|
|
2342
|
-
return this.bitwiseTo(u,
|
|
2342
|
+
return this.bitwiseTo(u, N0, p), p;
|
|
2343
2343
|
}
|
|
2344
2344
|
function at(u, p) {
|
|
2345
2345
|
return u | p;
|
|
2346
2346
|
}
|
|
2347
|
-
function
|
|
2347
|
+
function Ft(u) {
|
|
2348
2348
|
var p = o();
|
|
2349
2349
|
return this.bitwiseTo(u, at, p), p;
|
|
2350
2350
|
}
|
|
2351
|
-
function
|
|
2351
|
+
function Kt(u, p) {
|
|
2352
2352
|
return u ^ p;
|
|
2353
2353
|
}
|
|
2354
2354
|
function $r(u) {
|
|
2355
2355
|
var p = o();
|
|
2356
|
-
return this.bitwiseTo(u,
|
|
2356
|
+
return this.bitwiseTo(u, Kt, p), p;
|
|
2357
2357
|
}
|
|
2358
|
-
function
|
|
2358
|
+
function ie(u, p) {
|
|
2359
2359
|
return u & ~p;
|
|
2360
2360
|
}
|
|
2361
2361
|
function Mr(u) {
|
|
2362
2362
|
var p = o();
|
|
2363
|
-
return this.bitwiseTo(u,
|
|
2363
|
+
return this.bitwiseTo(u, ie, p), p;
|
|
2364
2364
|
}
|
|
2365
2365
|
function me() {
|
|
2366
2366
|
for (var u = o(), p = 0; p < this.t; ++p)
|
|
@@ -2409,13 +2409,13 @@ var Jt = {}, wx = {
|
|
|
2409
2409
|
return this.changeBit(u, at);
|
|
2410
2410
|
}
|
|
2411
2411
|
function Qr(u) {
|
|
2412
|
-
return this.changeBit(u,
|
|
2412
|
+
return this.changeBit(u, ie);
|
|
2413
2413
|
}
|
|
2414
2414
|
function Ce(u) {
|
|
2415
|
-
return this.changeBit(u,
|
|
2415
|
+
return this.changeBit(u, Kt);
|
|
2416
2416
|
}
|
|
2417
2417
|
function P0(u, p) {
|
|
2418
|
-
for (var m = 0, D = 0,
|
|
2418
|
+
for (var m = 0, D = 0, I = Math.min(u.t, this.t); m < I; )
|
|
2419
2419
|
D += this[m] + u[m], p[m++] = D & this.DM, D >>= this.DB;
|
|
2420
2420
|
if (u.t < this.t) {
|
|
2421
2421
|
for (D += u.s; m < this.t; )
|
|
@@ -2467,7 +2467,7 @@ var Jt = {}, wx = {
|
|
|
2467
2467
|
this[p] -= this.DV, ++p >= this.t && (this[this.t++] = 0), ++this[p];
|
|
2468
2468
|
}
|
|
2469
2469
|
}
|
|
2470
|
-
function
|
|
2470
|
+
function oe() {
|
|
2471
2471
|
}
|
|
2472
2472
|
function Mn(u) {
|
|
2473
2473
|
return u;
|
|
@@ -2478,18 +2478,18 @@ var Jt = {}, wx = {
|
|
|
2478
2478
|
function Po(u, p) {
|
|
2479
2479
|
u.squareTo(p);
|
|
2480
2480
|
}
|
|
2481
|
-
|
|
2481
|
+
oe.prototype.convert = Mn, oe.prototype.revert = Mn, oe.prototype.mulTo = Oo, oe.prototype.sqrTo = Po;
|
|
2482
2482
|
function Ho(u) {
|
|
2483
|
-
return this.exp(u, new
|
|
2483
|
+
return this.exp(u, new oe());
|
|
2484
2484
|
}
|
|
2485
2485
|
function Io(u, p, m) {
|
|
2486
2486
|
var D = Math.min(this.t + u.t, p);
|
|
2487
2487
|
for (m.s = 0, m.t = D; D > 0; )
|
|
2488
2488
|
m[--D] = 0;
|
|
2489
|
-
var
|
|
2490
|
-
for (
|
|
2489
|
+
var I;
|
|
2490
|
+
for (I = m.t - this.t; D < I; ++D)
|
|
2491
2491
|
m[D + this.t] = this.am(0, u[D], m, D, 0, this.t);
|
|
2492
|
-
for (
|
|
2492
|
+
for (I = Math.min(u.t, p); D < I; ++D)
|
|
2493
2493
|
this.am(0, u[D], m, D, 0, p - D);
|
|
2494
2494
|
m.clamp();
|
|
2495
2495
|
}
|
|
@@ -2502,7 +2502,7 @@ var Jt = {}, wx = {
|
|
|
2502
2502
|
m[this.t + D - p] = this.am(p - D, u[D], m, 0, 0, this.t + D - p);
|
|
2503
2503
|
m.clamp(), m.drShiftTo(1, m);
|
|
2504
2504
|
}
|
|
2505
|
-
function
|
|
2505
|
+
function Lt(u) {
|
|
2506
2506
|
this.r2 = o(), this.q3 = o(), i.ONE.dlShiftTo(2 * u.t, this.r2), this.mu = this.r2.divide(u), this.m = u;
|
|
2507
2507
|
}
|
|
2508
2508
|
function No(u) {
|
|
@@ -2528,33 +2528,33 @@ var Jt = {}, wx = {
|
|
|
2528
2528
|
function $o(u, p, m) {
|
|
2529
2529
|
u.multiplyTo(p, m), this.reduce(m);
|
|
2530
2530
|
}
|
|
2531
|
-
|
|
2531
|
+
Lt.prototype.convert = No, Lt.prototype.revert = Lo, Lt.prototype.reduce = zo, Lt.prototype.mulTo = $o, Lt.prototype.sqrTo = Uo;
|
|
2532
2532
|
function Mo(u, p) {
|
|
2533
|
-
var m = u.bitLength(), D,
|
|
2533
|
+
var m = u.bitLength(), D, I = b(1), $;
|
|
2534
2534
|
if (m <= 0)
|
|
2535
|
-
return
|
|
2536
|
-
m < 18 ? D = 1 : m < 48 ? D = 3 : m < 144 ? D = 4 : m < 768 ? D = 5 : D = 6, m < 8 ? $ = new z(p) : p.isEven() ? $ = new
|
|
2535
|
+
return I;
|
|
2536
|
+
m < 18 ? D = 1 : m < 48 ? D = 3 : m < 144 ? D = 4 : m < 768 ? D = 5 : D = 6, m < 8 ? $ = new z(p) : p.isEven() ? $ = new Lt(p) : $ = new T0(p);
|
|
2537
2537
|
var W = new Array(), G = 3, v0 = D - 1, C0 = (1 << D) - 1;
|
|
2538
2538
|
if (W[1] = $.convert(this), D > 1) {
|
|
2539
2539
|
var j0 = o();
|
|
2540
2540
|
for ($.sqrTo(W[1], j0); G <= C0; )
|
|
2541
2541
|
W[G] = o(), $.mulTo(j0, W[G - 2], W[G]), G += 2;
|
|
2542
2542
|
}
|
|
2543
|
-
var
|
|
2544
|
-
for (m = C(u[
|
|
2545
|
-
for (m >= v0 ? gt = u[
|
|
2543
|
+
var z0 = u.t - 1, gt, _e = !0, Y0 = o(), J0;
|
|
2544
|
+
for (m = C(u[z0]) - 1; z0 >= 0; ) {
|
|
2545
|
+
for (m >= v0 ? gt = u[z0] >> m - v0 & C0 : (gt = (u[z0] & (1 << m + 1) - 1) << v0 - m, z0 > 0 && (gt |= u[z0 - 1] >> this.DB + m - v0)), G = D; !(gt & 1); )
|
|
2546
2546
|
gt >>= 1, --G;
|
|
2547
|
-
if ((m -= G) < 0 && (m += this.DB, --
|
|
2548
|
-
W[gt].copyTo(
|
|
2547
|
+
if ((m -= G) < 0 && (m += this.DB, --z0), _e)
|
|
2548
|
+
W[gt].copyTo(I), _e = !1;
|
|
2549
2549
|
else {
|
|
2550
2550
|
for (; G > 1; )
|
|
2551
|
-
$.sqrTo(
|
|
2552
|
-
G > 0 ? $.sqrTo(
|
|
2551
|
+
$.sqrTo(I, Y0), $.sqrTo(Y0, I), G -= 2;
|
|
2552
|
+
G > 0 ? $.sqrTo(I, Y0) : (J0 = I, I = Y0, Y0 = J0), $.mulTo(Y0, W[gt], I);
|
|
2553
2553
|
}
|
|
2554
|
-
for (;
|
|
2555
|
-
$.sqrTo(
|
|
2554
|
+
for (; z0 >= 0 && !(u[z0] & 1 << m); )
|
|
2555
|
+
$.sqrTo(I, Y0), J0 = I, I = Y0, Y0 = J0, --m < 0 && (m = this.DB - 1, --z0);
|
|
2556
2556
|
}
|
|
2557
|
-
return $.revert(
|
|
2557
|
+
return $.revert(I);
|
|
2558
2558
|
}
|
|
2559
2559
|
function jo(u) {
|
|
2560
2560
|
var p = this.s < 0 ? this.negate() : this.clone(), m = u.s < 0 ? u.negate() : u.clone();
|
|
@@ -2562,11 +2562,11 @@ var Jt = {}, wx = {
|
|
|
2562
2562
|
var D = p;
|
|
2563
2563
|
p = m, m = D;
|
|
2564
2564
|
}
|
|
2565
|
-
var
|
|
2565
|
+
var I = p.getLowestSetBit(), $ = m.getLowestSetBit();
|
|
2566
2566
|
if ($ < 0)
|
|
2567
2567
|
return p;
|
|
2568
|
-
for (
|
|
2569
|
-
(
|
|
2568
|
+
for (I < $ && ($ = I), $ > 0 && (p.rShiftTo($, p), m.rShiftTo($, m)); p.signum() > 0; )
|
|
2569
|
+
(I = p.getLowestSetBit()) > 0 && p.rShiftTo(I, p), (I = m.getLowestSetBit()) > 0 && m.rShiftTo(I, m), p.compareTo(m) >= 0 ? (p.subTo(m, p), p.rShiftTo(1, p)) : (m.subTo(p, m), m.rShiftTo(1, m));
|
|
2570
2570
|
return $ > 0 && m.lShiftTo($, m), m;
|
|
2571
2571
|
}
|
|
2572
2572
|
function Wo(u) {
|
|
@@ -2585,12 +2585,12 @@ var Jt = {}, wx = {
|
|
|
2585
2585
|
var p = u.isEven();
|
|
2586
2586
|
if (this.isEven() && p || u.signum() == 0)
|
|
2587
2587
|
return i.ZERO;
|
|
2588
|
-
for (var m = u.clone(), D = this.clone(),
|
|
2588
|
+
for (var m = u.clone(), D = this.clone(), I = b(1), $ = b(0), W = b(0), G = b(1); m.signum() != 0; ) {
|
|
2589
2589
|
for (; m.isEven(); )
|
|
2590
|
-
m.rShiftTo(1, m), p ? ((!
|
|
2590
|
+
m.rShiftTo(1, m), p ? ((!I.isEven() || !$.isEven()) && (I.addTo(this, I), $.subTo(u, $)), I.rShiftTo(1, I)) : $.isEven() || $.subTo(u, $), $.rShiftTo(1, $);
|
|
2591
2591
|
for (; D.isEven(); )
|
|
2592
2592
|
D.rShiftTo(1, D), p ? ((!W.isEven() || !G.isEven()) && (W.addTo(this, W), G.subTo(u, G)), W.rShiftTo(1, W)) : G.isEven() || G.subTo(u, G), G.rShiftTo(1, G);
|
|
2593
|
-
m.compareTo(D) >= 0 ? (m.subTo(D, m), p &&
|
|
2593
|
+
m.compareTo(D) >= 0 ? (m.subTo(D, m), p && I.subTo(W, I), $.subTo(G, $)) : (D.subTo(m, D), p && W.subTo(I, W), G.subTo($, G));
|
|
2594
2594
|
}
|
|
2595
2595
|
if (D.compareTo(i.ONE) != 0)
|
|
2596
2596
|
return i.ZERO;
|
|
@@ -2614,9 +2614,9 @@ var Jt = {}, wx = {
|
|
|
2614
2614
|
if (m.isEven())
|
|
2615
2615
|
return !1;
|
|
2616
2616
|
for (p = 1; p < H0.length; ) {
|
|
2617
|
-
for (var D = H0[p],
|
|
2618
|
-
D *= H0[
|
|
2619
|
-
for (D = m.modInt(D); p <
|
|
2617
|
+
for (var D = H0[p], I = p + 1; I < H0.length && D < Ko; )
|
|
2618
|
+
D *= H0[I++];
|
|
2619
|
+
for (D = m.modInt(D); p < I; )
|
|
2620
2620
|
if (D % H0[p++] == 0)
|
|
2621
2621
|
return !1;
|
|
2622
2622
|
}
|
|
@@ -2628,9 +2628,9 @@ var Jt = {}, wx = {
|
|
|
2628
2628
|
return !1;
|
|
2629
2629
|
var D = p.shiftRight(m);
|
|
2630
2630
|
u = u + 1 >> 1, u > H0.length && (u = H0.length);
|
|
2631
|
-
for (var
|
|
2632
|
-
|
|
2633
|
-
var W =
|
|
2631
|
+
for (var I = o(), $ = 0; $ < u; ++$) {
|
|
2632
|
+
I.fromInt(H0[Math.floor(Math.random() * H0.length)]);
|
|
2633
|
+
var W = I.modPow(D, this);
|
|
2634
2634
|
if (W.compareTo(i.ONE) != 0 && W.compareTo(p) != 0) {
|
|
2635
2635
|
for (var G = 1; G++ < m && W.compareTo(p) != 0; )
|
|
2636
2636
|
if (W = W.modPowInt(2, this), W.compareTo(i.ONE) == 0)
|
|
@@ -2641,36 +2641,36 @@ var Jt = {}, wx = {
|
|
|
2641
2641
|
}
|
|
2642
2642
|
return !0;
|
|
2643
2643
|
}
|
|
2644
|
-
i.prototype.chunkSize = H, i.prototype.toRadix =
|
|
2645
|
-
var we,
|
|
2644
|
+
i.prototype.chunkSize = H, i.prototype.toRadix = Z, i.prototype.fromRadix = V, i.prototype.fromNumber = t0, i.prototype.bitwiseTo = g0, i.prototype.changeBit = Xr, i.prototype.addTo = P0, i.prototype.dMultiply = Ro, i.prototype.dAddOffset = ko, i.prototype.multiplyLowerTo = Io, i.prototype.multiplyUpperTo = qo, i.prototype.modInt = Wo, i.prototype.millerRabin = Xo, i.prototype.clone = ot, i.prototype.intValue = Zt, i.prototype.byteValue = At, i.prototype.shortValue = T, i.prototype.signum = k, i.prototype.toByteArray = x0, i.prototype.equals = f0, i.prototype.min = _0, i.prototype.max = y0, i.prototype.and = Bt, i.prototype.or = Ft, i.prototype.xor = $r, i.prototype.andNot = Mr, i.prototype.not = me, i.prototype.shiftLeft = jr, i.prototype.shiftRight = be, i.prototype.getLowestSetBit = Zr, i.prototype.bitCount = Ae, i.prototype.testBit = Gr, i.prototype.setBit = Fe, i.prototype.clearBit = Qr, i.prototype.flipBit = Ce, i.prototype.add = ct, i.prototype.subtract = De, i.prototype.multiply = Vr, i.prototype.divide = _o, i.prototype.remainder = So, i.prototype.divideAndRemainder = To, i.prototype.modPow = Mo, i.prototype.modInverse = Zo, i.prototype.pow = Ho, i.prototype.gcd = jo, i.prototype.isProbablePrime = Go, i.prototype.square = wo, i.prototype.Barrett = Lt;
|
|
2645
|
+
var we, L0, F0;
|
|
2646
2646
|
function Qo(u) {
|
|
2647
|
-
|
|
2647
|
+
L0[F0++] ^= u & 255, L0[F0++] ^= u >> 8 & 255, L0[F0++] ^= u >> 16 & 255, L0[F0++] ^= u >> 24 & 255, F0 >= Jr && (F0 -= Jr);
|
|
2648
2648
|
}
|
|
2649
2649
|
function jn() {
|
|
2650
2650
|
Qo(new Date().getTime());
|
|
2651
2651
|
}
|
|
2652
|
-
if (
|
|
2653
|
-
|
|
2652
|
+
if (L0 == null) {
|
|
2653
|
+
L0 = new Array(), F0 = 0;
|
|
2654
2654
|
var V0;
|
|
2655
2655
|
if (typeof window < "u" && window.crypto) {
|
|
2656
2656
|
if (window.crypto.getRandomValues) {
|
|
2657
2657
|
var Wn = new Uint8Array(32);
|
|
2658
2658
|
for (window.crypto.getRandomValues(Wn), V0 = 0; V0 < 32; ++V0)
|
|
2659
|
-
|
|
2659
|
+
L0[F0++] = Wn[V0];
|
|
2660
2660
|
} else if (navigator.appName == "Netscape" && navigator.appVersion < "5") {
|
|
2661
2661
|
var Zn = window.crypto.random(32);
|
|
2662
2662
|
for (V0 = 0; V0 < Zn.length; ++V0)
|
|
2663
|
-
|
|
2663
|
+
L0[F0++] = Zn.charCodeAt(V0) & 255;
|
|
2664
2664
|
}
|
|
2665
2665
|
}
|
|
2666
2666
|
for (; F0 < Jr; )
|
|
2667
|
-
V0 = Math.floor(65536 * Math.random()),
|
|
2667
|
+
V0 = Math.floor(65536 * Math.random()), L0[F0++] = V0 >>> 8, L0[F0++] = V0 & 255;
|
|
2668
2668
|
F0 = 0, jn();
|
|
2669
2669
|
}
|
|
2670
2670
|
function Vo() {
|
|
2671
2671
|
if (we == null) {
|
|
2672
|
-
for (jn(), we = ea(), we.init(
|
|
2673
|
-
|
|
2672
|
+
for (jn(), we = ea(), we.init(L0), F0 = 0; F0 < L0.length; ++F0)
|
|
2673
|
+
L0[F0] = 0;
|
|
2674
2674
|
F0 = 0;
|
|
2675
2675
|
}
|
|
2676
2676
|
return we.next();
|
|
@@ -2710,7 +2710,7 @@ var Jt = {}, wx = {
|
|
|
2710
2710
|
};
|
|
2711
2711
|
}).call(s0);
|
|
2712
2712
|
})(wx);
|
|
2713
|
-
const { BigInteger:
|
|
2713
|
+
const { BigInteger: ee } = te;
|
|
2714
2714
|
function _x(t) {
|
|
2715
2715
|
let e = t.toString(16);
|
|
2716
2716
|
if (e[0] !== "-")
|
|
@@ -2722,7 +2722,7 @@ function _x(t) {
|
|
|
2722
2722
|
let n = "";
|
|
2723
2723
|
for (let s = 0; s < r; s++)
|
|
2724
2724
|
n += "f";
|
|
2725
|
-
n = new
|
|
2725
|
+
n = new ee(n, 16), e = n.xor(t).add(ee.ONE), e = e.toString(16).replace(/^-/, "");
|
|
2726
2726
|
}
|
|
2727
2727
|
return e;
|
|
2728
2728
|
}
|
|
@@ -2766,7 +2766,7 @@ function Ui(t, e) {
|
|
|
2766
2766
|
}
|
|
2767
2767
|
function as(t, e) {
|
|
2768
2768
|
const r = Ui(t, e), n = t.substr(e + 2, r * 2);
|
|
2769
|
-
return n ? (+n[0] < 8 ? new
|
|
2769
|
+
return n ? (+n[0] < 8 ? new ee(n, 16) : new ee(n.substr(2), 16)).intValue() : -1;
|
|
2770
2770
|
}
|
|
2771
2771
|
function un(t, e) {
|
|
2772
2772
|
const r = Ui(t, e);
|
|
@@ -2784,12 +2784,12 @@ var Tx = {
|
|
|
2784
2784
|
* 解析 ASN.1 der,针对 sm2 验签
|
|
2785
2785
|
*/
|
|
2786
2786
|
decodeDer(t) {
|
|
2787
|
-
const e = un(t, 0), r = un(t, e), n = as(t, e), s = t.substr(r, n * 2), i = r + s.length, o = un(t, i), a = as(t, i), B = t.substr(o, a * 2), c = new
|
|
2787
|
+
const e = un(t, 0), r = un(t, e), n = as(t, e), s = t.substr(r, n * 2), i = r + s.length, o = un(t, i), a = as(t, i), B = t.substr(o, a * 2), c = new ee(s, 16), x = new ee(B, 16);
|
|
2788
2788
|
return { r: c, s: x };
|
|
2789
2789
|
}
|
|
2790
2790
|
};
|
|
2791
|
-
const { BigInteger:
|
|
2792
|
-
class
|
|
2791
|
+
const { BigInteger: q0 } = te, cs = new q0("2"), xs = new q0("3");
|
|
2792
|
+
class Tt {
|
|
2793
2793
|
constructor(e, r) {
|
|
2794
2794
|
this.x = r, this.q = e;
|
|
2795
2795
|
}
|
|
@@ -2809,42 +2809,42 @@ class St {
|
|
|
2809
2809
|
* 取反
|
|
2810
2810
|
*/
|
|
2811
2811
|
negate() {
|
|
2812
|
-
return new
|
|
2812
|
+
return new Tt(this.q, this.x.negate().mod(this.q));
|
|
2813
2813
|
}
|
|
2814
2814
|
/**
|
|
2815
2815
|
* 相加
|
|
2816
2816
|
*/
|
|
2817
2817
|
add(e) {
|
|
2818
|
-
return new
|
|
2818
|
+
return new Tt(this.q, this.x.add(e.toBigInteger()).mod(this.q));
|
|
2819
2819
|
}
|
|
2820
2820
|
/**
|
|
2821
2821
|
* 相减
|
|
2822
2822
|
*/
|
|
2823
2823
|
subtract(e) {
|
|
2824
|
-
return new
|
|
2824
|
+
return new Tt(this.q, this.x.subtract(e.toBigInteger()).mod(this.q));
|
|
2825
2825
|
}
|
|
2826
2826
|
/**
|
|
2827
2827
|
* 相乘
|
|
2828
2828
|
*/
|
|
2829
2829
|
multiply(e) {
|
|
2830
|
-
return new
|
|
2830
|
+
return new Tt(this.q, this.x.multiply(e.toBigInteger()).mod(this.q));
|
|
2831
2831
|
}
|
|
2832
2832
|
/**
|
|
2833
2833
|
* 相除
|
|
2834
2834
|
*/
|
|
2835
2835
|
divide(e) {
|
|
2836
|
-
return new
|
|
2836
|
+
return new Tt(this.q, this.x.multiply(e.toBigInteger().modInverse(this.q)).mod(this.q));
|
|
2837
2837
|
}
|
|
2838
2838
|
/**
|
|
2839
2839
|
* 平方
|
|
2840
2840
|
*/
|
|
2841
2841
|
square() {
|
|
2842
|
-
return new
|
|
2842
|
+
return new Tt(this.q, this.x.square().mod(this.q));
|
|
2843
2843
|
}
|
|
2844
2844
|
}
|
|
2845
|
-
class
|
|
2845
|
+
class Ot {
|
|
2846
2846
|
constructor(e, r, n, s) {
|
|
2847
|
-
this.curve = e, this.x = r, this.y = n, this.z = s ??
|
|
2847
|
+
this.curve = e, this.x = r, this.y = n, this.z = s ?? q0.ONE, this.zinv = null;
|
|
2848
2848
|
}
|
|
2849
2849
|
getX() {
|
|
2850
2850
|
return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
|
|
@@ -2856,19 +2856,19 @@ class kt {
|
|
|
2856
2856
|
* 判断相等
|
|
2857
2857
|
*/
|
|
2858
2858
|
equals(e) {
|
|
2859
|
-
return e === this ? !0 : this.isInfinity() ? e.isInfinity() : e.isInfinity() ? this.isInfinity() : e.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(e.z)).mod(this.curve.q).equals(
|
|
2859
|
+
return e === this ? !0 : this.isInfinity() ? e.isInfinity() : e.isInfinity() ? this.isInfinity() : e.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(e.z)).mod(this.curve.q).equals(q0.ZERO) ? e.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(e.z)).mod(this.curve.q).equals(q0.ZERO) : !1;
|
|
2860
2860
|
}
|
|
2861
2861
|
/**
|
|
2862
2862
|
* 是否是无穷远点
|
|
2863
2863
|
*/
|
|
2864
2864
|
isInfinity() {
|
|
2865
|
-
return this.x === null && this.y === null ? !0 : this.z.equals(
|
|
2865
|
+
return this.x === null && this.y === null ? !0 : this.z.equals(q0.ZERO) && !this.y.toBigInteger().equals(q0.ZERO);
|
|
2866
2866
|
}
|
|
2867
2867
|
/**
|
|
2868
2868
|
* 取反,x 轴对称点
|
|
2869
2869
|
*/
|
|
2870
2870
|
negate() {
|
|
2871
|
-
return new
|
|
2871
|
+
return new Ot(this.curve, this.x, this.y.negate(), this.z);
|
|
2872
2872
|
}
|
|
2873
2873
|
/**
|
|
2874
2874
|
* 相加
|
|
@@ -2896,10 +2896,10 @@ class kt {
|
|
|
2896
2896
|
if (e.isInfinity())
|
|
2897
2897
|
return this;
|
|
2898
2898
|
const r = this.x.toBigInteger(), n = this.y.toBigInteger(), s = this.z, i = e.x.toBigInteger(), o = e.y.toBigInteger(), a = e.z, B = this.curve.q, c = r.multiply(a).mod(B), x = i.multiply(s).mod(B), d = c.subtract(x), h = n.multiply(a).mod(B), v = o.multiply(s).mod(B), f = h.subtract(v);
|
|
2899
|
-
if (
|
|
2900
|
-
return
|
|
2901
|
-
const l = c.add(x),
|
|
2902
|
-
return new
|
|
2899
|
+
if (q0.ZERO.equals(d))
|
|
2900
|
+
return q0.ZERO.equals(f) ? this.twice() : this.curve.infinity;
|
|
2901
|
+
const l = c.add(x), y = s.multiply(a).mod(B), A = d.square().mod(B), g = d.multiply(A).mod(B), E = y.multiply(f.square()).subtract(l.multiply(A)).mod(B), b = d.multiply(E).mod(B), F = f.multiply(A.multiply(c).subtract(E)).subtract(h.multiply(g)).mod(B), _ = g.multiply(y).mod(B);
|
|
2902
|
+
return new Ot(this.curve, this.curve.fromBigInteger(b), this.curve.fromBigInteger(F), _);
|
|
2903
2903
|
}
|
|
2904
2904
|
/**
|
|
2905
2905
|
* 自加
|
|
@@ -2922,7 +2922,7 @@ class kt {
|
|
|
2922
2922
|
if (!this.y.toBigInteger().signum())
|
|
2923
2923
|
return this.curve.infinity;
|
|
2924
2924
|
const e = this.x.toBigInteger(), r = this.y.toBigInteger(), n = this.z, s = this.curve.q, i = this.curve.a.toBigInteger(), o = e.square().multiply(xs).add(i.multiply(n.square())).mod(s), a = r.shiftLeft(1).multiply(n).mod(s), B = r.square().mod(s), c = B.multiply(e).multiply(n).mod(s), x = a.square().mod(s), d = o.square().subtract(c.shiftLeft(3)).mod(s), h = a.multiply(d).mod(s), v = o.multiply(c.shiftLeft(2).subtract(d)).subtract(x.shiftLeft(1).multiply(B)).mod(s), f = a.multiply(x).mod(s);
|
|
2925
|
-
return new
|
|
2925
|
+
return new Ot(this.curve, this.curve.fromBigInteger(h), this.curve.fromBigInteger(v), f);
|
|
2926
2926
|
}
|
|
2927
2927
|
/**
|
|
2928
2928
|
* 倍点计算
|
|
@@ -2944,7 +2944,7 @@ class kt {
|
|
|
2944
2944
|
}
|
|
2945
2945
|
let Rx = class {
|
|
2946
2946
|
constructor(e, r, n) {
|
|
2947
|
-
this.q = e, this.a = this.fromBigInteger(r), this.b = this.fromBigInteger(n), this.infinity = new
|
|
2947
|
+
this.q = e, this.a = this.fromBigInteger(r), this.b = this.fromBigInteger(n), this.infinity = new Ot(this, null, null);
|
|
2948
2948
|
}
|
|
2949
2949
|
/**
|
|
2950
2950
|
* 判断两个椭圆曲线是否相等
|
|
@@ -2956,7 +2956,7 @@ let Rx = class {
|
|
|
2956
2956
|
* 生成椭圆曲线域元素
|
|
2957
2957
|
*/
|
|
2958
2958
|
fromBigInteger(e) {
|
|
2959
|
-
return new
|
|
2959
|
+
return new Tt(this.q, e);
|
|
2960
2960
|
}
|
|
2961
2961
|
/**
|
|
2962
2962
|
* 解析 16 进制串为椭圆曲线点
|
|
@@ -2967,38 +2967,38 @@ let Rx = class {
|
|
|
2967
2967
|
return this.infinity;
|
|
2968
2968
|
case 2:
|
|
2969
2969
|
case 3:
|
|
2970
|
-
const r = this.fromBigInteger(new
|
|
2970
|
+
const r = this.fromBigInteger(new q0(e.substr(2), 16));
|
|
2971
2971
|
let n = this.fromBigInteger(r.multiply(r.square()).add(
|
|
2972
2972
|
r.multiply(this.a)
|
|
2973
2973
|
).add(this.b).toBigInteger().modPow(
|
|
2974
|
-
this.q.divide(new
|
|
2974
|
+
this.q.divide(new q0("4")).add(q0.ONE),
|
|
2975
2975
|
this.q
|
|
2976
2976
|
));
|
|
2977
|
-
return n.toBigInteger().mod(cs).equals(new
|
|
2977
|
+
return n.toBigInteger().mod(cs).equals(new q0(e.substr(0, 2), 16).subtract(cs)) || (n = n.negate()), new Ot(this, r, n);
|
|
2978
2978
|
case 4:
|
|
2979
2979
|
case 6:
|
|
2980
2980
|
case 7:
|
|
2981
2981
|
const s = (e.length - 2) / 2, i = e.substr(2, s), o = e.substr(s + 2, s);
|
|
2982
|
-
return new
|
|
2982
|
+
return new Ot(this, this.fromBigInteger(new q0(i, 16)), this.fromBigInteger(new q0(o, 16)));
|
|
2983
2983
|
default:
|
|
2984
2984
|
return null;
|
|
2985
2985
|
}
|
|
2986
2986
|
}
|
|
2987
2987
|
};
|
|
2988
2988
|
var kx = {
|
|
2989
|
-
ECPointFp:
|
|
2989
|
+
ECPointFp: Ot,
|
|
2990
2990
|
ECCurveFp: Rx
|
|
2991
2991
|
};
|
|
2992
|
-
const { BigInteger: nt, SecureRandom: Ox } =
|
|
2992
|
+
const { BigInteger: nt, SecureRandom: Ox } = te, { ECCurveFp: Px } = kx, Hx = new Ox(), { curve: Vt, G: Ix, n: fs } = $i();
|
|
2993
2993
|
function qx() {
|
|
2994
|
-
return
|
|
2994
|
+
return Vt;
|
|
2995
2995
|
}
|
|
2996
2996
|
function $i() {
|
|
2997
2997
|
const t = new nt("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), e = new nt("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), r = new nt("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), n = new Px(t, e, r), s = "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7", i = "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0", o = n.decodePointHex("04" + s + i), a = new nt("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
|
|
2998
2998
|
return { curve: n, G: o, n: a };
|
|
2999
2999
|
}
|
|
3000
3000
|
function Nx(t, e, r) {
|
|
3001
|
-
const s = (t ? new nt(t, e, r) : new nt(fs.bitLength(), Hx)).mod(fs.subtract(nt.ONE)).add(nt.ONE), i =
|
|
3001
|
+
const s = (t ? new nt(t, e, r) : new nt(fs.bitLength(), Hx)).mod(fs.subtract(nt.ONE)).add(nt.ONE), i = he(s.toString(16), 64), o = Ix.multiply(s), a = he(o.getX().toBigInteger().toString(16), 64), B = he(o.getY().toBigInteger().toString(16), 64), c = "04" + a + B;
|
|
3002
3002
|
return { privateKey: i, publicKey: c };
|
|
3003
3003
|
}
|
|
3004
3004
|
function Lx(t) {
|
|
@@ -3020,7 +3020,7 @@ function zx(t) {
|
|
|
3020
3020
|
}
|
|
3021
3021
|
return n.join("");
|
|
3022
3022
|
}
|
|
3023
|
-
function
|
|
3023
|
+
function he(t, e) {
|
|
3024
3024
|
return t.length >= e ? t : new Array(e - t.length + 1).join("0") + t;
|
|
3025
3025
|
}
|
|
3026
3026
|
function Ux(t) {
|
|
@@ -3045,23 +3045,23 @@ function $x(t) {
|
|
|
3045
3045
|
function Mx(t) {
|
|
3046
3046
|
const e = [];
|
|
3047
3047
|
let r = t.length;
|
|
3048
|
-
r % 2 !== 0 && (t =
|
|
3048
|
+
r % 2 !== 0 && (t = he(t, r + 1)), r = t.length;
|
|
3049
3049
|
for (let n = 0; n < r; n += 2)
|
|
3050
3050
|
e.push(parseInt(t.substr(n, 2), 16));
|
|
3051
3051
|
return e;
|
|
3052
3052
|
}
|
|
3053
3053
|
function jx(t) {
|
|
3054
|
-
const e =
|
|
3054
|
+
const e = Vt.decodePointHex(t);
|
|
3055
3055
|
if (!e)
|
|
3056
3056
|
return !1;
|
|
3057
3057
|
const r = e.getX();
|
|
3058
|
-
return e.getY().square().equals(r.multiply(r.square()).add(r.multiply(
|
|
3058
|
+
return e.getY().square().equals(r.multiply(r.square()).add(r.multiply(Vt.a)).add(Vt.b));
|
|
3059
3059
|
}
|
|
3060
3060
|
function Wx(t, e) {
|
|
3061
|
-
const r =
|
|
3061
|
+
const r = Vt.decodePointHex(t);
|
|
3062
3062
|
if (!r)
|
|
3063
3063
|
return !1;
|
|
3064
|
-
const n =
|
|
3064
|
+
const n = Vt.decodePointHex(e);
|
|
3065
3065
|
return n ? r.equals(n) : !1;
|
|
3066
3066
|
}
|
|
3067
3067
|
var Zx = {
|
|
@@ -3070,7 +3070,7 @@ var Zx = {
|
|
|
3070
3070
|
generateKeyPairHex: Nx,
|
|
3071
3071
|
compressPublicKeyHex: Lx,
|
|
3072
3072
|
utf8ToHex: zx,
|
|
3073
|
-
leftPad:
|
|
3073
|
+
leftPad: he,
|
|
3074
3074
|
arrayToHex: Ux,
|
|
3075
3075
|
arrayToUtf8: $x,
|
|
3076
3076
|
hexToArray: Mx,
|
|
@@ -3120,10 +3120,10 @@ function ze(t) {
|
|
|
3120
3120
|
for (let C = 0; C < 64; C++)
|
|
3121
3121
|
ln[C] = et[C] ^ et[C + 4];
|
|
3122
3122
|
const h = 2043430169, v = 2055708042;
|
|
3123
|
-
let f = B[0], l = B[1],
|
|
3123
|
+
let f = B[0], l = B[1], y = B[2], A = B[3], g = B[4], E = B[5], b = B[6], F = B[7], _, S, R, q, w;
|
|
3124
3124
|
for (let C = 0; C < 64; C++)
|
|
3125
|
-
w = C >= 0 && C <= 15 ? h : v, _ = Z0(Z0(f, 12) + g + Z0(w, C), 7), S = _ ^ Z0(f, 12),
|
|
3126
|
-
B[0] ^= f, B[1] ^= l, B[2] ^=
|
|
3125
|
+
w = C >= 0 && C <= 15 ? h : v, _ = Z0(Z0(f, 12) + g + Z0(w, C), 7), S = _ ^ Z0(f, 12), R = (C >= 0 && C <= 15 ? f ^ l ^ y : f & l | f & y | l & y) + A + S + ln[C], q = (C >= 0 && C <= 15 ? g ^ E ^ b : g & E | ~g & b) + F + _ + et[C], A = y, y = Z0(l, 9), l = f, f = R, F = b, b = Z0(E, 19), E = g, g = Kx(q);
|
|
3126
|
+
B[0] ^= f, B[1] ^= l, B[2] ^= y, B[3] ^= A, B[4] ^= g, B[5] ^= E, B[6] ^= b, B[7] ^= F;
|
|
3127
3127
|
}
|
|
3128
3128
|
const c = [];
|
|
3129
3129
|
for (let x = 0, d = B.length; x < d; x++) {
|
|
@@ -3132,11 +3132,11 @@ function ze(t) {
|
|
|
3132
3132
|
}
|
|
3133
3133
|
return c;
|
|
3134
3134
|
}
|
|
3135
|
-
const
|
|
3136
|
-
for (let t = 0; t <
|
|
3135
|
+
const Be = 64, Mi = new Uint8Array(Be), ji = new Uint8Array(Be);
|
|
3136
|
+
for (let t = 0; t < Be; t++)
|
|
3137
3137
|
Mi[t] = 54, ji[t] = 92;
|
|
3138
3138
|
function Xx(t, e) {
|
|
3139
|
-
for (e.length >
|
|
3139
|
+
for (e.length > Be && (e = ze(e)); e.length < Be; )
|
|
3140
3140
|
e.push(0);
|
|
3141
3141
|
const r = us(e, Mi), n = us(e, ji), s = ze([...r, ...t]);
|
|
3142
3142
|
return ze([...n, ...s]);
|
|
@@ -3145,20 +3145,20 @@ var Wi = {
|
|
|
3145
3145
|
sm3: ze,
|
|
3146
3146
|
hmac: Xx
|
|
3147
3147
|
};
|
|
3148
|
-
const { BigInteger: $0 } =
|
|
3148
|
+
const { BigInteger: $0 } = te, { encodeDer: Qx, decodeDer: Vx } = Tx, n0 = Zx, re = Wi.sm3, { G: Mt, curve: Zi, n: Gt } = n0.generateEcparam(), Ki = 0;
|
|
3149
3149
|
function Yx(t, e, r = 1) {
|
|
3150
3150
|
t = typeof t == "string" ? n0.hexToArray(n0.utf8ToHex(t)) : Array.prototype.slice.call(t), e = n0.getGlobalCurve().decodePointHex(e);
|
|
3151
3151
|
const n = n0.generateKeyPairHex(), s = new $0(n.privateKey, 16);
|
|
3152
3152
|
let i = n.publicKey;
|
|
3153
3153
|
i.length > 128 && (i = i.substr(i.length - 128));
|
|
3154
|
-
const o = e.multiply(s), a = n0.hexToArray(n0.leftPad(o.getX().toBigInteger().toRadix(16), 64)), B = n0.hexToArray(n0.leftPad(o.getY().toBigInteger().toRadix(16), 64)), c = n0.arrayToHex(
|
|
3154
|
+
const o = e.multiply(s), a = n0.hexToArray(n0.leftPad(o.getX().toBigInteger().toRadix(16), 64)), B = n0.hexToArray(n0.leftPad(o.getY().toBigInteger().toRadix(16), 64)), c = n0.arrayToHex(re([].concat(a, t, B)));
|
|
3155
3155
|
let x = 1, d = 0, h = [];
|
|
3156
3156
|
const v = [].concat(a, B), f = () => {
|
|
3157
|
-
h =
|
|
3157
|
+
h = re([...v, x >> 24 & 255, x >> 16 & 255, x >> 8 & 255, x & 255]), x++, d = 0;
|
|
3158
3158
|
};
|
|
3159
3159
|
f();
|
|
3160
|
-
for (let
|
|
3161
|
-
d === h.length && f(), t[
|
|
3160
|
+
for (let y = 0, A = t.length; y < A; y++)
|
|
3161
|
+
d === h.length && f(), t[y] ^= h[d++] & 255;
|
|
3162
3162
|
const l = n0.arrayToHex(t);
|
|
3163
3163
|
return r === Ki ? i + l + c : i + c + l;
|
|
3164
3164
|
}
|
|
@@ -3171,12 +3171,12 @@ function Jx(t, e, r = 1, {
|
|
|
3171
3171
|
const o = n0.hexToArray(i), B = n0.getGlobalCurve().decodePointHex("04" + t.substr(0, 128)).multiply(e), c = n0.hexToArray(n0.leftPad(B.getX().toBigInteger().toRadix(16), 64)), x = n0.hexToArray(n0.leftPad(B.getY().toBigInteger().toRadix(16), 64));
|
|
3172
3172
|
let d = 1, h = 0, v = [];
|
|
3173
3173
|
const f = [].concat(c, x), l = () => {
|
|
3174
|
-
v =
|
|
3174
|
+
v = re([...f, d >> 24 & 255, d >> 16 & 255, d >> 8 & 255, d & 255]), d++, h = 0;
|
|
3175
3175
|
};
|
|
3176
3176
|
l();
|
|
3177
3177
|
for (let A = 0, g = o.length; A < g; A++)
|
|
3178
3178
|
h === v.length && l(), o[A] ^= v[h++] & 255;
|
|
3179
|
-
return n0.arrayToHex(
|
|
3179
|
+
return n0.arrayToHex(re([].concat(c, o, x))) === s.toLowerCase() ? n === "array" ? o : n0.arrayToUtf8(o) : n === "array" ? [] : "";
|
|
3180
3180
|
}
|
|
3181
3181
|
function tf(t, e, {
|
|
3182
3182
|
pointPool: r,
|
|
@@ -3192,9 +3192,9 @@ function tf(t, e, {
|
|
|
3192
3192
|
do {
|
|
3193
3193
|
do {
|
|
3194
3194
|
let v;
|
|
3195
|
-
r && r.length ? v = r.pop() : v = Qi(), x = v.k, d = c.add(v.x1).mod(
|
|
3196
|
-
} while (d.equals($0.ZERO) || d.add(x).equals(
|
|
3197
|
-
h = B.add($0.ONE).modInverse(
|
|
3195
|
+
r && r.length ? v = r.pop() : v = Qi(), x = v.k, d = c.add(v.x1).mod(Gt);
|
|
3196
|
+
} while (d.equals($0.ZERO) || d.add(x).equals(Gt));
|
|
3197
|
+
h = B.add($0.ONE).modInverse(Gt).multiply(x.subtract(d.multiply(B))).mod(Gt);
|
|
3198
3198
|
} while (h.equals($0.ZERO));
|
|
3199
3199
|
return n ? Qx(d, h) : n0.leftPad(d.toString(16), 64) + n0.leftPad(h.toString(16), 64);
|
|
3200
3200
|
}
|
|
@@ -3207,29 +3207,29 @@ function ef(t, e, r, { der: n, hash: s, userId: i } = {}) {
|
|
|
3207
3207
|
a = f.r, B = f.s;
|
|
3208
3208
|
} else
|
|
3209
3209
|
a = new $0(e.substring(0, 64), 16), B = new $0(e.substring(64), 16);
|
|
3210
|
-
const c = Zi.decodePointHex(r), x = new $0(o, 16), d = a.add(B).mod(
|
|
3210
|
+
const c = Zi.decodePointHex(r), x = new $0(o, 16), d = a.add(B).mod(Gt);
|
|
3211
3211
|
if (d.equals($0.ZERO))
|
|
3212
3212
|
return !1;
|
|
3213
|
-
const h =
|
|
3213
|
+
const h = Mt.multiply(B).add(c.multiply(d)), v = x.add(h.getX().toBigInteger()).mod(Gt);
|
|
3214
3214
|
return a.equals(v);
|
|
3215
3215
|
}
|
|
3216
3216
|
function Gi(t, e, r = "1234567812345678") {
|
|
3217
3217
|
r = n0.utf8ToHex(r);
|
|
3218
|
-
const n = n0.leftPad(
|
|
3218
|
+
const n = n0.leftPad(Mt.curve.a.toBigInteger().toRadix(16), 64), s = n0.leftPad(Mt.curve.b.toBigInteger().toRadix(16), 64), i = n0.leftPad(Mt.getX().toBigInteger().toRadix(16), 64), o = n0.leftPad(Mt.getY().toBigInteger().toRadix(16), 64);
|
|
3219
3219
|
let a, B;
|
|
3220
3220
|
if (e.length === 128)
|
|
3221
3221
|
a = e.substr(0, 64), B = e.substr(64, 64);
|
|
3222
3222
|
else {
|
|
3223
|
-
const h =
|
|
3223
|
+
const h = Mt.curve.decodePointHex(e);
|
|
3224
3224
|
a = n0.leftPad(h.getX().toBigInteger().toRadix(16), 64), B = n0.leftPad(h.getY().toBigInteger().toRadix(16), 64);
|
|
3225
3225
|
}
|
|
3226
3226
|
const c = n0.hexToArray(r + n + s + i + o + a + B), x = r.length * 4;
|
|
3227
3227
|
c.unshift(x & 255), c.unshift(x >> 8 & 255);
|
|
3228
|
-
const d =
|
|
3229
|
-
return n0.arrayToHex(
|
|
3228
|
+
const d = re(c);
|
|
3229
|
+
return n0.arrayToHex(re(d.concat(n0.hexToArray(t))));
|
|
3230
3230
|
}
|
|
3231
3231
|
function Xi(t) {
|
|
3232
|
-
const e =
|
|
3232
|
+
const e = Mt.multiply(new $0(t, 16)), r = n0.leftPad(e.getX().toBigInteger().toString(16), 64), n = n0.leftPad(e.getY().toBigInteger().toString(16), 64);
|
|
3233
3233
|
return "04" + r + n;
|
|
3234
3234
|
}
|
|
3235
3235
|
function Qi() {
|
|
@@ -3291,7 +3291,7 @@ var xf = function(t, e) {
|
|
|
3291
3291
|
}
|
|
3292
3292
|
return ls(nf(t));
|
|
3293
3293
|
};
|
|
3294
|
-
const
|
|
3294
|
+
const wt = 0, ff = 32, zt = 16, Re = [
|
|
3295
3295
|
214,
|
|
3296
3296
|
144,
|
|
3297
3297
|
233,
|
|
@@ -3614,25 +3614,25 @@ function hf(t) {
|
|
|
3614
3614
|
t[r] >= 240 && t[r] <= 247 ? (e.push(String.fromCodePoint(((t[r] & 7) << 18) + ((t[r + 1] & 63) << 12) + ((t[r + 2] & 63) << 6) + (t[r + 3] & 63))), r += 3) : t[r] >= 224 && t[r] <= 239 ? (e.push(String.fromCodePoint(((t[r] & 15) << 12) + ((t[r + 1] & 63) << 6) + (t[r + 2] & 63))), r += 2) : t[r] >= 192 && t[r] <= 223 ? (e.push(String.fromCodePoint(((t[r] & 31) << 6) + (t[r + 1] & 63))), r++) : e.push(String.fromCodePoint(t[r]));
|
|
3615
3615
|
return e.join("");
|
|
3616
3616
|
}
|
|
3617
|
-
function
|
|
3617
|
+
function Xt(t, e) {
|
|
3618
3618
|
const r = e & 31;
|
|
3619
3619
|
return t << r | t >>> 32 - r;
|
|
3620
3620
|
}
|
|
3621
|
-
function
|
|
3621
|
+
function kt(t) {
|
|
3622
3622
|
return (Re[t >>> 24 & 255] & 255) << 24 | (Re[t >>> 16 & 255] & 255) << 16 | (Re[t >>> 8 & 255] & 255) << 8 | Re[t & 255] & 255;
|
|
3623
3623
|
}
|
|
3624
3624
|
function Oe(t) {
|
|
3625
|
-
return t ^
|
|
3625
|
+
return t ^ Xt(t, 2) ^ Xt(t, 10) ^ Xt(t, 18) ^ Xt(t, 24);
|
|
3626
3626
|
}
|
|
3627
3627
|
function Pe(t) {
|
|
3628
|
-
return t ^
|
|
3628
|
+
return t ^ Xt(t, 13) ^ Xt(t, 23);
|
|
3629
3629
|
}
|
|
3630
3630
|
function df(t, e, r) {
|
|
3631
3631
|
const n = new Array(4), s = new Array(4);
|
|
3632
3632
|
for (let i = 0; i < 4; i++)
|
|
3633
3633
|
s[0] = t[4 * i] & 255, s[1] = t[4 * i + 1] & 255, s[2] = t[4 * i + 2] & 255, s[3] = t[4 * i + 3] & 255, n[i] = s[0] << 24 | s[1] << 16 | s[2] << 8 | s[3];
|
|
3634
3634
|
for (let i = 0, o; i < 32; i += 4)
|
|
3635
|
-
o = n[1] ^ n[2] ^ n[3] ^ r[i + 0], n[0] ^= Oe(
|
|
3635
|
+
o = n[1] ^ n[2] ^ n[3] ^ r[i + 0], n[0] ^= Oe(kt(o)), o = n[2] ^ n[3] ^ n[0] ^ r[i + 1], n[1] ^= Oe(kt(o)), o = n[3] ^ n[0] ^ n[1] ^ r[i + 2], n[2] ^= Oe(kt(o)), o = n[0] ^ n[1] ^ n[2] ^ r[i + 3], n[3] ^= Oe(kt(o));
|
|
3636
3636
|
for (let i = 0; i < 16; i += 4)
|
|
3637
3637
|
e[i] = n[3 - i / 4] >>> 24 & 255, e[i + 1] = n[3 - i / 4] >>> 16 & 255, e[i + 2] = n[3 - i / 4] >>> 8 & 255, e[i + 3] = n[3 - i / 4] & 255;
|
|
3638
3638
|
}
|
|
@@ -3642,8 +3642,8 @@ function pf(t, e, r) {
|
|
|
3642
3642
|
s[0] = t[0 + 4 * i] & 255, s[1] = t[1 + 4 * i] & 255, s[2] = t[2 + 4 * i] & 255, s[3] = t[3 + 4 * i] & 255, n[i] = s[0] << 24 | s[1] << 16 | s[2] << 8 | s[3];
|
|
3643
3643
|
n[0] ^= 2746333894, n[1] ^= 1453994832, n[2] ^= 1736282519, n[3] ^= 2993693404;
|
|
3644
3644
|
for (let i = 0, o; i < 32; i += 4)
|
|
3645
|
-
o = n[1] ^ n[2] ^ n[3] ^ ke[i + 0], e[i + 0] = n[0] ^= Pe(
|
|
3646
|
-
if (r ===
|
|
3645
|
+
o = n[1] ^ n[2] ^ n[3] ^ ke[i + 0], e[i + 0] = n[0] ^= Pe(kt(o)), o = n[2] ^ n[3] ^ n[0] ^ ke[i + 1], e[i + 1] = n[1] ^= Pe(kt(o)), o = n[3] ^ n[0] ^ n[1] ^ ke[i + 2], e[i + 2] = n[2] ^= Pe(kt(o)), o = n[0] ^ n[1] ^ n[2] ^ ke[i + 3], e[i + 3] = n[3] ^= Pe(kt(o));
|
|
3646
|
+
if (r === wt)
|
|
3647
3647
|
for (let i = 0, o; i < 16; i++)
|
|
3648
3648
|
o = e[i], e[i] = e[31 - i], e[31 - i] = o;
|
|
3649
3649
|
}
|
|
@@ -3657,8 +3657,8 @@ function hs(t, e, r, {
|
|
|
3657
3657
|
throw new Error("iv is invalid");
|
|
3658
3658
|
if (typeof e == "string" && (e = hn(e)), e.length !== 128 / 8)
|
|
3659
3659
|
throw new Error("key is invalid");
|
|
3660
|
-
if (typeof t == "string" ? r !==
|
|
3661
|
-
const h =
|
|
3660
|
+
if (typeof t == "string" ? r !== wt ? t = lf(t) : t = hn(t) : t = [...t], (n === "pkcs#5" || n === "pkcs#7") && r !== wt) {
|
|
3661
|
+
const h = zt - t.length % zt;
|
|
3662
3662
|
for (let v = 0; v < h; v++)
|
|
3663
3663
|
t.push(h);
|
|
3664
3664
|
}
|
|
@@ -3666,24 +3666,24 @@ function hs(t, e, r, {
|
|
|
3666
3666
|
pf(e, a, r);
|
|
3667
3667
|
const B = [];
|
|
3668
3668
|
let c = i, x = t.length, d = 0;
|
|
3669
|
-
for (; x >=
|
|
3669
|
+
for (; x >= zt; ) {
|
|
3670
3670
|
const h = t.slice(d, d + 16), v = new Array(16);
|
|
3671
3671
|
if (s === "cbc")
|
|
3672
|
-
for (let f = 0; f <
|
|
3673
|
-
r !==
|
|
3672
|
+
for (let f = 0; f < zt; f++)
|
|
3673
|
+
r !== wt && (h[f] ^= c[f]);
|
|
3674
3674
|
df(h, v, a);
|
|
3675
|
-
for (let f = 0; f <
|
|
3676
|
-
s === "cbc" && r ===
|
|
3677
|
-
s === "cbc" && (r !==
|
|
3675
|
+
for (let f = 0; f < zt; f++)
|
|
3676
|
+
s === "cbc" && r === wt && (v[f] ^= c[f]), B[d + f] = v[f];
|
|
3677
|
+
s === "cbc" && (r !== wt ? c = v : c = h), x -= zt, d += zt;
|
|
3678
3678
|
}
|
|
3679
|
-
if ((n === "pkcs#5" || n === "pkcs#7") && r ===
|
|
3679
|
+
if ((n === "pkcs#5" || n === "pkcs#7") && r === wt) {
|
|
3680
3680
|
const h = B.length, v = B[h - 1];
|
|
3681
3681
|
for (let f = 1; f <= v; f++)
|
|
3682
3682
|
if (B[h - f] !== v)
|
|
3683
3683
|
throw new Error("padding is invalid");
|
|
3684
3684
|
B.splice(h - v, v);
|
|
3685
3685
|
}
|
|
3686
|
-
return o !== "array" ? r !==
|
|
3686
|
+
return o !== "array" ? r !== wt ? uf(B) : hf(B) : B;
|
|
3687
3687
|
}
|
|
3688
3688
|
var vf = {
|
|
3689
3689
|
encrypt(t, e, r) {
|
|
@@ -3714,10 +3714,10 @@ function gf(t, e) {
|
|
|
3714
3714
|
return null;
|
|
3715
3715
|
}
|
|
3716
3716
|
}
|
|
3717
|
-
const
|
|
3717
|
+
const ye = {
|
|
3718
3718
|
encrypt: Bf,
|
|
3719
3719
|
decrypt: gf
|
|
3720
|
-
}, Ef = "049967b032226da56be01b804ed59e6753e2731994f4c97bb25d39c0d3166af07b73e2651d09b98ae934a70303138e859545e8314e2eda20971e222a444ecd3547", yf = "1e38a5c42fe3049bfbbcb2323a0cff3feb49e0b8156ac71eed525133603dbddb", Yi = (t) => (Sr(t) && (t = M0(t)),
|
|
3720
|
+
}, Ef = "049967b032226da56be01b804ed59e6753e2731994f4c97bb25d39c0d3166af07b73e2651d09b98ae934a70303138e859545e8314e2eda20971e222a444ecd3547", yf = "1e38a5c42fe3049bfbbcb2323a0cff3feb49e0b8156ac71eed525133603dbddb", Yi = (t) => (Sr(t) && (t = M0(t)), ye.encrypt(t, Ef)), Ji = (t) => ye.decrypt(t, yf), to = (t) => `__${t}__mode`, mf = (t, e) => {
|
|
3721
3721
|
const r = Sr(e) ? 2 : 1;
|
|
3722
3722
|
r === 2 && (e = M0(e));
|
|
3723
3723
|
const n = Yi(e);
|
|
@@ -3727,11 +3727,11 @@ const Ee = {
|
|
|
3727
3727
|
};
|
|
3728
3728
|
}, eo = (t) => {
|
|
3729
3729
|
t || (t = window.location.href);
|
|
3730
|
-
const e =
|
|
3730
|
+
const e = Qt.getQueryParams(t);
|
|
3731
3731
|
if (!e)
|
|
3732
3732
|
return null;
|
|
3733
3733
|
const r = {};
|
|
3734
|
-
return
|
|
3734
|
+
return Pt(e).map((n) => {
|
|
3735
3735
|
let s = e[n];
|
|
3736
3736
|
const i = e[to(n)];
|
|
3737
3737
|
return i != null && (s = Ji(s), i == 2 && (s = Q0(s))), r[n] = s, s;
|
|
@@ -3755,7 +3755,7 @@ function ro() {
|
|
|
3755
3755
|
const B = i != null && i.target ? "_blank" : "_self", c = i != null && i.width && (i != null && i.height) ? `width=${i == null ? void 0 : i.width},height=${i == null ? void 0 : i.height}` : "";
|
|
3756
3756
|
o || (o = window);
|
|
3757
3757
|
var x = s;
|
|
3758
|
-
a && (x =
|
|
3758
|
+
a && (x = Qt.buildUrlByLocalQuery(s)), o == null || o.open(x, B, c);
|
|
3759
3759
|
},
|
|
3760
3760
|
disableFirefoxDefaultDrop: () => {
|
|
3761
3761
|
navigator.userAgent.toLowerCase().indexOf("firefox") !== -1 && (document.body.ondrop = function(i) {
|
|
@@ -3766,28 +3766,28 @@ function ro() {
|
|
|
3766
3766
|
}
|
|
3767
3767
|
const ds = {
|
|
3768
3768
|
info(t) {
|
|
3769
|
-
|
|
3769
|
+
fe({
|
|
3770
3770
|
type: "info",
|
|
3771
3771
|
message: t,
|
|
3772
3772
|
dangerouslyUseHTMLString: !0
|
|
3773
3773
|
});
|
|
3774
3774
|
},
|
|
3775
3775
|
error(t) {
|
|
3776
|
-
|
|
3776
|
+
fe({
|
|
3777
3777
|
type: "error",
|
|
3778
3778
|
message: t,
|
|
3779
3779
|
dangerouslyUseHTMLString: !0
|
|
3780
3780
|
});
|
|
3781
3781
|
},
|
|
3782
3782
|
success(t) {
|
|
3783
|
-
|
|
3783
|
+
fe({
|
|
3784
3784
|
type: "success",
|
|
3785
3785
|
message: t,
|
|
3786
3786
|
dangerouslyUseHTMLString: !0
|
|
3787
3787
|
});
|
|
3788
3788
|
},
|
|
3789
3789
|
warning(t) {
|
|
3790
|
-
|
|
3790
|
+
fe({
|
|
3791
3791
|
type: "warning",
|
|
3792
3792
|
message: t,
|
|
3793
3793
|
dangerouslyUseHTMLString: !0
|
|
@@ -3815,28 +3815,28 @@ const ds = {
|
|
|
3815
3815
|
}
|
|
3816
3816
|
}, Af = {
|
|
3817
3817
|
info(t) {
|
|
3818
|
-
|
|
3818
|
+
ue({
|
|
3819
3819
|
type: "info",
|
|
3820
3820
|
message: t,
|
|
3821
3821
|
dangerouslyUseHTMLString: !0
|
|
3822
3822
|
});
|
|
3823
3823
|
},
|
|
3824
3824
|
error(t) {
|
|
3825
|
-
|
|
3825
|
+
ue({
|
|
3826
3826
|
type: "error",
|
|
3827
3827
|
message: t,
|
|
3828
3828
|
dangerouslyUseHTMLString: !0
|
|
3829
3829
|
});
|
|
3830
3830
|
},
|
|
3831
3831
|
success(t) {
|
|
3832
|
-
|
|
3832
|
+
ue({
|
|
3833
3833
|
type: "success",
|
|
3834
3834
|
message: t,
|
|
3835
3835
|
dangerouslyUseHTMLString: !0
|
|
3836
3836
|
});
|
|
3837
3837
|
},
|
|
3838
3838
|
warning(t) {
|
|
3839
|
-
|
|
3839
|
+
ue({
|
|
3840
3840
|
type: "warning",
|
|
3841
3841
|
message: t,
|
|
3842
3842
|
dangerouslyUseHTMLString: !0
|
|
@@ -3854,87 +3854,87 @@ const ds = {
|
|
|
3854
3854
|
};
|
|
3855
3855
|
function Ff(t, e, r, n) {
|
|
3856
3856
|
var h, v;
|
|
3857
|
-
let s =
|
|
3857
|
+
let s = pe((h = t == null ? void 0 : t.content) == null ? void 0 : h.widgetId, !0), i = pe((v = t == null ? void 0 : t.content) == null ? void 0 : v.sourceId, !0);
|
|
3858
3858
|
if (!s || !i)
|
|
3859
3859
|
return null;
|
|
3860
3860
|
const o = () => new Promise((f, l) => {
|
|
3861
3861
|
var g;
|
|
3862
|
-
let
|
|
3862
|
+
let y = {};
|
|
3863
3863
|
if (!s || s.length <= 0) {
|
|
3864
|
-
f(
|
|
3864
|
+
f(y);
|
|
3865
3865
|
return;
|
|
3866
3866
|
}
|
|
3867
|
-
const A = (g = s == null ? void 0 : s.filter((
|
|
3867
|
+
const A = (g = s == null ? void 0 : s.filter((E) => {
|
|
3868
3868
|
var b;
|
|
3869
|
-
return !!((b = r == null ? void 0 : r.exposed) != null && b.findRefById(
|
|
3870
|
-
})) == null ? void 0 : g.map((
|
|
3869
|
+
return !!((b = r == null ? void 0 : r.exposed) != null && b.findRefById(E, r));
|
|
3870
|
+
})) == null ? void 0 : g.map((E) => {
|
|
3871
3871
|
var b;
|
|
3872
|
-
return (b = r == null ? void 0 : r.exposed) == null ? void 0 : b.findRefById(
|
|
3872
|
+
return (b = r == null ? void 0 : r.exposed) == null ? void 0 : b.findRefById(E, r);
|
|
3873
3873
|
});
|
|
3874
|
-
Promise.all(A == null ? void 0 : A.map((
|
|
3874
|
+
Promise.all(A == null ? void 0 : A.map((E) => {
|
|
3875
3875
|
var b;
|
|
3876
|
-
return (b =
|
|
3877
|
-
})).then((
|
|
3878
|
-
|
|
3879
|
-
b != null && b.isSuccess && (
|
|
3880
|
-
}), f(
|
|
3881
|
-
}).catch((
|
|
3876
|
+
return (b = E == null ? void 0 : E.exposed) == null ? void 0 : b.getValue(!0);
|
|
3877
|
+
})).then((E) => {
|
|
3878
|
+
E.forEach((b) => {
|
|
3879
|
+
b != null && b.isSuccess && (y = Object.assign({}, y, b == null ? void 0 : b.data));
|
|
3880
|
+
}), f(y);
|
|
3881
|
+
}).catch((E) => {
|
|
3882
3882
|
var F;
|
|
3883
|
-
const b = Array.isArray(
|
|
3884
|
-
Af.error(b || M0(
|
|
3883
|
+
const b = Array.isArray(E == null ? void 0 : E.message) ? (F = Array.from(E == null ? void 0 : E.message)) == null ? void 0 : F.map((_) => `<p class="pLine">${_}</p>`).join("") : E == null ? void 0 : E.message;
|
|
3884
|
+
Af.error(b || M0(E));
|
|
3885
3885
|
});
|
|
3886
3886
|
}), a = (f) => {
|
|
3887
|
-
var
|
|
3888
|
-
var l = (
|
|
3887
|
+
var y;
|
|
3888
|
+
var l = (y = t == null ? void 0 : t.content) == null ? void 0 : y.schemaParamName;
|
|
3889
3889
|
return l ? { [l]: f } : { _formData: f };
|
|
3890
|
-
}, B = (f, l,
|
|
3890
|
+
}, B = (f, l, y) => {
|
|
3891
3891
|
if (!f)
|
|
3892
|
-
return
|
|
3892
|
+
return y;
|
|
3893
3893
|
const A = Ze(r);
|
|
3894
|
-
return
|
|
3895
|
-
formData:
|
|
3894
|
+
return It(f, {
|
|
3895
|
+
formData: y || (A == null ? void 0 : A.formData) || {},
|
|
3896
3896
|
arg: {
|
|
3897
3897
|
urlQuery: A == null ? void 0 : A.urlQuerys,
|
|
3898
3898
|
rowScope: A == null ? void 0 : A.rowScope
|
|
3899
3899
|
},
|
|
3900
3900
|
exp: l
|
|
3901
3901
|
});
|
|
3902
|
-
}, c = (f, l,
|
|
3902
|
+
}, c = (f, l, y, A, g) => {
|
|
3903
3903
|
if (!f)
|
|
3904
3904
|
return A;
|
|
3905
|
-
const
|
|
3906
|
-
return
|
|
3905
|
+
const E = Ze(r);
|
|
3906
|
+
return It(f, {
|
|
3907
3907
|
widgetId: g,
|
|
3908
3908
|
respValue: A,
|
|
3909
|
-
respData:
|
|
3909
|
+
respData: y,
|
|
3910
3910
|
arg: {
|
|
3911
|
-
urlQuery:
|
|
3912
|
-
rowScope:
|
|
3913
|
-
formData:
|
|
3911
|
+
urlQuery: E == null ? void 0 : E.urlQuerys,
|
|
3912
|
+
rowScope: E == null ? void 0 : E.rowScope,
|
|
3913
|
+
formData: E == null ? void 0 : E.formData
|
|
3914
3914
|
},
|
|
3915
3915
|
exp: l
|
|
3916
3916
|
});
|
|
3917
3917
|
}, x = () => new Promise((f, l) => {
|
|
3918
|
-
o().then((
|
|
3919
|
-
var
|
|
3918
|
+
o().then((y) => {
|
|
3919
|
+
var E;
|
|
3920
3920
|
var A = [];
|
|
3921
|
-
let g = a(B((
|
|
3921
|
+
let g = a(B((E = t == null ? void 0 : t.content) == null ? void 0 : E.beforeFetch, e, y));
|
|
3922
3922
|
i == null || i.forEach((b) => {
|
|
3923
|
-
var F = `${E0.schema}.${b}`, _ =
|
|
3924
|
-
const S =
|
|
3923
|
+
var F = `${E0.schema}.${b}`, _ = K.buildVariablePropValue(F, g);
|
|
3924
|
+
const S = K.getValue(_, !1, !0, n);
|
|
3925
3925
|
A.push({ sourceId: b, params: g, resp: S });
|
|
3926
3926
|
}), f(A);
|
|
3927
3927
|
});
|
|
3928
3928
|
}), d = (f) => {
|
|
3929
3929
|
f == null || f.forEach((l) => {
|
|
3930
|
-
let
|
|
3931
|
-
|
|
3932
|
-
var F, _, S,
|
|
3933
|
-
var
|
|
3934
|
-
if (!
|
|
3930
|
+
let y = Me(l == null ? void 0 : l.resp, (A) => {
|
|
3931
|
+
y == null || y(), s == null || s.forEach((g) => {
|
|
3932
|
+
var F, _, S, R, q, w;
|
|
3933
|
+
var E = (F = r == null ? void 0 : r.exposed) == null ? void 0 : F.findRefById(g);
|
|
3934
|
+
if (!E)
|
|
3935
3935
|
return;
|
|
3936
3936
|
const b = (_ = t == null ? void 0 : t.content) == null ? void 0 : _.afterFetch;
|
|
3937
|
-
b ? c(b, e, { ...l, resp: A }, A, g) : (
|
|
3937
|
+
b ? c(b, e, { ...l, resp: A }, A, g) : (R = (S = E == null ? void 0 : E.exposed) == null ? void 0 : S.setValue) == null || R.call(S, A, !1), (w = (q = E == null ? void 0 : E.exposed) == null ? void 0 : q.clearChangeRecord) == null || w.call(q);
|
|
3938
3938
|
});
|
|
3939
3939
|
});
|
|
3940
3940
|
});
|
|
@@ -3947,17 +3947,17 @@ function Cf(t, e, r, n) {
|
|
|
3947
3947
|
const s = (c, x) => {
|
|
3948
3948
|
const { sendToIframe: d, receive: h } = Li();
|
|
3949
3949
|
return new Promise((v, f) => {
|
|
3950
|
-
var
|
|
3950
|
+
var y, A;
|
|
3951
3951
|
const l = si();
|
|
3952
|
-
d((A = (
|
|
3953
|
-
var
|
|
3954
|
-
((
|
|
3952
|
+
d((A = (y = c == null ? void 0 : c.data) == null ? void 0 : y.props) == null ? void 0 : A.iframeRef, { ...x, msgId: l }), h((g) => {
|
|
3953
|
+
var E, b, F, _;
|
|
3954
|
+
((E = g == null ? void 0 : g.data) == null ? void 0 : E.msgId) === l && ((b = g == null ? void 0 : g.data) != null && b.result ? v(!0) : (F = g == null ? void 0 : g.data) != null && F.msg && ds.error((_ = g == null ? void 0 : g.data) == null ? void 0 : _.msg));
|
|
3955
3955
|
}, !0);
|
|
3956
3956
|
});
|
|
3957
3957
|
}, i = (c, x) => {
|
|
3958
|
-
var l,
|
|
3959
|
-
const d = ((l = r == null ? void 0 : r.exposed) == null ? void 0 : l.getRowScope()) || {}, h = ((
|
|
3960
|
-
var v = Lr.decryptFromUrl(window.location.href), f =
|
|
3958
|
+
var l, y;
|
|
3959
|
+
const d = ((l = r == null ? void 0 : r.exposed) == null ? void 0 : l.getRowScope()) || {}, h = ((y = r == null ? void 0 : r.exposed) == null ? void 0 : y.getFormData()) || {};
|
|
3960
|
+
var v = Lr.decryptFromUrl(window.location.href), f = It(c, {
|
|
3961
3961
|
data: {
|
|
3962
3962
|
urlQuery: v,
|
|
3963
3963
|
rowScope: d,
|
|
@@ -3968,10 +3968,10 @@ function Cf(t, e, r, n) {
|
|
|
3968
3968
|
return f;
|
|
3969
3969
|
}, o = () => {
|
|
3970
3970
|
var h, v, f, l;
|
|
3971
|
-
var c = (h = t == null ? void 0 : t.content) != null && h.withQuery ?
|
|
3971
|
+
var c = (h = t == null ? void 0 : t.content) != null && h.withQuery ? Qt.getLocationQueryParams() : {};
|
|
3972
3972
|
let x = Object.assign(c || {}, i((v = t == null ? void 0 : t.content) == null ? void 0 : v.setQueryFn, e));
|
|
3973
|
-
const d =
|
|
3974
|
-
return
|
|
3973
|
+
const d = Qt.buildUrl((f = t == null ? void 0 : t.content) == null ? void 0 : f.url, x, (l = t == null ? void 0 : t.content) == null ? void 0 : l.encodeQuery);
|
|
3974
|
+
return Qt.resolveByCurrentUrl(d);
|
|
3975
3975
|
}, a = () => {
|
|
3976
3976
|
var c, x, d, h;
|
|
3977
3977
|
switch ((c = t == null ? void 0 : t.content) == null ? void 0 : c.windowTarget) {
|
|
@@ -3990,8 +3990,8 @@ function Cf(t, e, r, n) {
|
|
|
3990
3990
|
const { openWindow: c } = ro(), x = a(), d = o();
|
|
3991
3991
|
if (((f = t == null ? void 0 : t.content) == null ? void 0 : f.windowModal) === Ea.modal) {
|
|
3992
3992
|
var h = { self: window == null ? void 0 : window.name, caller: x == null ? void 0 : x.name };
|
|
3993
|
-
const
|
|
3994
|
-
var v = { ...t == null ? void 0 : t.content, url: d, callback: { okCallback:
|
|
3993
|
+
const y = (g) => s(g, { command: "saveForm", args: { ...h } }), A = (g) => s(g, { command: "cancelForm", args: { ...h } });
|
|
3994
|
+
var v = { ...t == null ? void 0 : t.content, url: d, callback: { okCallback: y, cancelCallback: A } };
|
|
3995
3995
|
if (x)
|
|
3996
3996
|
if (x != null && x.openModalAsync)
|
|
3997
3997
|
(l = x == null ? void 0 : x.openModalAsync) == null || l.call(x, v);
|
|
@@ -4007,14 +4007,14 @@ function Cf(t, e, r, n) {
|
|
|
4007
4007
|
}
|
|
4008
4008
|
function Df(t, e, r, n) {
|
|
4009
4009
|
var x;
|
|
4010
|
-
let s =
|
|
4010
|
+
let s = pe((x = t == null ? void 0 : t.content) == null ? void 0 : x.sourceId, !0);
|
|
4011
4011
|
if (!s)
|
|
4012
4012
|
return null;
|
|
4013
4013
|
const i = (d, h, v) => {
|
|
4014
4014
|
if (!d)
|
|
4015
4015
|
return v;
|
|
4016
4016
|
const f = Ze(r);
|
|
4017
|
-
return
|
|
4017
|
+
return It(d, {
|
|
4018
4018
|
formData: v || (f == null ? void 0 : f.formData) || {},
|
|
4019
4019
|
arg: {
|
|
4020
4020
|
urlQuery: f == null ? void 0 : f.urlQuerys,
|
|
@@ -4023,20 +4023,20 @@ function Df(t, e, r, n) {
|
|
|
4023
4023
|
exp: h
|
|
4024
4024
|
});
|
|
4025
4025
|
}, o = () => {
|
|
4026
|
-
var l,
|
|
4026
|
+
var l, y, A;
|
|
4027
4027
|
var d = [];
|
|
4028
4028
|
const h = (l = t == null ? void 0 : t.content) == null ? void 0 : l.params, v = Q0(Rl(h, n));
|
|
4029
|
-
let f = (
|
|
4029
|
+
let f = (y = t == null ? void 0 : t.content) != null && y.beforeFetch ? i((A = t == null ? void 0 : t.content) == null ? void 0 : A.beforeFetch, e, v) : h;
|
|
4030
4030
|
return s == null || s.forEach((g) => {
|
|
4031
|
-
var
|
|
4032
|
-
const F =
|
|
4031
|
+
var E = `${E0.schema}.${g}`, b = K.buildVariablePropValue(E, f);
|
|
4032
|
+
const F = K.getValue(b, !1, !0, n);
|
|
4033
4033
|
d.push({ sourceId: g, params: f, resp: F });
|
|
4034
4034
|
}), d;
|
|
4035
4035
|
}, a = (d, h, v, f) => {
|
|
4036
4036
|
if (!d)
|
|
4037
4037
|
return f;
|
|
4038
4038
|
const l = Ze(r);
|
|
4039
|
-
return
|
|
4039
|
+
return It(d, {
|
|
4040
4040
|
respValue: f,
|
|
4041
4041
|
respData: v,
|
|
4042
4042
|
arg: {
|
|
@@ -4049,8 +4049,8 @@ function Df(t, e, r, n) {
|
|
|
4049
4049
|
}, B = (d) => {
|
|
4050
4050
|
d == null || d.forEach((h) => {
|
|
4051
4051
|
let v = Me(h == null ? void 0 : h.resp, (f) => {
|
|
4052
|
-
var l,
|
|
4053
|
-
v == null || v(), (l = t == null ? void 0 : t.content) != null && l.afterFetch && a((
|
|
4052
|
+
var l, y;
|
|
4053
|
+
v == null || v(), (l = t == null ? void 0 : t.content) != null && l.afterFetch && a((y = t == null ? void 0 : t.content) == null ? void 0 : y.afterFetch, e, { ...h, resp: f }, f);
|
|
4054
4054
|
});
|
|
4055
4055
|
});
|
|
4056
4056
|
};
|
|
@@ -4061,7 +4061,7 @@ function wf(t, e, r, n) {
|
|
|
4061
4061
|
var s, i, o, a, B, c, x;
|
|
4062
4062
|
switch (t == null ? void 0 : t.type) {
|
|
4063
4063
|
case xt.actionCode:
|
|
4064
|
-
return
|
|
4064
|
+
return It((s = t == null ? void 0 : t.content) == null ? void 0 : s.code, e);
|
|
4065
4065
|
case xt.actionURL:
|
|
4066
4066
|
return Cf(t, e, r);
|
|
4067
4067
|
case xt.actionShowWidget: {
|
|
@@ -4185,19 +4185,19 @@ function Pf(t, e, r) {
|
|
|
4185
4185
|
const Pn = {
|
|
4186
4186
|
encrypt: Of,
|
|
4187
4187
|
decrypt: Pf
|
|
4188
|
-
}, so = "3.7.7", Hf = so,
|
|
4188
|
+
}, so = "3.7.7", Hf = so, se = typeof Buffer == "function", ps = typeof TextDecoder == "function" ? new TextDecoder() : void 0, vs = typeof TextEncoder == "function" ? new TextEncoder() : void 0, If = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", le = Array.prototype.slice.call(If), He = ((t) => {
|
|
4189
4189
|
let e = {};
|
|
4190
4190
|
return t.forEach((r, n) => e[r] = n), e;
|
|
4191
|
-
})(
|
|
4191
|
+
})(le), qf = /^(?:[A-Za-z\d+\/]{4})*?(?:[A-Za-z\d+\/]{2}(?:==)?|[A-Za-z\d+\/]{3}=?)?$/, S0 = String.fromCharCode.bind(String), Bs = typeof Uint8Array.from == "function" ? Uint8Array.from.bind(Uint8Array) : (t) => new Uint8Array(Array.prototype.slice.call(t, 0)), io = (t) => t.replace(/=/g, "").replace(/[+\/]/g, (e) => e == "+" ? "-" : "_"), oo = (t) => t.replace(/[^A-Za-z0-9\+\/]/g, ""), ao = (t) => {
|
|
4192
4192
|
let e, r, n, s, i = "";
|
|
4193
4193
|
const o = t.length % 3;
|
|
4194
4194
|
for (let a = 0; a < t.length; ) {
|
|
4195
4195
|
if ((r = t.charCodeAt(a++)) > 255 || (n = t.charCodeAt(a++)) > 255 || (s = t.charCodeAt(a++)) > 255)
|
|
4196
4196
|
throw new TypeError("invalid character found");
|
|
4197
|
-
e = r << 16 | n << 8 | s, i +=
|
|
4197
|
+
e = r << 16 | n << 8 | s, i += le[e >> 18 & 63] + le[e >> 12 & 63] + le[e >> 6 & 63] + le[e & 63];
|
|
4198
4198
|
}
|
|
4199
4199
|
return o ? i.slice(0, o - 3) + "===".substring(o) : i;
|
|
4200
|
-
}, Hn = typeof btoa == "function" ? (t) => btoa(t) :
|
|
4200
|
+
}, Hn = typeof btoa == "function" ? (t) => btoa(t) : se ? (t) => Buffer.from(t, "binary").toString("base64") : ao, En = se ? (t) => Buffer.from(t).toString("base64") : (t) => {
|
|
4201
4201
|
let r = [];
|
|
4202
4202
|
for (let n = 0, s = t.length; n < s; n += 4096)
|
|
4203
4203
|
r.push(S0.apply(null, t.subarray(n, n + 4096)));
|
|
@@ -4210,7 +4210,7 @@ const Pn = {
|
|
|
4210
4210
|
var e = 65536 + (t.charCodeAt(0) - 55296) * 1024 + (t.charCodeAt(1) - 56320);
|
|
4211
4211
|
return S0(240 | e >>> 18 & 7) + S0(128 | e >>> 12 & 63) + S0(128 | e >>> 6 & 63) + S0(128 | e & 63);
|
|
4212
4212
|
}
|
|
4213
|
-
}, Lf = /[\uD800-\uDBFF][\uDC00-\uDFFFF]|[^\x00-\x7F]/g, co = (t) => t.replace(Lf, Nf), gs =
|
|
4213
|
+
}, Lf = /[\uD800-\uDBFF][\uDC00-\uDFFFF]|[^\x00-\x7F]/g, co = (t) => t.replace(Lf, Nf), gs = se ? (t) => Buffer.from(t, "utf8").toString("base64") : vs ? (t) => En(vs.encode(t)) : (t) => Hn(co(t)), Yt = (t, e = !1) => e ? io(gs(t)) : gs(t), Es = (t) => Yt(t, !0), zf = /[\xC0-\xDF][\x80-\xBF]|[\xE0-\xEF][\x80-\xBF]{2}|[\xF0-\xF7][\x80-\xBF]{3}/g, Uf = (t) => {
|
|
4214
4214
|
switch (t.length) {
|
|
4215
4215
|
case 4:
|
|
4216
4216
|
var e = (7 & t.charCodeAt(0)) << 18 | (63 & t.charCodeAt(1)) << 12 | (63 & t.charCodeAt(2)) << 6 | 63 & t.charCodeAt(3), r = e - 65536;
|
|
@@ -4228,7 +4228,7 @@ const Pn = {
|
|
|
4228
4228
|
for (let i = 0; i < t.length; )
|
|
4229
4229
|
e = He[t.charAt(i++)] << 18 | He[t.charAt(i++)] << 12 | (n = He[t.charAt(i++)]) << 6 | (s = He[t.charAt(i++)]), r += n === 64 ? S0(e >> 16 & 255) : s === 64 ? S0(e >> 16 & 255, e >> 8 & 255) : S0(e >> 16 & 255, e >> 8 & 255, e & 255);
|
|
4230
4230
|
return r;
|
|
4231
|
-
}, In = typeof atob == "function" ? (t) => atob(oo(t)) :
|
|
4231
|
+
}, In = typeof atob == "function" ? (t) => atob(oo(t)) : se ? (t) => Buffer.from(t, "base64").toString("binary") : fo, uo = se ? (t) => Bs(Buffer.from(t, "base64")) : (t) => Bs(In(t).split("").map((e) => e.charCodeAt(0))), lo = (t) => uo(ho(t)), $f = se ? (t) => Buffer.from(t, "base64").toString("utf8") : ps ? (t) => ps.decode(uo(t)) : (t) => xo(In(t)), ho = (t) => oo(t.replace(/[-_]/g, (e) => e == "-" ? "+" : "/")), yn = (t) => $f(ho(t)), Mf = (t) => {
|
|
4232
4232
|
if (typeof t != "string")
|
|
4233
4233
|
return !1;
|
|
4234
4234
|
const e = t.replace(/\s+/g, "").replace(/={0,2}$/, "");
|
|
@@ -4243,11 +4243,11 @@ const Pn = {
|
|
|
4243
4243
|
t("fromBase64", function() {
|
|
4244
4244
|
return yn(this);
|
|
4245
4245
|
}), t("toBase64", function(e) {
|
|
4246
|
-
return
|
|
4246
|
+
return Yt(this, e);
|
|
4247
4247
|
}), t("toBase64URI", function() {
|
|
4248
|
-
return
|
|
4248
|
+
return Yt(this, !0);
|
|
4249
4249
|
}), t("toBase64URL", function() {
|
|
4250
|
-
return
|
|
4250
|
+
return Yt(this, !0);
|
|
4251
4251
|
}), t("toUint8Array", function() {
|
|
4252
4252
|
return lo(this);
|
|
4253
4253
|
});
|
|
@@ -4270,8 +4270,8 @@ const Pn = {
|
|
|
4270
4270
|
btoa: Hn,
|
|
4271
4271
|
btoaPolyfill: ao,
|
|
4272
4272
|
fromBase64: yn,
|
|
4273
|
-
toBase64:
|
|
4274
|
-
encode:
|
|
4273
|
+
toBase64: Yt,
|
|
4274
|
+
encode: Yt,
|
|
4275
4275
|
encodeURI: Es,
|
|
4276
4276
|
encodeURL: Es,
|
|
4277
4277
|
utob: co,
|
|
@@ -4496,22 +4496,22 @@ const dn = new Zf(), qn = (t, e) => {
|
|
|
4496
4496
|
return r.dataDigest = o, r;
|
|
4497
4497
|
}, Kf = (t, e, r) => {
|
|
4498
4498
|
const n = qn(t, e);
|
|
4499
|
-
return
|
|
4499
|
+
return ye.encrypt(M0(n), r);
|
|
4500
4500
|
}, Gf = (t, e) => {
|
|
4501
|
-
if (
|
|
4501
|
+
if (I0(t))
|
|
4502
4502
|
return null;
|
|
4503
|
-
const r =
|
|
4503
|
+
const r = ye.decrypt(t, e);
|
|
4504
4504
|
var n = Q0(r);
|
|
4505
|
-
return r !== null && n === null &&
|
|
4505
|
+
return r !== null && n === null && Ht.info("decodeSM2", { sm2Decrypt: r }), n;
|
|
4506
4506
|
}, Xf = (t, e, r, n) => {
|
|
4507
4507
|
const s = qn(t, e);
|
|
4508
4508
|
return Pn.encrypt(M0(s), r, n);
|
|
4509
4509
|
}, Qf = (t, e, r) => {
|
|
4510
|
-
if (
|
|
4510
|
+
if (I0(t))
|
|
4511
4511
|
return null;
|
|
4512
4512
|
const n = Pn.decrypt(t, e, r);
|
|
4513
4513
|
var s = Q0(n);
|
|
4514
|
-
return n !== null && s === null &&
|
|
4514
|
+
return n !== null && s === null && Ht.info("decodeSM4", { sm4Decrypt: n }), s;
|
|
4515
4515
|
}, Vf = {
|
|
4516
4516
|
traceBody: qn,
|
|
4517
4517
|
encodeSM2: Kf,
|
|
@@ -4572,9 +4572,9 @@ function o0() {
|
|
|
4572
4572
|
}, a = Object.create || function() {
|
|
4573
4573
|
function g() {
|
|
4574
4574
|
}
|
|
4575
|
-
return function(
|
|
4575
|
+
return function(E) {
|
|
4576
4576
|
var b;
|
|
4577
|
-
return g.prototype =
|
|
4577
|
+
return g.prototype = E, b = new g(), g.prototype = null, b;
|
|
4578
4578
|
};
|
|
4579
4579
|
}(), B = {}, c = B.lib = {}, x = c.Base = function() {
|
|
4580
4580
|
return {
|
|
@@ -4597,10 +4597,10 @@ function o0() {
|
|
|
4597
4597
|
* });
|
|
4598
4598
|
*/
|
|
4599
4599
|
extend: function(g) {
|
|
4600
|
-
var
|
|
4601
|
-
return g &&
|
|
4602
|
-
|
|
4603
|
-
}),
|
|
4600
|
+
var E = a(this);
|
|
4601
|
+
return g && E.mixIn(g), (!E.hasOwnProperty("init") || this.init === E.init) && (E.init = function() {
|
|
4602
|
+
E.$super.init.apply(this, arguments);
|
|
4603
|
+
}), E.init.prototype = E, E.$super = this, E;
|
|
4604
4604
|
},
|
|
4605
4605
|
/**
|
|
4606
4606
|
* Extends this object and runs the init method.
|
|
@@ -4644,8 +4644,8 @@ function o0() {
|
|
|
4644
4644
|
* });
|
|
4645
4645
|
*/
|
|
4646
4646
|
mixIn: function(g) {
|
|
4647
|
-
for (var
|
|
4648
|
-
g.hasOwnProperty(
|
|
4647
|
+
for (var E in g)
|
|
4648
|
+
g.hasOwnProperty(E) && (this[E] = g[E]);
|
|
4649
4649
|
g.hasOwnProperty("toString") && (this.toString = g.toString);
|
|
4650
4650
|
},
|
|
4651
4651
|
/**
|
|
@@ -4674,8 +4674,8 @@ function o0() {
|
|
|
4674
4674
|
* var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);
|
|
4675
4675
|
* var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);
|
|
4676
4676
|
*/
|
|
4677
|
-
init: function(g,
|
|
4678
|
-
g = this.words = g || [],
|
|
4677
|
+
init: function(g, E) {
|
|
4678
|
+
g = this.words = g || [], E != s ? this.sigBytes = E : this.sigBytes = g.length * 4;
|
|
4679
4679
|
},
|
|
4680
4680
|
/**
|
|
4681
4681
|
* Converts this word array to a string.
|
|
@@ -4705,15 +4705,15 @@ function o0() {
|
|
|
4705
4705
|
* wordArray1.concat(wordArray2);
|
|
4706
4706
|
*/
|
|
4707
4707
|
concat: function(g) {
|
|
4708
|
-
var
|
|
4708
|
+
var E = this.words, b = g.words, F = this.sigBytes, _ = g.sigBytes;
|
|
4709
4709
|
if (this.clamp(), F % 4)
|
|
4710
4710
|
for (var S = 0; S < _; S++) {
|
|
4711
|
-
var
|
|
4712
|
-
|
|
4711
|
+
var R = b[S >>> 2] >>> 24 - S % 4 * 8 & 255;
|
|
4712
|
+
E[F + S >>> 2] |= R << 24 - (F + S) % 4 * 8;
|
|
4713
4713
|
}
|
|
4714
4714
|
else
|
|
4715
|
-
for (var
|
|
4716
|
-
|
|
4715
|
+
for (var q = 0; q < _; q += 4)
|
|
4716
|
+
E[F + q >>> 2] = b[q >>> 2];
|
|
4717
4717
|
return this.sigBytes += _, this;
|
|
4718
4718
|
},
|
|
4719
4719
|
/**
|
|
@@ -4724,8 +4724,8 @@ function o0() {
|
|
|
4724
4724
|
* wordArray.clamp();
|
|
4725
4725
|
*/
|
|
4726
4726
|
clamp: function() {
|
|
4727
|
-
var g = this.words,
|
|
4728
|
-
g[
|
|
4727
|
+
var g = this.words, E = this.sigBytes;
|
|
4728
|
+
g[E >>> 2] &= 4294967295 << 32 - E % 4 * 8, g.length = n.ceil(E / 4);
|
|
4729
4729
|
},
|
|
4730
4730
|
/**
|
|
4731
4731
|
* Creates a copy of this word array.
|
|
@@ -4754,9 +4754,9 @@ function o0() {
|
|
|
4754
4754
|
* var wordArray = CryptoJS.lib.WordArray.random(16);
|
|
4755
4755
|
*/
|
|
4756
4756
|
random: function(g) {
|
|
4757
|
-
for (var
|
|
4758
|
-
|
|
4759
|
-
return new d.init(
|
|
4757
|
+
for (var E = [], b = 0; b < g; b += 4)
|
|
4758
|
+
E.push(o());
|
|
4759
|
+
return new d.init(E, g);
|
|
4760
4760
|
}
|
|
4761
4761
|
}), h = B.enc = {}, v = h.Hex = {
|
|
4762
4762
|
/**
|
|
@@ -4773,8 +4773,8 @@ function o0() {
|
|
|
4773
4773
|
* var hexString = CryptoJS.enc.Hex.stringify(wordArray);
|
|
4774
4774
|
*/
|
|
4775
4775
|
stringify: function(g) {
|
|
4776
|
-
for (var
|
|
4777
|
-
var S =
|
|
4776
|
+
for (var E = g.words, b = g.sigBytes, F = [], _ = 0; _ < b; _++) {
|
|
4777
|
+
var S = E[_ >>> 2] >>> 24 - _ % 4 * 8 & 255;
|
|
4778
4778
|
F.push((S >>> 4).toString(16)), F.push((S & 15).toString(16));
|
|
4779
4779
|
}
|
|
4780
4780
|
return F.join("");
|
|
@@ -4793,9 +4793,9 @@ function o0() {
|
|
|
4793
4793
|
* var wordArray = CryptoJS.enc.Hex.parse(hexString);
|
|
4794
4794
|
*/
|
|
4795
4795
|
parse: function(g) {
|
|
4796
|
-
for (var
|
|
4796
|
+
for (var E = g.length, b = [], F = 0; F < E; F += 2)
|
|
4797
4797
|
b[F >>> 3] |= parseInt(g.substr(F, 2), 16) << 24 - F % 8 * 4;
|
|
4798
|
-
return new d.init(b,
|
|
4798
|
+
return new d.init(b, E / 2);
|
|
4799
4799
|
}
|
|
4800
4800
|
}, f = h.Latin1 = {
|
|
4801
4801
|
/**
|
|
@@ -4812,8 +4812,8 @@ function o0() {
|
|
|
4812
4812
|
* var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);
|
|
4813
4813
|
*/
|
|
4814
4814
|
stringify: function(g) {
|
|
4815
|
-
for (var
|
|
4816
|
-
var S =
|
|
4815
|
+
for (var E = g.words, b = g.sigBytes, F = [], _ = 0; _ < b; _++) {
|
|
4816
|
+
var S = E[_ >>> 2] >>> 24 - _ % 4 * 8 & 255;
|
|
4817
4817
|
F.push(String.fromCharCode(S));
|
|
4818
4818
|
}
|
|
4819
4819
|
return F.join("");
|
|
@@ -4832,9 +4832,9 @@ function o0() {
|
|
|
4832
4832
|
* var wordArray = CryptoJS.enc.Latin1.parse(latin1String);
|
|
4833
4833
|
*/
|
|
4834
4834
|
parse: function(g) {
|
|
4835
|
-
for (var
|
|
4835
|
+
for (var E = g.length, b = [], F = 0; F < E; F++)
|
|
4836
4836
|
b[F >>> 2] |= (g.charCodeAt(F) & 255) << 24 - F % 4 * 8;
|
|
4837
|
-
return new d.init(b,
|
|
4837
|
+
return new d.init(b, E);
|
|
4838
4838
|
}
|
|
4839
4839
|
}, l = h.Utf8 = {
|
|
4840
4840
|
/**
|
|
@@ -4873,7 +4873,7 @@ function o0() {
|
|
|
4873
4873
|
parse: function(g) {
|
|
4874
4874
|
return f.parse(unescape(encodeURIComponent(g)));
|
|
4875
4875
|
}
|
|
4876
|
-
},
|
|
4876
|
+
}, y = c.BufferedBlockAlgorithm = x.extend({
|
|
4877
4877
|
/**
|
|
4878
4878
|
* Resets this block algorithm's data buffer to its initial state.
|
|
4879
4879
|
*
|
|
@@ -4912,15 +4912,15 @@ function o0() {
|
|
|
4912
4912
|
* var processedData = bufferedBlockAlgorithm._process(!!'flush');
|
|
4913
4913
|
*/
|
|
4914
4914
|
_process: function(g) {
|
|
4915
|
-
var
|
|
4916
|
-
g ?
|
|
4917
|
-
var w =
|
|
4915
|
+
var E, b = this._data, F = b.words, _ = b.sigBytes, S = this.blockSize, R = S * 4, q = _ / R;
|
|
4916
|
+
g ? q = n.ceil(q) : q = n.max((q | 0) - this._minBufferSize, 0);
|
|
4917
|
+
var w = q * S, C = n.min(w * 4, _);
|
|
4918
4918
|
if (w) {
|
|
4919
4919
|
for (var N = 0; N < w; N += S)
|
|
4920
4920
|
this._doProcessBlock(F, N);
|
|
4921
|
-
|
|
4921
|
+
E = F.splice(0, w), b.sigBytes -= C;
|
|
4922
4922
|
}
|
|
4923
|
-
return new d.init(
|
|
4923
|
+
return new d.init(E, C);
|
|
4924
4924
|
},
|
|
4925
4925
|
/**
|
|
4926
4926
|
* Creates a copy of this object.
|
|
@@ -4937,7 +4937,7 @@ function o0() {
|
|
|
4937
4937
|
},
|
|
4938
4938
|
_minBufferSize: 0
|
|
4939
4939
|
});
|
|
4940
|
-
c.Hasher =
|
|
4940
|
+
c.Hasher = y.extend({
|
|
4941
4941
|
/**
|
|
4942
4942
|
* Configuration options.
|
|
4943
4943
|
*/
|
|
@@ -4962,7 +4962,7 @@ function o0() {
|
|
|
4962
4962
|
* hasher.reset();
|
|
4963
4963
|
*/
|
|
4964
4964
|
reset: function() {
|
|
4965
|
-
|
|
4965
|
+
y.reset.call(this), this._doReset();
|
|
4966
4966
|
},
|
|
4967
4967
|
/**
|
|
4968
4968
|
* Updates this hasher with a message.
|
|
@@ -4995,8 +4995,8 @@ function o0() {
|
|
|
4995
4995
|
*/
|
|
4996
4996
|
finalize: function(g) {
|
|
4997
4997
|
g && this._append(g);
|
|
4998
|
-
var
|
|
4999
|
-
return
|
|
4998
|
+
var E = this._doFinalize();
|
|
4999
|
+
return E;
|
|
5000
5000
|
},
|
|
5001
5001
|
blockSize: 16,
|
|
5002
5002
|
/**
|
|
@@ -5013,8 +5013,8 @@ function o0() {
|
|
|
5013
5013
|
* var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);
|
|
5014
5014
|
*/
|
|
5015
5015
|
_createHelper: function(g) {
|
|
5016
|
-
return function(
|
|
5017
|
-
return new g.init(b).finalize(
|
|
5016
|
+
return function(E, b) {
|
|
5017
|
+
return new g.init(b).finalize(E);
|
|
5018
5018
|
};
|
|
5019
5019
|
},
|
|
5020
5020
|
/**
|
|
@@ -5031,8 +5031,8 @@ function o0() {
|
|
|
5031
5031
|
* var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);
|
|
5032
5032
|
*/
|
|
5033
5033
|
_createHmacHelper: function(g) {
|
|
5034
|
-
return function(
|
|
5035
|
-
return new A.HMAC.init(g, b).finalize(
|
|
5034
|
+
return function(E, b) {
|
|
5035
|
+
return new A.HMAC.init(g, b).finalize(E);
|
|
5036
5036
|
};
|
|
5037
5037
|
}
|
|
5038
5038
|
});
|
|
@@ -5418,7 +5418,7 @@ var Ve = {}, xu = {
|
|
|
5418
5418
|
Ve = t;
|
|
5419
5419
|
}
|
|
5420
5420
|
}, Fs;
|
|
5421
|
-
function
|
|
5421
|
+
function jt() {
|
|
5422
5422
|
return Fs || (Fs = 1, function(t, e) {
|
|
5423
5423
|
(function(r, n) {
|
|
5424
5424
|
t.exports = n(o0());
|
|
@@ -5443,12 +5443,12 @@ function Mt() {
|
|
|
5443
5443
|
var c = B.words, x = B.sigBytes, d = this._map;
|
|
5444
5444
|
B.clamp();
|
|
5445
5445
|
for (var h = [], v = 0; v < x; v += 3)
|
|
5446
|
-
for (var f = c[v >>> 2] >>> 24 - v % 4 * 8 & 255, l = c[v + 1 >>> 2] >>> 24 - (v + 1) % 4 * 8 & 255,
|
|
5446
|
+
for (var f = c[v >>> 2] >>> 24 - v % 4 * 8 & 255, l = c[v + 1 >>> 2] >>> 24 - (v + 1) % 4 * 8 & 255, y = c[v + 2 >>> 2] >>> 24 - (v + 2) % 4 * 8 & 255, A = f << 16 | l << 8 | y, g = 0; g < 4 && v + g * 0.75 < x; g++)
|
|
5447
5447
|
h.push(d.charAt(A >>> 6 * (3 - g) & 63));
|
|
5448
|
-
var
|
|
5449
|
-
if (
|
|
5448
|
+
var E = d.charAt(64);
|
|
5449
|
+
if (E)
|
|
5450
5450
|
for (; h.length % 4; )
|
|
5451
|
-
h.push(
|
|
5451
|
+
h.push(E);
|
|
5452
5452
|
return h.join("");
|
|
5453
5453
|
},
|
|
5454
5454
|
/**
|
|
@@ -5483,8 +5483,8 @@ function Mt() {
|
|
|
5483
5483
|
function a(B, c, x) {
|
|
5484
5484
|
for (var d = [], h = 0, v = 0; v < c; v++)
|
|
5485
5485
|
if (v % 4) {
|
|
5486
|
-
var f = x[B.charCodeAt(v - 1)] << v % 4 * 2, l = x[B.charCodeAt(v)] >>> 6 - v % 4 * 2,
|
|
5487
|
-
d[h >>> 2] |=
|
|
5486
|
+
var f = x[B.charCodeAt(v - 1)] << v % 4 * 2, l = x[B.charCodeAt(v)] >>> 6 - v % 4 * 2, y = f | l;
|
|
5487
|
+
d[h >>> 2] |= y << 24 - h % 4 * 8, h++;
|
|
5488
5488
|
}
|
|
5489
5489
|
return i.create(d, h);
|
|
5490
5490
|
}
|
|
@@ -5528,8 +5528,8 @@ function uu() {
|
|
|
5528
5528
|
var x = B.words, d = B.sigBytes, h = c ? this._safe_map : this._map;
|
|
5529
5529
|
B.clamp();
|
|
5530
5530
|
for (var v = [], f = 0; f < d; f += 3)
|
|
5531
|
-
for (var l = x[f >>> 2] >>> 24 - f % 4 * 8 & 255,
|
|
5532
|
-
v.push(h.charAt(g >>> 6 * (3 -
|
|
5531
|
+
for (var l = x[f >>> 2] >>> 24 - f % 4 * 8 & 255, y = x[f + 1 >>> 2] >>> 24 - (f + 1) % 4 * 8 & 255, A = x[f + 2 >>> 2] >>> 24 - (f + 2) % 4 * 8 & 255, g = l << 16 | y << 8 | A, E = 0; E < 4 && f + E * 0.75 < d; E++)
|
|
5532
|
+
v.push(h.charAt(g >>> 6 * (3 - E) & 63));
|
|
5533
5533
|
var b = h.charAt(64);
|
|
5534
5534
|
if (b)
|
|
5535
5535
|
for (; v.length % 4; )
|
|
@@ -5572,8 +5572,8 @@ function uu() {
|
|
|
5572
5572
|
function a(B, c, x) {
|
|
5573
5573
|
for (var d = [], h = 0, v = 0; v < c; v++)
|
|
5574
5574
|
if (v % 4) {
|
|
5575
|
-
var f = x[B.charCodeAt(v - 1)] << v % 4 * 2, l = x[B.charCodeAt(v)] >>> 6 - v % 4 * 2,
|
|
5576
|
-
d[h >>> 2] |=
|
|
5575
|
+
var f = x[B.charCodeAt(v - 1)] << v % 4 * 2, l = x[B.charCodeAt(v)] >>> 6 - v % 4 * 2, y = f | l;
|
|
5576
|
+
d[h >>> 2] |= y << 24 - h % 4 * 8, h++;
|
|
5577
5577
|
}
|
|
5578
5578
|
return i.create(d, h);
|
|
5579
5579
|
}
|
|
@@ -5589,7 +5589,7 @@ var Je = {}, lu = {
|
|
|
5589
5589
|
Je = t;
|
|
5590
5590
|
}
|
|
5591
5591
|
}, Ds;
|
|
5592
|
-
function
|
|
5592
|
+
function Wt() {
|
|
5593
5593
|
return Ds || (Ds = 1, function(t, e) {
|
|
5594
5594
|
(function(r, n) {
|
|
5595
5595
|
t.exports = n(o0());
|
|
@@ -5609,22 +5609,22 @@ function jt() {
|
|
|
5609
5609
|
271733878
|
|
5610
5610
|
]);
|
|
5611
5611
|
},
|
|
5612
|
-
_doProcessBlock: function(l,
|
|
5612
|
+
_doProcessBlock: function(l, y) {
|
|
5613
5613
|
for (var A = 0; A < 16; A++) {
|
|
5614
|
-
var g =
|
|
5615
|
-
l[g] = (
|
|
5614
|
+
var g = y + A, E = l[g];
|
|
5615
|
+
l[g] = (E << 8 | E >>> 24) & 16711935 | (E << 24 | E >>> 8) & 4278255360;
|
|
5616
5616
|
}
|
|
5617
|
-
var b = this._hash.words, F = l[
|
|
5618
|
-
O = d(O, z, M, U, F, 7, c[0]), U = d(U, O, z, M, _, 12, c[1]), M = d(M, U, O, z, S, 17, c[2]), z = d(z, M, U, O,
|
|
5617
|
+
var b = this._hash.words, F = l[y + 0], _ = l[y + 1], S = l[y + 2], R = l[y + 3], q = l[y + 4], w = l[y + 5], C = l[y + 6], N = l[y + 7], L = l[y + 8], Q = l[y + 9], J = l[y + 10], r0 = l[y + 11], l0 = l[y + 12], Y = l[y + 13], h0 = l[y + 14], a0 = l[y + 15], O = b[0], z = b[1], M = b[2], U = b[3];
|
|
5618
|
+
O = d(O, z, M, U, F, 7, c[0]), U = d(U, O, z, M, _, 12, c[1]), M = d(M, U, O, z, S, 17, c[2]), z = d(z, M, U, O, R, 22, c[3]), O = d(O, z, M, U, q, 7, c[4]), U = d(U, O, z, M, w, 12, c[5]), M = d(M, U, O, z, C, 17, c[6]), z = d(z, M, U, O, N, 22, c[7]), O = d(O, z, M, U, L, 7, c[8]), U = d(U, O, z, M, Q, 12, c[9]), M = d(M, U, O, z, J, 17, c[10]), z = d(z, M, U, O, r0, 22, c[11]), O = d(O, z, M, U, l0, 7, c[12]), U = d(U, O, z, M, Y, 12, c[13]), M = d(M, U, O, z, h0, 17, c[14]), z = d(z, M, U, O, a0, 22, c[15]), O = h(O, z, M, U, _, 5, c[16]), U = h(U, O, z, M, C, 9, c[17]), M = h(M, U, O, z, r0, 14, c[18]), z = h(z, M, U, O, F, 20, c[19]), O = h(O, z, M, U, w, 5, c[20]), U = h(U, O, z, M, J, 9, c[21]), M = h(M, U, O, z, a0, 14, c[22]), z = h(z, M, U, O, q, 20, c[23]), O = h(O, z, M, U, Q, 5, c[24]), U = h(U, O, z, M, h0, 9, c[25]), M = h(M, U, O, z, R, 14, c[26]), z = h(z, M, U, O, L, 20, c[27]), O = h(O, z, M, U, Y, 5, c[28]), U = h(U, O, z, M, S, 9, c[29]), M = h(M, U, O, z, N, 14, c[30]), z = h(z, M, U, O, l0, 20, c[31]), O = v(O, z, M, U, w, 4, c[32]), U = v(U, O, z, M, L, 11, c[33]), M = v(M, U, O, z, r0, 16, c[34]), z = v(z, M, U, O, h0, 23, c[35]), O = v(O, z, M, U, _, 4, c[36]), U = v(U, O, z, M, q, 11, c[37]), M = v(M, U, O, z, N, 16, c[38]), z = v(z, M, U, O, J, 23, c[39]), O = v(O, z, M, U, Y, 4, c[40]), U = v(U, O, z, M, F, 11, c[41]), M = v(M, U, O, z, R, 16, c[42]), z = v(z, M, U, O, C, 23, c[43]), O = v(O, z, M, U, Q, 4, c[44]), U = v(U, O, z, M, l0, 11, c[45]), M = v(M, U, O, z, a0, 16, c[46]), z = v(z, M, U, O, S, 23, c[47]), O = f(O, z, M, U, F, 6, c[48]), U = f(U, O, z, M, N, 10, c[49]), M = f(M, U, O, z, h0, 15, c[50]), z = f(z, M, U, O, w, 21, c[51]), O = f(O, z, M, U, l0, 6, c[52]), U = f(U, O, z, M, R, 10, c[53]), M = f(M, U, O, z, J, 15, c[54]), z = f(z, M, U, O, _, 21, c[55]), O = f(O, z, M, U, L, 6, c[56]), U = f(U, O, z, M, a0, 10, c[57]), M = f(M, U, O, z, C, 15, c[58]), z = f(z, M, U, O, Y, 21, c[59]), O = f(O, z, M, U, q, 6, c[60]), U = f(U, O, z, M, r0, 10, c[61]), M = f(M, U, O, z, S, 15, c[62]), z = f(z, M, U, O, Q, 21, c[63]), b[0] = b[0] + O | 0, b[1] = b[1] + z | 0, b[2] = b[2] + M | 0, b[3] = b[3] + U | 0;
|
|
5619
5619
|
},
|
|
5620
5620
|
_doFinalize: function() {
|
|
5621
|
-
var l = this._data,
|
|
5622
|
-
|
|
5623
|
-
var
|
|
5624
|
-
|
|
5621
|
+
var l = this._data, y = l.words, A = this._nDataBytes * 8, g = l.sigBytes * 8;
|
|
5622
|
+
y[g >>> 5] |= 128 << 24 - g % 32;
|
|
5623
|
+
var E = n.floor(A / 4294967296), b = A;
|
|
5624
|
+
y[(g + 64 >>> 9 << 4) + 15] = (E << 8 | E >>> 24) & 16711935 | (E << 24 | E >>> 8) & 4278255360, y[(g + 64 >>> 9 << 4) + 14] = (b << 8 | b >>> 24) & 16711935 | (b << 24 | b >>> 8) & 4278255360, l.sigBytes = (y.length + 1) * 4, this._process();
|
|
5625
5625
|
for (var F = this._hash, _ = F.words, S = 0; S < 4; S++) {
|
|
5626
|
-
var
|
|
5627
|
-
_[S] = (
|
|
5626
|
+
var R = _[S];
|
|
5627
|
+
_[S] = (R << 8 | R >>> 24) & 16711935 | (R << 24 | R >>> 8) & 4278255360;
|
|
5628
5628
|
}
|
|
5629
5629
|
return F;
|
|
5630
5630
|
},
|
|
@@ -5633,21 +5633,21 @@ function jt() {
|
|
|
5633
5633
|
return l._hash = this._hash.clone(), l;
|
|
5634
5634
|
}
|
|
5635
5635
|
});
|
|
5636
|
-
function d(l,
|
|
5637
|
-
var _ = l + (
|
|
5638
|
-
return (_ << b | _ >>> 32 - b) +
|
|
5636
|
+
function d(l, y, A, g, E, b, F) {
|
|
5637
|
+
var _ = l + (y & A | ~y & g) + E + F;
|
|
5638
|
+
return (_ << b | _ >>> 32 - b) + y;
|
|
5639
5639
|
}
|
|
5640
|
-
function h(l,
|
|
5641
|
-
var _ = l + (
|
|
5642
|
-
return (_ << b | _ >>> 32 - b) +
|
|
5640
|
+
function h(l, y, A, g, E, b, F) {
|
|
5641
|
+
var _ = l + (y & g | A & ~g) + E + F;
|
|
5642
|
+
return (_ << b | _ >>> 32 - b) + y;
|
|
5643
5643
|
}
|
|
5644
|
-
function v(l,
|
|
5645
|
-
var _ = l + (
|
|
5646
|
-
return (_ << b | _ >>> 32 - b) +
|
|
5644
|
+
function v(l, y, A, g, E, b, F) {
|
|
5645
|
+
var _ = l + (y ^ A ^ g) + E + F;
|
|
5646
|
+
return (_ << b | _ >>> 32 - b) + y;
|
|
5647
5647
|
}
|
|
5648
|
-
function f(l,
|
|
5649
|
-
var _ = l + (A ^ (
|
|
5650
|
-
return (_ << b | _ >>> 32 - b) +
|
|
5648
|
+
function f(l, y, A, g, E, b, F) {
|
|
5649
|
+
var _ = l + (A ^ (y | ~g)) + E + F;
|
|
5650
|
+
return (_ << b | _ >>> 32 - b) + y;
|
|
5651
5651
|
}
|
|
5652
5652
|
s.MD5 = a._createHelper(x), s.HmacMD5 = a._createHmacHelper(x);
|
|
5653
5653
|
}(Math), r.MD5;
|
|
@@ -5679,17 +5679,17 @@ function go() {
|
|
|
5679
5679
|
]);
|
|
5680
5680
|
},
|
|
5681
5681
|
_doProcessBlock: function(x, d) {
|
|
5682
|
-
for (var h = this._hash.words, v = h[0], f = h[1], l = h[2],
|
|
5682
|
+
for (var h = this._hash.words, v = h[0], f = h[1], l = h[2], y = h[3], A = h[4], g = 0; g < 80; g++) {
|
|
5683
5683
|
if (g < 16)
|
|
5684
5684
|
B[g] = x[d + g] | 0;
|
|
5685
5685
|
else {
|
|
5686
|
-
var
|
|
5687
|
-
B[g] =
|
|
5686
|
+
var E = B[g - 3] ^ B[g - 8] ^ B[g - 14] ^ B[g - 16];
|
|
5687
|
+
B[g] = E << 1 | E >>> 31;
|
|
5688
5688
|
}
|
|
5689
5689
|
var b = (v << 5 | v >>> 27) + A + B[g];
|
|
5690
|
-
g < 20 ? b += (f & l | ~f &
|
|
5690
|
+
g < 20 ? b += (f & l | ~f & y) + 1518500249 : g < 40 ? b += (f ^ l ^ y) + 1859775393 : g < 60 ? b += (f & l | f & y | l & y) - 1894007588 : b += (f ^ l ^ y) - 899497514, A = y, y = l, l = f << 30 | f >>> 2, f = v, v = b;
|
|
5691
5691
|
}
|
|
5692
|
-
h[0] = h[0] + v | 0, h[1] = h[1] + f | 0, h[2] = h[2] + l | 0, h[3] = h[3] +
|
|
5692
|
+
h[0] = h[0] + v | 0, h[1] = h[1] + f | 0, h[2] = h[2] + l | 0, h[3] = h[3] + y | 0, h[4] = h[4] + A | 0;
|
|
5693
5693
|
},
|
|
5694
5694
|
_doFinalize: function() {
|
|
5695
5695
|
var x = this._data, d = x.words, h = this._nDataBytes * 8, v = x.sigBytes * 8;
|
|
@@ -5722,37 +5722,37 @@ function Nn() {
|
|
|
5722
5722
|
var s = r, i = s.lib, o = i.WordArray, a = i.Hasher, B = s.algo, c = [], x = [];
|
|
5723
5723
|
(function() {
|
|
5724
5724
|
function v(A) {
|
|
5725
|
-
for (var g = n.sqrt(A),
|
|
5726
|
-
if (!(A %
|
|
5725
|
+
for (var g = n.sqrt(A), E = 2; E <= g; E++)
|
|
5726
|
+
if (!(A % E))
|
|
5727
5727
|
return !1;
|
|
5728
5728
|
return !0;
|
|
5729
5729
|
}
|
|
5730
5730
|
function f(A) {
|
|
5731
5731
|
return (A - (A | 0)) * 4294967296 | 0;
|
|
5732
5732
|
}
|
|
5733
|
-
for (var l = 2,
|
|
5734
|
-
v(l) && (
|
|
5733
|
+
for (var l = 2, y = 0; y < 64; )
|
|
5734
|
+
v(l) && (y < 8 && (c[y] = f(n.pow(l, 1 / 2))), x[y] = f(n.pow(l, 1 / 3)), y++), l++;
|
|
5735
5735
|
})();
|
|
5736
5736
|
var d = [], h = B.SHA256 = a.extend({
|
|
5737
5737
|
_doReset: function() {
|
|
5738
5738
|
this._hash = new o.init(c.slice(0));
|
|
5739
5739
|
},
|
|
5740
5740
|
_doProcessBlock: function(v, f) {
|
|
5741
|
-
for (var l = this._hash.words,
|
|
5742
|
-
if (
|
|
5743
|
-
d[
|
|
5741
|
+
for (var l = this._hash.words, y = l[0], A = l[1], g = l[2], E = l[3], b = l[4], F = l[5], _ = l[6], S = l[7], R = 0; R < 64; R++) {
|
|
5742
|
+
if (R < 16)
|
|
5743
|
+
d[R] = v[f + R] | 0;
|
|
5744
5744
|
else {
|
|
5745
|
-
var
|
|
5746
|
-
d[
|
|
5745
|
+
var q = d[R - 15], w = (q << 25 | q >>> 7) ^ (q << 14 | q >>> 18) ^ q >>> 3, C = d[R - 2], N = (C << 15 | C >>> 17) ^ (C << 13 | C >>> 19) ^ C >>> 10;
|
|
5746
|
+
d[R] = w + d[R - 7] + N + d[R - 16];
|
|
5747
5747
|
}
|
|
5748
|
-
var L = b & F ^ ~b & _, Q =
|
|
5749
|
-
S = _, _ = F, F = b, b =
|
|
5748
|
+
var L = b & F ^ ~b & _, Q = y & A ^ y & g ^ A & g, J = (y << 30 | y >>> 2) ^ (y << 19 | y >>> 13) ^ (y << 10 | y >>> 22), r0 = (b << 26 | b >>> 6) ^ (b << 21 | b >>> 11) ^ (b << 7 | b >>> 25), l0 = S + r0 + L + x[R] + d[R], Y = J + Q;
|
|
5749
|
+
S = _, _ = F, F = b, b = E + l0 | 0, E = g, g = A, A = y, y = l0 + Y | 0;
|
|
5750
5750
|
}
|
|
5751
|
-
l[0] = l[0] +
|
|
5751
|
+
l[0] = l[0] + y | 0, l[1] = l[1] + A | 0, l[2] = l[2] + g | 0, l[3] = l[3] + E | 0, l[4] = l[4] + b | 0, l[5] = l[5] + F | 0, l[6] = l[6] + _ | 0, l[7] = l[7] + S | 0;
|
|
5752
5752
|
},
|
|
5753
5753
|
_doFinalize: function() {
|
|
5754
|
-
var v = this._data, f = v.words, l = this._nDataBytes * 8,
|
|
5755
|
-
return f[
|
|
5754
|
+
var v = this._data, f = v.words, l = this._nDataBytes * 8, y = v.sigBytes * 8;
|
|
5755
|
+
return f[y >>> 5] |= 128 << 24 - y % 32, f[(y + 64 >>> 9 << 4) + 14] = n.floor(l / 4294967296), f[(y + 64 >>> 9 << 4) + 15] = l, v.sigBytes = f.length * 4, this._process(), this._hash;
|
|
5756
5756
|
},
|
|
5757
5757
|
clone: function() {
|
|
5758
5758
|
var v = a.clone.call(this);
|
|
@@ -5919,22 +5919,22 @@ function Eo() {
|
|
|
5919
5919
|
]);
|
|
5920
5920
|
},
|
|
5921
5921
|
_doProcessBlock: function(f, l) {
|
|
5922
|
-
for (var
|
|
5923
|
-
var H, k,
|
|
5924
|
-
if (
|
|
5925
|
-
k =
|
|
5922
|
+
for (var y = this._hash.words, A = y[0], g = y[1], E = y[2], b = y[3], F = y[4], _ = y[5], S = y[6], R = y[7], q = A.high, w = A.low, C = g.high, N = g.low, L = E.high, Q = E.low, J = b.high, r0 = b.low, l0 = F.high, Y = F.low, h0 = _.high, a0 = _.low, O = S.high, z = S.low, M = R.high, U = R.low, p0 = q, d0 = w, A0 = C, e0 = N, T0 = L, st = Q, Nt = J, pt = r0, O0 = l0, w0 = Y, bt = h0, it = a0, vt = O, ot = z, Zt = M, At = U, T = 0; T < 80; T++) {
|
|
5923
|
+
var H, k, Z = h[T];
|
|
5924
|
+
if (T < 16)
|
|
5925
|
+
k = Z.high = f[l + T * 2] | 0, H = Z.low = f[l + T * 2 + 1] | 0;
|
|
5926
5926
|
else {
|
|
5927
|
-
var V = h[
|
|
5928
|
-
H = _0 + $r, k = f0 +
|
|
5927
|
+
var V = h[T - 15], t0 = V.high, x0 = V.low, f0 = (t0 >>> 1 | x0 << 31) ^ (t0 >>> 8 | x0 << 24) ^ t0 >>> 7, _0 = (x0 >>> 1 | t0 << 31) ^ (x0 >>> 8 | t0 << 24) ^ (x0 >>> 7 | t0 << 25), y0 = h[T - 2], g0 = y0.high, N0 = y0.low, Bt = (g0 >>> 19 | N0 << 13) ^ (g0 << 3 | N0 >>> 29) ^ g0 >>> 6, at = (N0 >>> 19 | g0 << 13) ^ (N0 << 3 | g0 >>> 29) ^ (N0 >>> 6 | g0 << 26), Ft = h[T - 7], Kt = Ft.high, $r = Ft.low, ie = h[T - 16], Mr = ie.high, me = ie.low;
|
|
5928
|
+
H = _0 + $r, k = f0 + Kt + (H >>> 0 < _0 >>> 0 ? 1 : 0), H = H + at, k = k + Bt + (H >>> 0 < at >>> 0 ? 1 : 0), H = H + me, k = k + Mr + (H >>> 0 < me >>> 0 ? 1 : 0), Z.high = k, Z.low = H;
|
|
5929
5929
|
}
|
|
5930
|
-
var jr = O0 & bt ^ ~O0 & vt, be = w0 & it ^ ~w0 & ot, Wr = p0 & A0 ^ p0 & T0 ^ A0 & T0, Zr = d0 & e0 ^ d0 & st ^ e0 & st, Kr = (p0 >>> 28 | d0 << 4) ^ (p0 << 30 | d0 >>> 2) ^ (p0 << 25 | d0 >>> 7), Ae = (d0 >>> 28 | p0 << 4) ^ (d0 << 30 | p0 >>> 2) ^ (d0 << 25 | p0 >>> 7), Gr = (O0 >>> 14 | w0 << 18) ^ (O0 >>> 18 | w0 << 14) ^ (O0 << 23 | w0 >>> 9), Xr = (w0 >>> 14 | O0 << 18) ^ (w0 >>> 18 | O0 << 14) ^ (w0 << 23 | O0 >>> 9), Fe = d[
|
|
5931
|
-
|
|
5930
|
+
var jr = O0 & bt ^ ~O0 & vt, be = w0 & it ^ ~w0 & ot, Wr = p0 & A0 ^ p0 & T0 ^ A0 & T0, Zr = d0 & e0 ^ d0 & st ^ e0 & st, Kr = (p0 >>> 28 | d0 << 4) ^ (p0 << 30 | d0 >>> 2) ^ (p0 << 25 | d0 >>> 7), Ae = (d0 >>> 28 | p0 << 4) ^ (d0 << 30 | p0 >>> 2) ^ (d0 << 25 | p0 >>> 7), Gr = (O0 >>> 14 | w0 << 18) ^ (O0 >>> 18 | w0 << 14) ^ (O0 << 23 | w0 >>> 9), Xr = (w0 >>> 14 | O0 << 18) ^ (w0 >>> 18 | O0 << 14) ^ (w0 << 23 | O0 >>> 9), Fe = d[T], Qr = Fe.high, Ce = Fe.low, P0 = At + Xr, ct = Zt + Gr + (P0 >>> 0 < At >>> 0 ? 1 : 0), P0 = P0 + be, ct = ct + jr + (P0 >>> 0 < be >>> 0 ? 1 : 0), P0 = P0 + Ce, ct = ct + Qr + (P0 >>> 0 < Ce >>> 0 ? 1 : 0), P0 = P0 + H, ct = ct + k + (P0 >>> 0 < H >>> 0 ? 1 : 0), De = Ae + Zr, Vr = Kr + Wr + (De >>> 0 < Ae >>> 0 ? 1 : 0);
|
|
5931
|
+
Zt = vt, At = ot, vt = bt, ot = it, bt = O0, it = w0, w0 = pt + P0 | 0, O0 = Nt + ct + (w0 >>> 0 < pt >>> 0 ? 1 : 0) | 0, Nt = T0, pt = st, T0 = A0, st = e0, A0 = p0, e0 = d0, d0 = P0 + De | 0, p0 = ct + Vr + (d0 >>> 0 < P0 >>> 0 ? 1 : 0) | 0;
|
|
5932
5932
|
}
|
|
5933
|
-
w = A.low = w + d0, A.high =
|
|
5933
|
+
w = A.low = w + d0, A.high = q + p0 + (w >>> 0 < d0 >>> 0 ? 1 : 0), N = g.low = N + e0, g.high = C + A0 + (N >>> 0 < e0 >>> 0 ? 1 : 0), Q = E.low = Q + st, E.high = L + T0 + (Q >>> 0 < st >>> 0 ? 1 : 0), r0 = b.low = r0 + pt, b.high = J + Nt + (r0 >>> 0 < pt >>> 0 ? 1 : 0), Y = F.low = Y + w0, F.high = l0 + O0 + (Y >>> 0 < w0 >>> 0 ? 1 : 0), a0 = _.low = a0 + it, _.high = h0 + bt + (a0 >>> 0 < it >>> 0 ? 1 : 0), z = S.low = z + ot, S.high = O + vt + (z >>> 0 < ot >>> 0 ? 1 : 0), U = R.low = U + At, R.high = M + Zt + (U >>> 0 < At >>> 0 ? 1 : 0);
|
|
5934
5934
|
},
|
|
5935
5935
|
_doFinalize: function() {
|
|
5936
|
-
var f = this._data, l = f.words,
|
|
5937
|
-
l[A >>> 5] |= 128 << 24 - A % 32, l[(A + 128 >>> 10 << 5) + 30] = Math.floor(
|
|
5936
|
+
var f = this._data, l = f.words, y = this._nDataBytes * 8, A = f.sigBytes * 8;
|
|
5937
|
+
l[A >>> 5] |= 128 << 24 - A % 32, l[(A + 128 >>> 10 << 5) + 30] = Math.floor(y / 4294967296), l[(A + 128 >>> 10 << 5) + 31] = y, f.sigBytes = l.length * 4, this._process();
|
|
5938
5938
|
var g = this._hash.toX32();
|
|
5939
5939
|
return g;
|
|
5940
5940
|
},
|
|
@@ -6002,29 +6002,29 @@ function mu() {
|
|
|
6002
6002
|
return function(n) {
|
|
6003
6003
|
var s = r, i = s.lib, o = i.WordArray, a = i.Hasher, B = s.x64, c = B.Word, x = s.algo, d = [], h = [], v = [];
|
|
6004
6004
|
(function() {
|
|
6005
|
-
for (var
|
|
6006
|
-
d[
|
|
6007
|
-
var
|
|
6008
|
-
|
|
6005
|
+
for (var y = 1, A = 0, g = 0; g < 24; g++) {
|
|
6006
|
+
d[y + 5 * A] = (g + 1) * (g + 2) / 2 % 64;
|
|
6007
|
+
var E = A % 5, b = (2 * y + 3 * A) % 5;
|
|
6008
|
+
y = E, A = b;
|
|
6009
6009
|
}
|
|
6010
|
-
for (var
|
|
6010
|
+
for (var y = 0; y < 5; y++)
|
|
6011
6011
|
for (var A = 0; A < 5; A++)
|
|
6012
|
-
h[
|
|
6012
|
+
h[y + 5 * A] = A + (2 * y + 3 * A) % 5 * 5;
|
|
6013
6013
|
for (var F = 1, _ = 0; _ < 24; _++) {
|
|
6014
|
-
for (var S = 0,
|
|
6014
|
+
for (var S = 0, R = 0, q = 0; q < 7; q++) {
|
|
6015
6015
|
if (F & 1) {
|
|
6016
|
-
var w = (1 <<
|
|
6017
|
-
w < 32 ?
|
|
6016
|
+
var w = (1 << q) - 1;
|
|
6017
|
+
w < 32 ? R ^= 1 << w : S ^= 1 << w - 32;
|
|
6018
6018
|
}
|
|
6019
6019
|
F & 128 ? F = F << 1 ^ 113 : F <<= 1;
|
|
6020
6020
|
}
|
|
6021
|
-
v[_] = c.create(S,
|
|
6021
|
+
v[_] = c.create(S, R);
|
|
6022
6022
|
}
|
|
6023
6023
|
})();
|
|
6024
6024
|
var f = [];
|
|
6025
6025
|
(function() {
|
|
6026
|
-
for (var
|
|
6027
|
-
f[
|
|
6026
|
+
for (var y = 0; y < 25; y++)
|
|
6027
|
+
f[y] = c.create();
|
|
6028
6028
|
})();
|
|
6029
6029
|
var l = x.SHA3 = a.extend({
|
|
6030
6030
|
/**
|
|
@@ -6039,29 +6039,29 @@ function mu() {
|
|
|
6039
6039
|
outputLength: 512
|
|
6040
6040
|
}),
|
|
6041
6041
|
_doReset: function() {
|
|
6042
|
-
for (var
|
|
6043
|
-
|
|
6042
|
+
for (var y = this._state = [], A = 0; A < 25; A++)
|
|
6043
|
+
y[A] = new c.init();
|
|
6044
6044
|
this.blockSize = (1600 - 2 * this.cfg.outputLength) / 32;
|
|
6045
6045
|
},
|
|
6046
|
-
_doProcessBlock: function(
|
|
6047
|
-
for (var g = this._state,
|
|
6048
|
-
var F =
|
|
6046
|
+
_doProcessBlock: function(y, A) {
|
|
6047
|
+
for (var g = this._state, E = this.blockSize / 2, b = 0; b < E; b++) {
|
|
6048
|
+
var F = y[A + 2 * b], _ = y[A + 2 * b + 1];
|
|
6049
6049
|
F = (F << 8 | F >>> 24) & 16711935 | (F << 24 | F >>> 8) & 4278255360, _ = (_ << 8 | _ >>> 24) & 16711935 | (_ << 24 | _ >>> 8) & 4278255360;
|
|
6050
6050
|
var S = g[b];
|
|
6051
6051
|
S.high ^= _, S.low ^= F;
|
|
6052
6052
|
}
|
|
6053
|
-
for (var
|
|
6054
|
-
for (var
|
|
6053
|
+
for (var R = 0; R < 24; R++) {
|
|
6054
|
+
for (var q = 0; q < 5; q++) {
|
|
6055
6055
|
for (var w = 0, C = 0, N = 0; N < 5; N++) {
|
|
6056
|
-
var S = g[
|
|
6056
|
+
var S = g[q + 5 * N];
|
|
6057
6057
|
w ^= S.high, C ^= S.low;
|
|
6058
6058
|
}
|
|
6059
|
-
var L = f[
|
|
6059
|
+
var L = f[q];
|
|
6060
6060
|
L.high = w, L.low = C;
|
|
6061
6061
|
}
|
|
6062
|
-
for (var
|
|
6063
|
-
for (var Q = f[(
|
|
6064
|
-
var S = g[
|
|
6062
|
+
for (var q = 0; q < 5; q++)
|
|
6063
|
+
for (var Q = f[(q + 4) % 5], J = f[(q + 1) % 5], r0 = J.high, l0 = J.low, w = Q.high ^ (r0 << 1 | l0 >>> 31), C = Q.low ^ (l0 << 1 | r0 >>> 31), N = 0; N < 5; N++) {
|
|
6064
|
+
var S = g[q + 5 * N];
|
|
6065
6065
|
S.high ^= w, S.low ^= C;
|
|
6066
6066
|
}
|
|
6067
6067
|
for (var Y = 1; Y < 25; Y++) {
|
|
@@ -6072,30 +6072,30 @@ function mu() {
|
|
|
6072
6072
|
}
|
|
6073
6073
|
var M = f[0], U = g[0];
|
|
6074
6074
|
M.high = U.high, M.low = U.low;
|
|
6075
|
-
for (var
|
|
6075
|
+
for (var q = 0; q < 5; q++)
|
|
6076
6076
|
for (var N = 0; N < 5; N++) {
|
|
6077
|
-
var Y =
|
|
6077
|
+
var Y = q + 5 * N, S = g[Y], p0 = f[Y], d0 = f[(q + 1) % 5 + 5 * N], A0 = f[(q + 2) % 5 + 5 * N];
|
|
6078
6078
|
S.high = p0.high ^ ~d0.high & A0.high, S.low = p0.low ^ ~d0.low & A0.low;
|
|
6079
6079
|
}
|
|
6080
|
-
var S = g[0], e0 = v[
|
|
6080
|
+
var S = g[0], e0 = v[R];
|
|
6081
6081
|
S.high ^= e0.high, S.low ^= e0.low;
|
|
6082
6082
|
}
|
|
6083
6083
|
},
|
|
6084
6084
|
_doFinalize: function() {
|
|
6085
|
-
var
|
|
6085
|
+
var y = this._data, A = y.words;
|
|
6086
6086
|
this._nDataBytes * 8;
|
|
6087
|
-
var g =
|
|
6088
|
-
A[g >>> 5] |= 1 << 24 - g % 32, A[(n.ceil((g + 1) /
|
|
6089
|
-
for (var b = this._state, F = this.cfg.outputLength / 8, _ = F / 8, S = [],
|
|
6090
|
-
var
|
|
6087
|
+
var g = y.sigBytes * 8, E = this.blockSize * 32;
|
|
6088
|
+
A[g >>> 5] |= 1 << 24 - g % 32, A[(n.ceil((g + 1) / E) * E >>> 5) - 1] |= 128, y.sigBytes = A.length * 4, this._process();
|
|
6089
|
+
for (var b = this._state, F = this.cfg.outputLength / 8, _ = F / 8, S = [], R = 0; R < _; R++) {
|
|
6090
|
+
var q = b[R], w = q.high, C = q.low;
|
|
6091
6091
|
w = (w << 8 | w >>> 24) & 16711935 | (w << 24 | w >>> 8) & 4278255360, C = (C << 8 | C >>> 24) & 16711935 | (C << 24 | C >>> 8) & 4278255360, S.push(C), S.push(w);
|
|
6092
6092
|
}
|
|
6093
6093
|
return new o.init(S, F);
|
|
6094
6094
|
},
|
|
6095
6095
|
clone: function() {
|
|
6096
|
-
for (var
|
|
6096
|
+
for (var y = a.clone.call(this), A = y._state = this._state.slice(0), g = 0; g < 25; g++)
|
|
6097
6097
|
A[g] = A[g].clone();
|
|
6098
|
-
return
|
|
6098
|
+
return y;
|
|
6099
6099
|
}
|
|
6100
6100
|
});
|
|
6101
6101
|
s.SHA3 = a._createHelper(l), s.HmacSHA3 = a._createHmacHelper(l);
|
|
@@ -6456,19 +6456,19 @@ function Au() {
|
|
|
6456
6456
|
this._hash = o.create([1732584193, 4023233417, 2562383102, 271733878, 3285377520]);
|
|
6457
6457
|
},
|
|
6458
6458
|
_doProcessBlock: function(_, S) {
|
|
6459
|
-
for (var
|
|
6460
|
-
var
|
|
6461
|
-
_[
|
|
6459
|
+
for (var R = 0; R < 16; R++) {
|
|
6460
|
+
var q = S + R, w = _[q];
|
|
6461
|
+
_[q] = (w << 8 | w >>> 24) & 16711935 | (w << 24 | w >>> 8) & 4278255360;
|
|
6462
6462
|
}
|
|
6463
6463
|
var C = this._hash.words, N = v.words, L = f.words, Q = c.words, J = x.words, r0 = d.words, l0 = h.words, Y, h0, a0, O, z, M, U, p0, d0, A0;
|
|
6464
6464
|
M = Y = C[0], U = h0 = C[1], p0 = a0 = C[2], d0 = O = C[3], A0 = z = C[4];
|
|
6465
|
-
for (var e0,
|
|
6466
|
-
e0 = Y + _[S + Q[
|
|
6465
|
+
for (var e0, R = 0; R < 80; R += 1)
|
|
6466
|
+
e0 = Y + _[S + Q[R]] | 0, R < 16 ? e0 += y(h0, a0, O) + N[0] : R < 32 ? e0 += A(h0, a0, O) + N[1] : R < 48 ? e0 += g(h0, a0, O) + N[2] : R < 64 ? e0 += E(h0, a0, O) + N[3] : e0 += b(h0, a0, O) + N[4], e0 = e0 | 0, e0 = F(e0, r0[R]), e0 = e0 + z | 0, Y = z, z = O, O = F(a0, 10), a0 = h0, h0 = e0, e0 = M + _[S + J[R]] | 0, R < 16 ? e0 += b(U, p0, d0) + L[0] : R < 32 ? e0 += E(U, p0, d0) + L[1] : R < 48 ? e0 += g(U, p0, d0) + L[2] : R < 64 ? e0 += A(U, p0, d0) + L[3] : e0 += y(U, p0, d0) + L[4], e0 = e0 | 0, e0 = F(e0, l0[R]), e0 = e0 + A0 | 0, M = A0, A0 = d0, d0 = F(p0, 10), p0 = U, U = e0;
|
|
6467
6467
|
e0 = C[1] + a0 + d0 | 0, C[1] = C[2] + O + A0 | 0, C[2] = C[3] + z + M | 0, C[3] = C[4] + Y + U | 0, C[4] = C[0] + h0 + p0 | 0, C[0] = e0;
|
|
6468
6468
|
},
|
|
6469
6469
|
_doFinalize: function() {
|
|
6470
|
-
var _ = this._data, S = _.words,
|
|
6471
|
-
S[
|
|
6470
|
+
var _ = this._data, S = _.words, R = this._nDataBytes * 8, q = _.sigBytes * 8;
|
|
6471
|
+
S[q >>> 5] |= 128 << 24 - q % 32, S[(q + 64 >>> 9 << 4) + 14] = (R << 8 | R >>> 24) & 16711935 | (R << 24 | R >>> 8) & 4278255360, _.sigBytes = (S.length + 1) * 4, this._process();
|
|
6472
6472
|
for (var w = this._hash, C = w.words, N = 0; N < 5; N++) {
|
|
6473
6473
|
var L = C[N];
|
|
6474
6474
|
C[N] = (L << 8 | L >>> 24) & 16711935 | (L << 24 | L >>> 8) & 4278255360;
|
|
@@ -6480,20 +6480,20 @@ function Au() {
|
|
|
6480
6480
|
return _._hash = this._hash.clone(), _;
|
|
6481
6481
|
}
|
|
6482
6482
|
});
|
|
6483
|
-
function
|
|
6484
|
-
return _ ^ S ^
|
|
6483
|
+
function y(_, S, R) {
|
|
6484
|
+
return _ ^ S ^ R;
|
|
6485
6485
|
}
|
|
6486
|
-
function A(_, S,
|
|
6487
|
-
return _ & S | ~_ &
|
|
6486
|
+
function A(_, S, R) {
|
|
6487
|
+
return _ & S | ~_ & R;
|
|
6488
6488
|
}
|
|
6489
|
-
function g(_, S,
|
|
6490
|
-
return (_ | ~S) ^
|
|
6489
|
+
function g(_, S, R) {
|
|
6490
|
+
return (_ | ~S) ^ R;
|
|
6491
6491
|
}
|
|
6492
|
-
function
|
|
6493
|
-
return _ &
|
|
6492
|
+
function E(_, S, R) {
|
|
6493
|
+
return _ & R | S & ~R;
|
|
6494
6494
|
}
|
|
6495
|
-
function b(_, S,
|
|
6496
|
-
return _ ^ (S | ~
|
|
6495
|
+
function b(_, S, R) {
|
|
6496
|
+
return _ ^ (S | ~R);
|
|
6497
6497
|
}
|
|
6498
6498
|
function F(_, S) {
|
|
6499
6499
|
return _ << S | _ >>> 32 - S;
|
|
@@ -6533,8 +6533,8 @@ function Ln() {
|
|
|
6533
6533
|
c = this._hasher = new c.init(), typeof x == "string" && (x = a.parse(x));
|
|
6534
6534
|
var d = c.blockSize, h = d * 4;
|
|
6535
6535
|
x.sigBytes > h && (x = c.finalize(x)), x.clamp();
|
|
6536
|
-
for (var v = this._oKey = x.clone(), f = this._iKey = x.clone(), l = v.words,
|
|
6537
|
-
l[A] ^= 1549556828,
|
|
6536
|
+
for (var v = this._oKey = x.clone(), f = this._iKey = x.clone(), l = v.words, y = f.words, A = 0; A < d; A++)
|
|
6537
|
+
l[A] ^= 1549556828, y[A] ^= 909522486;
|
|
6538
6538
|
v.sigBytes = f.sigBytes = h, this.reset();
|
|
6539
6539
|
},
|
|
6540
6540
|
/**
|
|
@@ -6642,17 +6642,17 @@ function Du() {
|
|
|
6642
6642
|
* var key = kdf.compute(password, salt);
|
|
6643
6643
|
*/
|
|
6644
6644
|
compute: function(d, h) {
|
|
6645
|
-
for (var v = this.cfg, f = c.create(v.hasher, d), l = o.create(),
|
|
6646
|
-
var F = f.update(h).finalize(
|
|
6645
|
+
for (var v = this.cfg, f = c.create(v.hasher, d), l = o.create(), y = o.create([1]), A = l.words, g = y.words, E = v.keySize, b = v.iterations; A.length < E; ) {
|
|
6646
|
+
var F = f.update(h).finalize(y);
|
|
6647
6647
|
f.reset();
|
|
6648
|
-
for (var _ = F.words, S = _.length,
|
|
6649
|
-
|
|
6650
|
-
for (var w =
|
|
6648
|
+
for (var _ = F.words, S = _.length, R = F, q = 1; q < b; q++) {
|
|
6649
|
+
R = f.finalize(R), f.reset();
|
|
6650
|
+
for (var w = R.words, C = 0; C < S; C++)
|
|
6651
6651
|
_[C] ^= w[C];
|
|
6652
6652
|
}
|
|
6653
6653
|
l.concat(F), g[0]++;
|
|
6654
6654
|
}
|
|
6655
|
-
return l.sigBytes =
|
|
6655
|
+
return l.sigBytes = E * 4, l;
|
|
6656
6656
|
}
|
|
6657
6657
|
});
|
|
6658
6658
|
n.PBKDF2 = function(d, h, v) {
|
|
@@ -6670,7 +6670,7 @@ var xr = {}, wu = {
|
|
|
6670
6670
|
xr = t;
|
|
6671
6671
|
}
|
|
6672
6672
|
}, Is;
|
|
6673
|
-
function
|
|
6673
|
+
function qt() {
|
|
6674
6674
|
return Is || (Is = 1, function(t, e) {
|
|
6675
6675
|
(function(r, n, s) {
|
|
6676
6676
|
t.exports = n(o0(), go(), Ln());
|
|
@@ -6716,9 +6716,9 @@ function It() {
|
|
|
6716
6716
|
* var key = kdf.compute(password, salt);
|
|
6717
6717
|
*/
|
|
6718
6718
|
compute: function(x, d) {
|
|
6719
|
-
for (var h, v = this.cfg, f = v.hasher.create(), l = o.create(),
|
|
6719
|
+
for (var h, v = this.cfg, f = v.hasher.create(), l = o.create(), y = l.words, A = v.keySize, g = v.iterations; y.length < A; ) {
|
|
6720
6720
|
h && f.update(h), h = f.update(x).finalize(d), f.reset();
|
|
6721
|
-
for (var
|
|
6721
|
+
for (var E = 1; E < g; E++)
|
|
6722
6722
|
h = f.finalize(h), f.reset();
|
|
6723
6723
|
l.concat(h);
|
|
6724
6724
|
}
|
|
@@ -6743,7 +6743,7 @@ var fr = {}, _u = {
|
|
|
6743
6743
|
function D0() {
|
|
6744
6744
|
return qs || (qs = 1, function(t, e) {
|
|
6745
6745
|
(function(r, n, s) {
|
|
6746
|
-
t.exports = n(o0(),
|
|
6746
|
+
t.exports = n(o0(), qt());
|
|
6747
6747
|
})(s0, function(r) {
|
|
6748
6748
|
r.lib.Cipher || function(n) {
|
|
6749
6749
|
var s = r, i = s.lib, o = i.Base, a = i.WordArray, B = i.BufferedBlockAlgorithm, c = s.enc;
|
|
@@ -6866,7 +6866,7 @@ function D0() {
|
|
|
6866
6866
|
*/
|
|
6867
6867
|
_createHelper: function() {
|
|
6868
6868
|
function w(C) {
|
|
6869
|
-
return typeof C == "string" ?
|
|
6869
|
+
return typeof C == "string" ? q : _;
|
|
6870
6870
|
}
|
|
6871
6871
|
return function(C) {
|
|
6872
6872
|
return {
|
|
@@ -6931,7 +6931,7 @@ function D0() {
|
|
|
6931
6931
|
init: function(w, C) {
|
|
6932
6932
|
this._cipher = w, this._iv = C;
|
|
6933
6933
|
}
|
|
6934
|
-
}),
|
|
6934
|
+
}), y = f.CBC = function() {
|
|
6935
6935
|
var w = l.extend();
|
|
6936
6936
|
w.Encryptor = w.extend({
|
|
6937
6937
|
/**
|
|
@@ -7014,7 +7014,7 @@ function D0() {
|
|
|
7014
7014
|
* @property {Padding} padding The padding strategy to use. Default: Pkcs7
|
|
7015
7015
|
*/
|
|
7016
7016
|
cfg: v.cfg.extend({
|
|
7017
|
-
mode:
|
|
7017
|
+
mode: y,
|
|
7018
7018
|
padding: g
|
|
7019
7019
|
}),
|
|
7020
7020
|
reset: function() {
|
|
@@ -7032,7 +7032,7 @@ function D0() {
|
|
|
7032
7032
|
},
|
|
7033
7033
|
blockSize: 128 / 32
|
|
7034
7034
|
});
|
|
7035
|
-
var
|
|
7035
|
+
var E = i.CipherParams = o.extend({
|
|
7036
7036
|
/**
|
|
7037
7037
|
* Initializes a newly created cipher params object.
|
|
7038
7038
|
*
|
|
@@ -7106,7 +7106,7 @@ function D0() {
|
|
|
7106
7106
|
*/
|
|
7107
7107
|
parse: function(w) {
|
|
7108
7108
|
var C, N = x.parse(w), L = N.words;
|
|
7109
|
-
return L[0] == 1398893684 && L[1] == 1701076831 && (C = a.create(L.slice(2, 4)), L.splice(0, 4), N.sigBytes -= 16),
|
|
7109
|
+
return L[0] == 1398893684 && L[1] == 1701076831 && (C = a.create(L.slice(2, 4)), L.splice(0, 4), N.sigBytes -= 16), E.create({ ciphertext: N, salt: C });
|
|
7110
7110
|
}
|
|
7111
7111
|
}, _ = i.SerializableCipher = o.extend({
|
|
7112
7112
|
/**
|
|
@@ -7138,7 +7138,7 @@ function D0() {
|
|
|
7138
7138
|
encrypt: function(w, C, N, L) {
|
|
7139
7139
|
L = this.cfg.extend(L);
|
|
7140
7140
|
var Q = w.createEncryptor(N, L), J = Q.finalize(C), r0 = Q.cfg;
|
|
7141
|
-
return
|
|
7141
|
+
return E.create({
|
|
7142
7142
|
ciphertext: J,
|
|
7143
7143
|
key: N,
|
|
7144
7144
|
iv: r0.iv,
|
|
@@ -7189,7 +7189,7 @@ function D0() {
|
|
|
7189
7189
|
_parse: function(w, C) {
|
|
7190
7190
|
return typeof w == "string" ? C.parse(w, this) : w;
|
|
7191
7191
|
}
|
|
7192
|
-
}), S = s.kdf = {},
|
|
7192
|
+
}), S = s.kdf = {}, R = S.OpenSSL = {
|
|
7193
7193
|
/**
|
|
7194
7194
|
* Derives a key and IV from a password.
|
|
7195
7195
|
*
|
|
@@ -7213,16 +7213,16 @@ function D0() {
|
|
|
7213
7213
|
else
|
|
7214
7214
|
var J = h.create({ keySize: C + N }).compute(w, L);
|
|
7215
7215
|
var r0 = a.create(J.words.slice(C), N * 4);
|
|
7216
|
-
return J.sigBytes = C * 4,
|
|
7216
|
+
return J.sigBytes = C * 4, E.create({ key: J, iv: r0, salt: L });
|
|
7217
7217
|
}
|
|
7218
|
-
},
|
|
7218
|
+
}, q = i.PasswordBasedCipher = _.extend({
|
|
7219
7219
|
/**
|
|
7220
7220
|
* Configuration options.
|
|
7221
7221
|
*
|
|
7222
7222
|
* @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL
|
|
7223
7223
|
*/
|
|
7224
7224
|
cfg: _.cfg.extend({
|
|
7225
|
-
kdf:
|
|
7225
|
+
kdf: R
|
|
7226
7226
|
}),
|
|
7227
7227
|
/**
|
|
7228
7228
|
* Encrypts a message using a password.
|
|
@@ -7636,54 +7636,54 @@ var br = {}, Vu = {
|
|
|
7636
7636
|
function Yu() {
|
|
7637
7637
|
return Xs || (Xs = 1, function(t, e) {
|
|
7638
7638
|
(function(r, n, s) {
|
|
7639
|
-
t.exports = n(o0(),
|
|
7639
|
+
t.exports = n(o0(), jt(), Wt(), qt(), D0());
|
|
7640
7640
|
})(s0, function(r) {
|
|
7641
7641
|
return function() {
|
|
7642
|
-
var n = r, s = n.lib, i = s.BlockCipher, o = n.algo, a = [], B = [], c = [], x = [], d = [], h = [], v = [], f = [], l = [],
|
|
7642
|
+
var n = r, s = n.lib, i = s.BlockCipher, o = n.algo, a = [], B = [], c = [], x = [], d = [], h = [], v = [], f = [], l = [], y = [];
|
|
7643
7643
|
(function() {
|
|
7644
|
-
for (var
|
|
7645
|
-
b < 128 ?
|
|
7644
|
+
for (var E = [], b = 0; b < 256; b++)
|
|
7645
|
+
b < 128 ? E[b] = b << 1 : E[b] = b << 1 ^ 283;
|
|
7646
7646
|
for (var F = 0, _ = 0, b = 0; b < 256; b++) {
|
|
7647
7647
|
var S = _ ^ _ << 1 ^ _ << 2 ^ _ << 3 ^ _ << 4;
|
|
7648
7648
|
S = S >>> 8 ^ S & 255 ^ 99, a[F] = S, B[S] = F;
|
|
7649
|
-
var
|
|
7649
|
+
var R = E[F], q = E[R], w = E[q], C = E[S] * 257 ^ S * 16843008;
|
|
7650
7650
|
c[F] = C << 24 | C >>> 8, x[F] = C << 16 | C >>> 16, d[F] = C << 8 | C >>> 24, h[F] = C;
|
|
7651
|
-
var C = w * 16843009 ^
|
|
7652
|
-
v[S] = C << 24 | C >>> 8, f[S] = C << 16 | C >>> 16, l[S] = C << 8 | C >>> 24,
|
|
7651
|
+
var C = w * 16843009 ^ q * 65537 ^ R * 257 ^ F * 16843008;
|
|
7652
|
+
v[S] = C << 24 | C >>> 8, f[S] = C << 16 | C >>> 16, l[S] = C << 8 | C >>> 24, y[S] = C, F ? (F = R ^ E[E[E[w ^ R]]], _ ^= E[E[_]]) : F = _ = 1;
|
|
7653
7653
|
}
|
|
7654
7654
|
})();
|
|
7655
7655
|
var A = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], g = o.AES = i.extend({
|
|
7656
7656
|
_doReset: function() {
|
|
7657
|
-
var
|
|
7657
|
+
var E;
|
|
7658
7658
|
if (!(this._nRounds && this._keyPriorReset === this._key)) {
|
|
7659
|
-
for (var b = this._keyPriorReset = this._key, F = b.words, _ = b.sigBytes / 4, S = this._nRounds = _ + 6,
|
|
7660
|
-
w < _ ?
|
|
7661
|
-
for (var C = this._invKeySchedule = [], N = 0; N <
|
|
7662
|
-
var w =
|
|
7659
|
+
for (var b = this._keyPriorReset = this._key, F = b.words, _ = b.sigBytes / 4, S = this._nRounds = _ + 6, R = (S + 1) * 4, q = this._keySchedule = [], w = 0; w < R; w++)
|
|
7660
|
+
w < _ ? q[w] = F[w] : (E = q[w - 1], w % _ ? _ > 6 && w % _ == 4 && (E = a[E >>> 24] << 24 | a[E >>> 16 & 255] << 16 | a[E >>> 8 & 255] << 8 | a[E & 255]) : (E = E << 8 | E >>> 24, E = a[E >>> 24] << 24 | a[E >>> 16 & 255] << 16 | a[E >>> 8 & 255] << 8 | a[E & 255], E ^= A[w / _ | 0] << 24), q[w] = q[w - _] ^ E);
|
|
7661
|
+
for (var C = this._invKeySchedule = [], N = 0; N < R; N++) {
|
|
7662
|
+
var w = R - N;
|
|
7663
7663
|
if (N % 4)
|
|
7664
|
-
var
|
|
7664
|
+
var E = q[w];
|
|
7665
7665
|
else
|
|
7666
|
-
var
|
|
7667
|
-
N < 4 || w <= 4 ? C[N] =
|
|
7666
|
+
var E = q[w - 4];
|
|
7667
|
+
N < 4 || w <= 4 ? C[N] = E : C[N] = v[a[E >>> 24]] ^ f[a[E >>> 16 & 255]] ^ l[a[E >>> 8 & 255]] ^ y[a[E & 255]];
|
|
7668
7668
|
}
|
|
7669
7669
|
}
|
|
7670
7670
|
},
|
|
7671
|
-
encryptBlock: function(
|
|
7672
|
-
this._doCryptBlock(
|
|
7671
|
+
encryptBlock: function(E, b) {
|
|
7672
|
+
this._doCryptBlock(E, b, this._keySchedule, c, x, d, h, a);
|
|
7673
7673
|
},
|
|
7674
|
-
decryptBlock: function(
|
|
7675
|
-
var F =
|
|
7676
|
-
|
|
7677
|
-
var F =
|
|
7678
|
-
|
|
7674
|
+
decryptBlock: function(E, b) {
|
|
7675
|
+
var F = E[b + 1];
|
|
7676
|
+
E[b + 1] = E[b + 3], E[b + 3] = F, this._doCryptBlock(E, b, this._invKeySchedule, v, f, l, y, B);
|
|
7677
|
+
var F = E[b + 1];
|
|
7678
|
+
E[b + 1] = E[b + 3], E[b + 3] = F;
|
|
7679
7679
|
},
|
|
7680
|
-
_doCryptBlock: function(
|
|
7681
|
-
for (var C = this._nRounds, N =
|
|
7682
|
-
var Y = _[N >>> 24] ^ S[L >>> 16 & 255] ^
|
|
7680
|
+
_doCryptBlock: function(E, b, F, _, S, R, q, w) {
|
|
7681
|
+
for (var C = this._nRounds, N = E[b] ^ F[0], L = E[b + 1] ^ F[1], Q = E[b + 2] ^ F[2], J = E[b + 3] ^ F[3], r0 = 4, l0 = 1; l0 < C; l0++) {
|
|
7682
|
+
var Y = _[N >>> 24] ^ S[L >>> 16 & 255] ^ R[Q >>> 8 & 255] ^ q[J & 255] ^ F[r0++], h0 = _[L >>> 24] ^ S[Q >>> 16 & 255] ^ R[J >>> 8 & 255] ^ q[N & 255] ^ F[r0++], a0 = _[Q >>> 24] ^ S[J >>> 16 & 255] ^ R[N >>> 8 & 255] ^ q[L & 255] ^ F[r0++], O = _[J >>> 24] ^ S[N >>> 16 & 255] ^ R[L >>> 8 & 255] ^ q[Q & 255] ^ F[r0++];
|
|
7683
7683
|
N = Y, L = h0, Q = a0, J = O;
|
|
7684
7684
|
}
|
|
7685
7685
|
var Y = (w[N >>> 24] << 24 | w[L >>> 16 & 255] << 16 | w[Q >>> 8 & 255] << 8 | w[J & 255]) ^ F[r0++], h0 = (w[L >>> 24] << 24 | w[Q >>> 16 & 255] << 16 | w[J >>> 8 & 255] << 8 | w[N & 255]) ^ F[r0++], a0 = (w[Q >>> 24] << 24 | w[J >>> 16 & 255] << 16 | w[N >>> 8 & 255] << 8 | w[L & 255]) ^ F[r0++], O = (w[J >>> 24] << 24 | w[N >>> 16 & 255] << 16 | w[L >>> 8 & 255] << 8 | w[Q & 255]) ^ F[r0++];
|
|
7686
|
-
|
|
7686
|
+
E[b] = Y, E[b + 1] = h0, E[b + 2] = a0, E[b + 3] = O;
|
|
7687
7687
|
},
|
|
7688
7688
|
keySize: 256 / 32
|
|
7689
7689
|
});
|
|
@@ -7703,7 +7703,7 @@ var Ar = {}, Ju = {
|
|
|
7703
7703
|
function tl() {
|
|
7704
7704
|
return Qs || (Qs = 1, function(t, e) {
|
|
7705
7705
|
(function(r, n, s) {
|
|
7706
|
-
t.exports = n(o0(),
|
|
7706
|
+
t.exports = n(o0(), jt(), Wt(), qt(), D0());
|
|
7707
7707
|
})(s0, function(r) {
|
|
7708
7708
|
return function() {
|
|
7709
7709
|
var n = r, s = n.lib, i = s.WordArray, o = s.BlockCipher, a = n.algo, B = [
|
|
@@ -8352,17 +8352,17 @@ function tl() {
|
|
|
8352
8352
|
2147483679
|
|
8353
8353
|
], v = a.DES = o.extend({
|
|
8354
8354
|
_doReset: function() {
|
|
8355
|
-
for (var A = this._key, g = A.words,
|
|
8355
|
+
for (var A = this._key, g = A.words, E = [], b = 0; b < 56; b++) {
|
|
8356
8356
|
var F = B[b] - 1;
|
|
8357
|
-
|
|
8357
|
+
E[b] = g[F >>> 5] >>> 31 - F % 32 & 1;
|
|
8358
8358
|
}
|
|
8359
8359
|
for (var _ = this._subKeys = [], S = 0; S < 16; S++) {
|
|
8360
|
-
for (var
|
|
8361
|
-
|
|
8362
|
-
|
|
8360
|
+
for (var R = _[S] = [], q = x[S], b = 0; b < 24; b++)
|
|
8361
|
+
R[b / 6 | 0] |= E[(c[b] - 1 + q) % 28] << 31 - b % 6, R[4 + (b / 6 | 0)] |= E[28 + (c[b + 24] - 1 + q) % 28] << 31 - b % 6;
|
|
8362
|
+
R[0] = R[0] << 1 | R[0] >>> 31;
|
|
8363
8363
|
for (var b = 1; b < 7; b++)
|
|
8364
|
-
|
|
8365
|
-
|
|
8364
|
+
R[b] = R[b] >>> (b - 1) * 4 + 3;
|
|
8365
|
+
R[7] = R[7] << 5 | R[7] >>> 27;
|
|
8366
8366
|
}
|
|
8367
8367
|
for (var w = this._invSubKeys = [], b = 0; b < 16; b++)
|
|
8368
8368
|
w[b] = _[15 - b];
|
|
@@ -8373,12 +8373,12 @@ function tl() {
|
|
|
8373
8373
|
decryptBlock: function(A, g) {
|
|
8374
8374
|
this._doCryptBlock(A, g, this._invSubKeys);
|
|
8375
8375
|
},
|
|
8376
|
-
_doCryptBlock: function(A, g,
|
|
8376
|
+
_doCryptBlock: function(A, g, E) {
|
|
8377
8377
|
this._lBlock = A[g], this._rBlock = A[g + 1], f.call(this, 4, 252645135), f.call(this, 16, 65535), l.call(this, 2, 858993459), l.call(this, 8, 16711935), f.call(this, 1, 1431655765);
|
|
8378
8378
|
for (var b = 0; b < 16; b++) {
|
|
8379
|
-
for (var F =
|
|
8380
|
-
|
|
8381
|
-
this._lBlock = S, this._rBlock = _ ^
|
|
8379
|
+
for (var F = E[b], _ = this._lBlock, S = this._rBlock, R = 0, q = 0; q < 8; q++)
|
|
8380
|
+
R |= d[q][((S ^ F[q]) & h[q]) >>> 0];
|
|
8381
|
+
this._lBlock = S, this._rBlock = _ ^ R;
|
|
8382
8382
|
}
|
|
8383
8383
|
var w = this._lBlock;
|
|
8384
8384
|
this._lBlock = this._rBlock, this._rBlock = w, f.call(this, 1, 1431655765), l.call(this, 8, 16711935), l.call(this, 2, 858993459), f.call(this, 16, 65535), f.call(this, 4, 252645135), A[g] = this._lBlock, A[g + 1] = this._rBlock;
|
|
@@ -8388,21 +8388,21 @@ function tl() {
|
|
|
8388
8388
|
blockSize: 64 / 32
|
|
8389
8389
|
});
|
|
8390
8390
|
function f(A, g) {
|
|
8391
|
-
var
|
|
8392
|
-
this._rBlock ^=
|
|
8391
|
+
var E = (this._lBlock >>> A ^ this._rBlock) & g;
|
|
8392
|
+
this._rBlock ^= E, this._lBlock ^= E << A;
|
|
8393
8393
|
}
|
|
8394
8394
|
function l(A, g) {
|
|
8395
|
-
var
|
|
8396
|
-
this._lBlock ^=
|
|
8395
|
+
var E = (this._rBlock >>> A ^ this._lBlock) & g;
|
|
8396
|
+
this._lBlock ^= E, this._rBlock ^= E << A;
|
|
8397
8397
|
}
|
|
8398
8398
|
n.DES = o._createHelper(v);
|
|
8399
|
-
var
|
|
8399
|
+
var y = a.TripleDES = o.extend({
|
|
8400
8400
|
_doReset: function() {
|
|
8401
8401
|
var A = this._key, g = A.words;
|
|
8402
8402
|
if (g.length !== 2 && g.length !== 4 && g.length < 6)
|
|
8403
8403
|
throw new Error("Invalid key length - 3DES requires the key length to be 64, 128, 192 or >192.");
|
|
8404
|
-
var
|
|
8405
|
-
this._des1 = v.createEncryptor(i.create(
|
|
8404
|
+
var E = g.slice(0, 2), b = g.length < 4 ? g.slice(0, 2) : g.slice(2, 4), F = g.length < 6 ? g.slice(0, 2) : g.slice(4, 6);
|
|
8405
|
+
this._des1 = v.createEncryptor(i.create(E)), this._des2 = v.createEncryptor(i.create(b)), this._des3 = v.createEncryptor(i.create(F));
|
|
8406
8406
|
},
|
|
8407
8407
|
encryptBlock: function(A, g) {
|
|
8408
8408
|
this._des1.encryptBlock(A, g), this._des2.decryptBlock(A, g), this._des3.encryptBlock(A, g);
|
|
@@ -8414,7 +8414,7 @@ function tl() {
|
|
|
8414
8414
|
ivSize: 64 / 32,
|
|
8415
8415
|
blockSize: 64 / 32
|
|
8416
8416
|
});
|
|
8417
|
-
n.TripleDES = o._createHelper(
|
|
8417
|
+
n.TripleDES = o._createHelper(y);
|
|
8418
8418
|
}(), r.TripleDES;
|
|
8419
8419
|
});
|
|
8420
8420
|
}(Ju)), Ar;
|
|
@@ -8430,7 +8430,7 @@ var Fr = {}, el = {
|
|
|
8430
8430
|
function rl() {
|
|
8431
8431
|
return Vs || (Vs = 1, function(t, e) {
|
|
8432
8432
|
(function(r, n, s) {
|
|
8433
|
-
t.exports = n(o0(),
|
|
8433
|
+
t.exports = n(o0(), jt(), Wt(), qt(), D0());
|
|
8434
8434
|
})(s0, function(r) {
|
|
8435
8435
|
return function() {
|
|
8436
8436
|
var n = r, s = n.lib, i = s.StreamCipher, o = n.algo, a = o.RC4 = i.extend({
|
|
@@ -8438,7 +8438,7 @@ function rl() {
|
|
|
8438
8438
|
for (var x = this._key, d = x.words, h = x.sigBytes, v = this._S = [], f = 0; f < 256; f++)
|
|
8439
8439
|
v[f] = f;
|
|
8440
8440
|
for (var f = 0, l = 0; f < 256; f++) {
|
|
8441
|
-
var
|
|
8441
|
+
var y = f % h, A = d[y >>> 2] >>> 24 - y % 4 * 8 & 255;
|
|
8442
8442
|
l = (l + v[f] + A) % 256;
|
|
8443
8443
|
var g = v[f];
|
|
8444
8444
|
v[f] = v[l], v[l] = g;
|
|
@@ -8491,7 +8491,7 @@ var Cr = {}, nl = {
|
|
|
8491
8491
|
function sl() {
|
|
8492
8492
|
return Ys || (Ys = 1, function(t, e) {
|
|
8493
8493
|
(function(r, n, s) {
|
|
8494
|
-
t.exports = n(o0(),
|
|
8494
|
+
t.exports = n(o0(), jt(), Wt(), qt(), D0());
|
|
8495
8495
|
})(s0, function(r) {
|
|
8496
8496
|
return function() {
|
|
8497
8497
|
var n = r, s = n.lib, i = s.StreamCipher, o = n.algo, a = [], B = [], c = [], x = o.Rabbit = i.extend({
|
|
@@ -8507,7 +8507,7 @@ function sl() {
|
|
|
8507
8507
|
h[1] << 16 | h[0] >>> 16,
|
|
8508
8508
|
h[3],
|
|
8509
8509
|
h[2] << 16 | h[1] >>> 16
|
|
8510
|
-
],
|
|
8510
|
+
], y = this._C = [
|
|
8511
8511
|
h[2] << 16 | h[2] >>> 16,
|
|
8512
8512
|
h[0] & 4294901760 | h[1] & 65535,
|
|
8513
8513
|
h[3] << 16 | h[3] >>> 16,
|
|
@@ -8521,10 +8521,10 @@ function sl() {
|
|
|
8521
8521
|
for (var f = 0; f < 4; f++)
|
|
8522
8522
|
d.call(this);
|
|
8523
8523
|
for (var f = 0; f < 8; f++)
|
|
8524
|
-
|
|
8524
|
+
y[f] ^= l[f + 4 & 7];
|
|
8525
8525
|
if (v) {
|
|
8526
|
-
var A = v.words, g = A[0],
|
|
8527
|
-
|
|
8526
|
+
var A = v.words, g = A[0], E = A[1], b = (g << 8 | g >>> 24) & 16711935 | (g << 24 | g >>> 8) & 4278255360, F = (E << 8 | E >>> 24) & 16711935 | (E << 24 | E >>> 8) & 4278255360, _ = b >>> 16 | F & 4294901760, S = F << 16 | b & 65535;
|
|
8527
|
+
y[0] ^= b, y[1] ^= _, y[2] ^= F, y[3] ^= S, y[4] ^= b, y[5] ^= _, y[6] ^= F, y[7] ^= S;
|
|
8528
8528
|
for (var f = 0; f < 4; f++)
|
|
8529
8529
|
d.call(this);
|
|
8530
8530
|
}
|
|
@@ -8543,8 +8543,8 @@ function sl() {
|
|
|
8543
8543
|
B[f] = v[f];
|
|
8544
8544
|
v[0] = v[0] + 1295307597 + this._b | 0, v[1] = v[1] + 3545052371 + (v[0] >>> 0 < B[0] >>> 0 ? 1 : 0) | 0, v[2] = v[2] + 886263092 + (v[1] >>> 0 < B[1] >>> 0 ? 1 : 0) | 0, v[3] = v[3] + 1295307597 + (v[2] >>> 0 < B[2] >>> 0 ? 1 : 0) | 0, v[4] = v[4] + 3545052371 + (v[3] >>> 0 < B[3] >>> 0 ? 1 : 0) | 0, v[5] = v[5] + 886263092 + (v[4] >>> 0 < B[4] >>> 0 ? 1 : 0) | 0, v[6] = v[6] + 1295307597 + (v[5] >>> 0 < B[5] >>> 0 ? 1 : 0) | 0, v[7] = v[7] + 3545052371 + (v[6] >>> 0 < B[6] >>> 0 ? 1 : 0) | 0, this._b = v[7] >>> 0 < B[7] >>> 0 ? 1 : 0;
|
|
8545
8545
|
for (var f = 0; f < 8; f++) {
|
|
8546
|
-
var l = h[f] + v[f],
|
|
8547
|
-
c[f] = g ^
|
|
8546
|
+
var l = h[f] + v[f], y = l & 65535, A = l >>> 16, g = ((y * y >>> 17) + y * A >>> 15) + A * A, E = ((l & 4294901760) * l | 0) + ((l & 65535) * l | 0);
|
|
8547
|
+
c[f] = g ^ E;
|
|
8548
8548
|
}
|
|
8549
8549
|
h[0] = c[0] + (c[7] << 16 | c[7] >>> 16) + (c[6] << 16 | c[6] >>> 16) | 0, h[1] = c[1] + (c[0] << 8 | c[0] >>> 24) + c[7] | 0, h[2] = c[2] + (c[1] << 16 | c[1] >>> 16) + (c[0] << 16 | c[0] >>> 16) | 0, h[3] = c[3] + (c[2] << 8 | c[2] >>> 24) + c[1] | 0, h[4] = c[4] + (c[3] << 16 | c[3] >>> 16) + (c[2] << 16 | c[2] >>> 16) | 0, h[5] = c[5] + (c[4] << 8 | c[4] >>> 24) + c[3] | 0, h[6] = c[6] + (c[5] << 16 | c[5] >>> 16) + (c[4] << 16 | c[4] >>> 16) | 0, h[7] = c[7] + (c[6] << 8 | c[6] >>> 24) + c[5] | 0;
|
|
8550
8550
|
}
|
|
@@ -8564,7 +8564,7 @@ var Dr = {}, il = {
|
|
|
8564
8564
|
function ol() {
|
|
8565
8565
|
return Js || (Js = 1, function(t, e) {
|
|
8566
8566
|
(function(r, n, s) {
|
|
8567
|
-
t.exports = n(o0(),
|
|
8567
|
+
t.exports = n(o0(), jt(), Wt(), qt(), D0());
|
|
8568
8568
|
})(s0, function(r) {
|
|
8569
8569
|
return function() {
|
|
8570
8570
|
var n = r, s = n.lib, i = s.StreamCipher, o = n.algo, a = [], B = [], c = [], x = o.RabbitLegacy = i.extend({
|
|
@@ -8589,14 +8589,14 @@ function ol() {
|
|
|
8589
8589
|
h[3] & 4294901760 | h[0] & 65535
|
|
8590
8590
|
];
|
|
8591
8591
|
this._b = 0;
|
|
8592
|
-
for (var
|
|
8592
|
+
for (var y = 0; y < 4; y++)
|
|
8593
8593
|
d.call(this);
|
|
8594
|
-
for (var
|
|
8595
|
-
l[
|
|
8594
|
+
for (var y = 0; y < 8; y++)
|
|
8595
|
+
l[y] ^= f[y + 4 & 7];
|
|
8596
8596
|
if (v) {
|
|
8597
|
-
var A = v.words, g = A[0],
|
|
8597
|
+
var A = v.words, g = A[0], E = A[1], b = (g << 8 | g >>> 24) & 16711935 | (g << 24 | g >>> 8) & 4278255360, F = (E << 8 | E >>> 24) & 16711935 | (E << 24 | E >>> 8) & 4278255360, _ = b >>> 16 | F & 4294901760, S = F << 16 | b & 65535;
|
|
8598
8598
|
l[0] ^= b, l[1] ^= _, l[2] ^= F, l[3] ^= S, l[4] ^= b, l[5] ^= _, l[6] ^= F, l[7] ^= S;
|
|
8599
|
-
for (var
|
|
8599
|
+
for (var y = 0; y < 4; y++)
|
|
8600
8600
|
d.call(this);
|
|
8601
8601
|
}
|
|
8602
8602
|
},
|
|
@@ -8614,8 +8614,8 @@ function ol() {
|
|
|
8614
8614
|
B[f] = v[f];
|
|
8615
8615
|
v[0] = v[0] + 1295307597 + this._b | 0, v[1] = v[1] + 3545052371 + (v[0] >>> 0 < B[0] >>> 0 ? 1 : 0) | 0, v[2] = v[2] + 886263092 + (v[1] >>> 0 < B[1] >>> 0 ? 1 : 0) | 0, v[3] = v[3] + 1295307597 + (v[2] >>> 0 < B[2] >>> 0 ? 1 : 0) | 0, v[4] = v[4] + 3545052371 + (v[3] >>> 0 < B[3] >>> 0 ? 1 : 0) | 0, v[5] = v[5] + 886263092 + (v[4] >>> 0 < B[4] >>> 0 ? 1 : 0) | 0, v[6] = v[6] + 1295307597 + (v[5] >>> 0 < B[5] >>> 0 ? 1 : 0) | 0, v[7] = v[7] + 3545052371 + (v[6] >>> 0 < B[6] >>> 0 ? 1 : 0) | 0, this._b = v[7] >>> 0 < B[7] >>> 0 ? 1 : 0;
|
|
8616
8616
|
for (var f = 0; f < 8; f++) {
|
|
8617
|
-
var l = h[f] + v[f],
|
|
8618
|
-
c[f] = g ^
|
|
8617
|
+
var l = h[f] + v[f], y = l & 65535, A = l >>> 16, g = ((y * y >>> 17) + y * A >>> 15) + A * A, E = ((l & 4294901760) * l | 0) + ((l & 65535) * l | 0);
|
|
8618
|
+
c[f] = g ^ E;
|
|
8619
8619
|
}
|
|
8620
8620
|
h[0] = c[0] + (c[7] << 16 | c[7] >>> 16) + (c[6] << 16 | c[6] >>> 16) | 0, h[1] = c[1] + (c[0] << 8 | c[0] >>> 24) + c[7] | 0, h[2] = c[2] + (c[1] << 16 | c[1] >>> 16) + (c[0] << 16 | c[0] >>> 16) | 0, h[3] = c[3] + (c[2] << 8 | c[2] >>> 24) + c[1] | 0, h[4] = c[4] + (c[3] << 16 | c[3] >>> 16) + (c[2] << 16 | c[2] >>> 16) | 0, h[5] = c[5] + (c[4] << 8 | c[4] >>> 24) + c[3] | 0, h[6] = c[6] + (c[5] << 16 | c[5] >>> 16) + (c[4] << 16 | c[4] >>> 16) | 0, h[7] = c[7] + (c[6] << 8 | c[6] >>> 24) + c[5] | 0;
|
|
8621
8621
|
}
|
|
@@ -8635,7 +8635,7 @@ var wr = {}, al = {
|
|
|
8635
8635
|
function cl() {
|
|
8636
8636
|
return ti || (ti = 1, function(t, e) {
|
|
8637
8637
|
(function(r, n, s) {
|
|
8638
|
-
t.exports = n(o0(),
|
|
8638
|
+
t.exports = n(o0(), jt(), Wt(), qt(), D0());
|
|
8639
8639
|
})(s0, function(r) {
|
|
8640
8640
|
return function() {
|
|
8641
8641
|
var n = r, s = n.lib, i = s.BlockCipher, o = n.algo;
|
|
@@ -9696,53 +9696,53 @@ function cl() {
|
|
|
9696
9696
|
pbox: [],
|
|
9697
9697
|
sbox: []
|
|
9698
9698
|
};
|
|
9699
|
-
function d(
|
|
9700
|
-
let g = A >> 24 & 255,
|
|
9701
|
-
return _ = _ ^
|
|
9699
|
+
function d(y, A) {
|
|
9700
|
+
let g = A >> 24 & 255, E = A >> 16 & 255, b = A >> 8 & 255, F = A & 255, _ = y.sbox[0][g] + y.sbox[1][E];
|
|
9701
|
+
return _ = _ ^ y.sbox[2][b], _ = _ + y.sbox[3][F], _;
|
|
9702
9702
|
}
|
|
9703
|
-
function h(
|
|
9704
|
-
let
|
|
9703
|
+
function h(y, A, g) {
|
|
9704
|
+
let E = A, b = g, F;
|
|
9705
9705
|
for (let _ = 0; _ < a; ++_)
|
|
9706
|
-
|
|
9707
|
-
return F =
|
|
9706
|
+
E = E ^ y.pbox[_], b = d(y, E) ^ b, F = E, E = b, b = F;
|
|
9707
|
+
return F = E, E = b, b = F, b = b ^ y.pbox[a], E = E ^ y.pbox[a + 1], { left: E, right: b };
|
|
9708
9708
|
}
|
|
9709
|
-
function v(
|
|
9710
|
-
let
|
|
9709
|
+
function v(y, A, g) {
|
|
9710
|
+
let E = A, b = g, F;
|
|
9711
9711
|
for (let _ = a + 1; _ > 1; --_)
|
|
9712
|
-
|
|
9713
|
-
return F =
|
|
9712
|
+
E = E ^ y.pbox[_], b = d(y, E) ^ b, F = E, E = b, b = F;
|
|
9713
|
+
return F = E, E = b, b = F, b = b ^ y.pbox[1], E = E ^ y.pbox[0], { left: E, right: b };
|
|
9714
9714
|
}
|
|
9715
|
-
function f(
|
|
9715
|
+
function f(y, A, g) {
|
|
9716
9716
|
for (let S = 0; S < 4; S++) {
|
|
9717
|
-
|
|
9718
|
-
for (let
|
|
9719
|
-
|
|
9717
|
+
y.sbox[S] = [];
|
|
9718
|
+
for (let R = 0; R < 256; R++)
|
|
9719
|
+
y.sbox[S][R] = c[S][R];
|
|
9720
9720
|
}
|
|
9721
|
-
let
|
|
9721
|
+
let E = 0;
|
|
9722
9722
|
for (let S = 0; S < a + 2; S++)
|
|
9723
|
-
|
|
9723
|
+
y.pbox[S] = B[S] ^ A[E], E++, E >= g && (E = 0);
|
|
9724
9724
|
let b = 0, F = 0, _ = 0;
|
|
9725
9725
|
for (let S = 0; S < a + 2; S += 2)
|
|
9726
|
-
_ = h(
|
|
9726
|
+
_ = h(y, b, F), b = _.left, F = _.right, y.pbox[S] = b, y.pbox[S + 1] = F;
|
|
9727
9727
|
for (let S = 0; S < 4; S++)
|
|
9728
|
-
for (let
|
|
9729
|
-
_ = h(
|
|
9728
|
+
for (let R = 0; R < 256; R += 2)
|
|
9729
|
+
_ = h(y, b, F), b = _.left, F = _.right, y.sbox[S][R] = b, y.sbox[S][R + 1] = F;
|
|
9730
9730
|
return !0;
|
|
9731
9731
|
}
|
|
9732
9732
|
var l = o.Blowfish = i.extend({
|
|
9733
9733
|
_doReset: function() {
|
|
9734
9734
|
if (this._keyPriorReset !== this._key) {
|
|
9735
|
-
var
|
|
9735
|
+
var y = this._keyPriorReset = this._key, A = y.words, g = y.sigBytes / 4;
|
|
9736
9736
|
f(x, A, g);
|
|
9737
9737
|
}
|
|
9738
9738
|
},
|
|
9739
|
-
encryptBlock: function(
|
|
9740
|
-
var g = h(x,
|
|
9741
|
-
|
|
9739
|
+
encryptBlock: function(y, A) {
|
|
9740
|
+
var g = h(x, y[A], y[A + 1]);
|
|
9741
|
+
y[A] = g.left, y[A + 1] = g.right;
|
|
9742
9742
|
},
|
|
9743
|
-
decryptBlock: function(
|
|
9744
|
-
var g = v(x,
|
|
9745
|
-
|
|
9743
|
+
decryptBlock: function(y, A) {
|
|
9744
|
+
var g = v(x, y[A], y[A + 1]);
|
|
9745
|
+
y[A] = g.left, y[A + 1] = g.right;
|
|
9746
9746
|
},
|
|
9747
9747
|
blockSize: 64 / 32,
|
|
9748
9748
|
keySize: 128 / 32,
|
|
@@ -9755,7 +9755,7 @@ function cl() {
|
|
|
9755
9755
|
}
|
|
9756
9756
|
(function(t, e) {
|
|
9757
9757
|
(function(r, n, s) {
|
|
9758
|
-
t.exports = n(o0(), zr(), ou(), cu(),
|
|
9758
|
+
t.exports = n(o0(), zr(), ou(), cu(), jt(), uu(), Wt(), go(), Nn(), vu(), Eo(), Eu(), mu(), Au(), Ln(), Du(), qt(), D0(), Tu(), ku(), Pu(), Iu(), Nu(), zu(), $u(), ju(), Zu(), Gu(), Qu(), Yu(), tl(), rl(), sl(), ol(), cl());
|
|
9759
9759
|
})(s0, function(r) {
|
|
9760
9760
|
return r;
|
|
9761
9761
|
});
|
|
@@ -9797,7 +9797,7 @@ function Bl(t) {
|
|
|
9797
9797
|
instance: t.instance,
|
|
9798
9798
|
i18n: B0,
|
|
9799
9799
|
util: {
|
|
9800
|
-
url:
|
|
9800
|
+
url: Qt,
|
|
9801
9801
|
cookie: hi,
|
|
9802
9802
|
localStorage: oa,
|
|
9803
9803
|
service: kf,
|
|
@@ -9826,9 +9826,9 @@ function Bl(t) {
|
|
|
9826
9826
|
receive: dl
|
|
9827
9827
|
},
|
|
9828
9828
|
tip: {
|
|
9829
|
-
ElMessage:
|
|
9829
|
+
ElMessage: fe,
|
|
9830
9830
|
ElMessageBox: ci,
|
|
9831
|
-
ElNotification:
|
|
9831
|
+
ElNotification: ue
|
|
9832
9832
|
},
|
|
9833
9833
|
json: {
|
|
9834
9834
|
fromJson: Q0,
|
|
@@ -9841,7 +9841,7 @@ function Bl(t) {
|
|
|
9841
9841
|
//国密
|
|
9842
9842
|
SM: {
|
|
9843
9843
|
SMWithTraceKey: Vf,
|
|
9844
|
-
SM2:
|
|
9844
|
+
SM2: ye,
|
|
9845
9845
|
SM4: Pn,
|
|
9846
9846
|
SecInner: Lr
|
|
9847
9847
|
},
|
|
@@ -9855,7 +9855,7 @@ function Bl(t) {
|
|
|
9855
9855
|
};
|
|
9856
9856
|
}
|
|
9857
9857
|
const mo = wa();
|
|
9858
|
-
|
|
9858
|
+
St.rowScope + "", B0.i18nt("designer.var.rowScope");
|
|
9859
9859
|
const bo = function(t) {
|
|
9860
9860
|
return {
|
|
9861
9861
|
[i0.number]: /^[-+]?(\d+\.\d+|\d+|\.\d+)$/,
|
|
@@ -9889,7 +9889,7 @@ const bo = function(t) {
|
|
|
9889
9889
|
let o = s, a = !0;
|
|
9890
9890
|
fa(t) ? a = t == null ? void 0 : t(r) : a = new RegExp(t).test(r), Ao(a, e, n, o, i);
|
|
9891
9891
|
}, k0 = function(t, e, r, n, s, i) {
|
|
9892
|
-
if (
|
|
9892
|
+
if (I0(r)) {
|
|
9893
9893
|
n();
|
|
9894
9894
|
return;
|
|
9895
9895
|
}
|
|
@@ -10067,50 +10067,50 @@ const bo = function(t) {
|
|
|
10067
10067
|
range(t, e, r, n, s, i) {
|
|
10068
10068
|
return $e(i, t, e, r, s || "invalid value", n);
|
|
10069
10069
|
}
|
|
10070
|
-
},
|
|
10070
|
+
}, ce = El;
|
|
10071
10071
|
function yl(t, e, r, n) {
|
|
10072
|
-
const s = e == null ? void 0 : e.designState, i = e, o = (
|
|
10072
|
+
const s = e == null ? void 0 : e.designState, i = e, o = (T) => t ? m0.getOptions(t, T, !0) != null : !1, a = (T, H = !1) => t ? m0.getOptions(t, T, H, !s, i) : null, B = (T, H) => {
|
|
10073
10073
|
if (t)
|
|
10074
|
-
return m0.setOptions(t,
|
|
10075
|
-
}, c = (
|
|
10076
|
-
ft(t == null ? void 0 : t.options,
|
|
10077
|
-
}, x = (
|
|
10078
|
-
const H = m0.getOrgOption(t,
|
|
10074
|
+
return m0.setOptions(t, T, H);
|
|
10075
|
+
}, c = (T, H) => {
|
|
10076
|
+
ft(t == null ? void 0 : t.options, T) && B(T, H);
|
|
10077
|
+
}, x = (T) => {
|
|
10078
|
+
const H = m0.getOrgOption(t, T);
|
|
10079
10079
|
return l(H);
|
|
10080
|
-
}, d = (
|
|
10080
|
+
}, d = (T, H, k = !1) => {
|
|
10081
10081
|
var t0;
|
|
10082
|
-
const
|
|
10083
|
-
var V = k ?
|
|
10082
|
+
const Z = (t0 = t == null ? void 0 : t.options) == null ? void 0 : t0[T];
|
|
10083
|
+
var V = k ? K.getValue(Z, !1, !s, { ...i, schemaParams: H }) : x(T);
|
|
10084
10084
|
return V;
|
|
10085
|
-
}, h = (
|
|
10085
|
+
}, h = (T, H, k, Z) => {
|
|
10086
10086
|
if (!H)
|
|
10087
10087
|
return;
|
|
10088
10088
|
k == null || k();
|
|
10089
|
-
const V =
|
|
10090
|
-
if (
|
|
10089
|
+
const V = Pt(F.value).includes(H) ? F : Pt(S.value).includes(H) ? S : null;
|
|
10090
|
+
if (T && V)
|
|
10091
10091
|
Me(() => {
|
|
10092
10092
|
var t0;
|
|
10093
10093
|
return (t0 = V == null ? void 0 : V.value) == null ? void 0 : t0[H];
|
|
10094
10094
|
}, (t0, x0) => {
|
|
10095
|
-
|
|
10095
|
+
Z == null || Z(t0, x0);
|
|
10096
10096
|
}, { immediate: !0 });
|
|
10097
10097
|
else {
|
|
10098
10098
|
const t0 = a(H);
|
|
10099
|
-
|
|
10100
|
-
|
|
10101
|
-
}, { immediate: !0 }) :
|
|
10102
|
-
}
|
|
10103
|
-
}, v = (
|
|
10104
|
-
t && m0.setEnable(t,
|
|
10105
|
-
}, f = (
|
|
10106
|
-
var H =
|
|
10099
|
+
$t(t0) ? Me(t0, (x0, f0) => {
|
|
10100
|
+
Z == null || Z(x0, f0);
|
|
10101
|
+
}, { immediate: !0 }) : Z == null || Z(t0, null);
|
|
10102
|
+
}
|
|
10103
|
+
}, v = (T, H) => {
|
|
10104
|
+
t && m0.setEnable(t, T, H);
|
|
10105
|
+
}, f = (T, H, k) => wf(T, H, k, e), l = (T) => {
|
|
10106
|
+
var H = K.getType(T), k = K.getValue(T, !1, !s, i);
|
|
10107
10107
|
switch (H) {
|
|
10108
10108
|
case X.dataObject: {
|
|
10109
|
-
const
|
|
10110
|
-
if (G0(k) &&
|
|
10111
|
-
if ([
|
|
10109
|
+
const Z = m0.getOptions(T, "type");
|
|
10110
|
+
if (G0(k) && Z) {
|
|
10111
|
+
if ([xe.array, xe.object].includes(Z))
|
|
10112
10112
|
return k == null || k === "" ? null : Q0(String(k || ""));
|
|
10113
|
-
if ([
|
|
10113
|
+
if ([xe.bigint, xe.number].includes(Z))
|
|
10114
10114
|
return va(k);
|
|
10115
10115
|
}
|
|
10116
10116
|
return k;
|
|
@@ -10118,263 +10118,263 @@ function yl(t, e, r, n) {
|
|
|
10118
10118
|
case X.slot:
|
|
10119
10119
|
return vx(k);
|
|
10120
10120
|
case X.icon: {
|
|
10121
|
-
const { instance:
|
|
10122
|
-
return
|
|
10121
|
+
const { instance: Z } = sn(n);
|
|
10122
|
+
return Z ? Aa(k, Z) : k;
|
|
10123
10123
|
}
|
|
10124
10124
|
case X.event:
|
|
10125
10125
|
case X.placerHook:
|
|
10126
10126
|
case X.hook: {
|
|
10127
|
-
if (
|
|
10127
|
+
if (I0(k) || k === "" || s)
|
|
10128
10128
|
break;
|
|
10129
10129
|
return (...V) => {
|
|
10130
10130
|
let t0 = {};
|
|
10131
10131
|
var x0 = 1;
|
|
10132
10132
|
V == null || V.map((g0) => t0["args" + x0++] = g0);
|
|
10133
|
-
const { instance: f0 } = sn(n), _0 = Bl({ instance: f0 });
|
|
10133
|
+
const { instance: f0 } = sn(n || (i == null ? void 0 : i.instance)), _0 = Bl({ instance: f0 });
|
|
10134
10134
|
t0[tt.externalArgs] = _0;
|
|
10135
10135
|
const y0 = k;
|
|
10136
|
-
return y0 != null && y0.type ? f(y0, t0, f0) :
|
|
10136
|
+
return y0 != null && y0.type ? f(y0, t0, f0) : It(k, t0);
|
|
10137
10137
|
};
|
|
10138
10138
|
}
|
|
10139
10139
|
default:
|
|
10140
10140
|
return k;
|
|
10141
10141
|
}
|
|
10142
|
-
},
|
|
10143
|
-
var
|
|
10144
|
-
return V.slotName = (
|
|
10145
|
-
}, A = (
|
|
10142
|
+
}, y = (T, H, k) => {
|
|
10143
|
+
var Z = K.getOptions(T), V = {};
|
|
10144
|
+
return V.slotName = (Z == null ? void 0 : Z.slotName) || H, (T == null ? void 0 : T.widgetList) === void 0 ? V.widgetList = [] : V.widgetList = T == null ? void 0 : T.widgetList, V.default = k ? Da(k) : null, Object.assign(T, V);
|
|
10145
|
+
}, A = (T, H = !1, k) => {
|
|
10146
10146
|
var V;
|
|
10147
|
-
var
|
|
10147
|
+
var Z = {};
|
|
10148
10148
|
return !t || !t.options || (V = Object.entries(t == null ? void 0 : t.options)) == null || V.forEach(([t0, x0]) => {
|
|
10149
10149
|
if (!(k && !(k != null && k(t0)))) {
|
|
10150
|
-
var f0 =
|
|
10151
|
-
if (
|
|
10152
|
-
var _0 = H ?
|
|
10153
|
-
f0 === X.slot ?
|
|
10150
|
+
var f0 = K.getOrgType(x0);
|
|
10151
|
+
if (T.includes(f0)) {
|
|
10152
|
+
var _0 = H ? K.getValue(x0, !1, !s, i) : x(t0);
|
|
10153
|
+
f0 === X.slot ? Z[t0] = y(x0, t0, _0) : Rt(_0) || (Z[t0] = _0);
|
|
10154
10154
|
} else
|
|
10155
|
-
f0 || [X.prop].some((y0) =>
|
|
10155
|
+
f0 || [X.prop].some((y0) => T.includes(y0)) && (Z[t0] = x0);
|
|
10156
10156
|
}
|
|
10157
|
-
}),
|
|
10158
|
-
}, g = (
|
|
10159
|
-
const H =
|
|
10157
|
+
}), Z;
|
|
10158
|
+
}, g = (T) => {
|
|
10159
|
+
const H = T == null ? void 0 : T.type;
|
|
10160
10160
|
var k = [];
|
|
10161
|
-
return H && (k = [],
|
|
10162
|
-
},
|
|
10161
|
+
return H && (k = [], T.formItemFlag && (k = k.concat(["name", "defaultValue"]))), k;
|
|
10162
|
+
}, E = (T) => {
|
|
10163
10163
|
const H = a(rt.state);
|
|
10164
|
-
H != null &&
|
|
10165
|
-
var k = !o(
|
|
10166
|
-
return k ?
|
|
10167
|
-
}),
|
|
10164
|
+
H != null && $t(H) && (T.readonly = R0(() => W0(H) === Ut.readonly), T.disabled = R0(() => {
|
|
10165
|
+
var k = !o(Ut.readonly), Z = W0(H) === Ut.disabled, V = W0(H) === Ut.readonly;
|
|
10166
|
+
return k ? Z : Z || V;
|
|
10167
|
+
}), T.hidden = R0(() => W0(H) === Ut.hidden), T.custom = R0(() => W0(H) === Ut.custom));
|
|
10168
10168
|
}, b = () => {
|
|
10169
|
-
var
|
|
10170
|
-
var
|
|
10171
|
-
return V &&
|
|
10169
|
+
var T = g(t) || [], H = A([X.icon, X.hook, X.variable, X.prop, X.dataObject], !1, (k) => {
|
|
10170
|
+
var Z = !(r != null && r.fn_attr) || (r == null ? void 0 : r.fn_attr(k)), V = !T.includes(k);
|
|
10171
|
+
return V && Z;
|
|
10172
10172
|
});
|
|
10173
|
-
return
|
|
10173
|
+
return E(H), on(H);
|
|
10174
10174
|
}, F = r != null && r.s_attr ? R0(() => b()) : Et(), _ = () => {
|
|
10175
|
-
var
|
|
10176
|
-
return on(
|
|
10177
|
-
}, S = r != null && r.s_extendAttr ? R0(() => _()) : Et(),
|
|
10175
|
+
var T = A([X.placer, X.placerHook]);
|
|
10176
|
+
return on(T);
|
|
10177
|
+
}, S = r != null && r.s_extendAttr ? R0(() => _()) : Et(), R = r != null && r.s_events ? R0(() => A([X.event])) : Et(), q = r != null && r.s_fieldName ? R0({
|
|
10178
10178
|
get: () => a(rt.name),
|
|
10179
|
-
set: (
|
|
10180
|
-
B(rt.name,
|
|
10179
|
+
set: (T) => {
|
|
10180
|
+
B(rt.name, T);
|
|
10181
10181
|
}
|
|
10182
|
-
}) : Et(), w = (
|
|
10182
|
+
}) : Et(), w = (T) => K.isComplexValue(t == null ? void 0 : t.options[T]), C = (T = !1) => {
|
|
10183
10183
|
var H = a(tt.defaultValue, !0);
|
|
10184
|
-
return ft(t == null ? void 0 : t.options, tt.defaultValue) && (!
|
|
10184
|
+
return ft(t == null ? void 0 : t.options, tt.defaultValue) && (!T || H != null);
|
|
10185
10185
|
}, N = () => {
|
|
10186
|
-
var H, k,
|
|
10186
|
+
var H, k, Z, V, t0;
|
|
10187
10187
|
if (!C())
|
|
10188
10188
|
return;
|
|
10189
|
-
let
|
|
10189
|
+
let T = a(tt.defaultValue);
|
|
10190
10190
|
if (ft(t == null ? void 0 : t.options, rt.optionItems) && !w(tt.defaultValue)) {
|
|
10191
10191
|
const x0 = W0(a(tt.multiple));
|
|
10192
|
-
if ((x0 || Array.isArray(
|
|
10193
|
-
return (
|
|
10194
|
-
if ((x0 === !1 ||
|
|
10192
|
+
if ((x0 || Array.isArray(T)) && ((H = u0(T)) == null ? void 0 : H.length) <= 0)
|
|
10193
|
+
return (Z = (k = W0(Y == null ? void 0 : Y.value)) == null ? void 0 : k.filter((f0) => f0 == null ? void 0 : f0.isdefault)) == null ? void 0 : Z.map((f0) => f0 == null ? void 0 : f0.value);
|
|
10194
|
+
if ((x0 === !1 || I0(x0) || !Array.isArray(T)) && I0(T))
|
|
10195
10195
|
return (t0 = (V = W0(Y == null ? void 0 : Y.value)) == null ? void 0 : V.find((f0) => f0 == null ? void 0 : f0.isdefault)) == null ? void 0 : t0.value;
|
|
10196
10196
|
}
|
|
10197
|
-
return
|
|
10197
|
+
return T;
|
|
10198
10198
|
}, L = r != null && r.s_slots ? R0(() => {
|
|
10199
|
-
var
|
|
10200
|
-
return Object.values(
|
|
10199
|
+
var T = A([X.slot]);
|
|
10200
|
+
return Object.values(T);
|
|
10201
10201
|
}) : Et(), Q = r != null && r.s_slots ? R0(() => {
|
|
10202
|
-
var
|
|
10203
|
-
return Object.values(
|
|
10204
|
-
}) : Et(), J = (
|
|
10205
|
-
B(rt.optionItems, ua(
|
|
10206
|
-
}, r0 = (
|
|
10207
|
-
if (ft(F.value,
|
|
10208
|
-
var H = F.value[
|
|
10209
|
-
return
|
|
10210
|
-
} else if (ft(S.value,
|
|
10211
|
-
var k = S.value[
|
|
10212
|
-
return
|
|
10202
|
+
var T = A([X.slot], !0);
|
|
10203
|
+
return Object.values(T);
|
|
10204
|
+
}) : Et(), J = (T) => {
|
|
10205
|
+
B(rt.optionItems, ua(T));
|
|
10206
|
+
}, r0 = (T) => {
|
|
10207
|
+
if (ft(F.value, T)) {
|
|
10208
|
+
var H = F.value[T];
|
|
10209
|
+
return $t(H) ? H : R0(() => l0(F.value[T]));
|
|
10210
|
+
} else if (ft(S.value, T)) {
|
|
10211
|
+
var k = S.value[T];
|
|
10212
|
+
return $t(k) ? k : R0(() => l0(S.value[T]));
|
|
10213
10213
|
} else {
|
|
10214
|
-
var
|
|
10215
|
-
return
|
|
10216
|
-
}
|
|
10217
|
-
}, l0 = (
|
|
10218
|
-
if (
|
|
10219
|
-
return
|
|
10220
|
-
if (
|
|
10221
|
-
return W0(
|
|
10222
|
-
var H =
|
|
10223
|
-
return ri(H, (k,
|
|
10224
|
-
|
|
10214
|
+
var Z = a(T);
|
|
10215
|
+
return $t(Z) ? Z : R0(() => l0(a(T)));
|
|
10216
|
+
}
|
|
10217
|
+
}, l0 = (T) => {
|
|
10218
|
+
if (T == null)
|
|
10219
|
+
return T;
|
|
10220
|
+
if ($t(T))
|
|
10221
|
+
return W0(T);
|
|
10222
|
+
var H = _t(T);
|
|
10223
|
+
return ri(H, (k, Z, V) => {
|
|
10224
|
+
K.needCalcValue(V) && (k[Z] = K.getValue(V, !0, !s, i));
|
|
10225
10225
|
}), H === void 0 ? null : on(H);
|
|
10226
10226
|
};
|
|
10227
10227
|
let Y = null;
|
|
10228
10228
|
r != null && r.s_optionItems && ft(t == null ? void 0 : t.options, rt.optionItems) && (Y = r0(rt.optionItems));
|
|
10229
|
-
const h0 = (
|
|
10229
|
+
const h0 = (T) => !!T.isdefault, a0 = (T) => {
|
|
10230
10230
|
if (!Array.isArray(Y == null ? void 0 : Y.value))
|
|
10231
10231
|
return;
|
|
10232
10232
|
let H = [];
|
|
10233
|
-
return la(Y == null ? void 0 : Y.value, "children", (k) =>
|
|
10233
|
+
return la(Y == null ? void 0 : Y.value, "children", (k) => T(k), (k) => {
|
|
10234
10234
|
H.push(k);
|
|
10235
10235
|
}), H;
|
|
10236
10236
|
}, O = r != null && r.s_optionItems ? R0(() => a0(h0)) : Et(), z = r != null && r.s_optionItems ? R0(() => {
|
|
10237
|
-
var
|
|
10237
|
+
var T, H;
|
|
10238
10238
|
if (Array.isArray(Y == null ? void 0 : Y.value)) {
|
|
10239
|
-
const k = (
|
|
10239
|
+
const k = (T = O == null ? void 0 : O.value) == null ? void 0 : T.length;
|
|
10240
10240
|
return k ? (H = O == null ? void 0 : O.value) == null ? void 0 : H[k - 1] : void 0;
|
|
10241
10241
|
}
|
|
10242
10242
|
}) : Et(), M = r != null && r.s_optionItems ? R0(() => {
|
|
10243
|
-
var
|
|
10243
|
+
var T;
|
|
10244
10244
|
if (Array.isArray(Y == null ? void 0 : Y.value)) {
|
|
10245
|
-
const H = (
|
|
10245
|
+
const H = (T = Y == null ? void 0 : Y.value) == null ? void 0 : T.findIndex((k) => h0(k));
|
|
10246
10246
|
return !isNaN(H) && H > -1 ? H : 0;
|
|
10247
10247
|
}
|
|
10248
10248
|
return 0;
|
|
10249
|
-
}) : Et(0), U = (
|
|
10249
|
+
}) : Et(0), U = (T) => {
|
|
10250
10250
|
const H = W0(a(tt.valueKey, !1));
|
|
10251
10251
|
return a0((k) => {
|
|
10252
|
-
var
|
|
10253
|
-
return
|
|
10252
|
+
var Z = pe(T, !0);
|
|
10253
|
+
return Z == null ? void 0 : Z.includes(k == null ? void 0 : k[H]);
|
|
10254
10254
|
});
|
|
10255
|
-
}, p0 = (
|
|
10255
|
+
}, p0 = (T) => {
|
|
10256
10256
|
var V;
|
|
10257
|
-
const H = W0(a(tt.labelKey, !1)), k = (V = U(
|
|
10257
|
+
const H = W0(a(tt.labelKey, !1)), k = (V = U(T)) == null ? void 0 : V.map((t0) => t0 == null ? void 0 : t0[H]);
|
|
10258
10258
|
return a(tt.multiple, !1) ? k : k == null ? void 0 : k[0];
|
|
10259
|
-
}, d0 = (
|
|
10259
|
+
}, d0 = (T) => {
|
|
10260
10260
|
var V;
|
|
10261
|
-
const H = W0(a(tt.valueKey, !1)), k = (V = U(
|
|
10261
|
+
const H = W0(a(tt.valueKey, !1)), k = (V = U(T)) == null ? void 0 : V.map((t0) => t0 == null ? void 0 : t0[H]);
|
|
10262
10262
|
return a(tt.multiple, !1) ? k : k == null ? void 0 : k[0];
|
|
10263
|
-
}, A0 = (
|
|
10263
|
+
}, A0 = (T) => {
|
|
10264
10264
|
var H;
|
|
10265
|
-
return (H =
|
|
10265
|
+
return (H = pe(p0(T), !0)) == null ? void 0 : H.join(",");
|
|
10266
10266
|
}, e0 = [], T0 = () => {
|
|
10267
10267
|
t != null && t.formItemFlag && e0.splice(0, e0.length);
|
|
10268
|
-
}, st = (
|
|
10268
|
+
}, st = (T) => {
|
|
10269
10269
|
var H = a("required", !0);
|
|
10270
10270
|
const k = u0(H == null ? void 0 : H.options);
|
|
10271
10271
|
if (k != null && k.enable)
|
|
10272
10272
|
return {
|
|
10273
10273
|
name: "required",
|
|
10274
|
-
label:
|
|
10274
|
+
label: T,
|
|
10275
10275
|
required: !0,
|
|
10276
10276
|
//trigger: [],
|
|
10277
10277
|
//trigger: ['blur'], /* 去掉change事件触发校验,change事件触发时formModel数据尚未更新,导致radio/checkbox必填校验出错!! */
|
|
10278
|
-
validator: (
|
|
10279
|
-
var x0 = ut(k == null ? void 0 : k.errorMsg, { ...k, label:
|
|
10280
|
-
|
|
10278
|
+
validator: (Z, V, t0) => {
|
|
10279
|
+
var x0 = ut(k == null ? void 0 : k.errorMsg, { ...k, label: T });
|
|
10280
|
+
ce[i0.required](Z, V, t0, k == null ? void 0 : k.forceMatch, x0);
|
|
10281
10281
|
}
|
|
10282
10282
|
};
|
|
10283
|
-
},
|
|
10283
|
+
}, Nt = (T) => {
|
|
10284
10284
|
var H = a("rangeValidate", !0);
|
|
10285
10285
|
const k = u0(H == null ? void 0 : H.options);
|
|
10286
10286
|
if (!(k != null && k.enable))
|
|
10287
10287
|
return;
|
|
10288
|
-
let { minValue:
|
|
10288
|
+
let { minValue: Z, maxValue: V, includeMaxValue: t0, includeMinValue: x0 } = k, f0 = "range";
|
|
10289
10289
|
var _0 = (y0) => {
|
|
10290
|
-
if (
|
|
10290
|
+
if (I0(y0))
|
|
10291
10291
|
return !0;
|
|
10292
|
-
const g0 = parseFloat(y0),
|
|
10293
|
-
return isNaN(g0) || at() &&
|
|
10292
|
+
const g0 = parseFloat(y0), N0 = parseFloat(Z), Bt = parseFloat(V), at = () => isNaN(N0) || I0(Z) || (x0 ? g0 >= N0 : g0 > N0), Ft = () => isNaN(Bt) || I0(V) || (t0 ? g0 <= Bt : g0 < Bt);
|
|
10293
|
+
return isNaN(g0) || at() && Ft();
|
|
10294
10294
|
};
|
|
10295
10295
|
return {
|
|
10296
10296
|
name: f0,
|
|
10297
|
-
label:
|
|
10297
|
+
label: T,
|
|
10298
10298
|
trigger: [],
|
|
10299
|
-
validator: (y0, g0,
|
|
10300
|
-
var Bt = ut(k == null ? void 0 : k.errorMsg, { ...k, label:
|
|
10301
|
-
|
|
10299
|
+
validator: (y0, g0, N0) => {
|
|
10300
|
+
var Bt = ut(k == null ? void 0 : k.errorMsg, { ...k, label: T }), at = I0(Z) ? "" : `${Z} ${x0 ? "<=" : "<"}`, Ft = I0(V) ? "" : `${t0 ? "<=" : "<"} ${V}`, Kt = `${at} 值 ${Ft}`;
|
|
10301
|
+
ce[f0](y0, g0, N0, k == null ? void 0 : k.forceMatch, Bt || Kt, _0);
|
|
10302
10302
|
}
|
|
10303
10303
|
};
|
|
10304
|
-
}, pt = (
|
|
10304
|
+
}, pt = (T) => {
|
|
10305
10305
|
var H = a("expValidate", !0);
|
|
10306
10306
|
const k = u0(H == null ? void 0 : H.options);
|
|
10307
10307
|
if (!(k != null && k.enable))
|
|
10308
10308
|
return;
|
|
10309
|
-
let
|
|
10309
|
+
let Z = k == null ? void 0 : k.expression, V = Z;
|
|
10310
10310
|
if (V) {
|
|
10311
|
-
var t0 =
|
|
10311
|
+
var t0 = ce[V], x0 = !!t0;
|
|
10312
10312
|
return x0 || (V = "regExp"), {
|
|
10313
10313
|
name: V,
|
|
10314
|
-
label:
|
|
10314
|
+
label: T,
|
|
10315
10315
|
trigger: [],
|
|
10316
10316
|
validator: (f0, _0, y0) => {
|
|
10317
|
-
var g0 = ut(k == null ? void 0 : k.errorMsg, { ...k, label:
|
|
10318
|
-
x0 ?
|
|
10317
|
+
var g0 = ut(k == null ? void 0 : k.errorMsg, { ...k, label: T });
|
|
10318
|
+
x0 ? ce[V](f0, _0, y0, k == null ? void 0 : k.forceMatch, g0) : ce[V](f0, _0, y0, k == null ? void 0 : k.forceMatch, g0, Z);
|
|
10319
10319
|
}
|
|
10320
10320
|
};
|
|
10321
10321
|
}
|
|
10322
|
-
}, O0 = (
|
|
10322
|
+
}, O0 = (T) => {
|
|
10323
10323
|
var H = a("fnValidate", !0);
|
|
10324
10324
|
const k = u0(H == null ? void 0 : H.options);
|
|
10325
10325
|
if (!(k != null && k.enable) || !k.func)
|
|
10326
10326
|
return;
|
|
10327
|
-
const { instance:
|
|
10327
|
+
const { instance: Z } = sn(n), V = k == null ? void 0 : k.errorMsg;
|
|
10328
10328
|
return {
|
|
10329
10329
|
name: "userDefine",
|
|
10330
|
-
label:
|
|
10330
|
+
label: T,
|
|
10331
10331
|
trigger: [],
|
|
10332
10332
|
validator: (t0, x0, f0) => {
|
|
10333
|
-
|
|
10333
|
+
It(k.func, {
|
|
10334
10334
|
rule: t0,
|
|
10335
10335
|
value: x0,
|
|
10336
10336
|
callback: (_0) => {
|
|
10337
10337
|
Ao(!_0, t0, f0, V, k == null ? void 0 : k.forceMatch);
|
|
10338
10338
|
},
|
|
10339
10339
|
errorMsg: V,
|
|
10340
|
-
ctx:
|
|
10340
|
+
ctx: Z
|
|
10341
10341
|
});
|
|
10342
10342
|
}
|
|
10343
10343
|
};
|
|
10344
10344
|
}, w0 = () => {
|
|
10345
10345
|
if (t != null && t.formItemFlag && !a("hidden")) {
|
|
10346
10346
|
T0();
|
|
10347
|
-
var
|
|
10348
|
-
st(
|
|
10349
|
-
pt(
|
|
10350
|
-
O0(
|
|
10351
|
-
|
|
10347
|
+
var T = a("label"), H = [
|
|
10348
|
+
st(T),
|
|
10349
|
+
pt(T),
|
|
10350
|
+
O0(T),
|
|
10351
|
+
Nt(T)
|
|
10352
10352
|
];
|
|
10353
10353
|
return H == null || H.forEach((k) => {
|
|
10354
10354
|
k && e0.push(k);
|
|
10355
10355
|
}), it(), e0;
|
|
10356
10356
|
}
|
|
10357
10357
|
}, bt = () => {
|
|
10358
|
-
e0 && e0.forEach((
|
|
10359
|
-
vt(
|
|
10358
|
+
e0 && e0.forEach((T) => {
|
|
10359
|
+
vt(T);
|
|
10360
10360
|
});
|
|
10361
10361
|
}, it = () => {
|
|
10362
|
-
e0 && e0.forEach((
|
|
10363
|
-
ot(
|
|
10362
|
+
e0 && e0.forEach((T) => {
|
|
10363
|
+
ot(T);
|
|
10364
10364
|
});
|
|
10365
|
-
}, vt = (
|
|
10366
|
-
|
|
10367
|
-
}, ot = (
|
|
10368
|
-
|
|
10365
|
+
}, vt = (T) => {
|
|
10366
|
+
T.trigger && T.trigger.splice(0, T.trigger.length);
|
|
10367
|
+
}, ot = (T) => {
|
|
10368
|
+
T.trigger && (T.trigger.push("blur"), T.name !== "required" && T.trigger.push("change"));
|
|
10369
10369
|
};
|
|
10370
10370
|
return {
|
|
10371
10371
|
attrs: F,
|
|
10372
10372
|
extendAttrs: S,
|
|
10373
|
-
events:
|
|
10373
|
+
events: R,
|
|
10374
10374
|
slots: L,
|
|
10375
10375
|
originSlots: Q,
|
|
10376
10376
|
computedDefaultValue: N,
|
|
10377
|
-
fieldName:
|
|
10377
|
+
fieldName: q,
|
|
10378
10378
|
hasDefaultValue: C,
|
|
10379
10379
|
optionItems: Y,
|
|
10380
10380
|
activeOptionItems: O,
|
|
@@ -10402,17 +10402,17 @@ function yl(t, e, r, n) {
|
|
|
10402
10402
|
disableChangeValidate: bt,
|
|
10403
10403
|
enableChangeRule: ot,
|
|
10404
10404
|
enableChangeValidate: it,
|
|
10405
|
-
addCssClass: (
|
|
10405
|
+
addCssClass: (T) => {
|
|
10406
10406
|
var H = a("customClass");
|
|
10407
|
-
H ? H.push(
|
|
10407
|
+
H ? H.push(T) : H = [T], B("customClass", H);
|
|
10408
10408
|
},
|
|
10409
|
-
removeCssClass: (
|
|
10409
|
+
removeCssClass: (T) => {
|
|
10410
10410
|
var H = a("customClass");
|
|
10411
10411
|
if (!H)
|
|
10412
10412
|
return;
|
|
10413
10413
|
let k = -1;
|
|
10414
|
-
H.map((
|
|
10415
|
-
|
|
10414
|
+
H.map((Z, V) => {
|
|
10415
|
+
Z === T && (k = V);
|
|
10416
10416
|
}), k > -1 && (H.splice(k, 1), B("customClass", H));
|
|
10417
10417
|
},
|
|
10418
10418
|
singleOption: d,
|
|
@@ -10420,8 +10420,8 @@ function yl(t, e, r, n) {
|
|
|
10420
10420
|
};
|
|
10421
10421
|
}
|
|
10422
10422
|
function ml(t, e) {
|
|
10423
|
-
const { getWidgetOptionByPropValue: r } = yl({ name: t.name, options: t }, e), n = (l,
|
|
10424
|
-
var A = Q0(ut(M0(l),
|
|
10423
|
+
const { getWidgetOptionByPropValue: r } = yl({ name: t.name, options: t }, e), n = (l, y) => {
|
|
10424
|
+
var A = Q0(ut(M0(l), y));
|
|
10425
10425
|
if (A)
|
|
10426
10426
|
return dx(A);
|
|
10427
10427
|
}, s = (l) => n(t.headers, l), i = (l) => n(t.params, l), o = (l) => ut(t.url, l), a = () => ({
|
|
@@ -10432,60 +10432,65 @@ function ml(t, e) {
|
|
|
10432
10432
|
responseType: t.responseType,
|
|
10433
10433
|
responseEncoding: t.responseEncoding,
|
|
10434
10434
|
method: t.method
|
|
10435
|
-
}), B = (l,
|
|
10435
|
+
}), B = (l, y) => {
|
|
10436
10436
|
l && l.interceptors.request.use(
|
|
10437
10437
|
function(A) {
|
|
10438
|
-
var g = A,
|
|
10439
|
-
return
|
|
10438
|
+
var g = A, E = f(t.willFetch, y, [A]);
|
|
10439
|
+
return E.result && (g = E.data), g;
|
|
10440
10440
|
},
|
|
10441
10441
|
function(A) {
|
|
10442
10442
|
return Promise.reject(A);
|
|
10443
10443
|
}
|
|
10444
10444
|
);
|
|
10445
|
-
}, c = (l,
|
|
10445
|
+
}, c = (l, y) => {
|
|
10446
10446
|
l && l.interceptors.response.use(
|
|
10447
10447
|
function(A) {
|
|
10448
|
-
var g = A,
|
|
10449
|
-
return
|
|
10448
|
+
var g = A, E = f(t.fitFetch, y, [A]);
|
|
10449
|
+
return E.result && (g = E.data), g;
|
|
10450
10450
|
},
|
|
10451
10451
|
function(A) {
|
|
10452
|
-
var g = A,
|
|
10453
|
-
return
|
|
10452
|
+
var g = A, E = f(t.errorFetch, y, [A]);
|
|
10453
|
+
return E.result && (g = E.data), Promise.reject(g);
|
|
10454
10454
|
}
|
|
10455
10455
|
);
|
|
10456
10456
|
}, x = (l) => {
|
|
10457
|
-
var
|
|
10458
|
-
return _r(t.shouldFetch) ||
|
|
10457
|
+
var y = ut(t.shouldFetch, l);
|
|
10458
|
+
return _r(t.shouldFetch) || y + "" == "true" || y + "" == "1";
|
|
10459
10459
|
}, d = (l) => {
|
|
10460
10460
|
if (t.data == null || t.data === void 0)
|
|
10461
10461
|
return "";
|
|
10462
|
-
var
|
|
10463
|
-
return
|
|
10462
|
+
var y = Sr(t.data);
|
|
10463
|
+
return y ? Q0(ut(M0(t.data), l)) : ut(t.data + "", l);
|
|
10464
10464
|
}, h = (l) => {
|
|
10465
10465
|
if (!x(l))
|
|
10466
10466
|
return;
|
|
10467
|
-
const
|
|
10468
|
-
return B(
|
|
10469
|
-
const
|
|
10470
|
-
if (!
|
|
10467
|
+
const y = Oi.create(a());
|
|
10468
|
+
return B(y, l), c(y, l), new Promise((A, g) => {
|
|
10469
|
+
const E = o(l), b = d(l), F = s(l), _ = i(l);
|
|
10470
|
+
if (!E)
|
|
10471
10471
|
return;
|
|
10472
10472
|
const S = {
|
|
10473
|
-
url:
|
|
10473
|
+
url: E,
|
|
10474
10474
|
data: b,
|
|
10475
10475
|
headers: F,
|
|
10476
10476
|
params: _
|
|
10477
10477
|
};
|
|
10478
|
-
|
|
10479
|
-
let
|
|
10480
|
-
var w = f(t.didFetch, l, [
|
|
10481
|
-
w.result && (
|
|
10482
|
-
}).catch((
|
|
10483
|
-
|
|
10478
|
+
y.request(S).then((R) => {
|
|
10479
|
+
let q = R;
|
|
10480
|
+
var w = f(t.didFetch, l, [R]);
|
|
10481
|
+
w.result && (q = w.data), A(q);
|
|
10482
|
+
}).catch((R) => {
|
|
10483
|
+
Ht.error("request", R, S), g(R);
|
|
10484
10484
|
});
|
|
10485
10485
|
});
|
|
10486
|
-
}, v = (l) => !!
|
|
10486
|
+
}, v = (l) => !!K.getValue(l), f = (l, y, A) => {
|
|
10487
10487
|
let g = { result: !1, data: null };
|
|
10488
|
-
|
|
10488
|
+
if (v(l)) {
|
|
10489
|
+
g.result = !0;
|
|
10490
|
+
const E = r(l);
|
|
10491
|
+
g.data = E({ data: y }, ...A);
|
|
10492
|
+
}
|
|
10493
|
+
return g;
|
|
10489
10494
|
};
|
|
10490
10495
|
return {
|
|
10491
10496
|
req: h
|
|
@@ -10496,27 +10501,27 @@ function bl(t) {
|
|
|
10496
10501
|
var v;
|
|
10497
10502
|
return u0((v = e == null ? void 0 : e.schema) == null ? void 0 : v.value);
|
|
10498
10503
|
}, n = (v, f, l) => {
|
|
10499
|
-
var
|
|
10500
|
-
return !A &&
|
|
10504
|
+
var y = K.getEnable(l == null ? void 0 : l[v]), A = K.getEnable(f == null ? void 0 : f[v]);
|
|
10505
|
+
return !A && y && f && (f[v] = l == null ? void 0 : l[v]), f;
|
|
10501
10506
|
}, s = (v, f) => {
|
|
10502
|
-
let l =
|
|
10507
|
+
let l = _t(v);
|
|
10503
10508
|
["didFetch", "willFetch", "errorFetch", "fitFetch"].forEach((A) => {
|
|
10504
10509
|
l = n(A, l, e);
|
|
10505
10510
|
});
|
|
10506
|
-
const { req:
|
|
10507
|
-
return
|
|
10511
|
+
const { req: y } = ml(l, t);
|
|
10512
|
+
return y(f);
|
|
10508
10513
|
}, i = () => {
|
|
10509
10514
|
let v = {};
|
|
10510
10515
|
const f = Lr.decryptFromUrl(window.location.href);
|
|
10511
|
-
v = Object.assign(v, { [
|
|
10516
|
+
v = Object.assign(v, { [St.urlParams]: f });
|
|
10512
10517
|
const l = t == null ? void 0 : t.globalConfig;
|
|
10513
|
-
return v = Object.assign(v, { [
|
|
10518
|
+
return v = Object.assign(v, { [St.compParams]: l }), v;
|
|
10514
10519
|
}, o = (v) => {
|
|
10515
|
-
var
|
|
10520
|
+
var y, A;
|
|
10516
10521
|
let f = {};
|
|
10517
10522
|
f = Object.assign(f, { schemaParams: v }), Object.assign(f, i()), f = Object.assign(f, { cookies: hi.getAll() });
|
|
10518
10523
|
var l = {};
|
|
10519
|
-
return (A = (
|
|
10524
|
+
return (A = (y = r == null ? void 0 : r()) == null ? void 0 : y.filter((g) => g.protocal === rn.VALUE)) == null || A.forEach((g) => {
|
|
10520
10525
|
l = Object.assign(l, { [g.name]: ut(String(g == null ? void 0 : g.initialData), f) });
|
|
10521
10526
|
}), f = Object.assign(f, { vars: l }), f;
|
|
10522
10527
|
}, a = (v) => {
|
|
@@ -10524,20 +10529,20 @@ function bl(t) {
|
|
|
10524
10529
|
return (f = r == null ? void 0 : r()) == null ? void 0 : f.find((l) => l.name === v);
|
|
10525
10530
|
}, B = (v, f) => {
|
|
10526
10531
|
var l = {};
|
|
10527
|
-
return v == null || v.forEach((
|
|
10528
|
-
|
|
10532
|
+
return v == null || v.forEach((y) => {
|
|
10533
|
+
y && (l[y] = c(y, f));
|
|
10529
10534
|
}), l;
|
|
10530
10535
|
}, c = (v, f) => {
|
|
10531
10536
|
if (!v)
|
|
10532
10537
|
return;
|
|
10533
|
-
const l = i(),
|
|
10534
|
-
if (v ==
|
|
10535
|
-
return
|
|
10536
|
-
if (v ==
|
|
10538
|
+
const l = i(), y = l[St.urlParams], A = l[St.compParams];
|
|
10539
|
+
if (v == St.urlParams)
|
|
10540
|
+
return y;
|
|
10541
|
+
if (v == St.compParams)
|
|
10537
10542
|
return A;
|
|
10538
|
-
const g = a(v),
|
|
10543
|
+
const g = a(v), E = g == null ? void 0 : g.protocal, b = o(f);
|
|
10539
10544
|
let F = null;
|
|
10540
|
-
switch (
|
|
10545
|
+
switch (E) {
|
|
10541
10546
|
case rn.VALUE:
|
|
10542
10547
|
F = ut(String(g == null ? void 0 : g.initialData), b), ha(F) && (F = Q0(F));
|
|
10543
10548
|
break;
|
|
@@ -10548,24 +10553,24 @@ function bl(t) {
|
|
|
10548
10553
|
return F;
|
|
10549
10554
|
}, x = (v, f) => {
|
|
10550
10555
|
var l = c(v, f);
|
|
10551
|
-
return ni(l) ? l : new Promise((
|
|
10552
|
-
|
|
10556
|
+
return ni(l) ? l : new Promise((y, A) => {
|
|
10557
|
+
y(l);
|
|
10553
10558
|
});
|
|
10554
|
-
}, d = (v, f, l) => new Promise((
|
|
10559
|
+
}, d = (v, f, l) => new Promise((y, A) => {
|
|
10555
10560
|
const g = v == null ? void 0 : v.length;
|
|
10556
|
-
let
|
|
10561
|
+
let E = 0;
|
|
10557
10562
|
var b = v == null ? void 0 : v.map((_) => x(_, f));
|
|
10558
10563
|
let F = 0;
|
|
10559
10564
|
Promise.all(b.map(
|
|
10560
10565
|
(_) => _.then((S) => {
|
|
10561
10566
|
var C;
|
|
10562
|
-
|
|
10563
|
-
var
|
|
10564
|
-
const
|
|
10565
|
-
return l == null || l(
|
|
10567
|
+
E++;
|
|
10568
|
+
var R = Math.round(E / g * 100);
|
|
10569
|
+
const q = v[F++], w = (C = a(q)) == null ? void 0 : C.description;
|
|
10570
|
+
return l == null || l(R, S, F, q, w), S;
|
|
10566
10571
|
})
|
|
10567
10572
|
)).then((_) => {
|
|
10568
|
-
l == null || l(100, _, F, "completedAll", "completedAll"),
|
|
10573
|
+
l == null || l(100, _, F, "completedAll", "completedAll"), y(_);
|
|
10569
10574
|
});
|
|
10570
10575
|
});
|
|
10571
10576
|
return {
|
|
@@ -10573,12 +10578,12 @@ function bl(t) {
|
|
|
10573
10578
|
remoteReadSchemaData: B,
|
|
10574
10579
|
readSchemaData: c,
|
|
10575
10580
|
findSchema: a,
|
|
10576
|
-
getSchemaDataObject: (v, f, l) => new Promise((
|
|
10581
|
+
getSchemaDataObject: (v, f, l) => new Promise((y, A) => {
|
|
10577
10582
|
d(v, f, l).then((g) => {
|
|
10578
|
-
var
|
|
10583
|
+
var E = {};
|
|
10579
10584
|
g.forEach((b) => {
|
|
10580
|
-
|
|
10581
|
-
}), E
|
|
10585
|
+
E = ht(E, b, !0);
|
|
10586
|
+
}), y(E);
|
|
10582
10587
|
});
|
|
10583
10588
|
}),
|
|
10584
10589
|
getOneSchemaData: x,
|
|
@@ -10604,7 +10609,7 @@ const bn = (t) => typeof (t == null ? void 0 : t.value) == "boolean" ? !1 : null
|
|
|
10604
10609
|
const n = Object.assign({}, (B = (a = e == null ? void 0 : e.exposed) == null ? void 0 : a.getFormData) == null ? void 0 : B.call(a), t == null ? void 0 : t.formData);
|
|
10605
10610
|
return {
|
|
10606
10611
|
[E0.sysVar]: {
|
|
10607
|
-
[
|
|
10612
|
+
[St.rowScope]: r
|
|
10608
10613
|
// [dataVar.outerParams]: _outerParams
|
|
10609
10614
|
},
|
|
10610
10615
|
[E0.sysData]: n
|
|
@@ -10627,15 +10632,15 @@ const bn = (t) => typeof (t == null ? void 0 : t.value) == "boolean" ? !1 : null
|
|
|
10627
10632
|
const { updateFomula: i } = Dn(), { variableWithNameExp: o } = Oa();
|
|
10628
10633
|
if (n) {
|
|
10629
10634
|
var a = e == null ? void 0 : e[E0.sysData];
|
|
10630
|
-
a && (s = i(s, r || {}, (c, x) =>
|
|
10635
|
+
a && (s = i(s, r || {}, (c, x) => Rt(x) ? null : `${(a == null ? void 0 : a[x]) || ""}`)), (B = Pt(e == null ? void 0 : e[E0.sysVar])) == null || B.forEach((c) => {
|
|
10631
10636
|
var x;
|
|
10632
|
-
a = (x = e == null ? void 0 : e[E0.sysVar]) == null ? void 0 : x[c], a && (s = i(s, a, (d, h) =>
|
|
10637
|
+
a = (x = e == null ? void 0 : e[E0.sysVar]) == null ? void 0 : x[c], a && (s = i(s, a, (d, h) => Rt(h) ? null : h, o("sysVar." + c)));
|
|
10633
10638
|
});
|
|
10634
10639
|
} else
|
|
10635
10640
|
return s = i(s, r || {}, (c, x) => x ? `${E0.sysData}.${x}` : (e || (e = {}), e[E0.sysData] || (e[E0.sysData] = {}), e[E0.sysData][c] === void 0 && (e[E0.sysData][c] = null), `${E0.sysData}.${c}`)), s;
|
|
10636
10641
|
return s;
|
|
10637
10642
|
}, Fl = (t, e) => {
|
|
10638
|
-
if (
|
|
10643
|
+
if (K.isFormula(t)) {
|
|
10639
10644
|
const { transFormula: o } = Dn(), B = Un(e)[E0.sysData];
|
|
10640
10645
|
let c = zn(B, e);
|
|
10641
10646
|
var r = u0(t), n = u0(r == null ? void 0 : r.value), s = o(n == null ? void 0 : n.complexValue, c), i = Dl(s, B);
|
|
@@ -10662,13 +10667,13 @@ const bn = (t) => typeof (t == null ? void 0 : t.value) == "boolean" ? !1 : null
|
|
|
10662
10667
|
var { specialNode: s, matchSpecialNode: i } = Sa(), { init: o, replaceVariableName: a } = Ta(), B = t;
|
|
10663
10668
|
if (i(t)) {
|
|
10664
10669
|
var c = await o();
|
|
10665
|
-
Ga(t, (
|
|
10670
|
+
Ga(t, (y) => a(c, y, s, e));
|
|
10666
10671
|
}
|
|
10667
10672
|
if (e && r && ((r == null ? void 0 : r.length) || 0) > 0)
|
|
10668
10673
|
for (var x = 0; x < r.length; x++) {
|
|
10669
10674
|
var d = r == null ? void 0 : r[x], h = e == null ? void 0 : e[d];
|
|
10670
10675
|
if (Cn(h)) {
|
|
10671
|
-
var v = (l =
|
|
10676
|
+
var v = (l = Pt(h)) == null ? void 0 : l.some((y) => ni(h[y]));
|
|
10672
10677
|
if (v) {
|
|
10673
10678
|
var f = await pa(h);
|
|
10674
10679
|
e[d] = f;
|
|
@@ -10685,31 +10690,31 @@ const bn = (t) => typeof (t == null ? void 0 : t.value) == "boolean" ? !1 : null
|
|
|
10685
10690
|
}, null, { immediate: !0 });
|
|
10686
10691
|
return r;
|
|
10687
10692
|
}, wl = (t, e) => {
|
|
10688
|
-
if (
|
|
10689
|
-
var r =
|
|
10693
|
+
if (K.isVariable(t)) {
|
|
10694
|
+
var r = K.getVariable(t);
|
|
10690
10695
|
return Fo(r, e);
|
|
10691
10696
|
}
|
|
10692
10697
|
}, _l = (t, e) => {
|
|
10693
|
-
if (
|
|
10694
|
-
var r =
|
|
10698
|
+
if (K.isSchemaData(t)) {
|
|
10699
|
+
var r = K.getSchemaData(t);
|
|
10695
10700
|
return Fo(r, e);
|
|
10696
10701
|
}
|
|
10697
10702
|
}, Sl = (t, e = !1, r) => {
|
|
10698
10703
|
var n = u0(t), s = n == null ? void 0 : n.value, i = u0(s);
|
|
10699
|
-
return
|
|
10704
|
+
return K.isVariable(t) && !(i != null && i.complexType) ? e ? wl(t, r) : t == null ? void 0 : t.value : K.isFormula(t) ? e ? Fl(t, r) : bn() : K.isSchemaData(t) ? e ? _l(t, r) : bn() : u0(s);
|
|
10700
10705
|
}, Tl = (t, e = !1, r = !1, n) => {
|
|
10701
|
-
if (!
|
|
10706
|
+
if (!K.isComplex(t))
|
|
10702
10707
|
return t;
|
|
10703
|
-
if (!e && !
|
|
10708
|
+
if (!e && !K.getEnable(t))
|
|
10704
10709
|
return bn();
|
|
10705
10710
|
var s = u0(t), i = s == null ? void 0 : s.value;
|
|
10706
|
-
return !
|
|
10711
|
+
return !K.isVariable(t) && i === null ? null : u0(Sl(t, r, n));
|
|
10707
10712
|
}, Rl = (t, e) => {
|
|
10708
10713
|
const r = Un(e);
|
|
10709
10714
|
let n = zn(r[E0.sysData], e);
|
|
10710
10715
|
return An(t, r, n, !0);
|
|
10711
10716
|
};
|
|
10712
|
-
class
|
|
10717
|
+
class K {
|
|
10713
10718
|
constructor(e, r, n, s, i) {
|
|
10714
10719
|
j(this, "type", X.prop);
|
|
10715
10720
|
j(this, "propType");
|
|
@@ -10735,7 +10740,7 @@ class Z {
|
|
|
10735
10740
|
}
|
|
10736
10741
|
static isComplexValue(e) {
|
|
10737
10742
|
var r;
|
|
10738
|
-
return
|
|
10743
|
+
return K.hasComplexValue(e) && !!((r = u0(e == null ? void 0 : e.value)) != null && r.complexType);
|
|
10739
10744
|
}
|
|
10740
10745
|
static buildVariablePropValue(e, r) {
|
|
10741
10746
|
return {
|
|
@@ -10772,12 +10777,12 @@ class Z {
|
|
|
10772
10777
|
}
|
|
10773
10778
|
static clearSchemaData(e) {
|
|
10774
10779
|
var n;
|
|
10775
|
-
var r =
|
|
10780
|
+
var r = _t(e);
|
|
10776
10781
|
return this.isComplex(e) ? (n = u0(r)) == null ? void 0 : n.value : r;
|
|
10777
10782
|
}
|
|
10778
10783
|
static setSchemaData(e, r) {
|
|
10779
|
-
var n =
|
|
10780
|
-
return this.isComplex(n) ? n = s : n = new
|
|
10784
|
+
var n = _t(e), s = new Xn(X.schemaData, r);
|
|
10785
|
+
return this.isComplex(n) ? n = s : n = new K(X.prop, s), n;
|
|
10781
10786
|
}
|
|
10782
10787
|
static getSchemaData(e) {
|
|
10783
10788
|
var n;
|
|
@@ -10791,8 +10796,8 @@ class Z {
|
|
|
10791
10796
|
return this.hasComplexValue(e) && ((r = u0(e == null ? void 0 : e.value)) == null ? void 0 : r.complexType) === X.formula;
|
|
10792
10797
|
}
|
|
10793
10798
|
static setFormula(e, r) {
|
|
10794
|
-
var n =
|
|
10795
|
-
return this.isComplex(n) ? n = s : n = new
|
|
10799
|
+
var n = _t(e), s = new Xn(X.formula, r);
|
|
10800
|
+
return this.isComplex(n) ? n = s : n = new K(X.prop, s), n;
|
|
10796
10801
|
}
|
|
10797
10802
|
static getFormula(e) {
|
|
10798
10803
|
var r;
|
|
@@ -10810,7 +10815,7 @@ class Z {
|
|
|
10810
10815
|
}
|
|
10811
10816
|
static clearVariable(e) {
|
|
10812
10817
|
var n;
|
|
10813
|
-
var r =
|
|
10818
|
+
var r = _t(e);
|
|
10814
10819
|
if (this.isComplex(e)) {
|
|
10815
10820
|
const s = u0(r), i = (n = s.options) == null ? void 0 : n.origin;
|
|
10816
10821
|
return this.isComplex(i) ? (u0(i).value = s == null ? void 0 : s.value, i) : s == null ? void 0 : s.value;
|
|
@@ -10818,12 +10823,12 @@ class Z {
|
|
|
10818
10823
|
return r;
|
|
10819
10824
|
}
|
|
10820
10825
|
static setVariable(e, r) {
|
|
10821
|
-
var n =
|
|
10826
|
+
var n = _t(e);
|
|
10822
10827
|
if (this.isComplex(n)) {
|
|
10823
10828
|
let s = n == null ? void 0 : n.options;
|
|
10824
|
-
return n.type !== X.variable && (s = Object.assign(s || {}, { origin:
|
|
10829
|
+
return n.type !== X.variable && (s = Object.assign(s || {}, { origin: _t(n) })), new K(X.variable, n == null ? void 0 : n.value, s, r);
|
|
10825
10830
|
} else
|
|
10826
|
-
return new
|
|
10831
|
+
return new K(X.variable, n || null, n == null ? void 0 : n.options, r);
|
|
10827
10832
|
}
|
|
10828
10833
|
static getVariable(e) {
|
|
10829
10834
|
var r;
|
|
@@ -10879,7 +10884,7 @@ class Co {
|
|
|
10879
10884
|
//用于获取属性列表
|
|
10880
10885
|
static getKeys() {
|
|
10881
10886
|
var e = new this();
|
|
10882
|
-
return
|
|
10887
|
+
return Pt(e);
|
|
10883
10888
|
}
|
|
10884
10889
|
}
|
|
10885
10890
|
class kl extends Co {
|
|
@@ -10906,31 +10911,31 @@ class Pl extends kl {
|
|
|
10906
10911
|
/**
|
|
10907
10912
|
* 组件宽度
|
|
10908
10913
|
*/
|
|
10909
|
-
j(this, "ctrlWidth", new
|
|
10914
|
+
j(this, "ctrlWidth", new K(X.placer, "auto"));
|
|
10910
10915
|
/**
|
|
10911
10916
|
* 组件高度
|
|
10912
10917
|
*/
|
|
10913
|
-
j(this, "ctrlHeight", new
|
|
10918
|
+
j(this, "ctrlHeight", new K(X.placer, "auto"));
|
|
10914
10919
|
/**
|
|
10915
10920
|
* 自定义CSS样式
|
|
10916
10921
|
*/
|
|
10917
|
-
j(this, "customClass", new
|
|
10922
|
+
j(this, "customClass", new K(X.placer, []));
|
|
10918
10923
|
/**
|
|
10919
10924
|
* 组件外容器CSS样式
|
|
10920
10925
|
*/
|
|
10921
|
-
j(this, "componentWrapperClass", new
|
|
10926
|
+
j(this, "componentWrapperClass", new K(X.placer, []));
|
|
10922
10927
|
/**
|
|
10923
10928
|
* 显示样式
|
|
10924
10929
|
*/
|
|
10925
|
-
j(this, "displayLayout", new
|
|
10930
|
+
j(this, "displayLayout", new K(X.placer, ii.block));
|
|
10926
10931
|
/**
|
|
10927
10932
|
* 组件创建后调用事件
|
|
10928
10933
|
*/
|
|
10929
|
-
j(this, "created", new
|
|
10934
|
+
j(this, "created", new K(X.event, void 0, new yt()));
|
|
10930
10935
|
/**
|
|
10931
10936
|
* 组件挂载完成后调用事件
|
|
10932
10937
|
*/
|
|
10933
|
-
j(this, "mounted", new
|
|
10938
|
+
j(this, "mounted", new K(X.event, void 0, new yt()));
|
|
10934
10939
|
}
|
|
10935
10940
|
}
|
|
10936
10941
|
class $n extends Pl {
|
|
@@ -10939,7 +10944,7 @@ class $n extends Pl {
|
|
|
10939
10944
|
/**
|
|
10940
10945
|
* 是否隐藏
|
|
10941
10946
|
*/
|
|
10942
|
-
j(this, "hidden", new
|
|
10947
|
+
j(this, "hidden", new K(X.placer, !1));
|
|
10943
10948
|
}
|
|
10944
10949
|
}
|
|
10945
10950
|
class Hl extends $n {
|
|
@@ -10948,7 +10953,7 @@ class Hl extends $n {
|
|
|
10948
10953
|
/**
|
|
10949
10954
|
* 标签内容
|
|
10950
10955
|
*/
|
|
10951
|
-
j(this, "content", new
|
|
10956
|
+
j(this, "content", new K(X.placer, ""));
|
|
10952
10957
|
}
|
|
10953
10958
|
}
|
|
10954
10959
|
class s1 extends Hl {
|
|
@@ -10957,11 +10962,11 @@ class s1 extends Hl {
|
|
|
10957
10962
|
/**
|
|
10958
10963
|
* 启用插槽
|
|
10959
10964
|
*/
|
|
10960
|
-
j(this, "slotable", new
|
|
10965
|
+
j(this, "slotable", new K(X.placer, !1));
|
|
10961
10966
|
/**
|
|
10962
10967
|
* 默认插槽
|
|
10963
10968
|
*/
|
|
10964
|
-
j(this, "default", new
|
|
10969
|
+
j(this, "default", new K(X.slot, null, new Do()));
|
|
10965
10970
|
}
|
|
10966
10971
|
}
|
|
10967
10972
|
class i1 extends $n {
|
|
@@ -10970,11 +10975,11 @@ class i1 extends $n {
|
|
|
10970
10975
|
/**
|
|
10971
10976
|
* 启用插槽
|
|
10972
10977
|
*/
|
|
10973
|
-
j(this, "slotable", new
|
|
10978
|
+
j(this, "slotable", new K(X.placer, !1));
|
|
10974
10979
|
/**
|
|
10975
10980
|
* 默认插槽
|
|
10976
10981
|
*/
|
|
10977
|
-
j(this, "default", new
|
|
10982
|
+
j(this, "default", new K(X.slot, null, new Do()));
|
|
10978
10983
|
}
|
|
10979
10984
|
}
|
|
10980
10985
|
class Ur extends yt {
|
|
@@ -11002,9 +11007,9 @@ class ql extends Ur {
|
|
|
11002
11007
|
class Nl extends Ur {
|
|
11003
11008
|
constructor(r) {
|
|
11004
11009
|
super(r);
|
|
11005
|
-
j(this, "minValue",
|
|
11010
|
+
j(this, "minValue", null);
|
|
11006
11011
|
j(this, "includeMinValue", !0);
|
|
11007
|
-
j(this, "maxValue",
|
|
11012
|
+
j(this, "maxValue", null);
|
|
11008
11013
|
j(this, "includeMaxValue", !0);
|
|
11009
11014
|
ht(this, r);
|
|
11010
11015
|
}
|
|
@@ -11028,7 +11033,7 @@ class Ll extends $n {
|
|
|
11028
11033
|
/**
|
|
11029
11034
|
* 标签内容
|
|
11030
11035
|
*/
|
|
11031
|
-
j(this, "label", new
|
|
11036
|
+
j(this, "label", new K(X.placer, ""));
|
|
11032
11037
|
/**
|
|
11033
11038
|
* 默认值
|
|
11034
11039
|
*/
|
|
@@ -11036,7 +11041,7 @@ class Ll extends $n {
|
|
|
11036
11041
|
/**
|
|
11037
11042
|
* 组件状态
|
|
11038
11043
|
*/
|
|
11039
|
-
j(this, "state", new
|
|
11044
|
+
j(this, "state", new K(X.placer, Ut.custom));
|
|
11040
11045
|
/**
|
|
11041
11046
|
* 是否只读
|
|
11042
11047
|
*/
|
|
@@ -11056,11 +11061,11 @@ class Ll extends $n {
|
|
|
11056
11061
|
/**
|
|
11057
11062
|
* 标签是否隐藏
|
|
11058
11063
|
*/
|
|
11059
|
-
j(this, "labelHidden", new
|
|
11064
|
+
j(this, "labelHidden", new K(X.placer, !1));
|
|
11060
11065
|
/**
|
|
11061
11066
|
* 标签水平对齐方式
|
|
11062
11067
|
*/
|
|
11063
|
-
j(this, "labelAlign", new
|
|
11068
|
+
j(this, "labelAlign", new K(X.placer, ""));
|
|
11064
11069
|
/**
|
|
11065
11070
|
* 标签水平对齐方式,继承了form的labelPosition,但设置无效
|
|
11066
11071
|
*/
|
|
@@ -11068,19 +11073,19 @@ class Ll extends $n {
|
|
|
11068
11073
|
/**
|
|
11069
11074
|
* 标签宽度
|
|
11070
11075
|
*/
|
|
11071
|
-
j(this, "labelWidth", new
|
|
11076
|
+
j(this, "labelWidth", new K(X.placer, ""));
|
|
11072
11077
|
/**
|
|
11073
11078
|
* 标签图标样式
|
|
11074
11079
|
*/
|
|
11075
|
-
j(this, "labelIconClass", new
|
|
11080
|
+
j(this, "labelIconClass", new K(X.icon));
|
|
11076
11081
|
/**
|
|
11077
11082
|
* 标签图标位置
|
|
11078
11083
|
*/
|
|
11079
|
-
j(this, "labelIconPosition", new
|
|
11084
|
+
j(this, "labelIconPosition", new K(X.placer, ba.rear));
|
|
11080
11085
|
/**
|
|
11081
11086
|
* 标签提示内容
|
|
11082
11087
|
*/
|
|
11083
|
-
j(this, "labelTooltip", new
|
|
11088
|
+
j(this, "labelTooltip", new K(X.placer, ""));
|
|
11084
11089
|
/**
|
|
11085
11090
|
* 是否显示校验错误信息,继承自form,优先级比form低,在form已设置该属性的情况下,单组件设置无效,因此作废
|
|
11086
11091
|
*/
|
|
@@ -11092,19 +11097,19 @@ class Ll extends $n {
|
|
|
11092
11097
|
/**
|
|
11093
11098
|
* 内容改变调用事件
|
|
11094
11099
|
*/
|
|
11095
|
-
j(this, "change", new
|
|
11100
|
+
j(this, "change", new K(X.event, void 0, new yt()));
|
|
11096
11101
|
/**
|
|
11097
11102
|
* 获取焦点时调用事件
|
|
11098
11103
|
*/
|
|
11099
|
-
j(this, "focus", new
|
|
11104
|
+
j(this, "focus", new K(X.event, void 0, new yt()));
|
|
11100
11105
|
/**
|
|
11101
11106
|
* 失去焦点时调用事件
|
|
11102
11107
|
*/
|
|
11103
|
-
j(this, "blur", new
|
|
11108
|
+
j(this, "blur", new K(X.event, void 0, new yt()));
|
|
11104
11109
|
/**
|
|
11105
11110
|
* 点击控件时调用事件
|
|
11106
11111
|
*/
|
|
11107
|
-
j(this, "click", new
|
|
11112
|
+
j(this, "click", new K(X.event, void 0, new yt()));
|
|
11108
11113
|
/**
|
|
11109
11114
|
* 输入时是否触发表单的校验
|
|
11110
11115
|
*/
|
|
@@ -11112,7 +11117,7 @@ class Ll extends $n {
|
|
|
11112
11117
|
/**
|
|
11113
11118
|
* 是否必填
|
|
11114
11119
|
*/
|
|
11115
|
-
j(this, "required", new
|
|
11120
|
+
j(this, "required", new K(X.placer, !0, new Ur()));
|
|
11116
11121
|
/**
|
|
11117
11122
|
* 必填校验提示
|
|
11118
11123
|
*/
|
|
@@ -11120,11 +11125,11 @@ class Ll extends $n {
|
|
|
11120
11125
|
/**
|
|
11121
11126
|
* 正则表达式校验
|
|
11122
11127
|
*/
|
|
11123
|
-
j(this, "expValidate", new
|
|
11128
|
+
j(this, "expValidate", new K(X.placer, void 0, new Il()));
|
|
11124
11129
|
/**
|
|
11125
11130
|
* 范围校验时调用事件
|
|
11126
11131
|
*/
|
|
11127
|
-
j(this, "rangeValidate", new
|
|
11132
|
+
j(this, "rangeValidate", new K(X.placer, void 0, new Nl()));
|
|
11128
11133
|
/**
|
|
11129
11134
|
* 校验失败提示
|
|
11130
11135
|
*/
|
|
@@ -11132,7 +11137,7 @@ class Ll extends $n {
|
|
|
11132
11137
|
/**
|
|
11133
11138
|
* 校验时调用事件
|
|
11134
11139
|
*/
|
|
11135
|
-
j(this, "fnValidate", new
|
|
11140
|
+
j(this, "fnValidate", new K(X.placer, void 0, new ql()));
|
|
11136
11141
|
}
|
|
11137
11142
|
/**
|
|
11138
11143
|
* 数值提示时调用事件
|
|
@@ -11183,7 +11188,7 @@ class c1 extends Ul {
|
|
|
11183
11188
|
j(this, "isopen", !1);
|
|
11184
11189
|
}
|
|
11185
11190
|
}
|
|
11186
|
-
const
|
|
11191
|
+
const de = class {
|
|
11187
11192
|
constructor() {
|
|
11188
11193
|
j(this, "type", ya.none);
|
|
11189
11194
|
j(this, "icon", "");
|
|
@@ -11202,7 +11207,7 @@ const he = class {
|
|
|
11202
11207
|
return "@widget-" + (e || "") + (r ? "-field" : "");
|
|
11203
11208
|
}
|
|
11204
11209
|
};
|
|
11205
|
-
let m0 =
|
|
11210
|
+
let m0 = de;
|
|
11206
11211
|
/**
|
|
11207
11212
|
* 判断是否为容器组件
|
|
11208
11213
|
* @param widget 组件
|
|
@@ -11224,8 +11229,8 @@ j(m0, "getWidgetTypeName", (e) => e ? B0.i18n2t(
|
|
|
11224
11229
|
j(m0, "getWidgetName", (e) => {
|
|
11225
11230
|
var r;
|
|
11226
11231
|
return e.type ? ((r = e.type) == null ? void 0 : r.trim()) + "-widget" : "";
|
|
11227
|
-
}), j(m0, "getName", (e) =>
|
|
11228
|
-
|
|
11232
|
+
}), j(m0, "getName", (e) => de.getOrgOption(e, rt.name)), j(m0, "setName", (e, r) => {
|
|
11233
|
+
de.setOptions(e, rt.name, r);
|
|
11229
11234
|
}), /**
|
|
11230
11235
|
* 获取属性原始值
|
|
11231
11236
|
* @param widget 组件
|
|
@@ -11238,16 +11243,16 @@ j(m0, "getOrgOption", (e, r) => {
|
|
|
11238
11243
|
}), j(m0, "setOrgOption", (e, r, n) => {
|
|
11239
11244
|
!e || !e.options || (e.options[r] = n);
|
|
11240
11245
|
}), j(m0, "getOptions", (e, r, n = !1, s = !1, i) => {
|
|
11241
|
-
var o =
|
|
11246
|
+
var o = de.getOrgOption(e, r);
|
|
11242
11247
|
if (n)
|
|
11243
11248
|
return o;
|
|
11244
|
-
var a =
|
|
11249
|
+
var a = K.getValue(o, !1, s, i);
|
|
11245
11250
|
if (a !== null)
|
|
11246
11251
|
return a;
|
|
11247
11252
|
}), j(m0, "setOptions", (e, r, n) => {
|
|
11248
|
-
|
|
11253
|
+
K.setValue(e == null ? void 0 : e.options, r, n);
|
|
11249
11254
|
}), j(m0, "setEnable", (e, r, n) => {
|
|
11250
|
-
|
|
11255
|
+
K.setEnable(e == null ? void 0 : e.options, r, n);
|
|
11251
11256
|
});
|
|
11252
11257
|
class Fn extends m0 {
|
|
11253
11258
|
constructor() {
|
|
@@ -11261,9 +11266,9 @@ class Fn extends m0 {
|
|
|
11261
11266
|
}
|
|
11262
11267
|
class x1 extends Fn {
|
|
11263
11268
|
constructor(e, r, n = !1, s) {
|
|
11264
|
-
super(), s != null && s.autoWidth && ft(r, rt.ctrlWidth) && (r.ctrlWidth = new
|
|
11269
|
+
super(), s != null && s.autoWidth && ft(r, rt.ctrlWidth) && (r.ctrlWidth = new K(X.placer, ma.auto)), s != null && s.inlineLayout && ft(r, rt.displayLayout) && (r.displayLayout = new K(X.placer, ii.inline)), Rt(s == null ? void 0 : s.dynamicItemFlag) || (this.dynamicItemFlag = s == null ? void 0 : s.dynamicItemFlag), this.formItemFlag = n, this.type = e, this.options = r, Object.entries(r).map(([i, o]) => {
|
|
11265
11270
|
var a;
|
|
11266
|
-
|
|
11271
|
+
K.getType(o) === X.slot && ((a = K.getOptions(o)) != null && a.allowDrag) && (o.widgetList = []);
|
|
11267
11272
|
}), this.init(n);
|
|
11268
11273
|
}
|
|
11269
11274
|
}
|
|
@@ -11274,12 +11279,12 @@ export {
|
|
|
11274
11279
|
bo as C,
|
|
11275
11280
|
Yl as D,
|
|
11276
11281
|
t1 as E,
|
|
11277
|
-
|
|
11282
|
+
ce as F,
|
|
11278
11283
|
e1 as G,
|
|
11279
|
-
|
|
11284
|
+
Qt as H,
|
|
11280
11285
|
$n as I,
|
|
11281
|
-
|
|
11282
|
-
|
|
11286
|
+
It as J,
|
|
11287
|
+
K as P,
|
|
11283
11288
|
x1 as S,
|
|
11284
11289
|
c1 as T,
|
|
11285
11290
|
bl as a,
|