document-model 1.1.0-experimental.2 → 1.1.0-experimental.3
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/browser/cjs/document-model.js +1 -1
- package/dist/browser/cjs/document.js +1 -1
- package/dist/browser/cjs/index.js +1 -1
- package/dist/{node/cjs/internal/index-CTavCc1t.js → browser/cjs/internal/index-DMRH7zDy.js} +1 -1
- package/dist/browser/cjs/internal/{index-DLodkpOq.js → index-dwAOfmBp.js} +1 -1
- package/dist/browser/cjs/internal/{object-CMr-_AP8.js → object-C-PazS9q.js} +4 -4
- package/dist/browser/es/document-model.js +2 -2
- package/dist/browser/es/document.js +2 -2
- package/dist/browser/es/index.js +3 -3
- package/dist/{node/es/internal/index-8lUz8qED.js → browser/es/internal/index-BVJxzkIs.js} +1 -1
- package/dist/browser/es/internal/{index-CL_1ivGq.js → index-DQztOVJu.js} +1 -1
- package/dist/browser/es/internal/{object-FFc9n_3I.js → object-iTBekDVP.js} +456 -445
- package/dist/node/cjs/document-model.js +1 -1
- package/dist/node/cjs/document.js +1 -1
- package/dist/node/cjs/index.js +1 -1
- package/dist/node/cjs/internal/{index-CPeTtUsk.js → index-BNFVmPew.js} +1 -1
- package/dist/{browser/cjs/internal/index-azT4DEce.js → node/cjs/internal/index-FvRO8SnG.js} +1 -1
- package/dist/node/cjs/internal/{object-DhI24-1e.js → object-Xvr4kDQj.js} +1 -1
- package/dist/node/es/document-model.js +2 -2
- package/dist/node/es/document.js +2 -2
- package/dist/node/es/index.js +3 -3
- package/dist/{browser/es/internal/index-BzNpRs2a.js → node/es/internal/index-BIrQOTP_.js} +1 -1
- package/dist/node/es/internal/{index-A880In4b.js → index-DOpbr_uw.js} +1 -1
- package/dist/node/es/internal/{object-C9n9Ijnt.js → object-C2s2eZ08.js} +26 -15
- package/package.json +1 -1
|
@@ -149,15 +149,15 @@ var Nt = { exports: {} };
|
|
|
149
149
|
if (w.length > 200)
|
|
150
150
|
return w.sort();
|
|
151
151
|
for (let E = 1; E < w.length; E++) {
|
|
152
|
-
const
|
|
152
|
+
const S = w[E];
|
|
153
153
|
let R = E;
|
|
154
|
-
for (; R !== 0 && w[R - 1] >
|
|
154
|
+
for (; R !== 0 && w[R - 1] > S; )
|
|
155
155
|
w[R] = w[R - 1], R--;
|
|
156
|
-
w[R] =
|
|
156
|
+
w[R] = S;
|
|
157
157
|
}
|
|
158
158
|
return w;
|
|
159
159
|
}
|
|
160
|
-
const
|
|
160
|
+
const a = Object.getOwnPropertyDescriptor(
|
|
161
161
|
Object.getPrototypeOf(
|
|
162
162
|
Object.getPrototypeOf(
|
|
163
163
|
new Int8Array()
|
|
@@ -166,13 +166,13 @@ var Nt = { exports: {} };
|
|
|
166
166
|
Symbol.toStringTag
|
|
167
167
|
).get;
|
|
168
168
|
function h(w) {
|
|
169
|
-
return
|
|
169
|
+
return a.call(w) !== void 0 && w.length !== 0;
|
|
170
170
|
}
|
|
171
|
-
function g(w, E,
|
|
172
|
-
w.length <
|
|
171
|
+
function g(w, E, S) {
|
|
172
|
+
w.length < S && (S = w.length);
|
|
173
173
|
const R = E === "," ? "" : " ";
|
|
174
174
|
let H = `"0":${R}${w[0]}`;
|
|
175
|
-
for (let W = 1; W <
|
|
175
|
+
for (let W = 1; W < S; W++)
|
|
176
176
|
H += `${E}"${W}":${R}${w[W]}`;
|
|
177
177
|
return H;
|
|
178
178
|
}
|
|
@@ -194,30 +194,30 @@ var Nt = { exports: {} };
|
|
|
194
194
|
return '"[Circular]"';
|
|
195
195
|
}
|
|
196
196
|
function b(w, E) {
|
|
197
|
-
let
|
|
198
|
-
if (o.call(w, E) && (
|
|
197
|
+
let S;
|
|
198
|
+
if (o.call(w, E) && (S = w[E], typeof S != "boolean"))
|
|
199
199
|
throw new TypeError(`The "${E}" argument must be of type boolean`);
|
|
200
|
-
return
|
|
200
|
+
return S === void 0 ? !0 : S;
|
|
201
201
|
}
|
|
202
202
|
function F(w, E) {
|
|
203
|
-
let
|
|
203
|
+
let S;
|
|
204
204
|
if (o.call(w, E)) {
|
|
205
|
-
if (
|
|
205
|
+
if (S = w[E], typeof S != "number")
|
|
206
206
|
throw new TypeError(`The "${E}" argument must be of type number`);
|
|
207
|
-
if (!Number.isInteger(
|
|
207
|
+
if (!Number.isInteger(S))
|
|
208
208
|
throw new TypeError(`The "${E}" argument must be an integer`);
|
|
209
|
-
if (
|
|
209
|
+
if (S < 1)
|
|
210
210
|
throw new RangeError(`The "${E}" argument must be >= 1`);
|
|
211
211
|
}
|
|
212
|
-
return
|
|
212
|
+
return S === void 0 ? 1 / 0 : S;
|
|
213
213
|
}
|
|
214
214
|
function j(w) {
|
|
215
215
|
return w === 1 ? "1 item" : `${w} items`;
|
|
216
216
|
}
|
|
217
217
|
function $(w) {
|
|
218
218
|
const E = /* @__PURE__ */ new Set();
|
|
219
|
-
for (const
|
|
220
|
-
(typeof
|
|
219
|
+
for (const S of w)
|
|
220
|
+
(typeof S == "string" || typeof S == "number") && E.add(String(S));
|
|
221
221
|
return E;
|
|
222
222
|
}
|
|
223
223
|
function q(w) {
|
|
@@ -226,9 +226,9 @@ var Nt = { exports: {} };
|
|
|
226
226
|
if (typeof E != "boolean")
|
|
227
227
|
throw new TypeError('The "strict" argument must be of type boolean');
|
|
228
228
|
if (E)
|
|
229
|
-
return (
|
|
230
|
-
let R = `Object can not safely be stringified. Received type ${typeof
|
|
231
|
-
throw typeof
|
|
229
|
+
return (S) => {
|
|
230
|
+
let R = `Object can not safely be stringified. Received type ${typeof S}`;
|
|
231
|
+
throw typeof S != "function" && (R += ` (${S.toString()})`), new Error(R);
|
|
232
232
|
};
|
|
233
233
|
}
|
|
234
234
|
}
|
|
@@ -236,8 +236,8 @@ var Nt = { exports: {} };
|
|
|
236
236
|
w = { ...w };
|
|
237
237
|
const E = q(w);
|
|
238
238
|
E && (w.bigint === void 0 && (w.bigint = !1), "circularValue" in w || (w.circularValue = Error));
|
|
239
|
-
const
|
|
240
|
-
function ut(X, m,
|
|
239
|
+
const S = y(w), R = b(w, "bigint"), H = b(w, "deterministic"), W = F(w, "maximumDepth"), M = F(w, "maximumBreadth");
|
|
240
|
+
function ut(X, m, v, T, O, C) {
|
|
241
241
|
let A = m[X];
|
|
242
242
|
switch (typeof A == "object" && A !== null && typeof A.toJSON == "function" && (A = A.toJSON(X)), A = T.call(m, X, A), typeof A) {
|
|
243
243
|
case "string":
|
|
@@ -245,45 +245,45 @@ var Nt = { exports: {} };
|
|
|
245
245
|
case "object": {
|
|
246
246
|
if (A === null)
|
|
247
247
|
return "null";
|
|
248
|
-
if (
|
|
249
|
-
return
|
|
248
|
+
if (v.indexOf(A) !== -1)
|
|
249
|
+
return S;
|
|
250
250
|
let k = "", B = ",";
|
|
251
251
|
const I = C;
|
|
252
252
|
if (Array.isArray(A)) {
|
|
253
253
|
if (A.length === 0)
|
|
254
254
|
return "[]";
|
|
255
|
-
if (W <
|
|
255
|
+
if (W < v.length + 1)
|
|
256
256
|
return '"[Array]"';
|
|
257
|
-
|
|
257
|
+
v.push(A), O !== "" && (C += O, k += `
|
|
258
258
|
${C}`, B = `,
|
|
259
259
|
${C}`);
|
|
260
260
|
const V = Math.min(A.length, M);
|
|
261
261
|
let Q = 0;
|
|
262
262
|
for (; Q < V - 1; Q++) {
|
|
263
|
-
const ct = ut(String(Q), A,
|
|
263
|
+
const ct = ut(String(Q), A, v, T, O, C);
|
|
264
264
|
k += ct !== void 0 ? ct : "null", k += B;
|
|
265
265
|
}
|
|
266
|
-
const tt = ut(String(Q), A,
|
|
266
|
+
const tt = ut(String(Q), A, v, T, O, C);
|
|
267
267
|
if (k += tt !== void 0 ? tt : "null", A.length - 1 > M) {
|
|
268
268
|
const ct = A.length - M - 1;
|
|
269
269
|
k += `${B}"... ${j(ct)} not stringified"`;
|
|
270
270
|
}
|
|
271
271
|
return O !== "" && (k += `
|
|
272
|
-
${I}`),
|
|
272
|
+
${I}`), v.pop(), `[${k}]`;
|
|
273
273
|
}
|
|
274
274
|
let L = Object.keys(A);
|
|
275
275
|
const J = L.length;
|
|
276
276
|
if (J === 0)
|
|
277
277
|
return "{}";
|
|
278
|
-
if (W <
|
|
278
|
+
if (W < v.length + 1)
|
|
279
279
|
return '"[Object]"';
|
|
280
280
|
let U = "", K = "";
|
|
281
281
|
O !== "" && (C += O, B = `,
|
|
282
282
|
${C}`, U = " ");
|
|
283
283
|
const Y = Math.min(J, M);
|
|
284
|
-
H && !h(A) && (L = c(L)),
|
|
284
|
+
H && !h(A) && (L = c(L)), v.push(A);
|
|
285
285
|
for (let V = 0; V < Y; V++) {
|
|
286
|
-
const Q = L[V], tt = ut(Q, A,
|
|
286
|
+
const Q = L[V], tt = ut(Q, A, v, T, O, C);
|
|
287
287
|
tt !== void 0 && (k += `${K}${f(Q)}:${U}${tt}`, K = B);
|
|
288
288
|
}
|
|
289
289
|
if (J > M) {
|
|
@@ -292,7 +292,7 @@ ${C}`, U = " ");
|
|
|
292
292
|
}
|
|
293
293
|
return O !== "" && K.length > 1 && (k = `
|
|
294
294
|
${C}${k}
|
|
295
|
-
${I}`),
|
|
295
|
+
${I}`), v.pop(), `{${k}}`;
|
|
296
296
|
}
|
|
297
297
|
case "number":
|
|
298
298
|
return isFinite(A) ? String(A) : E ? E(A) : "null";
|
|
@@ -307,51 +307,51 @@ ${I}`), S.pop(), `{${k}}`;
|
|
|
307
307
|
return E ? E(A) : void 0;
|
|
308
308
|
}
|
|
309
309
|
}
|
|
310
|
-
function ft(X, m,
|
|
310
|
+
function ft(X, m, v, T, O, C) {
|
|
311
311
|
switch (typeof m == "object" && m !== null && typeof m.toJSON == "function" && (m = m.toJSON(X)), typeof m) {
|
|
312
312
|
case "string":
|
|
313
313
|
return f(m);
|
|
314
314
|
case "object": {
|
|
315
315
|
if (m === null)
|
|
316
316
|
return "null";
|
|
317
|
-
if (
|
|
318
|
-
return
|
|
317
|
+
if (v.indexOf(m) !== -1)
|
|
318
|
+
return S;
|
|
319
319
|
const A = C;
|
|
320
320
|
let k = "", B = ",";
|
|
321
321
|
if (Array.isArray(m)) {
|
|
322
322
|
if (m.length === 0)
|
|
323
323
|
return "[]";
|
|
324
|
-
if (W <
|
|
324
|
+
if (W < v.length + 1)
|
|
325
325
|
return '"[Array]"';
|
|
326
|
-
|
|
326
|
+
v.push(m), O !== "" && (C += O, k += `
|
|
327
327
|
${C}`, B = `,
|
|
328
328
|
${C}`);
|
|
329
329
|
const J = Math.min(m.length, M);
|
|
330
330
|
let U = 0;
|
|
331
331
|
for (; U < J - 1; U++) {
|
|
332
|
-
const Y = ft(String(U), m[U],
|
|
332
|
+
const Y = ft(String(U), m[U], v, T, O, C);
|
|
333
333
|
k += Y !== void 0 ? Y : "null", k += B;
|
|
334
334
|
}
|
|
335
|
-
const K = ft(String(U), m[U],
|
|
335
|
+
const K = ft(String(U), m[U], v, T, O, C);
|
|
336
336
|
if (k += K !== void 0 ? K : "null", m.length - 1 > M) {
|
|
337
337
|
const Y = m.length - M - 1;
|
|
338
338
|
k += `${B}"... ${j(Y)} not stringified"`;
|
|
339
339
|
}
|
|
340
340
|
return O !== "" && (k += `
|
|
341
|
-
${A}`),
|
|
341
|
+
${A}`), v.pop(), `[${k}]`;
|
|
342
342
|
}
|
|
343
|
-
|
|
343
|
+
v.push(m);
|
|
344
344
|
let I = "";
|
|
345
345
|
O !== "" && (C += O, B = `,
|
|
346
346
|
${C}`, I = " ");
|
|
347
347
|
let L = "";
|
|
348
348
|
for (const J of T) {
|
|
349
|
-
const U = ft(J, m[J],
|
|
349
|
+
const U = ft(J, m[J], v, T, O, C);
|
|
350
350
|
U !== void 0 && (k += `${L}${f(J)}:${I}${U}`, L = B);
|
|
351
351
|
}
|
|
352
352
|
return O !== "" && L.length > 1 && (k = `
|
|
353
353
|
${C}${k}
|
|
354
|
-
${A}`),
|
|
354
|
+
${A}`), v.pop(), `{${k}}`;
|
|
355
355
|
}
|
|
356
356
|
case "number":
|
|
357
357
|
return isFinite(m) ? String(m) : E ? E(m) : "null";
|
|
@@ -366,7 +366,7 @@ ${A}`), S.pop(), `{${k}}`;
|
|
|
366
366
|
return E ? E(m) : void 0;
|
|
367
367
|
}
|
|
368
368
|
}
|
|
369
|
-
function st(X, m,
|
|
369
|
+
function st(X, m, v, T, O) {
|
|
370
370
|
switch (typeof m) {
|
|
371
371
|
case "string":
|
|
372
372
|
return f(m);
|
|
@@ -375,49 +375,49 @@ ${A}`), S.pop(), `{${k}}`;
|
|
|
375
375
|
return "null";
|
|
376
376
|
if (typeof m.toJSON == "function") {
|
|
377
377
|
if (m = m.toJSON(X), typeof m != "object")
|
|
378
|
-
return st(X, m,
|
|
378
|
+
return st(X, m, v, T, O);
|
|
379
379
|
if (m === null)
|
|
380
380
|
return "null";
|
|
381
381
|
}
|
|
382
|
-
if (
|
|
383
|
-
return
|
|
382
|
+
if (v.indexOf(m) !== -1)
|
|
383
|
+
return S;
|
|
384
384
|
const C = O;
|
|
385
385
|
if (Array.isArray(m)) {
|
|
386
386
|
if (m.length === 0)
|
|
387
387
|
return "[]";
|
|
388
|
-
if (W <
|
|
388
|
+
if (W < v.length + 1)
|
|
389
389
|
return '"[Array]"';
|
|
390
|
-
|
|
390
|
+
v.push(m), O += T;
|
|
391
391
|
let U = `
|
|
392
392
|
${O}`;
|
|
393
393
|
const K = `,
|
|
394
394
|
${O}`, Y = Math.min(m.length, M);
|
|
395
395
|
let V = 0;
|
|
396
396
|
for (; V < Y - 1; V++) {
|
|
397
|
-
const tt = st(String(V), m[V],
|
|
397
|
+
const tt = st(String(V), m[V], v, T, O);
|
|
398
398
|
U += tt !== void 0 ? tt : "null", U += K;
|
|
399
399
|
}
|
|
400
|
-
const Q = st(String(V), m[V],
|
|
400
|
+
const Q = st(String(V), m[V], v, T, O);
|
|
401
401
|
if (U += Q !== void 0 ? Q : "null", m.length - 1 > M) {
|
|
402
402
|
const tt = m.length - M - 1;
|
|
403
403
|
U += `${K}"... ${j(tt)} not stringified"`;
|
|
404
404
|
}
|
|
405
405
|
return U += `
|
|
406
|
-
${C}`,
|
|
406
|
+
${C}`, v.pop(), `[${U}]`;
|
|
407
407
|
}
|
|
408
408
|
let A = Object.keys(m);
|
|
409
409
|
const k = A.length;
|
|
410
410
|
if (k === 0)
|
|
411
411
|
return "{}";
|
|
412
|
-
if (W <
|
|
412
|
+
if (W < v.length + 1)
|
|
413
413
|
return '"[Object]"';
|
|
414
414
|
O += T;
|
|
415
415
|
const B = `,
|
|
416
416
|
${O}`;
|
|
417
417
|
let I = "", L = "", J = Math.min(k, M);
|
|
418
|
-
h(m) && (I += g(m, B, M), A = A.slice(m.length), J -= m.length, L = B), H && (A = c(A)),
|
|
418
|
+
h(m) && (I += g(m, B, M), A = A.slice(m.length), J -= m.length, L = B), H && (A = c(A)), v.push(m);
|
|
419
419
|
for (let U = 0; U < J; U++) {
|
|
420
|
-
const K = A[U], Y = st(K, m[K],
|
|
420
|
+
const K = A[U], Y = st(K, m[K], v, T, O);
|
|
421
421
|
Y !== void 0 && (I += `${L}${f(K)}: ${Y}`, L = B);
|
|
422
422
|
}
|
|
423
423
|
if (k > M) {
|
|
@@ -426,7 +426,7 @@ ${O}`;
|
|
|
426
426
|
}
|
|
427
427
|
return L !== "" && (I = `
|
|
428
428
|
${O}${I}
|
|
429
|
-
${C}`),
|
|
429
|
+
${C}`), v.pop(), `{${I}}`;
|
|
430
430
|
}
|
|
431
431
|
case "number":
|
|
432
432
|
return isFinite(m) ? String(m) : E ? E(m) : "null";
|
|
@@ -441,7 +441,7 @@ ${C}`), S.pop(), `{${I}}`;
|
|
|
441
441
|
return E ? E(m) : void 0;
|
|
442
442
|
}
|
|
443
443
|
}
|
|
444
|
-
function pt(X, m,
|
|
444
|
+
function pt(X, m, v) {
|
|
445
445
|
switch (typeof m) {
|
|
446
446
|
case "string":
|
|
447
447
|
return f(m);
|
|
@@ -450,49 +450,49 @@ ${C}`), S.pop(), `{${I}}`;
|
|
|
450
450
|
return "null";
|
|
451
451
|
if (typeof m.toJSON == "function") {
|
|
452
452
|
if (m = m.toJSON(X), typeof m != "object")
|
|
453
|
-
return pt(X, m,
|
|
453
|
+
return pt(X, m, v);
|
|
454
454
|
if (m === null)
|
|
455
455
|
return "null";
|
|
456
456
|
}
|
|
457
|
-
if (
|
|
458
|
-
return
|
|
457
|
+
if (v.indexOf(m) !== -1)
|
|
458
|
+
return S;
|
|
459
459
|
let T = "";
|
|
460
460
|
if (Array.isArray(m)) {
|
|
461
461
|
if (m.length === 0)
|
|
462
462
|
return "[]";
|
|
463
|
-
if (W <
|
|
463
|
+
if (W < v.length + 1)
|
|
464
464
|
return '"[Array]"';
|
|
465
|
-
|
|
465
|
+
v.push(m);
|
|
466
466
|
const B = Math.min(m.length, M);
|
|
467
467
|
let I = 0;
|
|
468
468
|
for (; I < B - 1; I++) {
|
|
469
|
-
const J = pt(String(I), m[I],
|
|
469
|
+
const J = pt(String(I), m[I], v);
|
|
470
470
|
T += J !== void 0 ? J : "null", T += ",";
|
|
471
471
|
}
|
|
472
|
-
const L = pt(String(I), m[I],
|
|
472
|
+
const L = pt(String(I), m[I], v);
|
|
473
473
|
if (T += L !== void 0 ? L : "null", m.length - 1 > M) {
|
|
474
474
|
const J = m.length - M - 1;
|
|
475
475
|
T += `,"... ${j(J)} not stringified"`;
|
|
476
476
|
}
|
|
477
|
-
return
|
|
477
|
+
return v.pop(), `[${T}]`;
|
|
478
478
|
}
|
|
479
479
|
let O = Object.keys(m);
|
|
480
480
|
const C = O.length;
|
|
481
481
|
if (C === 0)
|
|
482
482
|
return "{}";
|
|
483
|
-
if (W <
|
|
483
|
+
if (W < v.length + 1)
|
|
484
484
|
return '"[Object]"';
|
|
485
485
|
let A = "", k = Math.min(C, M);
|
|
486
|
-
h(m) && (T += g(m, ",", M), O = O.slice(m.length), k -= m.length, A = ","), H && (O = c(O)),
|
|
486
|
+
h(m) && (T += g(m, ",", M), O = O.slice(m.length), k -= m.length, A = ","), H && (O = c(O)), v.push(m);
|
|
487
487
|
for (let B = 0; B < k; B++) {
|
|
488
|
-
const I = O[B], L = pt(I, m[I],
|
|
488
|
+
const I = O[B], L = pt(I, m[I], v);
|
|
489
489
|
L !== void 0 && (T += `${A}${f(I)}:${L}`, A = ",");
|
|
490
490
|
}
|
|
491
491
|
if (C > M) {
|
|
492
492
|
const B = C - M;
|
|
493
493
|
T += `${A}"...":"${j(B)} not stringified"`;
|
|
494
494
|
}
|
|
495
|
-
return
|
|
495
|
+
return v.pop(), `{${T}}`;
|
|
496
496
|
}
|
|
497
497
|
case "number":
|
|
498
498
|
return isFinite(m) ? String(m) : E ? E(m) : "null";
|
|
@@ -507,10 +507,10 @@ ${C}`), S.pop(), `{${I}}`;
|
|
|
507
507
|
return E ? E(m) : void 0;
|
|
508
508
|
}
|
|
509
509
|
}
|
|
510
|
-
function Dt(X, m,
|
|
510
|
+
function Dt(X, m, v) {
|
|
511
511
|
if (arguments.length > 1) {
|
|
512
512
|
let T = "";
|
|
513
|
-
if (typeof
|
|
513
|
+
if (typeof v == "number" ? T = " ".repeat(Math.min(v, 10)) : typeof v == "string" && (T = v.slice(0, 10)), m != null) {
|
|
514
514
|
if (typeof m == "function")
|
|
515
515
|
return ut("", { "": X }, [], m, T, "");
|
|
516
516
|
if (Array.isArray(m))
|
|
@@ -549,18 +549,18 @@ function ni(i, r, o) {
|
|
|
549
549
|
throw new Error(
|
|
550
550
|
"Cannot undo: skip value from reducer cannot be used with UNDO action"
|
|
551
551
|
);
|
|
552
|
-
const
|
|
552
|
+
const a = c.document.operations[p].at(-1), h = a && a.type === "NOOP" && a.skip > 0;
|
|
553
553
|
if (c.skip += u, h) {
|
|
554
|
-
c.skip +=
|
|
554
|
+
c.skip += a.skip;
|
|
555
555
|
const F = c.document.operations[p][c.document.operations[p].length - 2];
|
|
556
|
-
F &&
|
|
556
|
+
F && a.index - F.index === 1 && c.document.operations[p].pop();
|
|
557
557
|
}
|
|
558
558
|
if (c.document.operations[p].length < c.skip)
|
|
559
559
|
throw new Error(
|
|
560
560
|
"Cannot undo: you can't undo more operations than the ones in the scope history"
|
|
561
561
|
);
|
|
562
562
|
const g = c.document.operations[p].length - 1;
|
|
563
|
-
let y = u, b = h ? g -
|
|
563
|
+
let y = u, b = h ? g - a.skip : g;
|
|
564
564
|
for (; y > 0 && b >= 0; ) {
|
|
565
565
|
const F = c.document.operations[p][b];
|
|
566
566
|
if (!F) {
|
|
@@ -591,14 +591,14 @@ function oi(i, r, o) {
|
|
|
591
591
|
throw new Error("Invalid REDO action: invalid redo input value");
|
|
592
592
|
if (c.document.clipboard.length < 1)
|
|
593
593
|
throw new Error("Cannot redo: no operations in the clipboard");
|
|
594
|
-
const
|
|
594
|
+
const a = c.document.clipboard.findLastIndex(
|
|
595
595
|
(g) => g.scope === p
|
|
596
596
|
);
|
|
597
|
-
if (
|
|
597
|
+
if (a < 0)
|
|
598
598
|
throw new Error(
|
|
599
599
|
`Cannot redo: no operations in clipboard for scope "${p}"`
|
|
600
600
|
);
|
|
601
|
-
const h = c.document.clipboard.splice(
|
|
601
|
+
const h = c.document.clipboard.splice(a, 1)[0];
|
|
602
602
|
c.action = Bt({
|
|
603
603
|
type: h.type,
|
|
604
604
|
scope: h.scope,
|
|
@@ -612,11 +612,11 @@ function ai(i, r, o) {
|
|
|
612
612
|
input: { start: f, end: c }
|
|
613
613
|
} = r;
|
|
614
614
|
f = f || 0, c = c || u.length;
|
|
615
|
-
const
|
|
615
|
+
const a = u.slice(f, c), h = u.slice(0, f), g = u.slice(c), y = Pt(
|
|
616
616
|
i.initialState,
|
|
617
617
|
{
|
|
618
618
|
...i.operations,
|
|
619
|
-
[p]: h.concat(
|
|
619
|
+
[p]: h.concat(a)
|
|
620
620
|
},
|
|
621
621
|
o
|
|
622
622
|
), { name: b, state: F } = y, j = h.length, $ = h.length ? h[h.length - 1].timestamp : g.length ? g[0].timestamp : (/* @__PURE__ */ new Date()).toISOString();
|
|
@@ -629,7 +629,7 @@ function ai(i, r, o) {
|
|
|
629
629
|
{
|
|
630
630
|
...te(
|
|
631
631
|
{ name: b, state: F },
|
|
632
|
-
|
|
632
|
+
a.length
|
|
633
633
|
),
|
|
634
634
|
timestamp: $,
|
|
635
635
|
index: j,
|
|
@@ -668,17 +668,17 @@ class ci {
|
|
|
668
668
|
}
|
|
669
669
|
define(r, o = !1) {
|
|
670
670
|
for (let [p, u] of Object.entries(r)) {
|
|
671
|
-
p = p.toLowerCase(), u = u.map((
|
|
671
|
+
p = p.toLowerCase(), u = u.map((a) => a.toLowerCase()), et(this, lt, "f").has(p) || et(this, lt, "f").set(p, /* @__PURE__ */ new Set());
|
|
672
672
|
const f = et(this, lt, "f").get(p);
|
|
673
673
|
let c = !0;
|
|
674
|
-
for (let
|
|
675
|
-
const h =
|
|
676
|
-
if (
|
|
674
|
+
for (let a of u) {
|
|
675
|
+
const h = a.startsWith("*");
|
|
676
|
+
if (a = h ? a.slice(1) : a, f == null || f.add(a), c && et(this, gt, "f").set(p, a), c = !1, h)
|
|
677
677
|
continue;
|
|
678
|
-
const g = et(this, mt, "f").get(
|
|
678
|
+
const g = et(this, mt, "f").get(a);
|
|
679
679
|
if (g && g != p && !o)
|
|
680
|
-
throw new Error(`"${p} -> ${
|
|
681
|
-
et(this, mt, "f").set(
|
|
680
|
+
throw new Error(`"${p} -> ${a}" conflicts with "${g} -> ${a}". Pass \`force=true\` to override this definition.`);
|
|
681
|
+
et(this, mt, "f").set(a, p);
|
|
682
682
|
}
|
|
683
683
|
}
|
|
684
684
|
return this;
|
|
@@ -731,7 +731,7 @@ typeof Object.create == "function" ? Mt.exports = function(r, o) {
|
|
|
731
731
|
p.prototype = o.prototype, r.prototype = new p(), r.prototype.constructor = r;
|
|
732
732
|
}
|
|
733
733
|
};
|
|
734
|
-
var
|
|
734
|
+
var Se = Mt.exports, Rt = { exports: {} }, ve = {}, jt = {};
|
|
735
735
|
jt.byteLength = hi;
|
|
736
736
|
jt.toByteArray = xi;
|
|
737
737
|
jt.fromByteArray = yi;
|
|
@@ -757,8 +757,8 @@ function mi(i, r, o) {
|
|
|
757
757
|
return (r + o) * 3 / 4 - o;
|
|
758
758
|
}
|
|
759
759
|
function xi(i) {
|
|
760
|
-
var r, o = _e(i), p = o[0], u = o[1], f = new ui(mi(i, p, u)), c = 0,
|
|
761
|
-
for (h = 0; h <
|
|
760
|
+
var r, o = _e(i), p = o[0], u = o[1], f = new ui(mi(i, p, u)), c = 0, a = u > 0 ? p - 4 : p, h;
|
|
761
|
+
for (h = 0; h < a; h += 4)
|
|
762
762
|
r = it[i.charCodeAt(h)] << 18 | it[i.charCodeAt(h + 1)] << 12 | it[i.charCodeAt(h + 2)] << 6 | it[i.charCodeAt(h + 3)], f[c++] = r >> 16 & 255, f[c++] = r >> 8 & 255, f[c++] = r & 255;
|
|
763
763
|
return u === 2 && (r = it[i.charCodeAt(h)] << 2 | it[i.charCodeAt(h + 1)] >> 4, f[c++] = r & 255), u === 1 && (r = it[i.charCodeAt(h)] << 10 | it[i.charCodeAt(h + 1)] << 4 | it[i.charCodeAt(h + 2)] >> 2, f[c++] = r >> 8 & 255, f[c++] = r & 255), f;
|
|
764
764
|
}
|
|
@@ -771,8 +771,8 @@ function gi(i, r, o) {
|
|
|
771
771
|
return u.join("");
|
|
772
772
|
}
|
|
773
773
|
function yi(i) {
|
|
774
|
-
for (var r, o = i.length, p = o % 3, u = [], f = 16383, c = 0,
|
|
775
|
-
u.push(gi(i, c, c + f >
|
|
774
|
+
for (var r, o = i.length, p = o % 3, u = [], f = 16383, c = 0, a = o - p; c < a; c += f)
|
|
775
|
+
u.push(gi(i, c, c + f > a ? a : c + f));
|
|
776
776
|
return p === 1 ? (r = i[o - 1], u.push(
|
|
777
777
|
nt[r >> 2] + nt[r << 4 & 63] + "=="
|
|
778
778
|
)) : p === 2 && (r = (i[o - 2] << 8) + i[o - 1], u.push(
|
|
@@ -782,8 +782,8 @@ function yi(i) {
|
|
|
782
782
|
var Vt = {};
|
|
783
783
|
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
|
|
784
784
|
Vt.read = function(i, r, o, p, u) {
|
|
785
|
-
var f, c,
|
|
786
|
-
for (b += F, f = j & (1 << -y) - 1, j >>= -y, y +=
|
|
785
|
+
var f, c, a = u * 8 - p - 1, h = (1 << a) - 1, g = h >> 1, y = -7, b = o ? u - 1 : 0, F = o ? -1 : 1, j = i[r + b];
|
|
786
|
+
for (b += F, f = j & (1 << -y) - 1, j >>= -y, y += a; y > 0; f = f * 256 + i[r + b], b += F, y -= 8)
|
|
787
787
|
;
|
|
788
788
|
for (c = f & (1 << -y) - 1, f >>= -y, y += p; y > 0; c = c * 256 + i[r + b], b += F, y -= 8)
|
|
789
789
|
;
|
|
@@ -797,10 +797,10 @@ Vt.read = function(i, r, o, p, u) {
|
|
|
797
797
|
return (j ? -1 : 1) * c * Math.pow(2, f - p);
|
|
798
798
|
};
|
|
799
799
|
Vt.write = function(i, r, o, p, u, f) {
|
|
800
|
-
var c,
|
|
801
|
-
for (r = Math.abs(r), isNaN(r) || r === 1 / 0 ? (
|
|
800
|
+
var c, a, h, g = f * 8 - u - 1, y = (1 << g) - 1, b = y >> 1, F = u === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, j = p ? 0 : f - 1, $ = p ? 1 : -1, q = r < 0 || r === 0 && 1 / r < 0 ? 1 : 0;
|
|
801
|
+
for (r = Math.abs(r), isNaN(r) || r === 1 / 0 ? (a = isNaN(r) ? 1 : 0, c = y) : (c = Math.floor(Math.log(r) / Math.LN2), r * (h = Math.pow(2, -c)) < 1 && (c--, h *= 2), c + b >= 1 ? r += F / h : r += F * Math.pow(2, 1 - b), r * h >= 2 && (c++, h /= 2), c + b >= y ? (a = 0, c = y) : c + b >= 1 ? (a = (r * h - 1) * Math.pow(2, u), c = c + b) : (a = r * Math.pow(2, b - 1) * Math.pow(2, u), c = 0)); u >= 8; i[o + j] = a & 255, j += $, a /= 256, u -= 8)
|
|
802
802
|
;
|
|
803
|
-
for (c = c << u |
|
|
803
|
+
for (c = c << u | a, g += u; g > 0; i[o + j] = c & 255, j += $, c /= 256, g -= 8)
|
|
804
804
|
;
|
|
805
805
|
i[o + j - $] |= q * 128;
|
|
806
806
|
};
|
|
@@ -812,9 +812,9 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
812
812
|
*/
|
|
813
813
|
(function(i) {
|
|
814
814
|
var r = jt, o = Vt, p = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
|
|
815
|
-
i.Buffer =
|
|
815
|
+
i.Buffer = a, i.SlowBuffer = E, i.INSPECT_MAX_BYTES = 50;
|
|
816
816
|
var u = 2147483647;
|
|
817
|
-
i.kMaxLength = u,
|
|
817
|
+
i.kMaxLength = u, a.TYPED_ARRAY_SUPPORT = f(), !a.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
|
|
818
818
|
"This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
|
|
819
819
|
);
|
|
820
820
|
function f() {
|
|
@@ -827,16 +827,16 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
827
827
|
return !1;
|
|
828
828
|
}
|
|
829
829
|
}
|
|
830
|
-
Object.defineProperty(
|
|
830
|
+
Object.defineProperty(a.prototype, "parent", {
|
|
831
831
|
enumerable: !0,
|
|
832
832
|
get: function() {
|
|
833
|
-
if (
|
|
833
|
+
if (a.isBuffer(this))
|
|
834
834
|
return this.buffer;
|
|
835
835
|
}
|
|
836
|
-
}), Object.defineProperty(
|
|
836
|
+
}), Object.defineProperty(a.prototype, "offset", {
|
|
837
837
|
enumerable: !0,
|
|
838
838
|
get: function() {
|
|
839
|
-
if (
|
|
839
|
+
if (a.isBuffer(this))
|
|
840
840
|
return this.byteOffset;
|
|
841
841
|
}
|
|
842
842
|
});
|
|
@@ -844,9 +844,9 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
844
844
|
if (n > u)
|
|
845
845
|
throw new RangeError('The value "' + n + '" is invalid for option "size"');
|
|
846
846
|
var t = new Uint8Array(n);
|
|
847
|
-
return Object.setPrototypeOf(t,
|
|
847
|
+
return Object.setPrototypeOf(t, a.prototype), t;
|
|
848
848
|
}
|
|
849
|
-
function
|
|
849
|
+
function a(n, t, e) {
|
|
850
850
|
if (typeof n == "number") {
|
|
851
851
|
if (typeof t == "string")
|
|
852
852
|
throw new TypeError(
|
|
@@ -856,7 +856,7 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
856
856
|
}
|
|
857
857
|
return h(n, t, e);
|
|
858
858
|
}
|
|
859
|
-
|
|
859
|
+
a.poolSize = 8192;
|
|
860
860
|
function h(n, t, e) {
|
|
861
861
|
if (typeof n == "string")
|
|
862
862
|
return F(n, t);
|
|
@@ -872,14 +872,14 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
872
872
|
throw new TypeError(
|
|
873
873
|
'The "value" argument must not be of type number. Received type number'
|
|
874
874
|
);
|
|
875
|
-
var
|
|
876
|
-
if (
|
|
877
|
-
return
|
|
875
|
+
var s = n.valueOf && n.valueOf();
|
|
876
|
+
if (s != null && s !== n)
|
|
877
|
+
return a.from(s, t, e);
|
|
878
878
|
var l = Z(n);
|
|
879
879
|
if (l)
|
|
880
880
|
return l;
|
|
881
881
|
if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof n[Symbol.toPrimitive] == "function")
|
|
882
|
-
return
|
|
882
|
+
return a.from(
|
|
883
883
|
n[Symbol.toPrimitive]("string"),
|
|
884
884
|
t,
|
|
885
885
|
e
|
|
@@ -888,9 +888,9 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
888
888
|
"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof n
|
|
889
889
|
);
|
|
890
890
|
}
|
|
891
|
-
|
|
891
|
+
a.from = function(n, t, e) {
|
|
892
892
|
return h(n, t, e);
|
|
893
|
-
}, Object.setPrototypeOf(
|
|
893
|
+
}, Object.setPrototypeOf(a.prototype, Uint8Array.prototype), Object.setPrototypeOf(a, Uint8Array);
|
|
894
894
|
function g(n) {
|
|
895
895
|
if (typeof n != "number")
|
|
896
896
|
throw new TypeError('"size" argument must be of type number');
|
|
@@ -900,26 +900,26 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
900
900
|
function y(n, t, e) {
|
|
901
901
|
return g(n), n <= 0 ? c(n) : t !== void 0 ? typeof e == "string" ? c(n).fill(t, e) : c(n).fill(t) : c(n);
|
|
902
902
|
}
|
|
903
|
-
|
|
903
|
+
a.alloc = function(n, t, e) {
|
|
904
904
|
return y(n, t, e);
|
|
905
905
|
};
|
|
906
906
|
function b(n) {
|
|
907
907
|
return g(n), c(n < 0 ? 0 : w(n) | 0);
|
|
908
908
|
}
|
|
909
|
-
|
|
909
|
+
a.allocUnsafe = function(n) {
|
|
910
910
|
return b(n);
|
|
911
|
-
},
|
|
911
|
+
}, a.allocUnsafeSlow = function(n) {
|
|
912
912
|
return b(n);
|
|
913
913
|
};
|
|
914
914
|
function F(n, t) {
|
|
915
|
-
if ((typeof t != "string" || t === "") && (t = "utf8"), !
|
|
915
|
+
if ((typeof t != "string" || t === "") && (t = "utf8"), !a.isEncoding(t))
|
|
916
916
|
throw new TypeError("Unknown encoding: " + t);
|
|
917
|
-
var e =
|
|
918
|
-
return l !== e && (
|
|
917
|
+
var e = S(n, t) | 0, s = c(e), l = s.write(n, t);
|
|
918
|
+
return l !== e && (s = s.slice(0, l)), s;
|
|
919
919
|
}
|
|
920
920
|
function j(n) {
|
|
921
|
-
for (var t = n.length < 0 ? 0 : w(n.length) | 0, e = c(t),
|
|
922
|
-
e[
|
|
921
|
+
for (var t = n.length < 0 ? 0 : w(n.length) | 0, e = c(t), s = 0; s < t; s += 1)
|
|
922
|
+
e[s] = n[s] & 255;
|
|
923
923
|
return e;
|
|
924
924
|
}
|
|
925
925
|
function $(n) {
|
|
@@ -934,11 +934,11 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
934
934
|
throw new RangeError('"offset" is outside of buffer bounds');
|
|
935
935
|
if (n.byteLength < t + (e || 0))
|
|
936
936
|
throw new RangeError('"length" is outside of buffer bounds');
|
|
937
|
-
var
|
|
938
|
-
return t === void 0 && e === void 0 ?
|
|
937
|
+
var s;
|
|
938
|
+
return t === void 0 && e === void 0 ? s = new Uint8Array(n) : e === void 0 ? s = new Uint8Array(n, t) : s = new Uint8Array(n, t, e), Object.setPrototypeOf(s, a.prototype), s;
|
|
939
939
|
}
|
|
940
940
|
function Z(n) {
|
|
941
|
-
if (
|
|
941
|
+
if (a.isBuffer(n)) {
|
|
942
942
|
var t = w(n.length) | 0, e = c(t);
|
|
943
943
|
return e.length === 0 || n.copy(e, 0, 0, t), e;
|
|
944
944
|
}
|
|
@@ -953,24 +953,24 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
953
953
|
return n | 0;
|
|
954
954
|
}
|
|
955
955
|
function E(n) {
|
|
956
|
-
return +n != n && (n = 0),
|
|
956
|
+
return +n != n && (n = 0), a.alloc(+n);
|
|
957
957
|
}
|
|
958
|
-
|
|
959
|
-
return t != null && t._isBuffer === !0 && t !==
|
|
960
|
-
},
|
|
961
|
-
if (rt(t, Uint8Array) && (t =
|
|
958
|
+
a.isBuffer = function(t) {
|
|
959
|
+
return t != null && t._isBuffer === !0 && t !== a.prototype;
|
|
960
|
+
}, a.compare = function(t, e) {
|
|
961
|
+
if (rt(t, Uint8Array) && (t = a.from(t, t.offset, t.byteLength)), rt(e, Uint8Array) && (e = a.from(e, e.offset, e.byteLength)), !a.isBuffer(t) || !a.isBuffer(e))
|
|
962
962
|
throw new TypeError(
|
|
963
963
|
'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
|
|
964
964
|
);
|
|
965
965
|
if (t === e)
|
|
966
966
|
return 0;
|
|
967
|
-
for (var
|
|
967
|
+
for (var s = t.length, l = e.length, x = 0, d = Math.min(s, l); x < d; ++x)
|
|
968
968
|
if (t[x] !== e[x]) {
|
|
969
|
-
|
|
969
|
+
s = t[x], l = e[x];
|
|
970
970
|
break;
|
|
971
971
|
}
|
|
972
|
-
return
|
|
973
|
-
},
|
|
972
|
+
return s < l ? -1 : l < s ? 1 : 0;
|
|
973
|
+
}, a.isEncoding = function(t) {
|
|
974
974
|
switch (String(t).toLowerCase()) {
|
|
975
975
|
case "hex":
|
|
976
976
|
case "utf8":
|
|
@@ -987,25 +987,25 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
987
987
|
default:
|
|
988
988
|
return !1;
|
|
989
989
|
}
|
|
990
|
-
},
|
|
990
|
+
}, a.concat = function(t, e) {
|
|
991
991
|
if (!Array.isArray(t))
|
|
992
992
|
throw new TypeError('"list" argument must be an Array of Buffers');
|
|
993
993
|
if (t.length === 0)
|
|
994
|
-
return
|
|
995
|
-
var
|
|
994
|
+
return a.alloc(0);
|
|
995
|
+
var s;
|
|
996
996
|
if (e === void 0)
|
|
997
|
-
for (e = 0,
|
|
998
|
-
e += t[
|
|
999
|
-
var l =
|
|
1000
|
-
for (
|
|
1001
|
-
var d = t[
|
|
997
|
+
for (e = 0, s = 0; s < t.length; ++s)
|
|
998
|
+
e += t[s].length;
|
|
999
|
+
var l = a.allocUnsafe(e), x = 0;
|
|
1000
|
+
for (s = 0; s < t.length; ++s) {
|
|
1001
|
+
var d = t[s];
|
|
1002
1002
|
if (rt(d, Uint8Array))
|
|
1003
|
-
x + d.length > l.length ?
|
|
1003
|
+
x + d.length > l.length ? a.from(d).copy(l, x) : Uint8Array.prototype.set.call(
|
|
1004
1004
|
l,
|
|
1005
1005
|
d,
|
|
1006
1006
|
x
|
|
1007
1007
|
);
|
|
1008
|
-
else if (
|
|
1008
|
+
else if (a.isBuffer(d))
|
|
1009
1009
|
d.copy(l, x);
|
|
1010
1010
|
else
|
|
1011
1011
|
throw new TypeError('"list" argument must be an Array of Buffers');
|
|
@@ -1013,8 +1013,8 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1013
1013
|
}
|
|
1014
1014
|
return l;
|
|
1015
1015
|
};
|
|
1016
|
-
function
|
|
1017
|
-
if (
|
|
1016
|
+
function S(n, t) {
|
|
1017
|
+
if (a.isBuffer(n))
|
|
1018
1018
|
return n.length;
|
|
1019
1019
|
if (ArrayBuffer.isView(n) || rt(n, ArrayBuffer))
|
|
1020
1020
|
return n.byteLength;
|
|
@@ -1022,8 +1022,8 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1022
1022
|
throw new TypeError(
|
|
1023
1023
|
'The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type ' + typeof n
|
|
1024
1024
|
);
|
|
1025
|
-
var e = n.length,
|
|
1026
|
-
if (!
|
|
1025
|
+
var e = n.length, s = arguments.length > 2 && arguments[2] === !0;
|
|
1026
|
+
if (!s && e === 0)
|
|
1027
1027
|
return 0;
|
|
1028
1028
|
for (var l = !1; ; )
|
|
1029
1029
|
switch (t) {
|
|
@@ -1045,13 +1045,13 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1045
1045
|
return ct(n).length;
|
|
1046
1046
|
default:
|
|
1047
1047
|
if (l)
|
|
1048
|
-
return
|
|
1048
|
+
return s ? -1 : V(n).length;
|
|
1049
1049
|
t = ("" + t).toLowerCase(), l = !0;
|
|
1050
1050
|
}
|
|
1051
1051
|
}
|
|
1052
|
-
|
|
1052
|
+
a.byteLength = S;
|
|
1053
1053
|
function R(n, t, e) {
|
|
1054
|
-
var
|
|
1054
|
+
var s = !1;
|
|
1055
1055
|
if ((t === void 0 || t < 0) && (t = 0), t > this.length || ((e === void 0 || e > this.length) && (e = this.length), e <= 0) || (e >>>= 0, t >>>= 0, e <= t))
|
|
1056
1056
|
return "";
|
|
1057
1057
|
for (n || (n = "utf8"); ; )
|
|
@@ -1074,73 +1074,73 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1074
1074
|
case "utf-16le":
|
|
1075
1075
|
return k(this, t, e);
|
|
1076
1076
|
default:
|
|
1077
|
-
if (
|
|
1077
|
+
if (s)
|
|
1078
1078
|
throw new TypeError("Unknown encoding: " + n);
|
|
1079
|
-
n = (n + "").toLowerCase(),
|
|
1079
|
+
n = (n + "").toLowerCase(), s = !0;
|
|
1080
1080
|
}
|
|
1081
1081
|
}
|
|
1082
|
-
|
|
1082
|
+
a.prototype._isBuffer = !0;
|
|
1083
1083
|
function H(n, t, e) {
|
|
1084
|
-
var
|
|
1085
|
-
n[t] = n[e], n[e] =
|
|
1084
|
+
var s = n[t];
|
|
1085
|
+
n[t] = n[e], n[e] = s;
|
|
1086
1086
|
}
|
|
1087
|
-
|
|
1087
|
+
a.prototype.swap16 = function() {
|
|
1088
1088
|
var t = this.length;
|
|
1089
1089
|
if (t % 2 !== 0)
|
|
1090
1090
|
throw new RangeError("Buffer size must be a multiple of 16-bits");
|
|
1091
1091
|
for (var e = 0; e < t; e += 2)
|
|
1092
1092
|
H(this, e, e + 1);
|
|
1093
1093
|
return this;
|
|
1094
|
-
},
|
|
1094
|
+
}, a.prototype.swap32 = function() {
|
|
1095
1095
|
var t = this.length;
|
|
1096
1096
|
if (t % 4 !== 0)
|
|
1097
1097
|
throw new RangeError("Buffer size must be a multiple of 32-bits");
|
|
1098
1098
|
for (var e = 0; e < t; e += 4)
|
|
1099
1099
|
H(this, e, e + 3), H(this, e + 1, e + 2);
|
|
1100
1100
|
return this;
|
|
1101
|
-
},
|
|
1101
|
+
}, a.prototype.swap64 = function() {
|
|
1102
1102
|
var t = this.length;
|
|
1103
1103
|
if (t % 8 !== 0)
|
|
1104
1104
|
throw new RangeError("Buffer size must be a multiple of 64-bits");
|
|
1105
1105
|
for (var e = 0; e < t; e += 8)
|
|
1106
1106
|
H(this, e, e + 7), H(this, e + 1, e + 6), H(this, e + 2, e + 5), H(this, e + 3, e + 4);
|
|
1107
1107
|
return this;
|
|
1108
|
-
},
|
|
1108
|
+
}, a.prototype.toString = function() {
|
|
1109
1109
|
var t = this.length;
|
|
1110
1110
|
return t === 0 ? "" : arguments.length === 0 ? m(this, 0, t) : R.apply(this, arguments);
|
|
1111
|
-
},
|
|
1112
|
-
if (!
|
|
1111
|
+
}, a.prototype.toLocaleString = a.prototype.toString, a.prototype.equals = function(t) {
|
|
1112
|
+
if (!a.isBuffer(t))
|
|
1113
1113
|
throw new TypeError("Argument must be a Buffer");
|
|
1114
|
-
return this === t ? !0 :
|
|
1115
|
-
},
|
|
1114
|
+
return this === t ? !0 : a.compare(this, t) === 0;
|
|
1115
|
+
}, a.prototype.inspect = function() {
|
|
1116
1116
|
var t = "", e = i.INSPECT_MAX_BYTES;
|
|
1117
1117
|
return t = this.toString("hex", 0, e).replace(/(.{2})/g, "$1 ").trim(), this.length > e && (t += " ... "), "<Buffer " + t + ">";
|
|
1118
|
-
}, p && (
|
|
1119
|
-
if (rt(t, Uint8Array) && (t =
|
|
1118
|
+
}, p && (a.prototype[p] = a.prototype.inspect), a.prototype.compare = function(t, e, s, l, x) {
|
|
1119
|
+
if (rt(t, Uint8Array) && (t = a.from(t, t.offset, t.byteLength)), !a.isBuffer(t))
|
|
1120
1120
|
throw new TypeError(
|
|
1121
1121
|
'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof t
|
|
1122
1122
|
);
|
|
1123
|
-
if (e === void 0 && (e = 0),
|
|
1123
|
+
if (e === void 0 && (e = 0), s === void 0 && (s = t ? t.length : 0), l === void 0 && (l = 0), x === void 0 && (x = this.length), e < 0 || s > t.length || l < 0 || x > this.length)
|
|
1124
1124
|
throw new RangeError("out of range index");
|
|
1125
|
-
if (l >= x && e >=
|
|
1125
|
+
if (l >= x && e >= s)
|
|
1126
1126
|
return 0;
|
|
1127
1127
|
if (l >= x)
|
|
1128
1128
|
return -1;
|
|
1129
|
-
if (e >=
|
|
1129
|
+
if (e >= s)
|
|
1130
1130
|
return 1;
|
|
1131
|
-
if (e >>>= 0,
|
|
1131
|
+
if (e >>>= 0, s >>>= 0, l >>>= 0, x >>>= 0, this === t)
|
|
1132
1132
|
return 0;
|
|
1133
|
-
for (var d = x - l, D =
|
|
1133
|
+
for (var d = x - l, D = s - e, N = Math.min(d, D), P = this.slice(l, x), G = t.slice(e, s), z = 0; z < N; ++z)
|
|
1134
1134
|
if (P[z] !== G[z]) {
|
|
1135
1135
|
d = P[z], D = G[z];
|
|
1136
1136
|
break;
|
|
1137
1137
|
}
|
|
1138
1138
|
return d < D ? -1 : D < d ? 1 : 0;
|
|
1139
1139
|
};
|
|
1140
|
-
function W(n, t, e,
|
|
1140
|
+
function W(n, t, e, s, l) {
|
|
1141
1141
|
if (n.length === 0)
|
|
1142
1142
|
return -1;
|
|
1143
|
-
if (typeof e == "string" ? (
|
|
1143
|
+
if (typeof e == "string" ? (s = e, e = 0) : e > 2147483647 ? e = 2147483647 : e < -2147483648 && (e = -2147483648), e = +e, Ct(e) && (e = l ? 0 : n.length - 1), e < 0 && (e = n.length + e), e >= n.length) {
|
|
1144
1144
|
if (l)
|
|
1145
1145
|
return -1;
|
|
1146
1146
|
e = n.length - 1;
|
|
@@ -1149,15 +1149,15 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1149
1149
|
e = 0;
|
|
1150
1150
|
else
|
|
1151
1151
|
return -1;
|
|
1152
|
-
if (typeof t == "string" && (t =
|
|
1153
|
-
return t.length === 0 ? -1 : M(n, t, e,
|
|
1152
|
+
if (typeof t == "string" && (t = a.from(t, s)), a.isBuffer(t))
|
|
1153
|
+
return t.length === 0 ? -1 : M(n, t, e, s, l);
|
|
1154
1154
|
if (typeof t == "number")
|
|
1155
|
-
return t = t & 255, typeof Uint8Array.prototype.indexOf == "function" ? l ? Uint8Array.prototype.indexOf.call(n, t, e) : Uint8Array.prototype.lastIndexOf.call(n, t, e) : M(n, [t], e,
|
|
1155
|
+
return t = t & 255, typeof Uint8Array.prototype.indexOf == "function" ? l ? Uint8Array.prototype.indexOf.call(n, t, e) : Uint8Array.prototype.lastIndexOf.call(n, t, e) : M(n, [t], e, s, l);
|
|
1156
1156
|
throw new TypeError("val must be string, number or Buffer");
|
|
1157
1157
|
}
|
|
1158
|
-
function M(n, t, e,
|
|
1158
|
+
function M(n, t, e, s, l) {
|
|
1159
1159
|
var x = 1, d = n.length, D = t.length;
|
|
1160
|
-
if (
|
|
1160
|
+
if (s !== void 0 && (s = String(s).toLowerCase(), s === "ucs2" || s === "ucs-2" || s === "utf16le" || s === "utf-16le")) {
|
|
1161
1161
|
if (n.length < 2 || t.length < 2)
|
|
1162
1162
|
return -1;
|
|
1163
1163
|
x = 2, d /= 2, D /= 2, e /= 2;
|
|
@@ -1186,20 +1186,20 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1186
1186
|
}
|
|
1187
1187
|
return -1;
|
|
1188
1188
|
}
|
|
1189
|
-
|
|
1190
|
-
return this.indexOf(t, e,
|
|
1191
|
-
},
|
|
1192
|
-
return W(this, t, e,
|
|
1193
|
-
},
|
|
1194
|
-
return W(this, t, e,
|
|
1189
|
+
a.prototype.includes = function(t, e, s) {
|
|
1190
|
+
return this.indexOf(t, e, s) !== -1;
|
|
1191
|
+
}, a.prototype.indexOf = function(t, e, s) {
|
|
1192
|
+
return W(this, t, e, s, !0);
|
|
1193
|
+
}, a.prototype.lastIndexOf = function(t, e, s) {
|
|
1194
|
+
return W(this, t, e, s, !1);
|
|
1195
1195
|
};
|
|
1196
|
-
function ut(n, t, e,
|
|
1196
|
+
function ut(n, t, e, s) {
|
|
1197
1197
|
e = Number(e) || 0;
|
|
1198
1198
|
var l = n.length - e;
|
|
1199
|
-
|
|
1199
|
+
s ? (s = Number(s), s > l && (s = l)) : s = l;
|
|
1200
1200
|
var x = t.length;
|
|
1201
|
-
|
|
1202
|
-
for (var d = 0; d <
|
|
1201
|
+
s > x / 2 && (s = x / 2);
|
|
1202
|
+
for (var d = 0; d < s; ++d) {
|
|
1203
1203
|
var D = parseInt(t.substr(d * 2, 2), 16);
|
|
1204
1204
|
if (Ct(D))
|
|
1205
1205
|
return d;
|
|
@@ -1207,57 +1207,57 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1207
1207
|
}
|
|
1208
1208
|
return d;
|
|
1209
1209
|
}
|
|
1210
|
-
function ft(n, t, e,
|
|
1211
|
-
return
|
|
1210
|
+
function ft(n, t, e, s) {
|
|
1211
|
+
return vt(V(t, n.length - e), n, e, s);
|
|
1212
1212
|
}
|
|
1213
|
-
function st(n, t, e,
|
|
1214
|
-
return
|
|
1213
|
+
function st(n, t, e, s) {
|
|
1214
|
+
return vt(Q(t), n, e, s);
|
|
1215
1215
|
}
|
|
1216
|
-
function pt(n, t, e,
|
|
1217
|
-
return
|
|
1216
|
+
function pt(n, t, e, s) {
|
|
1217
|
+
return vt(ct(t), n, e, s);
|
|
1218
1218
|
}
|
|
1219
|
-
function Dt(n, t, e,
|
|
1220
|
-
return
|
|
1219
|
+
function Dt(n, t, e, s) {
|
|
1220
|
+
return vt(tt(t, n.length - e), n, e, s);
|
|
1221
1221
|
}
|
|
1222
|
-
|
|
1222
|
+
a.prototype.write = function(t, e, s, l) {
|
|
1223
1223
|
if (e === void 0)
|
|
1224
|
-
l = "utf8",
|
|
1225
|
-
else if (
|
|
1226
|
-
l = e,
|
|
1224
|
+
l = "utf8", s = this.length, e = 0;
|
|
1225
|
+
else if (s === void 0 && typeof e == "string")
|
|
1226
|
+
l = e, s = this.length, e = 0;
|
|
1227
1227
|
else if (isFinite(e))
|
|
1228
|
-
e = e >>> 0, isFinite(
|
|
1228
|
+
e = e >>> 0, isFinite(s) ? (s = s >>> 0, l === void 0 && (l = "utf8")) : (l = s, s = void 0);
|
|
1229
1229
|
else
|
|
1230
1230
|
throw new Error(
|
|
1231
1231
|
"Buffer.write(string, encoding, offset[, length]) is no longer supported"
|
|
1232
1232
|
);
|
|
1233
1233
|
var x = this.length - e;
|
|
1234
|
-
if ((
|
|
1234
|
+
if ((s === void 0 || s > x) && (s = x), t.length > 0 && (s < 0 || e < 0) || e > this.length)
|
|
1235
1235
|
throw new RangeError("Attempt to write outside buffer bounds");
|
|
1236
1236
|
l || (l = "utf8");
|
|
1237
1237
|
for (var d = !1; ; )
|
|
1238
1238
|
switch (l) {
|
|
1239
1239
|
case "hex":
|
|
1240
|
-
return ut(this, t, e,
|
|
1240
|
+
return ut(this, t, e, s);
|
|
1241
1241
|
case "utf8":
|
|
1242
1242
|
case "utf-8":
|
|
1243
|
-
return ft(this, t, e,
|
|
1243
|
+
return ft(this, t, e, s);
|
|
1244
1244
|
case "ascii":
|
|
1245
1245
|
case "latin1":
|
|
1246
1246
|
case "binary":
|
|
1247
|
-
return st(this, t, e,
|
|
1247
|
+
return st(this, t, e, s);
|
|
1248
1248
|
case "base64":
|
|
1249
|
-
return pt(this, t, e,
|
|
1249
|
+
return pt(this, t, e, s);
|
|
1250
1250
|
case "ucs2":
|
|
1251
1251
|
case "ucs-2":
|
|
1252
1252
|
case "utf16le":
|
|
1253
1253
|
case "utf-16le":
|
|
1254
|
-
return Dt(this, t, e,
|
|
1254
|
+
return Dt(this, t, e, s);
|
|
1255
1255
|
default:
|
|
1256
1256
|
if (d)
|
|
1257
1257
|
throw new TypeError("Unknown encoding: " + l);
|
|
1258
1258
|
l = ("" + l).toLowerCase(), d = !0;
|
|
1259
1259
|
}
|
|
1260
|
-
},
|
|
1260
|
+
}, a.prototype.toJSON = function() {
|
|
1261
1261
|
return {
|
|
1262
1262
|
type: "Buffer",
|
|
1263
1263
|
data: Array.prototype.slice.call(this._arr || this, 0)
|
|
@@ -1268,7 +1268,7 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1268
1268
|
}
|
|
1269
1269
|
function m(n, t, e) {
|
|
1270
1270
|
e = Math.min(n.length, e);
|
|
1271
|
-
for (var
|
|
1271
|
+
for (var s = [], l = t; l < e; ) {
|
|
1272
1272
|
var x = n[l], d = null, D = x > 239 ? 4 : x > 223 ? 3 : x > 191 ? 2 : 1;
|
|
1273
1273
|
if (l + D <= e) {
|
|
1274
1274
|
var N, P, G, z;
|
|
@@ -1286,53 +1286,53 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1286
1286
|
N = n[l + 1], P = n[l + 2], G = n[l + 3], (N & 192) === 128 && (P & 192) === 128 && (G & 192) === 128 && (z = (x & 15) << 18 | (N & 63) << 12 | (P & 63) << 6 | G & 63, z > 65535 && z < 1114112 && (d = z));
|
|
1287
1287
|
}
|
|
1288
1288
|
}
|
|
1289
|
-
d === null ? (d = 65533, D = 1) : d > 65535 && (d -= 65536,
|
|
1289
|
+
d === null ? (d = 65533, D = 1) : d > 65535 && (d -= 65536, s.push(d >>> 10 & 1023 | 55296), d = 56320 | d & 1023), s.push(d), l += D;
|
|
1290
1290
|
}
|
|
1291
|
-
return T(
|
|
1291
|
+
return T(s);
|
|
1292
1292
|
}
|
|
1293
|
-
var
|
|
1293
|
+
var v = 4096;
|
|
1294
1294
|
function T(n) {
|
|
1295
1295
|
var t = n.length;
|
|
1296
|
-
if (t <=
|
|
1296
|
+
if (t <= v)
|
|
1297
1297
|
return String.fromCharCode.apply(String, n);
|
|
1298
|
-
for (var e = "",
|
|
1298
|
+
for (var e = "", s = 0; s < t; )
|
|
1299
1299
|
e += String.fromCharCode.apply(
|
|
1300
1300
|
String,
|
|
1301
|
-
n.slice(
|
|
1301
|
+
n.slice(s, s += v)
|
|
1302
1302
|
);
|
|
1303
1303
|
return e;
|
|
1304
1304
|
}
|
|
1305
1305
|
function O(n, t, e) {
|
|
1306
|
-
var
|
|
1306
|
+
var s = "";
|
|
1307
1307
|
e = Math.min(n.length, e);
|
|
1308
1308
|
for (var l = t; l < e; ++l)
|
|
1309
|
-
|
|
1310
|
-
return
|
|
1309
|
+
s += String.fromCharCode(n[l] & 127);
|
|
1310
|
+
return s;
|
|
1311
1311
|
}
|
|
1312
1312
|
function C(n, t, e) {
|
|
1313
|
-
var
|
|
1313
|
+
var s = "";
|
|
1314
1314
|
e = Math.min(n.length, e);
|
|
1315
1315
|
for (var l = t; l < e; ++l)
|
|
1316
|
-
|
|
1317
|
-
return
|
|
1316
|
+
s += String.fromCharCode(n[l]);
|
|
1317
|
+
return s;
|
|
1318
1318
|
}
|
|
1319
1319
|
function A(n, t, e) {
|
|
1320
|
-
var
|
|
1321
|
-
(!t || t < 0) && (t = 0), (!e || e < 0 || e >
|
|
1320
|
+
var s = n.length;
|
|
1321
|
+
(!t || t < 0) && (t = 0), (!e || e < 0 || e > s) && (e = s);
|
|
1322
1322
|
for (var l = "", x = t; x < e; ++x)
|
|
1323
1323
|
l += We[n[x]];
|
|
1324
1324
|
return l;
|
|
1325
1325
|
}
|
|
1326
1326
|
function k(n, t, e) {
|
|
1327
|
-
for (var
|
|
1328
|
-
l += String.fromCharCode(
|
|
1327
|
+
for (var s = n.slice(t, e), l = "", x = 0; x < s.length - 1; x += 2)
|
|
1328
|
+
l += String.fromCharCode(s[x] + s[x + 1] * 256);
|
|
1329
1329
|
return l;
|
|
1330
1330
|
}
|
|
1331
|
-
|
|
1332
|
-
var
|
|
1333
|
-
t = ~~t, e = e === void 0 ?
|
|
1331
|
+
a.prototype.slice = function(t, e) {
|
|
1332
|
+
var s = this.length;
|
|
1333
|
+
t = ~~t, e = e === void 0 ? s : ~~e, t < 0 ? (t += s, t < 0 && (t = 0)) : t > s && (t = s), e < 0 ? (e += s, e < 0 && (e = 0)) : e > s && (e = s), e < t && (e = t);
|
|
1334
1334
|
var l = this.subarray(t, e);
|
|
1335
|
-
return Object.setPrototypeOf(l,
|
|
1335
|
+
return Object.setPrototypeOf(l, a.prototype), l;
|
|
1336
1336
|
};
|
|
1337
1337
|
function B(n, t, e) {
|
|
1338
1338
|
if (n % 1 !== 0 || n < 0)
|
|
@@ -1340,168 +1340,168 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1340
1340
|
if (n + t > e)
|
|
1341
1341
|
throw new RangeError("Trying to access beyond buffer length");
|
|
1342
1342
|
}
|
|
1343
|
-
|
|
1344
|
-
t = t >>> 0, e = e >>> 0,
|
|
1343
|
+
a.prototype.readUintLE = a.prototype.readUIntLE = function(t, e, s) {
|
|
1344
|
+
t = t >>> 0, e = e >>> 0, s || B(t, e, this.length);
|
|
1345
1345
|
for (var l = this[t], x = 1, d = 0; ++d < e && (x *= 256); )
|
|
1346
1346
|
l += this[t + d] * x;
|
|
1347
1347
|
return l;
|
|
1348
|
-
},
|
|
1349
|
-
t = t >>> 0, e = e >>> 0,
|
|
1348
|
+
}, a.prototype.readUintBE = a.prototype.readUIntBE = function(t, e, s) {
|
|
1349
|
+
t = t >>> 0, e = e >>> 0, s || B(t, e, this.length);
|
|
1350
1350
|
for (var l = this[t + --e], x = 1; e > 0 && (x *= 256); )
|
|
1351
1351
|
l += this[t + --e] * x;
|
|
1352
1352
|
return l;
|
|
1353
|
-
},
|
|
1353
|
+
}, a.prototype.readUint8 = a.prototype.readUInt8 = function(t, e) {
|
|
1354
1354
|
return t = t >>> 0, e || B(t, 1, this.length), this[t];
|
|
1355
|
-
},
|
|
1355
|
+
}, a.prototype.readUint16LE = a.prototype.readUInt16LE = function(t, e) {
|
|
1356
1356
|
return t = t >>> 0, e || B(t, 2, this.length), this[t] | this[t + 1] << 8;
|
|
1357
|
-
},
|
|
1357
|
+
}, a.prototype.readUint16BE = a.prototype.readUInt16BE = function(t, e) {
|
|
1358
1358
|
return t = t >>> 0, e || B(t, 2, this.length), this[t] << 8 | this[t + 1];
|
|
1359
|
-
},
|
|
1359
|
+
}, a.prototype.readUint32LE = a.prototype.readUInt32LE = function(t, e) {
|
|
1360
1360
|
return t = t >>> 0, e || B(t, 4, this.length), (this[t] | this[t + 1] << 8 | this[t + 2] << 16) + this[t + 3] * 16777216;
|
|
1361
|
-
},
|
|
1361
|
+
}, a.prototype.readUint32BE = a.prototype.readUInt32BE = function(t, e) {
|
|
1362
1362
|
return t = t >>> 0, e || B(t, 4, this.length), this[t] * 16777216 + (this[t + 1] << 16 | this[t + 2] << 8 | this[t + 3]);
|
|
1363
|
-
},
|
|
1364
|
-
t = t >>> 0, e = e >>> 0,
|
|
1363
|
+
}, a.prototype.readIntLE = function(t, e, s) {
|
|
1364
|
+
t = t >>> 0, e = e >>> 0, s || B(t, e, this.length);
|
|
1365
1365
|
for (var l = this[t], x = 1, d = 0; ++d < e && (x *= 256); )
|
|
1366
1366
|
l += this[t + d] * x;
|
|
1367
1367
|
return x *= 128, l >= x && (l -= Math.pow(2, 8 * e)), l;
|
|
1368
|
-
},
|
|
1369
|
-
t = t >>> 0, e = e >>> 0,
|
|
1368
|
+
}, a.prototype.readIntBE = function(t, e, s) {
|
|
1369
|
+
t = t >>> 0, e = e >>> 0, s || B(t, e, this.length);
|
|
1370
1370
|
for (var l = e, x = 1, d = this[t + --l]; l > 0 && (x *= 256); )
|
|
1371
1371
|
d += this[t + --l] * x;
|
|
1372
1372
|
return x *= 128, d >= x && (d -= Math.pow(2, 8 * e)), d;
|
|
1373
|
-
},
|
|
1373
|
+
}, a.prototype.readInt8 = function(t, e) {
|
|
1374
1374
|
return t = t >>> 0, e || B(t, 1, this.length), this[t] & 128 ? (255 - this[t] + 1) * -1 : this[t];
|
|
1375
|
-
},
|
|
1375
|
+
}, a.prototype.readInt16LE = function(t, e) {
|
|
1376
1376
|
t = t >>> 0, e || B(t, 2, this.length);
|
|
1377
|
-
var
|
|
1378
|
-
return
|
|
1379
|
-
},
|
|
1377
|
+
var s = this[t] | this[t + 1] << 8;
|
|
1378
|
+
return s & 32768 ? s | 4294901760 : s;
|
|
1379
|
+
}, a.prototype.readInt16BE = function(t, e) {
|
|
1380
1380
|
t = t >>> 0, e || B(t, 2, this.length);
|
|
1381
|
-
var
|
|
1382
|
-
return
|
|
1383
|
-
},
|
|
1381
|
+
var s = this[t + 1] | this[t] << 8;
|
|
1382
|
+
return s & 32768 ? s | 4294901760 : s;
|
|
1383
|
+
}, a.prototype.readInt32LE = function(t, e) {
|
|
1384
1384
|
return t = t >>> 0, e || B(t, 4, this.length), this[t] | this[t + 1] << 8 | this[t + 2] << 16 | this[t + 3] << 24;
|
|
1385
|
-
},
|
|
1385
|
+
}, a.prototype.readInt32BE = function(t, e) {
|
|
1386
1386
|
return t = t >>> 0, e || B(t, 4, this.length), this[t] << 24 | this[t + 1] << 16 | this[t + 2] << 8 | this[t + 3];
|
|
1387
|
-
},
|
|
1387
|
+
}, a.prototype.readFloatLE = function(t, e) {
|
|
1388
1388
|
return t = t >>> 0, e || B(t, 4, this.length), o.read(this, t, !0, 23, 4);
|
|
1389
|
-
},
|
|
1389
|
+
}, a.prototype.readFloatBE = function(t, e) {
|
|
1390
1390
|
return t = t >>> 0, e || B(t, 4, this.length), o.read(this, t, !1, 23, 4);
|
|
1391
|
-
},
|
|
1391
|
+
}, a.prototype.readDoubleLE = function(t, e) {
|
|
1392
1392
|
return t = t >>> 0, e || B(t, 8, this.length), o.read(this, t, !0, 52, 8);
|
|
1393
|
-
},
|
|
1393
|
+
}, a.prototype.readDoubleBE = function(t, e) {
|
|
1394
1394
|
return t = t >>> 0, e || B(t, 8, this.length), o.read(this, t, !1, 52, 8);
|
|
1395
1395
|
};
|
|
1396
|
-
function I(n, t, e,
|
|
1397
|
-
if (!
|
|
1396
|
+
function I(n, t, e, s, l, x) {
|
|
1397
|
+
if (!a.isBuffer(n))
|
|
1398
1398
|
throw new TypeError('"buffer" argument must be a Buffer instance');
|
|
1399
1399
|
if (t > l || t < x)
|
|
1400
1400
|
throw new RangeError('"value" argument is out of bounds');
|
|
1401
|
-
if (e +
|
|
1401
|
+
if (e + s > n.length)
|
|
1402
1402
|
throw new RangeError("Index out of range");
|
|
1403
1403
|
}
|
|
1404
|
-
|
|
1405
|
-
if (t = +t, e = e >>> 0,
|
|
1406
|
-
var x = Math.pow(2, 8 *
|
|
1407
|
-
I(this, t, e,
|
|
1404
|
+
a.prototype.writeUintLE = a.prototype.writeUIntLE = function(t, e, s, l) {
|
|
1405
|
+
if (t = +t, e = e >>> 0, s = s >>> 0, !l) {
|
|
1406
|
+
var x = Math.pow(2, 8 * s) - 1;
|
|
1407
|
+
I(this, t, e, s, x, 0);
|
|
1408
1408
|
}
|
|
1409
1409
|
var d = 1, D = 0;
|
|
1410
|
-
for (this[e] = t & 255; ++D <
|
|
1410
|
+
for (this[e] = t & 255; ++D < s && (d *= 256); )
|
|
1411
1411
|
this[e + D] = t / d & 255;
|
|
1412
|
-
return e +
|
|
1413
|
-
},
|
|
1414
|
-
if (t = +t, e = e >>> 0,
|
|
1415
|
-
var x = Math.pow(2, 8 *
|
|
1416
|
-
I(this, t, e,
|
|
1412
|
+
return e + s;
|
|
1413
|
+
}, a.prototype.writeUintBE = a.prototype.writeUIntBE = function(t, e, s, l) {
|
|
1414
|
+
if (t = +t, e = e >>> 0, s = s >>> 0, !l) {
|
|
1415
|
+
var x = Math.pow(2, 8 * s) - 1;
|
|
1416
|
+
I(this, t, e, s, x, 0);
|
|
1417
1417
|
}
|
|
1418
|
-
var d =
|
|
1418
|
+
var d = s - 1, D = 1;
|
|
1419
1419
|
for (this[e + d] = t & 255; --d >= 0 && (D *= 256); )
|
|
1420
1420
|
this[e + d] = t / D & 255;
|
|
1421
|
-
return e +
|
|
1422
|
-
},
|
|
1423
|
-
return t = +t, e = e >>> 0,
|
|
1424
|
-
},
|
|
1425
|
-
return t = +t, e = e >>> 0,
|
|
1426
|
-
},
|
|
1427
|
-
return t = +t, e = e >>> 0,
|
|
1428
|
-
},
|
|
1429
|
-
return t = +t, e = e >>> 0,
|
|
1430
|
-
},
|
|
1431
|
-
return t = +t, e = e >>> 0,
|
|
1432
|
-
},
|
|
1421
|
+
return e + s;
|
|
1422
|
+
}, a.prototype.writeUint8 = a.prototype.writeUInt8 = function(t, e, s) {
|
|
1423
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 1, 255, 0), this[e] = t & 255, e + 1;
|
|
1424
|
+
}, a.prototype.writeUint16LE = a.prototype.writeUInt16LE = function(t, e, s) {
|
|
1425
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 2, 65535, 0), this[e] = t & 255, this[e + 1] = t >>> 8, e + 2;
|
|
1426
|
+
}, a.prototype.writeUint16BE = a.prototype.writeUInt16BE = function(t, e, s) {
|
|
1427
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 2, 65535, 0), this[e] = t >>> 8, this[e + 1] = t & 255, e + 2;
|
|
1428
|
+
}, a.prototype.writeUint32LE = a.prototype.writeUInt32LE = function(t, e, s) {
|
|
1429
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 4, 4294967295, 0), this[e + 3] = t >>> 24, this[e + 2] = t >>> 16, this[e + 1] = t >>> 8, this[e] = t & 255, e + 4;
|
|
1430
|
+
}, a.prototype.writeUint32BE = a.prototype.writeUInt32BE = function(t, e, s) {
|
|
1431
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 4, 4294967295, 0), this[e] = t >>> 24, this[e + 1] = t >>> 16, this[e + 2] = t >>> 8, this[e + 3] = t & 255, e + 4;
|
|
1432
|
+
}, a.prototype.writeIntLE = function(t, e, s, l) {
|
|
1433
1433
|
if (t = +t, e = e >>> 0, !l) {
|
|
1434
|
-
var x = Math.pow(2, 8 *
|
|
1435
|
-
I(this, t, e,
|
|
1434
|
+
var x = Math.pow(2, 8 * s - 1);
|
|
1435
|
+
I(this, t, e, s, x - 1, -x);
|
|
1436
1436
|
}
|
|
1437
1437
|
var d = 0, D = 1, N = 0;
|
|
1438
|
-
for (this[e] = t & 255; ++d <
|
|
1438
|
+
for (this[e] = t & 255; ++d < s && (D *= 256); )
|
|
1439
1439
|
t < 0 && N === 0 && this[e + d - 1] !== 0 && (N = 1), this[e + d] = (t / D >> 0) - N & 255;
|
|
1440
|
-
return e +
|
|
1441
|
-
},
|
|
1440
|
+
return e + s;
|
|
1441
|
+
}, a.prototype.writeIntBE = function(t, e, s, l) {
|
|
1442
1442
|
if (t = +t, e = e >>> 0, !l) {
|
|
1443
|
-
var x = Math.pow(2, 8 *
|
|
1444
|
-
I(this, t, e,
|
|
1443
|
+
var x = Math.pow(2, 8 * s - 1);
|
|
1444
|
+
I(this, t, e, s, x - 1, -x);
|
|
1445
1445
|
}
|
|
1446
|
-
var d =
|
|
1446
|
+
var d = s - 1, D = 1, N = 0;
|
|
1447
1447
|
for (this[e + d] = t & 255; --d >= 0 && (D *= 256); )
|
|
1448
1448
|
t < 0 && N === 0 && this[e + d + 1] !== 0 && (N = 1), this[e + d] = (t / D >> 0) - N & 255;
|
|
1449
|
-
return e +
|
|
1450
|
-
},
|
|
1451
|
-
return t = +t, e = e >>> 0,
|
|
1452
|
-
},
|
|
1453
|
-
return t = +t, e = e >>> 0,
|
|
1454
|
-
},
|
|
1455
|
-
return t = +t, e = e >>> 0,
|
|
1456
|
-
},
|
|
1457
|
-
return t = +t, e = e >>> 0,
|
|
1458
|
-
},
|
|
1459
|
-
return t = +t, e = e >>> 0,
|
|
1449
|
+
return e + s;
|
|
1450
|
+
}, a.prototype.writeInt8 = function(t, e, s) {
|
|
1451
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 1, 127, -128), t < 0 && (t = 255 + t + 1), this[e] = t & 255, e + 1;
|
|
1452
|
+
}, a.prototype.writeInt16LE = function(t, e, s) {
|
|
1453
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 2, 32767, -32768), this[e] = t & 255, this[e + 1] = t >>> 8, e + 2;
|
|
1454
|
+
}, a.prototype.writeInt16BE = function(t, e, s) {
|
|
1455
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 2, 32767, -32768), this[e] = t >>> 8, this[e + 1] = t & 255, e + 2;
|
|
1456
|
+
}, a.prototype.writeInt32LE = function(t, e, s) {
|
|
1457
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 4, 2147483647, -2147483648), this[e] = t & 255, this[e + 1] = t >>> 8, this[e + 2] = t >>> 16, this[e + 3] = t >>> 24, e + 4;
|
|
1458
|
+
}, a.prototype.writeInt32BE = function(t, e, s) {
|
|
1459
|
+
return t = +t, e = e >>> 0, s || I(this, t, e, 4, 2147483647, -2147483648), t < 0 && (t = 4294967295 + t + 1), this[e] = t >>> 24, this[e + 1] = t >>> 16, this[e + 2] = t >>> 8, this[e + 3] = t & 255, e + 4;
|
|
1460
1460
|
};
|
|
1461
|
-
function L(n, t, e,
|
|
1462
|
-
if (e +
|
|
1461
|
+
function L(n, t, e, s, l, x) {
|
|
1462
|
+
if (e + s > n.length)
|
|
1463
1463
|
throw new RangeError("Index out of range");
|
|
1464
1464
|
if (e < 0)
|
|
1465
1465
|
throw new RangeError("Index out of range");
|
|
1466
1466
|
}
|
|
1467
|
-
function J(n, t, e,
|
|
1468
|
-
return t = +t, e = e >>> 0, l || L(n, t, e, 4), o.write(n, t, e,
|
|
1467
|
+
function J(n, t, e, s, l) {
|
|
1468
|
+
return t = +t, e = e >>> 0, l || L(n, t, e, 4), o.write(n, t, e, s, 23, 4), e + 4;
|
|
1469
1469
|
}
|
|
1470
|
-
|
|
1471
|
-
return J(this, t, e, !0,
|
|
1472
|
-
},
|
|
1473
|
-
return J(this, t, e, !1,
|
|
1470
|
+
a.prototype.writeFloatLE = function(t, e, s) {
|
|
1471
|
+
return J(this, t, e, !0, s);
|
|
1472
|
+
}, a.prototype.writeFloatBE = function(t, e, s) {
|
|
1473
|
+
return J(this, t, e, !1, s);
|
|
1474
1474
|
};
|
|
1475
|
-
function U(n, t, e,
|
|
1476
|
-
return t = +t, e = e >>> 0, l || L(n, t, e, 8), o.write(n, t, e,
|
|
1477
|
-
}
|
|
1478
|
-
|
|
1479
|
-
return U(this, t, e, !0,
|
|
1480
|
-
},
|
|
1481
|
-
return U(this, t, e, !1,
|
|
1482
|
-
},
|
|
1483
|
-
if (!
|
|
1475
|
+
function U(n, t, e, s, l) {
|
|
1476
|
+
return t = +t, e = e >>> 0, l || L(n, t, e, 8), o.write(n, t, e, s, 52, 8), e + 8;
|
|
1477
|
+
}
|
|
1478
|
+
a.prototype.writeDoubleLE = function(t, e, s) {
|
|
1479
|
+
return U(this, t, e, !0, s);
|
|
1480
|
+
}, a.prototype.writeDoubleBE = function(t, e, s) {
|
|
1481
|
+
return U(this, t, e, !1, s);
|
|
1482
|
+
}, a.prototype.copy = function(t, e, s, l) {
|
|
1483
|
+
if (!a.isBuffer(t))
|
|
1484
1484
|
throw new TypeError("argument should be a Buffer");
|
|
1485
|
-
if (
|
|
1485
|
+
if (s || (s = 0), !l && l !== 0 && (l = this.length), e >= t.length && (e = t.length), e || (e = 0), l > 0 && l < s && (l = s), l === s || t.length === 0 || this.length === 0)
|
|
1486
1486
|
return 0;
|
|
1487
1487
|
if (e < 0)
|
|
1488
1488
|
throw new RangeError("targetStart out of bounds");
|
|
1489
|
-
if (
|
|
1489
|
+
if (s < 0 || s >= this.length)
|
|
1490
1490
|
throw new RangeError("Index out of range");
|
|
1491
1491
|
if (l < 0)
|
|
1492
1492
|
throw new RangeError("sourceEnd out of bounds");
|
|
1493
|
-
l > this.length && (l = this.length), t.length - e < l -
|
|
1494
|
-
var x = l -
|
|
1495
|
-
return this === t && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(e,
|
|
1493
|
+
l > this.length && (l = this.length), t.length - e < l - s && (l = t.length - e + s);
|
|
1494
|
+
var x = l - s;
|
|
1495
|
+
return this === t && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(e, s, l) : Uint8Array.prototype.set.call(
|
|
1496
1496
|
t,
|
|
1497
|
-
this.subarray(
|
|
1497
|
+
this.subarray(s, l),
|
|
1498
1498
|
e
|
|
1499
1499
|
), x;
|
|
1500
|
-
},
|
|
1500
|
+
}, a.prototype.fill = function(t, e, s, l) {
|
|
1501
1501
|
if (typeof t == "string") {
|
|
1502
|
-
if (typeof e == "string" ? (l = e, e = 0,
|
|
1502
|
+
if (typeof e == "string" ? (l = e, e = 0, s = this.length) : typeof s == "string" && (l = s, s = this.length), l !== void 0 && typeof l != "string")
|
|
1503
1503
|
throw new TypeError("encoding must be a string");
|
|
1504
|
-
if (typeof l == "string" && !
|
|
1504
|
+
if (typeof l == "string" && !a.isEncoding(l))
|
|
1505
1505
|
throw new TypeError("Unknown encoding: " + l);
|
|
1506
1506
|
if (t.length === 1) {
|
|
1507
1507
|
var x = t.charCodeAt(0);
|
|
@@ -1509,20 +1509,20 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1509
1509
|
}
|
|
1510
1510
|
} else
|
|
1511
1511
|
typeof t == "number" ? t = t & 255 : typeof t == "boolean" && (t = Number(t));
|
|
1512
|
-
if (e < 0 || this.length < e || this.length <
|
|
1512
|
+
if (e < 0 || this.length < e || this.length < s)
|
|
1513
1513
|
throw new RangeError("Out of range index");
|
|
1514
|
-
if (
|
|
1514
|
+
if (s <= e)
|
|
1515
1515
|
return this;
|
|
1516
|
-
e = e >>> 0,
|
|
1516
|
+
e = e >>> 0, s = s === void 0 ? this.length : s >>> 0, t || (t = 0);
|
|
1517
1517
|
var d;
|
|
1518
1518
|
if (typeof t == "number")
|
|
1519
|
-
for (d = e; d <
|
|
1519
|
+
for (d = e; d < s; ++d)
|
|
1520
1520
|
this[d] = t;
|
|
1521
1521
|
else {
|
|
1522
|
-
var D =
|
|
1522
|
+
var D = a.isBuffer(t) ? t : a.from(t, l), N = D.length;
|
|
1523
1523
|
if (N === 0)
|
|
1524
1524
|
throw new TypeError('The value "' + t + '" is invalid for argument "value"');
|
|
1525
|
-
for (d = 0; d <
|
|
1525
|
+
for (d = 0; d < s - e; ++d)
|
|
1526
1526
|
this[d + e] = D[d % N];
|
|
1527
1527
|
}
|
|
1528
1528
|
return this;
|
|
@@ -1537,13 +1537,13 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1537
1537
|
}
|
|
1538
1538
|
function V(n, t) {
|
|
1539
1539
|
t = t || 1 / 0;
|
|
1540
|
-
for (var e,
|
|
1540
|
+
for (var e, s = n.length, l = null, x = [], d = 0; d < s; ++d) {
|
|
1541
1541
|
if (e = n.charCodeAt(d), e > 55295 && e < 57344) {
|
|
1542
1542
|
if (!l) {
|
|
1543
1543
|
if (e > 56319) {
|
|
1544
1544
|
(t -= 3) > -1 && x.push(239, 191, 189);
|
|
1545
1545
|
continue;
|
|
1546
|
-
} else if (d + 1 ===
|
|
1546
|
+
} else if (d + 1 === s) {
|
|
1547
1547
|
(t -= 3) > -1 && x.push(239, 191, 189);
|
|
1548
1548
|
continue;
|
|
1549
1549
|
}
|
|
@@ -1596,15 +1596,15 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1596
1596
|
return t;
|
|
1597
1597
|
}
|
|
1598
1598
|
function tt(n, t) {
|
|
1599
|
-
for (var e,
|
|
1600
|
-
e = n.charCodeAt(d),
|
|
1599
|
+
for (var e, s, l, x = [], d = 0; d < n.length && !((t -= 2) < 0); ++d)
|
|
1600
|
+
e = n.charCodeAt(d), s = e >> 8, l = e % 256, x.push(l), x.push(s);
|
|
1601
1601
|
return x;
|
|
1602
1602
|
}
|
|
1603
1603
|
function ct(n) {
|
|
1604
1604
|
return r.toByteArray(Y(n));
|
|
1605
1605
|
}
|
|
1606
|
-
function
|
|
1607
|
-
for (var l = 0; l <
|
|
1606
|
+
function vt(n, t, e, s) {
|
|
1607
|
+
for (var l = 0; l < s && !(l + e >= t.length || l >= n.length); ++l)
|
|
1608
1608
|
t[l + e] = n[l];
|
|
1609
1609
|
return l;
|
|
1610
1610
|
}
|
|
@@ -1616,31 +1616,31 @@ Vt.write = function(i, r, o, p, u, f) {
|
|
|
1616
1616
|
}
|
|
1617
1617
|
var We = function() {
|
|
1618
1618
|
for (var n = "0123456789abcdef", t = new Array(256), e = 0; e < 16; ++e)
|
|
1619
|
-
for (var
|
|
1620
|
-
t[
|
|
1619
|
+
for (var s = e * 16, l = 0; l < 16; ++l)
|
|
1620
|
+
t[s + l] = n[e] + n[l];
|
|
1621
1621
|
return t;
|
|
1622
1622
|
}();
|
|
1623
|
-
})(
|
|
1623
|
+
})(ve);
|
|
1624
1624
|
/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
|
|
1625
1625
|
(function(i, r) {
|
|
1626
|
-
var o =
|
|
1627
|
-
function u(c,
|
|
1626
|
+
var o = ve, p = o.Buffer;
|
|
1627
|
+
function u(c, a) {
|
|
1628
1628
|
for (var h in c)
|
|
1629
|
-
|
|
1629
|
+
a[h] = c[h];
|
|
1630
1630
|
}
|
|
1631
1631
|
p.from && p.alloc && p.allocUnsafe && p.allocUnsafeSlow ? i.exports = o : (u(o, r), r.Buffer = f);
|
|
1632
|
-
function f(c,
|
|
1633
|
-
return p(c,
|
|
1632
|
+
function f(c, a, h) {
|
|
1633
|
+
return p(c, a, h);
|
|
1634
1634
|
}
|
|
1635
|
-
f.prototype = Object.create(p.prototype), u(p, f), f.from = function(c,
|
|
1635
|
+
f.prototype = Object.create(p.prototype), u(p, f), f.from = function(c, a, h) {
|
|
1636
1636
|
if (typeof c == "number")
|
|
1637
1637
|
throw new TypeError("Argument must not be a number");
|
|
1638
|
-
return p(c,
|
|
1639
|
-
}, f.alloc = function(c,
|
|
1638
|
+
return p(c, a, h);
|
|
1639
|
+
}, f.alloc = function(c, a, h) {
|
|
1640
1640
|
if (typeof c != "number")
|
|
1641
1641
|
throw new TypeError("Argument must be a number");
|
|
1642
1642
|
var g = p(c);
|
|
1643
|
-
return
|
|
1643
|
+
return a !== void 0 ? typeof h == "string" ? g.fill(a, h) : g.fill(a) : g.fill(0), g;
|
|
1644
1644
|
}, f.allocUnsafe = function(c) {
|
|
1645
1645
|
if (typeof c != "number")
|
|
1646
1646
|
throw new TypeError("Argument must be a number");
|
|
@@ -1658,8 +1658,8 @@ function Tt(i, r) {
|
|
|
1658
1658
|
Tt.prototype.update = function(i, r) {
|
|
1659
1659
|
typeof i == "string" && (r = r || "utf8", i = Ae.from(i, r));
|
|
1660
1660
|
for (var o = this._block, p = this._blockSize, u = i.length, f = this._len, c = 0; c < u; ) {
|
|
1661
|
-
for (var
|
|
1662
|
-
o[
|
|
1661
|
+
for (var a = f % p, h = Math.min(u - c, p - a), g = 0; g < h; g++)
|
|
1662
|
+
o[a + g] = i[c + g];
|
|
1663
1663
|
f += h, c += h, f % p === 0 && this._update(o);
|
|
1664
1664
|
}
|
|
1665
1665
|
return this._len += u, this;
|
|
@@ -1681,20 +1681,20 @@ Tt.prototype.digest = function(i) {
|
|
|
1681
1681
|
Tt.prototype._update = function() {
|
|
1682
1682
|
throw new Error("_update must be implemented by subclass");
|
|
1683
1683
|
};
|
|
1684
|
-
var Fe = Tt, wi =
|
|
1684
|
+
var Fe = Tt, wi = Se, Be = Fe, Ei = Kt.Buffer, bi = [
|
|
1685
1685
|
1518500249,
|
|
1686
1686
|
1859775393,
|
|
1687
1687
|
-1894007588,
|
|
1688
1688
|
-899497514
|
|
1689
|
-
],
|
|
1689
|
+
], Si = new Array(80);
|
|
1690
1690
|
function bt() {
|
|
1691
|
-
this.init(), this._w =
|
|
1691
|
+
this.init(), this._w = Si, Be.call(this, 64, 56);
|
|
1692
1692
|
}
|
|
1693
1693
|
wi(bt, Be);
|
|
1694
1694
|
bt.prototype.init = function() {
|
|
1695
1695
|
return this._a = 1732584193, this._b = 4023233417, this._c = 2562383102, this._d = 271733878, this._e = 3285377520, this;
|
|
1696
1696
|
};
|
|
1697
|
-
function
|
|
1697
|
+
function vi(i) {
|
|
1698
1698
|
return i << 1 | i >>> 31;
|
|
1699
1699
|
}
|
|
1700
1700
|
function _i(i) {
|
|
@@ -1707,10 +1707,10 @@ function Fi(i, r, o, p) {
|
|
|
1707
1707
|
return i === 0 ? r & o | ~r & p : i === 2 ? r & o | r & p | o & p : r ^ o ^ p;
|
|
1708
1708
|
}
|
|
1709
1709
|
bt.prototype._update = function(i) {
|
|
1710
|
-
for (var r = this._w, o = this._a | 0, p = this._b | 0, u = this._c | 0, f = this._d | 0, c = this._e | 0,
|
|
1711
|
-
r[
|
|
1712
|
-
for (;
|
|
1713
|
-
r[
|
|
1710
|
+
for (var r = this._w, o = this._a | 0, p = this._b | 0, u = this._c | 0, f = this._d | 0, c = this._e | 0, a = 0; a < 16; ++a)
|
|
1711
|
+
r[a] = i.readInt32BE(a * 4);
|
|
1712
|
+
for (; a < 80; ++a)
|
|
1713
|
+
r[a] = vi(r[a - 3] ^ r[a - 8] ^ r[a - 14] ^ r[a - 16]);
|
|
1714
1714
|
for (var h = 0; h < 80; ++h) {
|
|
1715
1715
|
var g = ~~(h / 20), y = _i(o) + Fi(g, p, u, f) + c + r[h] + bi[g] | 0;
|
|
1716
1716
|
c = f, f = u, u = Ai(p), p = o, o = y;
|
|
@@ -1723,7 +1723,7 @@ bt.prototype._hash = function() {
|
|
|
1723
1723
|
};
|
|
1724
1724
|
var Bi = bt;
|
|
1725
1725
|
const Oi = /* @__PURE__ */ Xt(Bi);
|
|
1726
|
-
var Ii =
|
|
1726
|
+
var Ii = Se, Oe = Fe, ji = Kt.Buffer, Ti = [
|
|
1727
1727
|
1116352408,
|
|
1728
1728
|
1899447441,
|
|
1729
1729
|
3049323471,
|
|
@@ -1789,11 +1789,11 @@ var Ii = ve, Oe = Fe, ji = Kt.Buffer, Ti = [
|
|
|
1789
1789
|
3204031479,
|
|
1790
1790
|
3329325298
|
|
1791
1791
|
], ki = new Array(64);
|
|
1792
|
-
function
|
|
1792
|
+
function St() {
|
|
1793
1793
|
this.init(), this._w = ki, Oe.call(this, 64, 56);
|
|
1794
1794
|
}
|
|
1795
|
-
Ii(
|
|
1796
|
-
|
|
1795
|
+
Ii(St, Oe);
|
|
1796
|
+
St.prototype.init = function() {
|
|
1797
1797
|
return this._a = 1779033703, this._b = 3144134277, this._c = 1013904242, this._d = 2773480762, this._e = 1359893119, this._f = 2600822924, this._g = 528734635, this._h = 1541459225, this;
|
|
1798
1798
|
};
|
|
1799
1799
|
function Di(i, r, o) {
|
|
@@ -1814,22 +1814,22 @@ function Ni(i) {
|
|
|
1814
1814
|
function Mi(i) {
|
|
1815
1815
|
return (i >>> 17 | i << 15) ^ (i >>> 19 | i << 13) ^ i >>> 10;
|
|
1816
1816
|
}
|
|
1817
|
-
|
|
1818
|
-
for (var r = this._w, o = this._a | 0, p = this._b | 0, u = this._c | 0, f = this._d | 0, c = this._e | 0,
|
|
1817
|
+
St.prototype._update = function(i) {
|
|
1818
|
+
for (var r = this._w, o = this._a | 0, p = this._b | 0, u = this._c | 0, f = this._d | 0, c = this._e | 0, a = this._f | 0, h = this._g | 0, g = this._h | 0, y = 0; y < 16; ++y)
|
|
1819
1819
|
r[y] = i.readInt32BE(y * 4);
|
|
1820
1820
|
for (; y < 64; ++y)
|
|
1821
1821
|
r[y] = Mi(r[y - 2]) + r[y - 7] + Ni(r[y - 15]) + r[y - 16] | 0;
|
|
1822
1822
|
for (var b = 0; b < 64; ++b) {
|
|
1823
|
-
var F = g + $i(c) + Di(c,
|
|
1824
|
-
g = h, h =
|
|
1823
|
+
var F = g + $i(c) + Di(c, a, h) + Ti[b] + r[b] | 0, j = Ui(o) + Ci(o, p, u) | 0;
|
|
1824
|
+
g = h, h = a, a = c, c = f + F | 0, f = u, u = p, p = o, o = F + j | 0;
|
|
1825
1825
|
}
|
|
1826
|
-
this._a = o + this._a | 0, this._b = p + this._b | 0, this._c = u + this._c | 0, this._d = f + this._d | 0, this._e = c + this._e | 0, this._f =
|
|
1826
|
+
this._a = o + this._a | 0, this._b = p + this._b | 0, this._c = u + this._c | 0, this._d = f + this._d | 0, this._e = c + this._e | 0, this._f = a + this._f | 0, this._g = h + this._g | 0, this._h = g + this._h | 0;
|
|
1827
1827
|
};
|
|
1828
|
-
|
|
1828
|
+
St.prototype._hash = function() {
|
|
1829
1829
|
var i = ji.allocUnsafe(32);
|
|
1830
1830
|
return i.writeInt32BE(this._a, 0), i.writeInt32BE(this._b, 4), i.writeInt32BE(this._c, 8), i.writeInt32BE(this._d, 12), i.writeInt32BE(this._e, 16), i.writeInt32BE(this._f, 20), i.writeInt32BE(this._g, 24), i.writeInt32BE(this._h, 28), i;
|
|
1831
1831
|
};
|
|
1832
|
-
var Ri =
|
|
1832
|
+
var Ri = St;
|
|
1833
1833
|
const Li = /* @__PURE__ */ Xt(Ri), Gt = new Error("File system not available.");
|
|
1834
1834
|
function Pi(i, r, o) {
|
|
1835
1835
|
throw Gt;
|
|
@@ -1866,14 +1866,14 @@ function Hi(i) {
|
|
|
1866
1866
|
return r;
|
|
1867
1867
|
}
|
|
1868
1868
|
const je = async (i) => {
|
|
1869
|
-
const r = new oe(), { name: o, revision: p, documentType: u, created: f, lastModified: c } = i,
|
|
1869
|
+
const r = new oe(), { name: o, revision: p, documentType: u, created: f, lastModified: c } = i, a = {
|
|
1870
1870
|
name: o,
|
|
1871
1871
|
revision: p,
|
|
1872
1872
|
documentType: u,
|
|
1873
1873
|
created: f,
|
|
1874
1874
|
lastModified: c
|
|
1875
1875
|
};
|
|
1876
|
-
return r.file("header.json", JSON.stringify(
|
|
1876
|
+
return r.file("header.json", JSON.stringify(a, null, 2)), r.file(
|
|
1877
1877
|
"state.json",
|
|
1878
1878
|
JSON.stringify(i.initialState || {}, null, 2)
|
|
1879
1879
|
), r.file("operations.json", JSON.stringify(i.operations, null, 2)), Object.keys(i.attachments).forEach((g) => {
|
|
@@ -1909,8 +1909,8 @@ async function Vi(i, r, o) {
|
|
|
1909
1909
|
if (!p)
|
|
1910
1910
|
throw new Error("Initial state not found");
|
|
1911
1911
|
const u = await p.async("string"), f = JSON.parse(u), c = i.file("header.json");
|
|
1912
|
-
let
|
|
1913
|
-
c && (
|
|
1912
|
+
let a;
|
|
1913
|
+
c && (a = JSON.parse(await c.async("string")));
|
|
1914
1914
|
const h = i.file("operations.json");
|
|
1915
1915
|
if (!h)
|
|
1916
1916
|
throw new Error("Operations history not found");
|
|
@@ -1927,13 +1927,13 @@ async function Vi(i, r, o) {
|
|
|
1927
1927
|
g,
|
|
1928
1928
|
r,
|
|
1929
1929
|
void 0,
|
|
1930
|
-
|
|
1930
|
+
a,
|
|
1931
1931
|
{},
|
|
1932
1932
|
o
|
|
1933
1933
|
);
|
|
1934
|
-
return
|
|
1934
|
+
return a && (b = {
|
|
1935
1935
|
...b,
|
|
1936
|
-
...
|
|
1936
|
+
...a
|
|
1937
1937
|
}), b;
|
|
1938
1938
|
}
|
|
1939
1939
|
function Te(i) {
|
|
@@ -1978,10 +1978,10 @@ function ot(i) {
|
|
|
1978
1978
|
for (; o > -1; ) {
|
|
1979
1979
|
r.unshift(i[o]);
|
|
1980
1980
|
const c = (((p = i[o]) == null ? void 0 : p.index) || 0) - (((u = i[o]) == null ? void 0 : u.skip) || 0) - 1;
|
|
1981
|
-
let
|
|
1982
|
-
for (;
|
|
1983
|
-
|
|
1984
|
-
o =
|
|
1981
|
+
let a = o - 1;
|
|
1982
|
+
for (; a > -1 && (((f = i[a]) == null ? void 0 : f.index) || 0) > c; )
|
|
1983
|
+
a--;
|
|
1984
|
+
o = a;
|
|
1985
1985
|
}
|
|
1986
1986
|
return r;
|
|
1987
1987
|
}
|
|
@@ -2029,10 +2029,10 @@ function Yi(i, r) {
|
|
|
2029
2029
|
let f = !1;
|
|
2030
2030
|
for (; p.length > 0; ) {
|
|
2031
2031
|
const c = p[0];
|
|
2032
|
-
let
|
|
2033
|
-
for (;
|
|
2034
|
-
u.push(
|
|
2035
|
-
if (
|
|
2032
|
+
let a = o.shift();
|
|
2033
|
+
for (; a && Ce(a, c); )
|
|
2034
|
+
u.push(a), a = o.shift();
|
|
2035
|
+
if (a ? f || (Yt(a, c) ? (p.shift(), u.push(a)) : (o.unshift(a), f = !0)) : f = !0, f) {
|
|
2036
2036
|
let h = p.shift();
|
|
2037
2037
|
for (; h; )
|
|
2038
2038
|
u.push(h), h = p.shift();
|
|
@@ -2054,8 +2054,8 @@ function Ue(i, r) {
|
|
|
2054
2054
|
r.length
|
|
2055
2055
|
);
|
|
2056
2056
|
let c = !1;
|
|
2057
|
-
for (let
|
|
2058
|
-
const h = i[
|
|
2057
|
+
for (let a = 0; a < f; a++) {
|
|
2058
|
+
const h = i[a], g = r[a];
|
|
2059
2059
|
h && g ? !c && Yt(h, g) ? o.push(h) : (c = !0, p.push(h), u.push(g)) : h ? p.push(h) : g && u.push(g);
|
|
2060
2060
|
}
|
|
2061
2061
|
return [o, p, u];
|
|
@@ -2064,14 +2064,14 @@ function Qi(i, r, o) {
|
|
|
2064
2064
|
const [p, u, f] = Ue(
|
|
2065
2065
|
ot(i),
|
|
2066
2066
|
ot(r)
|
|
2067
|
-
), c = $t(p),
|
|
2067
|
+
), c = $t(p), a = 1 + Math.max(
|
|
2068
2068
|
c,
|
|
2069
2069
|
$t(u),
|
|
2070
2070
|
$t(f)
|
|
2071
2071
|
), h = o(
|
|
2072
2072
|
{
|
|
2073
|
-
index:
|
|
2074
|
-
skip:
|
|
2073
|
+
index: a,
|
|
2074
|
+
skip: a - (c + 1)
|
|
2075
2075
|
},
|
|
2076
2076
|
u,
|
|
2077
2077
|
f
|
|
@@ -2105,12 +2105,12 @@ const tr = (i) => Zt(
|
|
|
2105
2105
|
}, p = at(i), u = at(r), f = Zt([
|
|
2106
2106
|
...p,
|
|
2107
2107
|
...u
|
|
2108
|
-
]),
|
|
2108
|
+
]), a = (h = [...f.filter(
|
|
2109
2109
|
(g) => g.category === "MISSING_INDEX"
|
|
2110
2110
|
/* MISSING_INDEX */
|
|
2111
2111
|
)].sort((g, y) => y.operation.index - g.operation.index).pop()) == null ? void 0 : h.operation;
|
|
2112
2112
|
for (const g of u) {
|
|
2113
|
-
if (
|
|
2113
|
+
if (a && g.index >= a.index) {
|
|
2114
2114
|
o.invalidOperations.push(g);
|
|
2115
2115
|
continue;
|
|
2116
2116
|
}
|
|
@@ -2189,34 +2189,40 @@ function or(i, r) {
|
|
|
2189
2189
|
lastModified: (/* @__PURE__ */ new Date()).toISOString()
|
|
2190
2190
|
};
|
|
2191
2191
|
}
|
|
2192
|
-
function ar(i, r, o = 0) {
|
|
2192
|
+
function ar(i, r, o = 0, p = !1) {
|
|
2193
2193
|
if ([wt, Et, It].includes(r.type))
|
|
2194
2194
|
return i;
|
|
2195
|
-
const { scope:
|
|
2196
|
-
let
|
|
2195
|
+
const { scope: u } = r, f = i.operations[u].slice(), c = f.at(-1);
|
|
2196
|
+
let a = ((c == null ? void 0 : c.index) ?? -1) + 1;
|
|
2197
2197
|
if ("index" in r) {
|
|
2198
|
-
if (r.index - o >
|
|
2198
|
+
if (r.index - o > a)
|
|
2199
2199
|
throw new Error(
|
|
2200
|
-
`Missing operations: expected ${
|
|
2200
|
+
`Missing operations: expected ${a} with skip 0 or equivalent, got index ${r.index} with skip ${o}`
|
|
2201
2201
|
);
|
|
2202
|
-
|
|
2202
|
+
a = r.index;
|
|
2203
2203
|
}
|
|
2204
|
-
|
|
2204
|
+
const h = {
|
|
2205
2205
|
...r,
|
|
2206
|
-
index:
|
|
2206
|
+
index: a,
|
|
2207
2207
|
timestamp: (/* @__PURE__ */ new Date()).toISOString(),
|
|
2208
2208
|
hash: "",
|
|
2209
|
-
scope:
|
|
2209
|
+
scope: u,
|
|
2210
2210
|
skip: o,
|
|
2211
2211
|
error: void 0
|
|
2212
|
-
}
|
|
2212
|
+
};
|
|
2213
|
+
return p && (h.resultingState = i.state[u]), f.push(h), {
|
|
2213
2214
|
...i,
|
|
2214
|
-
operations: { ...i.operations, [
|
|
2215
|
+
operations: { ...i.operations, [u]: f }
|
|
2215
2216
|
};
|
|
2216
2217
|
}
|
|
2217
|
-
function sr(i, r, o = 0) {
|
|
2218
|
-
let
|
|
2219
|
-
|
|
2218
|
+
function sr(i, r, o = 0, p = !1) {
|
|
2219
|
+
let u = ar(
|
|
2220
|
+
i,
|
|
2221
|
+
r,
|
|
2222
|
+
o,
|
|
2223
|
+
p
|
|
2224
|
+
);
|
|
2225
|
+
return u = or(u, r), u;
|
|
2220
2226
|
}
|
|
2221
2227
|
function pr(i, r, o) {
|
|
2222
2228
|
switch (fe().parse(r), r.type) {
|
|
@@ -2230,7 +2236,7 @@ function pr(i, r, o) {
|
|
|
2230
2236
|
return i;
|
|
2231
2237
|
}
|
|
2232
2238
|
}
|
|
2233
|
-
function
|
|
2239
|
+
function Sr(i, r, o) {
|
|
2234
2240
|
switch (r.type) {
|
|
2235
2241
|
case wt:
|
|
2236
2242
|
return ni(i, r, o);
|
|
@@ -2241,15 +2247,15 @@ function vr(i, r, o) {
|
|
|
2241
2247
|
}
|
|
2242
2248
|
}
|
|
2243
2249
|
function cr(i, r, o, p, u = !1, f = Le) {
|
|
2244
|
-
const c = r.scope,
|
|
2245
|
-
if (!
|
|
2250
|
+
const c = r.scope, a = i.operations[c].at(-1);
|
|
2251
|
+
if (!a)
|
|
2246
2252
|
return i;
|
|
2247
2253
|
const h = Lt(
|
|
2248
2254
|
{
|
|
2249
2255
|
...i.operations,
|
|
2250
2256
|
[c]: Ne(
|
|
2251
2257
|
i.operations[c],
|
|
2252
|
-
|
|
2258
|
+
a
|
|
2253
2259
|
)
|
|
2254
2260
|
}
|
|
2255
2261
|
);
|
|
@@ -2291,13 +2297,18 @@ function Me(i, r, o, p, u = {}) {
|
|
|
2291
2297
|
const {
|
|
2292
2298
|
skip: f,
|
|
2293
2299
|
ignoreSkipOperations: c = !1,
|
|
2294
|
-
reuseHash:
|
|
2300
|
+
reuseHash: a = !1,
|
|
2295
2301
|
reuseOperationResultingState: h = !1,
|
|
2296
2302
|
operationResultingStateParser: g
|
|
2297
2303
|
} = u, y = { ...r }, b = f || 0;
|
|
2298
2304
|
let F = { ...i };
|
|
2299
2305
|
const j = !c && (b > 0 || "index" in y && y.skip > 0);
|
|
2300
|
-
return ne(y) && (F = pr(F, y, o)), F = sr(
|
|
2306
|
+
return ne(y) && (F = pr(F, y, o)), F = sr(
|
|
2307
|
+
F,
|
|
2308
|
+
y,
|
|
2309
|
+
b,
|
|
2310
|
+
h
|
|
2311
|
+
), j && (F = cr(
|
|
2301
2312
|
F,
|
|
2302
2313
|
y,
|
|
2303
2314
|
o,
|
|
@@ -2332,16 +2343,16 @@ function Me(i, r, o, p, u = {}) {
|
|
|
2332
2343
|
}), Ot(F, ($) => {
|
|
2333
2344
|
if ([wt, Et, It].includes(y.type))
|
|
2334
2345
|
return $;
|
|
2335
|
-
const q = y.scope || "global", Z =
|
|
2346
|
+
const q = y.scope || "global", Z = a && Object.prototype.hasOwnProperty.call(y, "hash") ? y.hash : Qt($, q);
|
|
2336
2347
|
$.operations[q][$.operations[q].length - 1].hash = Z, !ne(y) && y.attachments && y.attachments.forEach((w) => {
|
|
2337
|
-
const { hash: E, ...
|
|
2348
|
+
const { hash: E, ...S } = w;
|
|
2338
2349
|
$.attachments[E] = {
|
|
2339
|
-
...
|
|
2350
|
+
...S
|
|
2340
2351
|
};
|
|
2341
2352
|
});
|
|
2342
2353
|
});
|
|
2343
2354
|
}
|
|
2344
|
-
function
|
|
2355
|
+
function vr(i) {
|
|
2345
2356
|
return i.type === pi && i.skip !== void 0 && i.skip > 0 && i.hash !== void 0;
|
|
2346
2357
|
}
|
|
2347
2358
|
function _r(i) {
|
|
@@ -2408,7 +2419,7 @@ function Fr(i, r) {
|
|
|
2408
2419
|
}
|
|
2409
2420
|
if (p < 0)
|
|
2410
2421
|
throw new Error("Invalid operation index, missing operations");
|
|
2411
|
-
const
|
|
2422
|
+
const a = {
|
|
2412
2423
|
ignore: p > 0,
|
|
2413
2424
|
operation: c
|
|
2414
2425
|
}, h = c.skip > 0 ? c.skip + 1 : 0;
|
|
@@ -2416,17 +2427,17 @@ function Fr(i, r) {
|
|
|
2416
2427
|
const g = h - p;
|
|
2417
2428
|
p = p + g;
|
|
2418
2429
|
}
|
|
2419
|
-
u = c.index, f.push(
|
|
2430
|
+
u = c.index, f.push(a);
|
|
2420
2431
|
}
|
|
2421
2432
|
return f.reverse();
|
|
2422
2433
|
}
|
|
2423
2434
|
function Br(i, r, o) {
|
|
2424
|
-
const p = i.slice().sort((
|
|
2435
|
+
const p = i.slice().sort((a, h) => a.skip - h.skip).sort((a, h) => a.index - h.index);
|
|
2425
2436
|
let u = o, f = 0, c = r;
|
|
2426
|
-
for (const
|
|
2427
|
-
const h = c -
|
|
2437
|
+
for (const a of p.reverse()) {
|
|
2438
|
+
const h = c - a.index;
|
|
2428
2439
|
if (u = u - h, u > -1)
|
|
2429
|
-
f++, c =
|
|
2440
|
+
f++, c = a.index;
|
|
2430
2441
|
else
|
|
2431
2442
|
break;
|
|
2432
2443
|
}
|
|
@@ -2442,7 +2453,7 @@ function Ir(i) {
|
|
|
2442
2453
|
(r, o) => new Date(r.operation.timestamp).getTime() - new Date(o.operation.timestamp).getTime()
|
|
2443
2454
|
);
|
|
2444
2455
|
}
|
|
2445
|
-
function Pt(i, r, o, p, u, f = Me, c = {},
|
|
2456
|
+
function Pt(i, r, o, p, u, f = Me, c = {}, a) {
|
|
2446
2457
|
const h = lr(o, f);
|
|
2447
2458
|
return Re(
|
|
2448
2459
|
i,
|
|
@@ -2451,12 +2462,12 @@ function Pt(i, r, o, p, u, f = Me, c = {}, s) {
|
|
|
2451
2462
|
p,
|
|
2452
2463
|
u,
|
|
2453
2464
|
c,
|
|
2454
|
-
|
|
2465
|
+
a
|
|
2455
2466
|
);
|
|
2456
2467
|
}
|
|
2457
2468
|
function Re(i, r, o, p, u, f = {}, c) {
|
|
2458
2469
|
const {
|
|
2459
|
-
checkHashes:
|
|
2470
|
+
checkHashes: a = !0,
|
|
2460
2471
|
reuseOperationResultingState: h,
|
|
2461
2472
|
operationResultingStateParser: g = Le
|
|
2462
2473
|
} = c || {};
|
|
@@ -2467,14 +2478,14 @@ function Re(i, r, o, p, u, f = {}, c) {
|
|
|
2467
2478
|
};
|
|
2468
2479
|
if (h)
|
|
2469
2480
|
for (const [w, E] of Object.entries(r)) {
|
|
2470
|
-
const
|
|
2481
|
+
const S = E.findLastIndex(
|
|
2471
2482
|
(H) => !!H.resultingState
|
|
2472
2483
|
);
|
|
2473
|
-
if (
|
|
2484
|
+
if (S < 0) {
|
|
2474
2485
|
b.push(...E);
|
|
2475
2486
|
continue;
|
|
2476
2487
|
}
|
|
2477
|
-
const R = E[
|
|
2488
|
+
const R = E[S];
|
|
2478
2489
|
try {
|
|
2479
2490
|
const H = g(
|
|
2480
2491
|
// eslint-disable-next-line @typescript-eslint/no-non-null-assertion, @typescript-eslint/no-unnecessary-type-assertion
|
|
@@ -2488,8 +2499,8 @@ function Re(i, r, o, p, u, f = {}, c) {
|
|
|
2488
2499
|
[w]: H
|
|
2489
2500
|
}
|
|
2490
2501
|
}, F[w].push(
|
|
2491
|
-
...E.slice(0,
|
|
2492
|
-
), b.push(...E.slice(
|
|
2502
|
+
...E.slice(0, S + 1)
|
|
2503
|
+
), b.push(...E.slice(S + 1));
|
|
2493
2504
|
} catch {
|
|
2494
2505
|
b.push(...E);
|
|
2495
2506
|
}
|
|
@@ -2501,14 +2512,14 @@ function Re(i, r, o, p, u, f = {}, c) {
|
|
|
2501
2512
|
const $ = b.reduce((w, E) => o(w, E, p, {
|
|
2502
2513
|
skip: E.skip,
|
|
2503
2514
|
ignoreSkipOperations: !0,
|
|
2504
|
-
reuseHash: !
|
|
2515
|
+
reuseHash: !a
|
|
2505
2516
|
}), j);
|
|
2506
|
-
if (!
|
|
2517
|
+
if (!a)
|
|
2507
2518
|
for (const w of Object.keys($.state))
|
|
2508
2519
|
for (let E = b.length - 1; E >= 0; E--) {
|
|
2509
|
-
const
|
|
2510
|
-
if (
|
|
2511
|
-
if (
|
|
2520
|
+
const S = b[E];
|
|
2521
|
+
if (S.scope === w) {
|
|
2522
|
+
if (S.hash !== Qt($, w))
|
|
2512
2523
|
throw new Error(`Hash mismatch for scope ${w}`);
|
|
2513
2524
|
break;
|
|
2514
2525
|
}
|
|
@@ -2517,15 +2528,15 @@ function Re(i, r, o, p, u, f = {}, c) {
|
|
|
2517
2528
|
$.operations
|
|
2518
2529
|
).reduce(
|
|
2519
2530
|
(w, E) => {
|
|
2520
|
-
const
|
|
2531
|
+
const S = E;
|
|
2521
2532
|
return {
|
|
2522
2533
|
...w,
|
|
2523
|
-
[
|
|
2524
|
-
...$.operations[
|
|
2534
|
+
[S]: [
|
|
2535
|
+
...$.operations[S].map((R, H) => {
|
|
2525
2536
|
var W;
|
|
2526
2537
|
return {
|
|
2527
2538
|
...R,
|
|
2528
|
-
timestamp: ((W = r[
|
|
2539
|
+
timestamp: ((W = r[S][H]) == null ? void 0 : W.timestamp) ?? R.timestamp
|
|
2529
2540
|
};
|
|
2530
2541
|
})
|
|
2531
2542
|
]
|
|
@@ -2533,8 +2544,8 @@ function Re(i, r, o, p, u, f = {}, c) {
|
|
|
2533
2544
|
},
|
|
2534
2545
|
{ global: [], local: [] }
|
|
2535
2546
|
), Z = Object.values(q).reduce((w, E) => {
|
|
2536
|
-
const
|
|
2537
|
-
return (
|
|
2547
|
+
const S = E[E.length - 1];
|
|
2548
|
+
return (S == null ? void 0 : S.timestamp) > w && (w = S.timestamp), w;
|
|
2538
2549
|
}, i.lastModified);
|
|
2539
2550
|
return { ...$, operations: q, lastModified: Z };
|
|
2540
2551
|
}
|
|
@@ -2758,7 +2769,7 @@ export {
|
|
|
2758
2769
|
Or as C,
|
|
2759
2770
|
Hi as D,
|
|
2760
2771
|
Me as E,
|
|
2761
|
-
|
|
2772
|
+
Sr as F,
|
|
2762
2773
|
gr as G,
|
|
2763
2774
|
ur as a,
|
|
2764
2775
|
fr as b,
|
|
@@ -2777,7 +2788,7 @@ export {
|
|
|
2777
2788
|
wr as o,
|
|
2778
2789
|
Qt as p,
|
|
2779
2790
|
Ar as q,
|
|
2780
|
-
|
|
2791
|
+
vr as r,
|
|
2781
2792
|
Wi as s,
|
|
2782
2793
|
jr as t,
|
|
2783
2794
|
_r as u,
|