@civet/core 6.1.0 → 6.1.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 +379 -379
- package/dist/useResource.d.ts +1 -1
- package/package.json +1 -1
package/dist/main.js
CHANGED
|
@@ -2,7 +2,7 @@ import { createContext as Ee, useContext as xe, useMemo as oe, useReducer as qe,
|
|
|
2
2
|
import { jsx as se } from "react/jsx-runtime";
|
|
3
3
|
const ue = Ee({});
|
|
4
4
|
ue.displayName = "ConfigContext";
|
|
5
|
-
const et = ue.Consumer,
|
|
5
|
+
const et = ue.Consumer, Ue = () => xe(ue), ae = Ee({
|
|
6
6
|
name: "",
|
|
7
7
|
query: void 0,
|
|
8
8
|
options: void 0,
|
|
@@ -21,7 +21,7 @@ const et = ue.Consumer, Pe = () => xe(ue), ae = Ee({
|
|
|
21
21
|
notify: () => Promise.reject(new Error("Missing context provider"))
|
|
22
22
|
});
|
|
23
23
|
ae.displayName = "ResourceContext";
|
|
24
|
-
const
|
|
24
|
+
const Pe = ae.Provider, tt = ae.Consumer, rt = () => xe(ae);
|
|
25
25
|
class Ae {
|
|
26
26
|
listeners = /* @__PURE__ */ new Set();
|
|
27
27
|
subscribe = (s) => {
|
|
@@ -123,7 +123,7 @@ function Re() {
|
|
|
123
123
|
if (s === a) return !0;
|
|
124
124
|
if (s && a && typeof s == "object" && typeof a == "object") {
|
|
125
125
|
if (s.constructor !== a.constructor) return !1;
|
|
126
|
-
var p, m,
|
|
126
|
+
var p, m, b;
|
|
127
127
|
if (Array.isArray(s)) {
|
|
128
128
|
if (p = s.length, p != a.length) return !1;
|
|
129
129
|
for (m = p; m-- !== 0; )
|
|
@@ -133,11 +133,11 @@ function Re() {
|
|
|
133
133
|
if (s.constructor === RegExp) return s.source === a.source && s.flags === a.flags;
|
|
134
134
|
if (s.valueOf !== Object.prototype.valueOf) return s.valueOf() === a.valueOf();
|
|
135
135
|
if (s.toString !== Object.prototype.toString) return s.toString() === a.toString();
|
|
136
|
-
if (
|
|
136
|
+
if (b = Object.keys(s), p = b.length, p !== Object.keys(a).length) return !1;
|
|
137
137
|
for (m = p; m-- !== 0; )
|
|
138
|
-
if (!Object.prototype.hasOwnProperty.call(a,
|
|
138
|
+
if (!Object.prototype.hasOwnProperty.call(a, b[m])) return !1;
|
|
139
139
|
for (m = p; m-- !== 0; ) {
|
|
140
|
-
var j =
|
|
140
|
+
var j = b[m];
|
|
141
141
|
if (!h(s[j], a[j])) return !1;
|
|
142
142
|
}
|
|
143
143
|
return !0;
|
|
@@ -156,31 +156,31 @@ function Te() {
|
|
|
156
156
|
(function(a) {
|
|
157
157
|
h.exports = a();
|
|
158
158
|
})(function() {
|
|
159
|
-
return (function a(p, m,
|
|
160
|
-
function j(
|
|
161
|
-
if (!m[
|
|
162
|
-
if (!p[
|
|
163
|
-
var
|
|
164
|
-
if (!
|
|
165
|
-
if (
|
|
166
|
-
throw new Error("Cannot find module '" +
|
|
159
|
+
return (function a(p, m, b) {
|
|
160
|
+
function j(R, D) {
|
|
161
|
+
if (!m[R]) {
|
|
162
|
+
if (!p[R]) {
|
|
163
|
+
var N = typeof ie == "function" && ie;
|
|
164
|
+
if (!D && N) return N(R, !0);
|
|
165
|
+
if (P) return P(R, !0);
|
|
166
|
+
throw new Error("Cannot find module '" + R + "'");
|
|
167
167
|
}
|
|
168
|
-
|
|
169
|
-
var
|
|
170
|
-
return j(
|
|
171
|
-
},
|
|
168
|
+
D = m[R] = { exports: {} }, p[R][0].call(D.exports, function(F) {
|
|
169
|
+
var T = p[R][1][F];
|
|
170
|
+
return j(T || F);
|
|
171
|
+
}, D, D.exports, a, p, m, b);
|
|
172
172
|
}
|
|
173
|
-
return m[
|
|
173
|
+
return m[R].exports;
|
|
174
174
|
}
|
|
175
|
-
for (var
|
|
175
|
+
for (var P = typeof ie == "function" && ie, U = 0; U < b.length; U++) j(b[U]);
|
|
176
176
|
return j;
|
|
177
177
|
})({ 1: [function(a, p, m) {
|
|
178
|
-
(function(
|
|
179
|
-
var
|
|
178
|
+
(function(b, j, P, U, R, D, N, F, T) {
|
|
179
|
+
var _ = a("crypto");
|
|
180
180
|
function S(u, d) {
|
|
181
|
-
d =
|
|
181
|
+
d = E(u, d);
|
|
182
182
|
var r;
|
|
183
|
-
return (r = d.algorithm !== "passthrough" ?
|
|
183
|
+
return (r = d.algorithm !== "passthrough" ? _.createHash(d.algorithm) : new C()).write === void 0 && (r.write = r.update, r.end = r.update), v(d, r).dispatch(u), r.update || r.end(""), r.digest ? r.digest(d.encoding === "buffer" ? void 0 : d.encoding) : (u = r.read(), d.encoding !== "buffer" ? u.toString(d.encoding) : u);
|
|
184
184
|
}
|
|
185
185
|
(m = p.exports = S).sha1 = function(u) {
|
|
186
186
|
return S(u);
|
|
@@ -191,16 +191,16 @@ function Te() {
|
|
|
191
191
|
}, m.keysMD5 = function(u) {
|
|
192
192
|
return S(u, { algorithm: "md5", encoding: "hex", excludeValues: !0 });
|
|
193
193
|
};
|
|
194
|
-
var c =
|
|
195
|
-
function
|
|
194
|
+
var c = _.getHashes ? _.getHashes().slice() : ["sha1", "md5"], w = (c.push("passthrough"), ["buffer", "hex", "binary", "base64"]);
|
|
195
|
+
function E(u, 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, u === void 0) throw new Error("Object argument required.");
|
|
198
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
|
-
if (
|
|
200
|
+
if (w.indexOf(r.encoding) === -1 && r.algorithm !== "passthrough") throw new Error('Encoding "' + r.encoding + '" not supported. supported values: ' + w.join(", "));
|
|
201
201
|
return r;
|
|
202
202
|
}
|
|
203
|
-
function
|
|
203
|
+
function I(u) {
|
|
204
204
|
if (typeof u == "function") return /^function\s+\w*\s*\(\s*\)\s*{\s+\[native code\]\s+}$/i.exec(Function.prototype.toString.call(u)) != null;
|
|
205
205
|
}
|
|
206
206
|
function v(u, d, r) {
|
|
@@ -211,30 +211,30 @@ function Te() {
|
|
|
211
211
|
return { dispatch: function(t) {
|
|
212
212
|
return this["_" + ((t = u.replacer ? u.replacer(t) : t) === null ? "null" : typeof t)](t);
|
|
213
213
|
}, _object: function(t) {
|
|
214
|
-
var f, l = Object.prototype.toString.call(t),
|
|
215
|
-
if (
|
|
216
|
-
if (r.push(t),
|
|
217
|
-
if (
|
|
218
|
-
return !u.excludeKeys(
|
|
219
|
-
})), i("object:" + l.length + ":"), f = this, l.forEach(function(
|
|
220
|
-
f.dispatch(
|
|
214
|
+
var f, l = Object.prototype.toString.call(t), q = /\[object (.*)\]/i.exec(l);
|
|
215
|
+
if (q = (q = q ? q[1] : "unknown:[" + l + "]").toLowerCase(), 0 <= (l = r.indexOf(t))) return this.dispatch("[CIRCULAR:" + l + "]");
|
|
216
|
+
if (r.push(t), P !== void 0 && P.isBuffer && P.isBuffer(t)) return i("buffer:"), i(t);
|
|
217
|
+
if (q === "object" || q === "function" || q === "asyncfunction") return l = Object.keys(t), u.unorderedObjects && (l = l.sort()), u.respectType === !1 || I(t) || l.splice(0, 0, "prototype", "__proto__", "constructor"), u.excludeKeys && (l = l.filter(function(L) {
|
|
218
|
+
return !u.excludeKeys(L);
|
|
219
|
+
})), i("object:" + l.length + ":"), f = this, l.forEach(function(L) {
|
|
220
|
+
f.dispatch(L), i(":"), u.excludeValues || f.dispatch(t[L]), i(",");
|
|
221
221
|
});
|
|
222
|
-
if (!this["_" +
|
|
223
|
-
if (u.ignoreUnknown) return i("[" +
|
|
224
|
-
throw new Error('Unknown object type "' +
|
|
222
|
+
if (!this["_" + q]) {
|
|
223
|
+
if (u.ignoreUnknown) return i("[" + q + "]");
|
|
224
|
+
throw new Error('Unknown object type "' + q + '"');
|
|
225
225
|
}
|
|
226
|
-
this["_" +
|
|
227
|
-
}, _array: function(t,
|
|
228
|
-
|
|
226
|
+
this["_" + q](t);
|
|
227
|
+
}, _array: function(t, L) {
|
|
228
|
+
L = L !== void 0 ? L : u.unorderedArrays !== !1;
|
|
229
229
|
var l = this;
|
|
230
|
-
if (i("array:" + t.length + ":"), !
|
|
231
|
-
return l.dispatch(
|
|
230
|
+
if (i("array:" + t.length + ":"), !L || t.length <= 1) return t.forEach(function(k) {
|
|
231
|
+
return l.dispatch(k);
|
|
232
232
|
});
|
|
233
|
-
var
|
|
233
|
+
var q = [], L = t.map(function(k) {
|
|
234
234
|
var B = new C(), Y = r.slice();
|
|
235
|
-
return v(u, B, Y).dispatch(
|
|
235
|
+
return v(u, B, Y).dispatch(k), q = q.concat(Y.slice(r.length)), B.read().toString();
|
|
236
236
|
});
|
|
237
|
-
return r = r.concat(
|
|
237
|
+
return r = r.concat(q), L.sort(), this._array(L, !1);
|
|
238
238
|
}, _date: function(t) {
|
|
239
239
|
return i("date:" + t.toJSON());
|
|
240
240
|
}, _symbol: function(t) {
|
|
@@ -246,7 +246,7 @@ function Te() {
|
|
|
246
246
|
}, _string: function(t) {
|
|
247
247
|
i("string:" + t.length + ":"), i(t.toString());
|
|
248
248
|
}, _function: function(t) {
|
|
249
|
-
i("fn:"),
|
|
249
|
+
i("fn:"), I(t) ? this.dispatch("[native]") : this.dispatch(t.toString()), u.respectFunctionNames !== !1 && this.dispatch("function-name:" + String(t.name)), u.respectFunctionProperties && this._object(t);
|
|
250
250
|
}, _number: function(t) {
|
|
251
251
|
return i("number:" + t.toString());
|
|
252
252
|
}, _xml: function(t) {
|
|
@@ -341,49 +341,49 @@ Use "options.replacer" or "options.ignoreUnknown"
|
|
|
341
341
|
} };
|
|
342
342
|
}
|
|
343
343
|
m.writeToStream = function(u, d, r) {
|
|
344
|
-
return r === void 0 && (r = d, d = {}), v(d =
|
|
344
|
+
return r === void 0 && (r = d, d = {}), v(d = E(u, d), r).dispatch(u);
|
|
345
345
|
};
|
|
346
346
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/fake_9a5aa49d.js", "/");
|
|
347
347
|
}, { buffer: 3, crypto: 5, lYpoI2: 11 }], 2: [function(a, p, m) {
|
|
348
|
-
(function(
|
|
349
|
-
(function(
|
|
350
|
-
var S = typeof Uint8Array < "u" ? Uint8Array : Array, c = 43,
|
|
348
|
+
(function(b, j, P, U, R, D, N, F, T) {
|
|
349
|
+
(function(_) {
|
|
350
|
+
var S = typeof Uint8Array < "u" ? Uint8Array : Array, c = 43, w = 47, E = 48, I = 97, v = 65, C = 45, u = 95;
|
|
351
351
|
function d(r) {
|
|
352
|
-
return r = r.charCodeAt(0), r === c || r === C ? 62 : r ===
|
|
352
|
+
return r = r.charCodeAt(0), r === c || r === C ? 62 : r === w || r === u ? 63 : r < E ? -1 : r < E + 10 ? r - E + 26 + 26 : r < v + 26 ? r - v : r < I + 26 ? r - I + 26 : void 0;
|
|
353
353
|
}
|
|
354
|
-
|
|
354
|
+
_.toByteArray = function(r) {
|
|
355
355
|
var i, t;
|
|
356
356
|
if (0 < r.length % 4) throw new Error("Invalid string. Length must be a multiple of 4");
|
|
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),
|
|
358
|
-
function
|
|
359
|
-
l[
|
|
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), q = 0 < f ? r.length - 4 : r.length, L = 0;
|
|
358
|
+
function k(B) {
|
|
359
|
+
l[L++] = B;
|
|
360
360
|
}
|
|
361
|
-
for (i = 0; i <
|
|
362
|
-
return f == 2 ?
|
|
363
|
-
},
|
|
364
|
-
var i, t, f, l,
|
|
365
|
-
function
|
|
361
|
+
for (i = 0; i < q; i += 4, 0) k((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), k((65280 & t) >> 8), k(255 & t);
|
|
362
|
+
return f == 2 ? k(255 & (t = d(r.charAt(i)) << 2 | d(r.charAt(i + 1)) >> 4)) : f == 1 && (k((t = d(r.charAt(i)) << 10 | d(r.charAt(i + 1)) << 4 | d(r.charAt(i + 2)) >> 2) >> 8 & 255), k(255 & t)), l;
|
|
363
|
+
}, _.fromByteArray = function(r) {
|
|
364
|
+
var i, t, f, l, q = r.length % 3, L = "";
|
|
365
|
+
function k(B) {
|
|
366
366
|
return "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(B);
|
|
367
367
|
}
|
|
368
|
-
for (i = 0, f = r.length -
|
|
369
|
-
switch (
|
|
368
|
+
for (i = 0, f = r.length - q; i < f; i += 3) t = (r[i] << 16) + (r[i + 1] << 8) + r[i + 2], L += k((l = t) >> 18 & 63) + k(l >> 12 & 63) + k(l >> 6 & 63) + k(63 & l);
|
|
369
|
+
switch (q) {
|
|
370
370
|
case 1:
|
|
371
|
-
|
|
371
|
+
L = (L += k((t = r[r.length - 1]) >> 2)) + k(t << 4 & 63) + "==";
|
|
372
372
|
break;
|
|
373
373
|
case 2:
|
|
374
|
-
|
|
374
|
+
L = (L = (L += k((t = (r[r.length - 2] << 8) + r[r.length - 1]) >> 10)) + k(t >> 4 & 63)) + k(t << 2 & 63) + "=";
|
|
375
375
|
}
|
|
376
|
-
return
|
|
376
|
+
return L;
|
|
377
377
|
};
|
|
378
378
|
})(m === void 0 ? this.base64js = {} : m);
|
|
379
379
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/base64-js/lib/b64.js", "/node_modules/gulp-browserify/node_modules/base64-js/lib");
|
|
380
380
|
}, { buffer: 3, lYpoI2: 11 }], 3: [function(a, p, m) {
|
|
381
|
-
(function(
|
|
382
|
-
var
|
|
381
|
+
(function(b, j, c, U, R, D, N, F, T) {
|
|
382
|
+
var _ = a("base64-js"), S = a("ieee754");
|
|
383
383
|
function c(e, n, o) {
|
|
384
384
|
if (!(this instanceof c)) return new c(e, n, o);
|
|
385
|
-
var y, g,
|
|
386
|
-
if (n === "base64" && $ == "string") for (e = (
|
|
385
|
+
var y, g, A, O, $ = typeof e;
|
|
386
|
+
if (n === "base64" && $ == "string") for (e = (O = e).trim ? O.trim() : O.replace(/^\s+|\s+$/g, ""); e.length % 4 != 0; ) e += "=";
|
|
387
387
|
if ($ == "number") y = J(e);
|
|
388
388
|
else if ($ == "string") y = c.byteLength(e, n);
|
|
389
389
|
else {
|
|
@@ -391,68 +391,68 @@ Use "options.replacer" or "options.ignoreUnknown"
|
|
|
391
391
|
y = J(e.length);
|
|
392
392
|
}
|
|
393
393
|
if (c._useTypedArrays ? g = c._augment(new Uint8Array(y)) : ((g = this).length = y, g._isBuffer = !0), c._useTypedArrays && typeof e.byteLength == "number") g._set(e);
|
|
394
|
-
else if (z(
|
|
394
|
+
else if (z(O = e) || c.isBuffer(O) || O && typeof O == "object" && typeof O.length == "number") for (A = 0; A < y; A++) c.isBuffer(e) ? g[A] = e.readUInt8(A) : g[A] = e[A];
|
|
395
395
|
else if ($ == "string") g.write(e, 0, n);
|
|
396
|
-
else if ($ == "number" && !c._useTypedArrays && !o) for (
|
|
396
|
+
else if ($ == "number" && !c._useTypedArrays && !o) for (A = 0; A < y; A++) g[A] = 0;
|
|
397
397
|
return g;
|
|
398
398
|
}
|
|
399
|
-
function
|
|
399
|
+
function w(e, n, o, y) {
|
|
400
400
|
return c._charsWritten = ne((function(g) {
|
|
401
|
-
for (var
|
|
402
|
-
return
|
|
401
|
+
for (var A = [], O = 0; O < g.length; O++) A.push(255 & g.charCodeAt(O));
|
|
402
|
+
return A;
|
|
403
403
|
})(n), e, o, y);
|
|
404
404
|
}
|
|
405
|
-
function
|
|
405
|
+
function E(e, n, o, y) {
|
|
406
406
|
return c._charsWritten = ne((function(g) {
|
|
407
|
-
for (var
|
|
407
|
+
for (var A, O, $ = [], H = 0; H < g.length; H++) O = g.charCodeAt(H), A = O >> 8, O = O % 256, $.push(O), $.push(A);
|
|
408
408
|
return $;
|
|
409
409
|
})(n), e, o, y);
|
|
410
410
|
}
|
|
411
|
-
function
|
|
411
|
+
function I(e, n, o) {
|
|
412
412
|
var y = "";
|
|
413
413
|
o = Math.min(e.length, o);
|
|
414
414
|
for (var g = n; g < o; g++) y += String.fromCharCode(e[g]);
|
|
415
415
|
return y;
|
|
416
416
|
}
|
|
417
|
-
function v(e, n, o,
|
|
418
|
-
|
|
419
|
-
var g,
|
|
420
|
-
if (!(
|
|
417
|
+
function v(e, n, o, A) {
|
|
418
|
+
A || (x(typeof o == "boolean", "missing or invalid endian"), x(n != null, "missing offset"), x(n + 1 < e.length, "Trying to read beyond buffer length"));
|
|
419
|
+
var g, A = e.length;
|
|
420
|
+
if (!(A <= n)) return o ? (g = e[n], n + 1 < A && (g |= e[n + 1] << 8)) : (g = e[n] << 8, n + 1 < A && (g |= e[n + 1])), g;
|
|
421
421
|
}
|
|
422
|
-
function C(e, n, o,
|
|
423
|
-
|
|
424
|
-
var g,
|
|
425
|
-
if (!(
|
|
422
|
+
function C(e, n, o, A) {
|
|
423
|
+
A || (x(typeof o == "boolean", "missing or invalid endian"), x(n != null, "missing offset"), x(n + 3 < e.length, "Trying to read beyond buffer length"));
|
|
424
|
+
var g, A = e.length;
|
|
425
|
+
if (!(A <= n)) return o ? (n + 2 < A && (g = e[n + 2] << 16), n + 1 < A && (g |= e[n + 1] << 8), g |= e[n], n + 3 < A && (g += e[n + 3] << 24 >>> 0)) : (n + 1 < A && (g = e[n + 1] << 16), n + 2 < A && (g |= e[n + 2] << 8), n + 3 < A && (g |= e[n + 3]), g += e[n] << 24 >>> 0), g;
|
|
426
426
|
}
|
|
427
427
|
function u(e, n, o, y) {
|
|
428
|
-
if (y || (
|
|
428
|
+
if (y || (x(typeof o == "boolean", "missing or invalid endian"), x(n != null, "missing offset"), x(n + 1 < e.length, "Trying to read beyond buffer length")), !(e.length <= n)) return y = v(e, n, o, !0), 32768 & y ? -1 * (65535 - y + 1) : y;
|
|
429
429
|
}
|
|
430
430
|
function d(e, n, o, y) {
|
|
431
|
-
if (y || (
|
|
431
|
+
if (y || (x(typeof o == "boolean", "missing or invalid endian"), x(n != null, "missing offset"), x(n + 3 < e.length, "Trying to read beyond buffer length")), !(e.length <= n)) return y = C(e, n, o, !0), 2147483648 & y ? -1 * (4294967295 - y + 1) : y;
|
|
432
432
|
}
|
|
433
433
|
function r(e, n, o, y) {
|
|
434
|
-
return y || (
|
|
434
|
+
return y || (x(typeof o == "boolean", "missing or invalid endian"), x(n + 3 < e.length, "Trying to read beyond buffer length")), S.read(e, n, o, 23, 4);
|
|
435
435
|
}
|
|
436
436
|
function i(e, n, o, y) {
|
|
437
|
-
return y || (
|
|
437
|
+
return y || (x(typeof o == "boolean", "missing or invalid endian"), x(n + 7 < e.length, "Trying to read beyond buffer length")), S.read(e, n, o, 52, 8);
|
|
438
438
|
}
|
|
439
439
|
function t(e, n, o, y, g) {
|
|
440
|
-
if (g || (
|
|
440
|
+
if (g || (x(n != null, "missing value"), x(typeof y == "boolean", "missing or invalid endian"), x(o != null, "missing offset"), x(o + 1 < e.length, "trying to write beyond buffer length"), fe(n, 65535)), g = e.length, !(g <= o)) for (var A = 0, O = Math.min(g - o, 2); A < O; A++) e[o + A] = (n & 255 << 8 * (y ? A : 1 - A)) >>> 8 * (y ? A : 1 - A);
|
|
441
441
|
}
|
|
442
442
|
function f(e, n, o, y, g) {
|
|
443
|
-
if (g || (
|
|
443
|
+
if (g || (x(n != null, "missing value"), x(typeof y == "boolean", "missing or invalid endian"), x(o != null, "missing offset"), x(o + 3 < e.length, "trying to write beyond buffer length"), fe(n, 4294967295)), g = e.length, !(g <= o)) for (var A = 0, O = Math.min(g - o, 4); A < O; A++) e[o + A] = n >>> 8 * (y ? A : 3 - A) & 255;
|
|
444
444
|
}
|
|
445
445
|
function l(e, n, o, y, g) {
|
|
446
|
-
g || (
|
|
446
|
+
g || (x(n != null, "missing value"), x(typeof y == "boolean", "missing or invalid endian"), x(o != null, "missing offset"), x(o + 1 < e.length, "Trying to write beyond buffer length"), le(n, 32767, -32768)), e.length <= o || t(e, 0 <= n ? n : 65535 + n + 1, o, y, g);
|
|
447
447
|
}
|
|
448
|
-
function
|
|
449
|
-
g || (
|
|
448
|
+
function q(e, n, o, y, g) {
|
|
449
|
+
g || (x(n != null, "missing value"), x(typeof y == "boolean", "missing or invalid endian"), x(o != null, "missing offset"), x(o + 3 < e.length, "Trying to write beyond buffer length"), le(n, 2147483647, -2147483648)), e.length <= o || f(e, 0 <= n ? n : 4294967295 + n + 1, o, y, g);
|
|
450
450
|
}
|
|
451
|
-
function
|
|
452
|
-
g || (
|
|
451
|
+
function L(e, n, o, y, g) {
|
|
452
|
+
g || (x(n != null, "missing value"), x(typeof y == "boolean", "missing or invalid endian"), x(o != null, "missing offset"), x(o + 3 < e.length, "Trying to write beyond buffer length"), we(n, 34028234663852886e22, -34028234663852886e22)), e.length <= o || S.write(e, n, o, y, 23, 4);
|
|
453
453
|
}
|
|
454
|
-
function
|
|
455
|
-
g || (
|
|
454
|
+
function k(e, n, o, y, g) {
|
|
455
|
+
g || (x(n != null, "missing value"), x(typeof y == "boolean", "missing or invalid endian"), x(o != null, "missing offset"), x(o + 7 < e.length, "Trying to write beyond buffer length"), we(n, 17976931348623157e292, -17976931348623157e292)), e.length <= o || S.write(e, n, o, y, 52, 8);
|
|
456
456
|
}
|
|
457
457
|
m.Buffer = c, m.SlowBuffer = c, m.INSPECT_MAX_BYTES = 50, c.poolSize = 8192, c._useTypedArrays = (function() {
|
|
458
458
|
try {
|
|
@@ -511,61 +511,61 @@ Use "options.replacer" or "options.ignoreUnknown"
|
|
|
511
511
|
}
|
|
512
512
|
return o;
|
|
513
513
|
}, c.concat = function(e, n) {
|
|
514
|
-
if (
|
|
514
|
+
if (x(z(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 (g = n = 0; g < e.length; g++) n += e[g].length;
|
|
518
518
|
for (var o = new c(n), y = 0, g = 0; g < e.length; g++) {
|
|
519
|
-
var
|
|
520
|
-
|
|
519
|
+
var A = e[g];
|
|
520
|
+
A.copy(o, y), y += A.length;
|
|
521
521
|
}
|
|
522
522
|
return o;
|
|
523
523
|
}, c.prototype.write = function(e, n, o, y) {
|
|
524
524
|
isFinite(n) ? isFinite(o) || (y = o, o = void 0) : (H = y, y = n, n = o, o = H), n = Number(n) || 0;
|
|
525
|
-
var g,
|
|
525
|
+
var g, A, O, $, H = this.length - n;
|
|
526
526
|
switch ((!o || H < (o = Number(o))) && (o = H), y = String(y || "utf8").toLowerCase()) {
|
|
527
527
|
case "hex":
|
|
528
528
|
g = (function(Q, K, X, G) {
|
|
529
529
|
X = Number(X) || 0;
|
|
530
530
|
var V = Q.length - X;
|
|
531
|
-
(!G || V < (G = Number(G))) && (G = V),
|
|
531
|
+
(!G || V < (G = Number(G))) && (G = V), x((V = K.length) % 2 == 0, "Invalid hex string"), V / 2 < G && (G = V / 2);
|
|
532
532
|
for (var ee = 0; ee < G; ee++) {
|
|
533
533
|
var ve = parseInt(K.substr(2 * ee, 2), 16);
|
|
534
|
-
|
|
534
|
+
x(!isNaN(ve), "Invalid hex string"), Q[X + ee] = ve;
|
|
535
535
|
}
|
|
536
536
|
return c._charsWritten = 2 * ee, ee;
|
|
537
537
|
})(this, e, n, o);
|
|
538
538
|
break;
|
|
539
539
|
case "utf8":
|
|
540
540
|
case "utf-8":
|
|
541
|
-
|
|
541
|
+
A = this, O = n, $ = o, g = c._charsWritten = ne(Z(e), A, O, $);
|
|
542
542
|
break;
|
|
543
543
|
case "ascii":
|
|
544
544
|
case "binary":
|
|
545
|
-
g =
|
|
545
|
+
g = w(this, e, n, o);
|
|
546
546
|
break;
|
|
547
547
|
case "base64":
|
|
548
|
-
|
|
548
|
+
A = this, O = n, $ = o, g = c._charsWritten = ne(me(e), A, O, $);
|
|
549
549
|
break;
|
|
550
550
|
case "ucs2":
|
|
551
551
|
case "ucs-2":
|
|
552
552
|
case "utf16le":
|
|
553
553
|
case "utf-16le":
|
|
554
|
-
g =
|
|
554
|
+
g = E(this, e, n, o);
|
|
555
555
|
break;
|
|
556
556
|
default:
|
|
557
557
|
throw new Error("Unknown encoding");
|
|
558
558
|
}
|
|
559
559
|
return g;
|
|
560
560
|
}, c.prototype.toString = function(e, n, o) {
|
|
561
|
-
var y, g,
|
|
561
|
+
var y, g, A, O, $ = this;
|
|
562
562
|
if (e = String(e || "utf8").toLowerCase(), n = Number(n) || 0, (o = o !== void 0 ? Number(o) : $.length) === n) return "";
|
|
563
563
|
switch (e) {
|
|
564
564
|
case "hex":
|
|
565
565
|
y = (function(H, Q, K) {
|
|
566
566
|
var X = H.length;
|
|
567
567
|
(!Q || Q < 0) && (Q = 0), (!K || K < 0 || X < K) && (K = X);
|
|
568
|
-
for (var G = "", V = Q; V < K; V++) G +=
|
|
568
|
+
for (var G = "", V = Q; V < K; V++) G += M(H[V]);
|
|
569
569
|
return G;
|
|
570
570
|
})($, n, o);
|
|
571
571
|
break;
|
|
@@ -580,10 +580,10 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
580
580
|
break;
|
|
581
581
|
case "ascii":
|
|
582
582
|
case "binary":
|
|
583
|
-
y =
|
|
583
|
+
y = I($, n, o);
|
|
584
584
|
break;
|
|
585
585
|
case "base64":
|
|
586
|
-
g = $,
|
|
586
|
+
g = $, O = o, y = (A = n) === 0 && O === g.length ? _.fromByteArray(g) : _.fromByteArray(g.slice(A, O));
|
|
587
587
|
break;
|
|
588
588
|
case "ucs2":
|
|
589
589
|
case "ucs-2":
|
|
@@ -602,22 +602,22 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
602
602
|
return { type: "Buffer", data: Array.prototype.slice.call(this._arr || this, 0) };
|
|
603
603
|
}, c.prototype.copy = function(e, n, o, y) {
|
|
604
604
|
if (n = n || 0, (y = y || y === 0 ? y : this.length) !== (o = o || 0) && e.length !== 0 && this.length !== 0) {
|
|
605
|
-
|
|
605
|
+
x(o <= y, "sourceEnd < sourceStart"), x(0 <= n && n < e.length, "targetStart out of bounds"), x(0 <= o && o < this.length, "sourceStart out of bounds"), x(0 <= y && y <= this.length, "sourceEnd out of bounds"), y > this.length && (y = this.length);
|
|
606
606
|
var g = (y = e.length - n < y - o ? e.length - n + o : y) - o;
|
|
607
|
-
if (g < 100 || !c._useTypedArrays) for (var
|
|
607
|
+
if (g < 100 || !c._useTypedArrays) for (var A = 0; A < g; A++) e[A + n] = this[A + o];
|
|
608
608
|
else e._set(this.subarray(o, o + g), n);
|
|
609
609
|
}
|
|
610
610
|
}, c.prototype.slice = function(e, n) {
|
|
611
611
|
var o = this.length;
|
|
612
612
|
if (e = Y(e, o, 0), n = Y(n, o, o), c._useTypedArrays) return c._augment(this.subarray(e, n));
|
|
613
|
-
for (var y = n - e, g = new c(y, void 0, !0),
|
|
613
|
+
for (var y = n - e, g = new c(y, void 0, !0), A = 0; A < y; A++) g[A] = this[A + e];
|
|
614
614
|
return g;
|
|
615
615
|
}, c.prototype.get = function(e) {
|
|
616
616
|
return console.log(".get() is deprecated. Access using array indexes instead."), this.readUInt8(e);
|
|
617
617
|
}, c.prototype.set = function(e, n) {
|
|
618
618
|
return console.log(".set() is deprecated. Access using array indexes instead."), this.writeUInt8(e, n);
|
|
619
619
|
}, c.prototype.readUInt8 = function(e, n) {
|
|
620
|
-
if (n || (
|
|
620
|
+
if (n || (x(e != null, "missing offset"), x(e < this.length, "Trying to read beyond buffer length")), !(e >= this.length)) return this[e];
|
|
621
621
|
}, c.prototype.readUInt16LE = function(e, n) {
|
|
622
622
|
return v(this, e, !0, n);
|
|
623
623
|
}, c.prototype.readUInt16BE = function(e, n) {
|
|
@@ -627,7 +627,7 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
627
627
|
}, c.prototype.readUInt32BE = function(e, n) {
|
|
628
628
|
return C(this, e, !1, n);
|
|
629
629
|
}, c.prototype.readInt8 = function(e, n) {
|
|
630
|
-
if (n || (
|
|
630
|
+
if (n || (x(e != null, "missing offset"), x(e < this.length, "Trying to read beyond buffer length")), !(e >= this.length)) return 128 & this[e] ? -1 * (255 - this[e] + 1) : this[e];
|
|
631
631
|
}, c.prototype.readInt16LE = function(e, n) {
|
|
632
632
|
return u(this, e, !0, n);
|
|
633
633
|
}, c.prototype.readInt16BE = function(e, n) {
|
|
@@ -645,7 +645,7 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
645
645
|
}, c.prototype.readDoubleBE = function(e, n) {
|
|
646
646
|
return i(this, e, !1, n);
|
|
647
647
|
}, c.prototype.writeUInt8 = function(e, n, o) {
|
|
648
|
-
o || (
|
|
648
|
+
o || (x(e != null, "missing value"), x(n != null, "missing offset"), x(n < this.length, "trying to write beyond buffer length"), fe(e, 255)), n >= this.length || (this[n] = e);
|
|
649
649
|
}, c.prototype.writeUInt16LE = function(e, n, o) {
|
|
650
650
|
t(this, e, n, !0, o);
|
|
651
651
|
}, c.prototype.writeUInt16BE = function(e, n, o) {
|
|
@@ -655,30 +655,30 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
655
655
|
}, c.prototype.writeUInt32BE = function(e, n, o) {
|
|
656
656
|
f(this, e, n, !1, o);
|
|
657
657
|
}, c.prototype.writeInt8 = function(e, n, o) {
|
|
658
|
-
o || (
|
|
658
|
+
o || (x(e != null, "missing value"), x(n != null, "missing offset"), x(n < this.length, "Trying to write beyond buffer length"), le(e, 127, -128)), n >= this.length || (0 <= e ? this.writeUInt8(e, n, o) : this.writeUInt8(255 + e + 1, n, o));
|
|
659
659
|
}, c.prototype.writeInt16LE = function(e, n, o) {
|
|
660
660
|
l(this, e, n, !0, o);
|
|
661
661
|
}, c.prototype.writeInt16BE = function(e, n, o) {
|
|
662
662
|
l(this, e, n, !1, o);
|
|
663
663
|
}, c.prototype.writeInt32LE = function(e, n, o) {
|
|
664
|
-
|
|
664
|
+
q(this, e, n, !0, o);
|
|
665
665
|
}, c.prototype.writeInt32BE = function(e, n, o) {
|
|
666
|
-
|
|
666
|
+
q(this, e, n, !1, o);
|
|
667
667
|
}, c.prototype.writeFloatLE = function(e, n, o) {
|
|
668
|
-
|
|
668
|
+
L(this, e, n, !0, o);
|
|
669
669
|
}, c.prototype.writeFloatBE = function(e, n, o) {
|
|
670
|
-
|
|
670
|
+
L(this, e, n, !1, o);
|
|
671
671
|
}, c.prototype.writeDoubleLE = function(e, n, o) {
|
|
672
|
-
|
|
672
|
+
k(this, e, n, !0, o);
|
|
673
673
|
}, c.prototype.writeDoubleBE = function(e, n, o) {
|
|
674
|
-
|
|
674
|
+
k(this, e, n, !1, o);
|
|
675
675
|
}, c.prototype.fill = function(e, n, o) {
|
|
676
|
-
if (n = n || 0, o = o || this.length,
|
|
677
|
-
|
|
676
|
+
if (n = n || 0, o = o || this.length, x(typeof (e = typeof (e = e || 0) == "string" ? e.charCodeAt(0) : e) == "number" && !isNaN(e), "value is not a number"), x(n <= o, "end < start"), o !== n && this.length !== 0) {
|
|
677
|
+
x(0 <= n && n < this.length, "start out of bounds"), x(0 <= o && o <= this.length, "end out of bounds");
|
|
678
678
|
for (var y = n; y < o; y++) this[y] = e;
|
|
679
679
|
}
|
|
680
680
|
}, c.prototype.inspect = function() {
|
|
681
|
-
for (var e = [], n = this.length, o = 0; o < n; o++) if (e[o] =
|
|
681
|
+
for (var e = [], n = this.length, o = 0; o < n; o++) if (e[o] = M(this[o]), o === m.INSPECT_MAX_BYTES) {
|
|
682
682
|
e[o + 1] = "...";
|
|
683
683
|
break;
|
|
684
684
|
}
|
|
@@ -701,19 +701,19 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
701
701
|
return Object.prototype.toString.call(n) === "[object Array]";
|
|
702
702
|
})(e);
|
|
703
703
|
}
|
|
704
|
-
function
|
|
704
|
+
function M(e) {
|
|
705
705
|
return e < 16 ? "0" + e.toString(16) : e.toString(16);
|
|
706
706
|
}
|
|
707
707
|
function Z(e) {
|
|
708
708
|
for (var n = [], o = 0; o < e.length; o++) {
|
|
709
709
|
var y = e.charCodeAt(o);
|
|
710
710
|
if (y <= 127) n.push(e.charCodeAt(o));
|
|
711
|
-
else for (var g = o,
|
|
711
|
+
else for (var g = o, A = (55296 <= y && y <= 57343 && o++, encodeURIComponent(e.slice(g, o + 1)).substr(1).split("%")), O = 0; O < A.length; O++) n.push(parseInt(A[O], 16));
|
|
712
712
|
}
|
|
713
713
|
return n;
|
|
714
714
|
}
|
|
715
715
|
function me(e) {
|
|
716
|
-
return
|
|
716
|
+
return _.toByteArray(e);
|
|
717
717
|
}
|
|
718
718
|
function ne(e, n, o, y) {
|
|
719
719
|
for (var g = 0; g < y && !(g + o >= n.length || g >= e.length); g++) n[g + o] = e[g];
|
|
@@ -727,15 +727,15 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
727
727
|
}
|
|
728
728
|
}
|
|
729
729
|
function fe(e, n) {
|
|
730
|
-
|
|
730
|
+
x(typeof e == "number", "cannot write a non-number as a number"), x(0 <= e, "specified a negative value for writing an unsigned value"), x(e <= n, "value is larger than maximum value for type"), x(Math.floor(e) === e, "value has a fractional component");
|
|
731
731
|
}
|
|
732
732
|
function le(e, n, o) {
|
|
733
|
-
|
|
733
|
+
x(typeof e == "number", "cannot write a non-number as a number"), x(e <= n, "value larger than maximum allowed value"), x(o <= e, "value smaller than minimum allowed value"), x(Math.floor(e) === e, "value has a fractional component");
|
|
734
734
|
}
|
|
735
735
|
function we(e, n, o) {
|
|
736
|
-
|
|
736
|
+
x(typeof e == "number", "cannot write a non-number as a number"), x(e <= n, "value larger than maximum allowed value"), x(o <= e, "value smaller than minimum allowed value");
|
|
737
737
|
}
|
|
738
|
-
function
|
|
738
|
+
function x(e, n) {
|
|
739
739
|
if (!e) throw new Error(n || "Failed assertion");
|
|
740
740
|
}
|
|
741
741
|
c._augment = function(e) {
|
|
@@ -743,31 +743,31 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
743
743
|
};
|
|
744
744
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/buffer/index.js", "/node_modules/gulp-browserify/node_modules/buffer");
|
|
745
745
|
}, { "base64-js": 2, buffer: 3, ieee754: 10, lYpoI2: 11 }], 4: [function(a, p, m) {
|
|
746
|
-
(function(
|
|
747
|
-
var
|
|
748
|
-
c.fill(0), p.exports = { hash: function(
|
|
749
|
-
for (var C =
|
|
750
|
-
t.length % S != 0 && (l = t.length + (S - t.length % S), t =
|
|
751
|
-
for (var l,
|
|
752
|
-
return
|
|
753
|
-
})(
|
|
746
|
+
(function(b, j, _, U, R, D, N, F, T) {
|
|
747
|
+
var _ = a("buffer").Buffer, S = 4, c = new _(S);
|
|
748
|
+
c.fill(0), p.exports = { hash: function(w, E, I, v) {
|
|
749
|
+
for (var C = E((function(t, f) {
|
|
750
|
+
t.length % S != 0 && (l = t.length + (S - t.length % S), t = _.concat([t, c], l));
|
|
751
|
+
for (var l, q = [], L = f ? t.readInt32BE : t.readInt32LE, k = 0; k < t.length; k += S) q.push(L.call(t, k));
|
|
752
|
+
return q;
|
|
753
|
+
})(w = _.isBuffer(w) ? w : new _(w), v), 8 * w.length), E = v, u = new _(I), d = E ? u.writeInt32BE : u.writeInt32LE, r = 0; r < C.length; r++) d.call(u, C[r], 4 * r, !0);
|
|
754
754
|
return u;
|
|
755
755
|
} };
|
|
756
756
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/crypto-browserify/helpers.js", "/node_modules/gulp-browserify/node_modules/crypto-browserify");
|
|
757
757
|
}, { buffer: 3, lYpoI2: 11 }], 5: [function(a, p, m) {
|
|
758
|
-
(function(
|
|
759
|
-
var
|
|
758
|
+
(function(b, j, _, U, R, D, N, F, T) {
|
|
759
|
+
var _ = a("buffer").Buffer, S = a("./sha"), c = a("./sha256"), w = a("./rng"), E = { sha1: S, sha256: c, md5: a("./md5") }, I = 64, v = new _(I);
|
|
760
760
|
function C(t, f) {
|
|
761
|
-
var l =
|
|
762
|
-
return l || u("algorithm:", t, "is not yet supported"), { update: function(
|
|
763
|
-
return
|
|
764
|
-
}, digest: function(
|
|
765
|
-
var
|
|
766
|
-
|
|
767
|
-
for (var z = new I
|
|
768
|
-
return J = B(
|
|
769
|
-
})(l, f,
|
|
770
|
-
return
|
|
761
|
+
var l = E[t = t || "sha1"], q = [];
|
|
762
|
+
return l || u("algorithm:", t, "is not yet supported"), { update: function(L) {
|
|
763
|
+
return _.isBuffer(L) || (L = new _(L)), q.push(L), L.length, this;
|
|
764
|
+
}, digest: function(L) {
|
|
765
|
+
var k = _.concat(q), k = f ? (function(B, Y, J) {
|
|
766
|
+
_.isBuffer(Y) || (Y = new _(Y)), _.isBuffer(J) || (J = new _(J)), Y.length > I ? Y = B(Y) : Y.length < I && (Y = _.concat([Y, v], I));
|
|
767
|
+
for (var z = new _(I), M = new _(I), Z = 0; Z < I; Z++) z[Z] = 54 ^ Y[Z], M[Z] = 92 ^ Y[Z];
|
|
768
|
+
return J = B(_.concat([z, J])), B(_.concat([M, J]));
|
|
769
|
+
})(l, f, k) : l(k);
|
|
770
|
+
return q = null, L ? k.toString(L) : k;
|
|
771
771
|
} };
|
|
772
772
|
}
|
|
773
773
|
function u() {
|
|
@@ -778,9 +778,9 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
778
778
|
v.fill(0), m.createHash = function(t) {
|
|
779
779
|
return C(t);
|
|
780
780
|
}, m.createHmac = C, m.randomBytes = function(t, f) {
|
|
781
|
-
if (!f || !f.call) return new
|
|
781
|
+
if (!f || !f.call) return new _(w(t));
|
|
782
782
|
try {
|
|
783
|
-
f.call(this, void 0, new
|
|
783
|
+
f.call(this, void 0, new _(w(t)));
|
|
784
784
|
} catch (l) {
|
|
785
785
|
f(l);
|
|
786
786
|
}
|
|
@@ -793,26 +793,26 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
793
793
|
for (d in r) i(r[d]);
|
|
794
794
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("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(a, p, m) {
|
|
796
|
-
(function(
|
|
797
|
-
var
|
|
796
|
+
(function(b, j, P, U, R, D, N, F, T) {
|
|
797
|
+
var _ = a("./helpers");
|
|
798
798
|
function S(u, d) {
|
|
799
799
|
u[d >> 5] |= 128 << d % 32, u[14 + (d + 64 >>> 9 << 4)] = d;
|
|
800
800
|
for (var r = 1732584193, i = -271733879, t = -1732584194, f = 271733878, l = 0; l < u.length; l += 16) {
|
|
801
|
-
var
|
|
802
|
-
r =
|
|
801
|
+
var q = r, L = i, k = t, B = f, r = w(r, i, t, f, u[l + 0], 7, -680876936), f = w(f, r, i, t, u[l + 1], 12, -389564586), t = w(t, f, r, i, u[l + 2], 17, 606105819), i = w(i, t, f, r, u[l + 3], 22, -1044525330);
|
|
802
|
+
r = w(r, i, t, f, u[l + 4], 7, -176418897), f = w(f, r, i, t, u[l + 5], 12, 1200080426), t = w(t, f, r, i, u[l + 6], 17, -1473231341), i = w(i, t, f, r, u[l + 7], 22, -45705983), r = w(r, i, t, f, u[l + 8], 7, 1770035416), f = w(f, r, i, t, u[l + 9], 12, -1958414417), t = w(t, f, r, i, u[l + 10], 17, -42063), i = w(i, t, f, r, u[l + 11], 22, -1990404162), r = w(r, i, t, f, u[l + 12], 7, 1804603682), f = w(f, r, i, t, u[l + 13], 12, -40341101), t = w(t, f, r, i, u[l + 14], 17, -1502002290), r = E(r, i = w(i, t, f, r, u[l + 15], 22, 1236535329), t, f, u[l + 1], 5, -165796510), f = E(f, r, i, t, u[l + 6], 9, -1069501632), t = E(t, f, r, i, u[l + 11], 14, 643717713), i = E(i, t, f, r, u[l + 0], 20, -373897302), r = E(r, i, t, f, u[l + 5], 5, -701558691), f = E(f, r, i, t, u[l + 10], 9, 38016083), t = E(t, f, r, i, u[l + 15], 14, -660478335), i = E(i, t, f, r, u[l + 4], 20, -405537848), r = E(r, i, t, f, u[l + 9], 5, 568446438), f = E(f, r, i, t, u[l + 14], 9, -1019803690), t = E(t, f, r, i, u[l + 3], 14, -187363961), i = E(i, t, f, r, u[l + 8], 20, 1163531501), r = E(r, i, t, f, u[l + 13], 5, -1444681467), f = E(f, r, i, t, u[l + 2], 9, -51403784), t = E(t, f, r, i, u[l + 7], 14, 1735328473), r = I(r, i = E(i, t, f, r, u[l + 12], 20, -1926607734), t, f, u[l + 5], 4, -378558), f = I(f, r, i, t, u[l + 8], 11, -2022574463), t = I(t, f, r, i, u[l + 11], 16, 1839030562), i = I(i, t, f, r, u[l + 14], 23, -35309556), r = I(r, i, t, f, u[l + 1], 4, -1530992060), f = I(f, r, i, t, u[l + 4], 11, 1272893353), t = I(t, f, r, i, u[l + 7], 16, -155497632), i = I(i, t, f, r, u[l + 10], 23, -1094730640), r = I(r, i, t, f, u[l + 13], 4, 681279174), f = I(f, r, i, t, u[l + 0], 11, -358537222), t = I(t, f, r, i, u[l + 3], 16, -722521979), i = I(i, t, f, r, u[l + 6], 23, 76029189), r = I(r, i, t, f, u[l + 9], 4, -640364487), f = I(f, r, i, t, u[l + 12], 11, -421815835), t = I(t, f, r, i, u[l + 15], 16, 530742520), r = v(r, i = I(i, t, f, r, u[l + 2], 23, -995338651), t, f, u[l + 0], 6, -198630844), f = v(f, r, i, t, u[l + 7], 10, 1126891415), t = v(t, f, r, i, u[l + 14], 15, -1416354905), i = v(i, t, f, r, u[l + 5], 21, -57434055), r = v(r, i, t, f, u[l + 12], 6, 1700485571), f = v(f, r, i, t, u[l + 3], 10, -1894986606), t = v(t, f, r, i, u[l + 10], 15, -1051523), i = v(i, t, f, r, u[l + 1], 21, -2054922799), r = v(r, i, t, f, u[l + 8], 6, 1873313359), f = v(f, r, i, t, u[l + 15], 10, -30611744), t = v(t, f, r, i, u[l + 6], 15, -1560198380), i = v(i, t, f, r, u[l + 13], 21, 1309151649), r = v(r, i, t, f, u[l + 4], 6, -145523070), f = v(f, r, i, t, u[l + 11], 10, -1120210379), t = v(t, f, r, i, u[l + 2], 15, 718787259), i = v(i, t, f, r, u[l + 9], 21, -343485551), r = C(r, q), i = C(i, L), t = C(t, k), f = C(f, B);
|
|
803
803
|
}
|
|
804
804
|
return Array(r, i, t, f);
|
|
805
805
|
}
|
|
806
806
|
function c(u, d, r, i, t, f) {
|
|
807
807
|
return C((d = C(C(d, u), C(i, f))) << t | d >>> 32 - t, r);
|
|
808
808
|
}
|
|
809
|
-
function
|
|
809
|
+
function w(u, d, r, i, t, f, l) {
|
|
810
810
|
return c(d & r | ~d & i, u, d, t, f, l);
|
|
811
811
|
}
|
|
812
|
-
function
|
|
812
|
+
function E(u, d, r, i, t, f, l) {
|
|
813
813
|
return c(d & i | r & ~i, u, d, t, f, l);
|
|
814
814
|
}
|
|
815
|
-
function
|
|
815
|
+
function I(u, d, r, i, t, f, l) {
|
|
816
816
|
return c(d ^ r ^ i, u, d, t, f, l);
|
|
817
817
|
}
|
|
818
818
|
function v(u, d, r, i, t, f, l) {
|
|
@@ -823,103 +823,103 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
823
823
|
return (u >> 16) + (d >> 16) + (r >> 16) << 16 | 65535 & r;
|
|
824
824
|
}
|
|
825
825
|
p.exports = function(u) {
|
|
826
|
-
return
|
|
826
|
+
return _.hash(u, S, 16);
|
|
827
827
|
};
|
|
828
828
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/crypto-browserify/md5.js", "/node_modules/gulp-browserify/node_modules/crypto-browserify");
|
|
829
829
|
}, { "./helpers": 4, buffer: 3, lYpoI2: 11 }], 7: [function(a, p, m) {
|
|
830
|
-
(function(
|
|
831
|
-
p.exports = function(
|
|
832
|
-
for (var S, c = new Array(
|
|
830
|
+
(function(b, j, P, U, R, D, N, F, T) {
|
|
831
|
+
p.exports = function(_) {
|
|
832
|
+
for (var S, c = new Array(_), w = 0; w < _; w++) (3 & w) == 0 && (S = 4294967296 * Math.random()), c[w] = S >>> ((3 & w) << 3) & 255;
|
|
833
833
|
return c;
|
|
834
834
|
};
|
|
835
835
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/crypto-browserify/rng.js", "/node_modules/gulp-browserify/node_modules/crypto-browserify");
|
|
836
836
|
}, { buffer: 3, lYpoI2: 11 }], 8: [function(a, p, m) {
|
|
837
|
-
(function(
|
|
838
|
-
var
|
|
839
|
-
function S(
|
|
840
|
-
|
|
841
|
-
for (var v, C, u, d = Array(80), r = 1732584193, i = -271733879, t = -1732584194, f = 271733878, l = -1009589776,
|
|
842
|
-
for (var
|
|
843
|
-
d[z] = z < 16 ?
|
|
844
|
-
var
|
|
837
|
+
(function(b, j, P, U, R, D, N, F, T) {
|
|
838
|
+
var _ = a("./helpers");
|
|
839
|
+
function S(E, I) {
|
|
840
|
+
E[I >> 5] |= 128 << 24 - I % 32, E[15 + (I + 64 >> 9 << 4)] = I;
|
|
841
|
+
for (var v, C, u, d = Array(80), r = 1732584193, i = -271733879, t = -1732584194, f = 271733878, l = -1009589776, q = 0; q < E.length; q += 16) {
|
|
842
|
+
for (var L = r, k = i, B = t, Y = f, J = l, z = 0; z < 80; z++) {
|
|
843
|
+
d[z] = z < 16 ? E[q + z] : w(d[z - 3] ^ d[z - 8] ^ d[z - 14] ^ d[z - 16], 1);
|
|
844
|
+
var M = c(c(w(r, 5), (M = i, C = t, u = f, (v = z) < 20 ? M & C | ~M & u : !(v < 40) && v < 60 ? M & C | M & u | C & u : M ^ C ^ u)), c(c(l, d[z]), (v = z) < 20 ? 1518500249 : v < 40 ? 1859775393 : v < 60 ? -1894007588 : -899497514)), l = f, f = t, t = w(i, 30), i = r, r = M;
|
|
845
845
|
}
|
|
846
|
-
r = c(r,
|
|
846
|
+
r = c(r, L), i = c(i, k), t = c(t, B), f = c(f, Y), l = c(l, J);
|
|
847
847
|
}
|
|
848
848
|
return Array(r, i, t, f, l);
|
|
849
849
|
}
|
|
850
|
-
function c(
|
|
851
|
-
var v = (65535 &
|
|
852
|
-
return (
|
|
850
|
+
function c(E, I) {
|
|
851
|
+
var v = (65535 & E) + (65535 & I);
|
|
852
|
+
return (E >> 16) + (I >> 16) + (v >> 16) << 16 | 65535 & v;
|
|
853
853
|
}
|
|
854
|
-
function
|
|
855
|
-
return
|
|
854
|
+
function w(E, I) {
|
|
855
|
+
return E << I | E >>> 32 - I;
|
|
856
856
|
}
|
|
857
|
-
p.exports = function(
|
|
858
|
-
return
|
|
857
|
+
p.exports = function(E) {
|
|
858
|
+
return _.hash(E, S, 20, !0);
|
|
859
859
|
};
|
|
860
860
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/crypto-browserify/sha.js", "/node_modules/gulp-browserify/node_modules/crypto-browserify");
|
|
861
861
|
}, { "./helpers": 4, buffer: 3, lYpoI2: 11 }], 9: [function(a, p, m) {
|
|
862
|
-
(function(
|
|
863
|
-
function I
|
|
864
|
-
var C = (65535 &
|
|
865
|
-
return (
|
|
862
|
+
(function(b, j, P, U, R, D, N, F, T) {
|
|
863
|
+
function _(I, v) {
|
|
864
|
+
var C = (65535 & I) + (65535 & v);
|
|
865
|
+
return (I >> 16) + (v >> 16) + (C >> 16) << 16 | 65535 & C;
|
|
866
866
|
}
|
|
867
|
-
function S(
|
|
867
|
+
function S(I, v) {
|
|
868
868
|
var C, u = 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
|
-
|
|
870
|
-
for (var i, t, f = 0; f <
|
|
871
|
-
for (var l = d[0],
|
|
872
|
-
d[0] =
|
|
869
|
+
I[v >> 5] |= 128 << 24 - v % 32, I[15 + (v + 64 >> 9 << 4)] = v;
|
|
870
|
+
for (var i, t, f = 0; f < I.length; f += 16) {
|
|
871
|
+
for (var l = d[0], q = d[1], L = d[2], k = d[3], B = d[4], Y = d[5], J = d[6], z = d[7], M = 0; M < 64; M++) r[M] = M < 16 ? I[M + f] : _(_(_((t = r[M - 2], w(t, 17) ^ w(t, 19) ^ E(t, 10)), r[M - 7]), (t = r[M - 15], w(t, 7) ^ w(t, 18) ^ E(t, 3))), r[M - 16]), C = _(_(_(_(z, w(t = B, 6) ^ w(t, 11) ^ w(t, 25)), B & Y ^ ~B & J), u[M]), r[M]), i = _(w(i = l, 2) ^ w(i, 13) ^ w(i, 22), l & q ^ l & L ^ q & L), z = J, J = Y, Y = B, B = _(k, C), k = L, L = q, q = l, l = _(C, i);
|
|
872
|
+
d[0] = _(l, d[0]), d[1] = _(q, d[1]), d[2] = _(L, d[2]), d[3] = _(k, d[3]), d[4] = _(B, d[4]), d[5] = _(Y, d[5]), d[6] = _(J, d[6]), d[7] = _(z, d[7]);
|
|
873
873
|
}
|
|
874
874
|
return d;
|
|
875
875
|
}
|
|
876
|
-
var c = a("./helpers"),
|
|
877
|
-
return
|
|
878
|
-
},
|
|
879
|
-
return
|
|
876
|
+
var c = a("./helpers"), w = function(I, v) {
|
|
877
|
+
return I >>> v | I << 32 - v;
|
|
878
|
+
}, E = function(I, v) {
|
|
879
|
+
return I >>> v;
|
|
880
880
|
};
|
|
881
|
-
p.exports = function(
|
|
882
|
-
return c.hash(
|
|
881
|
+
p.exports = function(I) {
|
|
882
|
+
return c.hash(I, S, 32, !0);
|
|
883
883
|
};
|
|
884
884
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/crypto-browserify/sha256.js", "/node_modules/gulp-browserify/node_modules/crypto-browserify");
|
|
885
885
|
}, { "./helpers": 4, buffer: 3, lYpoI2: 11 }], 10: [function(a, p, m) {
|
|
886
|
-
(function(
|
|
887
|
-
m.read = function(
|
|
888
|
-
var
|
|
889
|
-
for (i += t,
|
|
890
|
-
for (v =
|
|
891
|
-
if (
|
|
886
|
+
(function(b, j, P, U, R, D, N, F, T) {
|
|
887
|
+
m.read = function(_, S, c, w, f) {
|
|
888
|
+
var I, v, C = 8 * f - w - 1, u = (1 << C) - 1, d = u >> 1, r = -7, i = c ? f - 1 : 0, t = c ? -1 : 1, f = _[S + i];
|
|
889
|
+
for (i += t, I = f & (1 << -r) - 1, f >>= -r, r += C; 0 < r; I = 256 * I + _[S + i], i += t, r -= 8) ;
|
|
890
|
+
for (v = I & (1 << -r) - 1, I >>= -r, r += w; 0 < r; v = 256 * v + _[S + i], i += t, r -= 8) ;
|
|
891
|
+
if (I === 0) I = 1 - d;
|
|
892
892
|
else {
|
|
893
|
-
if (
|
|
894
|
-
v += Math.pow(2,
|
|
893
|
+
if (I === u) return v ? NaN : 1 / 0 * (f ? -1 : 1);
|
|
894
|
+
v += Math.pow(2, w), I -= d;
|
|
895
895
|
}
|
|
896
|
-
return (f ? -1 : 1) * v * Math.pow(2,
|
|
897
|
-
}, m.write = function(
|
|
898
|
-
var v, C, u = 8 * l -
|
|
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 * (
|
|
900
|
-
for (v = v <<
|
|
901
|
-
|
|
896
|
+
return (f ? -1 : 1) * v * Math.pow(2, I - w);
|
|
897
|
+
}, m.write = function(_, S, c, w, E, l) {
|
|
898
|
+
var v, C, u = 8 * l - E - 1, d = (1 << u) - 1, r = d >> 1, i = E === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, t = w ? 0 : l - 1, f = w ? 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 * (w = Math.pow(2, -v)) < 1 && (v--, w *= 2), 2 <= (S += 1 <= v + r ? i / w : i * Math.pow(2, 1 - r)) * w && (v++, w /= 2), d <= v + r ? (C = 0, v = d) : 1 <= v + r ? (C = (S * w - 1) * Math.pow(2, E), v += r) : (C = S * Math.pow(2, r - 1) * Math.pow(2, E), v = 0)); 8 <= E; _[c + t] = 255 & C, t += f, C /= 256, E -= 8) ;
|
|
900
|
+
for (v = v << E | C, u += E; 0 < u; _[c + t] = 255 & v, t += f, v /= 256, u -= 8) ;
|
|
901
|
+
_[c + t - f] |= 128 * l;
|
|
902
902
|
};
|
|
903
903
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/ieee754/index.js", "/node_modules/gulp-browserify/node_modules/ieee754");
|
|
904
904
|
}, { buffer: 3, lYpoI2: 11 }], 11: [function(a, p, m) {
|
|
905
|
-
(function(
|
|
906
|
-
var
|
|
907
|
-
function
|
|
905
|
+
(function(b, j, P, U, R, D, N, F, T) {
|
|
906
|
+
var _, S, c;
|
|
907
|
+
function w() {
|
|
908
908
|
}
|
|
909
|
-
(
|
|
910
|
-
return window.setImmediate(
|
|
911
|
-
} : c ? (
|
|
912
|
-
var
|
|
913
|
-
|
|
914
|
-
}, !0), function(
|
|
915
|
-
|
|
916
|
-
}) : function(
|
|
917
|
-
setTimeout(
|
|
918
|
-
}),
|
|
909
|
+
(b = p.exports = {}).nextTick = (S = typeof window < "u" && window.setImmediate, c = typeof window < "u" && window.postMessage && window.addEventListener, S ? function(E) {
|
|
910
|
+
return window.setImmediate(E);
|
|
911
|
+
} : c ? (_ = [], window.addEventListener("message", function(E) {
|
|
912
|
+
var I = E.source;
|
|
913
|
+
I !== window && I !== null || E.data !== "process-tick" || (E.stopPropagation(), 0 < _.length && _.shift()());
|
|
914
|
+
}, !0), function(E) {
|
|
915
|
+
_.push(E), window.postMessage("process-tick", "*");
|
|
916
|
+
}) : function(E) {
|
|
917
|
+
setTimeout(E, 0);
|
|
918
|
+
}), b.title = "browser", b.browser = !0, b.env = {}, b.argv = [], b.on = w, b.addListener = w, b.once = w, b.off = w, b.removeListener = w, b.removeAllListeners = w, b.emit = w, b.binding = function(E) {
|
|
919
919
|
throw new Error("process.binding is not supported");
|
|
920
|
-
},
|
|
920
|
+
}, b.cwd = function() {
|
|
921
921
|
return "/";
|
|
922
|
-
},
|
|
922
|
+
}, b.chdir = function(E) {
|
|
923
923
|
throw new Error("process.chdir is not supported");
|
|
924
924
|
};
|
|
925
925
|
}).call(this, a("lYpoI2"), typeof self < "u" ? self : typeof window < "u" ? window : {}, a("buffer").Buffer, arguments[3], arguments[4], arguments[5], arguments[6], "/node_modules/gulp-browserify/node_modules/process/browser.js", "/node_modules/gulp-browserify/node_modules/process");
|
|
@@ -927,8 +927,8 @@ list should be an Array.`), e.length === 0) return new c(0);
|
|
|
927
927
|
});
|
|
928
928
|
})(he)), he.exports;
|
|
929
929
|
}
|
|
930
|
-
var
|
|
931
|
-
const
|
|
930
|
+
var Ne = Te();
|
|
931
|
+
const Me = /* @__PURE__ */ je(Ne);
|
|
932
932
|
class ge {
|
|
933
933
|
_inferSchema;
|
|
934
934
|
_inferInstance;
|
|
@@ -956,11 +956,11 @@ class ge {
|
|
|
956
956
|
values = () => Object.values(this.data);
|
|
957
957
|
commit = (s, a) => {
|
|
958
958
|
const p = { ...this.data };
|
|
959
|
-
a?.forEach((
|
|
960
|
-
delete p[
|
|
959
|
+
a?.forEach((b) => {
|
|
960
|
+
delete p[b];
|
|
961
961
|
});
|
|
962
962
|
const m = Object.keys(p);
|
|
963
|
-
return s != null && Object.keys(s).length === m.length && m.reduce((
|
|
963
|
+
return s != null && Object.keys(s).length === m.length && m.reduce((b, j) => b && Object.is(p[j], s[j]), !0) ? s : p;
|
|
964
964
|
};
|
|
965
965
|
}
|
|
966
966
|
const Fe = (h) => h instanceof ge ? h : new ge(h);
|
|
@@ -1019,20 +1019,20 @@ class Se {
|
|
|
1019
1019
|
notify(s) {
|
|
1020
1020
|
this.notifier.trigger(this.normalizeResource(s));
|
|
1021
1021
|
}
|
|
1022
|
-
get(s, a, p, m,
|
|
1022
|
+
get(s, a, p, m, b) {
|
|
1023
1023
|
return new Promise(
|
|
1024
|
-
(j,
|
|
1024
|
+
(j, P) => this.continuousGet(
|
|
1025
1025
|
this.normalizeResource(s),
|
|
1026
1026
|
a,
|
|
1027
1027
|
p,
|
|
1028
1028
|
m,
|
|
1029
|
-
(
|
|
1030
|
-
if (
|
|
1031
|
-
U
|
|
1029
|
+
(U, R, D) => {
|
|
1030
|
+
if (U != null) {
|
|
1031
|
+
P(U);
|
|
1032
1032
|
return;
|
|
1033
1033
|
}
|
|
1034
|
-
|
|
1035
|
-
|
|
1034
|
+
R && j(
|
|
1035
|
+
D ?? this.createEmptyResponse({
|
|
1036
1036
|
name: this.normalizeResource(s),
|
|
1037
1037
|
query: a,
|
|
1038
1038
|
disabled: !1,
|
|
@@ -1040,41 +1040,41 @@ class Se {
|
|
|
1040
1040
|
})
|
|
1041
1041
|
);
|
|
1042
1042
|
},
|
|
1043
|
-
|
|
1043
|
+
b
|
|
1044
1044
|
)
|
|
1045
1045
|
);
|
|
1046
1046
|
}
|
|
1047
|
-
continuousGet(s, a, p, m,
|
|
1048
|
-
const
|
|
1049
|
-
new Promise((
|
|
1047
|
+
continuousGet(s, a, p, m, b, j) {
|
|
1048
|
+
const P = j ?? new Be();
|
|
1049
|
+
new Promise((U) => {
|
|
1050
1050
|
if (s == null) throw new Error("No resource name specified");
|
|
1051
|
-
const
|
|
1052
|
-
|
|
1051
|
+
const R = (N, F, T) => {
|
|
1052
|
+
P.locked || ((N != null || F) && P.lock(), N != null ? b(N, !0, void 0) : b(
|
|
1053
1053
|
void 0,
|
|
1054
|
-
|
|
1055
|
-
|
|
1054
|
+
F,
|
|
1055
|
+
T ?? this.createEmptyResponse({
|
|
1056
1056
|
name: this.normalizeResource(s),
|
|
1057
1057
|
query: a,
|
|
1058
1058
|
disabled: !1,
|
|
1059
1059
|
options: p
|
|
1060
1060
|
})
|
|
1061
1061
|
));
|
|
1062
|
-
},
|
|
1063
|
-
|
|
1062
|
+
}, D = P.proxy();
|
|
1063
|
+
U(
|
|
1064
1064
|
Promise.resolve(
|
|
1065
1065
|
this.handleGet(
|
|
1066
1066
|
this.normalizeResource(s),
|
|
1067
1067
|
a,
|
|
1068
1068
|
p,
|
|
1069
1069
|
Fe(m),
|
|
1070
|
-
|
|
1070
|
+
D
|
|
1071
1071
|
)
|
|
1072
|
-
).then((
|
|
1073
|
-
typeof
|
|
1072
|
+
).then((N) => {
|
|
1073
|
+
typeof N == "function" ? N(R) : R(void 0, !0, N);
|
|
1074
1074
|
})
|
|
1075
1075
|
);
|
|
1076
|
-
}).catch((
|
|
1077
|
-
|
|
1076
|
+
}).catch((U) => {
|
|
1077
|
+
P.locked || b(U, !0, void 0);
|
|
1078
1078
|
});
|
|
1079
1079
|
}
|
|
1080
1080
|
compareRequests(s, a) {
|
|
@@ -1089,7 +1089,7 @@ class Se {
|
|
|
1089
1089
|
return !0;
|
|
1090
1090
|
}
|
|
1091
1091
|
getItemIdentifier(s) {
|
|
1092
|
-
return
|
|
1092
|
+
return Me(s);
|
|
1093
1093
|
}
|
|
1094
1094
|
transition(s, a) {
|
|
1095
1095
|
return s.data;
|
|
@@ -1097,21 +1097,21 @@ class Se {
|
|
|
1097
1097
|
recycleItems(s, a) {
|
|
1098
1098
|
if (s.data == null || a.data == null)
|
|
1099
1099
|
return s.data;
|
|
1100
|
-
const p = Array.isArray(s.data) ? s.data : [s.data], m = Array.isArray(a.data) ? a.data : [a.data],
|
|
1101
|
-
p.length > 0 && m.forEach((
|
|
1102
|
-
const
|
|
1103
|
-
|
|
1100
|
+
const p = Array.isArray(s.data) ? s.data : [s.data], m = Array.isArray(a.data) ? a.data : [a.data], b = {};
|
|
1101
|
+
p.length > 0 && m.forEach((P) => {
|
|
1102
|
+
const U = this.getItemIdentifier(P);
|
|
1103
|
+
U != null && (b[U] = P);
|
|
1104
1104
|
});
|
|
1105
1105
|
let j;
|
|
1106
|
-
return m.length > 0 ? j = p.map((
|
|
1107
|
-
const
|
|
1108
|
-
if (
|
|
1109
|
-
const
|
|
1110
|
-
if (this.compareItemVersions(
|
|
1106
|
+
return m.length > 0 ? j = p.map((P) => {
|
|
1107
|
+
const U = this.getItemIdentifier(P);
|
|
1108
|
+
if (U != null && Object.prototype.hasOwnProperty.call(b, U)) {
|
|
1109
|
+
const R = b[U];
|
|
1110
|
+
if (this.compareItemVersions(P, R)) return R;
|
|
1111
1111
|
}
|
|
1112
|
-
return
|
|
1112
|
+
return P;
|
|
1113
1113
|
}) : j = p, Array.isArray(s.data) ? m.length === j.length && j.reduce(
|
|
1114
|
-
(
|
|
1114
|
+
(P, U, R) => P && Object.is(m[R], U),
|
|
1115
1115
|
!0
|
|
1116
1116
|
) ? m : j : j[0];
|
|
1117
1117
|
}
|
|
@@ -1146,9 +1146,9 @@ function Ye({
|
|
|
1146
1146
|
...a
|
|
1147
1147
|
}) {
|
|
1148
1148
|
return h.dataProvider.uiPlugins.reduceRight(
|
|
1149
|
-
(p, m) => (
|
|
1149
|
+
(p, m) => (b) => /* @__PURE__ */ se(m, { ...a, context: b, children: p }),
|
|
1150
1150
|
(p) => /* @__PURE__ */ se(
|
|
1151
|
-
|
|
1151
|
+
Pe,
|
|
1152
1152
|
{
|
|
1153
1153
|
value: p,
|
|
1154
1154
|
children: s
|
|
@@ -1176,29 +1176,29 @@ const te = {};
|
|
|
1176
1176
|
function He(h, s, a) {
|
|
1177
1177
|
let p;
|
|
1178
1178
|
{
|
|
1179
|
-
const m = Date.now(),
|
|
1180
|
-
Ge(te, m,
|
|
1179
|
+
const m = Date.now(), b = Ve();
|
|
1180
|
+
Ge(te, m, b), p = We(b, te.msecs, te.nsecs, te.clockseq, te.node, s, a);
|
|
1181
1181
|
}
|
|
1182
1182
|
return s ?? ze(p);
|
|
1183
1183
|
}
|
|
1184
1184
|
function Ge(h, s, a) {
|
|
1185
1185
|
return h.msecs ??= -1 / 0, h.nsecs ??= 0, s === h.msecs ? (h.nsecs++, h.nsecs >= 1e4 && (h.node = void 0, h.nsecs = 0)) : s > h.msecs ? h.nsecs = 0 : s < h.msecs && (h.node = void 0), h.node || (h.node = a.slice(10, 16), h.node[0] |= 1, h.clockseq = (a[8] << 8 | a[9]) & 16383), h.msecs = s, h;
|
|
1186
1186
|
}
|
|
1187
|
-
function We(h, s, a, p, m,
|
|
1187
|
+
function We(h, s, a, p, m, b, j = 0) {
|
|
1188
1188
|
if (h.length < 16)
|
|
1189
1189
|
throw new Error("Random bytes length must be >= 16");
|
|
1190
|
-
if (!
|
|
1191
|
-
|
|
1192
|
-
else if (j < 0 || j + 16 >
|
|
1190
|
+
if (!b)
|
|
1191
|
+
b = new Uint8Array(16), j = 0;
|
|
1192
|
+
else if (j < 0 || j + 16 > b.length)
|
|
1193
1193
|
throw new RangeError(`UUID byte range ${j}:${j + 15} is out of buffer bounds`);
|
|
1194
1194
|
s ??= Date.now(), a ??= 0, p ??= (h[8] << 8 | h[9]) & 16383, m ??= h.slice(10, 16), s += 122192928e5;
|
|
1195
|
-
const
|
|
1196
|
-
|
|
1197
|
-
const
|
|
1198
|
-
|
|
1199
|
-
for (let
|
|
1200
|
-
|
|
1201
|
-
return
|
|
1195
|
+
const P = ((s & 268435455) * 1e4 + a) % 4294967296;
|
|
1196
|
+
b[j++] = P >>> 24 & 255, b[j++] = P >>> 16 & 255, b[j++] = P >>> 8 & 255, b[j++] = P & 255;
|
|
1197
|
+
const U = s / 4294967296 * 1e4 & 268435455;
|
|
1198
|
+
b[j++] = U >>> 8 & 255, b[j++] = U & 255, b[j++] = U >>> 24 & 15 | 16, b[j++] = U >>> 16 & 255, b[j++] = p >>> 8 | 128, b[j++] = p & 255;
|
|
1199
|
+
for (let R = 0; R < 6; ++R)
|
|
1200
|
+
b[j++] = m[R];
|
|
1201
|
+
return b;
|
|
1202
1202
|
}
|
|
1203
1203
|
function re(h) {
|
|
1204
1204
|
let s, a, p;
|
|
@@ -1226,10 +1226,10 @@ function Je(h, s) {
|
|
|
1226
1226
|
switch (s.type) {
|
|
1227
1227
|
// Creates a new request and instructs the resource to fetch data.
|
|
1228
1228
|
case "next-request": {
|
|
1229
|
-
const { requestDetails: a, persistent: p } = s, m = re(h.request),
|
|
1229
|
+
const { requestDetails: a, persistent: p } = s, m = re(h.request), b = re(h.revision);
|
|
1230
1230
|
let j = !1;
|
|
1231
1231
|
h.persistent === "very" && p === "very" ? j = "very" : h.persistent && p && (j = !0);
|
|
1232
|
-
const
|
|
1232
|
+
const P = !a.disabled && h.dataProvider.shouldPersist(
|
|
1233
1233
|
a,
|
|
1234
1234
|
h.requestDetails,
|
|
1235
1235
|
j,
|
|
@@ -1239,14 +1239,14 @@ function Je(h, s) {
|
|
|
1239
1239
|
dataProvider: h.dataProvider,
|
|
1240
1240
|
requestDetails: a,
|
|
1241
1241
|
request: m,
|
|
1242
|
-
revision:
|
|
1242
|
+
revision: b,
|
|
1243
1243
|
isLoading: !a.disabled,
|
|
1244
|
-
value:
|
|
1244
|
+
value: P ? h.value : {
|
|
1245
1245
|
name: a.name,
|
|
1246
1246
|
query: a.query,
|
|
1247
1247
|
options: a.options,
|
|
1248
1248
|
request: m,
|
|
1249
|
-
revision:
|
|
1249
|
+
revision: b,
|
|
1250
1250
|
data: h.dataProvider.createEmptyResponse(
|
|
1251
1251
|
a
|
|
1252
1252
|
),
|
|
@@ -1289,52 +1289,52 @@ function Je(h, s) {
|
|
|
1289
1289
|
return h;
|
|
1290
1290
|
}
|
|
1291
1291
|
function Ke(h, s, a, p) {
|
|
1292
|
-
const { dataProvider: m, requestDetails:
|
|
1293
|
-
let
|
|
1294
|
-
const
|
|
1295
|
-
|
|
1292
|
+
const { dataProvider: m, requestDetails: b, request: j, revision: P, value: U } = h, R = new ge({ ...U.meta }, s);
|
|
1293
|
+
let D = Promise.resolve(U);
|
|
1294
|
+
const N = (F, T, _) => {
|
|
1295
|
+
D = D.then((S) => {
|
|
1296
1296
|
try {
|
|
1297
1297
|
let c;
|
|
1298
|
-
if (
|
|
1298
|
+
if (F != null)
|
|
1299
1299
|
c = {
|
|
1300
1300
|
...S,
|
|
1301
|
-
error:
|
|
1301
|
+
error: F,
|
|
1302
1302
|
isIncomplete: !1
|
|
1303
1303
|
};
|
|
1304
1304
|
else {
|
|
1305
|
-
const
|
|
1306
|
-
name:
|
|
1307
|
-
query:
|
|
1308
|
-
options:
|
|
1305
|
+
const w = {
|
|
1306
|
+
name: b.name,
|
|
1307
|
+
query: b.query,
|
|
1308
|
+
options: b.options,
|
|
1309
1309
|
request: j,
|
|
1310
|
-
revision:
|
|
1311
|
-
data:
|
|
1312
|
-
meta:
|
|
1310
|
+
revision: P,
|
|
1311
|
+
data: _,
|
|
1312
|
+
meta: R.commit(S.meta),
|
|
1313
1313
|
error: void 0,
|
|
1314
1314
|
isDisabled: !1,
|
|
1315
|
-
isIncomplete: !
|
|
1316
|
-
isInitial: !!S.isInitial && !
|
|
1315
|
+
isIncomplete: !T,
|
|
1316
|
+
isInitial: !!S.isInitial && !T
|
|
1317
1317
|
};
|
|
1318
|
-
|
|
1319
|
-
|
|
1318
|
+
w.data = m.transition(
|
|
1319
|
+
w,
|
|
1320
1320
|
S
|
|
1321
|
-
),
|
|
1322
|
-
|
|
1321
|
+
), w.data = m.recycleItems(
|
|
1322
|
+
w,
|
|
1323
1323
|
S
|
|
1324
|
-
), c =
|
|
1324
|
+
), c = w;
|
|
1325
1325
|
}
|
|
1326
|
-
return p({ type: "update-data", request: j, revision:
|
|
1326
|
+
return p({ type: "update-data", request: j, revision: P, value: c }), c;
|
|
1327
1327
|
} catch {
|
|
1328
1328
|
return S;
|
|
1329
1329
|
}
|
|
1330
1330
|
});
|
|
1331
1331
|
};
|
|
1332
1332
|
m.continuousGet(
|
|
1333
|
-
|
|
1334
|
-
|
|
1335
|
-
|
|
1336
|
-
|
|
1337
|
-
|
|
1333
|
+
b.name,
|
|
1334
|
+
b.query,
|
|
1335
|
+
b.options,
|
|
1336
|
+
R,
|
|
1337
|
+
N,
|
|
1338
1338
|
a
|
|
1339
1339
|
);
|
|
1340
1340
|
}
|
|
@@ -1344,98 +1344,98 @@ function Xe({
|
|
|
1344
1344
|
query: a,
|
|
1345
1345
|
disabled: p,
|
|
1346
1346
|
options: m,
|
|
1347
|
-
persistent:
|
|
1347
|
+
persistent: b,
|
|
1348
1348
|
...j
|
|
1349
1349
|
}) {
|
|
1350
|
-
const
|
|
1350
|
+
const P = Ue(), U = h || P.dataProvider, R = U?.normalizeResource(s) ?? s, D = oe(
|
|
1351
1351
|
() => ({
|
|
1352
|
-
name:
|
|
1352
|
+
name: R,
|
|
1353
1353
|
query: a,
|
|
1354
1354
|
disabled: !!p,
|
|
1355
1355
|
options: m
|
|
1356
1356
|
}),
|
|
1357
|
-
[
|
|
1358
|
-
), [
|
|
1359
|
-
const
|
|
1357
|
+
[R, a, p, m]
|
|
1358
|
+
), [N, F] = qe(Je, void 0, () => {
|
|
1359
|
+
const q = re(), L = re();
|
|
1360
1360
|
return ye({
|
|
1361
|
-
dataProvider:
|
|
1362
|
-
requestDetails:
|
|
1363
|
-
request:
|
|
1361
|
+
dataProvider: U,
|
|
1362
|
+
requestDetails: D,
|
|
1363
|
+
request: q,
|
|
1364
1364
|
revision: L,
|
|
1365
|
-
isLoading: !
|
|
1365
|
+
isLoading: !D.disabled,
|
|
1366
1366
|
value: {
|
|
1367
|
-
name:
|
|
1368
|
-
query:
|
|
1369
|
-
options:
|
|
1370
|
-
request:
|
|
1367
|
+
name: D.name,
|
|
1368
|
+
query: D.query,
|
|
1369
|
+
options: D.options,
|
|
1370
|
+
request: q,
|
|
1371
1371
|
revision: L,
|
|
1372
|
-
data:
|
|
1373
|
-
|
|
1372
|
+
data: U?.createEmptyResponse(
|
|
1373
|
+
D
|
|
1374
1374
|
),
|
|
1375
1375
|
meta: {},
|
|
1376
1376
|
error: void 0,
|
|
1377
|
-
isDisabled: !!
|
|
1378
|
-
isIncomplete: !
|
|
1379
|
-
isInitial: !
|
|
1377
|
+
isDisabled: !!D.disabled,
|
|
1378
|
+
isIncomplete: !D.disabled,
|
|
1379
|
+
isInitial: !D.disabled
|
|
1380
1380
|
},
|
|
1381
|
-
persistent:
|
|
1381
|
+
persistent: b ?? !1
|
|
1382
1382
|
});
|
|
1383
1383
|
}), {
|
|
1384
|
-
dataProvider:
|
|
1385
|
-
requestDetails:
|
|
1386
|
-
request:
|
|
1387
|
-
revision:
|
|
1388
|
-
isLoading:
|
|
1389
|
-
value:
|
|
1390
|
-
persistent:
|
|
1391
|
-
requestInstruction:
|
|
1392
|
-
} =
|
|
1393
|
-
if (
|
|
1384
|
+
dataProvider: T,
|
|
1385
|
+
requestDetails: _,
|
|
1386
|
+
request: S,
|
|
1387
|
+
revision: c,
|
|
1388
|
+
isLoading: w,
|
|
1389
|
+
value: E,
|
|
1390
|
+
persistent: I,
|
|
1391
|
+
requestInstruction: v
|
|
1392
|
+
} = N;
|
|
1393
|
+
if (T == null)
|
|
1394
1394
|
throw new Error(
|
|
1395
1395
|
"Unmet requirement: The DataProvider for the useResource hook is missing - Check your ConfigContext provider and the dataProvider property"
|
|
1396
1396
|
);
|
|
1397
|
-
if (
|
|
1397
|
+
if (T !== U)
|
|
1398
1398
|
throw new Error(
|
|
1399
1399
|
"Constant violation: The DataProvider provided to the useResource hook must not be replaced - Check your ConfigContext provider and the dataProvider property"
|
|
1400
1400
|
);
|
|
1401
|
-
const [
|
|
1401
|
+
const [C, u] = Ce();
|
|
1402
1402
|
ce(() => {
|
|
1403
|
-
const
|
|
1404
|
-
return
|
|
1405
|
-
|
|
1403
|
+
const q = T.createInstance() ?? {};
|
|
1404
|
+
return u(q), () => {
|
|
1405
|
+
T.releaseInstance(q);
|
|
1406
1406
|
};
|
|
1407
|
-
}, [
|
|
1407
|
+
}, [T]), _ !== D && !T.compareRequests(D, _) ? F({
|
|
1408
1408
|
type: "next-request",
|
|
1409
|
-
requestDetails:
|
|
1410
|
-
persistent:
|
|
1411
|
-
}) :
|
|
1412
|
-
const
|
|
1413
|
-
async () => new Promise((
|
|
1414
|
-
|
|
1409
|
+
requestDetails: D,
|
|
1410
|
+
persistent: b ?? !1
|
|
1411
|
+
}) : I !== (b ?? !1) && F({ type: "set-persistence", persistent: b ?? !1 });
|
|
1412
|
+
const d = Le(
|
|
1413
|
+
async () => new Promise((q) => {
|
|
1414
|
+
F({ type: "next-revision", notify: q });
|
|
1415
1415
|
}),
|
|
1416
1416
|
[]
|
|
1417
1417
|
);
|
|
1418
|
-
ce(() =>
|
|
1419
|
-
if (
|
|
1418
|
+
ce(() => _.disabled ? void 0 : T.subscribe(_.name, d), [_.disabled, T, _.name, d]), ce(() => {
|
|
1419
|
+
if (C == null || v.requestDetails.disabled)
|
|
1420
1420
|
return;
|
|
1421
|
-
const
|
|
1421
|
+
const q = new Be();
|
|
1422
1422
|
return Ke(
|
|
1423
|
-
_,
|
|
1424
1423
|
v,
|
|
1425
|
-
|
|
1426
|
-
|
|
1424
|
+
C,
|
|
1425
|
+
q,
|
|
1426
|
+
F
|
|
1427
1427
|
), () => {
|
|
1428
|
-
|
|
1428
|
+
q.abort();
|
|
1429
1429
|
};
|
|
1430
|
-
}, [
|
|
1431
|
-
const
|
|
1432
|
-
() => ({ request:
|
|
1433
|
-
[
|
|
1434
|
-
),
|
|
1435
|
-
() => ({ ...
|
|
1436
|
-
[
|
|
1430
|
+
}, [C, v]);
|
|
1431
|
+
const r = c !== E.revision, i = r ? S : E.request, t = r ? c : E.revision, f = oe(
|
|
1432
|
+
() => ({ request: i, revision: t }),
|
|
1433
|
+
[i, t]
|
|
1434
|
+
), l = oe(
|
|
1435
|
+
() => ({ ...E, dataProvider: T, isLoading: w, isStale: r, next: f, notify: d }),
|
|
1436
|
+
[E, T, w, r, f, d]
|
|
1437
1437
|
);
|
|
1438
|
-
return
|
|
1438
|
+
return T.contextPlugins.reduce((q, L) => L(q, j), l);
|
|
1439
1439
|
}
|
|
1440
1440
|
function ut({
|
|
1441
1441
|
dataProvider: h,
|
|
@@ -1443,24 +1443,24 @@ function ut({
|
|
|
1443
1443
|
query: a,
|
|
1444
1444
|
disabled: p,
|
|
1445
1445
|
options: m,
|
|
1446
|
-
persistent:
|
|
1446
|
+
persistent: b,
|
|
1447
1447
|
children: j,
|
|
1448
|
-
...
|
|
1448
|
+
...P
|
|
1449
1449
|
}) {
|
|
1450
|
-
const
|
|
1450
|
+
const U = Xe({
|
|
1451
1451
|
dataProvider: h,
|
|
1452
1452
|
name: s,
|
|
1453
1453
|
query: a,
|
|
1454
1454
|
disabled: p,
|
|
1455
1455
|
options: m,
|
|
1456
|
-
persistent:
|
|
1457
|
-
...
|
|
1456
|
+
persistent: b,
|
|
1457
|
+
...P
|
|
1458
1458
|
});
|
|
1459
1459
|
return /* @__PURE__ */ se(
|
|
1460
1460
|
Ye,
|
|
1461
1461
|
{
|
|
1462
|
-
...
|
|
1463
|
-
resource:
|
|
1462
|
+
...P,
|
|
1463
|
+
resource: U,
|
|
1464
1464
|
children: j
|
|
1465
1465
|
}
|
|
1466
1466
|
);
|
|
@@ -1479,7 +1479,7 @@ export {
|
|
|
1479
1479
|
nt as compose,
|
|
1480
1480
|
st as createPlugin,
|
|
1481
1481
|
it as isDataProvider,
|
|
1482
|
-
|
|
1482
|
+
Ue as useConfigContext,
|
|
1483
1483
|
Xe as useResource,
|
|
1484
1484
|
rt as useResourceContext
|
|
1485
1485
|
};
|