@openreplay/tracker 17.1.6 → 17.2.2

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/cjs/entry.js CHANGED
@@ -2,719 +2,6 @@
2
2
 
3
3
  Object.defineProperty(exports, '__esModule', { value: true });
4
4
 
5
- // DEFLATE is a complex format; to read this code, you should probably check the RFC first:
6
- // https://tools.ietf.org/html/rfc1951
7
- // You may also wish to take a look at the guide I made about this program:
8
- // https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad
9
- // Some of the following code is similar to that of UZIP.js:
10
- // https://github.com/photopea/UZIP.js
11
- // However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.
12
- // Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint
13
- // is better for memory in most engines (I *think*).
14
- var ch2 = {};
15
- var wk = (function (c, id, msg, transfer, cb) {
16
- var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([
17
- c + ';addEventListener("error",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'
18
- ], { type: 'text/javascript' }))));
19
- w.onmessage = function (e) {
20
- var d = e.data, ed = d.$e$;
21
- if (ed) {
22
- var err = new Error(ed[0]);
23
- err['code'] = ed[1];
24
- err.stack = ed[2];
25
- cb(err, null);
26
- }
27
- else
28
- cb(null, d);
29
- };
30
- w.postMessage(msg, transfer);
31
- return w;
32
- });
33
-
34
- // aliases for shorter compressed code (most minifers don't do this)
35
- var u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;
36
- // fixed length extra bits
37
- var fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);
38
- // fixed distance extra bits
39
- var fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);
40
- // code length index map
41
- var clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
42
- // get base, reverse index map from extra bits
43
- var freb = function (eb, start) {
44
- var b = new u16(31);
45
- for (var i = 0; i < 31; ++i) {
46
- b[i] = start += 1 << eb[i - 1];
47
- }
48
- // numbers here are at max 18 bits
49
- var r = new i32(b[30]);
50
- for (var i = 1; i < 30; ++i) {
51
- for (var j = b[i]; j < b[i + 1]; ++j) {
52
- r[j] = ((j - b[i]) << 5) | i;
53
- }
54
- }
55
- return { b: b, r: r };
56
- };
57
- var _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;
58
- // we can ignore the fact that the other numbers are wrong; they never happen anyway
59
- fl[28] = 258, revfl[258] = 28;
60
- var _b = freb(fdeb, 0), revfd = _b.r;
61
- // map of value to reverse (assuming 16 bits)
62
- var rev = new u16(32768);
63
- for (var i$1 = 0; i$1 < 32768; ++i$1) {
64
- // reverse table algorithm from SO
65
- var x$1 = ((i$1 & 0xAAAA) >> 1) | ((i$1 & 0x5555) << 1);
66
- x$1 = ((x$1 & 0xCCCC) >> 2) | ((x$1 & 0x3333) << 2);
67
- x$1 = ((x$1 & 0xF0F0) >> 4) | ((x$1 & 0x0F0F) << 4);
68
- rev[i$1] = (((x$1 & 0xFF00) >> 8) | ((x$1 & 0x00FF) << 8)) >> 1;
69
- }
70
- // create huffman tree from u8 "map": index -> code length for code index
71
- // mb (max bits) must be at most 15
72
- // TODO: optimize/split up?
73
- var hMap = (function (cd, mb, r) {
74
- var s = cd.length;
75
- // index
76
- var i = 0;
77
- // u16 "map": index -> # of codes with bit length = index
78
- var l = new u16(mb);
79
- // length of cd must be 288 (total # of codes)
80
- for (; i < s; ++i) {
81
- if (cd[i])
82
- ++l[cd[i] - 1];
83
- }
84
- // u16 "map": index -> minimum code for bit length = index
85
- var le = new u16(mb);
86
- for (i = 1; i < mb; ++i) {
87
- le[i] = (le[i - 1] + l[i - 1]) << 1;
88
- }
89
- var co;
90
- if (r) {
91
- // u16 "map": index -> number of actual bits, symbol for code
92
- co = new u16(1 << mb);
93
- // bits to remove for reverser
94
- var rvb = 15 - mb;
95
- for (i = 0; i < s; ++i) {
96
- // ignore 0 lengths
97
- if (cd[i]) {
98
- // num encoding both symbol and bits read
99
- var sv = (i << 4) | cd[i];
100
- // free bits
101
- var r_1 = mb - cd[i];
102
- // start value
103
- var v = le[cd[i] - 1]++ << r_1;
104
- // m is end value
105
- for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {
106
- // every 16 bit value starting with the code yields the same result
107
- co[rev[v] >> rvb] = sv;
108
- }
109
- }
110
- }
111
- }
112
- else {
113
- co = new u16(s);
114
- for (i = 0; i < s; ++i) {
115
- if (cd[i]) {
116
- co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);
117
- }
118
- }
119
- }
120
- return co;
121
- });
122
- // fixed length tree
123
- var flt = new u8(288);
124
- for (var i$1 = 0; i$1 < 144; ++i$1)
125
- flt[i$1] = 8;
126
- for (var i$1 = 144; i$1 < 256; ++i$1)
127
- flt[i$1] = 9;
128
- for (var i$1 = 256; i$1 < 280; ++i$1)
129
- flt[i$1] = 7;
130
- for (var i$1 = 280; i$1 < 288; ++i$1)
131
- flt[i$1] = 8;
132
- // fixed distance tree
133
- var fdt = new u8(32);
134
- for (var i$1 = 0; i$1 < 32; ++i$1)
135
- fdt[i$1] = 5;
136
- // fixed length map
137
- var flm = /*#__PURE__*/ hMap(flt, 9, 0);
138
- // fixed distance map
139
- var fdm = /*#__PURE__*/ hMap(fdt, 5, 0);
140
- // get end of byte
141
- var shft = function (p) { return ((p + 7) / 8) | 0; };
142
- // typed array slice - allows garbage collector to free original reference,
143
- // while being more compatible than .slice
144
- var slc = function (v, s, e) {
145
- if (s == null || s < 0)
146
- s = 0;
147
- if (e == null || e > v.length)
148
- e = v.length;
149
- // can't use .constructor in case user-supplied
150
- return new u8(v.subarray(s, e));
151
- };
152
- // error codes
153
- var ec = [
154
- 'unexpected EOF',
155
- 'invalid block type',
156
- 'invalid length/literal',
157
- 'invalid distance',
158
- 'stream finished',
159
- 'no stream handler',
160
- ,
161
- 'no callback',
162
- 'invalid UTF-8 data',
163
- 'extra field too long',
164
- 'date not in range 1980-2099',
165
- 'filename too long',
166
- 'stream finishing',
167
- 'invalid zip data'
168
- // determined by unknown compression method
169
- ];
170
- var err = function (ind, msg, nt) {
171
- var e = new Error(msg || ec[ind]);
172
- e.code = ind;
173
- if (Error.captureStackTrace)
174
- Error.captureStackTrace(e, err);
175
- if (!nt)
176
- throw e;
177
- return e;
178
- };
179
- // starting at p, write the minimum number of bits that can hold v to d
180
- var wbits = function (d, p, v) {
181
- v <<= p & 7;
182
- var o = (p / 8) | 0;
183
- d[o] |= v;
184
- d[o + 1] |= v >> 8;
185
- };
186
- // starting at p, write the minimum number of bits (>8) that can hold v to d
187
- var wbits16 = function (d, p, v) {
188
- v <<= p & 7;
189
- var o = (p / 8) | 0;
190
- d[o] |= v;
191
- d[o + 1] |= v >> 8;
192
- d[o + 2] |= v >> 16;
193
- };
194
- // creates code lengths from a frequency table
195
- var hTree = function (d, mb) {
196
- // Need extra info to make a tree
197
- var t = [];
198
- for (var i = 0; i < d.length; ++i) {
199
- if (d[i])
200
- t.push({ s: i, f: d[i] });
201
- }
202
- var s = t.length;
203
- var t2 = t.slice();
204
- if (!s)
205
- return { t: et, l: 0 };
206
- if (s == 1) {
207
- var v = new u8(t[0].s + 1);
208
- v[t[0].s] = 1;
209
- return { t: v, l: 1 };
210
- }
211
- t.sort(function (a, b) { return a.f - b.f; });
212
- // after i2 reaches last ind, will be stopped
213
- // freq must be greater than largest possible number of symbols
214
- t.push({ s: -1, f: 25001 });
215
- var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
216
- t[0] = { s: -1, f: l.f + r.f, l: l, r: r };
217
- // efficient algorithm from UZIP.js
218
- // i0 is lookbehind, i2 is lookahead - after processing two low-freq
219
- // symbols that combined have high freq, will start processing i2 (high-freq,
220
- // non-composite) symbols instead
221
- // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/
222
- while (i1 != s - 1) {
223
- l = t[t[i0].f < t[i2].f ? i0++ : i2++];
224
- r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];
225
- t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };
226
- }
227
- var maxSym = t2[0].s;
228
- for (var i = 1; i < s; ++i) {
229
- if (t2[i].s > maxSym)
230
- maxSym = t2[i].s;
231
- }
232
- // code lengths
233
- var tr = new u16(maxSym + 1);
234
- // max bits in tree
235
- var mbt = ln(t[i1 - 1], tr, 0);
236
- if (mbt > mb) {
237
- // more algorithms from UZIP.js
238
- // TODO: find out how this code works (debt)
239
- // ind debt
240
- var i = 0, dt = 0;
241
- // left cost
242
- var lft = mbt - mb, cst = 1 << lft;
243
- t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });
244
- for (; i < s; ++i) {
245
- var i2_1 = t2[i].s;
246
- if (tr[i2_1] > mb) {
247
- dt += cst - (1 << (mbt - tr[i2_1]));
248
- tr[i2_1] = mb;
249
- }
250
- else
251
- break;
252
- }
253
- dt >>= lft;
254
- while (dt > 0) {
255
- var i2_2 = t2[i].s;
256
- if (tr[i2_2] < mb)
257
- dt -= 1 << (mb - tr[i2_2]++ - 1);
258
- else
259
- ++i;
260
- }
261
- for (; i >= 0 && dt; --i) {
262
- var i2_3 = t2[i].s;
263
- if (tr[i2_3] == mb) {
264
- --tr[i2_3];
265
- ++dt;
266
- }
267
- }
268
- mbt = mb;
269
- }
270
- return { t: new u8(tr), l: mbt };
271
- };
272
- // get the max length and assign length codes
273
- var ln = function (n, l, d) {
274
- return n.s == -1
275
- ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))
276
- : (l[n.s] = d);
277
- };
278
- // length codes generation
279
- var lc = function (c) {
280
- var s = c.length;
281
- // Note that the semicolon was intentional
282
- while (s && !c[--s])
283
- ;
284
- var cl = new u16(++s);
285
- // ind num streak
286
- var cli = 0, cln = c[0], cls = 1;
287
- var w = function (v) { cl[cli++] = v; };
288
- for (var i = 1; i <= s; ++i) {
289
- if (c[i] == cln && i != s)
290
- ++cls;
291
- else {
292
- if (!cln && cls > 2) {
293
- for (; cls > 138; cls -= 138)
294
- w(32754);
295
- if (cls > 2) {
296
- w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);
297
- cls = 0;
298
- }
299
- }
300
- else if (cls > 3) {
301
- w(cln), --cls;
302
- for (; cls > 6; cls -= 6)
303
- w(8304);
304
- if (cls > 2)
305
- w(((cls - 3) << 5) | 8208), cls = 0;
306
- }
307
- while (cls--)
308
- w(cln);
309
- cls = 1;
310
- cln = c[i];
311
- }
312
- }
313
- return { c: cl.subarray(0, cli), n: s };
314
- };
315
- // calculate the length of output from tree, code lengths
316
- var clen = function (cf, cl) {
317
- var l = 0;
318
- for (var i = 0; i < cl.length; ++i)
319
- l += cf[i] * cl[i];
320
- return l;
321
- };
322
- // writes a fixed block
323
- // returns the new bit pos
324
- var wfblk = function (out, pos, dat) {
325
- // no need to write 00 as type: TypedArray defaults to 0
326
- var s = dat.length;
327
- var o = shft(pos + 2);
328
- out[o] = s & 255;
329
- out[o + 1] = s >> 8;
330
- out[o + 2] = out[o] ^ 255;
331
- out[o + 3] = out[o + 1] ^ 255;
332
- for (var i = 0; i < s; ++i)
333
- out[o + i + 4] = dat[i];
334
- return (o + 4 + s) * 8;
335
- };
336
- // writes a block
337
- var wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
338
- wbits(out, p++, final);
339
- ++lf[256];
340
- var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;
341
- var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;
342
- var _c = lc(dlt), lclt = _c.c, nlc = _c.n;
343
- var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;
344
- var lcfreq = new u16(19);
345
- for (var i = 0; i < lclt.length; ++i)
346
- ++lcfreq[lclt[i] & 31];
347
- for (var i = 0; i < lcdt.length; ++i)
348
- ++lcfreq[lcdt[i] & 31];
349
- var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;
350
- var nlcc = 19;
351
- for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
352
- ;
353
- var flen = (bl + 5) << 3;
354
- var ftlen = clen(lf, flt) + clen(df, fdt) + eb;
355
- var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];
356
- if (bs >= 0 && flen <= ftlen && flen <= dtlen)
357
- return wfblk(out, p, dat.subarray(bs, bs + bl));
358
- var lm, ll, dm, dl;
359
- wbits(out, p, 1 + (dtlen < ftlen)), p += 2;
360
- if (dtlen < ftlen) {
361
- lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;
362
- var llm = hMap(lct, mlcb, 0);
363
- wbits(out, p, nlc - 257);
364
- wbits(out, p + 5, ndc - 1);
365
- wbits(out, p + 10, nlcc - 4);
366
- p += 14;
367
- for (var i = 0; i < nlcc; ++i)
368
- wbits(out, p + 3 * i, lct[clim[i]]);
369
- p += 3 * nlcc;
370
- var lcts = [lclt, lcdt];
371
- for (var it = 0; it < 2; ++it) {
372
- var clct = lcts[it];
373
- for (var i = 0; i < clct.length; ++i) {
374
- var len = clct[i] & 31;
375
- wbits(out, p, llm[len]), p += lct[len];
376
- if (len > 15)
377
- wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;
378
- }
379
- }
380
- }
381
- else {
382
- lm = flm, ll = flt, dm = fdm, dl = fdt;
383
- }
384
- for (var i = 0; i < li; ++i) {
385
- var sym = syms[i];
386
- if (sym > 255) {
387
- var len = (sym >> 18) & 31;
388
- wbits16(out, p, lm[len + 257]), p += ll[len + 257];
389
- if (len > 7)
390
- wbits(out, p, (sym >> 23) & 31), p += fleb[len];
391
- var dst = sym & 31;
392
- wbits16(out, p, dm[dst]), p += dl[dst];
393
- if (dst > 3)
394
- wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];
395
- }
396
- else {
397
- wbits16(out, p, lm[sym]), p += ll[sym];
398
- }
399
- }
400
- wbits16(out, p, lm[256]);
401
- return p + ll[256];
402
- };
403
- // deflate options (nice << 13) | chain
404
- var deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);
405
- // empty
406
- var et = /*#__PURE__*/ new u8(0);
407
- // compresses data into a raw DEFLATE buffer
408
- var dflt = function (dat, lvl, plvl, pre, post, st) {
409
- var s = st.z || dat.length;
410
- var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);
411
- // writing to this writes to the output buffer
412
- var w = o.subarray(pre, o.length - post);
413
- var lst = st.l;
414
- var pos = (st.r || 0) & 7;
415
- if (lvl) {
416
- if (pos)
417
- w[0] = st.r >> 3;
418
- var opt = deo[lvl - 1];
419
- var n = opt >> 13, c = opt & 8191;
420
- var msk_1 = (1 << plvl) - 1;
421
- // prev 2-byte val map curr 2-byte val map
422
- var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);
423
- var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
424
- var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };
425
- // 24576 is an arbitrary number of maximum symbols per block
426
- // 424 buffer for last block
427
- var syms = new i32(25000);
428
- // length/literal freq distance freq
429
- var lf = new u16(288), df = new u16(32);
430
- // l/lcnt exbits index l/lind waitdx blkpos
431
- var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;
432
- for (; i + 2 < s; ++i) {
433
- // hash value
434
- var hv = hsh(i);
435
- // index mod 32768 previous index mod
436
- var imod = i & 32767, pimod = head[hv];
437
- prev[imod] = pimod;
438
- head[hv] = imod;
439
- // We always should modify head and prev, but only add symbols if
440
- // this data is not yet processed ("wait" for wait index)
441
- if (wi <= i) {
442
- // bytes remaining
443
- var rem = s - i;
444
- if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {
445
- pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
446
- li = lc_1 = eb = 0, bs = i;
447
- for (var j = 0; j < 286; ++j)
448
- lf[j] = 0;
449
- for (var j = 0; j < 30; ++j)
450
- df[j] = 0;
451
- }
452
- // len dist chain
453
- var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;
454
- if (rem > 2 && hv == hsh(i - dif)) {
455
- var maxn = Math.min(n, rem) - 1;
456
- var maxd = Math.min(32767, i);
457
- // max possible length
458
- // not capped at dif because decompressors implement "rolling" index population
459
- var ml = Math.min(258, rem);
460
- while (dif <= maxd && --ch_1 && imod != pimod) {
461
- if (dat[i + l] == dat[i + l - dif]) {
462
- var nl = 0;
463
- for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)
464
- ;
465
- if (nl > l) {
466
- l = nl, d = dif;
467
- // break out early when we reach "nice" (we are satisfied enough)
468
- if (nl > maxn)
469
- break;
470
- // now, find the rarest 2-byte sequence within this
471
- // length of literals and search for that instead.
472
- // Much faster than just using the start
473
- var mmd = Math.min(dif, nl - 2);
474
- var md = 0;
475
- for (var j = 0; j < mmd; ++j) {
476
- var ti = i - dif + j & 32767;
477
- var pti = prev[ti];
478
- var cd = ti - pti & 32767;
479
- if (cd > md)
480
- md = cd, pimod = ti;
481
- }
482
- }
483
- }
484
- // check the previous match
485
- imod = pimod, pimod = prev[imod];
486
- dif += imod - pimod & 32767;
487
- }
488
- }
489
- // d will be nonzero only when a match was found
490
- if (d) {
491
- // store both dist and len data in one int32
492
- // Make sure this is recognized as a len/dist with 28th bit (2^28)
493
- syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];
494
- var lin = revfl[l] & 31, din = revfd[d] & 31;
495
- eb += fleb[lin] + fdeb[din];
496
- ++lf[257 + lin];
497
- ++df[din];
498
- wi = i + l;
499
- ++lc_1;
500
- }
501
- else {
502
- syms[li++] = dat[i];
503
- ++lf[dat[i]];
504
- }
505
- }
506
- }
507
- for (i = Math.max(i, wi); i < s; ++i) {
508
- syms[li++] = dat[i];
509
- ++lf[dat[i]];
510
- }
511
- pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
512
- if (!lst) {
513
- st.r = (pos & 7) | w[(pos / 8) | 0] << 3;
514
- // shft(pos) now 1 less if pos & 7 != 0
515
- pos -= 7;
516
- st.h = head, st.p = prev, st.i = i, st.w = wi;
517
- }
518
- }
519
- else {
520
- for (var i = st.w || 0; i < s + lst; i += 65535) {
521
- // end
522
- var e = i + 65535;
523
- if (e >= s) {
524
- // write final block
525
- w[(pos / 8) | 0] = lst;
526
- e = s;
527
- }
528
- pos = wfblk(w, pos + 1, dat.subarray(i, e));
529
- }
530
- st.i = s;
531
- }
532
- return slc(o, 0, pre + shft(pos) + post);
533
- };
534
- // CRC32 table
535
- var crct = /*#__PURE__*/ (function () {
536
- var t = new Int32Array(256);
537
- for (var i = 0; i < 256; ++i) {
538
- var c = i, k = 9;
539
- while (--k)
540
- c = ((c & 1) && -306674912) ^ (c >>> 1);
541
- t[i] = c;
542
- }
543
- return t;
544
- })();
545
- // CRC32
546
- var crc = function () {
547
- var c = -1;
548
- return {
549
- p: function (d) {
550
- // closures have awful performance
551
- var cr = c;
552
- for (var i = 0; i < d.length; ++i)
553
- cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);
554
- c = cr;
555
- },
556
- d: function () { return ~c; }
557
- };
558
- };
559
- // deflate with opts
560
- var dopt = function (dat, opt, pre, post, st) {
561
- if (!st) {
562
- st = { l: 1 };
563
- if (opt.dictionary) {
564
- var dict = opt.dictionary.subarray(-32768);
565
- var newDat = new u8(dict.length + dat.length);
566
- newDat.set(dict);
567
- newDat.set(dat, dict.length);
568
- dat = newDat;
569
- st.w = dict.length;
570
- }
571
- }
572
- return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (12 + opt.mem), pre, post, st);
573
- };
574
- // Walmart object spread
575
- var mrg = function (a, b) {
576
- var o = {};
577
- for (var k in a)
578
- o[k] = a[k];
579
- for (var k in b)
580
- o[k] = b[k];
581
- return o;
582
- };
583
- // worker clone
584
- // This is possibly the craziest part of the entire codebase, despite how simple it may seem.
585
- // The only parameter to this function is a closure that returns an array of variables outside of the function scope.
586
- // We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.
587
- // We will return an object mapping of true variable name to value (basically, the current scope as a JS object).
588
- // The reason we can't just use the original variable names is minifiers mangling the toplevel scope.
589
- // This took me three weeks to figure out how to do.
590
- var wcln = function (fn, fnStr, td) {
591
- var dt = fn();
592
- var st = fn.toString();
593
- var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\s+/g, '').split(',');
594
- for (var i = 0; i < dt.length; ++i) {
595
- var v = dt[i], k = ks[i];
596
- if (typeof v == 'function') {
597
- fnStr += ';' + k + '=';
598
- var st_1 = v.toString();
599
- if (v.prototype) {
600
- // for global objects
601
- if (st_1.indexOf('[native code]') != -1) {
602
- var spInd = st_1.indexOf(' ', 8) + 1;
603
- fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));
604
- }
605
- else {
606
- fnStr += st_1;
607
- for (var t in v.prototype)
608
- fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();
609
- }
610
- }
611
- else
612
- fnStr += st_1;
613
- }
614
- else
615
- td[k] = v;
616
- }
617
- return fnStr;
618
- };
619
- var ch = [];
620
- // clone bufs
621
- var cbfs = function (v) {
622
- var tl = [];
623
- for (var k in v) {
624
- if (v[k].buffer) {
625
- tl.push((v[k] = new v[k].constructor(v[k])).buffer);
626
- }
627
- }
628
- return tl;
629
- };
630
- // use a worker to execute code
631
- var wrkr = function (fns, init, id, cb) {
632
- if (!ch[id]) {
633
- var fnStr = '', td_1 = {}, m = fns.length - 1;
634
- for (var i = 0; i < m; ++i)
635
- fnStr = wcln(fns[i], fnStr, td_1);
636
- ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };
637
- }
638
- var td = mrg({}, ch[id].e);
639
- return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);
640
- };
641
- var bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };
642
- // gzip extra
643
- var gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };
644
- // post buf
645
- var pbf = function (msg) { return postMessage(msg, [msg.buffer]); };
646
- // async helper
647
- var cbify = function (dat, opts, fns, init, id, cb) {
648
- var w = wrkr(fns, init, id, function (err, dat) {
649
- w.terminate();
650
- cb(err, dat);
651
- });
652
- w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);
653
- return function () { w.terminate(); };
654
- };
655
- // write bytes
656
- var wbytes = function (d, b, v) {
657
- for (; v; ++b)
658
- d[b] = v, v >>>= 8;
659
- };
660
- // gzip header
661
- var gzh = function (c, o) {
662
- var fn = o.filename;
663
- c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix
664
- if (o.mtime != 0)
665
- wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));
666
- if (fn) {
667
- c[3] = 8;
668
- for (var i = 0; i <= fn.length; ++i)
669
- c[i + 10] = fn.charCodeAt(i);
670
- }
671
- };
672
- // gzip header length
673
- var gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };
674
- /**
675
- * Compresses data with DEFLATE without any wrapper
676
- * @param data The data to compress
677
- * @param opts The compression options
678
- * @returns The deflated version of the data
679
- */
680
- function deflateSync(data, opts) {
681
- return dopt(data, opts || {}, 0, 0);
682
- }
683
- function gzip(data, opts, cb) {
684
- if (!cb)
685
- cb = opts, opts = {};
686
- if (typeof cb != 'function')
687
- err(7);
688
- return cbify(data, opts, [
689
- bDflt,
690
- gze,
691
- function () { return [gzipSync]; }
692
- ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);
693
- }
694
- /**
695
- * Compresses data with GZIP
696
- * @param data The data to compress
697
- * @param opts The compression options
698
- * @returns The gzipped version of the data
699
- */
700
- function gzipSync(data, opts) {
701
- if (!opts)
702
- opts = {};
703
- var c = crc(), l = data.length;
704
- c.p(data);
705
- var d = dopt(data, opts, gzhl(opts), 8), s = d.length;
706
- return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;
707
- }
708
- // text decoder
709
- var td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();
710
- // text decoder stream
711
- var tds = 0;
712
- try {
713
- td.decode(et, { stream: true });
714
- tds = 1;
715
- }
716
- catch (e) { }
717
-
718
5
  class StringDictionary {
719
6
  constructor() {
720
7
  this.lastTs = 0;
@@ -2435,7 +1722,7 @@ class CanvasRecorder {
2435
1722
  }, this.interval);
2436
1723
  this.intervals.set(id, int);
2437
1724
  };
2438
- this.fileExt = options.fileExt ?? 'webp';
1725
+ this.fileExt = 'webp';
2439
1726
  this.interval = 1000 / options.fps;
2440
1727
  }
2441
1728
  startTracking() {
@@ -2471,17 +1758,67 @@ class CanvasRecorder {
2471
1758
  }
2472
1759
  this.isProcessingQueue = false;
2473
1760
  }
2474
- uploadBatch(images, canvasId, createdAt) {
2475
- const formData = new FormData();
2476
- images.forEach((snapshot) => {
2477
- const blob = snapshot.data;
2478
- if (!blob)
2479
- return;
2480
- formData.append('snapshot', blob, `${createdAt}_${canvasId}_${snapshot.id}.${this.fileExt}`);
2481
- if (this.options.isDebug) {
2482
- saveImageData(blob, `${createdAt}_${canvasId}_${snapshot.id}.${this.fileExt}`);
1761
+ async uploadBatch(images, canvasId, createdAt) {
1762
+ if (this.options.isDebug) {
1763
+ const fileEntries = [];
1764
+ images.forEach((snapshot) => {
1765
+ if (!snapshot.data)
1766
+ return;
1767
+ fileEntries.push({ data: snapshot.data, name: `${createdAt}_${canvasId}_${snapshot.id}.${this.fileExt}` });
1768
+ });
1769
+ void saveArchive(fileEntries, `canvas_${canvasId}_${createdAt}`);
1770
+ return;
1771
+ }
1772
+ let formData;
1773
+ if (this.options.framesSupport) {
1774
+ // Pack frames into binary format: [uint64 LE timestamp][uint32 LE size][data] per frame
1775
+ const buffers = [];
1776
+ let totalSize = 0;
1777
+ for (const snapshot of images) {
1778
+ if (!snapshot.data)
1779
+ continue;
1780
+ const ab = await snapshot.data.arrayBuffer();
1781
+ buffers.push(ab);
1782
+ totalSize += 8 + 4 + ab.byteLength; // uint64 ts + uint32 size + data
2483
1783
  }
2484
- });
1784
+ if (totalSize === 0)
1785
+ return;
1786
+ const packed = new ArrayBuffer(totalSize);
1787
+ const view = new DataView(packed);
1788
+ const bytes = new Uint8Array(packed);
1789
+ let offset = 0;
1790
+ for (let i = 0; i < images.length; i++) {
1791
+ if (!images[i].data)
1792
+ continue;
1793
+ const ab = buffers.shift();
1794
+ const ts = images[i].id;
1795
+ // uint64 LE as two uint32 LE writes -- timestamp
1796
+ view.setUint32(offset, ts % 0x100000000, true);
1797
+ view.setUint32(offset + 4, Math.floor(ts / 0x100000000), true);
1798
+ offset += 8;
1799
+ // uint32 LE -- size
1800
+ view.setUint32(offset, ab.byteLength, true);
1801
+ offset += 4;
1802
+ // image data
1803
+ bytes.set(new Uint8Array(ab), offset);
1804
+ offset += ab.byteLength;
1805
+ }
1806
+ formData = new FormData();
1807
+ formData.append('type', 'frames');
1808
+ const fileName = `${createdAt}_${canvasId}.${this.fileExt}.frames`;
1809
+ formData.append('frames', new Blob([packed]), fileName);
1810
+ }
1811
+ else {
1812
+ // Legacy: send individual image files
1813
+ formData = new FormData();
1814
+ images.forEach((snapshot) => {
1815
+ const blob = snapshot.data;
1816
+ if (!blob)
1817
+ return;
1818
+ const name = `${createdAt}_${canvasId}_${snapshot.id}.${this.fileExt}`;
1819
+ formData.append('snapshot', blob, name);
1820
+ });
1821
+ }
2485
1822
  const initRestart = () => {
2486
1823
  this.app.debug.log('Restarting tracker; token expired');
2487
1824
  this.app.stop(false);
@@ -2575,15 +1912,80 @@ function captureSnapshot(canvas, quality = 'medium', dummy, fixedScaling = false
2575
1912
  canvas.toBlob(onBlob, imageFormat, qualityInt[quality]);
2576
1913
  }
2577
1914
  }
2578
- function saveImageData(imageDataBlob, name) {
2579
- const imageDataUrl = URL.createObjectURL(imageDataBlob);
1915
+ async function saveArchive(files, archiveName) {
1916
+ const zipBlob = await createZipBlob(files);
1917
+ const url = URL.createObjectURL(zipBlob);
2580
1918
  const link = document.createElement('a');
2581
- link.href = imageDataUrl;
2582
- link.download = name;
1919
+ link.href = url;
1920
+ link.download = `${archiveName}.zip`;
2583
1921
  link.style.display = 'none';
2584
1922
  document.body.appendChild(link);
2585
1923
  link.click();
2586
1924
  document.body.removeChild(link);
1925
+ URL.revokeObjectURL(url);
1926
+ }
1927
+ async function createZipBlob(files) {
1928
+ const parts = [];
1929
+ const centralDir = [];
1930
+ let offset = 0;
1931
+ for (const file of files) {
1932
+ const nameBytes = new TextEncoder().encode(file.name);
1933
+ const dataBytes = new Uint8Array(await file.data.arrayBuffer());
1934
+ const crc = crc32(dataBytes);
1935
+ // Local file header (30 bytes + filename)
1936
+ const local = new Uint8Array(30 + nameBytes.length);
1937
+ const lv = new DataView(local.buffer);
1938
+ lv.setUint32(0, 0x04034b50, true);
1939
+ lv.setUint16(4, 20, true);
1940
+ lv.setUint16(8, 0, true);
1941
+ lv.setUint32(14, crc, true);
1942
+ lv.setUint32(18, dataBytes.length, true);
1943
+ lv.setUint32(22, dataBytes.length, true);
1944
+ lv.setUint16(26, nameBytes.length, true);
1945
+ local.set(nameBytes, 30);
1946
+ // Central directory entry (46 bytes + filename)
1947
+ const cd = new Uint8Array(46 + nameBytes.length);
1948
+ const cv = new DataView(cd.buffer);
1949
+ cv.setUint32(0, 0x02014b50, true);
1950
+ cv.setUint16(4, 20, true);
1951
+ cv.setUint16(6, 20, true);
1952
+ cv.setUint32(16, crc, true);
1953
+ cv.setUint32(20, dataBytes.length, true);
1954
+ cv.setUint32(24, dataBytes.length, true);
1955
+ cv.setUint16(28, nameBytes.length, true);
1956
+ cv.setUint32(42, offset, true);
1957
+ cd.set(nameBytes, 46);
1958
+ parts.push(local);
1959
+ parts.push(dataBytes);
1960
+ centralDir.push(cd);
1961
+ offset += local.length + dataBytes.length;
1962
+ }
1963
+ const cdOffset = offset;
1964
+ let cdSize = 0;
1965
+ for (const entry of centralDir) {
1966
+ parts.push(entry);
1967
+ cdSize += entry.length;
1968
+ }
1969
+ // End of central directory (22 bytes)
1970
+ const eocd = new Uint8Array(22);
1971
+ const ev = new DataView(eocd.buffer);
1972
+ ev.setUint32(0, 0x06054b50, true);
1973
+ ev.setUint16(8, files.length, true);
1974
+ ev.setUint16(10, files.length, true);
1975
+ ev.setUint32(12, cdSize, true);
1976
+ ev.setUint32(16, cdOffset, true);
1977
+ parts.push(eocd);
1978
+ return new Blob(parts, { type: 'application/zip' });
1979
+ }
1980
+ function crc32(data) {
1981
+ let crc = 0xffffffff;
1982
+ for (let i = 0; i < data.length; i++) {
1983
+ crc ^= data[i];
1984
+ for (let j = 0; j < 8; j++) {
1985
+ crc = (crc >>> 1) ^ (crc & 1 ? 0xedb88320 : 0);
1986
+ }
1987
+ }
1988
+ return (crc ^ 0xffffffff) >>> 0;
2587
1989
  }
2588
1990
 
2589
1991
  const LogLevel = {
@@ -4424,7 +3826,7 @@ class App {
4424
3826
  this.stopCallbacks = [];
4425
3827
  this.commitCallbacks = [];
4426
3828
  this.activityState = ActivityState.NotActive;
4427
- this.version = '17.1.6'; // TODO: version compatability check inside each plugin.
3829
+ this.version = '17.2.2'; // TODO: version compatability check inside each plugin.
4428
3830
  this.socketMode = false;
4429
3831
  this.compressionThreshold = 24 * 1000;
4430
3832
  this.bc = null;
@@ -4832,9 +4234,7 @@ class App {
4832
4234
  });
4833
4235
  this.session.attachUpdateCallback(({ userID, metadata }) => {
4834
4236
  if (userID != null) {
4835
- if (!userID ||
4836
- typeof userID !== 'string' ||
4837
- userID.trim().length === 0) {
4237
+ if (!userID || typeof userID !== 'string' || userID.trim().length === 0) {
4838
4238
  this.debug.warn('Invalid userID (must be type string), ignoring.');
4839
4239
  return;
4840
4240
  }
@@ -5021,15 +4421,21 @@ class App {
5021
4421
  else if (data.type === 'compress') {
5022
4422
  const batch = data.batch;
5023
4423
  const batchSize = batch.byteLength;
5024
- if (batchSize > this.compressionThreshold) {
5025
- gzip(data.batch, { mtime: 0 }, (err, result) => {
5026
- if (err) {
5027
- this.debug.error('Openreplay compression error:', err);
5028
- this.worker?.postMessage({ type: 'uncompressed', batch: batch });
5029
- }
5030
- else {
5031
- this.worker?.postMessage({ type: 'compressed', batch: result });
5032
- }
4424
+ const hasCompressionAPI = 'CompressionStream' in globalThis;
4425
+ if (batchSize > this.compressionThreshold && hasCompressionAPI) {
4426
+ const blob = new Blob([batch]);
4427
+ const stream = blob.stream().pipeThrough(new CompressionStream('gzip'));
4428
+ new Response(stream)
4429
+ .arrayBuffer()
4430
+ .then((compressedBuffer) => {
4431
+ this.worker?.postMessage({
4432
+ type: 'compressed',
4433
+ batch: new Uint8Array(compressedBuffer),
4434
+ });
4435
+ })
4436
+ .catch((err) => {
4437
+ this.debug.error('Openreplay compression error:', err);
4438
+ this.worker?.postMessage({ type: 'uncompressed', batch: batch });
5033
4439
  });
5034
4440
  }
5035
4441
  else {
@@ -5548,7 +4954,7 @@ class App {
5548
4954
  delay, // derived from token
5549
4955
  sessionID, // derived from token
5550
4956
  startTimestamp, // real startTS (server time), derived from sessionID
5551
- userBrowser, userCity, userCountry, userDevice, userOS, userState, canvasEnabled, canvasQuality, canvasFPS, assistOnly: socketOnly, } = await r.json();
4957
+ userBrowser, userCity, userCountry, userDevice, userOS, userState, canvasEnabled, canvasQuality, canvasFPS, framesSupport, assistOnly: socketOnly, } = await r.json();
5552
4958
  if (typeof token !== 'string' ||
5553
4959
  typeof userUUID !== 'string' ||
5554
4960
  (typeof startTimestamp !== 'number' && typeof startTimestamp !== 'undefined') ||
@@ -5621,6 +5027,7 @@ class App {
5621
5027
  isDebug: this.options.canvas.__save_canvas_locally,
5622
5028
  fixedScaling: this.options.canvas.fixedCanvasScaling,
5623
5029
  useAnimationFrame: this.options.canvas.useAnimationFrame,
5030
+ framesSupport: !!framesSupport,
5624
5031
  });
5625
5032
  }
5626
5033
  /** --------------- COLD START BUFFER ------------------*/
@@ -6732,7 +6139,7 @@ function getUniqueSiblingClass(el) {
6732
6139
  return null;
6733
6140
  }
6734
6141
 
6735
- let e=-1;const t=t=>{addEventListener("pageshow",(n=>{n.persisted&&(e=n.timeStamp,t(n));}),true);},n=(e,t,n,i)=>{let s,o;return r=>{t.value>=0&&(r||i)&&(o=t.value-(s??0),(o||void 0===s)&&(s=t.value,t.delta=o,t.rating=((e,t)=>e>t[1]?"poor":e>t[0]?"needs-improvement":"good")(t.value,n),e(t)));}},i=e=>{requestAnimationFrame((()=>requestAnimationFrame((()=>e()))));},s=()=>{const e=performance.getEntriesByType("navigation")[0];if(e&&e.responseStart>0&&e.responseStart<performance.now())return e},o=()=>{const e=s();return e?.activationStart??0},r=(t,n=-1)=>{const i=s();let r="navigate";e>=0?r="back-forward-cache":i&&(document.prerendering||o()>0?r="prerender":document.wasDiscarded?r="restore":i.type&&(r=i.type.replace(/_/g,"-")));return {name:t,value:n,rating:"good",delta:0,entries:[],id:`v5-${Date.now()}-${Math.floor(8999999999999*Math.random())+1e12}`,navigationType:r}},c=new WeakMap;function a(e,t){return c.get(e)||c.set(e,new t),c.get(e)}class d{t;i=0;o=[];h(e){if(e.hadRecentInput)return;const t=this.o[0],n=this.o.at(-1);this.i&&t&&n&&e.startTime-n.startTime<1e3&&e.startTime-t.startTime<5e3?(this.i+=e.value,this.o.push(e)):(this.i=e.value,this.o=[e]),this.t?.(e);}}const h=(e,t,n={})=>{try{if(PerformanceObserver.supportedEntryTypes.includes(e)){const i=new PerformanceObserver((e=>{Promise.resolve().then((()=>{t(e.getEntries());}));}));return i.observe({type:e,buffered:!0,...n}),i}}catch{}},f=e=>{let t=false;return ()=>{t||(e(),t=true);}};let u=-1;const l=new Set,m=()=>"hidden"!==document.visibilityState||document.prerendering?1/0:0,p=e=>{if("hidden"===document.visibilityState){if("visibilitychange"===e.type)for(const e of l)e();isFinite(u)||(u="visibilitychange"===e.type?e.timeStamp:0,removeEventListener("prerenderingchange",p,true));}},v=()=>{if(u<0){const e=o(),n=document.prerendering?void 0:globalThis.performance.getEntriesByType("visibility-state").filter((t=>"hidden"===t.name&&t.startTime>e))[0]?.startTime;u=n??m(),addEventListener("visibilitychange",p,true),addEventListener("prerenderingchange",p,true),t((()=>{setTimeout((()=>{u=m();}));}));}return {get firstHiddenTime(){return u},onHidden(e){l.add(e);}}},g=e=>{document.prerendering?addEventListener("prerenderingchange",(()=>e()),true):e();},y=[1800,3e3],E=(e,s={})=>{g((()=>{const c=v();let a,d=r("FCP");const f=h("paint",(e=>{for(const t of e)"first-contentful-paint"===t.name&&(f.disconnect(),t.startTime<c.firstHiddenTime&&(d.value=Math.max(t.startTime-o(),0),d.entries.push(t),a(true)));}));f&&(a=n(e,d,y,s.reportAllChanges),t((t=>{d=r("FCP"),a=n(e,d,y,s.reportAllChanges),i((()=>{d.value=performance.now()-t.timeStamp,a(true);}));})));}));},b=[.1,.25],L=(e,s={})=>{const o=v();E(f((()=>{let c,f=r("CLS",0);const u=a(s,d),l=e=>{for(const t of e)u.h(t);u.i>f.value&&(f.value=u.i,f.entries=u.o,c());},m=h("layout-shift",l);m&&(c=n(e,f,b,s.reportAllChanges),o.onHidden((()=>{l(m.takeRecords()),c(true);})),t((()=>{u.i=0,f=r("CLS",0),c=n(e,f,b,s.reportAllChanges),i((()=>c()));})),setTimeout(c));})));};let P=0,T=1/0,_=0;const M=e=>{for(const t of e)t.interactionId&&(T=Math.min(T,t.interactionId),_=Math.max(_,t.interactionId),P=_?(_-T)/7+1:0);};let w;const C=()=>w?P:performance.interactionCount??0,I=()=>{"interactionCount"in performance||w||(w=h("event",M,{type:"event",buffered:true,durationThreshold:0}));};let F=0;class k{u=[];l=new Map;m;p;v(){F=C(),this.u.length=0,this.l.clear();}L(){const e=Math.min(this.u.length-1,Math.floor((C()-F)/50));return this.u[e]}h(e){if(this.m?.(e),!e.interactionId&&"first-input"!==e.entryType)return;const t=this.u.at(-1);let n=this.l.get(e.interactionId);if(n||this.u.length<10||e.duration>t.P){if(n?e.duration>n.P?(n.entries=[e],n.P=e.duration):e.duration===n.P&&e.startTime===n.entries[0].startTime&&n.entries.push(e):(n={id:e.interactionId,entries:[e],P:e.duration},this.l.set(n.id,n),this.u.push(n)),this.u.sort(((e,t)=>t.P-e.P)),this.u.length>10){const e=this.u.splice(10);for(const t of e)this.l.delete(t.id);}this.p?.(n);}}}const A=e=>{const t=globalThis.requestIdleCallback||setTimeout;"hidden"===document.visibilityState?e():(e=f(e),addEventListener("visibilitychange",e,{once:true,capture:true}),t((()=>{e(),removeEventListener("visibilitychange",e,{capture:true});})));},B=[200,500],S=(e,i={})=>{if(!globalThis.PerformanceEventTiming||!("interactionId"in PerformanceEventTiming.prototype))return;const s=v();g((()=>{I();let o,c=r("INP");const d=a(i,k),f=e=>{A((()=>{for(const t of e)d.h(t);const t=d.L();t&&t.P!==c.value&&(c.value=t.P,c.entries=t.entries,o());}));},u=h("event",f,{durationThreshold:i.durationThreshold??40});o=n(e,c,B,i.reportAllChanges),u&&(u.observe({type:"first-input",buffered:true}),s.onHidden((()=>{f(u.takeRecords()),o(true);})),t((()=>{d.v(),c=r("INP"),o=n(e,c,B,i.reportAllChanges);})));}));};class N{m;h(e){this.m?.(e);}}const q=[2500,4e3],x=(e,s={})=>{g((()=>{const c=v();let d,u=r("LCP");const l=a(s,N),m=e=>{s.reportAllChanges||(e=e.slice(-1));for(const t of e)l.h(t),t.startTime<c.firstHiddenTime&&(u.value=Math.max(t.startTime-o(),0),u.entries=[t],d());},p=h("largest-contentful-paint",m);if(p){d=n(e,u,q,s.reportAllChanges);const o=f((()=>{m(p.takeRecords()),p.disconnect(),d(true);})),c=e=>{e.isTrusted&&(A(o),removeEventListener(e.type,c,{capture:true}));};for(const e of ["keydown","click","visibilitychange"])addEventListener(e,c,{capture:true});t((t=>{u=r("LCP"),d=n(e,u,q,s.reportAllChanges),i((()=>{u.value=performance.now()-t.timeStamp,d(true);}));}));}}));},H=[800,1800],O=e=>{document.prerendering?g((()=>O(e))):"complete"!==document.readyState?addEventListener("load",(()=>O(e)),true):setTimeout(e);},$=(e,i={})=>{let c=r("TTFB"),a=n(e,c,H,i.reportAllChanges);O((()=>{const d=s();d&&(c.value=Math.max(d.responseStart-o(),0),c.entries=[d],a(true),t((()=>{c=r("TTFB",0),a=n(e,c,H,i.reportAllChanges),a(true);})));}));};
6142
+ var e,o=-1,a=function(e){addEventListener("pageshow",(function(n){n.persisted&&(o=n.timeStamp,e(n));}),true);},c=function(){var e=self.performance&&performance.getEntriesByType&&performance.getEntriesByType("navigation")[0];if(e&&e.responseStart>0&&e.responseStart<performance.now())return e},u=function(){var e=c();return e&&e.activationStart||0},f=function(e,n){var t=c(),r="navigate";o>=0?r="back-forward-cache":t&&(document.prerendering||u()>0?r="prerender":document.wasDiscarded?r="restore":t.type&&(r=t.type.replace(/_/g,"-")));return {name:e,value:void 0===n?-1:n,rating:"good",delta:0,entries:[],id:"v4-".concat(Date.now(),"-").concat(Math.floor(8999999999999*Math.random())+1e12),navigationType:r}},s=function(e,n,t){try{if(PerformanceObserver.supportedEntryTypes.includes(e)){var r=new PerformanceObserver((function(e){Promise.resolve().then((function(){n(e.getEntries());}));}));return r.observe(Object.assign({type:e,buffered:!0},t||{})),r}}catch(e){}},d=function(e,n,t,r){var i,o;return function(a){n.value>=0&&(a||r)&&((o=n.value-(i||0))||void 0===i)&&(i=n.value,n.delta=o,n.rating=function(e,n){return e>n[1]?"poor":e>n[0]?"needs-improvement":"good"}(n.value,t),e(n));}},l=function(e){requestAnimationFrame((function(){return requestAnimationFrame((function(){return e()}))}));},p=function(e){document.addEventListener("visibilitychange",(function(){"hidden"===document.visibilityState&&e();}));},v=function(e){var n=false;return function(){n||(e(),n=true);}},m=-1,h=function(){return "hidden"!==document.visibilityState||document.prerendering?1/0:0},g=function(e){"hidden"===document.visibilityState&&m>-1&&(m="visibilitychange"===e.type?e.timeStamp:0,T());},y=function(){addEventListener("visibilitychange",g,true),addEventListener("prerenderingchange",g,true);},T=function(){removeEventListener("visibilitychange",g,true),removeEventListener("prerenderingchange",g,true);},E=function(){return m<0&&(m=h(),y(),a((function(){setTimeout((function(){m=h(),y();}),0);}))),{get firstHiddenTime(){return m}}},C=function(e){document.prerendering?addEventListener("prerenderingchange",(function(){return e()}),true):e();},b=[1800,3e3],S=function(e,n){n=n||{},C((function(){var t,r=E(),i=f("FCP"),o=s("paint",(function(e){e.forEach((function(e){"first-contentful-paint"===e.name&&(o.disconnect(),e.startTime<r.firstHiddenTime&&(i.value=Math.max(e.startTime-u(),0),i.entries.push(e),t(true)));}));}));o&&(t=d(e,i,b,n.reportAllChanges),a((function(r){i=f("FCP"),t=d(e,i,b,n.reportAllChanges),l((function(){i.value=performance.now()-r.timeStamp,t(true);}));})));}));},L=[.1,.25],w=function(e,n){n=n||{},S(v((function(){var t,r=f("CLS",0),i=0,o=[],c=function(e){e.forEach((function(e){if(!e.hadRecentInput){var n=o[0],t=o[o.length-1];i&&e.startTime-t.startTime<1e3&&e.startTime-n.startTime<5e3?(i+=e.value,o.push(e)):(i=e.value,o=[e]);}})),i>r.value&&(r.value=i,r.entries=o,t());},u=s("layout-shift",c);u&&(t=d(e,r,L,n.reportAllChanges),p((function(){c(u.takeRecords()),t(true);})),a((function(){i=0,r=f("CLS",0),t=d(e,r,L,n.reportAllChanges),l((function(){return t()}));})),setTimeout(t,0));})));},A=0,I=1/0,P=0,M=function(e){e.forEach((function(e){e.interactionId&&(I=Math.min(I,e.interactionId),P=Math.max(P,e.interactionId),A=P?(P-I)/7+1:0);}));},k=function(){return e?A:performance.interactionCount||0},F=function(){"interactionCount"in performance||e||(e=s("event",M,{type:"event",buffered:true,durationThreshold:0}));},D=[],x=new Map,R=0,B=function(){var e=Math.min(D.length-1,Math.floor((k()-R)/50));return D[e]},H=[],q=function(e){if(H.forEach((function(n){return n(e)})),e.interactionId||"first-input"===e.entryType){var n=D[D.length-1],t=x.get(e.interactionId);if(t||D.length<10||e.duration>n.latency){if(t)e.duration>t.latency?(t.entries=[e],t.latency=e.duration):e.duration===t.latency&&e.startTime===t.entries[0].startTime&&t.entries.push(e);else {var r={id:e.interactionId,latency:e.duration,entries:[e]};x.set(r.id,r),D.push(r);}D.sort((function(e,n){return n.latency-e.latency})),D.length>10&&D.splice(10).forEach((function(e){return x.delete(e.id)}));}}},O=function(e){var n=self.requestIdleCallback||self.setTimeout,t=-1;return e=v(e),"hidden"===document.visibilityState?e():(t=n(e),p(e)),t},N=[200,500],j=function(e,n){"PerformanceEventTiming"in self&&"interactionId"in PerformanceEventTiming.prototype&&(n=n||{},C((function(){var t;F();var r,i=f("INP"),o=function(e){O((function(){e.forEach(q);var n=B();n&&n.latency!==i.value&&(i.value=n.latency,i.entries=n.entries,r());}));},c=s("event",o,{durationThreshold:null!==(t=n.durationThreshold)&&void 0!==t?t:40});r=d(e,i,N,n.reportAllChanges),c&&(c.observe({type:"first-input",buffered:true}),p((function(){o(c.takeRecords()),r(true);})),a((function(){R=k(),D.length=0,x.clear(),i=f("INP"),r=d(e,i,N,n.reportAllChanges);})));})));},_=[2500,4e3],z={},G=function(e,n){n=n||{},C((function(){var t,r=E(),i=f("LCP"),o=function(e){n.reportAllChanges||(e=e.slice(-1)),e.forEach((function(e){e.startTime<r.firstHiddenTime&&(i.value=Math.max(e.startTime-u(),0),i.entries=[e],t());}));},c=s("largest-contentful-paint",o);if(c){t=d(e,i,_,n.reportAllChanges);var m=v((function(){z[i.id]||(o(c.takeRecords()),c.disconnect(),z[i.id]=true,t(true));}));["keydown","click"].forEach((function(e){addEventListener(e,(function(){return O(m)}),{once:true,capture:true});})),p(m),a((function(r){i=f("LCP"),t=d(e,i,_,n.reportAllChanges),l((function(){i.value=performance.now()-r.timeStamp,z[i.id]=true,t(true);}));}));}}));},J=[800,1800],K=function e(n){document.prerendering?C((function(){return e(n)})):"complete"!==document.readyState?addEventListener("load",(function(){return e(n)}),true):setTimeout(n,0);},Q=function(e,n){n=n||{};var t=f("TTFB"),r=d(e,t,J,n.reportAllChanges);K((function(){var i=c();i&&(t.value=Math.max(i.responseStart-u(),0),t.entries=[i],r(true),a((function(){t=f("TTFB",0),(r=d(e,t,J,n.reportAllChanges))(true);})));}));};
6736
6143
 
6737
6144
  function getPaintBlocks(resources) {
6738
6145
  const paintBlocks = [];
@@ -6865,10 +6272,10 @@ function Timing (app, opts) {
6865
6272
  // onINP(): Chromium
6866
6273
  // onLCP(): Chromium, Firefox
6867
6274
  // onTTFB(): Chromium, Firefox, Safari
6868
- L(onVitalsSignal);
6869
- S(onVitalsSignal);
6870
- x(onVitalsSignal);
6871
- $(onVitalsSignal);
6275
+ w(onVitalsSignal);
6276
+ j(onVitalsSignal);
6277
+ G(onVitalsSignal);
6278
+ Q(onVitalsSignal);
6872
6279
  });
6873
6280
  app.attachStopCallback(function () {
6874
6281
  observer.disconnect();
@@ -7669,9 +7076,7 @@ class NetworkMessage {
7669
7076
  });
7670
7077
  if (!messageInfo)
7671
7078
  return null;
7672
- const gqlHeader = "application/graphql-response";
7673
- const isGraphql = messageInfo.url.includes("/graphql")
7674
- || Object.values(messageInfo.request.headers).some(v => v.includes(gqlHeader));
7079
+ const isGraphql = messageInfo.url.includes("/graphql");
7675
7080
  if (isGraphql && messageInfo.response.body && typeof messageInfo.response.body === 'string') {
7676
7081
  const isError = messageInfo.response.body.includes("errors");
7677
7082
  messageInfo.status = isError ? 400 : 200;
@@ -7977,7 +7382,6 @@ class FetchProxyHandler {
7977
7382
  this.tokenUrlMatcher = tokenUrlMatcher;
7978
7383
  }
7979
7384
  apply(target, _, argsList) {
7980
- var _a;
7981
7385
  const input = argsList[0];
7982
7386
  const init = argsList[1];
7983
7387
  if (!input ||
@@ -7993,31 +7397,6 @@ class FetchProxyHandler {
7993
7397
  }
7994
7398
  const item = new NetworkMessage(this.ignoredHeaders, this.setSessionTokenHeader, this.sanitize);
7995
7399
  this.beforeFetch(item, input, init);
7996
- const signal = (argsList[0] instanceof Request ? argsList[0].signal : undefined) ||
7997
- ((_a = argsList[1]) === null || _a === void 0 ? void 0 : _a.signal);
7998
- // guard to avoid double-send
7999
- let abortedNotified = false;
8000
- const notifyAbort = () => {
8001
- if (abortedNotified)
8002
- return;
8003
- abortedNotified = true;
8004
- item.endTime = performance.now();
8005
- item.duration = item.endTime - (item.startTime || item.endTime);
8006
- item.status = 0;
8007
- item.statusText = "Aborted";
8008
- item.readyState = 0;
8009
- const msg = item.getMessage();
8010
- if (msg)
8011
- this.sendMessage(msg);
8012
- };
8013
- if (signal) {
8014
- if (signal.aborted) {
8015
- notifyAbort();
8016
- }
8017
- else {
8018
- signal.addEventListener("abort", notifyAbort, { once: true });
8019
- }
8020
- }
8021
7400
  this.setSessionTokenHeader((name, value) => {
8022
7401
  if (this.tokenUrlMatcher !== undefined) {
8023
7402
  if (!this.tokenUrlMatcher(item.url)) {
@@ -8046,22 +7425,11 @@ class FetchProxyHandler {
8046
7425
  }
8047
7426
  });
8048
7427
  return target.apply(window, argsList)
8049
- .then(this.afterFetch(item, () => {
8050
- abortedNotified = true;
8051
- }))
7428
+ .then(this.afterFetch(item))
8052
7429
  .catch((e) => {
7430
+ // mock finally
8053
7431
  item.endTime = performance.now();
8054
7432
  item.duration = item.endTime - (item.startTime || item.endTime);
8055
- if (e && e.name === "AbortError") {
8056
- item.status = 0;
8057
- item.statusText = "Aborted";
8058
- item.readyState = 0;
8059
- if (!abortedNotified) {
8060
- const msg = item.getMessage();
8061
- if (msg)
8062
- this.sendMessage(msg);
8063
- }
8064
- }
8065
7433
  throw e;
8066
7434
  });
8067
7435
  }
@@ -8113,10 +7481,8 @@ class FetchProxyHandler {
8113
7481
  item.requestData = genStringBody(init.body);
8114
7482
  }
8115
7483
  }
8116
- afterFetch(item, onResolved) {
7484
+ afterFetch(item) {
8117
7485
  return (resp) => {
8118
- if (onResolved)
8119
- onResolved === null || onResolved === void 0 ? void 0 : onResolved();
8120
7486
  item.endTime = performance.now();
8121
7487
  item.duration = item.endTime - (item.startTime || item.endTime);
8122
7488
  item.status = resp.status;
@@ -8152,15 +7518,7 @@ class FetchProxyHandler {
8152
7518
  }
8153
7519
  })
8154
7520
  .catch((e) => {
8155
- if (e.name === "AbortError") {
8156
- item.status = 0;
8157
- item.statusText = "Aborted";
8158
- item.readyState = 0;
8159
- const msg = item.getMessage();
8160
- if (msg)
8161
- this.sendMessage(msg);
8162
- }
8163
- else {
7521
+ if (e.name !== "AbortError") {
8164
7522
  throw e;
8165
7523
  }
8166
7524
  });
@@ -9261,7 +8619,7 @@ class ConstantProperties {
9261
8619
  user_id: this.user_id,
9262
8620
  distinct_id: this.deviceId,
9263
8621
  sdk_edition: 'web',
9264
- sdk_version: '17.1.6',
8622
+ sdk_version: '17.2.2',
9265
8623
  timezone: getUTCOffsetString(),
9266
8624
  search_engine: this.searchEngine,
9267
8625
  };
@@ -9703,10 +9061,13 @@ class Batcher {
9703
9061
  body: JSON.stringify(sentBatch),
9704
9062
  })
9705
9063
  .then((response) => {
9706
- if (response.status === 403) {
9707
- this.init().then(() => {
9708
- send();
9709
- });
9064
+ if ([403, 401].includes(response.status)) {
9065
+ if (attempts < this.retryLimit) {
9066
+ return this.init().then(() => {
9067
+ send();
9068
+ });
9069
+ }
9070
+ return;
9710
9071
  }
9711
9072
  if (!response.ok) {
9712
9073
  throw new Error(`HTTP error! status: ${response.status}`);
@@ -9721,6 +9082,9 @@ class Batcher {
9721
9082
  void send();
9722
9083
  }
9723
9084
  startAutosend() {
9085
+ if (this.intervalId) {
9086
+ clearInterval(this.intervalId);
9087
+ }
9724
9088
  this.intervalId = setInterval(() => {
9725
9089
  this.flush();
9726
9090
  }, this.autosendInterval);
@@ -9769,7 +9133,9 @@ class Analytics {
9769
9133
  if (this.standalone) {
9770
9134
  return this.token;
9771
9135
  }
9772
- return this.getToken();
9136
+ else {
9137
+ return this.getToken();
9138
+ }
9773
9139
  };
9774
9140
  this._getTimestamp = () => {
9775
9141
  if (this.standalone) {
@@ -9905,7 +9271,7 @@ class API {
9905
9271
  this.signalStartIssue = (reason, missingApi) => {
9906
9272
  const doNotTrack = this.checkDoNotTrack();
9907
9273
  console.log("Tracker couldn't start due to:", JSON.stringify({
9908
- trackerVersion: '17.1.6',
9274
+ trackerVersion: '17.2.2',
9909
9275
  projectKey: this.options.projectKey,
9910
9276
  doNotTrack,
9911
9277
  reason: missingApi.length ? `missing api: ${missingApi.join(',')}` : reason,