@highlight-run/rrweb 2.0.4 → 2.0.7

package/dist/record/rrweb-record-pack.js

@@ -1,664 +1,3 @@
-var rrwebRecord = (function (exports) {
-    'use strict';
-
-    var NodeType;
-    (function(NodeType2) {
-      NodeType2[NodeType2["Document"] = 0] = "Document";
-      NodeType2[NodeType2["DocumentType"] = 1] = "DocumentType";
-      NodeType2[NodeType2["Element"] = 2] = "Element";
-      NodeType2[NodeType2["Text"] = 3] = "Text";
-      NodeType2[NodeType2["CDATA"] = 4] = "CDATA";
-      NodeType2[NodeType2["Comment"] = 5] = "Comment";
-    })(NodeType || (NodeType = {}));
-
-    const DEPARTED_MIRROR_ACCESS_WARNING = "Please stop import mirror directly. Instead of that,\r\nnow you can use replayer.getMirror() to access the mirror instance of a replayer,\r\nor you can use record.mirror to access the mirror instance during recording.";
-    let _mirror = {
-      map: {},
-      getId() {
-        console.error(DEPARTED_MIRROR_ACCESS_WARNING);
-        return -1;
-      },
-      getNode() {
-        console.error(DEPARTED_MIRROR_ACCESS_WARNING);
-        return null;
-      },
-      removeNodeFromMap() {
-        console.error(DEPARTED_MIRROR_ACCESS_WARNING);
-      },
-      has() {
-        console.error(DEPARTED_MIRROR_ACCESS_WARNING);
-        return false;
-      },
-      reset() {
-        console.error(DEPARTED_MIRROR_ACCESS_WARNING);
-      }
-    };
-    if (typeof window !== "undefined" && window.Proxy && window.Reflect) {
-      _mirror = new Proxy(_mirror, {
-        get(target, prop, receiver) {
-          if (prop === "map") {
-            console.error(DEPARTED_MIRROR_ACCESS_WARNING);
-          }
-          return Reflect.get(target, prop, receiver);
-        }
-      });
-    }
-
-    /*
-     * base64-arraybuffer 1.0.1 <https://github.com/niklasvh/base64-arraybuffer>
-     * Copyright (c) 2021 Niklas von Hertzen <https://hertzen.com>
-     * Released under MIT License
-     */
-    var chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
-    // Use a lookup table to find the index.
-    var lookup = typeof Uint8Array === 'undefined' ? [] : new Uint8Array(256);
-    for (var i$1 = 0; i$1 < chars.length; i$1++) {
-        lookup[chars.charCodeAt(i$1)] = i$1;
-    }
-
-    // DEFLATE is a complex format; to read this code, you should probably check the RFC first:
-
-    // aliases for shorter compressed code (most minifers don't do this)
-    var u8 = Uint8Array, u16 = Uint16Array, u32 = Uint32Array;
-    // fixed length extra bits
-    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]);
-    // fixed distance extra bits
-    // see fleb note
-    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]);
-    // code length index map
-    var clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
-    // get base, reverse index map from extra bits
-    var freb = function (eb, start) {
-        var b = new u16(31);
-        for (var i = 0; i < 31; ++i) {
-            b[i] = start += 1 << eb[i - 1];
-        }
-        // numbers here are at max 18 bits
-        var r = new u32(b[30]);
-        for (var i = 1; i < 30; ++i) {
-            for (var j = b[i]; j < b[i + 1]; ++j) {
-                r[j] = ((j - b[i]) << 5) | i;
-            }
-        }
-        return [b, r];
-    };
-    var _a = freb(fleb, 2), fl = _a[0], revfl = _a[1];
-    // we can ignore the fact that the other numbers are wrong; they never happen anyway
-    fl[28] = 258, revfl[258] = 28;
-    var _b = freb(fdeb, 0), revfd = _b[1];
-    // map of value to reverse (assuming 16 bits)
-    var rev = new u16(32768);
-    for (var i = 0; i < 32768; ++i) {
-        // reverse table algorithm from SO
-        var x = ((i & 0xAAAA) >>> 1) | ((i & 0x5555) << 1);
-        x = ((x & 0xCCCC) >>> 2) | ((x & 0x3333) << 2);
-        x = ((x & 0xF0F0) >>> 4) | ((x & 0x0F0F) << 4);
-        rev[i] = (((x & 0xFF00) >>> 8) | ((x & 0x00FF) << 8)) >>> 1;
-    }
-    // create huffman tree from u8 "map": index -> code length for code index
-    // mb (max bits) must be at most 15
-    // TODO: optimize/split up?
-    var hMap = (function (cd, mb, r) {
-        var s = cd.length;
-        // index
-        var i = 0;
-        // u16 "map": index -> # of codes with bit length = index
-        var l = new u16(mb);
-        // length of cd must be 288 (total # of codes)
-        for (; i < s; ++i)
-            ++l[cd[i] - 1];
-        // u16 "map": index -> minimum code for bit length = index
-        var le = new u16(mb);
-        for (i = 0; i < mb; ++i) {
-            le[i] = (le[i - 1] + l[i - 1]) << 1;
-        }
-        var co;
-        if (r) {
-            // u16 "map": index -> number of actual bits, symbol for code
-            co = new u16(1 << mb);
-            // bits to remove for reverser
-            var rvb = 15 - mb;
-            for (i = 0; i < s; ++i) {
-                // ignore 0 lengths
-                if (cd[i]) {
-                    // num encoding both symbol and bits read
-                    var sv = (i << 4) | cd[i];
-                    // free bits
-                    var r_1 = mb - cd[i];
-                    // start value
-                    var v = le[cd[i] - 1]++ << r_1;
-                    // m is end value
-                    for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {
-                        // every 16 bit value starting with the code yields the same result
-                        co[rev[v] >>> rvb] = sv;
-                    }
-                }
-            }
-        }
-        else {
-            co = new u16(s);
-            for (i = 0; i < s; ++i)
-                co[i] = rev[le[cd[i] - 1]++] >>> (15 - cd[i]);
-        }
-        return co;
-    });
-    // fixed length tree
-    var flt = new u8(288);
-    for (var i = 0; i < 144; ++i)
-        flt[i] = 8;
-    for (var i = 144; i < 256; ++i)
-        flt[i] = 9;
-    for (var i = 256; i < 280; ++i)
-        flt[i] = 7;
-    for (var i = 280; i < 288; ++i)
-        flt[i] = 8;
-    // fixed distance tree
-    var fdt = new u8(32);
-    for (var i = 0; i < 32; ++i)
-        fdt[i] = 5;
-    // fixed length map
-    var flm = /*#__PURE__*/ hMap(flt, 9, 0);
-    // fixed distance map
-    var fdm = /*#__PURE__*/ hMap(fdt, 5, 0);
-    // get end of byte
-    var shft = function (p) { return ((p / 8) >> 0) + (p & 7 && 1); };
-    // typed array slice - allows garbage collector to free original reference,
-    // while being more compatible than .slice
-    var slc = function (v, s, e) {
-        if (s == null || s < 0)
-            s = 0;
-        if (e == null || e > v.length)
-            e = v.length;
-        // can't use .constructor in case user-supplied
-        var n = new (v instanceof u16 ? u16 : v instanceof u32 ? u32 : u8)(e - s);
-        n.set(v.subarray(s, e));
-        return n;
-    };
-    // starting at p, write the minimum number of bits that can hold v to d
-    var wbits = function (d, p, v) {
-        v <<= p & 7;
-        var o = (p / 8) >> 0;
-        d[o] |= v;
-        d[o + 1] |= v >>> 8;
-    };
-    // starting at p, write the minimum number of bits (>8) that can hold v to d
-    var wbits16 = function (d, p, v) {
-        v <<= p & 7;
-        var o = (p / 8) >> 0;
-        d[o] |= v;
-        d[o + 1] |= v >>> 8;
-        d[o + 2] |= v >>> 16;
-    };
-    // creates code lengths from a frequency table
-    var hTree = function (d, mb) {
-        // Need extra info to make a tree
-        var t = [];
-        for (var i = 0; i < d.length; ++i) {
-            if (d[i])
-                t.push({ s: i, f: d[i] });
-        }
-        var s = t.length;
-        var t2 = t.slice();
-        if (!s)
-            return [new u8(0), 0];
-        if (s == 1) {
-            var v = new u8(t[0].s + 1);
-            v[t[0].s] = 1;
-            return [v, 1];
-        }
-        t.sort(function (a, b) { return a.f - b.f; });
-        // after i2 reaches last ind, will be stopped
-        // freq must be greater than largest possible number of symbols
-        t.push({ s: -1, f: 25001 });
-        var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
-        t[0] = { s: -1, f: l.f + r.f, l: l, r: r };
-        // efficient algorithm from UZIP.js
-        // i0 is lookbehind, i2 is lookahead - after processing two low-freq
-        // symbols that combined have high freq, will start processing i2 (high-freq,
-        // non-composite) symbols instead
-        // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/
-        while (i1 != s - 1) {
-            l = t[t[i0].f < t[i2].f ? i0++ : i2++];
-            r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];
-            t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };
-        }
-        var maxSym = t2[0].s;
-        for (var i = 1; i < s; ++i) {
-            if (t2[i].s > maxSym)
-                maxSym = t2[i].s;
-        }
-        // code lengths
-        var tr = new u16(maxSym + 1);
-        // max bits in tree
-        var mbt = ln(t[i1 - 1], tr, 0);
-        if (mbt > mb) {
-            // more algorithms from UZIP.js
-            // TODO: find out how this code works (debt)
-            //  ind    debt
-            var i = 0, dt = 0;
-            //    left            cost
-            var lft = mbt - mb, cst = 1 << lft;
-            t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });
-            for (; i < s; ++i) {
-                var i2_1 = t2[i].s;
-                if (tr[i2_1] > mb) {
-                    dt += cst - (1 << (mbt - tr[i2_1]));
-                    tr[i2_1] = mb;
-                }
-                else
-                    break;
-            }
-            dt >>>= lft;
-            while (dt > 0) {
-                var i2_2 = t2[i].s;
-                if (tr[i2_2] < mb)
-                    dt -= 1 << (mb - tr[i2_2]++ - 1);
-                else
-                    ++i;
-            }
-            for (; i >= 0 && dt; --i) {
-                var i2_3 = t2[i].s;
-                if (tr[i2_3] == mb) {
-                    --tr[i2_3];
-                    ++dt;
-                }
-            }
-            mbt = mb;
-        }
-        return [new u8(tr), mbt];
-    };
-    // get the max length and assign length codes
-    var ln = function (n, l, d) {
-        return n.s == -1
-            ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))
-            : (l[n.s] = d);
-    };
-    // length codes generation
-    var lc = function (c) {
-        var s = c.length;
-        // Note that the semicolon was intentional
-        while (s && !c[--s])
-            ;
-        var cl = new u16(++s);
-        //  ind      num         streak
-        var cli = 0, cln = c[0], cls = 1;
-        var w = function (v) { cl[cli++] = v; };
-        for (var i = 1; i <= s; ++i) {
-            if (c[i] == cln && i != s)
-                ++cls;
-            else {
-                if (!cln && cls > 2) {
-                    for (; cls > 138; cls -= 138)
-                        w(32754);
-                    if (cls > 2) {
-                        w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);
-                        cls = 0;
-                    }
-                }
-                else if (cls > 3) {
-                    w(cln), --cls;
-                    for (; cls > 6; cls -= 6)
-                        w(8304);
-                    if (cls > 2)
-                        w(((cls - 3) << 5) | 8208), cls = 0;
-                }
-                while (cls--)
-                    w(cln);
-                cls = 1;
-                cln = c[i];
-            }
-        }
-        return [cl.subarray(0, cli), s];
-    };
-    // calculate the length of output from tree, code lengths
-    var clen = function (cf, cl) {
-        var l = 0;
-        for (var i = 0; i < cl.length; ++i)
-            l += cf[i] * cl[i];
-        return l;
-    };
-    // writes a fixed block
-    // returns the new bit pos
-    var wfblk = function (out, pos, dat) {
-        // no need to write 00 as type: TypedArray defaults to 0
-        var s = dat.length;
-        var o = shft(pos + 2);
-        out[o] = s & 255;
-        out[o + 1] = s >>> 8;
-        out[o + 2] = out[o] ^ 255;
-        out[o + 3] = out[o + 1] ^ 255;
-        for (var i = 0; i < s; ++i)
-            out[o + i + 4] = dat[i];
-        return (o + 4 + s) * 8;
-    };
-    // writes a block
-    var wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
-        wbits(out, p++, final);
-        ++lf[256];
-        var _a = hTree(lf, 15), dlt = _a[0], mlb = _a[1];
-        var _b = hTree(df, 15), ddt = _b[0], mdb = _b[1];
-        var _c = lc(dlt), lclt = _c[0], nlc = _c[1];
-        var _d = lc(ddt), lcdt = _d[0], ndc = _d[1];
-        var lcfreq = new u16(19);
-        for (var i = 0; i < lclt.length; ++i)
-            lcfreq[lclt[i] & 31]++;
-        for (var i = 0; i < lcdt.length; ++i)
-            lcfreq[lcdt[i] & 31]++;
-        var _e = hTree(lcfreq, 7), lct = _e[0], mlcb = _e[1];
-        var nlcc = 19;
-        for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
-            ;
-        var flen = (bl + 5) << 3;
-        var ftlen = clen(lf, flt) + clen(df, fdt) + eb;
-        var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + (2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18]);
-        if (flen <= ftlen && flen <= dtlen)
-            return wfblk(out, p, dat.subarray(bs, bs + bl));
-        var lm, ll, dm, dl;
-        wbits(out, p, 1 + (dtlen < ftlen)), p += 2;
-        if (dtlen < ftlen) {
-            lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;
-            var llm = hMap(lct, mlcb, 0);
-            wbits(out, p, nlc - 257);
-            wbits(out, p + 5, ndc - 1);
-            wbits(out, p + 10, nlcc - 4);
-            p += 14;
-            for (var i = 0; i < nlcc; ++i)
-                wbits(out, p + 3 * i, lct[clim[i]]);
-            p += 3 * nlcc;
-            var lcts = [lclt, lcdt];
-            for (var it = 0; it < 2; ++it) {
-                var clct = lcts[it];
-                for (var i = 0; i < clct.length; ++i) {
-                    var len = clct[i] & 31;
-                    wbits(out, p, llm[len]), p += lct[len];
-                    if (len > 15)
-                        wbits(out, p, (clct[i] >>> 5) & 127), p += clct[i] >>> 12;
-                }
-            }
-        }
-        else {
-            lm = flm, ll = flt, dm = fdm, dl = fdt;
-        }
-        for (var i = 0; i < li; ++i) {
-            if (syms[i] > 255) {
-                var len = (syms[i] >>> 18) & 31;
-                wbits16(out, p, lm[len + 257]), p += ll[len + 257];
-                if (len > 7)
-                    wbits(out, p, (syms[i] >>> 23) & 31), p += fleb[len];
-                var dst = syms[i] & 31;
-                wbits16(out, p, dm[dst]), p += dl[dst];
-                if (dst > 3)
-                    wbits16(out, p, (syms[i] >>> 5) & 8191), p += fdeb[dst];
-            }
-            else {
-                wbits16(out, p, lm[syms[i]]), p += ll[syms[i]];
-            }
-        }
-        wbits16(out, p, lm[256]);
-        return p + ll[256];
-    };
-    // deflate options (nice << 13) | chain
-    var deo = /*#__PURE__*/ new u32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);
-    // empty
-    var et = /*#__PURE__*/ new u8(0);
-    // compresses data into a raw DEFLATE buffer
-    var dflt = function (dat, lvl, plvl, pre, post, lst) {
-        var s = dat.length;
-        var o = new u8(pre + s + 5 * (1 + Math.floor(s / 7000)) + post);
-        // writing to this writes to the output buffer
-        var w = o.subarray(pre, o.length - post);
-        var pos = 0;
-        if (!lvl || s < 8) {
-            for (var i = 0; i <= s; i += 65535) {
-                // end
-                var e = i + 65535;
-                if (e < s) {
-                    // write full block
-                    pos = wfblk(w, pos, dat.subarray(i, e));
-                }
-                else {
-                    // write final block
-                    w[i] = lst;
-                    pos = wfblk(w, pos, dat.subarray(i, s));
-                }
-            }
-        }
-        else {
-            var opt = deo[lvl - 1];
-            var n = opt >>> 13, c = opt & 8191;
-            var msk_1 = (1 << plvl) - 1;
-            //    prev 2-byte val map    curr 2-byte val map
-            var prev = new u16(32768), head = new u16(msk_1 + 1);
-            var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
-            var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };
-            // 24576 is an arbitrary number of maximum symbols per block
-            // 424 buffer for last block
-            var syms = new u32(25000);
-            // length/literal freq   distance freq
-            var lf = new u16(288), df = new u16(32);
-            //  l/lcnt  exbits  index  l/lind  waitdx  bitpos
-            var lc_1 = 0, eb = 0, i = 0, li = 0, wi = 0, bs = 0;
-            for (; i < s; ++i) {
-                // hash value
-                var hv = hsh(i);
-                // index mod 32768
-                var imod = i & 32767;
-                // previous index with this value
-                var pimod = head[hv];
-                prev[imod] = pimod;
-                head[hv] = imod;
-                // We always should modify head and prev, but only add symbols if
-                // this data is not yet processed ("wait" for wait index)
-                if (wi <= i) {
-                    // bytes remaining
-                    var rem = s - i;
-                    if ((lc_1 > 7000 || li > 24576) && rem > 423) {
-                        pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
-                        li = lc_1 = eb = 0, bs = i;
-                        for (var j = 0; j < 286; ++j)
-                            lf[j] = 0;
-                        for (var j = 0; j < 30; ++j)
-                            df[j] = 0;
-                    }
-                    //  len    dist   chain
-                    var l = 2, d = 0, ch_1 = c, dif = (imod - pimod) & 32767;
-                    if (rem > 2 && hv == hsh(i - dif)) {
-                        var maxn = Math.min(n, rem) - 1;
-                        var maxd = Math.min(32767, i);
-                        // max possible length
-                        // not capped at dif because decompressors implement "rolling" index population
-                        var ml = Math.min(258, rem);
-                        while (dif <= maxd && --ch_1 && imod != pimod) {
-                            if (dat[i + l] == dat[i + l - dif]) {
-                                var nl = 0;
-                                for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)
-                                    ;
-                                if (nl > l) {
-                                    l = nl, d = dif;
-                                    // break out early when we reach "nice" (we are satisfied enough)
-                                    if (nl > maxn)
-                                        break;
-                                    // now, find the rarest 2-byte sequence within this
-                                    // length of literals and search for that instead.
-                                    // Much faster than just using the start
-                                    var mmd = Math.min(dif, nl - 2);
-                                    var md = 0;
-                                    for (var j = 0; j < mmd; ++j) {
-                                        var ti = (i - dif + j + 32768) & 32767;
-                                        var pti = prev[ti];
-                                        var cd = (ti - pti + 32768) & 32767;
-                                        if (cd > md)
-                                            md = cd, pimod = ti;
-                                    }
-                                }
-                            }
-                            // check the previous match
-                            imod = pimod, pimod = prev[imod];
-                            dif += (imod - pimod + 32768) & 32767;
-                        }
-                    }
-                    // d will be nonzero only when a match was found
-                    if (d) {
-                        // store both dist and len data in one Uint32
-                        // Make sure this is recognized as a len/dist with 28th bit (2^28)
-                        syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];
-                        var lin = revfl[l] & 31, din = revfd[d] & 31;
-                        eb += fleb[lin] + fdeb[din];
-                        ++lf[257 + lin];
-                        ++df[din];
-                        wi = i + l;
-                        ++lc_1;
-                    }
-                    else {
-                        syms[li++] = dat[i];
-                        ++lf[dat[i]];
-                    }
-                }
-            }
-            pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
-            // this is the easiest way to avoid needing to maintain state
-            if (!lst)
-                pos = wfblk(w, pos, et);
-        }
-        return slc(o, 0, pre + shft(pos) + post);
-    };
-    // Alder32
-    var adler = function () {
-        var a = 1, b = 0;
-        return {
-            p: function (d) {
-                // closures have awful performance
-                var n = a, m = b;
-                var l = d.length;
-                for (var i = 0; i != l;) {
-                    var e = Math.min(i + 5552, l);
-                    for (; i < e; ++i)
-                        n += d[i], m += n;
-                    n %= 65521, m %= 65521;
-                }
-                a = n, b = m;
-            },
-            d: function () { return ((a >>> 8) << 16 | (b & 255) << 8 | (b >>> 8)) + ((a & 255) << 23) * 2; }
-        };
-    };
-    // deflate with opts
-    var dopt = function (dat, opt, pre, post, st) {
-        return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : (12 + opt.mem), pre, post, !st);
-    };
-    // write bytes
-    var wbytes = function (d, b, v) {
-        for (; v; ++b)
-            d[b] = v, v >>>= 8;
-    };
-    // zlib header
-    var zlh = function (c, o) {
-        var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;
-        c[0] = 120, c[1] = (fl << 6) | (fl ? (32 - 2 * fl) : 1);
-    };
-    /**
-     * Compress data with Zlib
-     * @param data The data to compress
-     * @param opts The compression options
-     * @returns The zlib-compressed version of the data
-     */
-    function zlibSync(data, opts) {
-        if (opts === void 0) { opts = {}; }
-        var a = adler();
-        a.p(data);
-        var d = dopt(data, opts, 2, 4);
-        return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;
-    }
-    /**
-     * Converts a string into a Uint8Array for use with compression/decompression methods
-     * @param str The string to encode
-     * @param latin1 Whether or not to interpret the data as Latin-1. This should
-     *               not need to be true unless decoding a binary string.
-     * @returns The string encoded in UTF-8/Latin-1 binary
-     */
-    function strToU8(str, latin1) {
-        var l = str.length;
-        if (!latin1 && typeof TextEncoder != 'undefined')
-            return new TextEncoder().encode(str);
-        var ar = new u8(str.length + (str.length >>> 1));
-        var ai = 0;
-        var w = function (v) { ar[ai++] = v; };
-        for (var i = 0; i < l; ++i) {
-            if (ai + 5 > ar.length) {
-                var n = new u8(ai + 8 + ((l - i) << 1));
-                n.set(ar);
-                ar = n;
-            }
-            var c = str.charCodeAt(i);
-            if (c < 128 || latin1)
-                w(c);
-            else if (c < 2048)
-                w(192 | (c >>> 6)), w(128 | (c & 63));
-            else if (c > 55295 && c < 57344)
-                c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),
-                    w(240 | (c >>> 18)), w(128 | ((c >>> 12) & 63)), w(128 | ((c >>> 6) & 63)), w(128 | (c & 63));
-            else
-                w(224 | (c >>> 12)), w(128 | ((c >>> 6) & 63)), w(128 | (c & 63));
-        }
-        return slc(ar, 0, ai);
-    }
-    /**
-     * Converts a Uint8Array to a string
-     * @param dat The data to decode to string
-     * @param latin1 Whether or not to interpret the data as Latin-1. This should
-     *               not need to be true unless encoding to binary string.
-     * @returns The original UTF-8/Latin-1 string
-     */
-    function strFromU8(dat, latin1) {
-        var r = '';
-        if (!latin1 && typeof TextDecoder != 'undefined')
-            return new TextDecoder().decode(dat);
-        for (var i = 0; i < dat.length;) {
-            var c = dat[i++];
-            if (c < 128 || latin1)
-                r += String.fromCharCode(c);
-            else if (c < 224)
-                r += String.fromCharCode((c & 31) << 6 | (dat[i++] & 63));
-            else if (c < 240)
-                r += String.fromCharCode((c & 15) << 12 | (dat[i++] & 63) << 6 | (dat[i++] & 63));
-            else
-                c = ((c & 15) << 18 | (dat[i++] & 63) << 12 | (dat[i++] & 63) << 6 | (dat[i++] & 63)) - 65536,
-                    r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));
-        }
-        return r;
-    }
-
-    const MARK = "v1";
-
-    var __defProp = Object.defineProperty;
-    var __defProps = Object.defineProperties;
-    var __getOwnPropDescs = Object.getOwnPropertyDescriptors;
-    var __getOwnPropSymbols = Object.getOwnPropertySymbols;
-    var __hasOwnProp = Object.prototype.hasOwnProperty;
-    var __propIsEnum = Object.prototype.propertyIsEnumerable;
-    var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
-    var __spreadValues = (a, b) => {
-      for (var prop in b || (b = {}))
-        if (__hasOwnProp.call(b, prop))
-          __defNormalProp(a, prop, b[prop]);
-      if (__getOwnPropSymbols)
-        for (var prop of __getOwnPropSymbols(b)) {
-          if (__propIsEnum.call(b, prop))
-            __defNormalProp(a, prop, b[prop]);
-        }
-      return a;
-    };
-    var __spreadProps = (a, b) => __defProps(a, __getOwnPropDescs(b));
-    const pack = (event) => {
-      const _e = __spreadProps(__spreadValues({}, event), {
-        v: MARK
-      });
-      return strFromU8(zlibSync(strToU8(JSON.stringify(_e))), true);
-    };
-
-    exports.pack = pack;
-
-    Object.defineProperty(exports, '__esModule', { value: true });
-
-    return exports;
-
-})({});
+var rrwebRecord=function(er){"use strict";var sr;(function(r){r[r.Document=0]="Document",r[r.DocumentType=1]="DocumentType",r[r.Element=2]="Element",r[r.Text=3]="Text",r[r.CDATA=4]="CDATA",r[r.Comment=5]="Comment"})(sr||(sr={}));const B=`Please stop import mirror directly. Instead of that,\r
+now you can use replayer.getMirror() to access the mirror instance of a replayer,\r
+or you can use record.mirror to access the mirror instance during recording.`;let cr={map:{},getId(){return console.error(B),-1},getNode(){return console.error(B),null},removeNodeFromMap(){console.error(B)},has(){return console.error(B),!1},reset(){console.error(B)}};typeof window<"u"&&window.Proxy&&window.Reflect&&(cr=new Proxy(cr,{get(r,e,a){return e==="map"&&console.error(B),Reflect.get(r,e,a)}}));for(var Ir=(r=>(r[r.DomContentLoaded=0]="DomContentLoaded",r[r.Load=1]="Load",r[r.FullSnapshot=2]="FullSnapshot",r[r.IncrementalSnapshot=3]="IncrementalSnapshot",r[r.Meta=4]="Meta",r[r.Custom=5]="Custom",r[r.Plugin=6]="Plugin",r))(Ir||{}),xr=(r=>(r[r.Mutation=0]="Mutation",r[r.MouseMove=1]="MouseMove",r[r.MouseInteraction=2]="MouseInteraction",r[r.Scroll=3]="Scroll",r[r.ViewportResize=4]="ViewportResize",r[r.Input=5]="Input",r[r.TouchMove=6]="TouchMove",r[r.MediaInteraction=7]="MediaInteraction",r[r.StyleSheetRule=8]="StyleSheetRule",r[r.CanvasMutation=9]="CanvasMutation",r[r.Font=10]="Font",r[r.Log=11]="Log",r[r.Drag=12]="Drag",r[r.StyleDeclaration=13]="StyleDeclaration",r))(xr||{}),Er=(r=>(r[r.MouseUp=0]="MouseUp",r[r.MouseDown=1]="MouseDown",r[r.Click=2]="Click",r[r.ContextMenu=3]="ContextMenu",r[r.DblClick=4]="DblClick",r[r.Focus=5]="Focus",r[r.Blur=6]="Blur",r[r.TouchStart=7]="TouchStart",r[r.TouchMove_Departed=8]="TouchMove_Departed",r[r.TouchEnd=9]="TouchEnd",r[r.TouchCancel=10]="TouchCancel",r))(Er||{}),Lr=(r=>(r[r["2D"]=0]="2D",r[r.WebGL=1]="WebGL",r[r.WebGL2=2]="WebGL2",r))(Lr||{}),Rr=(r=>(r[r.Play=0]="Play",r[r.Pause=1]="Pause",r[r.Seeked=2]="Seeked",r[r.VolumeChange=3]="VolumeChange",r))(Rr||{}),Or=(r=>(r.Start="start",r.Pause="pause",r.Resume="resume",r.Resize="resize",r.Finish="finish",r.FullsnapshotRebuilded="fullsnapshot-rebuilded",r.LoadStylesheetStart="load-stylesheet-start",r.LoadStylesheetEnd="load-stylesheet-end",r.SkipStart="skip-start",r.SkipEnd="skip-end",r.MouseInteraction="mouse-interaction",r.EventCast="event-cast",r.CustomEvent="custom-event",r.Flush="flush",r.StateChange="state-change",r.PlayBack="play-back",r))(Or||{}),hr="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",dr=typeof Uint8Array>"u"?[]:new Uint8Array(256),Y=0;Y<hr.length;Y++)dr[hr.charCodeAt(Y)]=Y;var S=Uint8Array,w=Uint16Array,J=Uint32Array,nr=new S([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,0,0,0]),ar=new S([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,0,0]),wr=new S([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),gr=function(r,e){for(var a=new w(31),n=0;n<31;++n)a[n]=e+=1<<r[n-1];for(var o=new J(a[30]),n=1;n<30;++n)for(var t=a[n];t<a[n+1];++t)o[t]=t-a[n]<<5|n;return[a,o]},Mr=gr(nr,2),pr=Mr[0],or=Mr[1];pr[28]=258,or[258]=28;for(var Ur=gr(ar,0),yr=Ur[1],tr=new w(32768),s=0;s<32768;++s){var p=(s&43690)>>>1|(s&21845)<<1;p=(p&52428)>>>2|(p&13107)<<2,p=(p&61680)>>>4|(p&3855)<<4,tr[s]=((p&65280)>>>8|(p&255)<<8)>>>1}for(var K=function(r,e,a){for(var n=r.length,o=0,t=new w(e);o<n;++o)++t[r[o]-1];var f=new w(e);for(o=0;o<e;++o)f[o]=f[o-1]+t[o-1]<<1;var i;if(a){i=new w(1<<e);var l=15-e;for(o=0;o<n;++o)if(r[o])for(var c=o<<4|r[o],v=e-r[o],g=f[r[o]-1]++<<v,m=g|(1<<v)-1;g<=m;++g)i[tr[g]>>>l]=c}else for(i=new w(n),o=0;o<n;++o)i[o]=tr[f[r[o]-1]++]>>>15-r[o];return i},G=new S(288),s=0;s<144;++s)G[s]=8;for(var s=144;s<256;++s)G[s]=9;for(var s=256;s<280;++s)G[s]=7;for(var s=280;s<288;++s)G[s]=8;for(var Z=new S(32),s=0;s<32;++s)Z[s]=5;var zr=K(G,9,0),jr=K(Z,5,0),Cr=function(r){return(r/8>>0)+(r&7&&1)},Sr=function(r,e,a){(e==null||e<0)&&(e=0),(a==null||a>r.length)&&(a=r.length);var n=new(r instanceof w?w:r instanceof J?J:S)(a-e);return n.set(r.subarray(e,a)),n},d=function(r,e,a){a<<=e&7;var n=e/8>>0;r[n]|=a,r[n+1]|=a>>>8},H=function(r,e,a){a<<=e&7;var n=e/8>>0;r[n]|=a,r[n+1]|=a>>>8,r[n+2]|=a>>>16},vr=function(r,e){for(var a=[],n=0;n<r.length;++n)r[n]&&a.push({s:n,f:r[n]});var o=a.length,t=a.slice();if(!o)return[new S(0),0];if(o==1){var f=new S(a[0].s+1);return f[a[0].s]=1,[f,1]}a.sort(function(E,b){return E.f-b.f}),a.push({s:-1,f:25001});var i=a[0],l=a[1],c=0,v=1,g=2;for(a[0]={s:-1,f:i.f+l.f,l:i,r:l};v!=o-1;)i=a[a[c].f<a[g].f?c++:g++],l=a[c!=v&&a[c].f<a[g].f?c++:g++],a[v++]={s:-1,f:i.f+l.f,l:i,r:l};for(var m=t[0].s,n=1;n<o;++n)t[n].s>m&&(m=t[n].s);var M=new w(m+1),I=fr(a[v-1],M,0);if(I>e){var n=0,C=0,U=I-e,V=1<<U;for(t.sort(function(b,y){return M[y.s]-M[b.s]||b.f-y.f});n<o;++n){var x=t[n].s;if(M[x]>e)C+=V-(1<<I-M[x]),M[x]=e;else break}for(C>>>=U;C>0;){var N=t[n].s;M[N]<e?C-=1<<e-M[N]++-1:++n}for(;n>=0&&C;--n){var z=t[n].s;M[z]==e&&(--M[z],++C)}I=e}return[new S(M),I]},fr=function(r,e,a){return r.s==-1?Math.max(fr(r.l,e,a+1),fr(r.r,e,a+1)):e[r.s]=a},mr=function(r){for(var e=r.length;e&&!r[--e];);for(var a=new w(++e),n=0,o=r[0],t=1,f=function(l){a[n++]=l},i=1;i<=e;++i)if(r[i]==o&&i!=e)++t;else{if(!o&&t>2){for(;t>138;t-=138)f(32754);t>2&&(f(t>10?t-11<<5|28690:t-3<<5|12305),t=0)}else if(t>3){for(f(o),--t;t>6;t-=6)f(8304);t>2&&(f(t-3<<5|8208),t=0)}for(;t--;)f(o);t=1,o=r[i]}return[a.subarray(0,n),e]},Q=function(r,e){for(var a=0,n=0;n<e.length;++n)a+=r[n]*e[n];return a},$=function(r,e,a){var n=a.length,o=Cr(e+2);r[o]=n&255,r[o+1]=n>>>8,r[o+2]=r[o]^255,r[o+3]=r[o+1]^255;for(var t=0;t<n;++t)r[o+t+4]=a[t];return(o+4+n)*8},Dr=function(r,e,a,n,o,t,f,i,l,c,v){d(e,v++,a),++o[256];for(var g=vr(o,15),m=g[0],M=g[1],I=vr(t,15),C=I[0],U=I[1],V=mr(m),x=V[0],N=V[1],z=mr(C),E=z[0],b=z[1],y=new w(19),u=0;u<x.length;++u)y[x[u]&31]++;for(var u=0;u<E.length;++u)y[E[u]&31]++;for(var W=vr(y,7),k=W[0],rr=W[1],D=19;D>4&&!k[wr[D-1]];--D);var _=c+5<<3,F=Q(o,G)+Q(t,Z)+f,A=Q(o,m)+Q(t,C)+f+14+3*D+Q(y,k)+(2*y[16]+3*y[17]+7*y[18]);if(_<=F&&_<=A)return $(e,v,r.subarray(l,l+c));var L,h,P,j;if(d(e,v,1+(A<F)),v+=2,A<F){L=K(m,M,0),h=m,P=K(C,U,0),j=C;var lr=K(k,rr,0);d(e,v,N-257),d(e,v+5,b-1),d(e,v+10,D-4),v+=14;for(var u=0;u<D;++u)d(e,v+3*u,k[wr[u]]);v+=3*D;for(var R=[x,E],X=0;X<2;++X)for(var q=R[X],u=0;u<q.length;++u){var O=q[u]&31;d(e,v,lr[O]),v+=k[O],O>15&&(d(e,v,q[u]>>>5&127),v+=q[u]>>>12)}}else L=zr,h=G,P=jr,j=Z;for(var u=0;u<i;++u)if(n[u]>255){var O=n[u]>>>18&31;H(e,v,L[O+257]),v+=h[O+257],O>7&&(d(e,v,n[u]>>>23&31),v+=nr[O]);var T=n[u]&31;H(e,v,P[T]),v+=j[T],T>3&&(H(e,v,n[u]>>>5&8191),v+=ar[T])}else H(e,v,L[n[u]]),v+=h[n[u]];return H(e,v,L[256]),v+h[256]},Gr=new J([65540,131080,131088,131104,262176,1048704,1048832,2114560,2117632]),Vr=new S(0),Wr=function(r,e,a,n,o,t){var f=r.length,i=new S(n+f+5*(1+Math.floor(f/7e3))+o),l=i.subarray(n,i.length-o),c=0;if(!e||f<8)for(var v=0;v<=f;v+=65535){var g=v+65535;g<f?c=$(l,c,r.subarray(v,g)):(l[v]=t,c=$(l,c,r.subarray(v,f)))}else{for(var m=Gr[e-1],M=m>>>13,I=m&8191,C=(1<<a)-1,U=new w(32768),V=new w(C+1),x=Math.ceil(a/3),N=2*x,z=function(ir){return(r[ir]^r[ir+1]<<x^r[ir+2]<<N)&C},E=new J(25e3),b=new w(288),y=new w(32),u=0,W=0,v=0,k=0,rr=0,D=0;v<f;++v){var _=z(v),F=v&32767,A=V[_];if(U[F]=A,V[_]=F,rr<=v){var L=f-v;if((u>7e3||k>24576)&&L>423){c=Dr(r,l,0,E,b,y,W,k,D,v-D,c),k=u=W=0,D=v;for(var h=0;h<286;++h)b[h]=0;for(var h=0;h<30;++h)y[h]=0}var P=2,j=0,lr=I,R=F-A&32767;if(L>2&&_==z(v-R))for(var X=Math.min(M,L)-1,q=Math.min(32767,v),O=Math.min(258,L);R<=q&&--lr&&F!=A;){if(r[v+P]==r[v+P-R]){for(var T=0;T<O&&r[v+T]==r[v+T-R];++T);if(T>P){if(P=T,j=R,T>X)break;for(var oe=Math.min(R,T-2),kr=0,h=0;h<oe;++h){var ur=v-R+h+32768&32767,te=U[ur],Fr=ur-te+32768&32767;Fr>kr&&(kr=Fr,A=ur)}}}F=A,A=U[F],R+=F-A+32768&32767}if(j){E[k++]=268435456|or[P]<<18|yr[j];var Ar=or[P]&31,Pr=yr[j]&31;W+=nr[Ar]+ar[Pr],++b[257+Ar],++y[Pr],rr=v+P,++u}else E[k++]=r[v],++b[r[v]]}}c=Dr(r,l,t,E,b,y,W,k,D,v-D,c),t||(c=$(l,c,Vr))}return Sr(i,0,n+Cr(c)+o)},Br=function(){var r=1,e=0;return{p:function(a){for(var n=r,o=e,t=a.length,f=0;f!=t;){for(var i=Math.min(f+5552,t);f<i;++f)n+=a[f],o+=n;n%=65521,o%=65521}r=n,e=o},d:function(){return(r>>>8<<16|(e&255)<<8|e>>>8)+((r&255)<<23)*2}}},Nr=function(r,e,a,n,o){return Wr(r,e.level==null?6:e.level,e.mem==null?Math.ceil(Math.max(8,Math.min(13,Math.log(r.length)))*1.5):12+e.mem,a,n,!o)},_r=function(r,e,a){for(;a;++e)r[e]=a,a>>>=8},qr=function(r,e){var a=e.level,n=a==0?0:a<6?1:a==9?3:2;r[0]=120,r[1]=n<<6|(n?32-2*n:1)};function Jr(r,e){e===void 0&&(e={});var a=Br();a.p(r);var n=Nr(r,e,2,4);return qr(n,e),_r(n,n.length-4,a.d()),n}function Kr(r,e){var a=r.length;if(!e&&typeof TextEncoder<"u")return new TextEncoder().encode(r);for(var n=new S(r.length+(r.length>>>1)),o=0,t=function(c){n[o++]=c},f=0;f<a;++f){if(o+5>n.length){var i=new S(o+8+(a-f<<1));i.set(n),n=i}var l=r.charCodeAt(f);l<128||e?t(l):l<2048?(t(192|l>>>6),t(128|l&63)):l>55295&&l<57344?(l=65536+(l&1047552)|r.charCodeAt(++f)&1023,t(240|l>>>18),t(128|l>>>12&63),t(128|l>>>6&63),t(128|l&63)):(t(224|l>>>12),t(128|l>>>6&63),t(128|l&63))}return Sr(n,0,o)}function Hr(r,e){var a="";if(!e&&typeof TextDecoder<"u")return new TextDecoder().decode(r);for(var n=0;n<r.length;){var o=r[n++];o<128||e?a+=String.fromCharCode(o):o<224?a+=String.fromCharCode((o&31)<<6|r[n++]&63):o<240?a+=String.fromCharCode((o&15)<<12|(r[n++]&63)<<6|r[n++]&63):(o=((o&15)<<18|(r[n++]&63)<<12|(r[n++]&63)<<6|r[n++]&63)-65536,a+=String.fromCharCode(55296|o>>10,56320|o&1023))}return a}const Qr="v1";var Xr=Object.defineProperty,Yr=Object.defineProperties,Zr=Object.getOwnPropertyDescriptors,Tr=Object.getOwnPropertySymbols,$r=Object.prototype.hasOwnProperty,re=Object.prototype.propertyIsEnumerable,br=(r,e,a)=>e in r?Xr(r,e,{enumerable:!0,configurable:!0,writable:!0,value:a}):r[e]=a,ee=(r,e)=>{for(var a in e||(e={}))$r.call(e,a)&&br(r,a,e[a]);if(Tr)for(var a of Tr(e))re.call(e,a)&&br(r,a,e[a]);return r},ne=(r,e)=>Yr(r,Zr(e));const ae=r=>{const e=ne(ee({},r),{v:Qr});return Hr(Jr(Kr(JSON.stringify(e))),!0)};return er.pack=ae,Object.defineProperty(er,"__esModule",{value:!0}),er}({});