@civet/core 3.0.0 → 3.0.1
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/main.js +233 -217
- package/package.json +1 -1
package/dist/main.js
CHANGED
|
@@ -147,7 +147,7 @@ function De() {
|
|
|
147
147
|
}
|
|
148
148
|
var Re = De();
|
|
149
149
|
const Oe = /* @__PURE__ */ Se(Re);
|
|
150
|
-
function
|
|
150
|
+
function oe(h) {
|
|
151
151
|
throw new Error('Could not dynamically require "' + h + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
|
|
152
152
|
}
|
|
153
153
|
var pe = { exports: {} }, Ie;
|
|
@@ -160,7 +160,7 @@ function Ne() {
|
|
|
160
160
|
function B(q, M) {
|
|
161
161
|
if (!g[q]) {
|
|
162
162
|
if (!p[q]) {
|
|
163
|
-
var N = typeof
|
|
163
|
+
var N = typeof oe == "function" && oe;
|
|
164
164
|
if (!M && N) return N(q, !0);
|
|
165
165
|
if (k) return k(q, !0);
|
|
166
166
|
throw new Error("Cannot find module '" + q + "'");
|
|
@@ -172,7 +172,7 @@ function Ne() {
|
|
|
172
172
|
}
|
|
173
173
|
return g[q].exports;
|
|
174
174
|
}
|
|
175
|
-
for (var k = typeof
|
|
175
|
+
for (var k = typeof oe == "function" && oe, U = 0; U < y.length; U++) B(y[U]);
|
|
176
176
|
return B;
|
|
177
177
|
})({ 1: [function(u, p, g) {
|
|
178
178
|
(function(y, B, k, U, q, M, N, O, F) {
|
|
@@ -195,7 +195,7 @@ function Ne() {
|
|
|
195
195
|
function A(a, d) {
|
|
196
196
|
var r = {};
|
|
197
197
|
if (r.algorithm = (d = d || {}).algorithm || "sha1", r.encoding = d.encoding || "hex", r.excludeValues = !!d.excludeValues, r.algorithm = r.algorithm.toLowerCase(), r.encoding = r.encoding.toLowerCase(), r.ignoreUnknown = d.ignoreUnknown === !0, r.respectType = d.respectType !== !1, r.respectFunctionNames = d.respectFunctionNames !== !1, r.respectFunctionProperties = d.respectFunctionProperties !== !1, r.unorderedArrays = d.unorderedArrays === !0, r.unorderedSets = d.unorderedSets !== !1, r.unorderedObjects = d.unorderedObjects !== !1, r.replacer = d.replacer || void 0, r.excludeKeys = d.excludeKeys || void 0, a === void 0) throw new Error("Object argument required.");
|
|
198
|
-
for (var
|
|
198
|
+
for (var i = 0; i < c.length; ++i) c[i].toLowerCase() === r.algorithm.toLowerCase() && (r.algorithm = c[i]);
|
|
199
199
|
if (c.indexOf(r.algorithm) === -1) throw new Error('Algorithm "' + r.algorithm + '" not supported. supported values: ' + c.join(", "));
|
|
200
200
|
if (b.indexOf(r.encoding) === -1 && r.algorithm !== "passthrough") throw new Error('Encoding "' + r.encoding + '" not supported. supported values: ' + b.join(", "));
|
|
201
201
|
return r;
|
|
@@ -205,7 +205,7 @@ function Ne() {
|
|
|
205
205
|
}
|
|
206
206
|
function v(a, d, r) {
|
|
207
207
|
r = r || [];
|
|
208
|
-
function
|
|
208
|
+
function i(t) {
|
|
209
209
|
return d.update ? d.update(t, "utf8") : d.write(t, "utf8");
|
|
210
210
|
}
|
|
211
211
|
return { dispatch: function(t) {
|
|
@@ -213,21 +213,21 @@ function Ne() {
|
|
|
213
213
|
}, _object: function(t) {
|
|
214
214
|
var f, l = Object.prototype.toString.call(t), P = /\[object (.*)\]/i.exec(l);
|
|
215
215
|
if (P = (P = P ? P[1] : "unknown:[" + l + "]").toLowerCase(), 0 <= (l = r.indexOf(t))) return this.dispatch("[CIRCULAR:" + l + "]");
|
|
216
|
-
if (r.push(t), k !== void 0 && k.isBuffer && k.isBuffer(t)) return
|
|
216
|
+
if (r.push(t), k !== void 0 && k.isBuffer && k.isBuffer(t)) return i("buffer:"), i(t);
|
|
217
217
|
if (P === "object" || P === "function" || P === "asyncfunction") return l = Object.keys(t), a.unorderedObjects && (l = l.sort()), a.respectType === !1 || _(t) || l.splice(0, 0, "prototype", "__proto__", "constructor"), a.excludeKeys && (l = l.filter(function(L) {
|
|
218
218
|
return !a.excludeKeys(L);
|
|
219
|
-
})),
|
|
220
|
-
f.dispatch(L),
|
|
219
|
+
})), i("object:" + l.length + ":"), f = this, l.forEach(function(L) {
|
|
220
|
+
f.dispatch(L), i(":"), a.excludeValues || f.dispatch(t[L]), i(",");
|
|
221
221
|
});
|
|
222
222
|
if (!this["_" + P]) {
|
|
223
|
-
if (a.ignoreUnknown) return
|
|
223
|
+
if (a.ignoreUnknown) return i("[" + P + "]");
|
|
224
224
|
throw new Error('Unknown object type "' + P + '"');
|
|
225
225
|
}
|
|
226
226
|
this["_" + P](t);
|
|
227
227
|
}, _array: function(t, L) {
|
|
228
228
|
L = L !== void 0 ? L : a.unorderedArrays !== !1;
|
|
229
229
|
var l = this;
|
|
230
|
-
if (
|
|
230
|
+
if (i("array:" + t.length + ":"), !L || t.length <= 1) return t.forEach(function(D) {
|
|
231
231
|
return l.dispatch(D);
|
|
232
232
|
});
|
|
233
233
|
var P = [], L = t.map(function(D) {
|
|
@@ -236,99 +236,99 @@ function Ne() {
|
|
|
236
236
|
});
|
|
237
237
|
return r = r.concat(P), L.sort(), this._array(L, !1);
|
|
238
238
|
}, _date: function(t) {
|
|
239
|
-
return
|
|
239
|
+
return i("date:" + t.toJSON());
|
|
240
240
|
}, _symbol: function(t) {
|
|
241
|
-
return
|
|
241
|
+
return i("symbol:" + t.toString());
|
|
242
242
|
}, _error: function(t) {
|
|
243
|
-
return
|
|
243
|
+
return i("error:" + t.toString());
|
|
244
244
|
}, _boolean: function(t) {
|
|
245
|
-
return
|
|
245
|
+
return i("bool:" + t.toString());
|
|
246
246
|
}, _string: function(t) {
|
|
247
|
-
|
|
247
|
+
i("string:" + t.length + ":"), i(t.toString());
|
|
248
248
|
}, _function: function(t) {
|
|
249
|
-
|
|
249
|
+
i("fn:"), _(t) ? this.dispatch("[native]") : this.dispatch(t.toString()), a.respectFunctionNames !== !1 && this.dispatch("function-name:" + String(t.name)), a.respectFunctionProperties && this._object(t);
|
|
250
250
|
}, _number: function(t) {
|
|
251
|
-
return
|
|
251
|
+
return i("number:" + t.toString());
|
|
252
252
|
}, _xml: function(t) {
|
|
253
|
-
return
|
|
253
|
+
return i("xml:" + t.toString());
|
|
254
254
|
}, _null: function() {
|
|
255
|
-
return
|
|
255
|
+
return i("Null");
|
|
256
256
|
}, _undefined: function() {
|
|
257
|
-
return
|
|
257
|
+
return i("Undefined");
|
|
258
258
|
}, _regexp: function(t) {
|
|
259
|
-
return
|
|
259
|
+
return i("regex:" + t.toString());
|
|
260
260
|
}, _uint8array: function(t) {
|
|
261
|
-
return
|
|
261
|
+
return i("uint8array:"), this.dispatch(Array.prototype.slice.call(t));
|
|
262
262
|
}, _uint8clampedarray: function(t) {
|
|
263
|
-
return
|
|
263
|
+
return i("uint8clampedarray:"), this.dispatch(Array.prototype.slice.call(t));
|
|
264
264
|
}, _int8array: function(t) {
|
|
265
|
-
return
|
|
265
|
+
return i("int8array:"), this.dispatch(Array.prototype.slice.call(t));
|
|
266
266
|
}, _uint16array: function(t) {
|
|
267
|
-
return
|
|
267
|
+
return i("uint16array:"), this.dispatch(Array.prototype.slice.call(t));
|
|
268
268
|
}, _int16array: function(t) {
|
|
269
|
-
return
|
|
269
|
+
return i("int16array:"), this.dispatch(Array.prototype.slice.call(t));
|
|
270
270
|
}, _uint32array: function(t) {
|
|
271
|
-
return
|
|
271
|
+
return i("uint32array:"), this.dispatch(Array.prototype.slice.call(t));
|
|
272
272
|
}, _int32array: function(t) {
|
|
273
|
-
return
|
|
273
|
+
return i("int32array:"), this.dispatch(Array.prototype.slice.call(t));
|
|
274
274
|
}, _float32array: function(t) {
|
|
275
|
-
return
|
|
275
|
+
return i("float32array:"), this.dispatch(Array.prototype.slice.call(t));
|
|
276
276
|
}, _float64array: function(t) {
|
|
277
|
-
return
|
|
277
|
+
return i("float64array:"), this.dispatch(Array.prototype.slice.call(t));
|
|
278
278
|
}, _arraybuffer: function(t) {
|
|
279
|
-
return
|
|
279
|
+
return i("arraybuffer:"), this.dispatch(new Uint8Array(t));
|
|
280
280
|
}, _url: function(t) {
|
|
281
|
-
return
|
|
281
|
+
return i("url:" + t.toString());
|
|
282
282
|
}, _map: function(t) {
|
|
283
|
-
return
|
|
283
|
+
return i("map:"), t = Array.from(t), this._array(t, a.unorderedSets !== !1);
|
|
284
284
|
}, _set: function(t) {
|
|
285
|
-
return
|
|
285
|
+
return i("set:"), t = Array.from(t), this._array(t, a.unorderedSets !== !1);
|
|
286
286
|
}, _file: function(t) {
|
|
287
|
-
return
|
|
287
|
+
return i("file:"), this.dispatch([t.name, t.size, t.type, t.lastModfied]);
|
|
288
288
|
}, _blob: function() {
|
|
289
|
-
if (a.ignoreUnknown) return
|
|
289
|
+
if (a.ignoreUnknown) return i("[blob]");
|
|
290
290
|
throw Error(`Hashing Blob objects is currently not supported
|
|
291
291
|
(see https://github.com/puleos/object-hash/issues/26)
|
|
292
292
|
Use "options.replacer" or "options.ignoreUnknown"
|
|
293
293
|
`);
|
|
294
294
|
}, _domwindow: function() {
|
|
295
|
-
return
|
|
295
|
+
return i("domwindow");
|
|
296
296
|
}, _bigint: function(t) {
|
|
297
|
-
return
|
|
297
|
+
return i("bigint:" + t.toString());
|
|
298
298
|
}, _process: function() {
|
|
299
|
-
return
|
|
299
|
+
return i("process");
|
|
300
300
|
}, _timer: function() {
|
|
301
|
-
return
|
|
301
|
+
return i("timer");
|
|
302
302
|
}, _pipe: function() {
|
|
303
|
-
return
|
|
303
|
+
return i("pipe");
|
|
304
304
|
}, _tcp: function() {
|
|
305
|
-
return
|
|
305
|
+
return i("tcp");
|
|
306
306
|
}, _udp: function() {
|
|
307
|
-
return
|
|
307
|
+
return i("udp");
|
|
308
308
|
}, _tty: function() {
|
|
309
|
-
return
|
|
309
|
+
return i("tty");
|
|
310
310
|
}, _statwatcher: function() {
|
|
311
|
-
return
|
|
311
|
+
return i("statwatcher");
|
|
312
312
|
}, _securecontext: function() {
|
|
313
|
-
return
|
|
313
|
+
return i("securecontext");
|
|
314
314
|
}, _connection: function() {
|
|
315
|
-
return
|
|
315
|
+
return i("connection");
|
|
316
316
|
}, _zlib: function() {
|
|
317
|
-
return
|
|
317
|
+
return i("zlib");
|
|
318
318
|
}, _context: function() {
|
|
319
|
-
return
|
|
319
|
+
return i("context");
|
|
320
320
|
}, _nodescript: function() {
|
|
321
|
-
return
|
|
321
|
+
return i("nodescript");
|
|
322
322
|
}, _httpparser: function() {
|
|
323
|
-
return
|
|
323
|
+
return i("httpparser");
|
|
324
324
|
}, _dataview: function() {
|
|
325
|
-
return
|
|
325
|
+
return i("dataview");
|
|
326
326
|
}, _signal: function() {
|
|
327
|
-
return
|
|
327
|
+
return i("signal");
|
|
328
328
|
}, _fsevent: function() {
|
|
329
|
-
return
|
|
329
|
+
return i("fsevent");
|
|
330
330
|
}, _tlswrap: function() {
|
|
331
|
-
return
|
|
331
|
+
return i("tlswrap");
|
|
332
332
|
} };
|
|
333
333
|
}
|
|
334
334
|
function C() {
|
|
@@ -352,20 +352,20 @@ Use "options.replacer" or "options.ignoreUnknown"
|
|
|
352
352
|
return r = r.charCodeAt(0), r === c || r === C ? 62 : r === b || r === a ? 63 : r < A ? -1 : r < A + 10 ? r - A + 26 + 26 : r < v + 26 ? r - v : r < _ + 26 ? r - _ + 26 : void 0;
|
|
353
353
|
}
|
|
354
354
|
E.toByteArray = function(r) {
|
|
355
|
-
var
|
|
355
|
+
var i, t;
|
|
356
356
|
if (0 < r.length % 4) throw new Error("Invalid string. Length must be a multiple of 4");
|
|
357
357
|
var f = r.length, f = r.charAt(f - 2) === "=" ? 2 : r.charAt(f - 1) === "=" ? 1 : 0, l = new S(3 * r.length / 4 - f), P = 0 < f ? r.length - 4 : r.length, L = 0;
|
|
358
358
|
function D(j) {
|
|
359
359
|
l[L++] = j;
|
|
360
360
|
}
|
|
361
|
-
for (
|
|
362
|
-
return f == 2 ? D(255 & (t = d(r.charAt(
|
|
361
|
+
for (i = 0; i < P; i += 4, 0) D((16711680 & (t = d(r.charAt(i)) << 18 | d(r.charAt(i + 1)) << 12 | d(r.charAt(i + 2)) << 6 | d(r.charAt(i + 3)))) >> 16), D((65280 & t) >> 8), D(255 & t);
|
|
362
|
+
return f == 2 ? D(255 & (t = d(r.charAt(i)) << 2 | d(r.charAt(i + 1)) >> 4)) : f == 1 && (D((t = d(r.charAt(i)) << 10 | d(r.charAt(i + 1)) << 4 | d(r.charAt(i + 2)) >> 2) >> 8 & 255), D(255 & t)), l;
|
|
363
363
|
}, E.fromByteArray = function(r) {
|
|
364
|
-
var
|
|
364
|
+
var i, t, f, l, P = r.length % 3, L = "";
|
|
365
365
|
function D(j) {
|
|
366
366
|
return "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(j);
|
|
367
367
|
}
|
|
368
|
-
for (
|
|
368
|
+
for (i = 0, f = r.length - P; i < f; i += 3) t = (r[i] << 16) + (r[i + 1] << 8) + r[i + 2], L += D((l = t) >> 18 & 63) + D(l >> 12 & 63) + D(l >> 6 & 63) + D(63 & l);
|
|
369
369
|
switch (P) {
|
|
370
370
|
case 1:
|
|
371
371
|
L = (L += D((t = r[r.length - 1]) >> 2)) + D(t << 4 & 63) + "==";
|
|
@@ -380,8 +380,8 @@ Use "options.replacer" or "options.ignoreUnknown"
|
|
|
380
380
|
}, { buffer: 3, lYpoI2: 11 }], 3: [function(u, p, g) {
|
|
381
381
|
(function(y, B, c, U, q, M, N, O, F) {
|
|
382
382
|
var E = u("base64-js"), S = u("ieee754");
|
|
383
|
-
function c(e, n,
|
|
384
|
-
if (!(this instanceof c)) return new c(e, n,
|
|
383
|
+
function c(e, n, o) {
|
|
384
|
+
if (!(this instanceof c)) return new c(e, n, o);
|
|
385
385
|
var w, m, x, R, V = typeof e;
|
|
386
386
|
if (n === "base64" && V == "string") for (e = (R = e).trim ? R.trim() : R.replace(/^\s+|\s+$/g, ""); e.length % 4 != 0; ) e += "=";
|
|
387
387
|
if (V == "number") w = J(e);
|
|
@@ -393,66 +393,66 @@ Use "options.replacer" or "options.ignoreUnknown"
|
|
|
393
393
|
if (c._useTypedArrays ? m = c._augment(new Uint8Array(w)) : ((m = this).length = w, m._isBuffer = !0), c._useTypedArrays && typeof e.byteLength == "number") m._set(e);
|
|
394
394
|
else if ($(R = e) || c.isBuffer(R) || R && typeof R == "object" && typeof R.length == "number") for (x = 0; x < w; x++) c.isBuffer(e) ? m[x] = e.readUInt8(x) : m[x] = e[x];
|
|
395
395
|
else if (V == "string") m.write(e, 0, n);
|
|
396
|
-
else if (V == "number" && !c._useTypedArrays && !
|
|
396
|
+
else if (V == "number" && !c._useTypedArrays && !o) for (x = 0; x < w; x++) m[x] = 0;
|
|
397
397
|
return m;
|
|
398
398
|
}
|
|
399
|
-
function b(e, n,
|
|
400
|
-
return c._charsWritten =
|
|
399
|
+
function b(e, n, o, w) {
|
|
400
|
+
return c._charsWritten = ie((function(m) {
|
|
401
401
|
for (var x = [], R = 0; R < m.length; R++) x.push(255 & m.charCodeAt(R));
|
|
402
402
|
return x;
|
|
403
|
-
})(n), e,
|
|
403
|
+
})(n), e, o, w);
|
|
404
404
|
}
|
|
405
|
-
function A(e, n,
|
|
406
|
-
return c._charsWritten =
|
|
405
|
+
function A(e, n, o, w) {
|
|
406
|
+
return c._charsWritten = ie((function(m) {
|
|
407
407
|
for (var x, R, V = [], G = 0; G < m.length; G++) R = m.charCodeAt(G), x = R >> 8, R = R % 256, V.push(R), V.push(x);
|
|
408
408
|
return V;
|
|
409
|
-
})(n), e,
|
|
409
|
+
})(n), e, o, w);
|
|
410
410
|
}
|
|
411
|
-
function _(e, n,
|
|
411
|
+
function _(e, n, o) {
|
|
412
412
|
var w = "";
|
|
413
|
-
|
|
414
|
-
for (var m = n; m <
|
|
413
|
+
o = Math.min(e.length, o);
|
|
414
|
+
for (var m = n; m < o; m++) w += String.fromCharCode(e[m]);
|
|
415
415
|
return w;
|
|
416
416
|
}
|
|
417
|
-
function v(e, n,
|
|
418
|
-
x || (I(typeof
|
|
417
|
+
function v(e, n, o, x) {
|
|
418
|
+
x || (I(typeof o == "boolean", "missing or invalid endian"), I(n != null, "missing offset"), I(n + 1 < e.length, "Trying to read beyond buffer length"));
|
|
419
419
|
var m, x = e.length;
|
|
420
|
-
if (!(x <= n)) return
|
|
420
|
+
if (!(x <= n)) return o ? (m = e[n], n + 1 < x && (m |= e[n + 1] << 8)) : (m = e[n] << 8, n + 1 < x && (m |= e[n + 1])), m;
|
|
421
421
|
}
|
|
422
|
-
function C(e, n,
|
|
423
|
-
x || (I(typeof
|
|
422
|
+
function C(e, n, o, x) {
|
|
423
|
+
x || (I(typeof o == "boolean", "missing or invalid endian"), I(n != null, "missing offset"), I(n + 3 < e.length, "Trying to read beyond buffer length"));
|
|
424
424
|
var m, x = e.length;
|
|
425
|
-
if (!(x <= n)) return
|
|
425
|
+
if (!(x <= n)) return o ? (n + 2 < x && (m = e[n + 2] << 16), n + 1 < x && (m |= e[n + 1] << 8), m |= e[n], n + 3 < x && (m += e[n + 3] << 24 >>> 0)) : (n + 1 < x && (m = e[n + 1] << 16), n + 2 < x && (m |= e[n + 2] << 8), n + 3 < x && (m |= e[n + 3]), m += e[n] << 24 >>> 0), m;
|
|
426
426
|
}
|
|
427
|
-
function a(e, n,
|
|
428
|
-
if (w || (I(typeof
|
|
427
|
+
function a(e, n, o, w) {
|
|
428
|
+
if (w || (I(typeof o == "boolean", "missing or invalid endian"), I(n != null, "missing offset"), I(n + 1 < e.length, "Trying to read beyond buffer length")), !(e.length <= n)) return w = v(e, n, o, !0), 32768 & w ? -1 * (65535 - w + 1) : w;
|
|
429
429
|
}
|
|
430
|
-
function d(e, n,
|
|
431
|
-
if (w || (I(typeof
|
|
430
|
+
function d(e, n, o, w) {
|
|
431
|
+
if (w || (I(typeof o == "boolean", "missing or invalid endian"), I(n != null, "missing offset"), I(n + 3 < e.length, "Trying to read beyond buffer length")), !(e.length <= n)) return w = C(e, n, o, !0), 2147483648 & w ? -1 * (4294967295 - w + 1) : w;
|
|
432
432
|
}
|
|
433
|
-
function r(e, n,
|
|
434
|
-
return w || (I(typeof
|
|
433
|
+
function r(e, n, o, w) {
|
|
434
|
+
return w || (I(typeof o == "boolean", "missing or invalid endian"), I(n + 3 < e.length, "Trying to read beyond buffer length")), S.read(e, n, o, 23, 4);
|
|
435
435
|
}
|
|
436
|
-
function
|
|
437
|
-
return w || (I(typeof
|
|
436
|
+
function i(e, n, o, w) {
|
|
437
|
+
return w || (I(typeof o == "boolean", "missing or invalid endian"), I(n + 7 < e.length, "Trying to read beyond buffer length")), S.read(e, n, o, 52, 8);
|
|
438
438
|
}
|
|
439
|
-
function t(e, n,
|
|
440
|
-
if (m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(
|
|
439
|
+
function t(e, n, o, w, m) {
|
|
440
|
+
if (m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(o != null, "missing offset"), I(o + 1 < e.length, "trying to write beyond buffer length"), le(n, 65535)), m = e.length, !(m <= o)) for (var x = 0, R = Math.min(m - o, 2); x < R; x++) e[o + x] = (n & 255 << 8 * (w ? x : 1 - x)) >>> 8 * (w ? x : 1 - x);
|
|
441
441
|
}
|
|
442
|
-
function f(e, n,
|
|
443
|
-
if (m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(
|
|
442
|
+
function f(e, n, o, w, m) {
|
|
443
|
+
if (m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(o != null, "missing offset"), I(o + 3 < e.length, "trying to write beyond buffer length"), le(n, 4294967295)), m = e.length, !(m <= o)) for (var x = 0, R = Math.min(m - o, 4); x < R; x++) e[o + x] = n >>> 8 * (w ? x : 3 - x) & 255;
|
|
444
444
|
}
|
|
445
|
-
function l(e, n,
|
|
446
|
-
m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(
|
|
445
|
+
function l(e, n, o, w, m) {
|
|
446
|
+
m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(o != null, "missing offset"), I(o + 1 < e.length, "Trying to write beyond buffer length"), ce(n, 32767, -32768)), e.length <= o || t(e, 0 <= n ? n : 65535 + n + 1, o, w, m);
|
|
447
447
|
}
|
|
448
|
-
function P(e, n,
|
|
449
|
-
m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(
|
|
448
|
+
function P(e, n, o, w, m) {
|
|
449
|
+
m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(o != null, "missing offset"), I(o + 3 < e.length, "Trying to write beyond buffer length"), ce(n, 2147483647, -2147483648)), e.length <= o || f(e, 0 <= n ? n : 4294967295 + n + 1, o, w, m);
|
|
450
450
|
}
|
|
451
|
-
function L(e, n,
|
|
452
|
-
m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(
|
|
451
|
+
function L(e, n, o, w, m) {
|
|
452
|
+
m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(o != null, "missing offset"), I(o + 3 < e.length, "Trying to write beyond buffer length"), ve(n, 34028234663852886e22, -34028234663852886e22)), e.length <= o || S.write(e, n, o, w, 23, 4);
|
|
453
453
|
}
|
|
454
|
-
function D(e, n,
|
|
455
|
-
m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(
|
|
454
|
+
function D(e, n, o, w, m) {
|
|
455
|
+
m || (I(n != null, "missing value"), I(typeof w == "boolean", "missing or invalid endian"), I(o != null, "missing offset"), I(o + 7 < e.length, "Trying to write beyond buffer length"), ve(n, 17976931348623157e292, -17976931348623157e292)), e.length <= o || S.write(e, n, o, w, 52, 8);
|
|
456
456
|
}
|
|
457
457
|
g.Buffer = c, g.SlowBuffer = c, g.INSPECT_MAX_BYTES = 50, c.poolSize = 8192, c._useTypedArrays = (function() {
|
|
458
458
|
try {
|
|
@@ -483,47 +483,47 @@ Use "options.replacer" or "options.ignoreUnknown"
|
|
|
483
483
|
}, c.isBuffer = function(e) {
|
|
484
484
|
return !(e == null || !e._isBuffer);
|
|
485
485
|
}, c.byteLength = function(e, n) {
|
|
486
|
-
var
|
|
486
|
+
var o;
|
|
487
487
|
switch (e += "", n || "utf8") {
|
|
488
488
|
case "hex":
|
|
489
|
-
|
|
489
|
+
o = e.length / 2;
|
|
490
490
|
break;
|
|
491
491
|
case "utf8":
|
|
492
492
|
case "utf-8":
|
|
493
|
-
|
|
493
|
+
o = Z(e).length;
|
|
494
494
|
break;
|
|
495
495
|
case "ascii":
|
|
496
496
|
case "binary":
|
|
497
497
|
case "raw":
|
|
498
|
-
|
|
498
|
+
o = e.length;
|
|
499
499
|
break;
|
|
500
500
|
case "base64":
|
|
501
|
-
|
|
501
|
+
o = we(e).length;
|
|
502
502
|
break;
|
|
503
503
|
case "ucs2":
|
|
504
504
|
case "ucs-2":
|
|
505
505
|
case "utf16le":
|
|
506
506
|
case "utf-16le":
|
|
507
|
-
|
|
507
|
+
o = 2 * e.length;
|
|
508
508
|
break;
|
|
509
509
|
default:
|
|
510
510
|
throw new Error("Unknown encoding");
|
|
511
511
|
}
|
|
512
|
-
return
|
|
512
|
+
return o;
|
|
513
513
|
}, c.concat = function(e, n) {
|
|
514
514
|
if (I($(e), `Usage: Buffer.concat(list, [totalLength])
|
|
515
515
|
list should be an Array.`), e.length === 0) return new c(0);
|
|
516
516
|
if (e.length === 1) return e[0];
|
|
517
517
|
if (typeof n != "number") for (m = n = 0; m < e.length; m++) n += e[m].length;
|
|
518
|
-
for (var
|
|
518
|
+
for (var o = new c(n), w = 0, m = 0; m < e.length; m++) {
|
|
519
519
|
var x = e[m];
|
|
520
|
-
x.copy(
|
|
520
|
+
x.copy(o, w), w += x.length;
|
|
521
521
|
}
|
|
522
|
-
return
|
|
523
|
-
}, c.prototype.write = function(e, n,
|
|
524
|
-
isFinite(n) ? isFinite(
|
|
522
|
+
return o;
|
|
523
|
+
}, c.prototype.write = function(e, n, o, w) {
|
|
524
|
+
isFinite(n) ? isFinite(o) || (w = o, o = void 0) : (G = w, w = n, n = o, o = G), n = Number(n) || 0;
|
|
525
525
|
var m, x, R, V, G = this.length - n;
|
|
526
|
-
switch ((!
|
|
526
|
+
switch ((!o || G < (o = Number(o))) && (o = G), w = String(w || "utf8").toLowerCase()) {
|
|
527
527
|
case "hex":
|
|
528
528
|
m = (function(Q, K, X, H) {
|
|
529
529
|
X = Number(X) || 0;
|
|
@@ -534,32 +534,32 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
534
534
|
I(!isNaN(_e), "Invalid hex string"), Q[X + ee] = _e;
|
|
535
535
|
}
|
|
536
536
|
return c._charsWritten = 2 * ee, ee;
|
|
537
|
-
})(this, e, n,
|
|
537
|
+
})(this, e, n, o);
|
|
538
538
|
break;
|
|
539
539
|
case "utf8":
|
|
540
540
|
case "utf-8":
|
|
541
|
-
x = this, R = n, V =
|
|
541
|
+
x = this, R = n, V = o, m = c._charsWritten = ie(Z(e), x, R, V);
|
|
542
542
|
break;
|
|
543
543
|
case "ascii":
|
|
544
544
|
case "binary":
|
|
545
|
-
m = b(this, e, n,
|
|
545
|
+
m = b(this, e, n, o);
|
|
546
546
|
break;
|
|
547
547
|
case "base64":
|
|
548
|
-
x = this, R = n, V =
|
|
548
|
+
x = this, R = n, V = o, m = c._charsWritten = ie(we(e), x, R, V);
|
|
549
549
|
break;
|
|
550
550
|
case "ucs2":
|
|
551
551
|
case "ucs-2":
|
|
552
552
|
case "utf16le":
|
|
553
553
|
case "utf-16le":
|
|
554
|
-
m = A(this, e, n,
|
|
554
|
+
m = A(this, e, n, o);
|
|
555
555
|
break;
|
|
556
556
|
default:
|
|
557
557
|
throw new Error("Unknown encoding");
|
|
558
558
|
}
|
|
559
559
|
return m;
|
|
560
|
-
}, c.prototype.toString = function(e, n,
|
|
560
|
+
}, c.prototype.toString = function(e, n, o) {
|
|
561
561
|
var w, m, x, R, V = this;
|
|
562
|
-
if (e = String(e || "utf8").toLowerCase(), n = Number(n) || 0, (
|
|
562
|
+
if (e = String(e || "utf8").toLowerCase(), n = Number(n) || 0, (o = o !== void 0 ? Number(o) : V.length) === n) return "";
|
|
563
563
|
switch (e) {
|
|
564
564
|
case "hex":
|
|
565
565
|
w = (function(G, Q, K) {
|
|
@@ -567,7 +567,7 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
567
567
|
(!Q || Q < 0) && (Q = 0), (!K || K < 0 || X < K) && (K = X);
|
|
568
568
|
for (var H = "", z = Q; z < K; z++) H += T(G[z]);
|
|
569
569
|
return H;
|
|
570
|
-
})(V, n,
|
|
570
|
+
})(V, n, o);
|
|
571
571
|
break;
|
|
572
572
|
case "utf8":
|
|
573
573
|
case "utf-8":
|
|
@@ -576,14 +576,14 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
576
576
|
K = Math.min(G.length, K);
|
|
577
577
|
for (var z = Q; z < K; z++) G[z] <= 127 ? (X += be(H) + String.fromCharCode(G[z]), H = "") : H += "%" + G[z].toString(16);
|
|
578
578
|
return X + be(H);
|
|
579
|
-
})(V, n,
|
|
579
|
+
})(V, n, o);
|
|
580
580
|
break;
|
|
581
581
|
case "ascii":
|
|
582
582
|
case "binary":
|
|
583
|
-
w = _(V, n,
|
|
583
|
+
w = _(V, n, o);
|
|
584
584
|
break;
|
|
585
585
|
case "base64":
|
|
586
|
-
m = V, R =
|
|
586
|
+
m = V, R = o, w = (x = n) === 0 && R === m.length ? E.fromByteArray(m) : E.fromByteArray(m.slice(x, R));
|
|
587
587
|
break;
|
|
588
588
|
case "ucs2":
|
|
589
589
|
case "ucs-2":
|
|
@@ -592,7 +592,7 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
592
592
|
w = (function(G, Q, K) {
|
|
593
593
|
for (var X = G.slice(Q, K), H = "", z = 0; z < X.length; z += 2) H += String.fromCharCode(X[z] + 256 * X[z + 1]);
|
|
594
594
|
return H;
|
|
595
|
-
})(V, n,
|
|
595
|
+
})(V, n, o);
|
|
596
596
|
break;
|
|
597
597
|
default:
|
|
598
598
|
throw new Error("Unknown encoding");
|
|
@@ -600,16 +600,16 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
600
600
|
return w;
|
|
601
601
|
}, c.prototype.toJSON = function() {
|
|
602
602
|
return { type: "Buffer", data: Array.prototype.slice.call(this._arr || this, 0) };
|
|
603
|
-
}, c.prototype.copy = function(e, n,
|
|
604
|
-
if (n = n || 0, (w = w || w === 0 ? w : this.length) !== (
|
|
605
|
-
I(
|
|
606
|
-
var m = (w = e.length - n < w -
|
|
607
|
-
if (m < 100 || !c._useTypedArrays) for (var x = 0; x < m; x++) e[x + n] = this[x +
|
|
608
|
-
else e._set(this.subarray(
|
|
603
|
+
}, c.prototype.copy = function(e, n, o, w) {
|
|
604
|
+
if (n = n || 0, (w = w || w === 0 ? w : this.length) !== (o = o || 0) && e.length !== 0 && this.length !== 0) {
|
|
605
|
+
I(o <= w, "sourceEnd < sourceStart"), I(0 <= n && n < e.length, "targetStart out of bounds"), I(0 <= o && o < this.length, "sourceStart out of bounds"), I(0 <= w && w <= this.length, "sourceEnd out of bounds"), w > this.length && (w = this.length);
|
|
606
|
+
var m = (w = e.length - n < w - o ? e.length - n + o : w) - o;
|
|
607
|
+
if (m < 100 || !c._useTypedArrays) for (var x = 0; x < m; x++) e[x + n] = this[x + o];
|
|
608
|
+
else e._set(this.subarray(o, o + m), n);
|
|
609
609
|
}
|
|
610
610
|
}, c.prototype.slice = function(e, n) {
|
|
611
|
-
var
|
|
612
|
-
if (e = Y(e,
|
|
611
|
+
var o = this.length;
|
|
612
|
+
if (e = Y(e, o, 0), n = Y(n, o, o), c._useTypedArrays) return c._augment(this.subarray(e, n));
|
|
613
613
|
for (var w = n - e, m = new c(w, void 0, !0), x = 0; x < w; x++) m[x] = this[x + e];
|
|
614
614
|
return m;
|
|
615
615
|
}, c.prototype.get = function(e) {
|
|
@@ -641,57 +641,57 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
641
641
|
}, c.prototype.readFloatBE = function(e, n) {
|
|
642
642
|
return r(this, e, !1, n);
|
|
643
643
|
}, c.prototype.readDoubleLE = function(e, n) {
|
|
644
|
-
return
|
|
644
|
+
return i(this, e, !0, n);
|
|
645
645
|
}, c.prototype.readDoubleBE = function(e, n) {
|
|
646
|
-
return
|
|
647
|
-
}, c.prototype.writeUInt8 = function(e, n,
|
|
648
|
-
|
|
649
|
-
}, c.prototype.writeUInt16LE = function(e, n,
|
|
650
|
-
t(this, e, n, !0,
|
|
651
|
-
}, c.prototype.writeUInt16BE = function(e, n,
|
|
652
|
-
t(this, e, n, !1,
|
|
653
|
-
}, c.prototype.writeUInt32LE = function(e, n,
|
|
654
|
-
f(this, e, n, !0,
|
|
655
|
-
}, c.prototype.writeUInt32BE = function(e, n,
|
|
656
|
-
f(this, e, n, !1,
|
|
657
|
-
}, c.prototype.writeInt8 = function(e, n,
|
|
658
|
-
|
|
659
|
-
}, c.prototype.writeInt16LE = function(e, n,
|
|
660
|
-
l(this, e, n, !0,
|
|
661
|
-
}, c.prototype.writeInt16BE = function(e, n,
|
|
662
|
-
l(this, e, n, !1,
|
|
663
|
-
}, c.prototype.writeInt32LE = function(e, n,
|
|
664
|
-
P(this, e, n, !0,
|
|
665
|
-
}, c.prototype.writeInt32BE = function(e, n,
|
|
666
|
-
P(this, e, n, !1,
|
|
667
|
-
}, c.prototype.writeFloatLE = function(e, n,
|
|
668
|
-
L(this, e, n, !0,
|
|
669
|
-
}, c.prototype.writeFloatBE = function(e, n,
|
|
670
|
-
L(this, e, n, !1,
|
|
671
|
-
}, c.prototype.writeDoubleLE = function(e, n,
|
|
672
|
-
D(this, e, n, !0,
|
|
673
|
-
}, c.prototype.writeDoubleBE = function(e, n,
|
|
674
|
-
D(this, e, n, !1,
|
|
675
|
-
}, c.prototype.fill = function(e, n,
|
|
676
|
-
if (n = n || 0,
|
|
677
|
-
I(0 <= n && n < this.length, "start out of bounds"), I(0 <=
|
|
678
|
-
for (var w = n; w <
|
|
646
|
+
return i(this, e, !1, n);
|
|
647
|
+
}, c.prototype.writeUInt8 = function(e, n, o) {
|
|
648
|
+
o || (I(e != null, "missing value"), I(n != null, "missing offset"), I(n < this.length, "trying to write beyond buffer length"), le(e, 255)), n >= this.length || (this[n] = e);
|
|
649
|
+
}, c.prototype.writeUInt16LE = function(e, n, o) {
|
|
650
|
+
t(this, e, n, !0, o);
|
|
651
|
+
}, c.prototype.writeUInt16BE = function(e, n, o) {
|
|
652
|
+
t(this, e, n, !1, o);
|
|
653
|
+
}, c.prototype.writeUInt32LE = function(e, n, o) {
|
|
654
|
+
f(this, e, n, !0, o);
|
|
655
|
+
}, c.prototype.writeUInt32BE = function(e, n, o) {
|
|
656
|
+
f(this, e, n, !1, o);
|
|
657
|
+
}, c.prototype.writeInt8 = function(e, n, o) {
|
|
658
|
+
o || (I(e != null, "missing value"), I(n != null, "missing offset"), I(n < this.length, "Trying to write beyond buffer length"), ce(e, 127, -128)), n >= this.length || (0 <= e ? this.writeUInt8(e, n, o) : this.writeUInt8(255 + e + 1, n, o));
|
|
659
|
+
}, c.prototype.writeInt16LE = function(e, n, o) {
|
|
660
|
+
l(this, e, n, !0, o);
|
|
661
|
+
}, c.prototype.writeInt16BE = function(e, n, o) {
|
|
662
|
+
l(this, e, n, !1, o);
|
|
663
|
+
}, c.prototype.writeInt32LE = function(e, n, o) {
|
|
664
|
+
P(this, e, n, !0, o);
|
|
665
|
+
}, c.prototype.writeInt32BE = function(e, n, o) {
|
|
666
|
+
P(this, e, n, !1, o);
|
|
667
|
+
}, c.prototype.writeFloatLE = function(e, n, o) {
|
|
668
|
+
L(this, e, n, !0, o);
|
|
669
|
+
}, c.prototype.writeFloatBE = function(e, n, o) {
|
|
670
|
+
L(this, e, n, !1, o);
|
|
671
|
+
}, c.prototype.writeDoubleLE = function(e, n, o) {
|
|
672
|
+
D(this, e, n, !0, o);
|
|
673
|
+
}, c.prototype.writeDoubleBE = function(e, n, o) {
|
|
674
|
+
D(this, e, n, !1, o);
|
|
675
|
+
}, c.prototype.fill = function(e, n, o) {
|
|
676
|
+
if (n = n || 0, o = o || this.length, I(typeof (e = typeof (e = e || 0) == "string" ? e.charCodeAt(0) : e) == "number" && !isNaN(e), "value is not a number"), I(n <= o, "end < start"), o !== n && this.length !== 0) {
|
|
677
|
+
I(0 <= n && n < this.length, "start out of bounds"), I(0 <= o && o <= this.length, "end out of bounds");
|
|
678
|
+
for (var w = n; w < o; w++) this[w] = e;
|
|
679
679
|
}
|
|
680
680
|
}, c.prototype.inspect = function() {
|
|
681
|
-
for (var e = [], n = this.length,
|
|
682
|
-
e[
|
|
681
|
+
for (var e = [], n = this.length, o = 0; o < n; o++) if (e[o] = T(this[o]), o === g.INSPECT_MAX_BYTES) {
|
|
682
|
+
e[o + 1] = "...";
|
|
683
683
|
break;
|
|
684
684
|
}
|
|
685
685
|
return "<Buffer " + e.join(" ") + ">";
|
|
686
686
|
}, c.prototype.toArrayBuffer = function() {
|
|
687
687
|
if (typeof Uint8Array > "u") throw new Error("Buffer.toArrayBuffer not supported in this browser");
|
|
688
688
|
if (c._useTypedArrays) return new c(this).buffer;
|
|
689
|
-
for (var e = new Uint8Array(this.length), n = 0,
|
|
689
|
+
for (var e = new Uint8Array(this.length), n = 0, o = e.length; n < o; n += 1) e[n] = this[n];
|
|
690
690
|
return e.buffer;
|
|
691
691
|
};
|
|
692
692
|
var j = c.prototype;
|
|
693
|
-
function Y(e, n,
|
|
694
|
-
return typeof e != "number" ?
|
|
693
|
+
function Y(e, n, o) {
|
|
694
|
+
return typeof e != "number" ? o : n <= (e = ~~e) ? n : 0 <= e || 0 <= (e += n) ? e : 0;
|
|
695
695
|
}
|
|
696
696
|
function J(e) {
|
|
697
697
|
return (e = ~~Math.ceil(+e)) < 0 ? 0 : e;
|
|
@@ -705,18 +705,18 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
705
705
|
return e < 16 ? "0" + e.toString(16) : e.toString(16);
|
|
706
706
|
}
|
|
707
707
|
function Z(e) {
|
|
708
|
-
for (var n = [],
|
|
709
|
-
var w = e.charCodeAt(
|
|
710
|
-
if (w <= 127) n.push(e.charCodeAt(
|
|
711
|
-
else for (var m =
|
|
708
|
+
for (var n = [], o = 0; o < e.length; o++) {
|
|
709
|
+
var w = e.charCodeAt(o);
|
|
710
|
+
if (w <= 127) n.push(e.charCodeAt(o));
|
|
711
|
+
else for (var m = o, x = (55296 <= w && w <= 57343 && o++, encodeURIComponent(e.slice(m, o + 1)).substr(1).split("%")), R = 0; R < x.length; R++) n.push(parseInt(x[R], 16));
|
|
712
712
|
}
|
|
713
713
|
return n;
|
|
714
714
|
}
|
|
715
715
|
function we(e) {
|
|
716
716
|
return E.toByteArray(e);
|
|
717
717
|
}
|
|
718
|
-
function
|
|
719
|
-
for (var m = 0; m < w && !(m +
|
|
718
|
+
function ie(e, n, o, w) {
|
|
719
|
+
for (var m = 0; m < w && !(m + o >= n.length || m >= e.length); m++) n[m + o] = e[m];
|
|
720
720
|
return m;
|
|
721
721
|
}
|
|
722
722
|
function be(e) {
|
|
@@ -729,11 +729,11 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
729
729
|
function le(e, n) {
|
|
730
730
|
I(typeof e == "number", "cannot write a non-number as a number"), I(0 <= e, "specified a negative value for writing an unsigned value"), I(e <= n, "value is larger than maximum value for type"), I(Math.floor(e) === e, "value has a fractional component");
|
|
731
731
|
}
|
|
732
|
-
function ce(e, n,
|
|
733
|
-
I(typeof e == "number", "cannot write a non-number as a number"), I(e <= n, "value larger than maximum allowed value"), I(
|
|
732
|
+
function ce(e, n, o) {
|
|
733
|
+
I(typeof e == "number", "cannot write a non-number as a number"), I(e <= n, "value larger than maximum allowed value"), I(o <= e, "value smaller than minimum allowed value"), I(Math.floor(e) === e, "value has a fractional component");
|
|
734
734
|
}
|
|
735
|
-
function ve(e, n,
|
|
736
|
-
I(typeof e == "number", "cannot write a non-number as a number"), I(e <= n, "value larger than maximum allowed value"), I(
|
|
735
|
+
function ve(e, n, o) {
|
|
736
|
+
I(typeof e == "number", "cannot write a non-number as a number"), I(e <= n, "value larger than maximum allowed value"), I(o <= e, "value smaller than minimum allowed value");
|
|
737
737
|
}
|
|
738
738
|
function I(e, n) {
|
|
739
739
|
if (!e) throw new Error(n || "Failed assertion");
|
|
@@ -785,38 +785,38 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
785
785
|
f(l);
|
|
786
786
|
}
|
|
787
787
|
};
|
|
788
|
-
var d, r = ["createCredentials", "createCipher", "createCipheriv", "createDecipher", "createDecipheriv", "createSign", "createVerify", "createDiffieHellman", "pbkdf2"],
|
|
788
|
+
var d, r = ["createCredentials", "createCipher", "createCipheriv", "createDecipher", "createDecipheriv", "createSign", "createVerify", "createDiffieHellman", "pbkdf2"], i = function(t) {
|
|
789
789
|
g[t] = function() {
|
|
790
790
|
a("sorry,", t, "is not implemented yet");
|
|
791
791
|
};
|
|
792
792
|
};
|
|
793
|
-
for (d in r)
|
|
793
|
+
for (d in r) i(r[d]);
|
|
794
794
|
}).call(this, u("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, u("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/crypto-browserify/index.js", "/node_modules/gulp-browserify/node_modules/crypto-browserify");
|
|
795
795
|
}, { "./md5": 6, "./rng": 7, "./sha": 8, "./sha256": 9, buffer: 3, lYpoI2: 11 }], 6: [function(u, p, g) {
|
|
796
796
|
(function(y, B, k, U, q, M, N, O, F) {
|
|
797
797
|
var E = u("./helpers");
|
|
798
798
|
function S(a, d) {
|
|
799
799
|
a[d >> 5] |= 128 << d % 32, a[14 + (d + 64 >>> 9 << 4)] = d;
|
|
800
|
-
for (var r = 1732584193,
|
|
801
|
-
var P = r, L =
|
|
802
|
-
r = b(r,
|
|
800
|
+
for (var r = 1732584193, i = -271733879, t = -1732584194, f = 271733878, l = 0; l < a.length; l += 16) {
|
|
801
|
+
var P = r, L = i, D = t, j = f, r = b(r, i, t, f, a[l + 0], 7, -680876936), f = b(f, r, i, t, a[l + 1], 12, -389564586), t = b(t, f, r, i, a[l + 2], 17, 606105819), i = b(i, t, f, r, a[l + 3], 22, -1044525330);
|
|
802
|
+
r = b(r, i, t, f, a[l + 4], 7, -176418897), f = b(f, r, i, t, a[l + 5], 12, 1200080426), t = b(t, f, r, i, a[l + 6], 17, -1473231341), i = b(i, t, f, r, a[l + 7], 22, -45705983), r = b(r, i, t, f, a[l + 8], 7, 1770035416), f = b(f, r, i, t, a[l + 9], 12, -1958414417), t = b(t, f, r, i, a[l + 10], 17, -42063), i = b(i, t, f, r, a[l + 11], 22, -1990404162), r = b(r, i, t, f, a[l + 12], 7, 1804603682), f = b(f, r, i, t, a[l + 13], 12, -40341101), t = b(t, f, r, i, a[l + 14], 17, -1502002290), r = A(r, i = b(i, t, f, r, a[l + 15], 22, 1236535329), t, f, a[l + 1], 5, -165796510), f = A(f, r, i, t, a[l + 6], 9, -1069501632), t = A(t, f, r, i, a[l + 11], 14, 643717713), i = A(i, t, f, r, a[l + 0], 20, -373897302), r = A(r, i, t, f, a[l + 5], 5, -701558691), f = A(f, r, i, t, a[l + 10], 9, 38016083), t = A(t, f, r, i, a[l + 15], 14, -660478335), i = A(i, t, f, r, a[l + 4], 20, -405537848), r = A(r, i, t, f, a[l + 9], 5, 568446438), f = A(f, r, i, t, a[l + 14], 9, -1019803690), t = A(t, f, r, i, a[l + 3], 14, -187363961), i = A(i, t, f, r, a[l + 8], 20, 1163531501), r = A(r, i, t, f, a[l + 13], 5, -1444681467), f = A(f, r, i, t, a[l + 2], 9, -51403784), t = A(t, f, r, i, a[l + 7], 14, 1735328473), r = _(r, i = A(i, t, f, r, a[l + 12], 20, -1926607734), t, f, a[l + 5], 4, -378558), f = _(f, r, i, t, a[l + 8], 11, -2022574463), t = _(t, f, r, i, a[l + 11], 16, 1839030562), i = _(i, t, f, r, a[l + 14], 23, -35309556), r = _(r, i, t, f, a[l + 1], 4, -1530992060), f = _(f, r, i, t, a[l + 4], 11, 1272893353), t = _(t, f, r, i, a[l + 7], 16, -155497632), i = _(i, t, f, r, a[l + 10], 23, -1094730640), r = _(r, i, t, f, a[l + 13], 4, 681279174), f = _(f, r, i, t, a[l + 0], 11, -358537222), t = _(t, f, r, i, a[l + 3], 16, -722521979), i = _(i, t, f, r, a[l + 6], 23, 76029189), r = _(r, i, t, f, a[l + 9], 4, -640364487), f = _(f, r, i, t, a[l + 12], 11, -421815835), t = _(t, f, r, i, a[l + 15], 16, 530742520), r = v(r, i = _(i, t, f, r, a[l + 2], 23, -995338651), t, f, a[l + 0], 6, -198630844), f = v(f, r, i, t, a[l + 7], 10, 1126891415), t = v(t, f, r, i, a[l + 14], 15, -1416354905), i = v(i, t, f, r, a[l + 5], 21, -57434055), r = v(r, i, t, f, a[l + 12], 6, 1700485571), f = v(f, r, i, t, a[l + 3], 10, -1894986606), t = v(t, f, r, i, a[l + 10], 15, -1051523), i = v(i, t, f, r, a[l + 1], 21, -2054922799), r = v(r, i, t, f, a[l + 8], 6, 1873313359), f = v(f, r, i, t, a[l + 15], 10, -30611744), t = v(t, f, r, i, a[l + 6], 15, -1560198380), i = v(i, t, f, r, a[l + 13], 21, 1309151649), r = v(r, i, t, f, a[l + 4], 6, -145523070), f = v(f, r, i, t, a[l + 11], 10, -1120210379), t = v(t, f, r, i, a[l + 2], 15, 718787259), i = v(i, t, f, r, a[l + 9], 21, -343485551), r = C(r, P), i = C(i, L), t = C(t, D), f = C(f, j);
|
|
803
803
|
}
|
|
804
|
-
return Array(r,
|
|
804
|
+
return Array(r, i, t, f);
|
|
805
805
|
}
|
|
806
|
-
function c(a, d, r,
|
|
807
|
-
return C((d = C(C(d, a), C(
|
|
806
|
+
function c(a, d, r, i, t, f) {
|
|
807
|
+
return C((d = C(C(d, a), C(i, f))) << t | d >>> 32 - t, r);
|
|
808
808
|
}
|
|
809
|
-
function b(a, d, r,
|
|
810
|
-
return c(d & r | ~d &
|
|
809
|
+
function b(a, d, r, i, t, f, l) {
|
|
810
|
+
return c(d & r | ~d & i, a, d, t, f, l);
|
|
811
811
|
}
|
|
812
|
-
function A(a, d, r,
|
|
813
|
-
return c(d &
|
|
812
|
+
function A(a, d, r, i, t, f, l) {
|
|
813
|
+
return c(d & i | r & ~i, a, d, t, f, l);
|
|
814
814
|
}
|
|
815
|
-
function _(a, d, r,
|
|
816
|
-
return c(d ^ r ^
|
|
815
|
+
function _(a, d, r, i, t, f, l) {
|
|
816
|
+
return c(d ^ r ^ i, a, d, t, f, l);
|
|
817
817
|
}
|
|
818
|
-
function v(a, d, r,
|
|
819
|
-
return c(r ^ (d | ~
|
|
818
|
+
function v(a, d, r, i, t, f, l) {
|
|
819
|
+
return c(r ^ (d | ~i), a, d, t, f, l);
|
|
820
820
|
}
|
|
821
821
|
function C(a, d) {
|
|
822
822
|
var r = (65535 & a) + (65535 & d);
|
|
@@ -838,14 +838,14 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
838
838
|
var E = u("./helpers");
|
|
839
839
|
function S(A, _) {
|
|
840
840
|
A[_ >> 5] |= 128 << 24 - _ % 32, A[15 + (_ + 64 >> 9 << 4)] = _;
|
|
841
|
-
for (var v, C, a, d = Array(80), r = 1732584193,
|
|
842
|
-
for (var L = r, D =
|
|
841
|
+
for (var v, C, a, d = Array(80), r = 1732584193, i = -271733879, t = -1732584194, f = 271733878, l = -1009589776, P = 0; P < A.length; P += 16) {
|
|
842
|
+
for (var L = r, D = i, j = t, Y = f, J = l, $ = 0; $ < 80; $++) {
|
|
843
843
|
d[$] = $ < 16 ? A[P + $] : b(d[$ - 3] ^ d[$ - 8] ^ d[$ - 14] ^ d[$ - 16], 1);
|
|
844
|
-
var T = c(c(b(r, 5), (T =
|
|
844
|
+
var T = c(c(b(r, 5), (T = i, C = t, a = f, (v = $) < 20 ? T & C | ~T & a : !(v < 40) && v < 60 ? T & C | T & a | C & a : T ^ C ^ a)), c(c(l, d[$]), (v = $) < 20 ? 1518500249 : v < 40 ? 1859775393 : v < 60 ? -1894007588 : -899497514)), l = f, f = t, t = b(i, 30), i = r, r = T;
|
|
845
845
|
}
|
|
846
|
-
r = c(r, L),
|
|
846
|
+
r = c(r, L), i = c(i, D), t = c(t, j), f = c(f, Y), l = c(l, J);
|
|
847
847
|
}
|
|
848
|
-
return Array(r,
|
|
848
|
+
return Array(r, i, t, f, l);
|
|
849
849
|
}
|
|
850
850
|
function c(A, _) {
|
|
851
851
|
var v = (65535 & A) + (65535 & _);
|
|
@@ -867,8 +867,8 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
867
867
|
function S(_, v) {
|
|
868
868
|
var C, a = new Array(1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080, 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774, 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808, 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291, 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817, 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218, 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479, 3329325298), d = new Array(1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225), r = new Array(64);
|
|
869
869
|
_[v >> 5] |= 128 << 24 - v % 32, _[15 + (v + 64 >> 9 << 4)] = v;
|
|
870
|
-
for (var
|
|
871
|
-
for (var l = d[0], P = d[1], L = d[2], D = d[3], j = d[4], Y = d[5], J = d[6], $ = d[7], T = 0; T < 64; T++) r[T] = T < 16 ? _[T + f] : E(E(E((t = r[T - 2], b(t, 17) ^ b(t, 19) ^ A(t, 10)), r[T - 7]), (t = r[T - 15], b(t, 7) ^ b(t, 18) ^ A(t, 3))), r[T - 16]), C = E(E(E(E($, b(t = j, 6) ^ b(t, 11) ^ b(t, 25)), j & Y ^ ~j & J), a[T]), r[T]),
|
|
870
|
+
for (var i, t, f = 0; f < _.length; f += 16) {
|
|
871
|
+
for (var l = d[0], P = d[1], L = d[2], D = d[3], j = d[4], Y = d[5], J = d[6], $ = d[7], T = 0; T < 64; T++) r[T] = T < 16 ? _[T + f] : E(E(E((t = r[T - 2], b(t, 17) ^ b(t, 19) ^ A(t, 10)), r[T - 7]), (t = r[T - 15], b(t, 7) ^ b(t, 18) ^ A(t, 3))), r[T - 16]), C = E(E(E(E($, b(t = j, 6) ^ b(t, 11) ^ b(t, 25)), j & Y ^ ~j & J), a[T]), r[T]), i = E(b(i = l, 2) ^ b(i, 13) ^ b(i, 22), l & P ^ l & L ^ P & L), $ = J, J = Y, Y = j, j = E(D, C), D = L, L = P, P = l, l = E(C, i);
|
|
872
872
|
d[0] = E(l, d[0]), d[1] = E(P, d[1]), d[2] = E(L, d[2]), d[3] = E(D, d[3]), d[4] = E(j, d[4]), d[5] = E(Y, d[5]), d[6] = E(J, d[6]), d[7] = E($, d[7]);
|
|
873
873
|
}
|
|
874
874
|
return d;
|
|
@@ -885,9 +885,9 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
885
885
|
}, { "./helpers": 4, buffer: 3, lYpoI2: 11 }], 10: [function(u, p, g) {
|
|
886
886
|
(function(y, B, k, U, q, M, N, O, F) {
|
|
887
887
|
g.read = function(E, S, c, b, f) {
|
|
888
|
-
var _, v, C = 8 * f - b - 1, a = (1 << C) - 1, d = a >> 1, r = -7,
|
|
889
|
-
for (
|
|
890
|
-
for (v = _ & (1 << -r) - 1, _ >>= -r, r += b; 0 < r; v = 256 * v + E[S +
|
|
888
|
+
var _, v, C = 8 * f - b - 1, a = (1 << C) - 1, d = a >> 1, r = -7, i = c ? f - 1 : 0, t = c ? -1 : 1, f = E[S + i];
|
|
889
|
+
for (i += t, _ = f & (1 << -r) - 1, f >>= -r, r += C; 0 < r; _ = 256 * _ + E[S + i], i += t, r -= 8) ;
|
|
890
|
+
for (v = _ & (1 << -r) - 1, _ >>= -r, r += b; 0 < r; v = 256 * v + E[S + i], i += t, r -= 8) ;
|
|
891
891
|
if (_ === 0) _ = 1 - d;
|
|
892
892
|
else {
|
|
893
893
|
if (_ === a) return v ? NaN : 1 / 0 * (f ? -1 : 1);
|
|
@@ -895,8 +895,8 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
895
895
|
}
|
|
896
896
|
return (f ? -1 : 1) * v * Math.pow(2, _ - b);
|
|
897
897
|
}, g.write = function(E, S, c, b, A, l) {
|
|
898
|
-
var v, C, a = 8 * l - A - 1, d = (1 << a) - 1, r = d >> 1,
|
|
899
|
-
for (S = Math.abs(S), isNaN(S) || S === 1 / 0 ? (C = isNaN(S) ? 1 : 0, v = d) : (v = Math.floor(Math.log(S) / Math.LN2), S * (b = Math.pow(2, -v)) < 1 && (v--, b *= 2), 2 <= (S += 1 <= v + r ?
|
|
898
|
+
var v, C, a = 8 * l - A - 1, d = (1 << a) - 1, r = d >> 1, i = A === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, t = b ? 0 : l - 1, f = b ? 1 : -1, l = S < 0 || S === 0 && 1 / S < 0 ? 1 : 0;
|
|
899
|
+
for (S = Math.abs(S), isNaN(S) || S === 1 / 0 ? (C = isNaN(S) ? 1 : 0, v = d) : (v = Math.floor(Math.log(S) / Math.LN2), S * (b = Math.pow(2, -v)) < 1 && (v--, b *= 2), 2 <= (S += 1 <= v + r ? i / b : i * Math.pow(2, 1 - r)) * b && (v++, b /= 2), d <= v + r ? (C = 0, v = d) : 1 <= v + r ? (C = (S * b - 1) * Math.pow(2, A), v += r) : (C = S * Math.pow(2, r - 1) * Math.pow(2, A), v = 0)); 8 <= A; E[c + t] = 255 & C, t += f, C /= 256, A -= 8) ;
|
|
900
900
|
for (v = v << A | C, a += A; 0 < a; E[c + t] = 255 & v, t += f, v /= 256, a -= 8) ;
|
|
901
901
|
E[c + t - f] |= 128 * l;
|
|
902
902
|
};
|
|
@@ -1031,7 +1031,14 @@ class qe {
|
|
|
1031
1031
|
k(U);
|
|
1032
1032
|
return;
|
|
1033
1033
|
}
|
|
1034
|
-
q && B(
|
|
1034
|
+
q && B(
|
|
1035
|
+
M ?? this.getEmptyResponse({
|
|
1036
|
+
name: s,
|
|
1037
|
+
query: u,
|
|
1038
|
+
empty: !1,
|
|
1039
|
+
options: p
|
|
1040
|
+
})
|
|
1041
|
+
);
|
|
1035
1042
|
},
|
|
1036
1043
|
y
|
|
1037
1044
|
)
|
|
@@ -1042,7 +1049,16 @@ class qe {
|
|
|
1042
1049
|
new Promise((U) => {
|
|
1043
1050
|
if (s == null) throw new Error("No resource name specified");
|
|
1044
1051
|
const q = (N, O, F) => {
|
|
1045
|
-
k.locked || ((N != null || O) && k.lock(), N != null ? y(N, !0, void 0) : y(
|
|
1052
|
+
k.locked || ((N != null || O) && k.lock(), N != null ? y(N, !0, void 0) : y(
|
|
1053
|
+
void 0,
|
|
1054
|
+
O,
|
|
1055
|
+
F ?? this.getEmptyResponse({
|
|
1056
|
+
name: s,
|
|
1057
|
+
query: u,
|
|
1058
|
+
empty: !1,
|
|
1059
|
+
options: p
|
|
1060
|
+
})
|
|
1061
|
+
));
|
|
1046
1062
|
}, M = k.proxy();
|
|
1047
1063
|
U(
|
|
1048
1064
|
Promise.resolve(
|
|
@@ -1138,14 +1154,14 @@ class qe {
|
|
|
1138
1154
|
}
|
|
1139
1155
|
}
|
|
1140
1156
|
const nt = (h) => h instanceof qe;
|
|
1141
|
-
function
|
|
1157
|
+
function it({
|
|
1142
1158
|
dataProvider: h,
|
|
1143
1159
|
children: s
|
|
1144
1160
|
}) {
|
|
1145
1161
|
const u = se(() => ({ dataProvider: h }), [h]);
|
|
1146
1162
|
return /* @__PURE__ */ ue(ae.Provider, { value: u, children: s });
|
|
1147
1163
|
}
|
|
1148
|
-
function
|
|
1164
|
+
function ot(h) {
|
|
1149
1165
|
if (typeof h != "function")
|
|
1150
1166
|
throw new Error("No valid plugin definition specified");
|
|
1151
1167
|
return (s) => {
|
|
@@ -1439,9 +1455,9 @@ function Ke({
|
|
|
1439
1455
|
l.abort();
|
|
1440
1456
|
};
|
|
1441
1457
|
}, [v, _]);
|
|
1442
|
-
const d = S !== b.revision, r = d ? E : b.request,
|
|
1443
|
-
() => ({ request: r, revision:
|
|
1444
|
-
[r,
|
|
1458
|
+
const d = S !== b.revision, r = d ? E : b.request, i = d ? S : b.revision, t = se(
|
|
1459
|
+
() => ({ request: r, revision: i }),
|
|
1460
|
+
[r, i]
|
|
1445
1461
|
), f = se(
|
|
1446
1462
|
() => ({ ...b, dataProvider: O, isLoading: c, isStale: d, next: t, notify: a }),
|
|
1447
1463
|
[b, O, c, d, t, a]
|
|
@@ -1479,7 +1495,7 @@ export {
|
|
|
1479
1495
|
je as AbortSignal,
|
|
1480
1496
|
ke as ChannelNotifier,
|
|
1481
1497
|
Ze as ConfigConsumer,
|
|
1482
|
-
|
|
1498
|
+
it as ConfigProvider,
|
|
1483
1499
|
qe as DataProvider,
|
|
1484
1500
|
ye as Meta,
|
|
1485
1501
|
Be as Notifier,
|
|
@@ -1487,7 +1503,7 @@ export {
|
|
|
1487
1503
|
et as ResourceConsumer,
|
|
1488
1504
|
Fe as ResourceProvider,
|
|
1489
1505
|
rt as compose,
|
|
1490
|
-
|
|
1506
|
+
ot as createPlugin,
|
|
1491
1507
|
nt as isDataProvider,
|
|
1492
1508
|
Ue as useConfigContext,
|
|
1493
1509
|
Ke as useResource,
|