hlrender 0.0.79 → 0.0.80
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-58406a14.js → affix-widget-4319d255.js} +9 -9
- package/{alert-widget-8450e3a7.js → alert-widget-f4ddf14b.js} +9 -9
- package/{anchor-widget-8644fb21.js → anchor-widget-d2b6495a.js} +6 -6
- package/{auto-complete-widget-b83fca2d.js → auto-complete-widget-dc6c859c.js} +8 -8
- package/{avatar-widget-578d2192.js → avatar-widget-66a33eb7.js} +9 -9
- package/{backtop-widget-9421219d.js → backtop-widget-3a6935a3.js} +9 -9
- package/{badge-widget-90ba3aee.js → badge-widget-58c8396c.js} +9 -9
- package/{baseImp-1823b8f4.js → baseImp-6b6bb628.js} +901 -892
- package/{breadcrumb-widget-826e54a7.js → breadcrumb-widget-da27c276.js} +6 -6
- package/{button-widget-c5492a84.js → button-widget-16b70cdb.js} +9 -9
- package/{cache-widget-08cf6eb5.js → cache-widget-9158963c.js} +7 -7
- package/{card-widget-35fbb896.js → card-widget-d167cd73.js} +7 -7
- package/{carousel-widget-a72c6870.js → carousel-widget-4b74b2e7.js} +6 -6
- package/{cascader-widget-52920e50.js → cascader-widget-d2580c56.js} +7 -7
- package/{chart-widget-692649ee.js → chart-widget-ee7a2a5f.js} +6 -6
- package/{checkbox-widget-6af6f526.js → checkbox-widget-cc683e36.js} +7 -7
- package/{collapse-widget-ac09feb0.js → collapse-widget-58e07431.js} +6 -6
- package/{color-picker-widget-c985fccd.js → color-picker-widget-a9f0aea8.js} +7 -7
- package/{cont-cell-widget-92da9906.js → cont-cell-widget-6a2bd5f6.js} +1 -1
- package/{cont-cell-widget.vue_vue_type_script_setup_true_name_cont-cell-widget_lang-52a43fb1.js → cont-cell-widget.vue_vue_type_script_setup_true_name_cont-cell-widget_lang-96ee153f.js} +4 -4
- package/{cont-widget-ad3540c2.js → cont-widget-8a9022e3.js} +4 -4
- package/{content-wrapper-1aef53e7.js → content-wrapper-29b6708f.js} +2 -2
- package/{content-wrapper.vue_vue_type_script_setup_true_lang-b5db4f02.js → content-wrapper.vue_vue_type_script_setup_true_lang-bc00b03b.js} +1 -1
- package/{date-picker-range-widget-9168eb4d.js → date-picker-range-widget-9475f06a.js} +7 -7
- package/{date-picker-widget-a3763467.js → date-picker-widget-0289d311.js} +7 -7
- package/{default-slot-widget-67af6c38.js → default-slot-widget-fe92c1fb.js} +7 -7
- package/{default-slot-widget.vue_vue_type_script_setup_true_name_default-slot-widget_lang-c71208b0.js → default-slot-widget.vue_vue_type_script_setup_true_name_default-slot-widget_lang-33ddf6c0.js} +4 -4
- package/{descriptions-widget-ad9bb601.js → descriptions-widget-d7811cea.js} +7 -7
- package/{dialog-widget-c96bc282.js → dialog-widget-7bd7ed81.js} +8 -8
- package/{divider-widget-b9a35e5d.js → divider-widget-9ec4b952.js} +9 -9
- package/{drag-wrapper-d7e47032.js → drag-wrapper-ed38fea0.js} +4 -4
- package/{drawer-widget-fcd7935c.js → drawer-widget-f7eb6ee9.js} +8 -8
- package/{dropdown-widget-6ba9b7de.js → dropdown-widget-0ae1fb3a.js} +7 -7
- package/{empty-widget-6f422a3d.js → empty-widget-511362d2.js} +9 -9
- package/{feedback-widget-1e0f1ca9.js → feedback-widget-7b8c732b.js} +8 -8
- package/{feedback-widget.vue_vue_type_script_setup_true_name_feedback-widget_lang-7986e1f8.js → feedback-widget.vue_vue_type_script_setup_true_name_feedback-widget_lang-b0f01143.js} +4 -4
- package/{file-upload-widget-1a8e638f.js → file-upload-widget-66b5232a.js} +8 -8
- package/{form-item-wrapper-d02be493.js → form-item-wrapper-e4ea8b5c.js} +3 -3
- package/{form-widget-d7c4188a.js → form-widget-befcb101.js} +7 -7
- package/{grid-col-widget-16311b5c.js → grid-col-widget-0a529247.js} +1 -1
- package/{grid-col-widget.vue_vue_type_script_setup_true_name_grid-col-widget_lang-d543b46b.js → grid-col-widget.vue_vue_type_script_setup_true_name_grid-col-widget_lang-096cae43.js} +4 -4
- package/{grid-widget-c681fe21.js → grid-widget-1f2e47f3.js} +4 -4
- package/{html-text-widget-8d50ebaf.js → html-text-widget-86235fb5.js} +7 -7
- package/{iframe-widget-46684b4d.js → iframe-widget-5f99f245.js} +6 -6
- package/{image-widget-f6a63c4d.js → image-widget-a5010fff.js} +6 -6
- package/{index-53c8509c.js → index-b2b4d140.js} +1 -1
- package/{input-number-widget-a72a238d.js → input-number-widget-47908457.js} +7 -7
- package/{input-widget-f4b43446.js → input-widget-002c5f7f.js} +8 -8
- package/{link-widget-bf8793ff.js → link-widget-0d54300a.js} +9 -9
- package/{ltable-col-widget-62760b77.js → ltable-col-widget-b4a3cb0d.js} +1 -1
- package/{ltable-col-widget.vue_vue_type_script_setup_true_name_ltable-col-widget_lang-9d41c498.js → ltable-col-widget.vue_vue_type_script_setup_true_name_ltable-col-widget_lang-89097b12.js} +6 -6
- package/{ltable-widget-78644c41.js → ltable-widget-48a55242.js} +4 -4
- package/{menu-widget-a4274463.js → menu-widget-784f8dff.js} +7 -7
- package/{model-widget-4d3cc616.js → model-widget-b55d8baf.js} +6 -6
- package/{multirow-0bcb8d2e.js → multirow-e1813996.js} +3 -3
- package/{multirow-widget-c82a5713.js → multirow-widget-c78632c7.js} +7 -7
- package/package.json +1 -1
- package/{pagination-widget-5f99d3f1.js → pagination-widget-ebc93144.js} +6 -6
- package/{picture-upload-widget-25d2c455.js → picture-upload-widget-c5dc84a1.js} +8 -8
- package/{progress-widget-3e68b5df.js → progress-widget-6b32f8a8.js} +7 -7
- package/{radio-widget-45a35607.js → radio-widget-9cf28fa1.js} +7 -7
- package/{range-widget-4dc4764e.js → range-widget-71e3a233.js} +8 -8
- package/{rate-widget-14add19d.js → rate-widget-1c1a16e5.js} +7 -7
- package/render.es.js +23 -23
- package/render.umd.js +293 -293
- package/{result-widget-bd80c908.js → result-widget-a4962a66.js} +7 -7
- package/{rich-editor-widget-9acd83a4.js → rich-editor-widget-d9f4c1d8.js} +7 -7
- package/{router-widget-bf2aa7d0.js → router-widget-9ed1e869.js} +6 -6
- package/{select-widget-9ab7b61b.js → select-widget-17298165.js} +7 -7
- package/{sfc-477e3e0d.js → sfc-36a55424.js} +3 -3
- package/{share-field-331b07f5.js → share-field-64192ba9.js} +4 -4
- package/{share-file-e13da717.js → share-file-6a52d0a0.js} +2 -2
- package/{slider-widget-0c994c29.js → slider-widget-94ccdbe2.js} +7 -7
- package/{slot-475169c9.js → slot-c8d71200.js} +1 -1
- package/{static-text-widget-eb8d67c5.js → static-text-widget-0516e763.js} +7 -7
- package/{steps-widget-674971b6.js → steps-widget-898e0afc.js} +6 -6
- package/{subMenu-widget-e9d8a50d.js → subMenu-widget-710b6ac4.js} +2 -2
- package/{subMenu-widget.vue_vue_type_script_setup_true_lang-168d4974.js → subMenu-widget.vue_vue_type_script_setup_true_lang-cb2717a8.js} +1 -1
- package/{switch-widget-ed778f89.js → switch-widget-ab9898a6.js} +7 -7
- package/{tab-pane-widget-17cd293f.js → tab-pane-widget-b6c54a7e.js} +1 -1
- package/{tab-pane-widget.vue_vue_type_script_setup_true_name_tab-pane-widget_lang-68741660.js → tab-pane-widget.vue_vue_type_script_setup_true_name_tab-pane-widget_lang-51053813.js} +4 -4
- package/{table-col-widget-8c054304.js → table-col-widget-8c7b4ba0.js} +6 -6
- package/{table-col-widget.vue_vue_type_script_setup_true_name_table-col-widget_lang-b72cd05d.js → table-col-widget.vue_vue_type_script_setup_true_name_table-col-widget_lang-df28bc98.js} +4 -4
- package/{table-widget-0963e0a0.js → table-widget-e7717cb7.js} +8 -8
- package/{tabs-widget-27363109.js → tabs-widget-e4b7f212.js} +5 -5
- package/{tag-widget-eb9f8544.js → tag-widget-bc34c1d2.js} +9 -9
- package/{text-widget-197c7e52.js → text-widget-7415d16b.js} +9 -9
- package/{textarea-widget-00f43ab1.js → textarea-widget-197396f2.js} +7 -7
- package/{time-picker-range-widget-19a57042.js → time-picker-range-widget-12912d46.js} +7 -7
- package/{time-picker-widget-5467b390.js → time-picker-widget-710cdc20.js} +7 -7
- package/{time-select-widget-6310d22f.js → time-select-widget-b182bca8.js} +7 -7
- package/{tmpl-widget-bd04abf2.js → tmpl-widget-21dd1c11.js} +7 -7
- package/{tree-select-widget-0714a74f.js → tree-select-widget-56542628.js} +7 -7
- package/{tree-widget-52678b42.js → tree-widget-21c99793.js} +6 -6
- package/{widget-wrapper.vue_vue_type_script_setup_true_name_form-item-wrapper_lang-68451a8d.js → widget-wrapper.vue_vue_type_script_setup_true_name_form-item-wrapper_lang-7a5e211c.js} +2 -2
- package/{wrapper-widget-71413b55.js → wrapper-widget-1bfb1148.js} +4 -4
|
@@ -40,17 +40,17 @@ function Pa() {
|
|
|
40
40
|
};
|
|
41
41
|
}
|
|
42
42
|
function Cn() {
|
|
43
|
-
const { addTextPrefix: t } = Pa(), { variableExp: e, buildVariable: r } = Oa(), n = (x,
|
|
44
|
-
return Fn(
|
|
45
|
-
}) : x, s = (x,
|
|
46
|
-
var f = v, l =
|
|
43
|
+
const { addTextPrefix: t } = Pa(), { variableExp: e, buildVariable: r } = Oa(), n = (x, d) => G0(x) ? x == null ? void 0 : x.replace(e, function(h, v) {
|
|
44
|
+
return Fn(d) && (d != null && d[v]) ? d == null ? void 0 : d[v] : v;
|
|
45
|
+
}) : x, s = (x, d) => G0(x) ? x == null ? void 0 : x.replace(e, function(h, v) {
|
|
46
|
+
var f = v, l = d[f];
|
|
47
47
|
return z0(l) ? t(" ") : t(l);
|
|
48
|
-
}) : x, i = (x,
|
|
49
|
-
var f = v, l =
|
|
48
|
+
}) : x, i = (x, d) => G0(x) ? x == null ? void 0 : x.replaceAll(e, function(h, v) {
|
|
49
|
+
var f = v, l = d[f];
|
|
50
50
|
return !Tt(f) && !Tt(l) ? r(l) : h;
|
|
51
|
-
}) : x, o = (x,
|
|
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 y = l, A = (g = Ot(
|
|
53
|
+
var y = l, A = (g = Ot(d)) != null && g.includes(y) ? d == null ? void 0 : d[y] : null;
|
|
54
54
|
return Tt(y) ? f : h ? h(y, A) : Tt(A) ? null : A;
|
|
55
55
|
}) : x;
|
|
56
56
|
return {
|
|
@@ -59,18 +59,18 @@ function Cn() {
|
|
|
59
59
|
getFormulaFields: (x) => {
|
|
60
60
|
if (!x || wr(x))
|
|
61
61
|
return [];
|
|
62
|
-
for (var
|
|
63
|
-
h.push(
|
|
62
|
+
for (var d = null, h = []; (d = e.exec(x)) !== null; )
|
|
63
|
+
h.push(d == null ? void 0 : d[1]);
|
|
64
64
|
return h;
|
|
65
65
|
},
|
|
66
|
-
updateFomulaName: (x,
|
|
66
|
+
updateFomulaName: (x, d, h) => {
|
|
67
67
|
if (z0(x))
|
|
68
68
|
return x;
|
|
69
69
|
let v = M0(x);
|
|
70
|
-
return v != null && v.includes(
|
|
70
|
+
return v != null && v.includes(d) ? (v = i(v, { [d]: h }), Q0(v)) : x;
|
|
71
71
|
},
|
|
72
|
-
updateFomula: (x,
|
|
73
|
-
var f = o(x,
|
|
72
|
+
updateFomula: (x, d, h, v = e) => {
|
|
73
|
+
var f = o(x, d, h, v);
|
|
74
74
|
return f;
|
|
75
75
|
}
|
|
76
76
|
};
|
|
@@ -80,14 +80,14 @@ const Vl = (t, e) => {
|
|
|
80
80
|
return Object.entries(t).forEach(([n, s]) => {
|
|
81
81
|
(!e || e.includes(s)) && r.push(new Ba(n, s));
|
|
82
82
|
}), r;
|
|
83
|
-
},
|
|
83
|
+
}, Ha = (t, e) => {
|
|
84
84
|
var r = {};
|
|
85
85
|
return Object.entries(t).forEach(([n, s]) => {
|
|
86
86
|
(!e || e.includes(s)) && (r[n] = s || "");
|
|
87
87
|
}), r;
|
|
88
88
|
};
|
|
89
|
-
function
|
|
90
|
-
var r =
|
|
89
|
+
function Ia(t, e) {
|
|
90
|
+
var r = Ha(t, e);
|
|
91
91
|
return Object.values(r);
|
|
92
92
|
}
|
|
93
93
|
class Et {
|
|
@@ -152,8 +152,8 @@ const qa = (t) => t ? ci.test(t) : !1, Na = (t) => {
|
|
|
152
152
|
(B = e == null ? void 0 : e.groups) != null && B.value;
|
|
153
153
|
let x = e == null ? void 0 : e[0];
|
|
154
154
|
i += x;
|
|
155
|
-
let
|
|
156
|
-
n && (s = c),
|
|
155
|
+
let d = Se(i, "{") == Se(i, "}") && Se(i, "(") == Se(i, ")");
|
|
156
|
+
n && (s = c), d && (i = i.replace(s + ":", ""), i.endsWith(",") ? i = i.substring(0, i.length - 1).trim() : i = i.trim(), o.push({ key: s, value: i }), i = "", s = ""), n = d;
|
|
157
157
|
}
|
|
158
158
|
return o;
|
|
159
159
|
}, xi = (t, e) => {
|
|
@@ -286,7 +286,7 @@ function Ja(t) {
|
|
|
286
286
|
let e;
|
|
287
287
|
return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? e = ArrayBuffer.isView(t) : e = t && t.buffer && di(t.buffer), e;
|
|
288
288
|
}
|
|
289
|
-
const tc = Tr("string"), X0 = Tr("function"), pi = Tr("number"), Rr = (t) => t !== null && typeof t == "object", ec = (t) => t === !0 || t === !1,
|
|
289
|
+
const tc = Tr("string"), X0 = Tr("function"), pi = Tr("number"), Rr = (t) => t !== null && typeof t == "object", ec = (t) => t === !0 || t === !1, He = (t) => {
|
|
290
290
|
if (Sr(t) !== "object")
|
|
291
291
|
return !1;
|
|
292
292
|
const e = wn(t);
|
|
@@ -322,7 +322,7 @@ const Bi = (() => typeof globalThis < "u" ? globalThis : typeof self < "u" ? sel
|
|
|
322
322
|
function dn() {
|
|
323
323
|
const { caseless: t } = gi(this) && this || {}, e = {}, r = (n, s) => {
|
|
324
324
|
const i = t && vi(e, s) || s;
|
|
325
|
-
|
|
325
|
+
He(e[i]) && He(n) ? e[i] = dn(e[i], n) : He(n) ? e[i] = dn({}, n) : ee(n) ? e[i] = n.slice() : e[i] = n;
|
|
326
326
|
};
|
|
327
327
|
for (let n = 0, s = arguments.length; n < s; n++)
|
|
328
328
|
arguments[n] && ve(arguments[n], r);
|
|
@@ -448,7 +448,7 @@ const _c = (t) => {
|
|
|
448
448
|
isNumber: pi,
|
|
449
449
|
isBoolean: ec,
|
|
450
450
|
isObject: Rr,
|
|
451
|
-
isPlainObject:
|
|
451
|
+
isPlainObject: He,
|
|
452
452
|
isUndefined: de,
|
|
453
453
|
isDate: rc,
|
|
454
454
|
isFile: nc,
|
|
@@ -598,16 +598,16 @@ function kr(t, e, r) {
|
|
|
598
598
|
}
|
|
599
599
|
return pn(f) ? !0 : (e.append(Vn(y, l, i), c(f)), !1);
|
|
600
600
|
}
|
|
601
|
-
const
|
|
601
|
+
const d = [], h = Object.assign(Oc, {
|
|
602
602
|
defaultVisitor: x,
|
|
603
603
|
convertValue: c,
|
|
604
604
|
isVisitable: pn
|
|
605
605
|
});
|
|
606
606
|
function v(f, l) {
|
|
607
607
|
if (!P.isUndefined(f)) {
|
|
608
|
-
if (
|
|
608
|
+
if (d.indexOf(f) !== -1)
|
|
609
609
|
throw Error("Circular reference detected in " + l.join("."));
|
|
610
|
-
|
|
610
|
+
d.push(f), P.forEach(f, function(A, g) {
|
|
611
611
|
(!(P.isUndefined(A) || A === null) && s.call(
|
|
612
612
|
e,
|
|
613
613
|
A,
|
|
@@ -615,7 +615,7 @@ function kr(t, e, r) {
|
|
|
615
615
|
l,
|
|
616
616
|
h
|
|
617
617
|
)) === !0 && v(A, l ? l.concat(g) : [g]);
|
|
618
|
-
}),
|
|
618
|
+
}), d.pop();
|
|
619
619
|
}
|
|
620
620
|
}
|
|
621
621
|
if (!P.isObject(t))
|
|
@@ -665,7 +665,7 @@ function Ci(t, e, r) {
|
|
|
665
665
|
}
|
|
666
666
|
return t;
|
|
667
667
|
}
|
|
668
|
-
class
|
|
668
|
+
class Hc {
|
|
669
669
|
constructor() {
|
|
670
670
|
this.handlers = [];
|
|
671
671
|
}
|
|
@@ -719,18 +719,18 @@ class Ic {
|
|
|
719
719
|
});
|
|
720
720
|
}
|
|
721
721
|
}
|
|
722
|
-
const Jn =
|
|
722
|
+
const Jn = Hc, Di = {
|
|
723
723
|
silentJSONParsing: !0,
|
|
724
724
|
forcedJSONParsing: !0,
|
|
725
725
|
clarifyTimeoutError: !1
|
|
726
|
-
},
|
|
726
|
+
}, Ic = typeof URLSearchParams < "u" ? URLSearchParams : _n, qc = typeof FormData < "u" ? FormData : null, Nc = typeof Blob < "u" ? Blob : null, Lc = (() => {
|
|
727
727
|
let t;
|
|
728
728
|
return typeof navigator < "u" && ((t = navigator.product) === "ReactNative" || t === "NativeScript" || t === "NS") ? !1 : typeof window < "u" && typeof document < "u";
|
|
729
729
|
})(), zc = (() => typeof WorkerGlobalScope < "u" && // eslint-disable-next-line no-undef
|
|
730
730
|
self instanceof WorkerGlobalScope && typeof self.importScripts == "function")(), lt = {
|
|
731
731
|
isBrowser: !0,
|
|
732
732
|
classes: {
|
|
733
|
-
URLSearchParams:
|
|
733
|
+
URLSearchParams: Ic,
|
|
734
734
|
FormData: qc,
|
|
735
735
|
Blob: Nc
|
|
736
736
|
},
|
|
@@ -882,8 +882,8 @@ const Sn = Or, Zc = P.toObjectSet([
|
|
|
882
882
|
function ie(t) {
|
|
883
883
|
return t && String(t).trim().toLowerCase();
|
|
884
884
|
}
|
|
885
|
-
function
|
|
886
|
-
return t === !1 || t == null ? t : P.isArray(t) ? t.map(
|
|
885
|
+
function Ie(t) {
|
|
886
|
+
return t === !1 || t == null ? t : P.isArray(t) ? t.map(Ie) : String(t);
|
|
887
887
|
}
|
|
888
888
|
function Gc(t) {
|
|
889
889
|
const e = /* @__PURE__ */ Object.create(null), r = /([^\s,;=]+)\s*(?:=\s*([^,;]+))?/g;
|
|
@@ -927,8 +927,8 @@ class Pr {
|
|
|
927
927
|
const x = ie(B);
|
|
928
928
|
if (!x)
|
|
929
929
|
throw new Error("header name must be a non-empty string");
|
|
930
|
-
const
|
|
931
|
-
(!
|
|
930
|
+
const d = P.findKey(s, x);
|
|
931
|
+
(!d || s[d] === void 0 || c === !0 || c === void 0 && s[d] !== !1) && (s[d || B] = Ie(a));
|
|
932
932
|
}
|
|
933
933
|
const o = (a, B) => P.forEach(a, (c, x) => i(c, x, B));
|
|
934
934
|
return P.isPlainObject(e) || e instanceof this.constructor ? o(e, r) : P.isString(e) && (e = e.trim()) && !Xc(e) ? o(Kc(e), r) : e != null && i(r, e, n), this;
|
|
@@ -982,11 +982,11 @@ class Pr {
|
|
|
982
982
|
return P.forEach(this, (s, i) => {
|
|
983
983
|
const o = P.findKey(n, i);
|
|
984
984
|
if (o) {
|
|
985
|
-
r[o] =
|
|
985
|
+
r[o] = Ie(s), delete r[i];
|
|
986
986
|
return;
|
|
987
987
|
}
|
|
988
988
|
const a = e ? Qc(i) : String(i).trim();
|
|
989
|
-
a !== i && delete r[i], r[a] =
|
|
989
|
+
a !== i && delete r[i], r[a] = Ie(s), n[a] = !0;
|
|
990
990
|
}), this;
|
|
991
991
|
}
|
|
992
992
|
concat(...e) {
|
|
@@ -1126,9 +1126,9 @@ function sx(t, e) {
|
|
|
1126
1126
|
return e = e !== void 0 ? e : 1e3, function(B) {
|
|
1127
1127
|
const c = Date.now(), x = n[i];
|
|
1128
1128
|
o || (o = c), r[s] = B, n[s] = c;
|
|
1129
|
-
let
|
|
1130
|
-
for (;
|
|
1131
|
-
h += r[
|
|
1129
|
+
let d = i, h = 0;
|
|
1130
|
+
for (; d !== s; )
|
|
1131
|
+
h += r[d++], d = d % t;
|
|
1132
1132
|
if (s = (s + 1) % t, s === i && (i = (i + 1) % t), c - o < e)
|
|
1133
1133
|
return;
|
|
1134
1134
|
const v = x && c - x;
|
|
@@ -1169,7 +1169,7 @@ const ix = typeof XMLHttpRequest < "u", ox = ix && function(t) {
|
|
|
1169
1169
|
}
|
|
1170
1170
|
const x = Si(t.baseURL, t.url);
|
|
1171
1171
|
c.open(t.method.toUpperCase(), Ci(x, t.params, t.paramsSerializer), !0), c.timeout = t.timeout;
|
|
1172
|
-
function
|
|
1172
|
+
function d() {
|
|
1173
1173
|
if (!c)
|
|
1174
1174
|
return;
|
|
1175
1175
|
const v = mt.from(
|
|
@@ -1188,8 +1188,8 @@ const ix = typeof XMLHttpRequest < "u", ox = ix && function(t) {
|
|
|
1188
1188
|
n(A), B();
|
|
1189
1189
|
}, l), c = null;
|
|
1190
1190
|
}
|
|
1191
|
-
if ("onloadend" in c ? c.onloadend =
|
|
1192
|
-
!c || c.readyState !== 4 || c.status === 0 && !(c.responseURL && c.responseURL.indexOf("file:") === 0) || setTimeout(
|
|
1191
|
+
if ("onloadend" in c ? c.onloadend = d : c.onreadystatechange = function() {
|
|
1192
|
+
!c || c.readyState !== 4 || c.status === 0 && !(c.responseURL && c.responseURL.indexOf("file:") === 0) || setTimeout(d);
|
|
1193
1193
|
}, c.onabort = function() {
|
|
1194
1194
|
c && (n(new c0("Request aborted", c0.ECONNABORTED, t, c)), c = null);
|
|
1195
1195
|
}, c.onerror = function() {
|
|
@@ -1278,15 +1278,15 @@ const ns = (t) => t instanceof mt ? t.toJSON() : t;
|
|
|
1278
1278
|
function Vt(t, e) {
|
|
1279
1279
|
e = e || {};
|
|
1280
1280
|
const r = {};
|
|
1281
|
-
function n(c, x,
|
|
1282
|
-
return P.isPlainObject(c) && P.isPlainObject(x) ? P.merge.call({ caseless:
|
|
1281
|
+
function n(c, x, d) {
|
|
1282
|
+
return P.isPlainObject(c) && P.isPlainObject(x) ? P.merge.call({ caseless: d }, c, x) : P.isPlainObject(x) ? P.merge({}, x) : P.isArray(x) ? x.slice() : x;
|
|
1283
1283
|
}
|
|
1284
|
-
function s(c, x,
|
|
1284
|
+
function s(c, x, d) {
|
|
1285
1285
|
if (P.isUndefined(x)) {
|
|
1286
1286
|
if (!P.isUndefined(c))
|
|
1287
|
-
return n(void 0, c,
|
|
1287
|
+
return n(void 0, c, d);
|
|
1288
1288
|
} else
|
|
1289
|
-
return n(c, x,
|
|
1289
|
+
return n(c, x, d);
|
|
1290
1290
|
}
|
|
1291
1291
|
function i(c, x) {
|
|
1292
1292
|
if (!P.isUndefined(x))
|
|
@@ -1299,10 +1299,10 @@ function Vt(t, e) {
|
|
|
1299
1299
|
} else
|
|
1300
1300
|
return n(void 0, x);
|
|
1301
1301
|
}
|
|
1302
|
-
function a(c, x,
|
|
1303
|
-
if (
|
|
1302
|
+
function a(c, x, d) {
|
|
1303
|
+
if (d in e)
|
|
1304
1304
|
return n(c, x);
|
|
1305
|
-
if (
|
|
1305
|
+
if (d in t)
|
|
1306
1306
|
return n(void 0, c);
|
|
1307
1307
|
}
|
|
1308
1308
|
const B = {
|
|
@@ -1336,8 +1336,8 @@ function Vt(t, e) {
|
|
|
1336
1336
|
headers: (c, x) => s(ns(c), ns(x), !0)
|
|
1337
1337
|
};
|
|
1338
1338
|
return P.forEach(Object.keys(Object.assign({}, t, e)), function(x) {
|
|
1339
|
-
const
|
|
1340
|
-
P.isUndefined(h) &&
|
|
1339
|
+
const d = B[x] || s, h = d(t[x], e[x], x);
|
|
1340
|
+
P.isUndefined(h) && d !== a || (r[x] = h);
|
|
1341
1341
|
}), r;
|
|
1342
1342
|
}
|
|
1343
1343
|
const Ti = "1.4.0", Tn = {};
|
|
@@ -1433,17 +1433,17 @@ class je {
|
|
|
1433
1433
|
this.interceptors.response.forEach(function(l) {
|
|
1434
1434
|
c.push(l.fulfilled, l.rejected);
|
|
1435
1435
|
});
|
|
1436
|
-
let x,
|
|
1436
|
+
let x, d = 0, h;
|
|
1437
1437
|
if (!B) {
|
|
1438
1438
|
const f = [rs.bind(this), void 0];
|
|
1439
|
-
for (f.unshift.apply(f, a), f.push.apply(f, c), h = f.length, x = Promise.resolve(r);
|
|
1440
|
-
x = x.then(f[
|
|
1439
|
+
for (f.unshift.apply(f, a), f.push.apply(f, c), h = f.length, x = Promise.resolve(r); d < h; )
|
|
1440
|
+
x = x.then(f[d++], f[d++]);
|
|
1441
1441
|
return x;
|
|
1442
1442
|
}
|
|
1443
1443
|
h = a.length;
|
|
1444
1444
|
let v = r;
|
|
1445
|
-
for (
|
|
1446
|
-
const f = a[
|
|
1445
|
+
for (d = 0; d < h; ) {
|
|
1446
|
+
const f = a[d++], l = a[d++];
|
|
1447
1447
|
try {
|
|
1448
1448
|
v = f(v);
|
|
1449
1449
|
} catch (y) {
|
|
@@ -1456,8 +1456,8 @@ class je {
|
|
|
1456
1456
|
} catch (f) {
|
|
1457
1457
|
return Promise.reject(f);
|
|
1458
1458
|
}
|
|
1459
|
-
for (
|
|
1460
|
-
x = x.then(c[
|
|
1459
|
+
for (d = 0, h = c.length; d < h; )
|
|
1460
|
+
x = x.then(c[d++], c[d++]);
|
|
1461
1461
|
return x;
|
|
1462
1462
|
}
|
|
1463
1463
|
getUri(e) {
|
|
@@ -1704,14 +1704,14 @@ const ki = b0, hx = (t) => {
|
|
|
1704
1704
|
}, vx = function(t) {
|
|
1705
1705
|
return Oi(window.location.href, t);
|
|
1706
1706
|
}, Oi = function(t, e) {
|
|
1707
|
-
const r =
|
|
1707
|
+
const r = Hr(t);
|
|
1708
1708
|
return r == null ? void 0 : r[e];
|
|
1709
1709
|
}, Bx = (t) => /^(?:%[0-9A-Fa-f]{2}|[A-Za-z0-9\-_.!~*'()]|%20)*$/.test(t), Pi = function() {
|
|
1710
|
-
return
|
|
1711
|
-
},
|
|
1710
|
+
return Hr(window.location.href);
|
|
1711
|
+
}, Hi = (t) => {
|
|
1712
1712
|
var e;
|
|
1713
1713
|
return ((e = t == null ? void 0 : t.split("?")) == null ? void 0 : e.at(0)) || t || "";
|
|
1714
|
-
},
|
|
1714
|
+
}, Hr = (t) => {
|
|
1715
1715
|
var s;
|
|
1716
1716
|
const e = {};
|
|
1717
1717
|
let r = (s = t == null ? void 0 : t.split("?")) == null ? void 0 : s.at(1), n = r == null ? void 0 : r.split("&");
|
|
@@ -1720,11 +1720,11 @@ const ki = b0, hx = (t) => {
|
|
|
1720
1720
|
Bx(B) ? e[a] = decodeURIComponent(B) : e[a] = B;
|
|
1721
1721
|
}
|
|
1722
1722
|
return e;
|
|
1723
|
-
},
|
|
1724
|
-
e = Object.assign(
|
|
1723
|
+
}, Ii = (t, e, r) => {
|
|
1724
|
+
e = Object.assign(Hr(t) || {}, e), t = Hi(t);
|
|
1725
1725
|
const n = Object.entries(e).map(([s, i]) => r === !1 ? `${s}=${i == null ? void 0 : i.toString()}` : `${encodeURIComponent(s)}=${encodeURIComponent(i == null ? void 0 : i.toString())}`).join("&");
|
|
1726
1726
|
return n ? `${t}?${n}` : t;
|
|
1727
|
-
}, gx = (t) =>
|
|
1727
|
+
}, gx = (t) => Ii(t, Pi()), qi = (t) => {
|
|
1728
1728
|
try {
|
|
1729
1729
|
return new URL(t), !0;
|
|
1730
1730
|
} catch {
|
|
@@ -1733,46 +1733,55 @@ const ki = b0, hx = (t) => {
|
|
|
1733
1733
|
}, yx = () => {
|
|
1734
1734
|
location.reload();
|
|
1735
1735
|
}, Ex = () => {
|
|
1736
|
-
function t(
|
|
1737
|
-
const
|
|
1738
|
-
const [
|
|
1736
|
+
function t(B, c, x = "", d = !1) {
|
|
1737
|
+
const h = (S) => {
|
|
1738
|
+
const [R, q = ""] = S.split("#", 2), [w, C = ""] = R.split("?", 2);
|
|
1739
1739
|
return {
|
|
1740
|
-
path:
|
|
1740
|
+
path: w.replace(/^#/, "").replace(/\/+$/, ""),
|
|
1741
1741
|
// 规范化路径
|
|
1742
|
-
searchParams: new URLSearchParams(
|
|
1743
|
-
hashFragment:
|
|
1742
|
+
searchParams: new URLSearchParams(C),
|
|
1743
|
+
hashFragment: q
|
|
1744
1744
|
};
|
|
1745
|
-
},
|
|
1746
|
-
|
|
1747
|
-
|
|
1745
|
+
}, v = h(B), f = h(c), l = d ? new URLSearchParams(v.searchParams) : new URLSearchParams();
|
|
1746
|
+
f.searchParams.forEach((S, R) => {
|
|
1747
|
+
l.set(R, S);
|
|
1748
1748
|
});
|
|
1749
|
-
const
|
|
1750
|
-
const
|
|
1751
|
-
for (const
|
|
1752
|
-
|
|
1753
|
-
return `/${
|
|
1754
|
-
},
|
|
1755
|
-
return (s() ? `/${
|
|
1756
|
-
}
|
|
1757
|
-
function e(
|
|
1758
|
-
return t(
|
|
1759
|
-
}
|
|
1760
|
-
const r = () => window.location.hash, n = () => window.location.pathname, s = () => !!r()
|
|
1749
|
+
const y = (S, R) => {
|
|
1750
|
+
const q = S.split("/").filter(Boolean), w = R.split("/").filter(Boolean);
|
|
1751
|
+
for (const C of w)
|
|
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
|
+
return (s() ? `/${x}#/${F}` : F).replace(/\/+/g, "/").replace(/^#\//, "#").replace(/%20/g, "+").replace(/[?#]/g, (S) => S);
|
|
1756
|
+
}
|
|
1757
|
+
function e(B, c, x = "") {
|
|
1758
|
+
return t(c, B, x);
|
|
1759
|
+
}
|
|
1760
|
+
const r = () => window.location.hash, n = () => window.location.pathname, s = () => !!r();
|
|
1761
|
+
function i(B) {
|
|
1762
|
+
const c = new URL(B);
|
|
1763
|
+
return c.pathname = c.pathname.replace(/\/{2,}/g, "/"), c.toString();
|
|
1764
|
+
}
|
|
1765
|
+
const o = (B) => {
|
|
1766
|
+
const c = "/";
|
|
1767
|
+
var x = window.location.href, [d] = x.split(/\/[^/]*#\//g, 2);
|
|
1768
|
+
return [d, B].join(c);
|
|
1769
|
+
};
|
|
1761
1770
|
return {
|
|
1762
|
-
resolveByCurrentUrl: (
|
|
1763
|
-
var
|
|
1764
|
-
if (qi(
|
|
1765
|
-
return
|
|
1766
|
-
const
|
|
1767
|
-
return i(
|
|
1771
|
+
resolveByCurrentUrl: (B, c = "") => {
|
|
1772
|
+
var d;
|
|
1773
|
+
if (qi(B))
|
|
1774
|
+
return B;
|
|
1775
|
+
const x = e(B, ((d = r()) == null ? void 0 : d.substring(1)) || n(), c);
|
|
1776
|
+
return i(o(x));
|
|
1768
1777
|
}
|
|
1769
1778
|
};
|
|
1770
1779
|
}, { resolveByCurrentUrl: mx } = Ex(), Gt = {
|
|
1771
|
-
buildUrl:
|
|
1772
|
-
getBaseUrl:
|
|
1780
|
+
buildUrl: Ii,
|
|
1781
|
+
getBaseUrl: Hi,
|
|
1773
1782
|
getQueryParam: Oi,
|
|
1774
1783
|
getLocationQueryParam: vx,
|
|
1775
|
-
getQueryParams:
|
|
1784
|
+
getQueryParams: Hr,
|
|
1776
1785
|
getLocationQueryParams: Pi,
|
|
1777
1786
|
buildUrlByLocalQuery: gx,
|
|
1778
1787
|
isUrl: qi,
|
|
@@ -1892,11 +1901,11 @@ class U0 {
|
|
|
1892
1901
|
}
|
|
1893
1902
|
}
|
|
1894
1903
|
}
|
|
1895
|
-
const
|
|
1904
|
+
const Ir = (t, e) => (console.log("send to ", t, e), t ? (t.postMessage(M0(e), "*"), !0) : !1), bx = (t, e) => {
|
|
1896
1905
|
const r = U0.find(window, t);
|
|
1897
1906
|
if (r)
|
|
1898
|
-
return
|
|
1899
|
-
}, Ax = (t, e) =>
|
|
1907
|
+
return Ir(r.window, e);
|
|
1908
|
+
}, Ax = (t, e) => Ir(t == null ? void 0 : t.contentWindow, e), Fx = (t) => Ir(window.parent, t), Cx = (t, e = !1) => {
|
|
1900
1909
|
const r = (n) => {
|
|
1901
1910
|
t == null || t(n), e && window.removeEventListener("message", r);
|
|
1902
1911
|
};
|
|
@@ -1904,7 +1913,7 @@ const Hr = (t, e) => (console.log("send to ", t, e), t ? (t.postMessage(M0(e), "
|
|
|
1904
1913
|
};
|
|
1905
1914
|
function Ni() {
|
|
1906
1915
|
return {
|
|
1907
|
-
send:
|
|
1916
|
+
send: Ir,
|
|
1908
1917
|
receive: Cx,
|
|
1909
1918
|
sendToIframe: Ax,
|
|
1910
1919
|
sendToIframeByName: bx,
|
|
@@ -1922,37 +1931,37 @@ var Yt = {}, Dx = {
|
|
|
1922
1931
|
(function(t, e) {
|
|
1923
1932
|
(function() {
|
|
1924
1933
|
var r, n = 244837814094590, s = (n & 16777215) == 15715070;
|
|
1925
|
-
function i(u,
|
|
1926
|
-
u != null && (typeof u == "number" ? this.fromNumber(u,
|
|
1934
|
+
function i(u, p, m) {
|
|
1935
|
+
u != null && (typeof u == "number" ? this.fromNumber(u, p, m) : p == null && typeof u != "string" ? this.fromString(u, 256) : this.fromString(u, p));
|
|
1927
1936
|
}
|
|
1928
1937
|
function o() {
|
|
1929
1938
|
return new i(null);
|
|
1930
1939
|
}
|
|
1931
|
-
function a(u,
|
|
1940
|
+
function a(u, p, m, D, I, $) {
|
|
1932
1941
|
for (; --$ >= 0; ) {
|
|
1933
|
-
var W =
|
|
1934
|
-
|
|
1942
|
+
var W = p * this[u++] + m[D] + I;
|
|
1943
|
+
I = Math.floor(W / 67108864), m[D++] = W & 67108863;
|
|
1935
1944
|
}
|
|
1936
|
-
return
|
|
1945
|
+
return I;
|
|
1937
1946
|
}
|
|
1938
|
-
function B(u,
|
|
1939
|
-
for (var W =
|
|
1947
|
+
function B(u, p, m, D, I, $) {
|
|
1948
|
+
for (var W = p & 32767, G = p >> 15; --$ >= 0; ) {
|
|
1940
1949
|
var v0 = this[u] & 32767, C0 = this[u++] >> 15, j0 = G * v0 + C0 * W;
|
|
1941
|
-
v0 = W * v0 + ((j0 & 32767) << 15) + m[D] + (
|
|
1950
|
+
v0 = W * v0 + ((j0 & 32767) << 15) + m[D] + (I & 1073741823), I = (v0 >>> 30) + (j0 >>> 15) + G * C0 + (I >>> 30), m[D++] = v0 & 1073741823;
|
|
1942
1951
|
}
|
|
1943
|
-
return
|
|
1952
|
+
return I;
|
|
1944
1953
|
}
|
|
1945
|
-
function c(u,
|
|
1946
|
-
for (var W =
|
|
1954
|
+
function c(u, p, m, D, I, $) {
|
|
1955
|
+
for (var W = p & 16383, G = p >> 14; --$ >= 0; ) {
|
|
1947
1956
|
var v0 = this[u] & 16383, C0 = this[u++] >> 14, j0 = G * v0 + C0 * W;
|
|
1948
|
-
v0 = W * v0 + ((j0 & 16383) << 14) + m[D] +
|
|
1957
|
+
v0 = W * v0 + ((j0 & 16383) << 14) + m[D] + I, I = (v0 >> 28) + (j0 >> 14) + G * C0, m[D++] = v0 & 268435455;
|
|
1949
1958
|
}
|
|
1950
|
-
return
|
|
1959
|
+
return I;
|
|
1951
1960
|
}
|
|
1952
1961
|
var x = typeof navigator < "u";
|
|
1953
1962
|
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;
|
|
1954
|
-
var
|
|
1955
|
-
i.prototype.FV = Math.pow(2,
|
|
1963
|
+
var d = 52;
|
|
1964
|
+
i.prototype.FV = Math.pow(2, d), i.prototype.F1 = d - r, i.prototype.F2 = 2 * r - d;
|
|
1956
1965
|
var h = "0123456789abcdefghijklmnopqrstuvwxyz", v = new Array(), f, l;
|
|
1957
1966
|
for (f = "0".charCodeAt(0), l = 0; l <= 9; ++l)
|
|
1958
1967
|
v[f++] = l;
|
|
@@ -1963,76 +1972,76 @@ var Yt = {}, Dx = {
|
|
|
1963
1972
|
function y(u) {
|
|
1964
1973
|
return h.charAt(u);
|
|
1965
1974
|
}
|
|
1966
|
-
function A(u,
|
|
1967
|
-
var m = v[u.charCodeAt(
|
|
1975
|
+
function A(u, p) {
|
|
1976
|
+
var m = v[u.charCodeAt(p)];
|
|
1968
1977
|
return m ?? -1;
|
|
1969
1978
|
}
|
|
1970
1979
|
function g(u) {
|
|
1971
|
-
for (var
|
|
1972
|
-
u[
|
|
1980
|
+
for (var p = this.t - 1; p >= 0; --p)
|
|
1981
|
+
u[p] = this[p];
|
|
1973
1982
|
u.t = this.t, u.s = this.s;
|
|
1974
1983
|
}
|
|
1975
1984
|
function E(u) {
|
|
1976
1985
|
this.t = 1, this.s = u < 0 ? -1 : 0, u > 0 ? this[0] = u : u < -1 ? this[0] = u + this.DV : this.t = 0;
|
|
1977
1986
|
}
|
|
1978
1987
|
function b(u) {
|
|
1979
|
-
var
|
|
1980
|
-
return
|
|
1988
|
+
var p = o();
|
|
1989
|
+
return p.fromInt(u), p;
|
|
1981
1990
|
}
|
|
1982
|
-
function F(u,
|
|
1991
|
+
function F(u, p) {
|
|
1983
1992
|
var m;
|
|
1984
|
-
if (
|
|
1993
|
+
if (p == 16)
|
|
1985
1994
|
m = 4;
|
|
1986
|
-
else if (
|
|
1995
|
+
else if (p == 8)
|
|
1987
1996
|
m = 3;
|
|
1988
|
-
else if (
|
|
1997
|
+
else if (p == 256)
|
|
1989
1998
|
m = 8;
|
|
1990
|
-
else if (
|
|
1999
|
+
else if (p == 2)
|
|
1991
2000
|
m = 1;
|
|
1992
|
-
else if (
|
|
2001
|
+
else if (p == 32)
|
|
1993
2002
|
m = 5;
|
|
1994
|
-
else if (
|
|
2003
|
+
else if (p == 4)
|
|
1995
2004
|
m = 2;
|
|
1996
2005
|
else {
|
|
1997
|
-
this.fromRadix(u,
|
|
2006
|
+
this.fromRadix(u, p);
|
|
1998
2007
|
return;
|
|
1999
2008
|
}
|
|
2000
2009
|
this.t = 0, this.s = 0;
|
|
2001
|
-
for (var D = u.length,
|
|
2010
|
+
for (var D = u.length, I = !1, $ = 0; --D >= 0; ) {
|
|
2002
2011
|
var W = m == 8 ? u[D] & 255 : A(u, D);
|
|
2003
2012
|
if (W < 0) {
|
|
2004
|
-
u.charAt(D) == "-" && (
|
|
2013
|
+
u.charAt(D) == "-" && (I = !0);
|
|
2005
2014
|
continue;
|
|
2006
2015
|
}
|
|
2007
|
-
|
|
2016
|
+
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);
|
|
2008
2017
|
}
|
|
2009
|
-
m == 8 && u[0] & 128 && (this.s = -1, $ > 0 && (this[this.t - 1] |= (1 << this.DB - $) - 1 << $)), this.clamp(),
|
|
2018
|
+
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);
|
|
2010
2019
|
}
|
|
2011
|
-
function
|
|
2020
|
+
function _() {
|
|
2012
2021
|
for (var u = this.s & this.DM; this.t > 0 && this[this.t - 1] == u; )
|
|
2013
2022
|
--this.t;
|
|
2014
2023
|
}
|
|
2015
2024
|
function S(u) {
|
|
2016
2025
|
if (this.s < 0)
|
|
2017
2026
|
return "-" + this.negate().toString(u);
|
|
2018
|
-
var
|
|
2027
|
+
var p;
|
|
2019
2028
|
if (u == 16)
|
|
2020
|
-
|
|
2029
|
+
p = 4;
|
|
2021
2030
|
else if (u == 8)
|
|
2022
|
-
|
|
2031
|
+
p = 3;
|
|
2023
2032
|
else if (u == 2)
|
|
2024
|
-
|
|
2033
|
+
p = 1;
|
|
2025
2034
|
else if (u == 32)
|
|
2026
|
-
|
|
2035
|
+
p = 5;
|
|
2027
2036
|
else if (u == 4)
|
|
2028
|
-
|
|
2037
|
+
p = 2;
|
|
2029
2038
|
else
|
|
2030
2039
|
return this.toRadix(u);
|
|
2031
|
-
var m = (1 <<
|
|
2040
|
+
var m = (1 << p) - 1, D, I = !1, $ = "", W = this.t, G = this.DB - W * this.DB % p;
|
|
2032
2041
|
if (W-- > 0)
|
|
2033
|
-
for (G < this.DB && (D = this[W] >> G) > 0 && (
|
|
2034
|
-
G <
|
|
2035
|
-
return
|
|
2042
|
+
for (G < this.DB && (D = this[W] >> G) > 0 && (I = !0, $ = y(D)); W >= 0; )
|
|
2043
|
+
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));
|
|
2044
|
+
return I ? $ : "0";
|
|
2036
2045
|
}
|
|
2037
2046
|
function R() {
|
|
2038
2047
|
var u = o();
|
|
@@ -2042,103 +2051,103 @@ var Yt = {}, Dx = {
|
|
|
2042
2051
|
return this.s < 0 ? this.negate() : this;
|
|
2043
2052
|
}
|
|
2044
2053
|
function w(u) {
|
|
2045
|
-
var
|
|
2046
|
-
if (
|
|
2047
|
-
return
|
|
2054
|
+
var p = this.s - u.s;
|
|
2055
|
+
if (p != 0)
|
|
2056
|
+
return p;
|
|
2048
2057
|
var m = this.t;
|
|
2049
|
-
if (
|
|
2050
|
-
return this.s < 0 ? -
|
|
2058
|
+
if (p = m - u.t, p != 0)
|
|
2059
|
+
return this.s < 0 ? -p : p;
|
|
2051
2060
|
for (; --m >= 0; )
|
|
2052
|
-
if ((
|
|
2053
|
-
return
|
|
2061
|
+
if ((p = this[m] - u[m]) != 0)
|
|
2062
|
+
return p;
|
|
2054
2063
|
return 0;
|
|
2055
2064
|
}
|
|
2056
|
-
function
|
|
2057
|
-
var
|
|
2058
|
-
return (m = u >>> 16) != 0 && (u = m,
|
|
2065
|
+
function C(u) {
|
|
2066
|
+
var p = 1, m;
|
|
2067
|
+
return (m = u >>> 16) != 0 && (u = m, p += 16), (m = u >> 8) != 0 && (u = m, p += 8), (m = u >> 4) != 0 && (u = m, p += 4), (m = u >> 2) != 0 && (u = m, p += 2), (m = u >> 1) != 0 && (u = m, p += 1), p;
|
|
2059
2068
|
}
|
|
2060
2069
|
function N() {
|
|
2061
|
-
return this.t <= 0 ? 0 : this.DB * (this.t - 1) +
|
|
2070
|
+
return this.t <= 0 ? 0 : this.DB * (this.t - 1) + C(this[this.t - 1] ^ this.s & this.DM);
|
|
2062
2071
|
}
|
|
2063
|
-
function L(u,
|
|
2072
|
+
function L(u, p) {
|
|
2064
2073
|
var m;
|
|
2065
2074
|
for (m = this.t - 1; m >= 0; --m)
|
|
2066
|
-
|
|
2075
|
+
p[m + u] = this[m];
|
|
2067
2076
|
for (m = u - 1; m >= 0; --m)
|
|
2068
|
-
|
|
2069
|
-
|
|
2077
|
+
p[m] = 0;
|
|
2078
|
+
p.t = this.t + u, p.s = this.s;
|
|
2070
2079
|
}
|
|
2071
|
-
function Q(u,
|
|
2080
|
+
function Q(u, p) {
|
|
2072
2081
|
for (var m = u; m < this.t; ++m)
|
|
2073
|
-
|
|
2074
|
-
|
|
2082
|
+
p[m - u] = this[m];
|
|
2083
|
+
p.t = Math.max(this.t - u, 0), p.s = this.s;
|
|
2075
2084
|
}
|
|
2076
|
-
function J(u,
|
|
2077
|
-
var m = u % this.DB, D = this.DB - m,
|
|
2085
|
+
function J(u, p) {
|
|
2086
|
+
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;
|
|
2078
2087
|
for (G = this.t - 1; G >= 0; --G)
|
|
2079
|
-
|
|
2088
|
+
p[G + $ + 1] = this[G] >> D | W, W = (this[G] & I) << m;
|
|
2080
2089
|
for (G = $ - 1; G >= 0; --G)
|
|
2081
|
-
|
|
2082
|
-
|
|
2090
|
+
p[G] = 0;
|
|
2091
|
+
p[$] = W, p.t = this.t + $ + 1, p.s = this.s, p.clamp();
|
|
2083
2092
|
}
|
|
2084
|
-
function r0(u,
|
|
2085
|
-
|
|
2093
|
+
function r0(u, p) {
|
|
2094
|
+
p.s = this.s;
|
|
2086
2095
|
var m = Math.floor(u / this.DB);
|
|
2087
2096
|
if (m >= this.t) {
|
|
2088
|
-
|
|
2097
|
+
p.t = 0;
|
|
2089
2098
|
return;
|
|
2090
2099
|
}
|
|
2091
|
-
var D = u % this.DB,
|
|
2092
|
-
|
|
2100
|
+
var D = u % this.DB, I = this.DB - D, $ = (1 << D) - 1;
|
|
2101
|
+
p[0] = this[m] >> D;
|
|
2093
2102
|
for (var W = m + 1; W < this.t; ++W)
|
|
2094
|
-
|
|
2095
|
-
D > 0 && (
|
|
2103
|
+
p[W - m - 1] |= (this[W] & $) << I, p[W - m] = this[W] >> D;
|
|
2104
|
+
D > 0 && (p[this.t - m - 1] |= (this.s & $) << I), p.t = this.t - m, p.clamp();
|
|
2096
2105
|
}
|
|
2097
|
-
function l0(u,
|
|
2098
|
-
for (var m = 0, D = 0,
|
|
2099
|
-
D += this[m] - u[m],
|
|
2106
|
+
function l0(u, p) {
|
|
2107
|
+
for (var m = 0, D = 0, I = Math.min(u.t, this.t); m < I; )
|
|
2108
|
+
D += this[m] - u[m], p[m++] = D & this.DM, D >>= this.DB;
|
|
2100
2109
|
if (u.t < this.t) {
|
|
2101
2110
|
for (D -= u.s; m < this.t; )
|
|
2102
|
-
D += this[m],
|
|
2111
|
+
D += this[m], p[m++] = D & this.DM, D >>= this.DB;
|
|
2103
2112
|
D += this.s;
|
|
2104
2113
|
} else {
|
|
2105
2114
|
for (D += this.s; m < u.t; )
|
|
2106
|
-
D -= u[m],
|
|
2115
|
+
D -= u[m], p[m++] = D & this.DM, D >>= this.DB;
|
|
2107
2116
|
D -= u.s;
|
|
2108
2117
|
}
|
|
2109
|
-
|
|
2118
|
+
p.s = D < 0 ? -1 : 0, D < -1 ? p[m++] = this.DV + D : D > 0 && (p[m++] = D), p.t = m, p.clamp();
|
|
2110
2119
|
}
|
|
2111
|
-
function Y(u,
|
|
2112
|
-
var m = this.abs(), D = u.abs(),
|
|
2113
|
-
for (
|
|
2114
|
-
|
|
2115
|
-
for (
|
|
2116
|
-
|
|
2117
|
-
|
|
2120
|
+
function Y(u, p) {
|
|
2121
|
+
var m = this.abs(), D = u.abs(), I = m.t;
|
|
2122
|
+
for (p.t = I + D.t; --I >= 0; )
|
|
2123
|
+
p[I] = 0;
|
|
2124
|
+
for (I = 0; I < D.t; ++I)
|
|
2125
|
+
p[I + m.t] = m.am(0, D[I], p, I, 0, m.t);
|
|
2126
|
+
p.s = 0, p.clamp(), this.s != u.s && i.ZERO.subTo(p, p);
|
|
2118
2127
|
}
|
|
2119
2128
|
function h0(u) {
|
|
2120
|
-
for (var
|
|
2129
|
+
for (var p = this.abs(), m = u.t = 2 * p.t; --m >= 0; )
|
|
2121
2130
|
u[m] = 0;
|
|
2122
|
-
for (m = 0; m <
|
|
2123
|
-
var D =
|
|
2124
|
-
(u[m +
|
|
2131
|
+
for (m = 0; m < p.t - 1; ++m) {
|
|
2132
|
+
var D = p.am(m, p[m], u, 2 * m, 0, 1);
|
|
2133
|
+
(u[m + p.t] += p.am(m + 1, 2 * p[m], u, 2 * m + 1, D, p.t - m - 1)) >= p.DV && (u[m + p.t] -= p.DV, u[m + p.t + 1] = 1);
|
|
2125
2134
|
}
|
|
2126
|
-
u.t > 0 && (u[u.t - 1] +=
|
|
2135
|
+
u.t > 0 && (u[u.t - 1] += p.am(m, p[m], u, 2 * m, 0, 1)), u.s = 0, u.clamp();
|
|
2127
2136
|
}
|
|
2128
|
-
function a0(u,
|
|
2137
|
+
function a0(u, p, m) {
|
|
2129
2138
|
var D = u.abs();
|
|
2130
2139
|
if (!(D.t <= 0)) {
|
|
2131
|
-
var
|
|
2132
|
-
if (
|
|
2133
|
-
|
|
2140
|
+
var I = this.abs();
|
|
2141
|
+
if (I.t < D.t) {
|
|
2142
|
+
p != null && p.fromInt(0), m != null && this.copyTo(m);
|
|
2134
2143
|
return;
|
|
2135
2144
|
}
|
|
2136
2145
|
m == null && (m = o());
|
|
2137
|
-
var $ = o(), W = this.s, G = u.s, v0 = this.DB -
|
|
2138
|
-
v0 > 0 ? (D.lShiftTo(v0, $),
|
|
2146
|
+
var $ = o(), W = this.s, G = u.s, v0 = this.DB - C(D[D.t - 1]);
|
|
2147
|
+
v0 > 0 ? (D.lShiftTo(v0, $), I.lShiftTo(v0, m)) : (D.copyTo($), I.copyTo(m));
|
|
2139
2148
|
var C0 = $.t, j0 = $[C0 - 1];
|
|
2140
2149
|
if (j0 != 0) {
|
|
2141
|
-
var L0 = j0 * (1 << this.F1) + (C0 > 1 ? $[C0 - 2] >> this.F2 : 0), gt = this.FV / L0, we = (1 << this.F1) / L0, Y0 = 1 << this.F2, J0 = m.t, _e = J0 - C0, Ft =
|
|
2150
|
+
var L0 = j0 * (1 << this.F1) + (C0 > 1 ? $[C0 - 2] >> this.F2 : 0), gt = this.FV / L0, we = (1 << this.F1) / L0, Y0 = 1 << this.F2, J0 = m.t, _e = J0 - C0, Ft = p ?? o();
|
|
2142
2151
|
for ($.dlShiftTo(_e, Ft), m.compareTo(Ft) >= 0 && (m[m.t++] = 1, m.subTo(Ft, m)), i.ONE.dlShiftTo(C0, Ft), Ft.subTo($, $); $.t < C0; )
|
|
2143
2152
|
$[$.t++] = 0;
|
|
2144
2153
|
for (; --_e >= 0; ) {
|
|
@@ -2147,13 +2156,13 @@ var Yt = {}, Dx = {
|
|
|
2147
2156
|
for ($.dlShiftTo(_e, Ft), m.subTo(Ft, m); m[J0] < --Jr; )
|
|
2148
2157
|
m.subTo(Ft, m);
|
|
2149
2158
|
}
|
|
2150
|
-
|
|
2159
|
+
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);
|
|
2151
2160
|
}
|
|
2152
2161
|
}
|
|
2153
2162
|
}
|
|
2154
2163
|
function O(u) {
|
|
2155
|
-
var
|
|
2156
|
-
return this.abs().divRemTo(u, null,
|
|
2164
|
+
var p = o();
|
|
2165
|
+
return this.abs().divRemTo(u, null, p), this.s < 0 && p.compareTo(i.ZERO) > 0 && u.subTo(p, p), p;
|
|
2157
2166
|
}
|
|
2158
2167
|
function z(u) {
|
|
2159
2168
|
this.m = u;
|
|
@@ -2167,11 +2176,11 @@ var Yt = {}, Dx = {
|
|
|
2167
2176
|
function p0(u) {
|
|
2168
2177
|
u.divRemTo(this.m, null, u);
|
|
2169
2178
|
}
|
|
2170
|
-
function d0(u,
|
|
2171
|
-
u.multiplyTo(
|
|
2179
|
+
function d0(u, p, m) {
|
|
2180
|
+
u.multiplyTo(p, m), this.reduce(m);
|
|
2172
2181
|
}
|
|
2173
|
-
function A0(u,
|
|
2174
|
-
u.squareTo(
|
|
2182
|
+
function A0(u, p) {
|
|
2183
|
+
u.squareTo(p), this.reduce(p);
|
|
2175
2184
|
}
|
|
2176
2185
|
z.prototype.convert = M, z.prototype.revert = U, z.prototype.reduce = p0, z.prototype.mulTo = d0, z.prototype.sqrTo = A0;
|
|
2177
2186
|
function e0() {
|
|
@@ -2180,58 +2189,58 @@ var Yt = {}, Dx = {
|
|
|
2180
2189
|
var u = this[0];
|
|
2181
2190
|
if (!(u & 1))
|
|
2182
2191
|
return 0;
|
|
2183
|
-
var
|
|
2184
|
-
return
|
|
2192
|
+
var p = u & 3;
|
|
2193
|
+
return p = p * (2 - (u & 15) * p) & 15, p = p * (2 - (u & 255) * p) & 255, p = p * (2 - ((u & 65535) * p & 65535)) & 65535, p = p * (2 - u * p % this.DV) % this.DV, p > 0 ? this.DV - p : -p;
|
|
2185
2194
|
}
|
|
2186
2195
|
function T0(u) {
|
|
2187
2196
|
this.m = u, this.mp = u.invDigit(), this.mpl = this.mp & 32767, this.mph = this.mp >> 15, this.um = (1 << u.DB - 15) - 1, this.mt2 = 2 * u.t;
|
|
2188
2197
|
}
|
|
2189
2198
|
function st(u) {
|
|
2190
|
-
var
|
|
2191
|
-
return u.abs().dlShiftTo(this.m.t,
|
|
2199
|
+
var p = o();
|
|
2200
|
+
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;
|
|
2192
2201
|
}
|
|
2193
|
-
function
|
|
2194
|
-
var
|
|
2195
|
-
return u.copyTo(
|
|
2202
|
+
function It(u) {
|
|
2203
|
+
var p = o();
|
|
2204
|
+
return u.copyTo(p), this.reduce(p), p;
|
|
2196
2205
|
}
|
|
2197
2206
|
function pt(u) {
|
|
2198
2207
|
for (; u.t <= this.mt2; )
|
|
2199
2208
|
u[u.t++] = 0;
|
|
2200
|
-
for (var
|
|
2201
|
-
var m = u[
|
|
2202
|
-
for (m =
|
|
2209
|
+
for (var p = 0; p < this.m.t; ++p) {
|
|
2210
|
+
var m = u[p] & 32767, D = m * this.mpl + ((m * this.mph + (u[p] >> 15) * this.mpl & this.um) << 15) & u.DM;
|
|
2211
|
+
for (m = p + this.m.t, u[m] += this.m.am(0, D, u, p, 0, this.m.t); u[m] >= u.DV; )
|
|
2203
2212
|
u[m] -= u.DV, u[++m]++;
|
|
2204
2213
|
}
|
|
2205
2214
|
u.clamp(), u.drShiftTo(this.m.t, u), u.compareTo(this.m) >= 0 && u.subTo(this.m, u);
|
|
2206
2215
|
}
|
|
2207
|
-
function O0(u,
|
|
2208
|
-
u.squareTo(
|
|
2216
|
+
function O0(u, p) {
|
|
2217
|
+
u.squareTo(p), this.reduce(p);
|
|
2209
2218
|
}
|
|
2210
|
-
function w0(u,
|
|
2211
|
-
u.multiplyTo(
|
|
2219
|
+
function w0(u, p, m) {
|
|
2220
|
+
u.multiplyTo(p, m), this.reduce(m);
|
|
2212
2221
|
}
|
|
2213
|
-
T0.prototype.convert = st, T0.prototype.revert =
|
|
2222
|
+
T0.prototype.convert = st, T0.prototype.revert = It, T0.prototype.reduce = pt, T0.prototype.mulTo = w0, T0.prototype.sqrTo = O0;
|
|
2214
2223
|
function bt() {
|
|
2215
2224
|
return (this.t > 0 ? this[0] & 1 : this.s) == 0;
|
|
2216
2225
|
}
|
|
2217
|
-
function it(u,
|
|
2226
|
+
function it(u, p) {
|
|
2218
2227
|
if (u > 4294967295 || u < 1)
|
|
2219
2228
|
return i.ONE;
|
|
2220
|
-
var m = o(), D = o(),
|
|
2221
|
-
for (
|
|
2222
|
-
if (
|
|
2223
|
-
|
|
2229
|
+
var m = o(), D = o(), I = p.convert(this), $ = C(u) - 1;
|
|
2230
|
+
for (I.copyTo(m); --$ >= 0; )
|
|
2231
|
+
if (p.sqrTo(m, D), (u & 1 << $) > 0)
|
|
2232
|
+
p.mulTo(D, I, m);
|
|
2224
2233
|
else {
|
|
2225
2234
|
var W = m;
|
|
2226
2235
|
m = D, D = W;
|
|
2227
2236
|
}
|
|
2228
|
-
return
|
|
2237
|
+
return p.revert(m);
|
|
2229
2238
|
}
|
|
2230
|
-
function vt(u,
|
|
2239
|
+
function vt(u, p) {
|
|
2231
2240
|
var m;
|
|
2232
|
-
return u < 256 ||
|
|
2241
|
+
return u < 256 || p.isEven() ? m = new z(p) : m = new T0(p), this.exp(u, m);
|
|
2233
2242
|
}
|
|
2234
|
-
i.prototype.copyTo = g, i.prototype.fromInt = E, i.prototype.fromString = F, i.prototype.clamp =
|
|
2243
|
+
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);
|
|
2235
2244
|
function ot() {
|
|
2236
2245
|
var u = o();
|
|
2237
2246
|
return this.copyTo(u), u;
|
|
@@ -2256,7 +2265,7 @@ var Yt = {}, Dx = {
|
|
|
2256
2265
|
function T() {
|
|
2257
2266
|
return this.t == 0 ? this.s : this[0] << 16 >> 16;
|
|
2258
2267
|
}
|
|
2259
|
-
function
|
|
2268
|
+
function H(u) {
|
|
2260
2269
|
return Math.floor(Math.LN2 * this.DB / Math.log(u));
|
|
2261
2270
|
}
|
|
2262
2271
|
function k() {
|
|
@@ -2265,43 +2274,43 @@ var Yt = {}, Dx = {
|
|
|
2265
2274
|
function K(u) {
|
|
2266
2275
|
if (u == null && (u = 10), this.signum() == 0 || u < 2 || u > 36)
|
|
2267
2276
|
return "0";
|
|
2268
|
-
var
|
|
2269
|
-
for (this.divRemTo(D,
|
|
2270
|
-
W = (m + $.intValue()).toString(u).substr(1) + W,
|
|
2277
|
+
var p = this.chunkSize(u), m = Math.pow(u, p), D = b(m), I = o(), $ = o(), W = "";
|
|
2278
|
+
for (this.divRemTo(D, I, $); I.signum() > 0; )
|
|
2279
|
+
W = (m + $.intValue()).toString(u).substr(1) + W, I.divRemTo(D, I, $);
|
|
2271
2280
|
return $.intValue().toString(u) + W;
|
|
2272
2281
|
}
|
|
2273
|
-
function V(u,
|
|
2274
|
-
this.fromInt(0),
|
|
2275
|
-
for (var m = this.chunkSize(
|
|
2282
|
+
function V(u, p) {
|
|
2283
|
+
this.fromInt(0), p == null && (p = 10);
|
|
2284
|
+
for (var m = this.chunkSize(p), D = Math.pow(p, m), I = !1, $ = 0, W = 0, G = 0; G < u.length; ++G) {
|
|
2276
2285
|
var v0 = A(u, G);
|
|
2277
2286
|
if (v0 < 0) {
|
|
2278
|
-
u.charAt(G) == "-" && this.signum() == 0 && (
|
|
2287
|
+
u.charAt(G) == "-" && this.signum() == 0 && (I = !0);
|
|
2279
2288
|
continue;
|
|
2280
2289
|
}
|
|
2281
|
-
W =
|
|
2290
|
+
W = p * W + v0, ++$ >= m && (this.dMultiply(D), this.dAddOffset(W, 0), $ = 0, W = 0);
|
|
2282
2291
|
}
|
|
2283
|
-
$ > 0 && (this.dMultiply(Math.pow(
|
|
2292
|
+
$ > 0 && (this.dMultiply(Math.pow(p, $)), this.dAddOffset(W, 0)), I && i.ZERO.subTo(this, this);
|
|
2284
2293
|
}
|
|
2285
|
-
function t0(u,
|
|
2286
|
-
if (typeof
|
|
2294
|
+
function t0(u, p, m) {
|
|
2295
|
+
if (typeof p == "number")
|
|
2287
2296
|
if (u < 2)
|
|
2288
2297
|
this.fromInt(1);
|
|
2289
2298
|
else
|
|
2290
|
-
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(
|
|
2299
|
+
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); )
|
|
2291
2300
|
this.dAddOffset(2, 0), this.bitLength() > u && this.subTo(i.ONE.shiftLeft(u - 1), this);
|
|
2292
2301
|
else {
|
|
2293
|
-
var D = new Array(),
|
|
2294
|
-
D.length = (u >> 3) + 1,
|
|
2302
|
+
var D = new Array(), I = u & 7;
|
|
2303
|
+
D.length = (u >> 3) + 1, p.nextBytes(D), I > 0 ? D[0] &= (1 << I) - 1 : D[0] = 0, this.fromString(D, 256);
|
|
2295
2304
|
}
|
|
2296
2305
|
}
|
|
2297
2306
|
function x0() {
|
|
2298
|
-
var u = this.t,
|
|
2299
|
-
|
|
2300
|
-
var m = this.DB - u * this.DB % 8, D,
|
|
2307
|
+
var u = this.t, p = new Array();
|
|
2308
|
+
p[0] = this.s;
|
|
2309
|
+
var m = this.DB - u * this.DB % 8, D, I = 0;
|
|
2301
2310
|
if (u-- > 0)
|
|
2302
|
-
for (m < this.DB && (D = this[u] >> m) != (this.s & this.DM) >> m && (
|
|
2303
|
-
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),
|
|
2304
|
-
return
|
|
2311
|
+
for (m < this.DB && (D = this[u] >> m) != (this.s & this.DM) >> m && (p[I++] = D | this.s << this.DB - m); u >= 0; )
|
|
2312
|
+
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);
|
|
2313
|
+
return p;
|
|
2305
2314
|
}
|
|
2306
2315
|
function f0(u) {
|
|
2307
2316
|
return this.compareTo(u) == 0;
|
|
@@ -2312,67 +2321,67 @@ var Yt = {}, Dx = {
|
|
|
2312
2321
|
function E0(u) {
|
|
2313
2322
|
return this.compareTo(u) > 0 ? this : u;
|
|
2314
2323
|
}
|
|
2315
|
-
function g0(u,
|
|
2316
|
-
var D,
|
|
2324
|
+
function g0(u, p, m) {
|
|
2325
|
+
var D, I, $ = Math.min(u.t, this.t);
|
|
2317
2326
|
for (D = 0; D < $; ++D)
|
|
2318
|
-
m[D] =
|
|
2327
|
+
m[D] = p(this[D], u[D]);
|
|
2319
2328
|
if (u.t < this.t) {
|
|
2320
|
-
for (
|
|
2321
|
-
m[D] =
|
|
2329
|
+
for (I = u.s & this.DM, D = $; D < this.t; ++D)
|
|
2330
|
+
m[D] = p(this[D], I);
|
|
2322
2331
|
m.t = this.t;
|
|
2323
2332
|
} else {
|
|
2324
|
-
for (
|
|
2325
|
-
m[D] =
|
|
2333
|
+
for (I = this.s & this.DM, D = $; D < u.t; ++D)
|
|
2334
|
+
m[D] = p(I, u[D]);
|
|
2326
2335
|
m.t = u.t;
|
|
2327
2336
|
}
|
|
2328
|
-
m.s =
|
|
2337
|
+
m.s = p(this.s, u.s), m.clamp();
|
|
2329
2338
|
}
|
|
2330
|
-
function q0(u,
|
|
2331
|
-
return u &
|
|
2339
|
+
function q0(u, p) {
|
|
2340
|
+
return u & p;
|
|
2332
2341
|
}
|
|
2333
2342
|
function Bt(u) {
|
|
2334
|
-
var
|
|
2335
|
-
return this.bitwiseTo(u, q0,
|
|
2343
|
+
var p = o();
|
|
2344
|
+
return this.bitwiseTo(u, q0, p), p;
|
|
2336
2345
|
}
|
|
2337
|
-
function at(u,
|
|
2338
|
-
return u |
|
|
2346
|
+
function at(u, p) {
|
|
2347
|
+
return u | p;
|
|
2339
2348
|
}
|
|
2340
2349
|
function Wt(u) {
|
|
2341
|
-
var
|
|
2342
|
-
return this.bitwiseTo(u, at,
|
|
2350
|
+
var p = o();
|
|
2351
|
+
return this.bitwiseTo(u, at, p), p;
|
|
2343
2352
|
}
|
|
2344
|
-
function ye(u,
|
|
2345
|
-
return u ^
|
|
2353
|
+
function ye(u, p) {
|
|
2354
|
+
return u ^ p;
|
|
2346
2355
|
}
|
|
2347
2356
|
function Ur(u) {
|
|
2348
|
-
var
|
|
2349
|
-
return this.bitwiseTo(u, ye,
|
|
2357
|
+
var p = o();
|
|
2358
|
+
return this.bitwiseTo(u, ye, p), p;
|
|
2350
2359
|
}
|
|
2351
|
-
function ne(u,
|
|
2352
|
-
return u & ~
|
|
2360
|
+
function ne(u, p) {
|
|
2361
|
+
return u & ~p;
|
|
2353
2362
|
}
|
|
2354
2363
|
function $r(u) {
|
|
2355
|
-
var
|
|
2356
|
-
return this.bitwiseTo(u, ne,
|
|
2364
|
+
var p = o();
|
|
2365
|
+
return this.bitwiseTo(u, ne, p), p;
|
|
2357
2366
|
}
|
|
2358
2367
|
function Ee() {
|
|
2359
|
-
for (var u = o(),
|
|
2360
|
-
u[
|
|
2368
|
+
for (var u = o(), p = 0; p < this.t; ++p)
|
|
2369
|
+
u[p] = this.DM & ~this[p];
|
|
2361
2370
|
return u.t = this.t, u.s = ~this.s, u;
|
|
2362
2371
|
}
|
|
2363
2372
|
function Mr(u) {
|
|
2364
|
-
var
|
|
2365
|
-
return u < 0 ? this.rShiftTo(-u,
|
|
2373
|
+
var p = o();
|
|
2374
|
+
return u < 0 ? this.rShiftTo(-u, p) : this.lShiftTo(u, p), p;
|
|
2366
2375
|
}
|
|
2367
2376
|
function me(u) {
|
|
2368
|
-
var
|
|
2369
|
-
return u < 0 ? this.lShiftTo(-u,
|
|
2377
|
+
var p = o();
|
|
2378
|
+
return u < 0 ? this.lShiftTo(-u, p) : this.rShiftTo(u, p), p;
|
|
2370
2379
|
}
|
|
2371
2380
|
function jr(u) {
|
|
2372
2381
|
if (u == 0)
|
|
2373
2382
|
return -1;
|
|
2374
|
-
var
|
|
2375
|
-
return u & 65535 || (u >>= 16,
|
|
2383
|
+
var p = 0;
|
|
2384
|
+
return u & 65535 || (u >>= 16, p += 16), u & 255 || (u >>= 8, p += 8), u & 15 || (u >>= 4, p += 4), u & 3 || (u >>= 2, p += 2), u & 1 || ++p, p;
|
|
2376
2385
|
}
|
|
2377
2386
|
function Wr() {
|
|
2378
2387
|
for (var u = 0; u < this.t; ++u)
|
|
@@ -2381,22 +2390,22 @@ var Yt = {}, Dx = {
|
|
|
2381
2390
|
return this.s < 0 ? this.t * this.DB : -1;
|
|
2382
2391
|
}
|
|
2383
2392
|
function Zr(u) {
|
|
2384
|
-
for (var
|
|
2385
|
-
u &= u - 1, ++
|
|
2386
|
-
return
|
|
2393
|
+
for (var p = 0; u != 0; )
|
|
2394
|
+
u &= u - 1, ++p;
|
|
2395
|
+
return p;
|
|
2387
2396
|
}
|
|
2388
2397
|
function be() {
|
|
2389
|
-
for (var u = 0,
|
|
2390
|
-
u += Zr(this[m] ^
|
|
2398
|
+
for (var u = 0, p = this.s & this.DM, m = 0; m < this.t; ++m)
|
|
2399
|
+
u += Zr(this[m] ^ p);
|
|
2391
2400
|
return u;
|
|
2392
2401
|
}
|
|
2393
2402
|
function Kr(u) {
|
|
2394
|
-
var
|
|
2395
|
-
return
|
|
2403
|
+
var p = Math.floor(u / this.DB);
|
|
2404
|
+
return p >= this.t ? this.s != 0 : (this[p] & 1 << u % this.DB) != 0;
|
|
2396
2405
|
}
|
|
2397
|
-
function Gr(u,
|
|
2406
|
+
function Gr(u, p) {
|
|
2398
2407
|
var m = i.ONE.shiftLeft(u);
|
|
2399
|
-
return this.bitwiseTo(m,
|
|
2408
|
+
return this.bitwiseTo(m, p, m), m;
|
|
2400
2409
|
}
|
|
2401
2410
|
function Ae(u) {
|
|
2402
2411
|
return this.changeBit(u, at);
|
|
@@ -2407,57 +2416,57 @@ var Yt = {}, Dx = {
|
|
|
2407
2416
|
function Fe(u) {
|
|
2408
2417
|
return this.changeBit(u, ye);
|
|
2409
2418
|
}
|
|
2410
|
-
function P0(u,
|
|
2411
|
-
for (var m = 0, D = 0,
|
|
2412
|
-
D += this[m] + u[m],
|
|
2419
|
+
function P0(u, p) {
|
|
2420
|
+
for (var m = 0, D = 0, I = Math.min(u.t, this.t); m < I; )
|
|
2421
|
+
D += this[m] + u[m], p[m++] = D & this.DM, D >>= this.DB;
|
|
2413
2422
|
if (u.t < this.t) {
|
|
2414
2423
|
for (D += u.s; m < this.t; )
|
|
2415
|
-
D += this[m],
|
|
2424
|
+
D += this[m], p[m++] = D & this.DM, D >>= this.DB;
|
|
2416
2425
|
D += this.s;
|
|
2417
2426
|
} else {
|
|
2418
2427
|
for (D += this.s; m < u.t; )
|
|
2419
|
-
D += u[m],
|
|
2428
|
+
D += u[m], p[m++] = D & this.DM, D >>= this.DB;
|
|
2420
2429
|
D += u.s;
|
|
2421
2430
|
}
|
|
2422
|
-
|
|
2431
|
+
p.s = D < 0 ? -1 : 0, D > 0 ? p[m++] = D : D < -1 && (p[m++] = this.DV + D), p.t = m, p.clamp();
|
|
2423
2432
|
}
|
|
2424
2433
|
function ct(u) {
|
|
2425
|
-
var
|
|
2426
|
-
return this.addTo(u,
|
|
2434
|
+
var p = o();
|
|
2435
|
+
return this.addTo(u, p), p;
|
|
2427
2436
|
}
|
|
2428
2437
|
function Ce(u) {
|
|
2429
|
-
var
|
|
2430
|
-
return this.subTo(u,
|
|
2438
|
+
var p = o();
|
|
2439
|
+
return this.subTo(u, p), p;
|
|
2431
2440
|
}
|
|
2432
2441
|
function Qr(u) {
|
|
2433
|
-
var
|
|
2434
|
-
return this.multiplyTo(u,
|
|
2442
|
+
var p = o();
|
|
2443
|
+
return this.multiplyTo(u, p), p;
|
|
2435
2444
|
}
|
|
2436
2445
|
function Do() {
|
|
2437
2446
|
var u = o();
|
|
2438
2447
|
return this.squareTo(u), u;
|
|
2439
2448
|
}
|
|
2440
2449
|
function wo(u) {
|
|
2441
|
-
var
|
|
2442
|
-
return this.divRemTo(u,
|
|
2450
|
+
var p = o();
|
|
2451
|
+
return this.divRemTo(u, p, null), p;
|
|
2443
2452
|
}
|
|
2444
2453
|
function _o(u) {
|
|
2445
|
-
var
|
|
2446
|
-
return this.divRemTo(u, null,
|
|
2454
|
+
var p = o();
|
|
2455
|
+
return this.divRemTo(u, null, p), p;
|
|
2447
2456
|
}
|
|
2448
2457
|
function So(u) {
|
|
2449
|
-
var
|
|
2450
|
-
return this.divRemTo(u,
|
|
2458
|
+
var p = o(), m = o();
|
|
2459
|
+
return this.divRemTo(u, p, m), new Array(p, m);
|
|
2451
2460
|
}
|
|
2452
2461
|
function To(u) {
|
|
2453
2462
|
this[this.t] = this.am(0, u - 1, this, 0, 0, this.t), ++this.t, this.clamp();
|
|
2454
2463
|
}
|
|
2455
|
-
function Ro(u,
|
|
2464
|
+
function Ro(u, p) {
|
|
2456
2465
|
if (u != 0) {
|
|
2457
|
-
for (; this.t <=
|
|
2466
|
+
for (; this.t <= p; )
|
|
2458
2467
|
this[this.t++] = 0;
|
|
2459
|
-
for (this[
|
|
2460
|
-
this[
|
|
2468
|
+
for (this[p] += u; this[p] >= this.DV; )
|
|
2469
|
+
this[p] -= this.DV, ++p >= this.t && (this[this.t++] = 0), ++this[p];
|
|
2461
2470
|
}
|
|
2462
2471
|
}
|
|
2463
2472
|
function se() {
|
|
@@ -2465,34 +2474,34 @@ var Yt = {}, Dx = {
|
|
|
2465
2474
|
function $n(u) {
|
|
2466
2475
|
return u;
|
|
2467
2476
|
}
|
|
2468
|
-
function ko(u,
|
|
2469
|
-
u.multiplyTo(
|
|
2477
|
+
function ko(u, p, m) {
|
|
2478
|
+
u.multiplyTo(p, m);
|
|
2470
2479
|
}
|
|
2471
|
-
function Oo(u,
|
|
2472
|
-
u.squareTo(
|
|
2480
|
+
function Oo(u, p) {
|
|
2481
|
+
u.squareTo(p);
|
|
2473
2482
|
}
|
|
2474
2483
|
se.prototype.convert = $n, se.prototype.revert = $n, se.prototype.mulTo = ko, se.prototype.sqrTo = Oo;
|
|
2475
2484
|
function Po(u) {
|
|
2476
2485
|
return this.exp(u, new se());
|
|
2477
2486
|
}
|
|
2478
|
-
function
|
|
2479
|
-
var D = Math.min(this.t + u.t,
|
|
2487
|
+
function Ho(u, p, m) {
|
|
2488
|
+
var D = Math.min(this.t + u.t, p);
|
|
2480
2489
|
for (m.s = 0, m.t = D; D > 0; )
|
|
2481
2490
|
m[--D] = 0;
|
|
2482
|
-
var
|
|
2483
|
-
for (
|
|
2491
|
+
var I;
|
|
2492
|
+
for (I = m.t - this.t; D < I; ++D)
|
|
2484
2493
|
m[D + this.t] = this.am(0, u[D], m, D, 0, this.t);
|
|
2485
|
-
for (
|
|
2486
|
-
this.am(0, u[D], m, D, 0,
|
|
2494
|
+
for (I = Math.min(u.t, p); D < I; ++D)
|
|
2495
|
+
this.am(0, u[D], m, D, 0, p - D);
|
|
2487
2496
|
m.clamp();
|
|
2488
2497
|
}
|
|
2489
|
-
function
|
|
2490
|
-
--
|
|
2491
|
-
var D = m.t = this.t + u.t -
|
|
2498
|
+
function Io(u, p, m) {
|
|
2499
|
+
--p;
|
|
2500
|
+
var D = m.t = this.t + u.t - p;
|
|
2492
2501
|
for (m.s = 0; --D >= 0; )
|
|
2493
2502
|
m[D] = 0;
|
|
2494
|
-
for (D = Math.max(
|
|
2495
|
-
m[this.t + D -
|
|
2503
|
+
for (D = Math.max(p - this.t, 0); D < u.t; ++D)
|
|
2504
|
+
m[this.t + D - p] = this.am(p - D, u[D], m, 0, 0, this.t + D - p);
|
|
2496
2505
|
m.clamp(), m.drShiftTo(1, m);
|
|
2497
2506
|
}
|
|
2498
2507
|
function qt(u) {
|
|
@@ -2503,8 +2512,8 @@ var Yt = {}, Dx = {
|
|
|
2503
2512
|
return u.mod(this.m);
|
|
2504
2513
|
if (u.compareTo(this.m) < 0)
|
|
2505
2514
|
return u;
|
|
2506
|
-
var
|
|
2507
|
-
return u.copyTo(
|
|
2515
|
+
var p = o();
|
|
2516
|
+
return u.copyTo(p), this.reduce(p), p;
|
|
2508
2517
|
}
|
|
2509
2518
|
function No(u) {
|
|
2510
2519
|
return u;
|
|
@@ -2515,18 +2524,18 @@ var Yt = {}, Dx = {
|
|
|
2515
2524
|
for (u.subTo(this.r2, u); u.compareTo(this.m) >= 0; )
|
|
2516
2525
|
u.subTo(this.m, u);
|
|
2517
2526
|
}
|
|
2518
|
-
function zo(u,
|
|
2519
|
-
u.squareTo(
|
|
2527
|
+
function zo(u, p) {
|
|
2528
|
+
u.squareTo(p), this.reduce(p);
|
|
2520
2529
|
}
|
|
2521
|
-
function Uo(u,
|
|
2522
|
-
u.multiplyTo(
|
|
2530
|
+
function Uo(u, p, m) {
|
|
2531
|
+
u.multiplyTo(p, m), this.reduce(m);
|
|
2523
2532
|
}
|
|
2524
2533
|
qt.prototype.convert = qo, qt.prototype.revert = No, qt.prototype.reduce = Lo, qt.prototype.mulTo = Uo, qt.prototype.sqrTo = zo;
|
|
2525
|
-
function $o(u,
|
|
2526
|
-
var m = u.bitLength(), D,
|
|
2534
|
+
function $o(u, p) {
|
|
2535
|
+
var m = u.bitLength(), D, I = b(1), $;
|
|
2527
2536
|
if (m <= 0)
|
|
2528
|
-
return
|
|
2529
|
-
m < 18 ? D = 1 : m < 48 ? D = 3 : m < 144 ? D = 4 : m < 768 ? D = 5 : D = 6, m < 8 ? $ = new z(
|
|
2537
|
+
return I;
|
|
2538
|
+
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 qt(p) : $ = new T0(p);
|
|
2530
2539
|
var W = new Array(), G = 3, v0 = D - 1, C0 = (1 << D) - 1;
|
|
2531
2540
|
if (W[1] = $.convert(this), D > 1) {
|
|
2532
2541
|
var j0 = o();
|
|
@@ -2534,56 +2543,56 @@ var Yt = {}, Dx = {
|
|
|
2534
2543
|
W[G] = o(), $.mulTo(j0, W[G - 2], W[G]), G += 2;
|
|
2535
2544
|
}
|
|
2536
2545
|
var L0 = u.t - 1, gt, we = !0, Y0 = o(), J0;
|
|
2537
|
-
for (m =
|
|
2546
|
+
for (m = C(u[L0]) - 1; L0 >= 0; ) {
|
|
2538
2547
|
for (m >= v0 ? gt = u[L0] >> m - v0 & C0 : (gt = (u[L0] & (1 << m + 1) - 1) << v0 - m, L0 > 0 && (gt |= u[L0 - 1] >> this.DB + m - v0)), G = D; !(gt & 1); )
|
|
2539
2548
|
gt >>= 1, --G;
|
|
2540
2549
|
if ((m -= G) < 0 && (m += this.DB, --L0), we)
|
|
2541
|
-
W[gt].copyTo(
|
|
2550
|
+
W[gt].copyTo(I), we = !1;
|
|
2542
2551
|
else {
|
|
2543
2552
|
for (; G > 1; )
|
|
2544
|
-
$.sqrTo(
|
|
2545
|
-
G > 0 ? $.sqrTo(
|
|
2553
|
+
$.sqrTo(I, Y0), $.sqrTo(Y0, I), G -= 2;
|
|
2554
|
+
G > 0 ? $.sqrTo(I, Y0) : (J0 = I, I = Y0, Y0 = J0), $.mulTo(Y0, W[gt], I);
|
|
2546
2555
|
}
|
|
2547
2556
|
for (; L0 >= 0 && !(u[L0] & 1 << m); )
|
|
2548
|
-
$.sqrTo(
|
|
2557
|
+
$.sqrTo(I, Y0), J0 = I, I = Y0, Y0 = J0, --m < 0 && (m = this.DB - 1, --L0);
|
|
2549
2558
|
}
|
|
2550
|
-
return $.revert(
|
|
2559
|
+
return $.revert(I);
|
|
2551
2560
|
}
|
|
2552
2561
|
function Mo(u) {
|
|
2553
|
-
var
|
|
2554
|
-
if (
|
|
2555
|
-
var D =
|
|
2556
|
-
|
|
2562
|
+
var p = this.s < 0 ? this.negate() : this.clone(), m = u.s < 0 ? u.negate() : u.clone();
|
|
2563
|
+
if (p.compareTo(m) < 0) {
|
|
2564
|
+
var D = p;
|
|
2565
|
+
p = m, m = D;
|
|
2557
2566
|
}
|
|
2558
|
-
var
|
|
2567
|
+
var I = p.getLowestSetBit(), $ = m.getLowestSetBit();
|
|
2559
2568
|
if ($ < 0)
|
|
2560
|
-
return
|
|
2561
|
-
for (
|
|
2562
|
-
(
|
|
2569
|
+
return p;
|
|
2570
|
+
for (I < $ && ($ = I), $ > 0 && (p.rShiftTo($, p), m.rShiftTo($, m)); p.signum() > 0; )
|
|
2571
|
+
(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));
|
|
2563
2572
|
return $ > 0 && m.lShiftTo($, m), m;
|
|
2564
2573
|
}
|
|
2565
2574
|
function jo(u) {
|
|
2566
2575
|
if (u <= 0)
|
|
2567
2576
|
return 0;
|
|
2568
|
-
var
|
|
2577
|
+
var p = this.DV % u, m = this.s < 0 ? u - 1 : 0;
|
|
2569
2578
|
if (this.t > 0)
|
|
2570
|
-
if (
|
|
2579
|
+
if (p == 0)
|
|
2571
2580
|
m = this[0] % u;
|
|
2572
2581
|
else
|
|
2573
2582
|
for (var D = this.t - 1; D >= 0; --D)
|
|
2574
|
-
m = (
|
|
2583
|
+
m = (p * m + this[D]) % u;
|
|
2575
2584
|
return m;
|
|
2576
2585
|
}
|
|
2577
2586
|
function Wo(u) {
|
|
2578
|
-
var
|
|
2579
|
-
if (this.isEven() &&
|
|
2587
|
+
var p = u.isEven();
|
|
2588
|
+
if (this.isEven() && p || u.signum() == 0)
|
|
2580
2589
|
return i.ZERO;
|
|
2581
|
-
for (var m = u.clone(), D = this.clone(),
|
|
2590
|
+
for (var m = u.clone(), D = this.clone(), I = b(1), $ = b(0), W = b(0), G = b(1); m.signum() != 0; ) {
|
|
2582
2591
|
for (; m.isEven(); )
|
|
2583
|
-
m.rShiftTo(1, m),
|
|
2592
|
+
m.rShiftTo(1, m), p ? ((!I.isEven() || !$.isEven()) && (I.addTo(this, I), $.subTo(u, $)), I.rShiftTo(1, I)) : $.isEven() || $.subTo(u, $), $.rShiftTo(1, $);
|
|
2584
2593
|
for (; D.isEven(); )
|
|
2585
|
-
D.rShiftTo(1, D),
|
|
2586
|
-
m.compareTo(D) >= 0 ? (m.subTo(D, m),
|
|
2594
|
+
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);
|
|
2595
|
+
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));
|
|
2587
2596
|
}
|
|
2588
2597
|
if (D.compareTo(i.ONE) != 0)
|
|
2589
2598
|
return i.ZERO;
|
|
@@ -2595,46 +2604,46 @@ var Yt = {}, Dx = {
|
|
|
2595
2604
|
return G;
|
|
2596
2605
|
return G.signum() < 0 ? G.add(u) : G;
|
|
2597
2606
|
}
|
|
2598
|
-
var
|
|
2607
|
+
var H0 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997], Zo = (1 << 26) / H0[H0.length - 1];
|
|
2599
2608
|
function Ko(u) {
|
|
2600
|
-
var
|
|
2601
|
-
if (m.t == 1 && m[0] <=
|
|
2602
|
-
for (
|
|
2603
|
-
if (m[0] ==
|
|
2609
|
+
var p, m = this.abs();
|
|
2610
|
+
if (m.t == 1 && m[0] <= H0[H0.length - 1]) {
|
|
2611
|
+
for (p = 0; p < H0.length; ++p)
|
|
2612
|
+
if (m[0] == H0[p])
|
|
2604
2613
|
return !0;
|
|
2605
2614
|
return !1;
|
|
2606
2615
|
}
|
|
2607
2616
|
if (m.isEven())
|
|
2608
2617
|
return !1;
|
|
2609
|
-
for (
|
|
2610
|
-
for (var D =
|
|
2611
|
-
D *=
|
|
2612
|
-
for (D = m.modInt(D);
|
|
2613
|
-
if (D %
|
|
2618
|
+
for (p = 1; p < H0.length; ) {
|
|
2619
|
+
for (var D = H0[p], I = p + 1; I < H0.length && D < Zo; )
|
|
2620
|
+
D *= H0[I++];
|
|
2621
|
+
for (D = m.modInt(D); p < I; )
|
|
2622
|
+
if (D % H0[p++] == 0)
|
|
2614
2623
|
return !1;
|
|
2615
2624
|
}
|
|
2616
2625
|
return m.millerRabin(u);
|
|
2617
2626
|
}
|
|
2618
2627
|
function Go(u) {
|
|
2619
|
-
var
|
|
2628
|
+
var p = this.subtract(i.ONE), m = p.getLowestSetBit();
|
|
2620
2629
|
if (m <= 0)
|
|
2621
2630
|
return !1;
|
|
2622
|
-
var D =
|
|
2623
|
-
u = u + 1 >> 1, u >
|
|
2624
|
-
for (var
|
|
2625
|
-
|
|
2626
|
-
var W =
|
|
2627
|
-
if (W.compareTo(i.ONE) != 0 && W.compareTo(
|
|
2628
|
-
for (var G = 1; G++ < m && W.compareTo(
|
|
2631
|
+
var D = p.shiftRight(m);
|
|
2632
|
+
u = u + 1 >> 1, u > H0.length && (u = H0.length);
|
|
2633
|
+
for (var I = o(), $ = 0; $ < u; ++$) {
|
|
2634
|
+
I.fromInt(H0[Math.floor(Math.random() * H0.length)]);
|
|
2635
|
+
var W = I.modPow(D, this);
|
|
2636
|
+
if (W.compareTo(i.ONE) != 0 && W.compareTo(p) != 0) {
|
|
2637
|
+
for (var G = 1; G++ < m && W.compareTo(p) != 0; )
|
|
2629
2638
|
if (W = W.modPowInt(2, this), W.compareTo(i.ONE) == 0)
|
|
2630
2639
|
return !1;
|
|
2631
|
-
if (W.compareTo(
|
|
2640
|
+
if (W.compareTo(p) != 0)
|
|
2632
2641
|
return !1;
|
|
2633
2642
|
}
|
|
2634
2643
|
}
|
|
2635
2644
|
return !0;
|
|
2636
2645
|
}
|
|
2637
|
-
i.prototype.chunkSize =
|
|
2646
|
+
i.prototype.chunkSize = H, i.prototype.toRadix = K, i.prototype.fromRadix = V, i.prototype.fromNumber = t0, i.prototype.bitwiseTo = g0, i.prototype.changeBit = Gr, i.prototype.addTo = P0, i.prototype.dMultiply = To, i.prototype.dAddOffset = Ro, i.prototype.multiplyLowerTo = Ho, i.prototype.multiplyUpperTo = Io, i.prototype.modInt = jo, i.prototype.millerRabin = Go, i.prototype.clone = ot, i.prototype.intValue = jt, 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 = E0, i.prototype.and = Bt, i.prototype.or = Wt, i.prototype.xor = Ur, i.prototype.andNot = $r, i.prototype.not = Ee, i.prototype.shiftLeft = Mr, i.prototype.shiftRight = me, i.prototype.getLowestSetBit = Wr, i.prototype.bitCount = be, i.prototype.testBit = Kr, i.prototype.setBit = Ae, i.prototype.clearBit = Xr, i.prototype.flipBit = Fe, i.prototype.add = ct, i.prototype.subtract = Ce, i.prototype.multiply = Qr, i.prototype.divide = wo, i.prototype.remainder = _o, i.prototype.divideAndRemainder = So, i.prototype.modPow = $o, i.prototype.modInverse = Wo, i.prototype.pow = Po, i.prototype.gcd = Mo, i.prototype.isProbablePrime = Ko, i.prototype.square = Do, i.prototype.Barrett = qt;
|
|
2638
2647
|
var De, N0, F0;
|
|
2639
2648
|
function Xo(u) {
|
|
2640
2649
|
N0[F0++] ^= u & 255, N0[F0++] ^= u >> 8 & 255, N0[F0++] ^= u >> 16 & 255, N0[F0++] ^= u >> 24 & 255, F0 >= Yr && (F0 -= Yr);
|
|
@@ -2669,9 +2678,9 @@ var Yt = {}, Dx = {
|
|
|
2669
2678
|
return De.next();
|
|
2670
2679
|
}
|
|
2671
2680
|
function Vo(u) {
|
|
2672
|
-
var
|
|
2673
|
-
for (
|
|
2674
|
-
u[
|
|
2681
|
+
var p;
|
|
2682
|
+
for (p = 0; p < u.length; ++p)
|
|
2683
|
+
u[p] = Qo();
|
|
2675
2684
|
}
|
|
2676
2685
|
function Zn() {
|
|
2677
2686
|
}
|
|
@@ -2680,11 +2689,11 @@ var Yt = {}, Dx = {
|
|
|
2680
2689
|
this.i = 0, this.j = 0, this.S = new Array();
|
|
2681
2690
|
}
|
|
2682
2691
|
function Yo(u) {
|
|
2683
|
-
var
|
|
2684
|
-
for (
|
|
2685
|
-
this.S[
|
|
2686
|
-
for (m = 0,
|
|
2687
|
-
m = m + this.S[
|
|
2692
|
+
var p, m, D;
|
|
2693
|
+
for (p = 0; p < 256; ++p)
|
|
2694
|
+
this.S[p] = p;
|
|
2695
|
+
for (m = 0, p = 0; p < 256; ++p)
|
|
2696
|
+
m = m + this.S[p] + u[p % u.length] & 255, D = this.S[p], this.S[p] = this.S[m], this.S[m] = D;
|
|
2688
2697
|
this.i = 0, this.j = 0;
|
|
2689
2698
|
}
|
|
2690
2699
|
function Jo() {
|
|
@@ -2781,7 +2790,7 @@ var Sx = {
|
|
|
2781
2790
|
return { r: c, s: x };
|
|
2782
2791
|
}
|
|
2783
2792
|
};
|
|
2784
|
-
const { BigInteger:
|
|
2793
|
+
const { BigInteger: I0 } = Yt, as = new I0("2"), cs = new I0("3");
|
|
2785
2794
|
class St {
|
|
2786
2795
|
constructor(e, r) {
|
|
2787
2796
|
this.x = r, this.q = e;
|
|
@@ -2837,7 +2846,7 @@ class St {
|
|
|
2837
2846
|
}
|
|
2838
2847
|
class kt {
|
|
2839
2848
|
constructor(e, r, n, s) {
|
|
2840
|
-
this.curve = e, this.x = r, this.y = n, this.z = s ??
|
|
2849
|
+
this.curve = e, this.x = r, this.y = n, this.z = s ?? I0.ONE, this.zinv = null;
|
|
2841
2850
|
}
|
|
2842
2851
|
getX() {
|
|
2843
2852
|
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));
|
|
@@ -2849,13 +2858,13 @@ class kt {
|
|
|
2849
2858
|
* 判断相等
|
|
2850
2859
|
*/
|
|
2851
2860
|
equals(e) {
|
|
2852
|
-
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(
|
|
2861
|
+
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(I0.ZERO) ? e.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(e.z)).mod(this.curve.q).equals(I0.ZERO) : !1;
|
|
2853
2862
|
}
|
|
2854
2863
|
/**
|
|
2855
2864
|
* 是否是无穷远点
|
|
2856
2865
|
*/
|
|
2857
2866
|
isInfinity() {
|
|
2858
|
-
return this.x === null && this.y === null ? !0 : this.z.equals(
|
|
2867
|
+
return this.x === null && this.y === null ? !0 : this.z.equals(I0.ZERO) && !this.y.toBigInteger().equals(I0.ZERO);
|
|
2859
2868
|
}
|
|
2860
2869
|
/**
|
|
2861
2870
|
* 取反,x 轴对称点
|
|
@@ -2888,11 +2897,11 @@ class kt {
|
|
|
2888
2897
|
return e;
|
|
2889
2898
|
if (e.isInfinity())
|
|
2890
2899
|
return this;
|
|
2891
|
-
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),
|
|
2892
|
-
if (
|
|
2893
|
-
return
|
|
2894
|
-
const l = c.add(x), y = s.multiply(a).mod(B), A =
|
|
2895
|
-
return new kt(this.curve, this.curve.fromBigInteger(b), this.curve.fromBigInteger(F),
|
|
2900
|
+
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);
|
|
2901
|
+
if (I0.ZERO.equals(d))
|
|
2902
|
+
return I0.ZERO.equals(f) ? this.twice() : this.curve.infinity;
|
|
2903
|
+
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);
|
|
2904
|
+
return new kt(this.curve, this.curve.fromBigInteger(b), this.curve.fromBigInteger(F), _);
|
|
2896
2905
|
}
|
|
2897
2906
|
/**
|
|
2898
2907
|
* 自加
|
|
@@ -2914,7 +2923,7 @@ class kt {
|
|
|
2914
2923
|
return this;
|
|
2915
2924
|
if (!this.y.toBigInteger().signum())
|
|
2916
2925
|
return this.curve.infinity;
|
|
2917
|
-
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(cs).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),
|
|
2926
|
+
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(cs).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);
|
|
2918
2927
|
return new kt(this.curve, this.curve.fromBigInteger(h), this.curve.fromBigInteger(v), f);
|
|
2919
2928
|
}
|
|
2920
2929
|
/**
|
|
@@ -2960,19 +2969,19 @@ let Tx = class {
|
|
|
2960
2969
|
return this.infinity;
|
|
2961
2970
|
case 2:
|
|
2962
2971
|
case 3:
|
|
2963
|
-
const r = this.fromBigInteger(new
|
|
2972
|
+
const r = this.fromBigInteger(new I0(e.substr(2), 16));
|
|
2964
2973
|
let n = this.fromBigInteger(r.multiply(r.square()).add(
|
|
2965
2974
|
r.multiply(this.a)
|
|
2966
2975
|
).add(this.b).toBigInteger().modPow(
|
|
2967
|
-
this.q.divide(new
|
|
2976
|
+
this.q.divide(new I0("4")).add(I0.ONE),
|
|
2968
2977
|
this.q
|
|
2969
2978
|
));
|
|
2970
|
-
return n.toBigInteger().mod(as).equals(new
|
|
2979
|
+
return n.toBigInteger().mod(as).equals(new I0(e.substr(0, 2), 16).subtract(as)) || (n = n.negate()), new kt(this, r, n);
|
|
2971
2980
|
case 4:
|
|
2972
2981
|
case 6:
|
|
2973
2982
|
case 7:
|
|
2974
2983
|
const s = (e.length - 2) / 2, i = e.substr(2, s), o = e.substr(s + 2, s);
|
|
2975
|
-
return new kt(this, this.fromBigInteger(new
|
|
2984
|
+
return new kt(this, this.fromBigInteger(new I0(i, 16)), this.fromBigInteger(new I0(o, 16)));
|
|
2976
2985
|
default:
|
|
2977
2986
|
return null;
|
|
2978
2987
|
}
|
|
@@ -2982,8 +2991,8 @@ var Rx = {
|
|
|
2982
2991
|
ECPointFp: kt,
|
|
2983
2992
|
ECCurveFp: Tx
|
|
2984
2993
|
};
|
|
2985
|
-
const { BigInteger: nt, SecureRandom: kx } = Yt, { ECCurveFp: Ox } = Rx, Px = new kx(), { curve: Xt, G:
|
|
2986
|
-
function
|
|
2994
|
+
const { BigInteger: nt, SecureRandom: kx } = Yt, { ECCurveFp: Ox } = Rx, Px = new kx(), { curve: Xt, G: Hx, n: xs } = Ui();
|
|
2995
|
+
function Ix() {
|
|
2987
2996
|
return Xt;
|
|
2988
2997
|
}
|
|
2989
2998
|
function Ui() {
|
|
@@ -2991,7 +3000,7 @@ function Ui() {
|
|
|
2991
3000
|
return { curve: n, G: o, n: a };
|
|
2992
3001
|
}
|
|
2993
3002
|
function qx(t, e, r) {
|
|
2994
|
-
const s = (t ? new nt(t, e, r) : new nt(xs.bitLength(), Px)).mod(xs.subtract(nt.ONE)).add(nt.ONE), i = ue(s.toString(16), 64), o =
|
|
3003
|
+
const s = (t ? new nt(t, e, r) : new nt(xs.bitLength(), Px)).mod(xs.subtract(nt.ONE)).add(nt.ONE), i = ue(s.toString(16), 64), o = Hx.multiply(s), a = ue(o.getX().toBigInteger().toString(16), 64), B = ue(o.getY().toBigInteger().toString(16), 64), c = "04" + a + B;
|
|
2995
3004
|
return { privateKey: i, publicKey: c };
|
|
2996
3005
|
}
|
|
2997
3006
|
function Nx(t) {
|
|
@@ -3058,7 +3067,7 @@ function jx(t, e) {
|
|
|
3058
3067
|
return n ? r.equals(n) : !1;
|
|
3059
3068
|
}
|
|
3060
3069
|
var Wx = {
|
|
3061
|
-
getGlobalCurve:
|
|
3070
|
+
getGlobalCurve: Ix,
|
|
3062
3071
|
generateEcparam: Ui,
|
|
3063
3072
|
generateKeyPairHex: qx,
|
|
3064
3073
|
compressPublicKeyHex: Nx,
|
|
@@ -3091,35 +3100,35 @@ function Le(t) {
|
|
|
3091
3100
|
let e = t.length * 8, r = e % 512;
|
|
3092
3101
|
r = r >= 448 ? 512 - r % 448 - 1 : 448 - r - 1;
|
|
3093
3102
|
const n = new Array((r - 7) / 8), s = new Array(8);
|
|
3094
|
-
for (let x = 0,
|
|
3103
|
+
for (let x = 0, d = n.length; x < d; x++)
|
|
3095
3104
|
n[x] = 0;
|
|
3096
|
-
for (let x = 0,
|
|
3105
|
+
for (let x = 0, d = s.length; x < d; x++)
|
|
3097
3106
|
s[x] = 0;
|
|
3098
3107
|
e = e.toString(2);
|
|
3099
3108
|
for (let x = 7; x >= 0; x--)
|
|
3100
3109
|
if (e.length > 8) {
|
|
3101
|
-
const
|
|
3102
|
-
s[x] = parseInt(e.substr(
|
|
3110
|
+
const d = e.length - 8;
|
|
3111
|
+
s[x] = parseInt(e.substr(d), 2), e = e.substr(0, d);
|
|
3103
3112
|
} else
|
|
3104
3113
|
e.length > 0 && (s[x] = parseInt(e, 2), e = "");
|
|
3105
3114
|
const i = new Uint8Array([...t, 128, ...n, ...s]), o = new DataView(i.buffer, 0), a = i.length / 64, B = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
|
|
3106
3115
|
for (let x = 0; x < a; x++) {
|
|
3107
3116
|
et.fill(0), un.fill(0);
|
|
3108
|
-
const
|
|
3109
|
-
for (let
|
|
3110
|
-
et[
|
|
3111
|
-
for (let
|
|
3112
|
-
et[
|
|
3113
|
-
for (let
|
|
3114
|
-
un[
|
|
3117
|
+
const d = 16 * x;
|
|
3118
|
+
for (let C = 0; C < 16; C++)
|
|
3119
|
+
et[C] = o.getUint32((d + C) * 4, !1);
|
|
3120
|
+
for (let C = 16; C < 68; C++)
|
|
3121
|
+
et[C] = Kx(et[C - 16] ^ et[C - 9] ^ Z0(et[C - 3], 15)) ^ Z0(et[C - 13], 7) ^ et[C - 6];
|
|
3122
|
+
for (let C = 0; C < 64; C++)
|
|
3123
|
+
un[C] = et[C] ^ et[C + 4];
|
|
3115
3124
|
const h = 2043430169, v = 2055708042;
|
|
3116
|
-
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],
|
|
3117
|
-
for (let
|
|
3118
|
-
w =
|
|
3125
|
+
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;
|
|
3126
|
+
for (let C = 0; C < 64; C++)
|
|
3127
|
+
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 + un[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 = Zx(q);
|
|
3119
3128
|
B[0] ^= f, B[1] ^= l, B[2] ^= y, B[3] ^= A, B[4] ^= g, B[5] ^= E, B[6] ^= b, B[7] ^= F;
|
|
3120
3129
|
}
|
|
3121
3130
|
const c = [];
|
|
3122
|
-
for (let x = 0,
|
|
3131
|
+
for (let x = 0, d = B.length; x < d; x++) {
|
|
3123
3132
|
const h = B[x];
|
|
3124
3133
|
c.push((h & 4278190080) >>> 24, (h & 16711680) >>> 16, (h & 65280) >>> 8, h & 255);
|
|
3125
3134
|
}
|
|
@@ -3145,13 +3154,13 @@ function Vx(t, e, r = 1) {
|
|
|
3145
3154
|
let i = n.publicKey;
|
|
3146
3155
|
i.length > 128 && (i = i.substr(i.length - 128));
|
|
3147
3156
|
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(te([].concat(a, t, B)));
|
|
3148
|
-
let x = 1,
|
|
3157
|
+
let x = 1, d = 0, h = [];
|
|
3149
3158
|
const v = [].concat(a, B), f = () => {
|
|
3150
|
-
h = te([...v, x >> 24 & 255, x >> 16 & 255, x >> 8 & 255, x & 255]), x++,
|
|
3159
|
+
h = te([...v, x >> 24 & 255, x >> 16 & 255, x >> 8 & 255, x & 255]), x++, d = 0;
|
|
3151
3160
|
};
|
|
3152
3161
|
f();
|
|
3153
3162
|
for (let y = 0, A = t.length; y < A; y++)
|
|
3154
|
-
|
|
3163
|
+
d === h.length && f(), t[y] ^= h[d++] & 255;
|
|
3155
3164
|
const l = n0.arrayToHex(t);
|
|
3156
3165
|
return r === Zi ? i + l + c : i + c + l;
|
|
3157
3166
|
}
|
|
@@ -3162,9 +3171,9 @@ function Yx(t, e, r = 1, {
|
|
|
3162
3171
|
let s = t.substr(128, 64), i = t.substr(128 + 64);
|
|
3163
3172
|
r === Zi && (s = t.substr(t.length - 64), i = t.substr(128, t.length - 128 - 64));
|
|
3164
3173
|
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));
|
|
3165
|
-
let
|
|
3174
|
+
let d = 1, h = 0, v = [];
|
|
3166
3175
|
const f = [].concat(c, x), l = () => {
|
|
3167
|
-
v = te([...f,
|
|
3176
|
+
v = te([...f, d >> 24 & 255, d >> 16 & 255, d >> 8 & 255, d & 255]), d++, h = 0;
|
|
3168
3177
|
};
|
|
3169
3178
|
l();
|
|
3170
3179
|
for (let A = 0, g = o.length; A < g; A++)
|
|
@@ -3181,15 +3190,15 @@ function Jx(t, e, {
|
|
|
3181
3190
|
let a = typeof t == "string" ? n0.utf8ToHex(t) : n0.arrayToHex(t);
|
|
3182
3191
|
s && (i = i || Gi(e), a = Ki(a, i, o));
|
|
3183
3192
|
const B = new $0(e, 16), c = new $0(a, 16);
|
|
3184
|
-
let x = null,
|
|
3193
|
+
let x = null, d = null, h = null;
|
|
3185
3194
|
do {
|
|
3186
3195
|
do {
|
|
3187
3196
|
let v;
|
|
3188
|
-
r && r.length ? v = r.pop() : v = Xi(), x = v.k,
|
|
3189
|
-
} while (
|
|
3190
|
-
h = B.add($0.ONE).modInverse(Zt).multiply(x.subtract(
|
|
3197
|
+
r && r.length ? v = r.pop() : v = Xi(), x = v.k, d = c.add(v.x1).mod(Zt);
|
|
3198
|
+
} while (d.equals($0.ZERO) || d.add(x).equals(Zt));
|
|
3199
|
+
h = B.add($0.ONE).modInverse(Zt).multiply(x.subtract(d.multiply(B))).mod(Zt);
|
|
3191
3200
|
} while (h.equals($0.ZERO));
|
|
3192
|
-
return n ? Xx(
|
|
3201
|
+
return n ? Xx(d, h) : n0.leftPad(d.toString(16), 64) + n0.leftPad(h.toString(16), 64);
|
|
3193
3202
|
}
|
|
3194
3203
|
function tf(t, e, r, { der: n, hash: s, userId: i } = {}) {
|
|
3195
3204
|
let o = typeof t == "string" ? n0.utf8ToHex(t) : n0.arrayToHex(t);
|
|
@@ -3200,10 +3209,10 @@ function tf(t, e, r, { der: n, hash: s, userId: i } = {}) {
|
|
|
3200
3209
|
a = f.r, B = f.s;
|
|
3201
3210
|
} else
|
|
3202
3211
|
a = new $0(e.substring(0, 64), 16), B = new $0(e.substring(64), 16);
|
|
3203
|
-
const c = Wi.decodePointHex(r), x = new $0(o, 16),
|
|
3204
|
-
if (
|
|
3212
|
+
const c = Wi.decodePointHex(r), x = new $0(o, 16), d = a.add(B).mod(Zt);
|
|
3213
|
+
if (d.equals($0.ZERO))
|
|
3205
3214
|
return !1;
|
|
3206
|
-
const h = Ut.multiply(B).add(c.multiply(
|
|
3215
|
+
const h = Ut.multiply(B).add(c.multiply(d)), v = x.add(h.getX().toBigInteger()).mod(Zt);
|
|
3207
3216
|
return a.equals(v);
|
|
3208
3217
|
}
|
|
3209
3218
|
function Ki(t, e, r = "1234567812345678") {
|
|
@@ -3218,8 +3227,8 @@ function Ki(t, e, r = "1234567812345678") {
|
|
|
3218
3227
|
}
|
|
3219
3228
|
const c = n0.hexToArray(r + n + s + i + o + a + B), x = r.length * 4;
|
|
3220
3229
|
c.unshift(x & 255), c.unshift(x >> 8 & 255);
|
|
3221
|
-
const
|
|
3222
|
-
return n0.arrayToHex(te(
|
|
3230
|
+
const d = te(c);
|
|
3231
|
+
return n0.arrayToHex(te(d.concat(n0.hexToArray(t))));
|
|
3223
3232
|
}
|
|
3224
3233
|
function Gi(t) {
|
|
3225
3234
|
const e = Ut.multiply(new $0(t, 16)), r = n0.leftPad(e.getX().toBigInteger().toString(16), 64), n = n0.leftPad(e.getY().toBigInteger().toString(16), 64);
|
|
@@ -3658,16 +3667,16 @@ function ls(t, e, r, {
|
|
|
3658
3667
|
const a = new Array(xf);
|
|
3659
3668
|
df(e, a, r);
|
|
3660
3669
|
const B = [];
|
|
3661
|
-
let c = i, x = t.length,
|
|
3670
|
+
let c = i, x = t.length, d = 0;
|
|
3662
3671
|
for (; x >= Nt; ) {
|
|
3663
|
-
const h = t.slice(
|
|
3672
|
+
const h = t.slice(d, d + 16), v = new Array(16);
|
|
3664
3673
|
if (s === "cbc")
|
|
3665
3674
|
for (let f = 0; f < Nt; f++)
|
|
3666
3675
|
r !== Dt && (h[f] ^= c[f]);
|
|
3667
3676
|
hf(h, v, a);
|
|
3668
3677
|
for (let f = 0; f < Nt; f++)
|
|
3669
|
-
s === "cbc" && r === Dt && (v[f] ^= c[f]), B[
|
|
3670
|
-
s === "cbc" && (r !== Dt ? c = v : c = h), x -= Nt,
|
|
3678
|
+
s === "cbc" && r === Dt && (v[f] ^= c[f]), B[d + f] = v[f];
|
|
3679
|
+
s === "cbc" && (r !== Dt ? c = v : c = h), x -= Nt, d += Nt;
|
|
3671
3680
|
}
|
|
3672
3681
|
if ((n === "pkcs#5" || n === "pkcs#7") && r === Dt) {
|
|
3673
3682
|
const h = B.length, v = B[h - 1];
|
|
@@ -3873,7 +3882,7 @@ function Af(t, e, r, n) {
|
|
|
3873
3882
|
}), f(y);
|
|
3874
3883
|
}).catch((E) => {
|
|
3875
3884
|
var F;
|
|
3876
|
-
const b = Array.isArray(E == null ? void 0 : E.message) ? (F = Array.from(E == null ? void 0 : E.message)) == null ? void 0 : F.map((
|
|
3885
|
+
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;
|
|
3877
3886
|
bf.error(b || M0(E));
|
|
3878
3887
|
});
|
|
3879
3888
|
}), a = (f) => {
|
|
@@ -3913,47 +3922,47 @@ function Af(t, e, r, n) {
|
|
|
3913
3922
|
var A = [];
|
|
3914
3923
|
let g = a(B((E = t == null ? void 0 : t.content) == null ? void 0 : E.beforeFetch, e, y));
|
|
3915
3924
|
i == null || i.forEach((b) => {
|
|
3916
|
-
var F = `${y0.schema}.${b}`,
|
|
3917
|
-
const S = Z.getValue(
|
|
3925
|
+
var F = `${y0.schema}.${b}`, _ = Z.buildVariablePropValue(F, g);
|
|
3926
|
+
const S = Z.getValue(_, !1, !0, n);
|
|
3918
3927
|
A.push({ sourceId: b, params: g, resp: S });
|
|
3919
3928
|
}), f(A);
|
|
3920
3929
|
});
|
|
3921
|
-
}),
|
|
3930
|
+
}), d = (f) => {
|
|
3922
3931
|
f == null || f.forEach((l) => {
|
|
3923
3932
|
let y = $e(l == null ? void 0 : l.resp, (A) => {
|
|
3924
3933
|
y == null || y(), s == null || s.forEach((g) => {
|
|
3925
|
-
var F,
|
|
3934
|
+
var F, _, S, R, q, w;
|
|
3926
3935
|
var E = (F = r == null ? void 0 : r.exposed) == null ? void 0 : F.findRefById(g);
|
|
3927
3936
|
if (!E)
|
|
3928
3937
|
return;
|
|
3929
|
-
const b = (
|
|
3938
|
+
const b = (_ = t == null ? void 0 : t.content) == null ? void 0 : _.afterFetch;
|
|
3930
3939
|
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);
|
|
3931
3940
|
});
|
|
3932
3941
|
});
|
|
3933
3942
|
});
|
|
3934
3943
|
};
|
|
3935
3944
|
x().then((f) => {
|
|
3936
|
-
|
|
3945
|
+
d(f);
|
|
3937
3946
|
});
|
|
3938
3947
|
}
|
|
3939
3948
|
function Ff(t, e, r, n) {
|
|
3940
3949
|
const s = (c, x) => {
|
|
3941
|
-
const { sendToIframe:
|
|
3950
|
+
const { sendToIframe: d, receive: h } = Ni();
|
|
3942
3951
|
return new Promise((v, f) => {
|
|
3943
3952
|
var y, A;
|
|
3944
3953
|
const l = ni();
|
|
3945
|
-
|
|
3946
|
-
var E, b, F,
|
|
3947
|
-
((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 && hs.error((
|
|
3954
|
+
d((A = (y = c == null ? void 0 : c.data) == null ? void 0 : y.props) == null ? void 0 : A.iframeRef, { ...x, msgId: l }), h((g) => {
|
|
3955
|
+
var E, b, F, _;
|
|
3956
|
+
((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 && hs.error((_ = g == null ? void 0 : g.data) == null ? void 0 : _.msg));
|
|
3948
3957
|
}, !0);
|
|
3949
3958
|
});
|
|
3950
3959
|
}, i = (c, x) => {
|
|
3951
3960
|
var l, y;
|
|
3952
|
-
const
|
|
3961
|
+
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()) || {};
|
|
3953
3962
|
var v = Nr.decryptFromUrl(window.location.href), f = Pt(c, {
|
|
3954
3963
|
data: {
|
|
3955
3964
|
urlQuery: v,
|
|
3956
|
-
rowScope:
|
|
3965
|
+
rowScope: d,
|
|
3957
3966
|
formData: h
|
|
3958
3967
|
},
|
|
3959
3968
|
exp: x
|
|
@@ -3963,10 +3972,10 @@ function Ff(t, e, r, n) {
|
|
|
3963
3972
|
var h, v, f, l;
|
|
3964
3973
|
var c = (h = t == null ? void 0 : t.content) != null && h.withQuery ? Gt.getLocationQueryParams() : {};
|
|
3965
3974
|
let x = Object.assign(c || {}, i((v = t == null ? void 0 : t.content) == null ? void 0 : v.setQueryFn, e));
|
|
3966
|
-
const
|
|
3967
|
-
return Gt.resolveByCurrentUrl(
|
|
3975
|
+
const d = Gt.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);
|
|
3976
|
+
return Gt.resolveByCurrentUrl(d);
|
|
3968
3977
|
}, a = () => {
|
|
3969
|
-
var c, x,
|
|
3978
|
+
var c, x, d, h;
|
|
3970
3979
|
switch ((c = t == null ? void 0 : t.content) == null ? void 0 : c.windowTarget) {
|
|
3971
3980
|
case tn.self:
|
|
3972
3981
|
return window;
|
|
@@ -3975,16 +3984,16 @@ function Ff(t, e, r, n) {
|
|
|
3975
3984
|
case tn.parent:
|
|
3976
3985
|
return window.parent;
|
|
3977
3986
|
default:
|
|
3978
|
-
return (x = t == null ? void 0 : t.content) != null && x.windowTarget ? (h = U0.find(window, (
|
|
3987
|
+
return (x = t == null ? void 0 : t.content) != null && x.windowTarget ? (h = U0.find(window, (d = t == null ? void 0 : t.content) == null ? void 0 : d.windowTarget)) == null ? void 0 : h.window : window;
|
|
3979
3988
|
}
|
|
3980
3989
|
};
|
|
3981
3990
|
(() => {
|
|
3982
3991
|
var f, l;
|
|
3983
|
-
const { openWindow: c } = eo(), x = a(),
|
|
3992
|
+
const { openWindow: c } = eo(), x = a(), d = o();
|
|
3984
3993
|
if (((f = t == null ? void 0 : t.content) == null ? void 0 : f.windowModal) === ga.modal) {
|
|
3985
3994
|
var h = { self: window == null ? void 0 : window.name, caller: x == null ? void 0 : x.name };
|
|
3986
3995
|
const y = (g) => s(g, { command: "saveForm", args: { ...h } }), A = (g) => s(g, { command: "cancelForm", args: { ...h } });
|
|
3987
|
-
var v = { ...t == null ? void 0 : t.content, url:
|
|
3996
|
+
var v = { ...t == null ? void 0 : t.content, url: d, callback: { okCallback: y, cancelCallback: A } };
|
|
3988
3997
|
if (x)
|
|
3989
3998
|
if (x != null && x.openModalAsync)
|
|
3990
3999
|
(l = x == null ? void 0 : x.openModalAsync) == null || l.call(x, v);
|
|
@@ -3995,7 +4004,7 @@ function Ff(t, e, r, n) {
|
|
|
3995
4004
|
else
|
|
3996
4005
|
Ta(r, v);
|
|
3997
4006
|
} else
|
|
3998
|
-
c(
|
|
4007
|
+
c(d, t == null ? void 0 : t.content, x == null ? void 0 : x.window, !1);
|
|
3999
4008
|
})();
|
|
4000
4009
|
}
|
|
4001
4010
|
function Cf(t, e, r, n) {
|
|
@@ -4003,11 +4012,11 @@ function Cf(t, e, r, n) {
|
|
|
4003
4012
|
let s = he((x = t == null ? void 0 : t.content) == null ? void 0 : x.sourceId, !0);
|
|
4004
4013
|
if (!s)
|
|
4005
4014
|
return null;
|
|
4006
|
-
const i = (
|
|
4007
|
-
if (!
|
|
4015
|
+
const i = (d, h, v) => {
|
|
4016
|
+
if (!d)
|
|
4008
4017
|
return v;
|
|
4009
4018
|
const f = We(r);
|
|
4010
|
-
return Pt(
|
|
4019
|
+
return Pt(d, {
|
|
4011
4020
|
formData: v || (f == null ? void 0 : f.formData) || {},
|
|
4012
4021
|
arg: {
|
|
4013
4022
|
urlQuery: f == null ? void 0 : f.urlQuerys,
|
|
@@ -4017,19 +4026,19 @@ function Cf(t, e, r, n) {
|
|
|
4017
4026
|
});
|
|
4018
4027
|
}, o = () => {
|
|
4019
4028
|
var l, y, A;
|
|
4020
|
-
var
|
|
4029
|
+
var d = [];
|
|
4021
4030
|
const h = (l = t == null ? void 0 : t.content) == null ? void 0 : l.params, v = Q0(Tl(h, n));
|
|
4022
4031
|
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;
|
|
4023
4032
|
return s == null || s.forEach((g) => {
|
|
4024
4033
|
var E = `${y0.schema}.${g}`, b = Z.buildVariablePropValue(E, f);
|
|
4025
4034
|
const F = Z.getValue(b, !1, !0, n);
|
|
4026
|
-
|
|
4027
|
-
}),
|
|
4028
|
-
}, a = (
|
|
4029
|
-
if (!
|
|
4035
|
+
d.push({ sourceId: g, params: f, resp: F });
|
|
4036
|
+
}), d;
|
|
4037
|
+
}, a = (d, h, v, f) => {
|
|
4038
|
+
if (!d)
|
|
4030
4039
|
return f;
|
|
4031
4040
|
const l = We(r);
|
|
4032
|
-
return Pt(
|
|
4041
|
+
return Pt(d, {
|
|
4033
4042
|
respValue: f,
|
|
4034
4043
|
respData: v,
|
|
4035
4044
|
arg: {
|
|
@@ -4039,8 +4048,8 @@ function Cf(t, e, r, n) {
|
|
|
4039
4048
|
},
|
|
4040
4049
|
exp: h
|
|
4041
4050
|
});
|
|
4042
|
-
}, B = (
|
|
4043
|
-
|
|
4051
|
+
}, B = (d) => {
|
|
4052
|
+
d == null || d.forEach((h) => {
|
|
4044
4053
|
let v = $e(h == null ? void 0 : h.resp, (f) => {
|
|
4045
4054
|
var l, y;
|
|
4046
4055
|
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);
|
|
@@ -4058,48 +4067,48 @@ function Df(t, e, r, n) {
|
|
|
4058
4067
|
case xt.actionURL:
|
|
4059
4068
|
return Ff(t, e, r);
|
|
4060
4069
|
case xt.actionShowWidget: {
|
|
4061
|
-
let
|
|
4062
|
-
Array.isArray(
|
|
4070
|
+
let d = (i = t == null ? void 0 : t.content) == null ? void 0 : i.widgetId;
|
|
4071
|
+
Array.isArray(d) || (d = [d]), d == null || d.forEach((h) => {
|
|
4063
4072
|
var v, f, l;
|
|
4064
4073
|
(l = (f = (v = r == null ? void 0 : r.exposed) == null ? void 0 : v.findRefById(h, r)) == null ? void 0 : f.exposed) == null || l.setHidden(!1);
|
|
4065
4074
|
});
|
|
4066
4075
|
return;
|
|
4067
4076
|
}
|
|
4068
4077
|
case xt.actionHideWidget: {
|
|
4069
|
-
let
|
|
4070
|
-
Array.isArray(
|
|
4078
|
+
let d = (o = t == null ? void 0 : t.content) == null ? void 0 : o.widgetId;
|
|
4079
|
+
Array.isArray(d) || (d = [d]), d == null || d.forEach((h) => {
|
|
4071
4080
|
var v, f, l;
|
|
4072
4081
|
(l = (f = (v = r == null ? void 0 : r.exposed) == null ? void 0 : v.findRefById(h, r)) == null ? void 0 : f.exposed) == null || l.setHidden(!0);
|
|
4073
4082
|
});
|
|
4074
4083
|
return;
|
|
4075
4084
|
}
|
|
4076
4085
|
case xt.actionEnableWidget: {
|
|
4077
|
-
let
|
|
4078
|
-
Array.isArray(
|
|
4086
|
+
let d = (a = t == null ? void 0 : t.content) == null ? void 0 : a.widgetId;
|
|
4087
|
+
Array.isArray(d) || (d = [d]), d == null || d.forEach((h) => {
|
|
4079
4088
|
var v, f, l;
|
|
4080
4089
|
(l = (f = (v = r == null ? void 0 : r.exposed) == null ? void 0 : v.findRefById(h, r)) == null ? void 0 : f.exposed) == null || l.setDisabled(!1);
|
|
4081
4090
|
});
|
|
4082
4091
|
return;
|
|
4083
4092
|
}
|
|
4084
4093
|
case xt.actionDisableWidget: {
|
|
4085
|
-
let
|
|
4086
|
-
Array.isArray(
|
|
4094
|
+
let d = (B = t == null ? void 0 : t.content) == null ? void 0 : B.widgetId;
|
|
4095
|
+
Array.isArray(d) || (d = [d]), d == null || d.forEach((h) => {
|
|
4087
4096
|
var v, f, l;
|
|
4088
4097
|
(l = (f = (v = r == null ? void 0 : r.exposed) == null ? void 0 : v.findRefById(h, r)) == null ? void 0 : f.exposed) == null || l.setDisabled(!0);
|
|
4089
4098
|
});
|
|
4090
4099
|
return;
|
|
4091
4100
|
}
|
|
4092
4101
|
case xt.actionOpenDialog: {
|
|
4093
|
-
let
|
|
4094
|
-
Array.isArray(
|
|
4102
|
+
let d = (c = t == null ? void 0 : t.content) == null ? void 0 : c.widgetId;
|
|
4103
|
+
Array.isArray(d) || (d = [d]), d == null || d.forEach((h) => {
|
|
4095
4104
|
var v, f, l;
|
|
4096
4105
|
(l = (f = (v = r == null ? void 0 : r.exposed) == null ? void 0 : v.findRefById(h, r)) == null ? void 0 : f.exposed) == null || l.setValue(!0);
|
|
4097
4106
|
});
|
|
4098
4107
|
return;
|
|
4099
4108
|
}
|
|
4100
4109
|
case xt.actionCloseDialog: {
|
|
4101
|
-
let
|
|
4102
|
-
Array.isArray(
|
|
4110
|
+
let d = (x = t == null ? void 0 : t.content) == null ? void 0 : x.widgetId;
|
|
4111
|
+
Array.isArray(d) || (d = [d]), d == null || d.forEach((h) => {
|
|
4103
4112
|
var v, f, l;
|
|
4104
4113
|
(l = (f = (v = r == null ? void 0 : r.exposed) == null ? void 0 : v.findRefById(h, r)) == null ? void 0 : f.exposed) == null || l.setValue(!1);
|
|
4105
4114
|
});
|
|
@@ -4178,10 +4187,10 @@ function Of(t, e, r) {
|
|
|
4178
4187
|
const On = {
|
|
4179
4188
|
encrypt: kf,
|
|
4180
4189
|
decrypt: Of
|
|
4181
|
-
}, no = "3.7.7", Pf = no, re = typeof Buffer == "function", ds = typeof TextDecoder == "function" ? new TextDecoder() : void 0, ps = typeof TextEncoder == "function" ? new TextEncoder() : void 0,
|
|
4190
|
+
}, no = "3.7.7", Pf = no, re = typeof Buffer == "function", ds = typeof TextDecoder == "function" ? new TextDecoder() : void 0, ps = typeof TextEncoder == "function" ? new TextEncoder() : void 0, Hf = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", fe = Array.prototype.slice.call(Hf), Pe = ((t) => {
|
|
4182
4191
|
let e = {};
|
|
4183
4192
|
return t.forEach((r, n) => e[r] = n), e;
|
|
4184
|
-
})(fe),
|
|
4193
|
+
})(fe), If = /^(?:[A-Za-z\d+\/]{4})*?(?:[A-Za-z\d+\/]{2}(?:==)?|[A-Za-z\d+\/]{3}=?)?$/, S0 = String.fromCharCode.bind(String), vs = typeof Uint8Array.from == "function" ? Uint8Array.from.bind(Uint8Array) : (t) => new Uint8Array(Array.prototype.slice.call(t, 0)), so = (t) => t.replace(/=/g, "").replace(/[+\/]/g, (e) => e == "+" ? "-" : "_"), io = (t) => t.replace(/[^A-Za-z0-9\+\/]/g, ""), oo = (t) => {
|
|
4185
4194
|
let e, r, n, s, i = "";
|
|
4186
4195
|
const o = t.length % 3;
|
|
4187
4196
|
for (let a = 0; a < t.length; ) {
|
|
@@ -4214,14 +4223,14 @@ const On = {
|
|
|
4214
4223
|
return S0((31 & t.charCodeAt(0)) << 6 | 63 & t.charCodeAt(1));
|
|
4215
4224
|
}
|
|
4216
4225
|
}, co = (t) => t.replace(Lf, zf), xo = (t) => {
|
|
4217
|
-
if (t = t.replace(/\s+/g, ""), !
|
|
4226
|
+
if (t = t.replace(/\s+/g, ""), !If.test(t))
|
|
4218
4227
|
throw new TypeError("malformed base64.");
|
|
4219
4228
|
t += "==".slice(2 - (t.length & 3));
|
|
4220
4229
|
let e, r = "", n, s;
|
|
4221
4230
|
for (let i = 0; i < t.length; )
|
|
4222
4231
|
e = Pe[t.charAt(i++)] << 18 | Pe[t.charAt(i++)] << 12 | (n = Pe[t.charAt(i++)]) << 6 | (s = Pe[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);
|
|
4223
4232
|
return r;
|
|
4224
|
-
},
|
|
4233
|
+
}, Hn = typeof atob == "function" ? (t) => atob(io(t)) : re ? (t) => Buffer.from(t, "base64").toString("binary") : xo, fo = re ? (t) => vs(Buffer.from(t, "base64")) : (t) => vs(Hn(t).split("").map((e) => e.charCodeAt(0))), uo = (t) => fo(lo(t)), Uf = re ? (t) => Buffer.from(t, "base64").toString("utf8") : ds ? (t) => ds.decode(fo(t)) : (t) => co(Hn(t)), lo = (t) => io(t.replace(/[-_]/g, (e) => e == "-" ? "+" : "/")), yn = (t) => Uf(lo(t)), $f = (t) => {
|
|
4225
4234
|
if (typeof t != "string")
|
|
4226
4235
|
return !1;
|
|
4227
4236
|
const e = t.replace(/\s+/g, "").replace(/={0,2}$/, "");
|
|
@@ -4258,7 +4267,7 @@ const On = {
|
|
|
4258
4267
|
}, jf = {
|
|
4259
4268
|
version: no,
|
|
4260
4269
|
VERSION: Pf,
|
|
4261
|
-
atob:
|
|
4270
|
+
atob: Hn,
|
|
4262
4271
|
atobPolyfill: xo,
|
|
4263
4272
|
btoa: Pn,
|
|
4264
4273
|
btoaPolyfill: oo,
|
|
@@ -4367,15 +4376,15 @@ class Wf {
|
|
|
4367
4376
|
var n = r.length, s, i, o, a, B, c = Array(Math.ceil(e.length / 2));
|
|
4368
4377
|
for (s = 0; s < c.length; s++)
|
|
4369
4378
|
c[s] = e.charCodeAt(s * 2) << 8 | e.charCodeAt(s * 2 + 1);
|
|
4370
|
-
var x = Math.ceil(e.length * 8 / (Math.log(r.length) / Math.log(2))),
|
|
4379
|
+
var x = Math.ceil(e.length * 8 / (Math.log(r.length) / Math.log(2))), d = Array(x);
|
|
4371
4380
|
for (i = 0; i < x; i++) {
|
|
4372
4381
|
for (B = Array(), a = 0, s = 0; s < c.length; s++)
|
|
4373
4382
|
a = (a << 16) + c[s], o = Math.floor(a / n), a -= o * n, (B.length > 0 || o > 0) && (B[B.length] = o);
|
|
4374
|
-
|
|
4383
|
+
d[i] = a, c = B;
|
|
4375
4384
|
}
|
|
4376
4385
|
var h = "";
|
|
4377
|
-
for (s =
|
|
4378
|
-
h += r.charAt(
|
|
4386
|
+
for (s = d.length - 1; s >= 0; s--)
|
|
4387
|
+
h += r.charAt(d[s]);
|
|
4379
4388
|
return h;
|
|
4380
4389
|
}
|
|
4381
4390
|
/*
|
|
@@ -4443,8 +4452,8 @@ class Wf {
|
|
|
4443
4452
|
binl_md5(e, r) {
|
|
4444
4453
|
e[r >> 5] |= 128 << r % 32, e[(r + 64 >>> 9 << 4) + 14] = r;
|
|
4445
4454
|
for (var n = 1732584193, s = -271733879, i = -1732584194, o = 271733878, a = 0; a < e.length; a += 16) {
|
|
4446
|
-
var B = n, c = s, x = i,
|
|
4447
|
-
n = this.md5_ff(n, s, i, o, e[a + 0], 7, -680876936), o = this.md5_ff(o, n, s, i, e[a + 1], 12, -389564586), i = this.md5_ff(i, o, n, s, e[a + 2], 17, 606105819), s = this.md5_ff(s, i, o, n, e[a + 3], 22, -1044525330), n = this.md5_ff(n, s, i, o, e[a + 4], 7, -176418897), o = this.md5_ff(o, n, s, i, e[a + 5], 12, 1200080426), i = this.md5_ff(i, o, n, s, e[a + 6], 17, -1473231341), s = this.md5_ff(s, i, o, n, e[a + 7], 22, -45705983), n = this.md5_ff(n, s, i, o, e[a + 8], 7, 1770035416), o = this.md5_ff(o, n, s, i, e[a + 9], 12, -1958414417), i = this.md5_ff(i, o, n, s, e[a + 10], 17, -42063), s = this.md5_ff(s, i, o, n, e[a + 11], 22, -1990404162), n = this.md5_ff(n, s, i, o, e[a + 12], 7, 1804603682), o = this.md5_ff(o, n, s, i, e[a + 13], 12, -40341101), i = this.md5_ff(i, o, n, s, e[a + 14], 17, -1502002290), s = this.md5_ff(s, i, o, n, e[a + 15], 22, 1236535329), n = this.md5_gg(n, s, i, o, e[a + 1], 5, -165796510), o = this.md5_gg(o, n, s, i, e[a + 6], 9, -1069501632), i = this.md5_gg(i, o, n, s, e[a + 11], 14, 643717713), s = this.md5_gg(s, i, o, n, e[a + 0], 20, -373897302), n = this.md5_gg(n, s, i, o, e[a + 5], 5, -701558691), o = this.md5_gg(o, n, s, i, e[a + 10], 9, 38016083), i = this.md5_gg(i, o, n, s, e[a + 15], 14, -660478335), s = this.md5_gg(s, i, o, n, e[a + 4], 20, -405537848), n = this.md5_gg(n, s, i, o, e[a + 9], 5, 568446438), o = this.md5_gg(o, n, s, i, e[a + 14], 9, -1019803690), i = this.md5_gg(i, o, n, s, e[a + 3], 14, -187363961), s = this.md5_gg(s, i, o, n, e[a + 8], 20, 1163531501), n = this.md5_gg(n, s, i, o, e[a + 13], 5, -1444681467), o = this.md5_gg(o, n, s, i, e[a + 2], 9, -51403784), i = this.md5_gg(i, o, n, s, e[a + 7], 14, 1735328473), s = this.md5_gg(s, i, o, n, e[a + 12], 20, -1926607734), n = this.md5_hh(n, s, i, o, e[a + 5], 4, -378558), o = this.md5_hh(o, n, s, i, e[a + 8], 11, -2022574463), i = this.md5_hh(i, o, n, s, e[a + 11], 16, 1839030562), s = this.md5_hh(s, i, o, n, e[a + 14], 23, -35309556), n = this.md5_hh(n, s, i, o, e[a + 1], 4, -1530992060), o = this.md5_hh(o, n, s, i, e[a + 4], 11, 1272893353), i = this.md5_hh(i, o, n, s, e[a + 7], 16, -155497632), s = this.md5_hh(s, i, o, n, e[a + 10], 23, -1094730640), n = this.md5_hh(n, s, i, o, e[a + 13], 4, 681279174), o = this.md5_hh(o, n, s, i, e[a + 0], 11, -358537222), i = this.md5_hh(i, o, n, s, e[a + 3], 16, -722521979), s = this.md5_hh(s, i, o, n, e[a + 6], 23, 76029189), n = this.md5_hh(n, s, i, o, e[a + 9], 4, -640364487), o = this.md5_hh(o, n, s, i, e[a + 12], 11, -421815835), i = this.md5_hh(i, o, n, s, e[a + 15], 16, 530742520), s = this.md5_hh(s, i, o, n, e[a + 2], 23, -995338651), n = this.md5_ii(n, s, i, o, e[a + 0], 6, -198630844), o = this.md5_ii(o, n, s, i, e[a + 7], 10, 1126891415), i = this.md5_ii(i, o, n, s, e[a + 14], 15, -1416354905), s = this.md5_ii(s, i, o, n, e[a + 5], 21, -57434055), n = this.md5_ii(n, s, i, o, e[a + 12], 6, 1700485571), o = this.md5_ii(o, n, s, i, e[a + 3], 10, -1894986606), i = this.md5_ii(i, o, n, s, e[a + 10], 15, -1051523), s = this.md5_ii(s, i, o, n, e[a + 1], 21, -2054922799), n = this.md5_ii(n, s, i, o, e[a + 8], 6, 1873313359), o = this.md5_ii(o, n, s, i, e[a + 15], 10, -30611744), i = this.md5_ii(i, o, n, s, e[a + 6], 15, -1560198380), s = this.md5_ii(s, i, o, n, e[a + 13], 21, 1309151649), n = this.md5_ii(n, s, i, o, e[a + 4], 6, -145523070), o = this.md5_ii(o, n, s, i, e[a + 11], 10, -1120210379), i = this.md5_ii(i, o, n, s, e[a + 2], 15, 718787259), s = this.md5_ii(s, i, o, n, e[a + 9], 21, -343485551), n = this.safe_add(n, B), s = this.safe_add(s, c), i = this.safe_add(i, x), o = this.safe_add(o,
|
|
4455
|
+
var B = n, c = s, x = i, d = o;
|
|
4456
|
+
n = this.md5_ff(n, s, i, o, e[a + 0], 7, -680876936), o = this.md5_ff(o, n, s, i, e[a + 1], 12, -389564586), i = this.md5_ff(i, o, n, s, e[a + 2], 17, 606105819), s = this.md5_ff(s, i, o, n, e[a + 3], 22, -1044525330), n = this.md5_ff(n, s, i, o, e[a + 4], 7, -176418897), o = this.md5_ff(o, n, s, i, e[a + 5], 12, 1200080426), i = this.md5_ff(i, o, n, s, e[a + 6], 17, -1473231341), s = this.md5_ff(s, i, o, n, e[a + 7], 22, -45705983), n = this.md5_ff(n, s, i, o, e[a + 8], 7, 1770035416), o = this.md5_ff(o, n, s, i, e[a + 9], 12, -1958414417), i = this.md5_ff(i, o, n, s, e[a + 10], 17, -42063), s = this.md5_ff(s, i, o, n, e[a + 11], 22, -1990404162), n = this.md5_ff(n, s, i, o, e[a + 12], 7, 1804603682), o = this.md5_ff(o, n, s, i, e[a + 13], 12, -40341101), i = this.md5_ff(i, o, n, s, e[a + 14], 17, -1502002290), s = this.md5_ff(s, i, o, n, e[a + 15], 22, 1236535329), n = this.md5_gg(n, s, i, o, e[a + 1], 5, -165796510), o = this.md5_gg(o, n, s, i, e[a + 6], 9, -1069501632), i = this.md5_gg(i, o, n, s, e[a + 11], 14, 643717713), s = this.md5_gg(s, i, o, n, e[a + 0], 20, -373897302), n = this.md5_gg(n, s, i, o, e[a + 5], 5, -701558691), o = this.md5_gg(o, n, s, i, e[a + 10], 9, 38016083), i = this.md5_gg(i, o, n, s, e[a + 15], 14, -660478335), s = this.md5_gg(s, i, o, n, e[a + 4], 20, -405537848), n = this.md5_gg(n, s, i, o, e[a + 9], 5, 568446438), o = this.md5_gg(o, n, s, i, e[a + 14], 9, -1019803690), i = this.md5_gg(i, o, n, s, e[a + 3], 14, -187363961), s = this.md5_gg(s, i, o, n, e[a + 8], 20, 1163531501), n = this.md5_gg(n, s, i, o, e[a + 13], 5, -1444681467), o = this.md5_gg(o, n, s, i, e[a + 2], 9, -51403784), i = this.md5_gg(i, o, n, s, e[a + 7], 14, 1735328473), s = this.md5_gg(s, i, o, n, e[a + 12], 20, -1926607734), n = this.md5_hh(n, s, i, o, e[a + 5], 4, -378558), o = this.md5_hh(o, n, s, i, e[a + 8], 11, -2022574463), i = this.md5_hh(i, o, n, s, e[a + 11], 16, 1839030562), s = this.md5_hh(s, i, o, n, e[a + 14], 23, -35309556), n = this.md5_hh(n, s, i, o, e[a + 1], 4, -1530992060), o = this.md5_hh(o, n, s, i, e[a + 4], 11, 1272893353), i = this.md5_hh(i, o, n, s, e[a + 7], 16, -155497632), s = this.md5_hh(s, i, o, n, e[a + 10], 23, -1094730640), n = this.md5_hh(n, s, i, o, e[a + 13], 4, 681279174), o = this.md5_hh(o, n, s, i, e[a + 0], 11, -358537222), i = this.md5_hh(i, o, n, s, e[a + 3], 16, -722521979), s = this.md5_hh(s, i, o, n, e[a + 6], 23, 76029189), n = this.md5_hh(n, s, i, o, e[a + 9], 4, -640364487), o = this.md5_hh(o, n, s, i, e[a + 12], 11, -421815835), i = this.md5_hh(i, o, n, s, e[a + 15], 16, 530742520), s = this.md5_hh(s, i, o, n, e[a + 2], 23, -995338651), n = this.md5_ii(n, s, i, o, e[a + 0], 6, -198630844), o = this.md5_ii(o, n, s, i, e[a + 7], 10, 1126891415), i = this.md5_ii(i, o, n, s, e[a + 14], 15, -1416354905), s = this.md5_ii(s, i, o, n, e[a + 5], 21, -57434055), n = this.md5_ii(n, s, i, o, e[a + 12], 6, 1700485571), o = this.md5_ii(o, n, s, i, e[a + 3], 10, -1894986606), i = this.md5_ii(i, o, n, s, e[a + 10], 15, -1051523), s = this.md5_ii(s, i, o, n, e[a + 1], 21, -2054922799), n = this.md5_ii(n, s, i, o, e[a + 8], 6, 1873313359), o = this.md5_ii(o, n, s, i, e[a + 15], 10, -30611744), i = this.md5_ii(i, o, n, s, e[a + 6], 15, -1560198380), s = this.md5_ii(s, i, o, n, e[a + 13], 21, 1309151649), n = this.md5_ii(n, s, i, o, e[a + 4], 6, -145523070), o = this.md5_ii(o, n, s, i, e[a + 11], 10, -1120210379), i = this.md5_ii(i, o, n, s, e[a + 2], 15, 718787259), s = this.md5_ii(s, i, o, n, e[a + 9], 21, -343485551), n = this.safe_add(n, B), s = this.safe_add(s, c), i = this.safe_add(i, x), o = this.safe_add(o, d);
|
|
4448
4457
|
}
|
|
4449
4458
|
return [n, s, i, o];
|
|
4450
4459
|
}
|
|
@@ -4481,14 +4490,14 @@ class Wf {
|
|
|
4481
4490
|
return e << r | e >>> 32 - r;
|
|
4482
4491
|
}
|
|
4483
4492
|
}
|
|
4484
|
-
const hn = new Wf(),
|
|
4493
|
+
const hn = new Wf(), In = (t, e) => {
|
|
4485
4494
|
if (!t)
|
|
4486
4495
|
return "";
|
|
4487
4496
|
t.timeStamp = new Date().getTime();
|
|
4488
4497
|
const r = sa(t), s = M0(r) + e, i = hn == null ? void 0 : hn.hex_md5(s), o = jf.encode(i);
|
|
4489
4498
|
return r.dataDigest = o, r;
|
|
4490
4499
|
}, Zf = (t, e, r) => {
|
|
4491
|
-
const n =
|
|
4500
|
+
const n = In(t, e);
|
|
4492
4501
|
return ge.encrypt(M0(n), r);
|
|
4493
4502
|
}, Kf = (t, e) => {
|
|
4494
4503
|
if (z0(t))
|
|
@@ -4497,7 +4506,7 @@ const hn = new Wf(), Hn = (t, e) => {
|
|
|
4497
4506
|
var n = Q0(r);
|
|
4498
4507
|
return r !== null && n === null && console.log(r), n;
|
|
4499
4508
|
}, Gf = (t, e, r, n) => {
|
|
4500
|
-
const s =
|
|
4509
|
+
const s = In(t, e);
|
|
4501
4510
|
return On.encrypt(M0(s), r, n);
|
|
4502
4511
|
}, Xf = (t, e, r) => {
|
|
4503
4512
|
if (z0(t))
|
|
@@ -4506,7 +4515,7 @@ const hn = new Wf(), Hn = (t, e) => {
|
|
|
4506
4515
|
var s = Q0(n);
|
|
4507
4516
|
return n !== null && s === null && console.log(n), s;
|
|
4508
4517
|
}, Qf = {
|
|
4509
|
-
traceBody:
|
|
4518
|
+
traceBody: In,
|
|
4510
4519
|
encodeSM2: Zf,
|
|
4511
4520
|
decodeSM2: Kf,
|
|
4512
4521
|
encodeSM4: Gf,
|
|
@@ -4654,7 +4663,7 @@ function o0() {
|
|
|
4654
4663
|
return this.init.prototype.extend(this);
|
|
4655
4664
|
}
|
|
4656
4665
|
};
|
|
4657
|
-
}(),
|
|
4666
|
+
}(), d = c.WordArray = x.extend({
|
|
4658
4667
|
/**
|
|
4659
4668
|
* Initializes a newly created word array.
|
|
4660
4669
|
*
|
|
@@ -4698,16 +4707,16 @@ function o0() {
|
|
|
4698
4707
|
* wordArray1.concat(wordArray2);
|
|
4699
4708
|
*/
|
|
4700
4709
|
concat: function(g) {
|
|
4701
|
-
var E = this.words, b = g.words, F = this.sigBytes,
|
|
4710
|
+
var E = this.words, b = g.words, F = this.sigBytes, _ = g.sigBytes;
|
|
4702
4711
|
if (this.clamp(), F % 4)
|
|
4703
|
-
for (var S = 0; S <
|
|
4712
|
+
for (var S = 0; S < _; S++) {
|
|
4704
4713
|
var R = b[S >>> 2] >>> 24 - S % 4 * 8 & 255;
|
|
4705
4714
|
E[F + S >>> 2] |= R << 24 - (F + S) % 4 * 8;
|
|
4706
4715
|
}
|
|
4707
4716
|
else
|
|
4708
|
-
for (var q = 0; q <
|
|
4717
|
+
for (var q = 0; q < _; q += 4)
|
|
4709
4718
|
E[F + q >>> 2] = b[q >>> 2];
|
|
4710
|
-
return this.sigBytes +=
|
|
4719
|
+
return this.sigBytes += _, this;
|
|
4711
4720
|
},
|
|
4712
4721
|
/**
|
|
4713
4722
|
* Removes insignificant bits.
|
|
@@ -4749,7 +4758,7 @@ function o0() {
|
|
|
4749
4758
|
random: function(g) {
|
|
4750
4759
|
for (var E = [], b = 0; b < g; b += 4)
|
|
4751
4760
|
E.push(o());
|
|
4752
|
-
return new
|
|
4761
|
+
return new d.init(E, g);
|
|
4753
4762
|
}
|
|
4754
4763
|
}), h = B.enc = {}, v = h.Hex = {
|
|
4755
4764
|
/**
|
|
@@ -4766,8 +4775,8 @@ function o0() {
|
|
|
4766
4775
|
* var hexString = CryptoJS.enc.Hex.stringify(wordArray);
|
|
4767
4776
|
*/
|
|
4768
4777
|
stringify: function(g) {
|
|
4769
|
-
for (var E = g.words, b = g.sigBytes, F = [],
|
|
4770
|
-
var S = E[
|
|
4778
|
+
for (var E = g.words, b = g.sigBytes, F = [], _ = 0; _ < b; _++) {
|
|
4779
|
+
var S = E[_ >>> 2] >>> 24 - _ % 4 * 8 & 255;
|
|
4771
4780
|
F.push((S >>> 4).toString(16)), F.push((S & 15).toString(16));
|
|
4772
4781
|
}
|
|
4773
4782
|
return F.join("");
|
|
@@ -4788,7 +4797,7 @@ function o0() {
|
|
|
4788
4797
|
parse: function(g) {
|
|
4789
4798
|
for (var E = g.length, b = [], F = 0; F < E; F += 2)
|
|
4790
4799
|
b[F >>> 3] |= parseInt(g.substr(F, 2), 16) << 24 - F % 8 * 4;
|
|
4791
|
-
return new
|
|
4800
|
+
return new d.init(b, E / 2);
|
|
4792
4801
|
}
|
|
4793
4802
|
}, f = h.Latin1 = {
|
|
4794
4803
|
/**
|
|
@@ -4805,8 +4814,8 @@ function o0() {
|
|
|
4805
4814
|
* var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);
|
|
4806
4815
|
*/
|
|
4807
4816
|
stringify: function(g) {
|
|
4808
|
-
for (var E = g.words, b = g.sigBytes, F = [],
|
|
4809
|
-
var S = E[
|
|
4817
|
+
for (var E = g.words, b = g.sigBytes, F = [], _ = 0; _ < b; _++) {
|
|
4818
|
+
var S = E[_ >>> 2] >>> 24 - _ % 4 * 8 & 255;
|
|
4810
4819
|
F.push(String.fromCharCode(S));
|
|
4811
4820
|
}
|
|
4812
4821
|
return F.join("");
|
|
@@ -4827,7 +4836,7 @@ function o0() {
|
|
|
4827
4836
|
parse: function(g) {
|
|
4828
4837
|
for (var E = g.length, b = [], F = 0; F < E; F++)
|
|
4829
4838
|
b[F >>> 2] |= (g.charCodeAt(F) & 255) << 24 - F % 4 * 8;
|
|
4830
|
-
return new
|
|
4839
|
+
return new d.init(b, E);
|
|
4831
4840
|
}
|
|
4832
4841
|
}, l = h.Utf8 = {
|
|
4833
4842
|
/**
|
|
@@ -4875,7 +4884,7 @@ function o0() {
|
|
|
4875
4884
|
* bufferedBlockAlgorithm.reset();
|
|
4876
4885
|
*/
|
|
4877
4886
|
reset: function() {
|
|
4878
|
-
this._data = new
|
|
4887
|
+
this._data = new d.init(), this._nDataBytes = 0;
|
|
4879
4888
|
},
|
|
4880
4889
|
/**
|
|
4881
4890
|
* Adds new data to this block algorithm's buffer.
|
|
@@ -4905,15 +4914,15 @@ function o0() {
|
|
|
4905
4914
|
* var processedData = bufferedBlockAlgorithm._process(!!'flush');
|
|
4906
4915
|
*/
|
|
4907
4916
|
_process: function(g) {
|
|
4908
|
-
var E, b = this._data, F = b.words,
|
|
4917
|
+
var E, b = this._data, F = b.words, _ = b.sigBytes, S = this.blockSize, R = S * 4, q = _ / R;
|
|
4909
4918
|
g ? q = n.ceil(q) : q = n.max((q | 0) - this._minBufferSize, 0);
|
|
4910
|
-
var w = q * S,
|
|
4919
|
+
var w = q * S, C = n.min(w * 4, _);
|
|
4911
4920
|
if (w) {
|
|
4912
4921
|
for (var N = 0; N < w; N += S)
|
|
4913
4922
|
this._doProcessBlock(F, N);
|
|
4914
|
-
E = F.splice(0, w), b.sigBytes -=
|
|
4923
|
+
E = F.splice(0, w), b.sigBytes -= C;
|
|
4915
4924
|
}
|
|
4916
|
-
return new
|
|
4925
|
+
return new d.init(E, C);
|
|
4917
4926
|
},
|
|
4918
4927
|
/**
|
|
4919
4928
|
* Creates a copy of this object.
|
|
@@ -5248,11 +5257,11 @@ function Lr() {
|
|
|
5248
5257
|
* var x32WordArray = x64WordArray.toX32();
|
|
5249
5258
|
*/
|
|
5250
5259
|
toX32: function() {
|
|
5251
|
-
for (var c = this.words, x = c.length,
|
|
5260
|
+
for (var c = this.words, x = c.length, d = [], h = 0; h < x; h++) {
|
|
5252
5261
|
var v = c[h];
|
|
5253
|
-
|
|
5262
|
+
d.push(v.high), d.push(v.low);
|
|
5254
5263
|
}
|
|
5255
|
-
return a.create(
|
|
5264
|
+
return a.create(d, this.sigBytes);
|
|
5256
5265
|
},
|
|
5257
5266
|
/**
|
|
5258
5267
|
* Creates a copy of this word array.
|
|
@@ -5264,7 +5273,7 @@ function Lr() {
|
|
|
5264
5273
|
* var clone = x64WordArray.clone();
|
|
5265
5274
|
*/
|
|
5266
5275
|
clone: function() {
|
|
5267
|
-
for (var c = o.clone.call(this), x = c.words = this.words.slice(0),
|
|
5276
|
+
for (var c = o.clone.call(this), x = c.words = this.words.slice(0), d = x.length, h = 0; h < d; h++)
|
|
5268
5277
|
x[h] = x[h].clone();
|
|
5269
5278
|
return c;
|
|
5270
5279
|
}
|
|
@@ -5290,8 +5299,8 @@ function iu() {
|
|
|
5290
5299
|
if (typeof ArrayBuffer == "function") {
|
|
5291
5300
|
var n = r, s = n.lib, i = s.WordArray, o = i.init, a = i.init = function(B) {
|
|
5292
5301
|
if (B instanceof ArrayBuffer && (B = new Uint8Array(B)), (B instanceof Int8Array || typeof Uint8ClampedArray < "u" && B instanceof Uint8ClampedArray || B instanceof Int16Array || B instanceof Uint16Array || B instanceof Int32Array || B instanceof Uint32Array || B instanceof Float32Array || B instanceof Float64Array) && (B = new Uint8Array(B.buffer, B.byteOffset, B.byteLength)), B instanceof Uint8Array) {
|
|
5293
|
-
for (var c = B.byteLength, x = [],
|
|
5294
|
-
x[
|
|
5302
|
+
for (var c = B.byteLength, x = [], d = 0; d < c; d++)
|
|
5303
|
+
x[d >>> 2] |= B[d] << 24 - d % 4 * 8;
|
|
5295
5304
|
o.call(this, x, c);
|
|
5296
5305
|
} else
|
|
5297
5306
|
o.apply(this, arguments);
|
|
@@ -5332,11 +5341,11 @@ function au() {
|
|
|
5332
5341
|
* var utf16String = CryptoJS.enc.Utf16.stringify(wordArray);
|
|
5333
5342
|
*/
|
|
5334
5343
|
stringify: function(B) {
|
|
5335
|
-
for (var c = B.words, x = B.sigBytes,
|
|
5344
|
+
for (var c = B.words, x = B.sigBytes, d = [], h = 0; h < x; h += 2) {
|
|
5336
5345
|
var v = c[h >>> 2] >>> 16 - h % 4 * 8 & 65535;
|
|
5337
|
-
|
|
5346
|
+
d.push(String.fromCharCode(v));
|
|
5338
5347
|
}
|
|
5339
|
-
return
|
|
5348
|
+
return d.join("");
|
|
5340
5349
|
},
|
|
5341
5350
|
/**
|
|
5342
5351
|
* Converts a UTF-16 BE string to a word array.
|
|
@@ -5352,8 +5361,8 @@ function au() {
|
|
|
5352
5361
|
* var wordArray = CryptoJS.enc.Utf16.parse(utf16String);
|
|
5353
5362
|
*/
|
|
5354
5363
|
parse: function(B) {
|
|
5355
|
-
for (var c = B.length, x = [],
|
|
5356
|
-
x[
|
|
5364
|
+
for (var c = B.length, x = [], d = 0; d < c; d++)
|
|
5365
|
+
x[d >>> 1] |= B.charCodeAt(d) << 16 - d % 2 * 16;
|
|
5357
5366
|
return i.create(x, c * 2);
|
|
5358
5367
|
}
|
|
5359
5368
|
}, o.Utf16LE = {
|
|
@@ -5371,11 +5380,11 @@ function au() {
|
|
|
5371
5380
|
* var utf16Str = CryptoJS.enc.Utf16LE.stringify(wordArray);
|
|
5372
5381
|
*/
|
|
5373
5382
|
stringify: function(B) {
|
|
5374
|
-
for (var c = B.words, x = B.sigBytes,
|
|
5383
|
+
for (var c = B.words, x = B.sigBytes, d = [], h = 0; h < x; h += 2) {
|
|
5375
5384
|
var v = a(c[h >>> 2] >>> 16 - h % 4 * 8 & 65535);
|
|
5376
|
-
|
|
5385
|
+
d.push(String.fromCharCode(v));
|
|
5377
5386
|
}
|
|
5378
|
-
return
|
|
5387
|
+
return d.join("");
|
|
5379
5388
|
},
|
|
5380
5389
|
/**
|
|
5381
5390
|
* Converts a UTF-16 LE string to a word array.
|
|
@@ -5391,8 +5400,8 @@ function au() {
|
|
|
5391
5400
|
* var wordArray = CryptoJS.enc.Utf16LE.parse(utf16Str);
|
|
5392
5401
|
*/
|
|
5393
5402
|
parse: function(B) {
|
|
5394
|
-
for (var c = B.length, x = [],
|
|
5395
|
-
x[
|
|
5403
|
+
for (var c = B.length, x = [], d = 0; d < c; d++)
|
|
5404
|
+
x[d >>> 1] |= a(B.charCodeAt(d) << 16 - d % 2 * 16);
|
|
5396
5405
|
return i.create(x, c * 2);
|
|
5397
5406
|
}
|
|
5398
5407
|
};
|
|
@@ -5433,12 +5442,12 @@ function $t() {
|
|
|
5433
5442
|
* var base64String = CryptoJS.enc.Base64.stringify(wordArray);
|
|
5434
5443
|
*/
|
|
5435
5444
|
stringify: function(B) {
|
|
5436
|
-
var c = B.words, x = B.sigBytes,
|
|
5445
|
+
var c = B.words, x = B.sigBytes, d = this._map;
|
|
5437
5446
|
B.clamp();
|
|
5438
5447
|
for (var h = [], v = 0; v < x; v += 3)
|
|
5439
5448
|
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++)
|
|
5440
|
-
h.push(
|
|
5441
|
-
var E =
|
|
5449
|
+
h.push(d.charAt(A >>> 6 * (3 - g) & 63));
|
|
5450
|
+
var E = d.charAt(64);
|
|
5442
5451
|
if (E)
|
|
5443
5452
|
for (; h.length % 4; )
|
|
5444
5453
|
h.push(E);
|
|
@@ -5458,28 +5467,28 @@ function $t() {
|
|
|
5458
5467
|
* var wordArray = CryptoJS.enc.Base64.parse(base64String);
|
|
5459
5468
|
*/
|
|
5460
5469
|
parse: function(B) {
|
|
5461
|
-
var c = B.length, x = this._map,
|
|
5462
|
-
if (!
|
|
5463
|
-
|
|
5470
|
+
var c = B.length, x = this._map, d = this._reverseMap;
|
|
5471
|
+
if (!d) {
|
|
5472
|
+
d = this._reverseMap = [];
|
|
5464
5473
|
for (var h = 0; h < x.length; h++)
|
|
5465
|
-
|
|
5474
|
+
d[x.charCodeAt(h)] = h;
|
|
5466
5475
|
}
|
|
5467
5476
|
var v = x.charAt(64);
|
|
5468
5477
|
if (v) {
|
|
5469
5478
|
var f = B.indexOf(v);
|
|
5470
5479
|
f !== -1 && (c = f);
|
|
5471
5480
|
}
|
|
5472
|
-
return a(B, c,
|
|
5481
|
+
return a(B, c, d);
|
|
5473
5482
|
},
|
|
5474
5483
|
_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
|
|
5475
5484
|
};
|
|
5476
5485
|
function a(B, c, x) {
|
|
5477
|
-
for (var
|
|
5486
|
+
for (var d = [], h = 0, v = 0; v < c; v++)
|
|
5478
5487
|
if (v % 4) {
|
|
5479
5488
|
var f = x[B.charCodeAt(v - 1)] << v % 4 * 2, l = x[B.charCodeAt(v)] >>> 6 - v % 4 * 2, y = f | l;
|
|
5480
|
-
|
|
5489
|
+
d[h >>> 2] |= y << 24 - h % 4 * 8, h++;
|
|
5481
5490
|
}
|
|
5482
|
-
return i.create(
|
|
5491
|
+
return i.create(d, h);
|
|
5483
5492
|
}
|
|
5484
5493
|
}(), r.enc.Base64;
|
|
5485
5494
|
});
|
|
@@ -5518,10 +5527,10 @@ function fu() {
|
|
|
5518
5527
|
*/
|
|
5519
5528
|
stringify: function(B, c) {
|
|
5520
5529
|
c === void 0 && (c = !0);
|
|
5521
|
-
var x = B.words,
|
|
5530
|
+
var x = B.words, d = B.sigBytes, h = c ? this._safe_map : this._map;
|
|
5522
5531
|
B.clamp();
|
|
5523
|
-
for (var v = [], f = 0; f <
|
|
5524
|
-
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 <
|
|
5532
|
+
for (var v = [], f = 0; f < d; f += 3)
|
|
5533
|
+
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++)
|
|
5525
5534
|
v.push(h.charAt(g >>> 6 * (3 - E) & 63));
|
|
5526
5535
|
var b = h.charAt(64);
|
|
5527
5536
|
if (b)
|
|
@@ -5546,13 +5555,13 @@ function fu() {
|
|
|
5546
5555
|
*/
|
|
5547
5556
|
parse: function(B, c) {
|
|
5548
5557
|
c === void 0 && (c = !0);
|
|
5549
|
-
var x = B.length,
|
|
5558
|
+
var x = B.length, d = c ? this._safe_map : this._map, h = this._reverseMap;
|
|
5550
5559
|
if (!h) {
|
|
5551
5560
|
h = this._reverseMap = [];
|
|
5552
|
-
for (var v = 0; v <
|
|
5553
|
-
h[
|
|
5561
|
+
for (var v = 0; v < d.length; v++)
|
|
5562
|
+
h[d.charCodeAt(v)] = v;
|
|
5554
5563
|
}
|
|
5555
|
-
var f =
|
|
5564
|
+
var f = d.charAt(64);
|
|
5556
5565
|
if (f) {
|
|
5557
5566
|
var l = B.indexOf(f);
|
|
5558
5567
|
l !== -1 && (x = l);
|
|
@@ -5563,12 +5572,12 @@ function fu() {
|
|
|
5563
5572
|
_safe_map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
|
|
5564
5573
|
};
|
|
5565
5574
|
function a(B, c, x) {
|
|
5566
|
-
for (var
|
|
5575
|
+
for (var d = [], h = 0, v = 0; v < c; v++)
|
|
5567
5576
|
if (v % 4) {
|
|
5568
5577
|
var f = x[B.charCodeAt(v - 1)] << v % 4 * 2, l = x[B.charCodeAt(v)] >>> 6 - v % 4 * 2, y = f | l;
|
|
5569
|
-
|
|
5578
|
+
d[h >>> 2] |= y << 24 - h % 4 * 8, h++;
|
|
5570
5579
|
}
|
|
5571
|
-
return i.create(
|
|
5580
|
+
return i.create(d, h);
|
|
5572
5581
|
}
|
|
5573
5582
|
}(), r.enc.Base64url;
|
|
5574
5583
|
});
|
|
@@ -5607,17 +5616,17 @@ function Mt() {
|
|
|
5607
5616
|
var g = y + A, E = l[g];
|
|
5608
5617
|
l[g] = (E << 8 | E >>> 24) & 16711935 | (E << 24 | E >>> 8) & 4278255360;
|
|
5609
5618
|
}
|
|
5610
|
-
var b = this._hash.words, F = l[y + 0],
|
|
5611
|
-
O =
|
|
5619
|
+
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];
|
|
5620
|
+
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;
|
|
5612
5621
|
},
|
|
5613
5622
|
_doFinalize: function() {
|
|
5614
5623
|
var l = this._data, y = l.words, A = this._nDataBytes * 8, g = l.sigBytes * 8;
|
|
5615
5624
|
y[g >>> 5] |= 128 << 24 - g % 32;
|
|
5616
5625
|
var E = n.floor(A / 4294967296), b = A;
|
|
5617
5626
|
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();
|
|
5618
|
-
for (var F = this._hash,
|
|
5619
|
-
var R =
|
|
5620
|
-
|
|
5627
|
+
for (var F = this._hash, _ = F.words, S = 0; S < 4; S++) {
|
|
5628
|
+
var R = _[S];
|
|
5629
|
+
_[S] = (R << 8 | R >>> 24) & 16711935 | (R << 24 | R >>> 8) & 4278255360;
|
|
5621
5630
|
}
|
|
5622
5631
|
return F;
|
|
5623
5632
|
},
|
|
@@ -5626,21 +5635,21 @@ function Mt() {
|
|
|
5626
5635
|
return l._hash = this._hash.clone(), l;
|
|
5627
5636
|
}
|
|
5628
5637
|
});
|
|
5629
|
-
function
|
|
5630
|
-
var
|
|
5631
|
-
return (
|
|
5638
|
+
function d(l, y, A, g, E, b, F) {
|
|
5639
|
+
var _ = l + (y & A | ~y & g) + E + F;
|
|
5640
|
+
return (_ << b | _ >>> 32 - b) + y;
|
|
5632
5641
|
}
|
|
5633
5642
|
function h(l, y, A, g, E, b, F) {
|
|
5634
|
-
var
|
|
5635
|
-
return (
|
|
5643
|
+
var _ = l + (y & g | A & ~g) + E + F;
|
|
5644
|
+
return (_ << b | _ >>> 32 - b) + y;
|
|
5636
5645
|
}
|
|
5637
5646
|
function v(l, y, A, g, E, b, F) {
|
|
5638
|
-
var
|
|
5639
|
-
return (
|
|
5647
|
+
var _ = l + (y ^ A ^ g) + E + F;
|
|
5648
|
+
return (_ << b | _ >>> 32 - b) + y;
|
|
5640
5649
|
}
|
|
5641
5650
|
function f(l, y, A, g, E, b, F) {
|
|
5642
|
-
var
|
|
5643
|
-
return (
|
|
5651
|
+
var _ = l + (A ^ (y | ~g)) + E + F;
|
|
5652
|
+
return (_ << b | _ >>> 32 - b) + y;
|
|
5644
5653
|
}
|
|
5645
5654
|
s.MD5 = a._createHelper(x), s.HmacMD5 = a._createHmacHelper(x);
|
|
5646
5655
|
}(Math), r.MD5;
|
|
@@ -5671,10 +5680,10 @@ function Bo() {
|
|
|
5671
5680
|
3285377520
|
|
5672
5681
|
]);
|
|
5673
5682
|
},
|
|
5674
|
-
_doProcessBlock: function(x,
|
|
5683
|
+
_doProcessBlock: function(x, d) {
|
|
5675
5684
|
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++) {
|
|
5676
5685
|
if (g < 16)
|
|
5677
|
-
B[g] = x[
|
|
5686
|
+
B[g] = x[d + g] | 0;
|
|
5678
5687
|
else {
|
|
5679
5688
|
var E = B[g - 3] ^ B[g - 8] ^ B[g - 14] ^ B[g - 16];
|
|
5680
5689
|
B[g] = E << 1 | E >>> 31;
|
|
@@ -5685,8 +5694,8 @@ function Bo() {
|
|
|
5685
5694
|
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;
|
|
5686
5695
|
},
|
|
5687
5696
|
_doFinalize: function() {
|
|
5688
|
-
var x = this._data,
|
|
5689
|
-
return
|
|
5697
|
+
var x = this._data, d = x.words, h = this._nDataBytes * 8, v = x.sigBytes * 8;
|
|
5698
|
+
return d[v >>> 5] |= 128 << 24 - v % 32, d[(v + 64 >>> 9 << 4) + 14] = Math.floor(h / 4294967296), d[(v + 64 >>> 9 << 4) + 15] = h, x.sigBytes = d.length * 4, this._process(), this._hash;
|
|
5690
5699
|
},
|
|
5691
5700
|
clone: function() {
|
|
5692
5701
|
var x = o.clone.call(this);
|
|
@@ -5726,22 +5735,22 @@ function qn() {
|
|
|
5726
5735
|
for (var l = 2, y = 0; y < 64; )
|
|
5727
5736
|
v(l) && (y < 8 && (c[y] = f(n.pow(l, 1 / 2))), x[y] = f(n.pow(l, 1 / 3)), y++), l++;
|
|
5728
5737
|
})();
|
|
5729
|
-
var
|
|
5738
|
+
var d = [], h = B.SHA256 = a.extend({
|
|
5730
5739
|
_doReset: function() {
|
|
5731
5740
|
this._hash = new o.init(c.slice(0));
|
|
5732
5741
|
},
|
|
5733
5742
|
_doProcessBlock: function(v, f) {
|
|
5734
|
-
for (var l = this._hash.words, y = l[0], A = l[1], g = l[2], E = l[3], b = l[4], F = l[5],
|
|
5743
|
+
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++) {
|
|
5735
5744
|
if (R < 16)
|
|
5736
|
-
|
|
5745
|
+
d[R] = v[f + R] | 0;
|
|
5737
5746
|
else {
|
|
5738
|
-
var q =
|
|
5739
|
-
|
|
5747
|
+
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;
|
|
5748
|
+
d[R] = w + d[R - 7] + N + d[R - 16];
|
|
5740
5749
|
}
|
|
5741
|
-
var L = b & F ^ ~b &
|
|
5742
|
-
S =
|
|
5750
|
+
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;
|
|
5751
|
+
S = _, _ = F, F = b, b = E + l0 | 0, E = g, g = A, A = y, y = l0 + Y | 0;
|
|
5743
5752
|
}
|
|
5744
|
-
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] +
|
|
5753
|
+
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;
|
|
5745
5754
|
},
|
|
5746
5755
|
_doFinalize: function() {
|
|
5747
5756
|
var v = this._data, f = v.words, l = this._nDataBytes * 8, y = v.sigBytes * 8;
|
|
@@ -5812,7 +5821,7 @@ function go() {
|
|
|
5812
5821
|
function x() {
|
|
5813
5822
|
return a.create.apply(a, arguments);
|
|
5814
5823
|
}
|
|
5815
|
-
var
|
|
5824
|
+
var d = [
|
|
5816
5825
|
x(1116352408, 3609767458),
|
|
5817
5826
|
x(1899447441, 602891725),
|
|
5818
5827
|
x(3049323471, 3964484399),
|
|
@@ -5912,18 +5921,18 @@ function go() {
|
|
|
5912
5921
|
]);
|
|
5913
5922
|
},
|
|
5914
5923
|
_doProcessBlock: function(f, l) {
|
|
5915
|
-
for (var y = this._hash.words, A = y[0], g = y[1], E = y[2], b = y[3], F = y[4],
|
|
5916
|
-
var
|
|
5924
|
+
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, It = J, pt = r0, O0 = l0, w0 = Y, bt = h0, it = a0, vt = O, ot = z, jt = M, At = U, T = 0; T < 80; T++) {
|
|
5925
|
+
var H, k, K = h[T];
|
|
5917
5926
|
if (T < 16)
|
|
5918
|
-
k = K.high = f[l + T * 2] | 0,
|
|
5927
|
+
k = K.high = f[l + T * 2] | 0, H = K.low = f[l + T * 2 + 1] | 0;
|
|
5919
5928
|
else {
|
|
5920
5929
|
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), E0 = h[T - 2], g0 = E0.high, q0 = E0.low, Bt = (g0 >>> 19 | q0 << 13) ^ (g0 << 3 | q0 >>> 29) ^ g0 >>> 6, at = (q0 >>> 19 | g0 << 13) ^ (q0 << 3 | g0 >>> 29) ^ (q0 >>> 6 | g0 << 26), Wt = h[T - 7], ye = Wt.high, Ur = Wt.low, ne = h[T - 16], $r = ne.high, Ee = ne.low;
|
|
5921
|
-
|
|
5930
|
+
H = _0 + Ur, k = f0 + ye + (H >>> 0 < _0 >>> 0 ? 1 : 0), H = H + at, k = k + Bt + (H >>> 0 < at >>> 0 ? 1 : 0), H = H + Ee, k = k + $r + (H >>> 0 < Ee >>> 0 ? 1 : 0), K.high = k, K.low = H;
|
|
5922
5931
|
}
|
|
5923
|
-
var Mr = O0 & bt ^ ~O0 & vt, me = w0 & it ^ ~w0 & ot, jr = p0 & A0 ^ p0 & T0 ^ A0 & T0, Wr = d0 & e0 ^ d0 & st ^ e0 & st, Zr = (p0 >>> 28 | d0 << 4) ^ (p0 << 30 | d0 >>> 2) ^ (p0 << 25 | d0 >>> 7), be = (d0 >>> 28 | p0 << 4) ^ (d0 << 30 | p0 >>> 2) ^ (d0 << 25 | p0 >>> 7), Kr = (O0 >>> 14 | w0 << 18) ^ (O0 >>> 18 | w0 << 14) ^ (O0 << 23 | w0 >>> 9), Gr = (w0 >>> 14 | O0 << 18) ^ (w0 >>> 18 | O0 << 14) ^ (w0 << 23 | O0 >>> 9), Ae =
|
|
5924
|
-
jt = vt, At = ot, vt = bt, ot = it, bt = O0, it = w0, w0 = pt + P0 | 0, O0 =
|
|
5932
|
+
var Mr = O0 & bt ^ ~O0 & vt, me = w0 & it ^ ~w0 & ot, jr = p0 & A0 ^ p0 & T0 ^ A0 & T0, Wr = d0 & e0 ^ d0 & st ^ e0 & st, Zr = (p0 >>> 28 | d0 << 4) ^ (p0 << 30 | d0 >>> 2) ^ (p0 << 25 | d0 >>> 7), be = (d0 >>> 28 | p0 << 4) ^ (d0 << 30 | p0 >>> 2) ^ (d0 << 25 | p0 >>> 7), Kr = (O0 >>> 14 | w0 << 18) ^ (O0 >>> 18 | w0 << 14) ^ (O0 << 23 | w0 >>> 9), Gr = (w0 >>> 14 | O0 << 18) ^ (w0 >>> 18 | O0 << 14) ^ (w0 << 23 | O0 >>> 9), Ae = d[T], Xr = Ae.high, Fe = Ae.low, P0 = At + Gr, ct = jt + Kr + (P0 >>> 0 < At >>> 0 ? 1 : 0), P0 = P0 + me, ct = ct + Mr + (P0 >>> 0 < me >>> 0 ? 1 : 0), P0 = P0 + Fe, ct = ct + Xr + (P0 >>> 0 < Fe >>> 0 ? 1 : 0), P0 = P0 + H, ct = ct + k + (P0 >>> 0 < H >>> 0 ? 1 : 0), Ce = be + Wr, Qr = Zr + jr + (Ce >>> 0 < be >>> 0 ? 1 : 0);
|
|
5933
|
+
jt = vt, At = ot, vt = bt, ot = it, bt = O0, it = w0, w0 = pt + P0 | 0, O0 = It + ct + (w0 >>> 0 < pt >>> 0 ? 1 : 0) | 0, It = T0, pt = st, T0 = A0, st = e0, A0 = p0, e0 = d0, d0 = P0 + Ce | 0, p0 = ct + Qr + (d0 >>> 0 < P0 >>> 0 ? 1 : 0) | 0;
|
|
5925
5934
|
}
|
|
5926
|
-
w = A.low = w + d0, A.high = q + p0 + (w >>> 0 < d0 >>> 0 ? 1 : 0), N = g.low = N + e0, g.high =
|
|
5935
|
+
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 + It + (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 + jt + (U >>> 0 < At >>> 0 ? 1 : 0);
|
|
5927
5936
|
},
|
|
5928
5937
|
_doFinalize: function() {
|
|
5929
5938
|
var f = this._data, l = f.words, y = this._nDataBytes * 8, A = f.sigBytes * 8;
|
|
@@ -5993,17 +6002,17 @@ function Eu() {
|
|
|
5993
6002
|
t.exports = n(o0(), Lr());
|
|
5994
6003
|
})(s0, function(r) {
|
|
5995
6004
|
return function(n) {
|
|
5996
|
-
var s = r, i = s.lib, o = i.WordArray, a = i.Hasher, B = s.x64, c = B.Word, x = s.algo,
|
|
6005
|
+
var s = r, i = s.lib, o = i.WordArray, a = i.Hasher, B = s.x64, c = B.Word, x = s.algo, d = [], h = [], v = [];
|
|
5997
6006
|
(function() {
|
|
5998
6007
|
for (var y = 1, A = 0, g = 0; g < 24; g++) {
|
|
5999
|
-
|
|
6008
|
+
d[y + 5 * A] = (g + 1) * (g + 2) / 2 % 64;
|
|
6000
6009
|
var E = A % 5, b = (2 * y + 3 * A) % 5;
|
|
6001
6010
|
y = E, A = b;
|
|
6002
6011
|
}
|
|
6003
6012
|
for (var y = 0; y < 5; y++)
|
|
6004
6013
|
for (var A = 0; A < 5; A++)
|
|
6005
6014
|
h[y + 5 * A] = A + (2 * y + 3 * A) % 5 * 5;
|
|
6006
|
-
for (var F = 1,
|
|
6015
|
+
for (var F = 1, _ = 0; _ < 24; _++) {
|
|
6007
6016
|
for (var S = 0, R = 0, q = 0; q < 7; q++) {
|
|
6008
6017
|
if (F & 1) {
|
|
6009
6018
|
var w = (1 << q) - 1;
|
|
@@ -6011,7 +6020,7 @@ function Eu() {
|
|
|
6011
6020
|
}
|
|
6012
6021
|
F & 128 ? F = F << 1 ^ 113 : F <<= 1;
|
|
6013
6022
|
}
|
|
6014
|
-
v[
|
|
6023
|
+
v[_] = c.create(S, R);
|
|
6015
6024
|
}
|
|
6016
6025
|
})();
|
|
6017
6026
|
var f = [];
|
|
@@ -6038,30 +6047,30 @@ function Eu() {
|
|
|
6038
6047
|
},
|
|
6039
6048
|
_doProcessBlock: function(y, A) {
|
|
6040
6049
|
for (var g = this._state, E = this.blockSize / 2, b = 0; b < E; b++) {
|
|
6041
|
-
var F = y[A + 2 * b],
|
|
6042
|
-
F = (F << 8 | F >>> 24) & 16711935 | (F << 24 | F >>> 8) & 4278255360,
|
|
6050
|
+
var F = y[A + 2 * b], _ = y[A + 2 * b + 1];
|
|
6051
|
+
F = (F << 8 | F >>> 24) & 16711935 | (F << 24 | F >>> 8) & 4278255360, _ = (_ << 8 | _ >>> 24) & 16711935 | (_ << 24 | _ >>> 8) & 4278255360;
|
|
6043
6052
|
var S = g[b];
|
|
6044
|
-
S.high ^=
|
|
6053
|
+
S.high ^= _, S.low ^= F;
|
|
6045
6054
|
}
|
|
6046
6055
|
for (var R = 0; R < 24; R++) {
|
|
6047
6056
|
for (var q = 0; q < 5; q++) {
|
|
6048
|
-
for (var w = 0,
|
|
6057
|
+
for (var w = 0, C = 0, N = 0; N < 5; N++) {
|
|
6049
6058
|
var S = g[q + 5 * N];
|
|
6050
|
-
w ^= S.high,
|
|
6059
|
+
w ^= S.high, C ^= S.low;
|
|
6051
6060
|
}
|
|
6052
6061
|
var L = f[q];
|
|
6053
|
-
L.high = w, L.low =
|
|
6062
|
+
L.high = w, L.low = C;
|
|
6054
6063
|
}
|
|
6055
6064
|
for (var q = 0; q < 5; q++)
|
|
6056
|
-
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),
|
|
6065
|
+
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++) {
|
|
6057
6066
|
var S = g[q + 5 * N];
|
|
6058
|
-
S.high ^= w, S.low ^=
|
|
6067
|
+
S.high ^= w, S.low ^= C;
|
|
6059
6068
|
}
|
|
6060
6069
|
for (var Y = 1; Y < 25; Y++) {
|
|
6061
|
-
var w,
|
|
6062
|
-
O < 32 ? (w = h0 << O | a0 >>> 32 - O,
|
|
6070
|
+
var w, C, S = g[Y], h0 = S.high, a0 = S.low, O = d[Y];
|
|
6071
|
+
O < 32 ? (w = h0 << O | a0 >>> 32 - O, C = a0 << O | h0 >>> 32 - O) : (w = a0 << O - 32 | h0 >>> 64 - O, C = h0 << O - 32 | a0 >>> 64 - O);
|
|
6063
6072
|
var z = f[h[Y]];
|
|
6064
|
-
z.high = w, z.low =
|
|
6073
|
+
z.high = w, z.low = C;
|
|
6065
6074
|
}
|
|
6066
6075
|
var M = f[0], U = g[0];
|
|
6067
6076
|
M.high = U.high, M.low = U.low;
|
|
@@ -6079,9 +6088,9 @@ function Eu() {
|
|
|
6079
6088
|
this._nDataBytes * 8;
|
|
6080
6089
|
var g = y.sigBytes * 8, E = this.blockSize * 32;
|
|
6081
6090
|
A[g >>> 5] |= 1 << 24 - g % 32, A[(n.ceil((g + 1) / E) * E >>> 5) - 1] |= 128, y.sigBytes = A.length * 4, this._process();
|
|
6082
|
-
for (var b = this._state, F = this.cfg.outputLength / 8,
|
|
6083
|
-
var q = b[R], w = q.high,
|
|
6084
|
-
w = (w << 8 | w >>> 24) & 16711935 | (w << 24 | w >>> 8) & 4278255360,
|
|
6091
|
+
for (var b = this._state, F = this.cfg.outputLength / 8, _ = F / 8, S = [], R = 0; R < _; R++) {
|
|
6092
|
+
var q = b[R], w = q.high, C = q.low;
|
|
6093
|
+
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);
|
|
6085
6094
|
}
|
|
6086
6095
|
return new o.init(S, F);
|
|
6087
6096
|
},
|
|
@@ -6282,7 +6291,7 @@ function bu() {
|
|
|
6282
6291
|
3,
|
|
6283
6292
|
9,
|
|
6284
6293
|
11
|
|
6285
|
-
]),
|
|
6294
|
+
]), d = o.create([
|
|
6286
6295
|
11,
|
|
6287
6296
|
14,
|
|
6288
6297
|
15,
|
|
@@ -6448,48 +6457,48 @@ function bu() {
|
|
|
6448
6457
|
_doReset: function() {
|
|
6449
6458
|
this._hash = o.create([1732584193, 4023233417, 2562383102, 271733878, 3285377520]);
|
|
6450
6459
|
},
|
|
6451
|
-
_doProcessBlock: function(
|
|
6460
|
+
_doProcessBlock: function(_, S) {
|
|
6452
6461
|
for (var R = 0; R < 16; R++) {
|
|
6453
|
-
var q = S + R, w =
|
|
6454
|
-
|
|
6462
|
+
var q = S + R, w = _[q];
|
|
6463
|
+
_[q] = (w << 8 | w >>> 24) & 16711935 | (w << 24 | w >>> 8) & 4278255360;
|
|
6455
6464
|
}
|
|
6456
|
-
var
|
|
6457
|
-
M = Y =
|
|
6465
|
+
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;
|
|
6466
|
+
M = Y = C[0], U = h0 = C[1], p0 = a0 = C[2], d0 = O = C[3], A0 = z = C[4];
|
|
6458
6467
|
for (var e0, R = 0; R < 80; R += 1)
|
|
6459
|
-
e0 = Y +
|
|
6460
|
-
e0 =
|
|
6468
|
+
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;
|
|
6469
|
+
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;
|
|
6461
6470
|
},
|
|
6462
6471
|
_doFinalize: function() {
|
|
6463
|
-
var
|
|
6464
|
-
S[q >>> 5] |= 128 << 24 - q % 32, S[(q + 64 >>> 9 << 4) + 14] = (R << 8 | R >>> 24) & 16711935 | (R << 24 | R >>> 8) & 4278255360,
|
|
6465
|
-
for (var w = this._hash,
|
|
6466
|
-
var L =
|
|
6467
|
-
|
|
6472
|
+
var _ = this._data, S = _.words, R = this._nDataBytes * 8, q = _.sigBytes * 8;
|
|
6473
|
+
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();
|
|
6474
|
+
for (var w = this._hash, C = w.words, N = 0; N < 5; N++) {
|
|
6475
|
+
var L = C[N];
|
|
6476
|
+
C[N] = (L << 8 | L >>> 24) & 16711935 | (L << 24 | L >>> 8) & 4278255360;
|
|
6468
6477
|
}
|
|
6469
6478
|
return w;
|
|
6470
6479
|
},
|
|
6471
6480
|
clone: function() {
|
|
6472
|
-
var
|
|
6473
|
-
return
|
|
6481
|
+
var _ = a.clone.call(this);
|
|
6482
|
+
return _._hash = this._hash.clone(), _;
|
|
6474
6483
|
}
|
|
6475
6484
|
});
|
|
6476
|
-
function y(
|
|
6477
|
-
return
|
|
6485
|
+
function y(_, S, R) {
|
|
6486
|
+
return _ ^ S ^ R;
|
|
6478
6487
|
}
|
|
6479
|
-
function A(
|
|
6480
|
-
return
|
|
6488
|
+
function A(_, S, R) {
|
|
6489
|
+
return _ & S | ~_ & R;
|
|
6481
6490
|
}
|
|
6482
|
-
function g(
|
|
6483
|
-
return (
|
|
6491
|
+
function g(_, S, R) {
|
|
6492
|
+
return (_ | ~S) ^ R;
|
|
6484
6493
|
}
|
|
6485
|
-
function E(
|
|
6486
|
-
return
|
|
6494
|
+
function E(_, S, R) {
|
|
6495
|
+
return _ & R | S & ~R;
|
|
6487
6496
|
}
|
|
6488
|
-
function b(
|
|
6489
|
-
return
|
|
6497
|
+
function b(_, S, R) {
|
|
6498
|
+
return _ ^ (S | ~R);
|
|
6490
6499
|
}
|
|
6491
|
-
function F(
|
|
6492
|
-
return
|
|
6500
|
+
function F(_, S) {
|
|
6501
|
+
return _ << S | _ >>> 32 - S;
|
|
6493
6502
|
}
|
|
6494
6503
|
s.RIPEMD160 = a._createHelper(l), s.HmacRIPEMD160 = a._createHmacHelper(l);
|
|
6495
6504
|
}(), r.RIPEMD160;
|
|
@@ -6524,9 +6533,9 @@ function Nn() {
|
|
|
6524
6533
|
*/
|
|
6525
6534
|
init: function(c, x) {
|
|
6526
6535
|
c = this._hasher = new c.init(), typeof x == "string" && (x = a.parse(x));
|
|
6527
|
-
var
|
|
6536
|
+
var d = c.blockSize, h = d * 4;
|
|
6528
6537
|
x.sigBytes > h && (x = c.finalize(x)), x.clamp();
|
|
6529
|
-
for (var v = this._oKey = x.clone(), f = this._iKey = x.clone(), l = v.words, y = f.words, A = 0; A <
|
|
6538
|
+
for (var v = this._oKey = x.clone(), f = this._iKey = x.clone(), l = v.words, y = f.words, A = 0; A < d; A++)
|
|
6530
6539
|
l[A] ^= 1549556828, y[A] ^= 909522486;
|
|
6531
6540
|
v.sigBytes = f.sigBytes = h, this.reset();
|
|
6532
6541
|
},
|
|
@@ -6571,9 +6580,9 @@ function Nn() {
|
|
|
6571
6580
|
* var hmac = hmacHasher.finalize(wordArray);
|
|
6572
6581
|
*/
|
|
6573
6582
|
finalize: function(c) {
|
|
6574
|
-
var x = this._hasher,
|
|
6583
|
+
var x = this._hasher, d = x.finalize(c);
|
|
6575
6584
|
x.reset();
|
|
6576
|
-
var h = x.finalize(this._oKey.clone().concat(
|
|
6585
|
+
var h = x.finalize(this._oKey.clone().concat(d));
|
|
6577
6586
|
return h;
|
|
6578
6587
|
}
|
|
6579
6588
|
});
|
|
@@ -6619,8 +6628,8 @@ function Cu() {
|
|
|
6619
6628
|
* var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8 });
|
|
6620
6629
|
* var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8, iterations: 1000 });
|
|
6621
6630
|
*/
|
|
6622
|
-
init: function(
|
|
6623
|
-
this.cfg = this.cfg.extend(
|
|
6631
|
+
init: function(d) {
|
|
6632
|
+
this.cfg = this.cfg.extend(d);
|
|
6624
6633
|
},
|
|
6625
6634
|
/**
|
|
6626
6635
|
* Computes the Password-Based Key Derivation Function 2.
|
|
@@ -6634,22 +6643,22 @@ function Cu() {
|
|
|
6634
6643
|
*
|
|
6635
6644
|
* var key = kdf.compute(password, salt);
|
|
6636
6645
|
*/
|
|
6637
|
-
compute: function(
|
|
6638
|
-
for (var v = this.cfg, f = c.create(v.hasher,
|
|
6646
|
+
compute: function(d, h) {
|
|
6647
|
+
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; ) {
|
|
6639
6648
|
var F = f.update(h).finalize(y);
|
|
6640
6649
|
f.reset();
|
|
6641
|
-
for (var
|
|
6650
|
+
for (var _ = F.words, S = _.length, R = F, q = 1; q < b; q++) {
|
|
6642
6651
|
R = f.finalize(R), f.reset();
|
|
6643
|
-
for (var w = R.words,
|
|
6644
|
-
C
|
|
6652
|
+
for (var w = R.words, C = 0; C < S; C++)
|
|
6653
|
+
_[C] ^= w[C];
|
|
6645
6654
|
}
|
|
6646
6655
|
l.concat(F), g[0]++;
|
|
6647
6656
|
}
|
|
6648
6657
|
return l.sigBytes = E * 4, l;
|
|
6649
6658
|
}
|
|
6650
6659
|
});
|
|
6651
|
-
n.PBKDF2 = function(
|
|
6652
|
-
return x.create(v).compute(
|
|
6660
|
+
n.PBKDF2 = function(d, h, v) {
|
|
6661
|
+
return x.create(v).compute(d, h);
|
|
6653
6662
|
};
|
|
6654
6663
|
}(), r.PBKDF2;
|
|
6655
6664
|
});
|
|
@@ -6662,9 +6671,9 @@ var cr = {}, Du = {
|
|
|
6662
6671
|
set exports(t) {
|
|
6663
6672
|
cr = t;
|
|
6664
6673
|
}
|
|
6665
|
-
},
|
|
6666
|
-
function
|
|
6667
|
-
return
|
|
6674
|
+
}, Hs;
|
|
6675
|
+
function Ht() {
|
|
6676
|
+
return Hs || (Hs = 1, function(t, e) {
|
|
6668
6677
|
(function(r, n, s) {
|
|
6669
6678
|
t.exports = n(o0(), Bo(), Nn());
|
|
6670
6679
|
})(s0, function(r) {
|
|
@@ -6708,9 +6717,9 @@ function It() {
|
|
|
6708
6717
|
*
|
|
6709
6718
|
* var key = kdf.compute(password, salt);
|
|
6710
6719
|
*/
|
|
6711
|
-
compute: function(x,
|
|
6720
|
+
compute: function(x, d) {
|
|
6712
6721
|
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; ) {
|
|
6713
|
-
h && f.update(h), h = f.update(x).finalize(
|
|
6722
|
+
h && f.update(h), h = f.update(x).finalize(d), f.reset();
|
|
6714
6723
|
for (var E = 1; E < g; E++)
|
|
6715
6724
|
h = f.finalize(h), f.reset();
|
|
6716
6725
|
l.concat(h);
|
|
@@ -6718,8 +6727,8 @@ function It() {
|
|
|
6718
6727
|
return l.sigBytes = A * 4, l;
|
|
6719
6728
|
}
|
|
6720
6729
|
});
|
|
6721
|
-
n.EvpKDF = function(x,
|
|
6722
|
-
return c.create(h).compute(x,
|
|
6730
|
+
n.EvpKDF = function(x, d, h) {
|
|
6731
|
+
return c.create(h).compute(x, d);
|
|
6723
6732
|
};
|
|
6724
6733
|
}(), r.EvpKDF;
|
|
6725
6734
|
});
|
|
@@ -6732,16 +6741,16 @@ var xr = {}, wu = {
|
|
|
6732
6741
|
set exports(t) {
|
|
6733
6742
|
xr = t;
|
|
6734
6743
|
}
|
|
6735
|
-
},
|
|
6744
|
+
}, Is;
|
|
6736
6745
|
function D0() {
|
|
6737
|
-
return
|
|
6746
|
+
return Is || (Is = 1, function(t, e) {
|
|
6738
6747
|
(function(r, n, s) {
|
|
6739
|
-
t.exports = n(o0(),
|
|
6748
|
+
t.exports = n(o0(), Ht());
|
|
6740
6749
|
})(s0, function(r) {
|
|
6741
6750
|
r.lib.Cipher || function(n) {
|
|
6742
6751
|
var s = r, i = s.lib, o = i.Base, a = i.WordArray, B = i.BufferedBlockAlgorithm, c = s.enc;
|
|
6743
6752
|
c.Utf8;
|
|
6744
|
-
var x = c.Base64,
|
|
6753
|
+
var x = c.Base64, d = s.algo, h = d.EvpKDF, v = i.Cipher = B.extend({
|
|
6745
6754
|
/**
|
|
6746
6755
|
* Configuration options.
|
|
6747
6756
|
*
|
|
@@ -6762,8 +6771,8 @@ function D0() {
|
|
|
6762
6771
|
*
|
|
6763
6772
|
* var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray });
|
|
6764
6773
|
*/
|
|
6765
|
-
createEncryptor: function(w,
|
|
6766
|
-
return this.create(this._ENC_XFORM_MODE, w,
|
|
6774
|
+
createEncryptor: function(w, C) {
|
|
6775
|
+
return this.create(this._ENC_XFORM_MODE, w, C);
|
|
6767
6776
|
},
|
|
6768
6777
|
/**
|
|
6769
6778
|
* Creates this cipher in decryption mode.
|
|
@@ -6779,8 +6788,8 @@ function D0() {
|
|
|
6779
6788
|
*
|
|
6780
6789
|
* var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray });
|
|
6781
6790
|
*/
|
|
6782
|
-
createDecryptor: function(w,
|
|
6783
|
-
return this.create(this._DEC_XFORM_MODE, w,
|
|
6791
|
+
createDecryptor: function(w, C) {
|
|
6792
|
+
return this.create(this._DEC_XFORM_MODE, w, C);
|
|
6784
6793
|
},
|
|
6785
6794
|
/**
|
|
6786
6795
|
* Initializes a newly created cipher.
|
|
@@ -6793,8 +6802,8 @@ function D0() {
|
|
|
6793
6802
|
*
|
|
6794
6803
|
* var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray });
|
|
6795
6804
|
*/
|
|
6796
|
-
init: function(w,
|
|
6797
|
-
this.cfg = this.cfg.extend(N), this._xformMode = w, this._key =
|
|
6805
|
+
init: function(w, C, N) {
|
|
6806
|
+
this.cfg = this.cfg.extend(N), this._xformMode = w, this._key = C, this.reset();
|
|
6798
6807
|
},
|
|
6799
6808
|
/**
|
|
6800
6809
|
* Resets this cipher to its initial state.
|
|
@@ -6837,8 +6846,8 @@ function D0() {
|
|
|
6837
6846
|
*/
|
|
6838
6847
|
finalize: function(w) {
|
|
6839
6848
|
w && this._append(w);
|
|
6840
|
-
var
|
|
6841
|
-
return
|
|
6849
|
+
var C = this._doFinalize();
|
|
6850
|
+
return C;
|
|
6842
6851
|
},
|
|
6843
6852
|
keySize: 128 / 32,
|
|
6844
6853
|
ivSize: 128 / 32,
|
|
@@ -6858,16 +6867,16 @@ function D0() {
|
|
|
6858
6867
|
* var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES);
|
|
6859
6868
|
*/
|
|
6860
6869
|
_createHelper: function() {
|
|
6861
|
-
function w(
|
|
6862
|
-
return typeof
|
|
6870
|
+
function w(C) {
|
|
6871
|
+
return typeof C == "string" ? q : _;
|
|
6863
6872
|
}
|
|
6864
|
-
return function(
|
|
6873
|
+
return function(C) {
|
|
6865
6874
|
return {
|
|
6866
6875
|
encrypt: function(N, L, Q) {
|
|
6867
|
-
return w(L).encrypt(
|
|
6876
|
+
return w(L).encrypt(C, N, L, Q);
|
|
6868
6877
|
},
|
|
6869
6878
|
decrypt: function(N, L, Q) {
|
|
6870
|
-
return w(L).decrypt(
|
|
6879
|
+
return w(L).decrypt(C, N, L, Q);
|
|
6871
6880
|
}
|
|
6872
6881
|
};
|
|
6873
6882
|
};
|
|
@@ -6893,8 +6902,8 @@ function D0() {
|
|
|
6893
6902
|
*
|
|
6894
6903
|
* var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words);
|
|
6895
6904
|
*/
|
|
6896
|
-
createEncryptor: function(w,
|
|
6897
|
-
return this.Encryptor.create(w,
|
|
6905
|
+
createEncryptor: function(w, C) {
|
|
6906
|
+
return this.Encryptor.create(w, C);
|
|
6898
6907
|
},
|
|
6899
6908
|
/**
|
|
6900
6909
|
* Creates this mode for decryption.
|
|
@@ -6908,8 +6917,8 @@ function D0() {
|
|
|
6908
6917
|
*
|
|
6909
6918
|
* var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words);
|
|
6910
6919
|
*/
|
|
6911
|
-
createDecryptor: function(w,
|
|
6912
|
-
return this.Decryptor.create(w,
|
|
6920
|
+
createDecryptor: function(w, C) {
|
|
6921
|
+
return this.Decryptor.create(w, C);
|
|
6913
6922
|
},
|
|
6914
6923
|
/**
|
|
6915
6924
|
* Initializes a newly created mode.
|
|
@@ -6921,8 +6930,8 @@ function D0() {
|
|
|
6921
6930
|
*
|
|
6922
6931
|
* var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words);
|
|
6923
6932
|
*/
|
|
6924
|
-
init: function(w,
|
|
6925
|
-
this._cipher = w, this._iv =
|
|
6933
|
+
init: function(w, C) {
|
|
6934
|
+
this._cipher = w, this._iv = C;
|
|
6926
6935
|
}
|
|
6927
6936
|
}), y = f.CBC = function() {
|
|
6928
6937
|
var w = l.extend();
|
|
@@ -6939,7 +6948,7 @@ function D0() {
|
|
|
6939
6948
|
*/
|
|
6940
6949
|
processBlock: function(N, L) {
|
|
6941
6950
|
var Q = this._cipher, J = Q.blockSize;
|
|
6942
|
-
|
|
6951
|
+
C.call(this, N, L, J), Q.encryptBlock(N, L), this._prevBlock = N.slice(L, L + J);
|
|
6943
6952
|
}
|
|
6944
6953
|
}), w.Decryptor = w.extend({
|
|
6945
6954
|
/**
|
|
@@ -6954,10 +6963,10 @@ function D0() {
|
|
|
6954
6963
|
*/
|
|
6955
6964
|
processBlock: function(N, L) {
|
|
6956
6965
|
var Q = this._cipher, J = Q.blockSize, r0 = N.slice(L, L + J);
|
|
6957
|
-
Q.decryptBlock(N, L),
|
|
6966
|
+
Q.decryptBlock(N, L), C.call(this, N, L, J), this._prevBlock = r0;
|
|
6958
6967
|
}
|
|
6959
6968
|
});
|
|
6960
|
-
function
|
|
6969
|
+
function C(N, L, Q) {
|
|
6961
6970
|
var J, r0 = this._iv;
|
|
6962
6971
|
r0 ? (J = r0, this._iv = n) : J = this._prevBlock;
|
|
6963
6972
|
for (var l0 = 0; l0 < Q; l0++)
|
|
@@ -6977,8 +6986,8 @@ function D0() {
|
|
|
6977
6986
|
*
|
|
6978
6987
|
* CryptoJS.pad.Pkcs7.pad(wordArray, 4);
|
|
6979
6988
|
*/
|
|
6980
|
-
pad: function(w,
|
|
6981
|
-
for (var N =
|
|
6989
|
+
pad: function(w, C) {
|
|
6990
|
+
for (var N = C * 4, L = N - w.sigBytes % N, Q = L << 24 | L << 16 | L << 8 | L, J = [], r0 = 0; r0 < L; r0 += 4)
|
|
6982
6991
|
J.push(Q);
|
|
6983
6992
|
var l0 = a.create(J, L);
|
|
6984
6993
|
w.concat(l0);
|
|
@@ -6995,8 +7004,8 @@ function D0() {
|
|
|
6995
7004
|
* CryptoJS.pad.Pkcs7.unpad(wordArray);
|
|
6996
7005
|
*/
|
|
6997
7006
|
unpad: function(w) {
|
|
6998
|
-
var
|
|
6999
|
-
w.sigBytes -=
|
|
7007
|
+
var C = w.words[w.sigBytes - 1 >>> 2] & 255;
|
|
7008
|
+
w.sigBytes -= C;
|
|
7000
7009
|
}
|
|
7001
7010
|
};
|
|
7002
7011
|
i.BlockCipher = v.extend({
|
|
@@ -7013,15 +7022,15 @@ function D0() {
|
|
|
7013
7022
|
reset: function() {
|
|
7014
7023
|
var w;
|
|
7015
7024
|
v.reset.call(this);
|
|
7016
|
-
var
|
|
7025
|
+
var C = this.cfg, N = C.iv, L = C.mode;
|
|
7017
7026
|
this._xformMode == this._ENC_XFORM_MODE ? w = L.createEncryptor : (w = L.createDecryptor, this._minBufferSize = 1), this._mode && this._mode.__creator == w ? this._mode.init(this, N && N.words) : (this._mode = w.call(L, this, N && N.words), this._mode.__creator = w);
|
|
7018
7027
|
},
|
|
7019
|
-
_doProcessBlock: function(w,
|
|
7020
|
-
this._mode.processBlock(w,
|
|
7028
|
+
_doProcessBlock: function(w, C) {
|
|
7029
|
+
this._mode.processBlock(w, C);
|
|
7021
7030
|
},
|
|
7022
7031
|
_doFinalize: function() {
|
|
7023
|
-
var w,
|
|
7024
|
-
return this._xformMode == this._ENC_XFORM_MODE ? (
|
|
7032
|
+
var w, C = this.cfg.padding;
|
|
7033
|
+
return this._xformMode == this._ENC_XFORM_MODE ? (C.pad(this._data, this.blockSize), w = this._process(!0)) : (w = this._process(!0), C.unpad(w)), w;
|
|
7025
7034
|
},
|
|
7026
7035
|
blockSize: 128 / 32
|
|
7027
7036
|
});
|
|
@@ -7081,8 +7090,8 @@ function D0() {
|
|
|
7081
7090
|
* var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams);
|
|
7082
7091
|
*/
|
|
7083
7092
|
stringify: function(w) {
|
|
7084
|
-
var
|
|
7085
|
-
return L ?
|
|
7093
|
+
var C, N = w.ciphertext, L = w.salt;
|
|
7094
|
+
return L ? C = a.create([1398893684, 1701076831]).concat(L).concat(N) : C = N, C.toString(x);
|
|
7086
7095
|
},
|
|
7087
7096
|
/**
|
|
7088
7097
|
* Converts an OpenSSL-compatible string to a cipher params object.
|
|
@@ -7098,10 +7107,10 @@ function D0() {
|
|
|
7098
7107
|
* var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString);
|
|
7099
7108
|
*/
|
|
7100
7109
|
parse: function(w) {
|
|
7101
|
-
var
|
|
7102
|
-
return L[0] == 1398893684 && L[1] == 1701076831 && (
|
|
7110
|
+
var C, N = x.parse(w), L = N.words;
|
|
7111
|
+
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 });
|
|
7103
7112
|
}
|
|
7104
|
-
},
|
|
7113
|
+
}, _ = i.SerializableCipher = o.extend({
|
|
7105
7114
|
/**
|
|
7106
7115
|
* Configuration options.
|
|
7107
7116
|
*
|
|
@@ -7128,9 +7137,9 @@ function D0() {
|
|
|
7128
7137
|
* var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv });
|
|
7129
7138
|
* var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL });
|
|
7130
7139
|
*/
|
|
7131
|
-
encrypt: function(w,
|
|
7140
|
+
encrypt: function(w, C, N, L) {
|
|
7132
7141
|
L = this.cfg.extend(L);
|
|
7133
|
-
var Q = w.createEncryptor(N, L), J = Q.finalize(
|
|
7142
|
+
var Q = w.createEncryptor(N, L), J = Q.finalize(C), r0 = Q.cfg;
|
|
7134
7143
|
return E.create({
|
|
7135
7144
|
ciphertext: J,
|
|
7136
7145
|
key: N,
|
|
@@ -7159,9 +7168,9 @@ function D0() {
|
|
|
7159
7168
|
* var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL });
|
|
7160
7169
|
* var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL });
|
|
7161
7170
|
*/
|
|
7162
|
-
decrypt: function(w,
|
|
7163
|
-
L = this.cfg.extend(L),
|
|
7164
|
-
var Q = w.createDecryptor(N, L).finalize(
|
|
7171
|
+
decrypt: function(w, C, N, L) {
|
|
7172
|
+
L = this.cfg.extend(L), C = this._parse(C, L.format);
|
|
7173
|
+
var Q = w.createDecryptor(N, L).finalize(C.ciphertext);
|
|
7165
7174
|
return Q;
|
|
7166
7175
|
},
|
|
7167
7176
|
/**
|
|
@@ -7179,8 +7188,8 @@ function D0() {
|
|
|
7179
7188
|
*
|
|
7180
7189
|
* var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format);
|
|
7181
7190
|
*/
|
|
7182
|
-
_parse: function(w,
|
|
7183
|
-
return typeof w == "string" ?
|
|
7191
|
+
_parse: function(w, C) {
|
|
7192
|
+
return typeof w == "string" ? C.parse(w, this) : w;
|
|
7184
7193
|
}
|
|
7185
7194
|
}), S = s.kdf = {}, R = S.OpenSSL = {
|
|
7186
7195
|
/**
|
|
@@ -7200,21 +7209,21 @@ function D0() {
|
|
|
7200
7209
|
* var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32);
|
|
7201
7210
|
* var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt');
|
|
7202
7211
|
*/
|
|
7203
|
-
execute: function(w,
|
|
7212
|
+
execute: function(w, C, N, L, Q) {
|
|
7204
7213
|
if (L || (L = a.random(64 / 8)), Q)
|
|
7205
|
-
var J = h.create({ keySize:
|
|
7214
|
+
var J = h.create({ keySize: C + N, hasher: Q }).compute(w, L);
|
|
7206
7215
|
else
|
|
7207
|
-
var J = h.create({ keySize:
|
|
7208
|
-
var r0 = a.create(J.words.slice(
|
|
7209
|
-
return J.sigBytes =
|
|
7216
|
+
var J = h.create({ keySize: C + N }).compute(w, L);
|
|
7217
|
+
var r0 = a.create(J.words.slice(C), N * 4);
|
|
7218
|
+
return J.sigBytes = C * 4, E.create({ key: J, iv: r0, salt: L });
|
|
7210
7219
|
}
|
|
7211
|
-
}, q = i.PasswordBasedCipher =
|
|
7220
|
+
}, q = i.PasswordBasedCipher = _.extend({
|
|
7212
7221
|
/**
|
|
7213
7222
|
* Configuration options.
|
|
7214
7223
|
*
|
|
7215
7224
|
* @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL
|
|
7216
7225
|
*/
|
|
7217
|
-
cfg:
|
|
7226
|
+
cfg: _.cfg.extend({
|
|
7218
7227
|
kdf: R
|
|
7219
7228
|
}),
|
|
7220
7229
|
/**
|
|
@@ -7234,11 +7243,11 @@ function D0() {
|
|
|
7234
7243
|
* var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password');
|
|
7235
7244
|
* var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL });
|
|
7236
7245
|
*/
|
|
7237
|
-
encrypt: function(w,
|
|
7246
|
+
encrypt: function(w, C, N, L) {
|
|
7238
7247
|
L = this.cfg.extend(L);
|
|
7239
7248
|
var Q = L.kdf.execute(N, w.keySize, w.ivSize, L.salt, L.hasher);
|
|
7240
7249
|
L.iv = Q.iv;
|
|
7241
|
-
var J =
|
|
7250
|
+
var J = _.encrypt.call(this, w, C, Q.key, L);
|
|
7242
7251
|
return J.mixIn(Q), J;
|
|
7243
7252
|
},
|
|
7244
7253
|
/**
|
|
@@ -7258,11 +7267,11 @@ function D0() {
|
|
|
7258
7267
|
* var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL });
|
|
7259
7268
|
* var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL });
|
|
7260
7269
|
*/
|
|
7261
|
-
decrypt: function(w,
|
|
7262
|
-
L = this.cfg.extend(L),
|
|
7263
|
-
var Q = L.kdf.execute(N, w.keySize, w.ivSize,
|
|
7270
|
+
decrypt: function(w, C, N, L) {
|
|
7271
|
+
L = this.cfg.extend(L), C = this._parse(C, L.format);
|
|
7272
|
+
var Q = L.kdf.execute(N, w.keySize, w.ivSize, C.salt, L.hasher);
|
|
7264
7273
|
L.iv = Q.iv;
|
|
7265
|
-
var J =
|
|
7274
|
+
var J = _.decrypt.call(this, w, C, Q.key, L);
|
|
7266
7275
|
return J;
|
|
7267
7276
|
}
|
|
7268
7277
|
});
|
|
@@ -7299,8 +7308,8 @@ function Su() {
|
|
|
7299
7308
|
function s(i, o, a, B) {
|
|
7300
7309
|
var c, x = this._iv;
|
|
7301
7310
|
x ? (c = x.slice(0), this._iv = void 0) : c = this._prevBlock, B.encryptBlock(c, 0);
|
|
7302
|
-
for (var
|
|
7303
|
-
i[o +
|
|
7311
|
+
for (var d = 0; d < a; d++)
|
|
7312
|
+
i[o + d] ^= c[d];
|
|
7304
7313
|
}
|
|
7305
7314
|
return n;
|
|
7306
7315
|
}(), r.mode.CFB;
|
|
@@ -7325,10 +7334,10 @@ function Ru() {
|
|
|
7325
7334
|
processBlock: function(i, o) {
|
|
7326
7335
|
var a = this._cipher, B = a.blockSize, c = this._iv, x = this._counter;
|
|
7327
7336
|
c && (x = this._counter = c.slice(0), this._iv = void 0);
|
|
7328
|
-
var
|
|
7329
|
-
a.encryptBlock(
|
|
7337
|
+
var d = x.slice(0);
|
|
7338
|
+
a.encryptBlock(d, 0), x[B - 1] = x[B - 1] + 1 | 0;
|
|
7330
7339
|
for (var h = 0; h < B; h++)
|
|
7331
|
-
i[o + h] ^=
|
|
7340
|
+
i[o + h] ^= d[h];
|
|
7332
7341
|
}
|
|
7333
7342
|
});
|
|
7334
7343
|
return n.Decryptor = s, n;
|
|
@@ -7369,8 +7378,8 @@ function Ou() {
|
|
|
7369
7378
|
}
|
|
7370
7379
|
var o = n.Encryptor = n.extend({
|
|
7371
7380
|
processBlock: function(a, B) {
|
|
7372
|
-
var c = this._cipher, x = c.blockSize,
|
|
7373
|
-
|
|
7381
|
+
var c = this._cipher, x = c.blockSize, d = this._iv, h = this._counter;
|
|
7382
|
+
d && (h = this._counter = d.slice(0), this._iv = void 0), i(h);
|
|
7374
7383
|
var v = h.slice(0);
|
|
7375
7384
|
c.encryptBlock(v, 0);
|
|
7376
7385
|
for (var f = 0; f < x; f++)
|
|
@@ -7390,7 +7399,7 @@ var hr = {}, Pu = {
|
|
|
7390
7399
|
hr = t;
|
|
7391
7400
|
}
|
|
7392
7401
|
}, zs;
|
|
7393
|
-
function
|
|
7402
|
+
function Hu() {
|
|
7394
7403
|
return zs || (zs = 1, function(t, e) {
|
|
7395
7404
|
(function(r, n, s) {
|
|
7396
7405
|
t.exports = n(o0(), D0());
|
|
@@ -7400,8 +7409,8 @@ function Iu() {
|
|
|
7400
7409
|
processBlock: function(i, o) {
|
|
7401
7410
|
var a = this._cipher, B = a.blockSize, c = this._iv, x = this._keystream;
|
|
7402
7411
|
c && (x = this._keystream = c.slice(0), this._iv = void 0), a.encryptBlock(x, 0);
|
|
7403
|
-
for (var
|
|
7404
|
-
i[o +
|
|
7412
|
+
for (var d = 0; d < B; d++)
|
|
7413
|
+
i[o + d] ^= x[d];
|
|
7405
7414
|
}
|
|
7406
7415
|
});
|
|
7407
7416
|
return n.Decryptor = s, n;
|
|
@@ -7409,7 +7418,7 @@ function Iu() {
|
|
|
7409
7418
|
});
|
|
7410
7419
|
}(Pu)), hr;
|
|
7411
7420
|
}
|
|
7412
|
-
var dr = {},
|
|
7421
|
+
var dr = {}, Iu = {
|
|
7413
7422
|
get exports() {
|
|
7414
7423
|
return dr;
|
|
7415
7424
|
},
|
|
@@ -7435,7 +7444,7 @@ function qu() {
|
|
|
7435
7444
|
}), n;
|
|
7436
7445
|
}(), r.mode.ECB;
|
|
7437
7446
|
});
|
|
7438
|
-
}(
|
|
7447
|
+
}(Iu)), dr;
|
|
7439
7448
|
}
|
|
7440
7449
|
var pr = {}, Nu = {
|
|
7441
7450
|
get exports() {
|
|
@@ -7610,8 +7619,8 @@ function Xu() {
|
|
|
7610
7619
|
* var cipherParams = CryptoJS.format.Hex.parse(hexString);
|
|
7611
7620
|
*/
|
|
7612
7621
|
parse: function(x) {
|
|
7613
|
-
var
|
|
7614
|
-
return o.create({ ciphertext:
|
|
7622
|
+
var d = B.parse(x);
|
|
7623
|
+
return o.create({ ciphertext: d });
|
|
7615
7624
|
}
|
|
7616
7625
|
};
|
|
7617
7626
|
}(), r.format.Hex;
|
|
@@ -7629,40 +7638,40 @@ var mr = {}, Qu = {
|
|
|
7629
7638
|
function Vu() {
|
|
7630
7639
|
return Gs || (Gs = 1, function(t, e) {
|
|
7631
7640
|
(function(r, n, s) {
|
|
7632
|
-
t.exports = n(o0(), $t(), Mt(),
|
|
7641
|
+
t.exports = n(o0(), $t(), Mt(), Ht(), D0());
|
|
7633
7642
|
})(s0, function(r) {
|
|
7634
7643
|
return function() {
|
|
7635
|
-
var n = r, s = n.lib, i = s.BlockCipher, o = n.algo, a = [], B = [], c = [], x = [],
|
|
7644
|
+
var n = r, s = n.lib, i = s.BlockCipher, o = n.algo, a = [], B = [], c = [], x = [], d = [], h = [], v = [], f = [], l = [], y = [];
|
|
7636
7645
|
(function() {
|
|
7637
7646
|
for (var E = [], b = 0; b < 256; b++)
|
|
7638
7647
|
b < 128 ? E[b] = b << 1 : E[b] = b << 1 ^ 283;
|
|
7639
|
-
for (var F = 0,
|
|
7640
|
-
var S =
|
|
7648
|
+
for (var F = 0, _ = 0, b = 0; b < 256; b++) {
|
|
7649
|
+
var S = _ ^ _ << 1 ^ _ << 2 ^ _ << 3 ^ _ << 4;
|
|
7641
7650
|
S = S >>> 8 ^ S & 255 ^ 99, a[F] = S, B[S] = F;
|
|
7642
|
-
var R = E[F], q = E[R], w = E[q],
|
|
7643
|
-
c[F] =
|
|
7644
|
-
var
|
|
7645
|
-
v[S] =
|
|
7651
|
+
var R = E[F], q = E[R], w = E[q], C = E[S] * 257 ^ S * 16843008;
|
|
7652
|
+
c[F] = C << 24 | C >>> 8, x[F] = C << 16 | C >>> 16, d[F] = C << 8 | C >>> 24, h[F] = C;
|
|
7653
|
+
var C = w * 16843009 ^ q * 65537 ^ R * 257 ^ F * 16843008;
|
|
7654
|
+
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;
|
|
7646
7655
|
}
|
|
7647
7656
|
})();
|
|
7648
7657
|
var A = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54], g = o.AES = i.extend({
|
|
7649
7658
|
_doReset: function() {
|
|
7650
7659
|
var E;
|
|
7651
7660
|
if (!(this._nRounds && this._keyPriorReset === this._key)) {
|
|
7652
|
-
for (var b = this._keyPriorReset = this._key, F = b.words,
|
|
7653
|
-
w <
|
|
7654
|
-
for (var
|
|
7661
|
+
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++)
|
|
7662
|
+
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);
|
|
7663
|
+
for (var C = this._invKeySchedule = [], N = 0; N < R; N++) {
|
|
7655
7664
|
var w = R - N;
|
|
7656
7665
|
if (N % 4)
|
|
7657
7666
|
var E = q[w];
|
|
7658
7667
|
else
|
|
7659
7668
|
var E = q[w - 4];
|
|
7660
|
-
N < 4 || w <= 4 ?
|
|
7669
|
+
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]];
|
|
7661
7670
|
}
|
|
7662
7671
|
}
|
|
7663
7672
|
},
|
|
7664
7673
|
encryptBlock: function(E, b) {
|
|
7665
|
-
this._doCryptBlock(E, b, this._keySchedule, c, x,
|
|
7674
|
+
this._doCryptBlock(E, b, this._keySchedule, c, x, d, h, a);
|
|
7666
7675
|
},
|
|
7667
7676
|
decryptBlock: function(E, b) {
|
|
7668
7677
|
var F = E[b + 1];
|
|
@@ -7670,9 +7679,9 @@ function Vu() {
|
|
|
7670
7679
|
var F = E[b + 1];
|
|
7671
7680
|
E[b + 1] = E[b + 3], E[b + 3] = F;
|
|
7672
7681
|
},
|
|
7673
|
-
_doCryptBlock: function(E, b, F,
|
|
7674
|
-
for (var
|
|
7675
|
-
var Y =
|
|
7682
|
+
_doCryptBlock: function(E, b, F, _, S, R, q, w) {
|
|
7683
|
+
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++) {
|
|
7684
|
+
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++];
|
|
7676
7685
|
N = Y, L = h0, Q = a0, J = O;
|
|
7677
7686
|
}
|
|
7678
7687
|
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++];
|
|
@@ -7696,7 +7705,7 @@ var br = {}, Yu = {
|
|
|
7696
7705
|
function Ju() {
|
|
7697
7706
|
return Xs || (Xs = 1, function(t, e) {
|
|
7698
7707
|
(function(r, n, s) {
|
|
7699
|
-
t.exports = n(o0(), $t(), Mt(),
|
|
7708
|
+
t.exports = n(o0(), $t(), Mt(), Ht(), D0());
|
|
7700
7709
|
})(s0, function(r) {
|
|
7701
7710
|
return function() {
|
|
7702
7711
|
var n = r, s = n.lib, i = s.WordArray, o = s.BlockCipher, a = n.algo, B = [
|
|
@@ -7805,7 +7814,7 @@ function Ju() {
|
|
|
7805
7814
|
36,
|
|
7806
7815
|
29,
|
|
7807
7816
|
32
|
|
7808
|
-
], x = [1, 2, 4, 6, 8, 10, 12, 14, 15, 17, 19, 21, 23, 25, 27, 28],
|
|
7817
|
+
], x = [1, 2, 4, 6, 8, 10, 12, 14, 15, 17, 19, 21, 23, 25, 27, 28], d = [
|
|
7809
7818
|
{
|
|
7810
7819
|
0: 8421888,
|
|
7811
7820
|
268435456: 32768,
|
|
@@ -8349,8 +8358,8 @@ function Ju() {
|
|
|
8349
8358
|
var F = B[b] - 1;
|
|
8350
8359
|
E[b] = g[F >>> 5] >>> 31 - F % 32 & 1;
|
|
8351
8360
|
}
|
|
8352
|
-
for (var
|
|
8353
|
-
for (var R =
|
|
8361
|
+
for (var _ = this._subKeys = [], S = 0; S < 16; S++) {
|
|
8362
|
+
for (var R = _[S] = [], q = x[S], b = 0; b < 24; b++)
|
|
8354
8363
|
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;
|
|
8355
8364
|
R[0] = R[0] << 1 | R[0] >>> 31;
|
|
8356
8365
|
for (var b = 1; b < 7; b++)
|
|
@@ -8358,7 +8367,7 @@ function Ju() {
|
|
|
8358
8367
|
R[7] = R[7] << 5 | R[7] >>> 27;
|
|
8359
8368
|
}
|
|
8360
8369
|
for (var w = this._invSubKeys = [], b = 0; b < 16; b++)
|
|
8361
|
-
w[b] =
|
|
8370
|
+
w[b] = _[15 - b];
|
|
8362
8371
|
},
|
|
8363
8372
|
encryptBlock: function(A, g) {
|
|
8364
8373
|
this._doCryptBlock(A, g, this._subKeys);
|
|
@@ -8369,9 +8378,9 @@ function Ju() {
|
|
|
8369
8378
|
_doCryptBlock: function(A, g, E) {
|
|
8370
8379
|
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);
|
|
8371
8380
|
for (var b = 0; b < 16; b++) {
|
|
8372
|
-
for (var F = E[b],
|
|
8373
|
-
R |=
|
|
8374
|
-
this._lBlock = S, this._rBlock =
|
|
8381
|
+
for (var F = E[b], _ = this._lBlock, S = this._rBlock, R = 0, q = 0; q < 8; q++)
|
|
8382
|
+
R |= d[q][((S ^ F[q]) & h[q]) >>> 0];
|
|
8383
|
+
this._lBlock = S, this._rBlock = _ ^ R;
|
|
8375
8384
|
}
|
|
8376
8385
|
var w = this._lBlock;
|
|
8377
8386
|
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;
|
|
@@ -8423,34 +8432,34 @@ var Ar = {}, tl = {
|
|
|
8423
8432
|
function el() {
|
|
8424
8433
|
return Qs || (Qs = 1, function(t, e) {
|
|
8425
8434
|
(function(r, n, s) {
|
|
8426
|
-
t.exports = n(o0(), $t(), Mt(),
|
|
8435
|
+
t.exports = n(o0(), $t(), Mt(), Ht(), D0());
|
|
8427
8436
|
})(s0, function(r) {
|
|
8428
8437
|
return function() {
|
|
8429
8438
|
var n = r, s = n.lib, i = s.StreamCipher, o = n.algo, a = o.RC4 = i.extend({
|
|
8430
8439
|
_doReset: function() {
|
|
8431
|
-
for (var x = this._key,
|
|
8440
|
+
for (var x = this._key, d = x.words, h = x.sigBytes, v = this._S = [], f = 0; f < 256; f++)
|
|
8432
8441
|
v[f] = f;
|
|
8433
8442
|
for (var f = 0, l = 0; f < 256; f++) {
|
|
8434
|
-
var y = f % h, A =
|
|
8443
|
+
var y = f % h, A = d[y >>> 2] >>> 24 - y % 4 * 8 & 255;
|
|
8435
8444
|
l = (l + v[f] + A) % 256;
|
|
8436
8445
|
var g = v[f];
|
|
8437
8446
|
v[f] = v[l], v[l] = g;
|
|
8438
8447
|
}
|
|
8439
8448
|
this._i = this._j = 0;
|
|
8440
8449
|
},
|
|
8441
|
-
_doProcessBlock: function(x,
|
|
8442
|
-
x[
|
|
8450
|
+
_doProcessBlock: function(x, d) {
|
|
8451
|
+
x[d] ^= B.call(this);
|
|
8443
8452
|
},
|
|
8444
8453
|
keySize: 256 / 32,
|
|
8445
8454
|
ivSize: 0
|
|
8446
8455
|
});
|
|
8447
8456
|
function B() {
|
|
8448
|
-
for (var x = this._S,
|
|
8449
|
-
|
|
8450
|
-
var l = x[
|
|
8451
|
-
x[
|
|
8457
|
+
for (var x = this._S, d = this._i, h = this._j, v = 0, f = 0; f < 4; f++) {
|
|
8458
|
+
d = (d + 1) % 256, h = (h + x[d]) % 256;
|
|
8459
|
+
var l = x[d];
|
|
8460
|
+
x[d] = x[h], x[h] = l, v |= x[(x[d] + x[h]) % 256] << 24 - f * 8;
|
|
8452
8461
|
}
|
|
8453
|
-
return this._i =
|
|
8462
|
+
return this._i = d, this._j = h, v;
|
|
8454
8463
|
}
|
|
8455
8464
|
n.RC4 = i._createHelper(a);
|
|
8456
8465
|
var c = o.RC4Drop = a.extend({
|
|
@@ -8484,7 +8493,7 @@ var Fr = {}, rl = {
|
|
|
8484
8493
|
function nl() {
|
|
8485
8494
|
return Vs || (Vs = 1, function(t, e) {
|
|
8486
8495
|
(function(r, n, s) {
|
|
8487
|
-
t.exports = n(o0(), $t(), Mt(),
|
|
8496
|
+
t.exports = n(o0(), $t(), Mt(), Ht(), D0());
|
|
8488
8497
|
})(s0, function(r) {
|
|
8489
8498
|
return function() {
|
|
8490
8499
|
var n = r, s = n.lib, i = s.StreamCipher, o = n.algo, a = [], B = [], c = [], x = o.Rabbit = i.extend({
|
|
@@ -8512,26 +8521,26 @@ function nl() {
|
|
|
8512
8521
|
];
|
|
8513
8522
|
this._b = 0;
|
|
8514
8523
|
for (var f = 0; f < 4; f++)
|
|
8515
|
-
|
|
8524
|
+
d.call(this);
|
|
8516
8525
|
for (var f = 0; f < 8; f++)
|
|
8517
8526
|
y[f] ^= l[f + 4 & 7];
|
|
8518
8527
|
if (v) {
|
|
8519
|
-
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,
|
|
8520
|
-
y[0] ^= b, y[1] ^=
|
|
8528
|
+
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;
|
|
8529
|
+
y[0] ^= b, y[1] ^= _, y[2] ^= F, y[3] ^= S, y[4] ^= b, y[5] ^= _, y[6] ^= F, y[7] ^= S;
|
|
8521
8530
|
for (var f = 0; f < 4; f++)
|
|
8522
|
-
|
|
8531
|
+
d.call(this);
|
|
8523
8532
|
}
|
|
8524
8533
|
},
|
|
8525
8534
|
_doProcessBlock: function(h, v) {
|
|
8526
8535
|
var f = this._X;
|
|
8527
|
-
|
|
8536
|
+
d.call(this), a[0] = f[0] ^ f[5] >>> 16 ^ f[3] << 16, a[1] = f[2] ^ f[7] >>> 16 ^ f[5] << 16, a[2] = f[4] ^ f[1] >>> 16 ^ f[7] << 16, a[3] = f[6] ^ f[3] >>> 16 ^ f[1] << 16;
|
|
8528
8537
|
for (var l = 0; l < 4; l++)
|
|
8529
8538
|
a[l] = (a[l] << 8 | a[l] >>> 24) & 16711935 | (a[l] << 24 | a[l] >>> 8) & 4278255360, h[v + l] ^= a[l];
|
|
8530
8539
|
},
|
|
8531
8540
|
blockSize: 128 / 32,
|
|
8532
8541
|
ivSize: 64 / 32
|
|
8533
8542
|
});
|
|
8534
|
-
function
|
|
8543
|
+
function d() {
|
|
8535
8544
|
for (var h = this._X, v = this._C, f = 0; f < 8; f++)
|
|
8536
8545
|
B[f] = v[f];
|
|
8537
8546
|
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;
|
|
@@ -8557,7 +8566,7 @@ var Cr = {}, sl = {
|
|
|
8557
8566
|
function il() {
|
|
8558
8567
|
return Ys || (Ys = 1, function(t, e) {
|
|
8559
8568
|
(function(r, n, s) {
|
|
8560
|
-
t.exports = n(o0(), $t(), Mt(),
|
|
8569
|
+
t.exports = n(o0(), $t(), Mt(), Ht(), D0());
|
|
8561
8570
|
})(s0, function(r) {
|
|
8562
8571
|
return function() {
|
|
8563
8572
|
var n = r, s = n.lib, i = s.StreamCipher, o = n.algo, a = [], B = [], c = [], x = o.RabbitLegacy = i.extend({
|
|
@@ -8583,26 +8592,26 @@ function il() {
|
|
|
8583
8592
|
];
|
|
8584
8593
|
this._b = 0;
|
|
8585
8594
|
for (var y = 0; y < 4; y++)
|
|
8586
|
-
|
|
8595
|
+
d.call(this);
|
|
8587
8596
|
for (var y = 0; y < 8; y++)
|
|
8588
8597
|
l[y] ^= f[y + 4 & 7];
|
|
8589
8598
|
if (v) {
|
|
8590
|
-
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,
|
|
8591
|
-
l[0] ^= b, l[1] ^=
|
|
8599
|
+
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;
|
|
8600
|
+
l[0] ^= b, l[1] ^= _, l[2] ^= F, l[3] ^= S, l[4] ^= b, l[5] ^= _, l[6] ^= F, l[7] ^= S;
|
|
8592
8601
|
for (var y = 0; y < 4; y++)
|
|
8593
|
-
|
|
8602
|
+
d.call(this);
|
|
8594
8603
|
}
|
|
8595
8604
|
},
|
|
8596
8605
|
_doProcessBlock: function(h, v) {
|
|
8597
8606
|
var f = this._X;
|
|
8598
|
-
|
|
8607
|
+
d.call(this), a[0] = f[0] ^ f[5] >>> 16 ^ f[3] << 16, a[1] = f[2] ^ f[7] >>> 16 ^ f[5] << 16, a[2] = f[4] ^ f[1] >>> 16 ^ f[7] << 16, a[3] = f[6] ^ f[3] >>> 16 ^ f[1] << 16;
|
|
8599
8608
|
for (var l = 0; l < 4; l++)
|
|
8600
8609
|
a[l] = (a[l] << 8 | a[l] >>> 24) & 16711935 | (a[l] << 24 | a[l] >>> 8) & 4278255360, h[v + l] ^= a[l];
|
|
8601
8610
|
},
|
|
8602
8611
|
blockSize: 128 / 32,
|
|
8603
8612
|
ivSize: 64 / 32
|
|
8604
8613
|
});
|
|
8605
|
-
function
|
|
8614
|
+
function d() {
|
|
8606
8615
|
for (var h = this._X, v = this._C, f = 0; f < 8; f++)
|
|
8607
8616
|
B[f] = v[f];
|
|
8608
8617
|
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;
|
|
@@ -8628,7 +8637,7 @@ var Dr = {}, ol = {
|
|
|
8628
8637
|
function al() {
|
|
8629
8638
|
return Js || (Js = 1, function(t, e) {
|
|
8630
8639
|
(function(r, n, s) {
|
|
8631
|
-
t.exports = n(o0(), $t(), Mt(),
|
|
8640
|
+
t.exports = n(o0(), $t(), Mt(), Ht(), D0());
|
|
8632
8641
|
})(s0, function(r) {
|
|
8633
8642
|
return function() {
|
|
8634
8643
|
var n = r, s = n.lib, i = s.BlockCipher, o = n.algo;
|
|
@@ -9689,20 +9698,20 @@ function al() {
|
|
|
9689
9698
|
pbox: [],
|
|
9690
9699
|
sbox: []
|
|
9691
9700
|
};
|
|
9692
|
-
function
|
|
9693
|
-
let g = A >> 24 & 255, E = A >> 16 & 255, b = A >> 8 & 255, F = A & 255,
|
|
9694
|
-
return
|
|
9701
|
+
function d(y, A) {
|
|
9702
|
+
let g = A >> 24 & 255, E = A >> 16 & 255, b = A >> 8 & 255, F = A & 255, _ = y.sbox[0][g] + y.sbox[1][E];
|
|
9703
|
+
return _ = _ ^ y.sbox[2][b], _ = _ + y.sbox[3][F], _;
|
|
9695
9704
|
}
|
|
9696
9705
|
function h(y, A, g) {
|
|
9697
9706
|
let E = A, b = g, F;
|
|
9698
|
-
for (let
|
|
9699
|
-
E = E ^ y.pbox[
|
|
9707
|
+
for (let _ = 0; _ < a; ++_)
|
|
9708
|
+
E = E ^ y.pbox[_], b = d(y, E) ^ b, F = E, E = b, b = F;
|
|
9700
9709
|
return F = E, E = b, b = F, b = b ^ y.pbox[a], E = E ^ y.pbox[a + 1], { left: E, right: b };
|
|
9701
9710
|
}
|
|
9702
9711
|
function v(y, A, g) {
|
|
9703
9712
|
let E = A, b = g, F;
|
|
9704
|
-
for (let
|
|
9705
|
-
E = E ^ y.pbox[
|
|
9713
|
+
for (let _ = a + 1; _ > 1; --_)
|
|
9714
|
+
E = E ^ y.pbox[_], b = d(y, E) ^ b, F = E, E = b, b = F;
|
|
9706
9715
|
return F = E, E = b, b = F, b = b ^ y.pbox[1], E = E ^ y.pbox[0], { left: E, right: b };
|
|
9707
9716
|
}
|
|
9708
9717
|
function f(y, A, g) {
|
|
@@ -9714,12 +9723,12 @@ function al() {
|
|
|
9714
9723
|
let E = 0;
|
|
9715
9724
|
for (let S = 0; S < a + 2; S++)
|
|
9716
9725
|
y.pbox[S] = B[S] ^ A[E], E++, E >= g && (E = 0);
|
|
9717
|
-
let b = 0, F = 0,
|
|
9726
|
+
let b = 0, F = 0, _ = 0;
|
|
9718
9727
|
for (let S = 0; S < a + 2; S += 2)
|
|
9719
|
-
|
|
9728
|
+
_ = h(y, b, F), b = _.left, F = _.right, y.pbox[S] = b, y.pbox[S + 1] = F;
|
|
9720
9729
|
for (let S = 0; S < 4; S++)
|
|
9721
9730
|
for (let R = 0; R < 256; R += 2)
|
|
9722
|
-
|
|
9731
|
+
_ = h(y, b, F), b = _.left, F = _.right, y.sbox[S][R] = b, y.sbox[S][R + 1] = F;
|
|
9723
9732
|
return !0;
|
|
9724
9733
|
}
|
|
9725
9734
|
var l = o.Blowfish = i.extend({
|
|
@@ -9748,7 +9757,7 @@ function al() {
|
|
|
9748
9757
|
}
|
|
9749
9758
|
(function(t, e) {
|
|
9750
9759
|
(function(r, n, s) {
|
|
9751
|
-
t.exports = n(o0(), Lr(), iu(), au(), $t(), fu(), Mt(), Bo(), qn(), pu(), go(), gu(), Eu(), bu(), Nn(), Cu(),
|
|
9760
|
+
t.exports = n(o0(), Lr(), iu(), au(), $t(), fu(), Mt(), Bo(), qn(), pu(), go(), gu(), Eu(), bu(), Nn(), Cu(), Ht(), D0(), Su(), Ru(), Ou(), Hu(), qu(), Lu(), Uu(), Mu(), Wu(), Ku(), Xu(), Vu(), Ju(), el(), nl(), il(), al());
|
|
9752
9761
|
})(s0, function(r) {
|
|
9753
9762
|
return r;
|
|
9754
9763
|
});
|
|
@@ -9762,14 +9771,14 @@ function yo(t, e, r, n, s) {
|
|
|
9762
9771
|
};
|
|
9763
9772
|
return {
|
|
9764
9773
|
encrypt: (c, x) => {
|
|
9765
|
-
const
|
|
9774
|
+
const d = s.parse(c), h = K0.AES.encrypt(d, i, o);
|
|
9766
9775
|
return x ? K0.enc.Hex.stringify(h == null ? void 0 : h.ciphertext) : h.toString();
|
|
9767
9776
|
},
|
|
9768
9777
|
decrypt: (c, x) => {
|
|
9769
9778
|
if (x) {
|
|
9770
|
-
const
|
|
9779
|
+
const d = {
|
|
9771
9780
|
ciphertext: K0.enc.Hex.parse(c)
|
|
9772
|
-
}, h = K0.AES.decrypt(
|
|
9781
|
+
}, h = K0.AES.decrypt(d, i, o);
|
|
9773
9782
|
return h == null ? void 0 : h.toString(s);
|
|
9774
9783
|
} else
|
|
9775
9784
|
return K0.AES.decrypt(c, i, o);
|
|
@@ -10062,42 +10071,42 @@ const mo = function(t) {
|
|
|
10062
10071
|
}
|
|
10063
10072
|
}, oe = gl;
|
|
10064
10073
|
function yl(t, e, r, n) {
|
|
10065
|
-
const s = e == null ? void 0 : e.designState, i = e, o = (T) => t ? m0.getOptions(t, T, !0) != null : !1, a = (T,
|
|
10074
|
+
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) => {
|
|
10066
10075
|
if (t)
|
|
10067
|
-
return m0.setOptions(t, T,
|
|
10068
|
-
}, c = (T,
|
|
10069
|
-
ft(t == null ? void 0 : t.options, T) && B(T,
|
|
10076
|
+
return m0.setOptions(t, T, H);
|
|
10077
|
+
}, c = (T, H) => {
|
|
10078
|
+
ft(t == null ? void 0 : t.options, T) && B(T, H);
|
|
10070
10079
|
}, x = (T) => {
|
|
10071
|
-
const
|
|
10072
|
-
return l(
|
|
10073
|
-
},
|
|
10080
|
+
const H = m0.getOrgOption(t, T);
|
|
10081
|
+
return l(H);
|
|
10082
|
+
}, d = (T, H, k = !1) => {
|
|
10074
10083
|
var t0;
|
|
10075
10084
|
const K = (t0 = t == null ? void 0 : t.options) == null ? void 0 : t0[T];
|
|
10076
|
-
var V = k ? Z.getValue(K, !1, !s, { ...i, schemaParams:
|
|
10085
|
+
var V = k ? Z.getValue(K, !1, !s, { ...i, schemaParams: H }) : x(T);
|
|
10077
10086
|
return V;
|
|
10078
|
-
}, h = (T,
|
|
10079
|
-
if (!
|
|
10087
|
+
}, h = (T, H, k, K) => {
|
|
10088
|
+
if (!H)
|
|
10080
10089
|
return;
|
|
10081
10090
|
k == null || k();
|
|
10082
|
-
const V = Ot(F.value).includes(
|
|
10091
|
+
const V = Ot(F.value).includes(H) ? F : Ot(S.value).includes(H) ? S : null;
|
|
10083
10092
|
if (T && V)
|
|
10084
10093
|
$e(() => {
|
|
10085
10094
|
var t0;
|
|
10086
|
-
return (t0 = V == null ? void 0 : V.value) == null ? void 0 : t0[
|
|
10095
|
+
return (t0 = V == null ? void 0 : V.value) == null ? void 0 : t0[H];
|
|
10087
10096
|
}, (t0, x0) => {
|
|
10088
10097
|
K == null || K(t0, x0);
|
|
10089
10098
|
}, { immediate: !0 });
|
|
10090
10099
|
else {
|
|
10091
|
-
const t0 = a(
|
|
10100
|
+
const t0 = a(H);
|
|
10092
10101
|
zt(t0) ? $e(t0, (x0, f0) => {
|
|
10093
10102
|
K == null || K(x0, f0);
|
|
10094
10103
|
}, { immediate: !0 }) : K == null || K(t0, null);
|
|
10095
10104
|
}
|
|
10096
|
-
}, v = (T,
|
|
10097
|
-
t && m0.setEnable(t, T,
|
|
10098
|
-
}, f = (T,
|
|
10099
|
-
var
|
|
10100
|
-
switch (
|
|
10105
|
+
}, v = (T, H) => {
|
|
10106
|
+
t && m0.setEnable(t, T, H);
|
|
10107
|
+
}, f = (T, H, k) => Df(T, H, k, e), l = (T) => {
|
|
10108
|
+
var H = Z.getType(T), k = Z.getValue(T, !1, !s, i);
|
|
10109
|
+
switch (H) {
|
|
10101
10110
|
case X.dataObject: {
|
|
10102
10111
|
const K = m0.getOptions(T, "type");
|
|
10103
10112
|
if (G0(k) && K) {
|
|
@@ -10132,57 +10141,57 @@ function yl(t, e, r, n) {
|
|
|
10132
10141
|
default:
|
|
10133
10142
|
return k;
|
|
10134
10143
|
}
|
|
10135
|
-
}, y = (T,
|
|
10144
|
+
}, y = (T, H, k) => {
|
|
10136
10145
|
var K = Z.getOptions(T), V = {};
|
|
10137
|
-
return V.slotName = (K == null ? void 0 : K.slotName) ||
|
|
10138
|
-
}, A = (T,
|
|
10146
|
+
return V.slotName = (K == null ? void 0 : K.slotName) || H, (T == null ? void 0 : T.widgetList) === void 0 ? V.widgetList = [] : V.widgetList = T == null ? void 0 : T.widgetList, V.default = k ? Ca(k) : null, Object.assign(T, V);
|
|
10147
|
+
}, A = (T, H = !1, k) => {
|
|
10139
10148
|
var V;
|
|
10140
10149
|
var K = {};
|
|
10141
10150
|
return !t || !t.options || (V = Object.entries(t == null ? void 0 : t.options)) == null || V.forEach(([t0, x0]) => {
|
|
10142
10151
|
if (!(k && !(k != null && k(t0)))) {
|
|
10143
10152
|
var f0 = Z.getOrgType(x0);
|
|
10144
10153
|
if (T.includes(f0)) {
|
|
10145
|
-
var _0 =
|
|
10154
|
+
var _0 = H ? Z.getValue(x0, !1, !s, i) : x(t0);
|
|
10146
10155
|
f0 === X.slot ? K[t0] = y(x0, t0, _0) : Tt(_0) || (K[t0] = _0);
|
|
10147
10156
|
} else
|
|
10148
10157
|
f0 || [X.prop].some((E0) => T.includes(E0)) && (K[t0] = x0);
|
|
10149
10158
|
}
|
|
10150
10159
|
}), K;
|
|
10151
10160
|
}, g = (T) => {
|
|
10152
|
-
const
|
|
10161
|
+
const H = T == null ? void 0 : T.type;
|
|
10153
10162
|
var k = [];
|
|
10154
|
-
return
|
|
10163
|
+
return H && (k = [], T.formItemFlag && (k = k.concat(["name", "defaultValue"]))), k;
|
|
10155
10164
|
}, E = (T) => {
|
|
10156
|
-
const
|
|
10157
|
-
|
|
10158
|
-
var k = !o(Lt.readonly), K = W0(
|
|
10165
|
+
const H = a(rt.state);
|
|
10166
|
+
H != null && zt(H) && (T.readonly = R0(() => W0(H) === Lt.readonly), T.disabled = R0(() => {
|
|
10167
|
+
var k = !o(Lt.readonly), K = W0(H) === Lt.disabled, V = W0(H) === Lt.readonly;
|
|
10159
10168
|
return k ? K : K || V;
|
|
10160
|
-
}), T.hidden = R0(() => W0(
|
|
10169
|
+
}), T.hidden = R0(() => W0(H) === Lt.hidden), T.custom = R0(() => W0(H) === Lt.custom));
|
|
10161
10170
|
}, b = () => {
|
|
10162
|
-
var T = g(t) || [],
|
|
10171
|
+
var T = g(t) || [], H = A([X.icon, X.hook, X.variable, X.prop, X.dataObject], !1, (k) => {
|
|
10163
10172
|
var K = !(r != null && r.fn_attr) || (r == null ? void 0 : r.fn_attr(k)), V = !T.includes(k);
|
|
10164
10173
|
return V && K;
|
|
10165
10174
|
});
|
|
10166
|
-
return E(
|
|
10167
|
-
}, F = r != null && r.s_attr ? R0(() => b()) : yt(),
|
|
10175
|
+
return E(H), sn(H);
|
|
10176
|
+
}, F = r != null && r.s_attr ? R0(() => b()) : yt(), _ = () => {
|
|
10168
10177
|
var T = A([X.placer, X.placerHook]);
|
|
10169
10178
|
return sn(T);
|
|
10170
|
-
}, S = r != null && r.s_extendAttr ? R0(() =>
|
|
10179
|
+
}, S = r != null && r.s_extendAttr ? R0(() => _()) : yt(), R = r != null && r.s_events ? R0(() => A([X.event])) : yt(), q = r != null && r.s_fieldName ? R0({
|
|
10171
10180
|
get: () => a(rt.name),
|
|
10172
10181
|
set: (T) => {
|
|
10173
10182
|
B(rt.name, T);
|
|
10174
10183
|
}
|
|
10175
|
-
}) : yt(), w = (T) => Z.isComplexValue(t == null ? void 0 : t.options[T]),
|
|
10176
|
-
var
|
|
10177
|
-
return ft(t == null ? void 0 : t.options, tt.defaultValue) && (!T ||
|
|
10184
|
+
}) : yt(), w = (T) => Z.isComplexValue(t == null ? void 0 : t.options[T]), C = (T = !1) => {
|
|
10185
|
+
var H = a(tt.defaultValue, !0);
|
|
10186
|
+
return ft(t == null ? void 0 : t.options, tt.defaultValue) && (!T || H != null);
|
|
10178
10187
|
}, N = () => {
|
|
10179
|
-
var
|
|
10180
|
-
if (!
|
|
10188
|
+
var H, k, K, V, t0;
|
|
10189
|
+
if (!C())
|
|
10181
10190
|
return;
|
|
10182
10191
|
let T = a(tt.defaultValue);
|
|
10183
10192
|
if (ft(t == null ? void 0 : t.options, rt.optionItems) && !w(tt.defaultValue)) {
|
|
10184
10193
|
const x0 = W0(a(tt.multiple));
|
|
10185
|
-
if ((x0 || Array.isArray(T)) && ((
|
|
10194
|
+
if ((x0 || Array.isArray(T)) && ((H = u0(T)) == null ? void 0 : H.length) <= 0)
|
|
10186
10195
|
return (K = (k = W0(Y == null ? void 0 : Y.value)) == null ? void 0 : k.filter((f0) => f0 == null ? void 0 : f0.isdefault)) == null ? void 0 : K.map((f0) => f0 == null ? void 0 : f0.value);
|
|
10187
10196
|
if ((x0 === !1 || z0(x0) || !Array.isArray(T)) && z0(T))
|
|
10188
10197
|
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;
|
|
@@ -10198,8 +10207,8 @@ function yl(t, e, r, n) {
|
|
|
10198
10207
|
B(rt.optionItems, fa(T));
|
|
10199
10208
|
}, r0 = (T) => {
|
|
10200
10209
|
if (ft(F.value, T)) {
|
|
10201
|
-
var
|
|
10202
|
-
return zt(
|
|
10210
|
+
var H = F.value[T];
|
|
10211
|
+
return zt(H) ? H : R0(() => l0(F.value[T]));
|
|
10203
10212
|
} else if (ft(S.value, T)) {
|
|
10204
10213
|
var k = S.value[T];
|
|
10205
10214
|
return zt(k) ? k : R0(() => l0(S.value[T]));
|
|
@@ -10212,55 +10221,55 @@ function yl(t, e, r, n) {
|
|
|
10212
10221
|
return T;
|
|
10213
10222
|
if (zt(T))
|
|
10214
10223
|
return W0(T);
|
|
10215
|
-
var
|
|
10216
|
-
return ei(
|
|
10224
|
+
var H = wt(T);
|
|
10225
|
+
return ei(H, (k, K, V) => {
|
|
10217
10226
|
Z.needCalcValue(V) && (k[K] = Z.getValue(V, !0, !s, i));
|
|
10218
|
-
}),
|
|
10227
|
+
}), H === void 0 ? null : sn(H);
|
|
10219
10228
|
};
|
|
10220
10229
|
let Y = null;
|
|
10221
10230
|
r != null && r.s_optionItems && ft(t == null ? void 0 : t.options, rt.optionItems) && (Y = r0(rt.optionItems));
|
|
10222
10231
|
const h0 = (T) => !!T.isdefault, a0 = (T) => {
|
|
10223
10232
|
if (!Array.isArray(Y == null ? void 0 : Y.value))
|
|
10224
10233
|
return;
|
|
10225
|
-
let
|
|
10234
|
+
let H = [];
|
|
10226
10235
|
return ua(Y == null ? void 0 : Y.value, "children", (k) => T(k), (k) => {
|
|
10227
|
-
|
|
10228
|
-
}),
|
|
10236
|
+
H.push(k);
|
|
10237
|
+
}), H;
|
|
10229
10238
|
}, O = r != null && r.s_optionItems ? R0(() => a0(h0)) : yt(), z = r != null && r.s_optionItems ? R0(() => {
|
|
10230
|
-
var T,
|
|
10239
|
+
var T, H;
|
|
10231
10240
|
if (Array.isArray(Y == null ? void 0 : Y.value)) {
|
|
10232
10241
|
const k = (T = O == null ? void 0 : O.value) == null ? void 0 : T.length;
|
|
10233
|
-
return k ? (
|
|
10242
|
+
return k ? (H = O == null ? void 0 : O.value) == null ? void 0 : H[k - 1] : void 0;
|
|
10234
10243
|
}
|
|
10235
10244
|
}) : yt(), M = r != null && r.s_optionItems ? R0(() => {
|
|
10236
10245
|
var T;
|
|
10237
10246
|
if (Array.isArray(Y == null ? void 0 : Y.value)) {
|
|
10238
|
-
const
|
|
10239
|
-
return !isNaN(
|
|
10247
|
+
const H = (T = Y == null ? void 0 : Y.value) == null ? void 0 : T.findIndex((k) => h0(k));
|
|
10248
|
+
return !isNaN(H) && H > -1 ? H : 0;
|
|
10240
10249
|
}
|
|
10241
10250
|
return 0;
|
|
10242
10251
|
}) : yt(0), U = (T) => {
|
|
10243
|
-
const
|
|
10252
|
+
const H = W0(a(tt.valueKey, !1));
|
|
10244
10253
|
return a0((k) => {
|
|
10245
10254
|
var K = he(T, !0);
|
|
10246
|
-
return K == null ? void 0 : K.includes(k == null ? void 0 : k[
|
|
10255
|
+
return K == null ? void 0 : K.includes(k == null ? void 0 : k[H]);
|
|
10247
10256
|
});
|
|
10248
10257
|
}, p0 = (T) => {
|
|
10249
10258
|
var V;
|
|
10250
|
-
const
|
|
10259
|
+
const H = W0(a(tt.labelKey, !1)), k = (V = U(T)) == null ? void 0 : V.map((t0) => t0 == null ? void 0 : t0[H]);
|
|
10251
10260
|
return a(tt.multiple, !1) ? k : k == null ? void 0 : k[0];
|
|
10252
10261
|
}, d0 = (T) => {
|
|
10253
10262
|
var V;
|
|
10254
|
-
const
|
|
10263
|
+
const H = W0(a(tt.valueKey, !1)), k = (V = U(T)) == null ? void 0 : V.map((t0) => t0 == null ? void 0 : t0[H]);
|
|
10255
10264
|
return a(tt.multiple, !1) ? k : k == null ? void 0 : k[0];
|
|
10256
10265
|
}, A0 = (T) => {
|
|
10257
|
-
var
|
|
10258
|
-
return (
|
|
10266
|
+
var H;
|
|
10267
|
+
return (H = he(p0(T), !0)) == null ? void 0 : H.join(",");
|
|
10259
10268
|
}, e0 = [], T0 = () => {
|
|
10260
10269
|
t != null && t.formItemFlag && e0.splice(0, e0.length);
|
|
10261
10270
|
}, st = (T) => {
|
|
10262
|
-
var
|
|
10263
|
-
const k = u0(
|
|
10271
|
+
var H = a("required", !0);
|
|
10272
|
+
const k = u0(H == null ? void 0 : H.options);
|
|
10264
10273
|
if (k != null && k.enable)
|
|
10265
10274
|
return {
|
|
10266
10275
|
name: "required",
|
|
@@ -10273,9 +10282,9 @@ function yl(t, e, r, n) {
|
|
|
10273
10282
|
oe[i0.required](K, V, t0, k == null ? void 0 : k.forceMatch, x0);
|
|
10274
10283
|
}
|
|
10275
10284
|
};
|
|
10276
|
-
},
|
|
10277
|
-
var
|
|
10278
|
-
const k = u0(
|
|
10285
|
+
}, It = (T) => {
|
|
10286
|
+
var H = a("rangeValidate", !0);
|
|
10287
|
+
const k = u0(H == null ? void 0 : H.options);
|
|
10279
10288
|
if (!(k != null && k.enable))
|
|
10280
10289
|
return;
|
|
10281
10290
|
let { minValue: K, maxValue: V, includeMaxValue: t0, includeMinValue: x0 } = k, f0 = "range";
|
|
@@ -10295,8 +10304,8 @@ function yl(t, e, r, n) {
|
|
|
10295
10304
|
}
|
|
10296
10305
|
};
|
|
10297
10306
|
}, pt = (T) => {
|
|
10298
|
-
var
|
|
10299
|
-
const k = u0(
|
|
10307
|
+
var H = a("expValidate", !0);
|
|
10308
|
+
const k = u0(H == null ? void 0 : H.options);
|
|
10300
10309
|
if (!(k != null && k.enable))
|
|
10301
10310
|
return;
|
|
10302
10311
|
let K = k == null ? void 0 : k.expression, V = K;
|
|
@@ -10313,8 +10322,8 @@ function yl(t, e, r, n) {
|
|
|
10313
10322
|
};
|
|
10314
10323
|
}
|
|
10315
10324
|
}, O0 = (T) => {
|
|
10316
|
-
var
|
|
10317
|
-
const k = u0(
|
|
10325
|
+
var H = a("fnValidate", !0);
|
|
10326
|
+
const k = u0(H == null ? void 0 : H.options);
|
|
10318
10327
|
if (!(k != null && k.enable) || !k.func)
|
|
10319
10328
|
return;
|
|
10320
10329
|
const { instance: K } = nn(n), V = k == null ? void 0 : k.errorMsg;
|
|
@@ -10337,13 +10346,13 @@ function yl(t, e, r, n) {
|
|
|
10337
10346
|
}, w0 = () => {
|
|
10338
10347
|
if (t != null && t.formItemFlag && !a("hidden")) {
|
|
10339
10348
|
T0();
|
|
10340
|
-
var T = a("label"),
|
|
10349
|
+
var T = a("label"), H = [
|
|
10341
10350
|
st(T),
|
|
10342
10351
|
pt(T),
|
|
10343
10352
|
O0(T),
|
|
10344
|
-
|
|
10353
|
+
It(T)
|
|
10345
10354
|
];
|
|
10346
|
-
return
|
|
10355
|
+
return H == null || H.forEach((k) => {
|
|
10347
10356
|
k && e0.push(k);
|
|
10348
10357
|
}), it(), e0;
|
|
10349
10358
|
}
|
|
@@ -10368,7 +10377,7 @@ function yl(t, e, r, n) {
|
|
|
10368
10377
|
originSlots: Q,
|
|
10369
10378
|
computedDefaultValue: N,
|
|
10370
10379
|
fieldName: q,
|
|
10371
|
-
hasDefaultValue:
|
|
10380
|
+
hasDefaultValue: C,
|
|
10372
10381
|
optionItems: Y,
|
|
10373
10382
|
activeOptionItems: O,
|
|
10374
10383
|
activeOptionItem: z,
|
|
@@ -10396,19 +10405,19 @@ function yl(t, e, r, n) {
|
|
|
10396
10405
|
enableChangeRule: ot,
|
|
10397
10406
|
enableChangeValidate: it,
|
|
10398
10407
|
addCssClass: (T) => {
|
|
10399
|
-
var
|
|
10400
|
-
|
|
10408
|
+
var H = a("customClass");
|
|
10409
|
+
H ? H.push(T) : H = [T], B("customClass", H);
|
|
10401
10410
|
},
|
|
10402
10411
|
removeCssClass: (T) => {
|
|
10403
|
-
var
|
|
10404
|
-
if (!
|
|
10412
|
+
var H = a("customClass");
|
|
10413
|
+
if (!H)
|
|
10405
10414
|
return;
|
|
10406
10415
|
let k = -1;
|
|
10407
|
-
|
|
10416
|
+
H.map((K, V) => {
|
|
10408
10417
|
K === T && (k = V);
|
|
10409
|
-
}), k > -1 && (
|
|
10418
|
+
}), k > -1 && (H.splice(k, 1), B("customClass", H));
|
|
10410
10419
|
},
|
|
10411
|
-
singleOption:
|
|
10420
|
+
singleOption: d,
|
|
10412
10421
|
watchOption: h
|
|
10413
10422
|
};
|
|
10414
10423
|
}
|
|
@@ -10449,7 +10458,7 @@ function El(t, e) {
|
|
|
10449
10458
|
}, x = (l) => {
|
|
10450
10459
|
var y = ut(t.shouldFetch, l);
|
|
10451
10460
|
return wr(t.shouldFetch) || y + "" == "true" || y + "" == "1";
|
|
10452
|
-
},
|
|
10461
|
+
}, d = (l) => {
|
|
10453
10462
|
if (t.data == null || t.data === void 0)
|
|
10454
10463
|
return "";
|
|
10455
10464
|
var y = _r(t.data);
|
|
@@ -10459,14 +10468,14 @@ function El(t, e) {
|
|
|
10459
10468
|
return;
|
|
10460
10469
|
const y = ki.create(a());
|
|
10461
10470
|
return B(y, l), c(y, l), new Promise((A, g) => {
|
|
10462
|
-
const E = o(l), b =
|
|
10471
|
+
const E = o(l), b = d(l), F = s(l), _ = i(l);
|
|
10463
10472
|
if (!E)
|
|
10464
10473
|
return;
|
|
10465
10474
|
const S = {
|
|
10466
10475
|
url: E,
|
|
10467
10476
|
data: b,
|
|
10468
10477
|
headers: F,
|
|
10469
|
-
params:
|
|
10478
|
+
params: _
|
|
10470
10479
|
};
|
|
10471
10480
|
y.request(S).then((R) => {
|
|
10472
10481
|
let q = R;
|
|
@@ -10544,21 +10553,21 @@ function ml(t) {
|
|
|
10544
10553
|
return ri(l) ? l : new Promise((y, A) => {
|
|
10545
10554
|
y(l);
|
|
10546
10555
|
});
|
|
10547
|
-
},
|
|
10556
|
+
}, d = (v, f, l) => new Promise((y, A) => {
|
|
10548
10557
|
const g = v == null ? void 0 : v.length;
|
|
10549
10558
|
let E = 0;
|
|
10550
|
-
var b = v == null ? void 0 : v.map((
|
|
10559
|
+
var b = v == null ? void 0 : v.map((_) => x(_, f));
|
|
10551
10560
|
let F = 0;
|
|
10552
10561
|
Promise.all(b.map(
|
|
10553
|
-
(
|
|
10554
|
-
var
|
|
10562
|
+
(_) => _.then((S) => {
|
|
10563
|
+
var C;
|
|
10555
10564
|
E++;
|
|
10556
10565
|
var R = Math.round(E / g * 100);
|
|
10557
|
-
const q = v[F++], w = (
|
|
10566
|
+
const q = v[F++], w = (C = a(q)) == null ? void 0 : C.description;
|
|
10558
10567
|
return l == null || l(R, S, F, q, w), S;
|
|
10559
10568
|
})
|
|
10560
|
-
)).then((
|
|
10561
|
-
l == null || l(100,
|
|
10569
|
+
)).then((_) => {
|
|
10570
|
+
l == null || l(100, _, F, "completedAll", "completedAll"), y(_);
|
|
10562
10571
|
});
|
|
10563
10572
|
});
|
|
10564
10573
|
return {
|
|
@@ -10567,7 +10576,7 @@ function ml(t) {
|
|
|
10567
10576
|
readSchemaData: c,
|
|
10568
10577
|
findSchema: a,
|
|
10569
10578
|
getSchemaDataObject: (v, f, l) => new Promise((y, A) => {
|
|
10570
|
-
|
|
10579
|
+
d(v, f, l).then((g) => {
|
|
10571
10580
|
var E = {};
|
|
10572
10581
|
g.forEach((b) => {
|
|
10573
10582
|
E = ht(E, b, !0);
|
|
@@ -10575,7 +10584,7 @@ function ml(t) {
|
|
|
10575
10584
|
});
|
|
10576
10585
|
}),
|
|
10577
10586
|
getOneSchemaData: x,
|
|
10578
|
-
getSchemaDatas:
|
|
10587
|
+
getSchemaDatas: d
|
|
10579
10588
|
};
|
|
10580
10589
|
}
|
|
10581
10590
|
const mn = (t) => typeof (t == null ? void 0 : t.value) == "boolean" ? !1 : null, Ln = (t, e) => {
|
|
@@ -10584,11 +10593,11 @@ const mn = (t) => typeof (t == null ? void 0 : t.value) == "boolean" ? !1 : null
|
|
|
10584
10593
|
return r;
|
|
10585
10594
|
var n = e == null ? void 0 : e.instance;
|
|
10586
10595
|
return ei(ha(t), (s, i, o) => {
|
|
10587
|
-
var c, x,
|
|
10596
|
+
var c, x, d, h;
|
|
10588
10597
|
const a = (x = (c = n == null ? void 0 : n.exposed) == null ? void 0 : c.findRefByName) == null ? void 0 : x.call(c, i);
|
|
10589
10598
|
if (!a)
|
|
10590
10599
|
return;
|
|
10591
|
-
const B = (h = (
|
|
10600
|
+
const B = (h = (d = a == null ? void 0 : a.exposed) == null ? void 0 : d.getField) == null ? void 0 : h.call(d);
|
|
10592
10601
|
B && B.id && (r[B.id] = i);
|
|
10593
10602
|
}), r;
|
|
10594
10603
|
}, zn = (t) => {
|
|
@@ -10605,8 +10614,8 @@ const mn = (t) => typeof (t == null ? void 0 : t.value) == "boolean" ? !1 : null
|
|
|
10605
10614
|
}, bl = (t, e, r) => {
|
|
10606
10615
|
const { remoteReadSchemaData: n } = ml(r);
|
|
10607
10616
|
var s = fi(t), i = wa(s), o = i.filter((x) => [y0.schema.toString()].includes(x.root)), a = o == null ? void 0 : o.map((x) => {
|
|
10608
|
-
var
|
|
10609
|
-
return (h = (
|
|
10617
|
+
var d, h;
|
|
10618
|
+
return (h = (d = x == null ? void 0 : x.properties) == null ? void 0 : d[0]) == null ? void 0 : h.toString();
|
|
10610
10619
|
});
|
|
10611
10620
|
let B = null;
|
|
10612
10621
|
e && (B = Q0(e));
|
|
@@ -10622,7 +10631,7 @@ const mn = (t) => typeof (t == null ? void 0 : t.value) == "boolean" ? !1 : null
|
|
|
10622
10631
|
var a = e == null ? void 0 : e[y0.sysData];
|
|
10623
10632
|
a && (s = i(s, r || {}, (c, x) => Tt(x) ? null : `${(a == null ? void 0 : a[x]) || ""}`)), (B = Ot(e == null ? void 0 : e[y0.sysVar])) == null || B.forEach((c) => {
|
|
10624
10633
|
var x;
|
|
10625
|
-
a = (x = e == null ? void 0 : e[y0.sysVar]) == null ? void 0 : x[c], a && (s = i(s, a, (
|
|
10634
|
+
a = (x = e == null ? void 0 : e[y0.sysVar]) == null ? void 0 : x[c], a && (s = i(s, a, (d, h) => Tt(h) ? null : h, o("sysVar." + c)));
|
|
10626
10635
|
});
|
|
10627
10636
|
} else
|
|
10628
10637
|
return s = i(s, r || {}, (c, x) => x ? `${y0.sysData}.${x}` : (e || (e = {}), e[y0.sysData] || (e[y0.sysData] = {}), e[y0.sysData][c] === void 0 && (e[y0.sysData][c] = null), `${y0.sysData}.${c}`)), s;
|
|
@@ -10659,12 +10668,12 @@ const mn = (t) => typeof (t == null ? void 0 : t.value) == "boolean" ? !1 : null
|
|
|
10659
10668
|
}
|
|
10660
10669
|
if (e && r && ((r == null ? void 0 : r.length) || 0) > 0)
|
|
10661
10670
|
for (var x = 0; x < r.length; x++) {
|
|
10662
|
-
var
|
|
10671
|
+
var d = r == null ? void 0 : r[x], h = e == null ? void 0 : e[d];
|
|
10663
10672
|
if (Fn(h)) {
|
|
10664
10673
|
var v = (l = Ot(h)) == null ? void 0 : l.some((y) => ri(h[y]));
|
|
10665
10674
|
if (v) {
|
|
10666
10675
|
var f = await da(h);
|
|
10667
|
-
e[
|
|
10676
|
+
e[d] = f;
|
|
10668
10677
|
}
|
|
10669
10678
|
}
|
|
10670
10679
|
}
|
|
@@ -10720,7 +10729,7 @@ class Z {
|
|
|
10720
10729
|
}
|
|
10721
10730
|
static isComplex(e) {
|
|
10722
10731
|
const r = this.getType(e);
|
|
10723
|
-
return
|
|
10732
|
+
return Ia(X).includes(r);
|
|
10724
10733
|
//!!hasConfig(prop, 'type');
|
|
10725
10734
|
}
|
|
10726
10735
|
static hasComplexValue(e) {
|
|
@@ -10978,14 +10987,14 @@ class zr extends Et {
|
|
|
10978
10987
|
ht(this, r);
|
|
10979
10988
|
}
|
|
10980
10989
|
}
|
|
10981
|
-
class
|
|
10990
|
+
class Hl extends zr {
|
|
10982
10991
|
constructor(r) {
|
|
10983
10992
|
super(r);
|
|
10984
10993
|
j(this, "expression", "");
|
|
10985
10994
|
ht(this, r);
|
|
10986
10995
|
}
|
|
10987
10996
|
}
|
|
10988
|
-
class
|
|
10997
|
+
class Il extends zr {
|
|
10989
10998
|
constructor(r) {
|
|
10990
10999
|
super(r);
|
|
10991
11000
|
j(this, "func", "");
|
|
@@ -11113,7 +11122,7 @@ class Nl extends Un {
|
|
|
11113
11122
|
/**
|
|
11114
11123
|
* 正则表达式校验
|
|
11115
11124
|
*/
|
|
11116
|
-
j(this, "expValidate", new Z(X.placer, void 0, new
|
|
11125
|
+
j(this, "expValidate", new Z(X.placer, void 0, new Hl()));
|
|
11117
11126
|
/**
|
|
11118
11127
|
* 范围校验时调用事件
|
|
11119
11128
|
*/
|
|
@@ -11125,7 +11134,7 @@ class Nl extends Un {
|
|
|
11125
11134
|
/**
|
|
11126
11135
|
* 校验时调用事件
|
|
11127
11136
|
*/
|
|
11128
|
-
j(this, "fnValidate", new Z(X.placer, void 0, new
|
|
11137
|
+
j(this, "fnValidate", new Z(X.placer, void 0, new Il()));
|
|
11129
11138
|
}
|
|
11130
11139
|
/**
|
|
11131
11140
|
* 数值提示时调用事件
|
|
@@ -11290,7 +11299,7 @@ export {
|
|
|
11290
11299
|
Yl as m,
|
|
11291
11300
|
Ll as n,
|
|
11292
11301
|
s1 as o,
|
|
11293
|
-
|
|
11302
|
+
Ia as p,
|
|
11294
11303
|
Pl as q,
|
|
11295
11304
|
n1 as r,
|
|
11296
11305
|
Co as s,
|