zsysview 0.0.26 → 0.0.27
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/backup-DgoJ-AYS.js +519 -0
- package/dist/breadcrumb.vue_vue_type_script_setup_true_lang-CGEOrj8x.js +43 -0
- package/dist/change_password-CfTKlKzq.js +135 -0
- package/dist/department-SWj0HA-l.js +410 -0
- package/dist/desktop-le1cI27_.js +9 -0
- package/dist/http_api_v1-d9smAbJZ.js +1008 -0
- package/dist/index-BZZm3CTh.js +6688 -0
- package/dist/{index-BaFHeDAF.js → index-DG0x9mYD.js} +105 -105
- package/dist/index.es-DrN1BLo5.js +170 -0
- package/dist/log-D-BDBVS7.js +163 -0
- package/dist/login-DUn4tmOp.js +111 -0
- package/dist/main-Bgkb3hrI.js +293 -0
- package/dist/message-CVTa4Hb1.js +26 -0
- package/dist/position-D7u-VoeU.js +311 -0
- package/dist/role-CyCsBm0V.js +405 -0
- package/dist/self-BRTR2NdM.js +102 -0
- package/dist/sys-BZgBUI3k.js +30 -0
- package/dist/user-cl8kQwmL.js +650 -0
- package/dist/zsys_delbutton.vue_vue_type_script_setup_true_lang-Dqud3QQ4.js +72 -0
- package/dist/zsys_eventBus-CZOk9fTb.js +178 -0
- package/dist/zsys_time-4KclnYJN.js +17 -0
- package/dist/zsyslist.vue_vue_type_script_setup_true_lang-BE2Kl33t.js +466 -0
- package/dist/zsysview.es.js +1 -1
- package/package.json +1 -1
- package/dist/backup-BrCAKHW5.js +0 -519
- package/dist/breadcrumb.vue_vue_type_script_setup_true_lang-DxqktuR5.js +0 -43
- package/dist/change_password-CY87a5gc.js +0 -135
- package/dist/department-BDW7DB5F.js +0 -410
- package/dist/desktop-DgyBqclt.js +0 -9
- package/dist/http_api_v1-BQLGtV9G.js +0 -1008
- package/dist/index-DXGp4B8l.js +0 -6688
- package/dist/index.es-BcGc183Q.js +0 -170
- package/dist/log-2ZY0HGuh.js +0 -163
- package/dist/login-BAuvM04T.js +0 -111
- package/dist/main-CxdkVN-C.js +0 -293
- package/dist/message-CdVUOGzt.js +0 -26
- package/dist/position-D7wr1m96.js +0 -311
- package/dist/role-M_ZYR2ta.js +0 -405
- package/dist/self-DAB-5Co8.js +0 -102
- package/dist/sys-BjlP52cg.js +0 -30
- package/dist/user-CEaf7VIW.js +0 -650
- package/dist/zsys_delbutton.vue_vue_type_script_setup_true_lang-BYahBvHu.js +0 -72
- package/dist/zsys_eventBus-DDrk0Aw8.js +0 -178
- package/dist/zsys_time-DHEMuVgo.js +0 -17
- package/dist/zsyslist.vue_vue_type_script_setup_true_lang-Bl1QXOML.js +0 -466
|
@@ -1,1008 +0,0 @@
|
|
|
1
|
-
import Te from "axios";
|
|
2
|
-
import { a as De } from "./index-DXGp4B8l.js";
|
|
3
|
-
function Me(y) {
|
|
4
|
-
return y && y.__esModule && Object.prototype.hasOwnProperty.call(y, "default") ? y.default : y;
|
|
5
|
-
}
|
|
6
|
-
var pe = { exports: {} }, Oe = { exports: {} }, _e = { exports: {} }, Ce = _e.exports, Se;
|
|
7
|
-
function qe() {
|
|
8
|
-
return Se || (Se = 1, (function(y) {
|
|
9
|
-
(function($) {
|
|
10
|
-
var V, re = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, O = Math.ceil, B = Math.floor, q = "[BigNumber Error] ", _ = q + "Number primitive has more than 15 significant digits: ", W = 1e14, d = 14, C = 9007199254740991, v = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], I = 1e7, P = 1e9;
|
|
11
|
-
function z(A) {
|
|
12
|
-
var m, D, M, h = p.prototype = { constructor: p, toString: null, valueOf: null }, b = new p(1), F = 20, U = 4, Z = -7, K = 21, ue = -1e7, ie = 1e7, le = !1, ae = 1, oe = 0, de = {
|
|
13
|
-
prefix: "",
|
|
14
|
-
groupSize: 3,
|
|
15
|
-
secondaryGroupSize: 0,
|
|
16
|
-
groupSeparator: ",",
|
|
17
|
-
decimalSeparator: ".",
|
|
18
|
-
fractionGroupSize: 0,
|
|
19
|
-
fractionGroupSeparator: " ",
|
|
20
|
-
// non-breaking space
|
|
21
|
-
suffix: ""
|
|
22
|
-
}, fe = "0123456789abcdefghijklmnopqrstuvwxyz", we = !0;
|
|
23
|
-
function p(e, t) {
|
|
24
|
-
var r, l, n, o, a, i, s, f, u = this;
|
|
25
|
-
if (!(u instanceof p)) return new p(e, t);
|
|
26
|
-
if (t == null) {
|
|
27
|
-
if (e && e._isBigNumber === !0) {
|
|
28
|
-
u.s = e.s, !e.c || e.e > ie ? u.c = u.e = null : e.e < ue ? u.c = [u.e = 0] : (u.e = e.e, u.c = e.c.slice());
|
|
29
|
-
return;
|
|
30
|
-
}
|
|
31
|
-
if ((i = typeof e == "number") && e * 0 == 0) {
|
|
32
|
-
if (u.s = 1 / e < 0 ? (e = -e, -1) : 1, e === ~~e) {
|
|
33
|
-
for (o = 0, a = e; a >= 10; a /= 10, o++) ;
|
|
34
|
-
o > ie ? u.c = u.e = null : (u.e = o, u.c = [e]);
|
|
35
|
-
return;
|
|
36
|
-
}
|
|
37
|
-
f = String(e);
|
|
38
|
-
} else {
|
|
39
|
-
if (!re.test(f = String(e))) return M(u, f, i);
|
|
40
|
-
u.s = f.charCodeAt(0) == 45 ? (f = f.slice(1), -1) : 1;
|
|
41
|
-
}
|
|
42
|
-
(o = f.indexOf(".")) > -1 && (f = f.replace(".", "")), (a = f.search(/e/i)) > 0 ? (o < 0 && (o = a), o += +f.slice(a + 1), f = f.substring(0, a)) : o < 0 && (o = f.length);
|
|
43
|
-
} else {
|
|
44
|
-
if (N(t, 2, fe.length, "Base"), t == 10 && we)
|
|
45
|
-
return u = new p(e), ee(u, F + u.e + 1, U);
|
|
46
|
-
if (f = String(e), i = typeof e == "number") {
|
|
47
|
-
if (e * 0 != 0) return M(u, f, i, t);
|
|
48
|
-
if (u.s = 1 / e < 0 ? (f = f.slice(1), -1) : 1, p.DEBUG && f.replace(/^0\.0*|\./, "").length > 15)
|
|
49
|
-
throw Error(_ + e);
|
|
50
|
-
} else
|
|
51
|
-
u.s = f.charCodeAt(0) === 45 ? (f = f.slice(1), -1) : 1;
|
|
52
|
-
for (r = fe.slice(0, t), o = a = 0, s = f.length; a < s; a++)
|
|
53
|
-
if (r.indexOf(l = f.charAt(a)) < 0) {
|
|
54
|
-
if (l == ".") {
|
|
55
|
-
if (a > o) {
|
|
56
|
-
o = s;
|
|
57
|
-
continue;
|
|
58
|
-
}
|
|
59
|
-
} else if (!n && (f == f.toUpperCase() && (f = f.toLowerCase()) || f == f.toLowerCase() && (f = f.toUpperCase()))) {
|
|
60
|
-
n = !0, a = -1, o = 0;
|
|
61
|
-
continue;
|
|
62
|
-
}
|
|
63
|
-
return M(u, String(e), i, t);
|
|
64
|
-
}
|
|
65
|
-
i = !1, f = D(f, t, 10, u.s), (o = f.indexOf(".")) > -1 ? f = f.replace(".", "") : o = f.length;
|
|
66
|
-
}
|
|
67
|
-
for (a = 0; f.charCodeAt(a) === 48; a++) ;
|
|
68
|
-
for (s = f.length; f.charCodeAt(--s) === 48; ) ;
|
|
69
|
-
if (f = f.slice(a, ++s)) {
|
|
70
|
-
if (s -= a, i && p.DEBUG && s > 15 && (e > C || e !== B(e)))
|
|
71
|
-
throw Error(_ + u.s * e);
|
|
72
|
-
if ((o = o - a - 1) > ie)
|
|
73
|
-
u.c = u.e = null;
|
|
74
|
-
else if (o < ue)
|
|
75
|
-
u.c = [u.e = 0];
|
|
76
|
-
else {
|
|
77
|
-
if (u.e = o, u.c = [], a = (o + 1) % d, o < 0 && (a += d), a < s) {
|
|
78
|
-
for (a && u.c.push(+f.slice(0, a)), s -= d; a < s; )
|
|
79
|
-
u.c.push(+f.slice(a, a += d));
|
|
80
|
-
a = d - (f = f.slice(a)).length;
|
|
81
|
-
} else
|
|
82
|
-
a -= s;
|
|
83
|
-
for (; a--; f += "0") ;
|
|
84
|
-
u.c.push(+f);
|
|
85
|
-
}
|
|
86
|
-
} else
|
|
87
|
-
u.c = [u.e = 0];
|
|
88
|
-
}
|
|
89
|
-
p.clone = z, p.ROUND_UP = 0, p.ROUND_DOWN = 1, p.ROUND_CEIL = 2, p.ROUND_FLOOR = 3, p.ROUND_HALF_UP = 4, p.ROUND_HALF_DOWN = 5, p.ROUND_HALF_EVEN = 6, p.ROUND_HALF_CEIL = 7, p.ROUND_HALF_FLOOR = 8, p.EUCLID = 9, p.config = p.set = function(e) {
|
|
90
|
-
var t, r;
|
|
91
|
-
if (e != null)
|
|
92
|
-
if (typeof e == "object") {
|
|
93
|
-
if (e.hasOwnProperty(t = "DECIMAL_PLACES") && (r = e[t], N(r, 0, P, t), F = r), e.hasOwnProperty(t = "ROUNDING_MODE") && (r = e[t], N(r, 0, 8, t), U = r), e.hasOwnProperty(t = "EXPONENTIAL_AT") && (r = e[t], r && r.pop ? (N(r[0], -P, 0, t), N(r[1], 0, P, t), Z = r[0], K = r[1]) : (N(r, -P, P, t), Z = -(K = r < 0 ? -r : r))), e.hasOwnProperty(t = "RANGE"))
|
|
94
|
-
if (r = e[t], r && r.pop)
|
|
95
|
-
N(r[0], -P, -1, t), N(r[1], 1, P, t), ue = r[0], ie = r[1];
|
|
96
|
-
else if (N(r, -P, P, t), r)
|
|
97
|
-
ue = -(ie = r < 0 ? -r : r);
|
|
98
|
-
else
|
|
99
|
-
throw Error(q + t + " cannot be zero: " + r);
|
|
100
|
-
if (e.hasOwnProperty(t = "CRYPTO"))
|
|
101
|
-
if (r = e[t], r === !!r)
|
|
102
|
-
if (r)
|
|
103
|
-
if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
|
|
104
|
-
le = r;
|
|
105
|
-
else
|
|
106
|
-
throw le = !r, Error(q + "crypto unavailable");
|
|
107
|
-
else
|
|
108
|
-
le = r;
|
|
109
|
-
else
|
|
110
|
-
throw Error(q + t + " not true or false: " + r);
|
|
111
|
-
if (e.hasOwnProperty(t = "MODULO_MODE") && (r = e[t], N(r, 0, 9, t), ae = r), e.hasOwnProperty(t = "POW_PRECISION") && (r = e[t], N(r, 0, P, t), oe = r), e.hasOwnProperty(t = "FORMAT"))
|
|
112
|
-
if (r = e[t], typeof r == "object") de = r;
|
|
113
|
-
else throw Error(q + t + " not an object: " + r);
|
|
114
|
-
if (e.hasOwnProperty(t = "ALPHABET"))
|
|
115
|
-
if (r = e[t], typeof r == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(r))
|
|
116
|
-
we = r.slice(0, 10) == "0123456789", fe = r;
|
|
117
|
-
else
|
|
118
|
-
throw Error(q + t + " invalid: " + r);
|
|
119
|
-
} else
|
|
120
|
-
throw Error(q + "Object expected: " + e);
|
|
121
|
-
return {
|
|
122
|
-
DECIMAL_PLACES: F,
|
|
123
|
-
ROUNDING_MODE: U,
|
|
124
|
-
EXPONENTIAL_AT: [Z, K],
|
|
125
|
-
RANGE: [ue, ie],
|
|
126
|
-
CRYPTO: le,
|
|
127
|
-
MODULO_MODE: ae,
|
|
128
|
-
POW_PRECISION: oe,
|
|
129
|
-
FORMAT: de,
|
|
130
|
-
ALPHABET: fe
|
|
131
|
-
};
|
|
132
|
-
}, p.isBigNumber = function(e) {
|
|
133
|
-
if (!e || e._isBigNumber !== !0) return !1;
|
|
134
|
-
if (!p.DEBUG) return !0;
|
|
135
|
-
var t, r, l = e.c, n = e.e, o = e.s;
|
|
136
|
-
e: if ({}.toString.call(l) == "[object Array]") {
|
|
137
|
-
if ((o === 1 || o === -1) && n >= -P && n <= P && n === B(n)) {
|
|
138
|
-
if (l[0] === 0) {
|
|
139
|
-
if (n === 0 && l.length === 1) return !0;
|
|
140
|
-
break e;
|
|
141
|
-
}
|
|
142
|
-
if (t = (n + 1) % d, t < 1 && (t += d), String(l[0]).length == t) {
|
|
143
|
-
for (t = 0; t < l.length; t++)
|
|
144
|
-
if (r = l[t], r < 0 || r >= W || r !== B(r)) break e;
|
|
145
|
-
if (r !== 0) return !0;
|
|
146
|
-
}
|
|
147
|
-
}
|
|
148
|
-
} else if (l === null && n === null && (o === null || o === 1 || o === -1))
|
|
149
|
-
return !0;
|
|
150
|
-
throw Error(q + "Invalid BigNumber: " + e);
|
|
151
|
-
}, p.maximum = p.max = function() {
|
|
152
|
-
return Be(arguments, -1);
|
|
153
|
-
}, p.minimum = p.min = function() {
|
|
154
|
-
return Be(arguments, 1);
|
|
155
|
-
}, p.random = (function() {
|
|
156
|
-
var e = 9007199254740992, t = Math.random() * e & 2097151 ? function() {
|
|
157
|
-
return B(Math.random() * e);
|
|
158
|
-
} : function() {
|
|
159
|
-
return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
|
|
160
|
-
};
|
|
161
|
-
return function(r) {
|
|
162
|
-
var l, n, o, a, i, s = 0, f = [], u = new p(b);
|
|
163
|
-
if (r == null ? r = F : N(r, 0, P), a = O(r / d), le)
|
|
164
|
-
if (crypto.getRandomValues) {
|
|
165
|
-
for (l = crypto.getRandomValues(new Uint32Array(a *= 2)); s < a; )
|
|
166
|
-
i = l[s] * 131072 + (l[s + 1] >>> 11), i >= 9e15 ? (n = crypto.getRandomValues(new Uint32Array(2)), l[s] = n[0], l[s + 1] = n[1]) : (f.push(i % 1e14), s += 2);
|
|
167
|
-
s = a / 2;
|
|
168
|
-
} else if (crypto.randomBytes) {
|
|
169
|
-
for (l = crypto.randomBytes(a *= 7); s < a; )
|
|
170
|
-
i = (l[s] & 31) * 281474976710656 + l[s + 1] * 1099511627776 + l[s + 2] * 4294967296 + l[s + 3] * 16777216 + (l[s + 4] << 16) + (l[s + 5] << 8) + l[s + 6], i >= 9e15 ? crypto.randomBytes(7).copy(l, s) : (f.push(i % 1e14), s += 7);
|
|
171
|
-
s = a / 7;
|
|
172
|
-
} else
|
|
173
|
-
throw le = !1, Error(q + "crypto unavailable");
|
|
174
|
-
if (!le)
|
|
175
|
-
for (; s < a; )
|
|
176
|
-
i = t(), i < 9e15 && (f[s++] = i % 1e14);
|
|
177
|
-
for (a = f[--s], r %= d, a && r && (i = v[d - r], f[s] = B(a / i) * i); f[s] === 0; f.pop(), s--) ;
|
|
178
|
-
if (s < 0)
|
|
179
|
-
f = [o = 0];
|
|
180
|
-
else {
|
|
181
|
-
for (o = -1; f[0] === 0; f.splice(0, 1), o -= d) ;
|
|
182
|
-
for (s = 1, i = f[0]; i >= 10; i /= 10, s++) ;
|
|
183
|
-
s < d && (o -= d - s);
|
|
184
|
-
}
|
|
185
|
-
return u.e = o, u.c = f, u;
|
|
186
|
-
};
|
|
187
|
-
})(), p.sum = function() {
|
|
188
|
-
for (var e = 1, t = arguments, r = new p(t[0]); e < t.length; ) r = r.plus(t[e++]);
|
|
189
|
-
return r;
|
|
190
|
-
}, D = /* @__PURE__ */ (function() {
|
|
191
|
-
var e = "0123456789";
|
|
192
|
-
function t(r, l, n, o) {
|
|
193
|
-
for (var a, i = [0], s, f = 0, u = r.length; f < u; ) {
|
|
194
|
-
for (s = i.length; s--; i[s] *= l) ;
|
|
195
|
-
for (i[0] += o.indexOf(r.charAt(f++)), a = 0; a < i.length; a++)
|
|
196
|
-
i[a] > n - 1 && (i[a + 1] == null && (i[a + 1] = 0), i[a + 1] += i[a] / n | 0, i[a] %= n);
|
|
197
|
-
}
|
|
198
|
-
return i.reverse();
|
|
199
|
-
}
|
|
200
|
-
return function(r, l, n, o, a) {
|
|
201
|
-
var i, s, f, u, c, g, w, k, j = r.indexOf("."), X = F, S = U;
|
|
202
|
-
for (j >= 0 && (u = oe, oe = 0, r = r.replace(".", ""), k = new p(l), g = k.pow(r.length - j), oe = u, k.c = t(
|
|
203
|
-
L(T(g.c), g.e, "0"),
|
|
204
|
-
10,
|
|
205
|
-
n,
|
|
206
|
-
e
|
|
207
|
-
), k.e = k.c.length), w = t(r, l, n, a ? (i = fe, e) : (i = e, fe)), f = u = w.length; w[--u] == 0; w.pop()) ;
|
|
208
|
-
if (!w[0]) return i.charAt(0);
|
|
209
|
-
if (j < 0 ? --f : (g.c = w, g.e = f, g.s = o, g = m(g, k, X, S, n), w = g.c, c = g.r, f = g.e), s = f + X + 1, j = w[s], u = n / 2, c = c || s < 0 || w[s + 1] != null, c = S < 4 ? (j != null || c) && (S == 0 || S == (g.s < 0 ? 3 : 2)) : j > u || j == u && (S == 4 || c || S == 6 && w[s - 1] & 1 || S == (g.s < 0 ? 8 : 7)), s < 1 || !w[0])
|
|
210
|
-
r = c ? L(i.charAt(1), -X, i.charAt(0)) : i.charAt(0);
|
|
211
|
-
else {
|
|
212
|
-
if (w.length = s, c)
|
|
213
|
-
for (--n; ++w[--s] > n; )
|
|
214
|
-
w[s] = 0, s || (++f, w = [1].concat(w));
|
|
215
|
-
for (u = w.length; !w[--u]; ) ;
|
|
216
|
-
for (j = 0, r = ""; j <= u; r += i.charAt(w[j++])) ;
|
|
217
|
-
r = L(r, f, i.charAt(0));
|
|
218
|
-
}
|
|
219
|
-
return r;
|
|
220
|
-
};
|
|
221
|
-
})(), m = /* @__PURE__ */ (function() {
|
|
222
|
-
function e(l, n, o) {
|
|
223
|
-
var a, i, s, f, u = 0, c = l.length, g = n % I, w = n / I | 0;
|
|
224
|
-
for (l = l.slice(); c--; )
|
|
225
|
-
s = l[c] % I, f = l[c] / I | 0, a = w * s + f * g, i = g * s + a % I * I + u, u = (i / o | 0) + (a / I | 0) + w * f, l[c] = i % o;
|
|
226
|
-
return u && (l = [u].concat(l)), l;
|
|
227
|
-
}
|
|
228
|
-
function t(l, n, o, a) {
|
|
229
|
-
var i, s;
|
|
230
|
-
if (o != a)
|
|
231
|
-
s = o > a ? 1 : -1;
|
|
232
|
-
else
|
|
233
|
-
for (i = s = 0; i < o; i++)
|
|
234
|
-
if (l[i] != n[i]) {
|
|
235
|
-
s = l[i] > n[i] ? 1 : -1;
|
|
236
|
-
break;
|
|
237
|
-
}
|
|
238
|
-
return s;
|
|
239
|
-
}
|
|
240
|
-
function r(l, n, o, a) {
|
|
241
|
-
for (var i = 0; o--; )
|
|
242
|
-
l[o] -= i, i = l[o] < n[o] ? 1 : 0, l[o] = i * a + l[o] - n[o];
|
|
243
|
-
for (; !l[0] && l.length > 1; l.splice(0, 1)) ;
|
|
244
|
-
}
|
|
245
|
-
return function(l, n, o, a, i) {
|
|
246
|
-
var s, f, u, c, g, w, k, j, X, S, R, Y, he, Ne, Ae, ne, ce, te = l.s == n.s ? 1 : -1, Q = l.c, G = n.c;
|
|
247
|
-
if (!Q || !Q[0] || !G || !G[0])
|
|
248
|
-
return new p(
|
|
249
|
-
// Return NaN if either NaN, or both Infinity or 0.
|
|
250
|
-
!l.s || !n.s || (Q ? G && Q[0] == G[0] : !G) ? NaN : (
|
|
251
|
-
// Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
|
|
252
|
-
Q && Q[0] == 0 || !G ? te * 0 : te / 0
|
|
253
|
-
)
|
|
254
|
-
);
|
|
255
|
-
for (j = new p(te), X = j.c = [], f = l.e - n.e, te = o + f + 1, i || (i = W, f = J(l.e / d) - J(n.e / d), te = te / d | 0), u = 0; G[u] == (Q[u] || 0); u++) ;
|
|
256
|
-
if (G[u] > (Q[u] || 0) && f--, te < 0)
|
|
257
|
-
X.push(1), c = !0;
|
|
258
|
-
else {
|
|
259
|
-
for (Ne = Q.length, ne = G.length, u = 0, te += 2, g = B(i / (G[0] + 1)), g > 1 && (G = e(G, g, i), Q = e(Q, g, i), ne = G.length, Ne = Q.length), he = ne, S = Q.slice(0, ne), R = S.length; R < ne; S[R++] = 0) ;
|
|
260
|
-
ce = G.slice(), ce = [0].concat(ce), Ae = G[0], G[1] >= i / 2 && Ae++;
|
|
261
|
-
do {
|
|
262
|
-
if (g = 0, s = t(G, S, ne, R), s < 0) {
|
|
263
|
-
if (Y = S[0], ne != R && (Y = Y * i + (S[1] || 0)), g = B(Y / Ae), g > 1)
|
|
264
|
-
for (g >= i && (g = i - 1), w = e(G, g, i), k = w.length, R = S.length; t(w, S, k, R) == 1; )
|
|
265
|
-
g--, r(w, ne < k ? ce : G, k, i), k = w.length, s = 1;
|
|
266
|
-
else
|
|
267
|
-
g == 0 && (s = g = 1), w = G.slice(), k = w.length;
|
|
268
|
-
if (k < R && (w = [0].concat(w)), r(S, w, R, i), R = S.length, s == -1)
|
|
269
|
-
for (; t(G, S, ne, R) < 1; )
|
|
270
|
-
g++, r(S, ne < R ? ce : G, R, i), R = S.length;
|
|
271
|
-
} else s === 0 && (g++, S = [0]);
|
|
272
|
-
X[u++] = g, S[0] ? S[R++] = Q[he] || 0 : (S = [Q[he]], R = 1);
|
|
273
|
-
} while ((he++ < Ne || S[0] != null) && te--);
|
|
274
|
-
c = S[0] != null, X[0] || X.splice(0, 1);
|
|
275
|
-
}
|
|
276
|
-
if (i == W) {
|
|
277
|
-
for (u = 1, te = X[0]; te >= 10; te /= 10, u++) ;
|
|
278
|
-
ee(j, o + (j.e = u + f * d - 1) + 1, a, c);
|
|
279
|
-
} else
|
|
280
|
-
j.e = f, j.r = +c;
|
|
281
|
-
return j;
|
|
282
|
-
};
|
|
283
|
-
})();
|
|
284
|
-
function me(e, t, r, l) {
|
|
285
|
-
var n, o, a, i, s;
|
|
286
|
-
if (r == null ? r = U : N(r, 0, 8), !e.c) return e.toString();
|
|
287
|
-
if (n = e.c[0], a = e.e, t == null)
|
|
288
|
-
s = T(e.c), s = l == 1 || l == 2 && (a <= Z || a >= K) ? x(s, a) : L(s, a, "0");
|
|
289
|
-
else if (e = ee(new p(e), t, r), o = e.e, s = T(e.c), i = s.length, l == 1 || l == 2 && (t <= o || o <= Z)) {
|
|
290
|
-
for (; i < t; s += "0", i++) ;
|
|
291
|
-
s = x(s, o);
|
|
292
|
-
} else if (t -= a + (l === 2 && o > a), s = L(s, o, "0"), o + 1 > i) {
|
|
293
|
-
if (--t > 0) for (s += "."; t--; s += "0") ;
|
|
294
|
-
} else if (t += o - i, t > 0)
|
|
295
|
-
for (o + 1 == i && (s += "."); t--; s += "0") ;
|
|
296
|
-
return e.s < 0 && n ? "-" + s : s;
|
|
297
|
-
}
|
|
298
|
-
function Be(e, t) {
|
|
299
|
-
for (var r, l, n = 1, o = new p(e[0]); n < e.length; n++)
|
|
300
|
-
l = new p(e[n]), (!l.s || (r = H(o, l)) === t || r === 0 && o.s === t) && (o = l);
|
|
301
|
-
return o;
|
|
302
|
-
}
|
|
303
|
-
function ve(e, t, r) {
|
|
304
|
-
for (var l = 1, n = t.length; !t[--n]; t.pop()) ;
|
|
305
|
-
for (n = t[0]; n >= 10; n /= 10, l++) ;
|
|
306
|
-
return (r = l + r * d - 1) > ie ? e.c = e.e = null : r < ue ? e.c = [e.e = 0] : (e.e = r, e.c = t), e;
|
|
307
|
-
}
|
|
308
|
-
M = /* @__PURE__ */ (function() {
|
|
309
|
-
var e = /^(-?)0([xbo])(?=\w[\w.]*$)/i, t = /^([^.]+)\.$/, r = /^\.([^.]+)$/, l = /^-?(Infinity|NaN)$/, n = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
|
|
310
|
-
return function(o, a, i, s) {
|
|
311
|
-
var f, u = i ? a : a.replace(n, "");
|
|
312
|
-
if (l.test(u))
|
|
313
|
-
o.s = isNaN(u) ? null : u < 0 ? -1 : 1;
|
|
314
|
-
else {
|
|
315
|
-
if (!i && (u = u.replace(e, function(c, g, w) {
|
|
316
|
-
return f = (w = w.toLowerCase()) == "x" ? 16 : w == "b" ? 2 : 8, !s || s == f ? g : c;
|
|
317
|
-
}), s && (f = s, u = u.replace(t, "$1").replace(r, "0.$1")), a != u))
|
|
318
|
-
return new p(u, f);
|
|
319
|
-
if (p.DEBUG)
|
|
320
|
-
throw Error(q + "Not a" + (s ? " base " + s : "") + " number: " + a);
|
|
321
|
-
o.s = null;
|
|
322
|
-
}
|
|
323
|
-
o.c = o.e = null;
|
|
324
|
-
};
|
|
325
|
-
})();
|
|
326
|
-
function ee(e, t, r, l) {
|
|
327
|
-
var n, o, a, i, s, f, u, c = e.c, g = v;
|
|
328
|
-
if (c) {
|
|
329
|
-
e: {
|
|
330
|
-
for (n = 1, i = c[0]; i >= 10; i /= 10, n++) ;
|
|
331
|
-
if (o = t - n, o < 0)
|
|
332
|
-
o += d, a = t, s = c[f = 0], u = B(s / g[n - a - 1] % 10);
|
|
333
|
-
else if (f = O((o + 1) / d), f >= c.length)
|
|
334
|
-
if (l) {
|
|
335
|
-
for (; c.length <= f; c.push(0)) ;
|
|
336
|
-
s = u = 0, n = 1, o %= d, a = o - d + 1;
|
|
337
|
-
} else
|
|
338
|
-
break e;
|
|
339
|
-
else {
|
|
340
|
-
for (s = i = c[f], n = 1; i >= 10; i /= 10, n++) ;
|
|
341
|
-
o %= d, a = o - d + n, u = a < 0 ? 0 : B(s / g[n - a - 1] % 10);
|
|
342
|
-
}
|
|
343
|
-
if (l = l || t < 0 || // Are there any non-zero digits after the rounding digit?
|
|
344
|
-
// The expression n % pows10[d - j - 1] returns all digits of n to the right
|
|
345
|
-
// of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.
|
|
346
|
-
c[f + 1] != null || (a < 0 ? s : s % g[n - a - 1]), l = r < 4 ? (u || l) && (r == 0 || r == (e.s < 0 ? 3 : 2)) : u > 5 || u == 5 && (r == 4 || l || r == 6 && // Check whether the digit to the left of the rounding digit is odd.
|
|
347
|
-
(o > 0 ? a > 0 ? s / g[n - a] : 0 : c[f - 1]) % 10 & 1 || r == (e.s < 0 ? 8 : 7)), t < 1 || !c[0])
|
|
348
|
-
return c.length = 0, l ? (t -= e.e + 1, c[0] = g[(d - t % d) % d], e.e = -t || 0) : c[0] = e.e = 0, e;
|
|
349
|
-
if (o == 0 ? (c.length = f, i = 1, f--) : (c.length = f + 1, i = g[d - o], c[f] = a > 0 ? B(s / g[n - a] % g[a]) * i : 0), l)
|
|
350
|
-
for (; ; )
|
|
351
|
-
if (f == 0) {
|
|
352
|
-
for (o = 1, a = c[0]; a >= 10; a /= 10, o++) ;
|
|
353
|
-
for (a = c[0] += i, i = 1; a >= 10; a /= 10, i++) ;
|
|
354
|
-
o != i && (e.e++, c[0] == W && (c[0] = 1));
|
|
355
|
-
break;
|
|
356
|
-
} else {
|
|
357
|
-
if (c[f] += i, c[f] != W) break;
|
|
358
|
-
c[f--] = 0, i = 1;
|
|
359
|
-
}
|
|
360
|
-
for (o = c.length; c[--o] === 0; c.pop()) ;
|
|
361
|
-
}
|
|
362
|
-
e.e > ie ? e.c = e.e = null : e.e < ue && (e.c = [e.e = 0]);
|
|
363
|
-
}
|
|
364
|
-
return e;
|
|
365
|
-
}
|
|
366
|
-
function se(e) {
|
|
367
|
-
var t, r = e.e;
|
|
368
|
-
return r === null ? e.toString() : (t = T(e.c), t = r <= Z || r >= K ? x(t, r) : L(t, r, "0"), e.s < 0 ? "-" + t : t);
|
|
369
|
-
}
|
|
370
|
-
return h.absoluteValue = h.abs = function() {
|
|
371
|
-
var e = new p(this);
|
|
372
|
-
return e.s < 0 && (e.s = 1), e;
|
|
373
|
-
}, h.comparedTo = function(e, t) {
|
|
374
|
-
return H(this, new p(e, t));
|
|
375
|
-
}, h.decimalPlaces = h.dp = function(e, t) {
|
|
376
|
-
var r, l, n, o = this;
|
|
377
|
-
if (e != null)
|
|
378
|
-
return N(e, 0, P), t == null ? t = U : N(t, 0, 8), ee(new p(o), e + o.e + 1, t);
|
|
379
|
-
if (!(r = o.c)) return null;
|
|
380
|
-
if (l = ((n = r.length - 1) - J(this.e / d)) * d, n = r[n]) for (; n % 10 == 0; n /= 10, l--) ;
|
|
381
|
-
return l < 0 && (l = 0), l;
|
|
382
|
-
}, h.dividedBy = h.div = function(e, t) {
|
|
383
|
-
return m(this, new p(e, t), F, U);
|
|
384
|
-
}, h.dividedToIntegerBy = h.idiv = function(e, t) {
|
|
385
|
-
return m(this, new p(e, t), 0, 1);
|
|
386
|
-
}, h.exponentiatedBy = h.pow = function(e, t) {
|
|
387
|
-
var r, l, n, o, a, i, s, f, u, c = this;
|
|
388
|
-
if (e = new p(e), e.c && !e.isInteger())
|
|
389
|
-
throw Error(q + "Exponent not an integer: " + se(e));
|
|
390
|
-
if (t != null && (t = new p(t)), i = e.e > 14, !c.c || !c.c[0] || c.c[0] == 1 && !c.e && c.c.length == 1 || !e.c || !e.c[0])
|
|
391
|
-
return u = new p(Math.pow(+se(c), i ? e.s * (2 - E(e)) : +se(e))), t ? u.mod(t) : u;
|
|
392
|
-
if (s = e.s < 0, t) {
|
|
393
|
-
if (t.c ? !t.c[0] : !t.s) return new p(NaN);
|
|
394
|
-
l = !s && c.isInteger() && t.isInteger(), l && (c = c.mod(t));
|
|
395
|
-
} else {
|
|
396
|
-
if (e.e > 9 && (c.e > 0 || c.e < -1 || (c.e == 0 ? c.c[0] > 1 || i && c.c[1] >= 24e7 : c.c[0] < 8e13 || i && c.c[0] <= 9999975e7)))
|
|
397
|
-
return o = c.s < 0 && E(e) ? -0 : 0, c.e > -1 && (o = 1 / o), new p(s ? 1 / o : o);
|
|
398
|
-
oe && (o = O(oe / d + 2));
|
|
399
|
-
}
|
|
400
|
-
for (i ? (r = new p(0.5), s && (e.s = 1), f = E(e)) : (n = Math.abs(+se(e)), f = n % 2), u = new p(b); ; ) {
|
|
401
|
-
if (f) {
|
|
402
|
-
if (u = u.times(c), !u.c) break;
|
|
403
|
-
o ? u.c.length > o && (u.c.length = o) : l && (u = u.mod(t));
|
|
404
|
-
}
|
|
405
|
-
if (n) {
|
|
406
|
-
if (n = B(n / 2), n === 0) break;
|
|
407
|
-
f = n % 2;
|
|
408
|
-
} else if (e = e.times(r), ee(e, e.e + 1, 1), e.e > 14)
|
|
409
|
-
f = E(e);
|
|
410
|
-
else {
|
|
411
|
-
if (n = +se(e), n === 0) break;
|
|
412
|
-
f = n % 2;
|
|
413
|
-
}
|
|
414
|
-
c = c.times(c), o ? c.c && c.c.length > o && (c.c.length = o) : l && (c = c.mod(t));
|
|
415
|
-
}
|
|
416
|
-
return l ? u : (s && (u = b.div(u)), t ? u.mod(t) : o ? ee(u, oe, U, a) : u);
|
|
417
|
-
}, h.integerValue = function(e) {
|
|
418
|
-
var t = new p(this);
|
|
419
|
-
return e == null ? e = U : N(e, 0, 8), ee(t, t.e + 1, e);
|
|
420
|
-
}, h.isEqualTo = h.eq = function(e, t) {
|
|
421
|
-
return H(this, new p(e, t)) === 0;
|
|
422
|
-
}, h.isFinite = function() {
|
|
423
|
-
return !!this.c;
|
|
424
|
-
}, h.isGreaterThan = h.gt = function(e, t) {
|
|
425
|
-
return H(this, new p(e, t)) > 0;
|
|
426
|
-
}, h.isGreaterThanOrEqualTo = h.gte = function(e, t) {
|
|
427
|
-
return (t = H(this, new p(e, t))) === 1 || t === 0;
|
|
428
|
-
}, h.isInteger = function() {
|
|
429
|
-
return !!this.c && J(this.e / d) > this.c.length - 2;
|
|
430
|
-
}, h.isLessThan = h.lt = function(e, t) {
|
|
431
|
-
return H(this, new p(e, t)) < 0;
|
|
432
|
-
}, h.isLessThanOrEqualTo = h.lte = function(e, t) {
|
|
433
|
-
return (t = H(this, new p(e, t))) === -1 || t === 0;
|
|
434
|
-
}, h.isNaN = function() {
|
|
435
|
-
return !this.s;
|
|
436
|
-
}, h.isNegative = function() {
|
|
437
|
-
return this.s < 0;
|
|
438
|
-
}, h.isPositive = function() {
|
|
439
|
-
return this.s > 0;
|
|
440
|
-
}, h.isZero = function() {
|
|
441
|
-
return !!this.c && this.c[0] == 0;
|
|
442
|
-
}, h.minus = function(e, t) {
|
|
443
|
-
var r, l, n, o, a = this, i = a.s;
|
|
444
|
-
if (e = new p(e, t), t = e.s, !i || !t) return new p(NaN);
|
|
445
|
-
if (i != t)
|
|
446
|
-
return e.s = -t, a.plus(e);
|
|
447
|
-
var s = a.e / d, f = e.e / d, u = a.c, c = e.c;
|
|
448
|
-
if (!s || !f) {
|
|
449
|
-
if (!u || !c) return u ? (e.s = -t, e) : new p(c ? a : NaN);
|
|
450
|
-
if (!u[0] || !c[0])
|
|
451
|
-
return c[0] ? (e.s = -t, e) : new p(u[0] ? a : (
|
|
452
|
-
// IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
|
|
453
|
-
U == 3 ? -0 : 0
|
|
454
|
-
));
|
|
455
|
-
}
|
|
456
|
-
if (s = J(s), f = J(f), u = u.slice(), i = s - f) {
|
|
457
|
-
for ((o = i < 0) ? (i = -i, n = u) : (f = s, n = c), n.reverse(), t = i; t--; n.push(0)) ;
|
|
458
|
-
n.reverse();
|
|
459
|
-
} else
|
|
460
|
-
for (l = (o = (i = u.length) < (t = c.length)) ? i : t, i = t = 0; t < l; t++)
|
|
461
|
-
if (u[t] != c[t]) {
|
|
462
|
-
o = u[t] < c[t];
|
|
463
|
-
break;
|
|
464
|
-
}
|
|
465
|
-
if (o && (n = u, u = c, c = n, e.s = -e.s), t = (l = c.length) - (r = u.length), t > 0) for (; t--; u[r++] = 0) ;
|
|
466
|
-
for (t = W - 1; l > i; ) {
|
|
467
|
-
if (u[--l] < c[l]) {
|
|
468
|
-
for (r = l; r && !u[--r]; u[r] = t) ;
|
|
469
|
-
--u[r], u[l] += W;
|
|
470
|
-
}
|
|
471
|
-
u[l] -= c[l];
|
|
472
|
-
}
|
|
473
|
-
for (; u[0] == 0; u.splice(0, 1), --f) ;
|
|
474
|
-
return u[0] ? ve(e, u, f) : (e.s = U == 3 ? -1 : 1, e.c = [e.e = 0], e);
|
|
475
|
-
}, h.modulo = h.mod = function(e, t) {
|
|
476
|
-
var r, l, n = this;
|
|
477
|
-
return e = new p(e, t), !n.c || !e.s || e.c && !e.c[0] ? new p(NaN) : !e.c || n.c && !n.c[0] ? new p(n) : (ae == 9 ? (l = e.s, e.s = 1, r = m(n, e, 0, 3), e.s = l, r.s *= l) : r = m(n, e, 0, ae), e = n.minus(r.times(e)), !e.c[0] && ae == 1 && (e.s = n.s), e);
|
|
478
|
-
}, h.multipliedBy = h.times = function(e, t) {
|
|
479
|
-
var r, l, n, o, a, i, s, f, u, c, g, w, k, j, X, S = this, R = S.c, Y = (e = new p(e, t)).c;
|
|
480
|
-
if (!R || !Y || !R[0] || !Y[0])
|
|
481
|
-
return !S.s || !e.s || R && !R[0] && !Y || Y && !Y[0] && !R ? e.c = e.e = e.s = null : (e.s *= S.s, !R || !Y ? e.c = e.e = null : (e.c = [0], e.e = 0)), e;
|
|
482
|
-
for (l = J(S.e / d) + J(e.e / d), e.s *= S.s, s = R.length, c = Y.length, s < c && (k = R, R = Y, Y = k, n = s, s = c, c = n), n = s + c, k = []; n--; k.push(0)) ;
|
|
483
|
-
for (j = W, X = I, n = c; --n >= 0; ) {
|
|
484
|
-
for (r = 0, g = Y[n] % X, w = Y[n] / X | 0, a = s, o = n + a; o > n; )
|
|
485
|
-
f = R[--a] % X, u = R[a] / X | 0, i = w * f + u * g, f = g * f + i % X * X + k[o] + r, r = (f / j | 0) + (i / X | 0) + w * u, k[o--] = f % j;
|
|
486
|
-
k[o] = r;
|
|
487
|
-
}
|
|
488
|
-
return r ? ++l : k.splice(0, 1), ve(e, k, l);
|
|
489
|
-
}, h.negated = function() {
|
|
490
|
-
var e = new p(this);
|
|
491
|
-
return e.s = -e.s || null, e;
|
|
492
|
-
}, h.plus = function(e, t) {
|
|
493
|
-
var r, l = this, n = l.s;
|
|
494
|
-
if (e = new p(e, t), t = e.s, !n || !t) return new p(NaN);
|
|
495
|
-
if (n != t)
|
|
496
|
-
return e.s = -t, l.minus(e);
|
|
497
|
-
var o = l.e / d, a = e.e / d, i = l.c, s = e.c;
|
|
498
|
-
if (!o || !a) {
|
|
499
|
-
if (!i || !s) return new p(n / 0);
|
|
500
|
-
if (!i[0] || !s[0]) return s[0] ? e : new p(i[0] ? l : n * 0);
|
|
501
|
-
}
|
|
502
|
-
if (o = J(o), a = J(a), i = i.slice(), n = o - a) {
|
|
503
|
-
for (n > 0 ? (a = o, r = s) : (n = -n, r = i), r.reverse(); n--; r.push(0)) ;
|
|
504
|
-
r.reverse();
|
|
505
|
-
}
|
|
506
|
-
for (n = i.length, t = s.length, n - t < 0 && (r = s, s = i, i = r, t = n), n = 0; t; )
|
|
507
|
-
n = (i[--t] = i[t] + s[t] + n) / W | 0, i[t] = W === i[t] ? 0 : i[t] % W;
|
|
508
|
-
return n && (i = [n].concat(i), ++a), ve(e, i, a);
|
|
509
|
-
}, h.precision = h.sd = function(e, t) {
|
|
510
|
-
var r, l, n, o = this;
|
|
511
|
-
if (e != null && e !== !!e)
|
|
512
|
-
return N(e, 1, P), t == null ? t = U : N(t, 0, 8), ee(new p(o), e, t);
|
|
513
|
-
if (!(r = o.c)) return null;
|
|
514
|
-
if (n = r.length - 1, l = n * d + 1, n = r[n]) {
|
|
515
|
-
for (; n % 10 == 0; n /= 10, l--) ;
|
|
516
|
-
for (n = r[0]; n >= 10; n /= 10, l++) ;
|
|
517
|
-
}
|
|
518
|
-
return e && o.e + 1 > l && (l = o.e + 1), l;
|
|
519
|
-
}, h.shiftedBy = function(e) {
|
|
520
|
-
return N(e, -C, C), this.times("1e" + e);
|
|
521
|
-
}, h.squareRoot = h.sqrt = function() {
|
|
522
|
-
var e, t, r, l, n, o = this, a = o.c, i = o.s, s = o.e, f = F + 4, u = new p("0.5");
|
|
523
|
-
if (i !== 1 || !a || !a[0])
|
|
524
|
-
return new p(!i || i < 0 && (!a || a[0]) ? NaN : a ? o : 1 / 0);
|
|
525
|
-
if (i = Math.sqrt(+se(o)), i == 0 || i == 1 / 0 ? (t = T(a), (t.length + s) % 2 == 0 && (t += "0"), i = Math.sqrt(+t), s = J((s + 1) / 2) - (s < 0 || s % 2), i == 1 / 0 ? t = "5e" + s : (t = i.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + s), r = new p(t)) : r = new p(i + ""), r.c[0]) {
|
|
526
|
-
for (s = r.e, i = s + f, i < 3 && (i = 0); ; )
|
|
527
|
-
if (n = r, r = u.times(n.plus(m(o, n, f, 1))), T(n.c).slice(0, i) === (t = T(r.c)).slice(0, i))
|
|
528
|
-
if (r.e < s && --i, t = t.slice(i - 3, i + 1), t == "9999" || !l && t == "4999") {
|
|
529
|
-
if (!l && (ee(n, n.e + F + 2, 0), n.times(n).eq(o))) {
|
|
530
|
-
r = n;
|
|
531
|
-
break;
|
|
532
|
-
}
|
|
533
|
-
f += 4, i += 4, l = 1;
|
|
534
|
-
} else {
|
|
535
|
-
(!+t || !+t.slice(1) && t.charAt(0) == "5") && (ee(r, r.e + F + 2, 1), e = !r.times(r).eq(o));
|
|
536
|
-
break;
|
|
537
|
-
}
|
|
538
|
-
}
|
|
539
|
-
return ee(r, r.e + F + 1, U, e);
|
|
540
|
-
}, h.toExponential = function(e, t) {
|
|
541
|
-
return e != null && (N(e, 0, P), e++), me(this, e, t, 1);
|
|
542
|
-
}, h.toFixed = function(e, t) {
|
|
543
|
-
return e != null && (N(e, 0, P), e = e + this.e + 1), me(this, e, t);
|
|
544
|
-
}, h.toFormat = function(e, t, r) {
|
|
545
|
-
var l, n = this;
|
|
546
|
-
if (r == null)
|
|
547
|
-
e != null && t && typeof t == "object" ? (r = t, t = null) : e && typeof e == "object" ? (r = e, e = t = null) : r = de;
|
|
548
|
-
else if (typeof r != "object")
|
|
549
|
-
throw Error(q + "Argument not an object: " + r);
|
|
550
|
-
if (l = n.toFixed(e, t), n.c) {
|
|
551
|
-
var o, a = l.split("."), i = +r.groupSize, s = +r.secondaryGroupSize, f = r.groupSeparator || "", u = a[0], c = a[1], g = n.s < 0, w = g ? u.slice(1) : u, k = w.length;
|
|
552
|
-
if (s && (o = i, i = s, s = o, k -= o), i > 0 && k > 0) {
|
|
553
|
-
for (o = k % i || i, u = w.substr(0, o); o < k; o += i) u += f + w.substr(o, i);
|
|
554
|
-
s > 0 && (u += f + w.slice(o)), g && (u = "-" + u);
|
|
555
|
-
}
|
|
556
|
-
l = c ? u + (r.decimalSeparator || "") + ((s = +r.fractionGroupSize) ? c.replace(
|
|
557
|
-
new RegExp("\\d{" + s + "}\\B", "g"),
|
|
558
|
-
"$&" + (r.fractionGroupSeparator || "")
|
|
559
|
-
) : c) : u;
|
|
560
|
-
}
|
|
561
|
-
return (r.prefix || "") + l + (r.suffix || "");
|
|
562
|
-
}, h.toFraction = function(e) {
|
|
563
|
-
var t, r, l, n, o, a, i, s, f, u, c, g, w = this, k = w.c;
|
|
564
|
-
if (e != null && (i = new p(e), !i.isInteger() && (i.c || i.s !== 1) || i.lt(b)))
|
|
565
|
-
throw Error(q + "Argument " + (i.isInteger() ? "out of range: " : "not an integer: ") + se(i));
|
|
566
|
-
if (!k) return new p(w);
|
|
567
|
-
for (t = new p(b), f = r = new p(b), l = s = new p(b), g = T(k), o = t.e = g.length - w.e - 1, t.c[0] = v[(a = o % d) < 0 ? d + a : a], e = !e || i.comparedTo(t) > 0 ? o > 0 ? t : f : i, a = ie, ie = 1 / 0, i = new p(g), s.c[0] = 0; u = m(i, t, 0, 1), n = r.plus(u.times(l)), n.comparedTo(e) != 1; )
|
|
568
|
-
r = l, l = n, f = s.plus(u.times(n = f)), s = n, t = i.minus(u.times(n = t)), i = n;
|
|
569
|
-
return n = m(e.minus(r), l, 0, 1), s = s.plus(n.times(f)), r = r.plus(n.times(l)), s.s = f.s = w.s, o = o * 2, c = m(f, l, o, U).minus(w).abs().comparedTo(
|
|
570
|
-
m(s, r, o, U).minus(w).abs()
|
|
571
|
-
) < 1 ? [f, l] : [s, r], ie = a, c;
|
|
572
|
-
}, h.toNumber = function() {
|
|
573
|
-
return +se(this);
|
|
574
|
-
}, h.toPrecision = function(e, t) {
|
|
575
|
-
return e != null && N(e, 1, P), me(this, e, t, 2);
|
|
576
|
-
}, h.toString = function(e) {
|
|
577
|
-
var t, r = this, l = r.s, n = r.e;
|
|
578
|
-
return n === null ? l ? (t = "Infinity", l < 0 && (t = "-" + t)) : t = "NaN" : (e == null ? t = n <= Z || n >= K ? x(T(r.c), n) : L(T(r.c), n, "0") : e === 10 && we ? (r = ee(new p(r), F + n + 1, U), t = L(T(r.c), r.e, "0")) : (N(e, 2, fe.length, "Base"), t = D(L(T(r.c), n, "0"), 10, e, l, !0)), l < 0 && r.c[0] && (t = "-" + t)), t;
|
|
579
|
-
}, h.valueOf = h.toJSON = function() {
|
|
580
|
-
return se(this);
|
|
581
|
-
}, h._isBigNumber = !0, A != null && p.set(A), p;
|
|
582
|
-
}
|
|
583
|
-
function J(A) {
|
|
584
|
-
var m = A | 0;
|
|
585
|
-
return A > 0 || A === m ? m : m - 1;
|
|
586
|
-
}
|
|
587
|
-
function T(A) {
|
|
588
|
-
for (var m, D, M = 1, h = A.length, b = A[0] + ""; M < h; ) {
|
|
589
|
-
for (m = A[M++] + "", D = d - m.length; D--; m = "0" + m) ;
|
|
590
|
-
b += m;
|
|
591
|
-
}
|
|
592
|
-
for (h = b.length; b.charCodeAt(--h) === 48; ) ;
|
|
593
|
-
return b.slice(0, h + 1 || 1);
|
|
594
|
-
}
|
|
595
|
-
function H(A, m) {
|
|
596
|
-
var D, M, h = A.c, b = m.c, F = A.s, U = m.s, Z = A.e, K = m.e;
|
|
597
|
-
if (!F || !U) return null;
|
|
598
|
-
if (D = h && !h[0], M = b && !b[0], D || M) return D ? M ? 0 : -U : F;
|
|
599
|
-
if (F != U) return F;
|
|
600
|
-
if (D = F < 0, M = Z == K, !h || !b) return M ? 0 : !h ^ D ? 1 : -1;
|
|
601
|
-
if (!M) return Z > K ^ D ? 1 : -1;
|
|
602
|
-
for (U = (Z = h.length) < (K = b.length) ? Z : K, F = 0; F < U; F++) if (h[F] != b[F]) return h[F] > b[F] ^ D ? 1 : -1;
|
|
603
|
-
return Z == K ? 0 : Z > K ^ D ? 1 : -1;
|
|
604
|
-
}
|
|
605
|
-
function N(A, m, D, M) {
|
|
606
|
-
if (A < m || A > D || A !== B(A))
|
|
607
|
-
throw Error(q + (M || "Argument") + (typeof A == "number" ? A < m || A > D ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(A));
|
|
608
|
-
}
|
|
609
|
-
function E(A) {
|
|
610
|
-
var m = A.c.length - 1;
|
|
611
|
-
return J(A.e / d) == m && A.c[m] % 2 != 0;
|
|
612
|
-
}
|
|
613
|
-
function x(A, m) {
|
|
614
|
-
return (A.length > 1 ? A.charAt(0) + "." + A.slice(1) : A) + (m < 0 ? "e" : "e+") + m;
|
|
615
|
-
}
|
|
616
|
-
function L(A, m, D) {
|
|
617
|
-
var M, h;
|
|
618
|
-
if (m < 0) {
|
|
619
|
-
for (h = D + "."; ++m; h += D) ;
|
|
620
|
-
A = h + A;
|
|
621
|
-
} else if (M = A.length, ++m > M) {
|
|
622
|
-
for (h = D, m -= M; --m; h += D) ;
|
|
623
|
-
A += h;
|
|
624
|
-
} else m < M && (A = A.slice(0, m) + "." + A.slice(m));
|
|
625
|
-
return A;
|
|
626
|
-
}
|
|
627
|
-
V = z(), V.default = V.BigNumber = V, y.exports ? y.exports = V : ($ || ($ = typeof self < "u" && self ? self : window), $.BigNumber = V);
|
|
628
|
-
})(Ce);
|
|
629
|
-
})(_e)), _e.exports;
|
|
630
|
-
}
|
|
631
|
-
var ke;
|
|
632
|
-
function Fe() {
|
|
633
|
-
return ke || (ke = 1, (function(y) {
|
|
634
|
-
var $ = qe(), V = y.exports;
|
|
635
|
-
(function() {
|
|
636
|
-
var re = /[\\\"\x00-\x1f\x7f-\x9f\u00ad\u0600-\u0604\u070f\u17b4\u17b5\u200c-\u200f\u2028-\u202f\u2060-\u206f\ufeff\ufff0-\uffff]/g, O, B, q = {
|
|
637
|
-
// table of character substitutions
|
|
638
|
-
"\b": "\\b",
|
|
639
|
-
" ": "\\t",
|
|
640
|
-
"\n": "\\n",
|
|
641
|
-
"\f": "\\f",
|
|
642
|
-
"\r": "\\r",
|
|
643
|
-
'"': '\\"',
|
|
644
|
-
"\\": "\\\\"
|
|
645
|
-
}, _;
|
|
646
|
-
function W(C) {
|
|
647
|
-
return re.lastIndex = 0, re.test(C) ? '"' + C.replace(re, function(v) {
|
|
648
|
-
var I = q[v];
|
|
649
|
-
return typeof I == "string" ? I : "\\u" + ("0000" + v.charCodeAt(0).toString(16)).slice(-4);
|
|
650
|
-
}) + '"' : '"' + C + '"';
|
|
651
|
-
}
|
|
652
|
-
function d(C, v) {
|
|
653
|
-
var I, P, z, J, T = O, H, N = v[C], E = N != null && (N instanceof $ || $.isBigNumber(N));
|
|
654
|
-
switch (N && typeof N == "object" && typeof N.toJSON == "function" && (N = N.toJSON(C)), typeof _ == "function" && (N = _.call(v, C, N)), typeof N) {
|
|
655
|
-
case "string":
|
|
656
|
-
return E ? N : W(N);
|
|
657
|
-
case "number":
|
|
658
|
-
return isFinite(N) ? String(N) : "null";
|
|
659
|
-
case "boolean":
|
|
660
|
-
case "null":
|
|
661
|
-
case "bigint":
|
|
662
|
-
return String(N);
|
|
663
|
-
// If the type is 'object', we might be dealing with an object or an array or
|
|
664
|
-
// null.
|
|
665
|
-
case "object":
|
|
666
|
-
if (!N)
|
|
667
|
-
return "null";
|
|
668
|
-
if (O += B, H = [], Object.prototype.toString.apply(N) === "[object Array]") {
|
|
669
|
-
for (J = N.length, I = 0; I < J; I += 1)
|
|
670
|
-
H[I] = d(I, N) || "null";
|
|
671
|
-
return z = H.length === 0 ? "[]" : O ? `[
|
|
672
|
-
` + O + H.join(`,
|
|
673
|
-
` + O) + `
|
|
674
|
-
` + T + "]" : "[" + H.join(",") + "]", O = T, z;
|
|
675
|
-
}
|
|
676
|
-
if (_ && typeof _ == "object")
|
|
677
|
-
for (J = _.length, I = 0; I < J; I += 1)
|
|
678
|
-
typeof _[I] == "string" && (P = _[I], z = d(P, N), z && H.push(W(P) + (O ? ": " : ":") + z));
|
|
679
|
-
else
|
|
680
|
-
Object.keys(N).forEach(function(x) {
|
|
681
|
-
var L = d(x, N);
|
|
682
|
-
L && H.push(W(x) + (O ? ": " : ":") + L);
|
|
683
|
-
});
|
|
684
|
-
return z = H.length === 0 ? "{}" : O ? `{
|
|
685
|
-
` + O + H.join(`,
|
|
686
|
-
` + O) + `
|
|
687
|
-
` + T + "}" : "{" + H.join(",") + "}", O = T, z;
|
|
688
|
-
}
|
|
689
|
-
}
|
|
690
|
-
typeof V.stringify != "function" && (V.stringify = function(C, v, I) {
|
|
691
|
-
var P;
|
|
692
|
-
if (O = "", B = "", typeof I == "number")
|
|
693
|
-
for (P = 0; P < I; P += 1)
|
|
694
|
-
B += " ";
|
|
695
|
-
else typeof I == "string" && (B = I);
|
|
696
|
-
if (_ = v, v && typeof v != "function" && (typeof v != "object" || typeof v.length != "number"))
|
|
697
|
-
throw new Error("JSON.stringify");
|
|
698
|
-
return d("", { "": C });
|
|
699
|
-
});
|
|
700
|
-
})();
|
|
701
|
-
})(Oe)), Oe.exports;
|
|
702
|
-
}
|
|
703
|
-
var Ee, Ie;
|
|
704
|
-
function be() {
|
|
705
|
-
if (Ie) return Ee;
|
|
706
|
-
Ie = 1;
|
|
707
|
-
var y = null;
|
|
708
|
-
const $ = /(?:_|\\u005[Ff])(?:_|\\u005[Ff])(?:p|\\u0070)(?:r|\\u0072)(?:o|\\u006[Ff])(?:t|\\u0074)(?:o|\\u006[Ff])(?:_|\\u005[Ff])(?:_|\\u005[Ff])/, V = /(?:c|\\u0063)(?:o|\\u006[Ff])(?:n|\\u006[Ee])(?:s|\\u0073)(?:t|\\u0074)(?:r|\\u0072)(?:u|\\u0075)(?:c|\\u0063)(?:t|\\u0074)(?:o|\\u006[Ff])(?:r|\\u0072)/;
|
|
709
|
-
var re = function(O) {
|
|
710
|
-
var B = {
|
|
711
|
-
strict: !1,
|
|
712
|
-
// not being strict means do not generate syntax errors for "duplicate key"
|
|
713
|
-
storeAsString: !1,
|
|
714
|
-
// toggles whether the values should be stored as BigNumber (default) or a string
|
|
715
|
-
alwaysParseAsBig: !1,
|
|
716
|
-
// toggles whether all numbers should be Big
|
|
717
|
-
useNativeBigInt: !1,
|
|
718
|
-
// toggles whether to use native BigInt instead of bignumber.js
|
|
719
|
-
protoAction: "error",
|
|
720
|
-
constructorAction: "error"
|
|
721
|
-
};
|
|
722
|
-
if (O != null) {
|
|
723
|
-
if (O.strict === !0 && (B.strict = !0), O.storeAsString === !0 && (B.storeAsString = !0), B.alwaysParseAsBig = O.alwaysParseAsBig === !0 ? O.alwaysParseAsBig : !1, B.useNativeBigInt = O.useNativeBigInt === !0 ? O.useNativeBigInt : !1, typeof O.constructorAction < "u")
|
|
724
|
-
if (O.constructorAction === "error" || O.constructorAction === "ignore" || O.constructorAction === "preserve")
|
|
725
|
-
B.constructorAction = O.constructorAction;
|
|
726
|
-
else
|
|
727
|
-
throw new Error(
|
|
728
|
-
`Incorrect value for constructorAction option, must be "error", "ignore" or undefined but passed ${O.constructorAction}`
|
|
729
|
-
);
|
|
730
|
-
if (typeof O.protoAction < "u")
|
|
731
|
-
if (O.protoAction === "error" || O.protoAction === "ignore" || O.protoAction === "preserve")
|
|
732
|
-
B.protoAction = O.protoAction;
|
|
733
|
-
else
|
|
734
|
-
throw new Error(
|
|
735
|
-
`Incorrect value for protoAction option, must be "error", "ignore" or undefined but passed ${O.protoAction}`
|
|
736
|
-
);
|
|
737
|
-
}
|
|
738
|
-
var q, _, W = {
|
|
739
|
-
'"': '"',
|
|
740
|
-
"\\": "\\",
|
|
741
|
-
"/": "/",
|
|
742
|
-
b: "\b",
|
|
743
|
-
f: "\f",
|
|
744
|
-
n: `
|
|
745
|
-
`,
|
|
746
|
-
r: "\r",
|
|
747
|
-
t: " "
|
|
748
|
-
}, d, C = function(E) {
|
|
749
|
-
throw {
|
|
750
|
-
name: "SyntaxError",
|
|
751
|
-
message: E,
|
|
752
|
-
at: q,
|
|
753
|
-
text: d
|
|
754
|
-
};
|
|
755
|
-
}, v = function(E) {
|
|
756
|
-
return E && E !== _ && C("Expected '" + E + "' instead of '" + _ + "'"), _ = d.charAt(q), q += 1, _;
|
|
757
|
-
}, I = function() {
|
|
758
|
-
var E, x = "";
|
|
759
|
-
for (_ === "-" && (x = "-", v("-")); _ >= "0" && _ <= "9"; )
|
|
760
|
-
x += _, v();
|
|
761
|
-
if (_ === ".")
|
|
762
|
-
for (x += "."; v() && _ >= "0" && _ <= "9"; )
|
|
763
|
-
x += _;
|
|
764
|
-
if (_ === "e" || _ === "E")
|
|
765
|
-
for (x += _, v(), (_ === "-" || _ === "+") && (x += _, v()); _ >= "0" && _ <= "9"; )
|
|
766
|
-
x += _, v();
|
|
767
|
-
if (E = +x, !isFinite(E))
|
|
768
|
-
C("Bad number");
|
|
769
|
-
else
|
|
770
|
-
return y == null && (y = qe()), x.length > 15 ? B.storeAsString ? x : B.useNativeBigInt ? BigInt(x) : new y(x) : B.alwaysParseAsBig ? B.useNativeBigInt ? BigInt(E) : new y(E) : E;
|
|
771
|
-
}, P = function() {
|
|
772
|
-
var E, x, L = "", A;
|
|
773
|
-
if (_ === '"')
|
|
774
|
-
for (var m = q; v(); ) {
|
|
775
|
-
if (_ === '"')
|
|
776
|
-
return q - 1 > m && (L += d.substring(m, q - 1)), v(), L;
|
|
777
|
-
if (_ === "\\") {
|
|
778
|
-
if (q - 1 > m && (L += d.substring(m, q - 1)), v(), _ === "u") {
|
|
779
|
-
for (A = 0, x = 0; x < 4 && (E = parseInt(v(), 16), !!isFinite(E)); x += 1)
|
|
780
|
-
A = A * 16 + E;
|
|
781
|
-
L += String.fromCharCode(A);
|
|
782
|
-
} else if (typeof W[_] == "string")
|
|
783
|
-
L += W[_];
|
|
784
|
-
else
|
|
785
|
-
break;
|
|
786
|
-
m = q;
|
|
787
|
-
}
|
|
788
|
-
}
|
|
789
|
-
C("Bad string");
|
|
790
|
-
}, z = function() {
|
|
791
|
-
for (; _ && _ <= " "; )
|
|
792
|
-
v();
|
|
793
|
-
}, J = function() {
|
|
794
|
-
switch (_) {
|
|
795
|
-
case "t":
|
|
796
|
-
return v("t"), v("r"), v("u"), v("e"), !0;
|
|
797
|
-
case "f":
|
|
798
|
-
return v("f"), v("a"), v("l"), v("s"), v("e"), !1;
|
|
799
|
-
case "n":
|
|
800
|
-
return v("n"), v("u"), v("l"), v("l"), null;
|
|
801
|
-
}
|
|
802
|
-
C("Unexpected '" + _ + "'");
|
|
803
|
-
}, T, H = function() {
|
|
804
|
-
var E = [];
|
|
805
|
-
if (_ === "[") {
|
|
806
|
-
if (v("["), z(), _ === "]")
|
|
807
|
-
return v("]"), E;
|
|
808
|
-
for (; _; ) {
|
|
809
|
-
if (E.push(T()), z(), _ === "]")
|
|
810
|
-
return v("]"), E;
|
|
811
|
-
v(","), z();
|
|
812
|
-
}
|
|
813
|
-
}
|
|
814
|
-
C("Bad array");
|
|
815
|
-
}, N = function() {
|
|
816
|
-
var E, x = /* @__PURE__ */ Object.create(null);
|
|
817
|
-
if (_ === "{") {
|
|
818
|
-
if (v("{"), z(), _ === "}")
|
|
819
|
-
return v("}"), x;
|
|
820
|
-
for (; _; ) {
|
|
821
|
-
if (E = P(), z(), v(":"), B.strict === !0 && Object.hasOwnProperty.call(x, E) && C('Duplicate key "' + E + '"'), $.test(E) === !0 ? B.protoAction === "error" ? C("Object contains forbidden prototype property") : B.protoAction === "ignore" ? T() : x[E] = T() : V.test(E) === !0 ? B.constructorAction === "error" ? C("Object contains forbidden constructor property") : B.constructorAction === "ignore" ? T() : x[E] = T() : x[E] = T(), z(), _ === "}")
|
|
822
|
-
return v("}"), x;
|
|
823
|
-
v(","), z();
|
|
824
|
-
}
|
|
825
|
-
}
|
|
826
|
-
C("Bad object");
|
|
827
|
-
};
|
|
828
|
-
return T = function() {
|
|
829
|
-
switch (z(), _) {
|
|
830
|
-
case "{":
|
|
831
|
-
return N();
|
|
832
|
-
case "[":
|
|
833
|
-
return H();
|
|
834
|
-
case '"':
|
|
835
|
-
return P();
|
|
836
|
-
case "-":
|
|
837
|
-
return I();
|
|
838
|
-
default:
|
|
839
|
-
return _ >= "0" && _ <= "9" ? I() : J();
|
|
840
|
-
}
|
|
841
|
-
}, function(E, x) {
|
|
842
|
-
var L;
|
|
843
|
-
return d = E + "", q = 0, _ = " ", L = T(), z(), _ && C("Syntax error"), typeof x == "function" ? (function A(m, D) {
|
|
844
|
-
var M, h = m[D];
|
|
845
|
-
return h && typeof h == "object" && Object.keys(h).forEach(function(b) {
|
|
846
|
-
M = A(h, b), M !== void 0 ? h[b] = M : delete h[b];
|
|
847
|
-
}), x.call(m, D, h);
|
|
848
|
-
})({ "": L }, "") : L;
|
|
849
|
-
};
|
|
850
|
-
};
|
|
851
|
-
return Ee = re, Ee;
|
|
852
|
-
}
|
|
853
|
-
var Pe;
|
|
854
|
-
function Le() {
|
|
855
|
-
if (Pe) return pe.exports;
|
|
856
|
-
Pe = 1;
|
|
857
|
-
var y = Fe().stringify, $ = be();
|
|
858
|
-
return pe.exports = function(V) {
|
|
859
|
-
return {
|
|
860
|
-
parse: $(V),
|
|
861
|
-
stringify: y
|
|
862
|
-
};
|
|
863
|
-
}, pe.exports.parse = $(), pe.exports.stringify = y, pe.exports;
|
|
864
|
-
}
|
|
865
|
-
var Ue = Le();
|
|
866
|
-
const Re = /* @__PURE__ */ Me(Ue), ge = De();
|
|
867
|
-
let xe = Te.create({
|
|
868
|
-
transformResponse: [(y) => {
|
|
869
|
-
try {
|
|
870
|
-
return Re.parse(y);
|
|
871
|
-
} catch ($) {
|
|
872
|
-
throw console.error("JSON parse error:", $), $;
|
|
873
|
-
}
|
|
874
|
-
}],
|
|
875
|
-
transformRequest: [(y) => Re.stringify(y)]
|
|
876
|
-
// transformRequest: [(data) => {
|
|
877
|
-
// return JSON.stringify(data, (_, value) => {
|
|
878
|
-
// if (typeof value === 'bigint') {
|
|
879
|
-
// return value.toString(); // 自动转换 BigInt
|
|
880
|
-
// }
|
|
881
|
-
// return value;
|
|
882
|
-
// });
|
|
883
|
-
// }],
|
|
884
|
-
});
|
|
885
|
-
xe.interceptors.request.use((y) => (console.log(ge.token.value), y.headers.authorization = "Bearer " + ge.token.value, y));
|
|
886
|
-
xe.interceptors.response.use((y) => (y.data.error_code == 100 && ge.saveToken("none"), typeof y.headers.authorization < "u" && ge.saveToken(y.headers.authorization), y), (y) => Promise.reject(y));
|
|
887
|
-
class ye {
|
|
888
|
-
error_code;
|
|
889
|
-
message;
|
|
890
|
-
data;
|
|
891
|
-
constructor() {
|
|
892
|
-
this.error_code = 1, this.message = "未知错误", this.data = {};
|
|
893
|
-
}
|
|
894
|
-
get IsSuccess() {
|
|
895
|
-
return this.error_code == 0;
|
|
896
|
-
}
|
|
897
|
-
static fromObject($) {
|
|
898
|
-
const V = new ye();
|
|
899
|
-
return Object.assign(V, $), V;
|
|
900
|
-
}
|
|
901
|
-
}
|
|
902
|
-
const je = `${window.location.protocol}//${window.location.host}/`;
|
|
903
|
-
class ze {
|
|
904
|
-
//系统基础接口
|
|
905
|
-
static api_host = je;
|
|
906
|
-
//'http://localhost:1788/' //1788
|
|
907
|
-
//当前用户
|
|
908
|
-
static url_login = "api/login";
|
|
909
|
-
static url_usercenter = "api/user_center";
|
|
910
|
-
static url_change_password = "api/change_password";
|
|
911
|
-
static url_user_permission = "api/user_permission";
|
|
912
|
-
//用户管理
|
|
913
|
-
static url_user_save = "api/user_save";
|
|
914
|
-
static url_user_list = "api/user_list";
|
|
915
|
-
static url_user_export = "api/user_export";
|
|
916
|
-
static url_user_del = "api/user_del";
|
|
917
|
-
static url_user_detail = "api/user_detail";
|
|
918
|
-
static url_user_change_pwd = "api/user_change_pwd";
|
|
919
|
-
//组织架构
|
|
920
|
-
static url_department_save = "api/department_save";
|
|
921
|
-
static url_department_list = "api/department_list";
|
|
922
|
-
static url_department_del = "api/department_del";
|
|
923
|
-
static url_department_detail = "api/department_detail";
|
|
924
|
-
//职务
|
|
925
|
-
static url_position_list = "api/position_list";
|
|
926
|
-
static url_position_detail = "api/position_detail";
|
|
927
|
-
static url_position_save = "api/position_save";
|
|
928
|
-
static url_position_del = "api/position_del";
|
|
929
|
-
//系统日志
|
|
930
|
-
static url_syslog_list = "api/syslog_list";
|
|
931
|
-
static url_syslog_config_detail = "api/syslog_config_detail";
|
|
932
|
-
static url_syslog_config_save = "api/syslog_config_save";
|
|
933
|
-
//备份
|
|
934
|
-
static url_backup_start = "api/backup_start";
|
|
935
|
-
static url_backup_list = "api/backup_list";
|
|
936
|
-
static url_backup_del = "api/backup_del";
|
|
937
|
-
static url_backup_config_get = "api/backup_config_get";
|
|
938
|
-
static url_backup_config_save = "api/backup_config_save";
|
|
939
|
-
//权限
|
|
940
|
-
static url_syspermission_list = "api/permission_list";
|
|
941
|
-
static url_sysrole_list = "api/role_list";
|
|
942
|
-
static url_sysrole_del = "api/role_del";
|
|
943
|
-
static url_sysrole_save = "api/role_save";
|
|
944
|
-
static url_sysrole_detail = "api/role_detail";
|
|
945
|
-
//导出
|
|
946
|
-
static url_export_detail = "api/export_detail";
|
|
947
|
-
static url_export_file = "api/export_file";
|
|
948
|
-
// 系统
|
|
949
|
-
static url_system_publish = "api/system_publish";
|
|
950
|
-
//应用级接口==========================
|
|
951
|
-
//桌面
|
|
952
|
-
static url_desktop = "api/desktop";
|
|
953
|
-
static url_desktop_config_detail = "api/desktop_config_detail";
|
|
954
|
-
static url_desktop_config_save = "api/desktop_config_save";
|
|
955
|
-
//数据看板
|
|
956
|
-
static url_chart_weekly = "api/chart_weekly";
|
|
957
|
-
static url_chart_all = "api/chart_all";
|
|
958
|
-
static url_chart_last = "api/chart_last";
|
|
959
|
-
//事件
|
|
960
|
-
static url_event_list = "api/event_list";
|
|
961
|
-
static url_event_detail = "api/event_detail";
|
|
962
|
-
static url_event_file = "api/event_file";
|
|
963
|
-
static url_event_dispose = "api/event_dispose";
|
|
964
|
-
//规则
|
|
965
|
-
static url_rule_list = "api/rule_list";
|
|
966
|
-
static url_rule_save = "api/rule_save";
|
|
967
|
-
static url_rule_del = "api/rule_del";
|
|
968
|
-
static url_rule_detail = "api/rule_detail";
|
|
969
|
-
//时间模板
|
|
970
|
-
static url_time_list = "api/time_list";
|
|
971
|
-
static url_time_save = "api/time_save";
|
|
972
|
-
static url_time_del = "api/time_del";
|
|
973
|
-
static url_time_detail = "api/time_detail";
|
|
974
|
-
//区域
|
|
975
|
-
static url_area_save = "api/area_save";
|
|
976
|
-
static url_area_list = "api/area_list";
|
|
977
|
-
static url_area_del = "api/area_del";
|
|
978
|
-
static url_area_detail = "api/area_detail";
|
|
979
|
-
//设备
|
|
980
|
-
static url_equipment_save = "api/equipment_save";
|
|
981
|
-
static url_equipment_list = "api/equipment_list";
|
|
982
|
-
static url_equipment_detail = "api/equipment_detail";
|
|
983
|
-
static url_equipment_del = "api/equipment_del";
|
|
984
|
-
//通道画面
|
|
985
|
-
static url_channel_save = "api/channel_save";
|
|
986
|
-
static url_channel_list = "api/channel_list";
|
|
987
|
-
static url_channel_detail = "api/channel_detail";
|
|
988
|
-
static url_channel_del = "api/channel_del";
|
|
989
|
-
static GetFullApiUrl($) {
|
|
990
|
-
return this.api_host + $;
|
|
991
|
-
}
|
|
992
|
-
static async Post($, V) {
|
|
993
|
-
try {
|
|
994
|
-
let re = await xe.post(this.api_host + $, V);
|
|
995
|
-
return ye.fromObject(re.data);
|
|
996
|
-
} catch (re) {
|
|
997
|
-
return console.log(re), Promise.reject("访问服务器失败");
|
|
998
|
-
}
|
|
999
|
-
}
|
|
1000
|
-
// http_axios.interceptors.response.use(res=>{
|
|
1001
|
-
// return res
|
|
1002
|
-
// },err=>{
|
|
1003
|
-
// return Promise.reject(err)
|
|
1004
|
-
// })
|
|
1005
|
-
}
|
|
1006
|
-
export {
|
|
1007
|
-
ze as H
|
|
1008
|
-
};
|