mxdraw 0.1.21 → 0.1.25

package/dist/lib/MxModule/loadCoreCode/mxcadassembly_es5.js

@@ -1,1519 +1 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-function mxcadassemblyinit() {
-    var mxcadassembly = (function () {
-        var _scriptDir = typeof document !== 'undefined' && document.currentScript ? document.currentScript.src : undefined;
-        if (typeof __filename !== 'undefined')
-            _scriptDir = _scriptDir || __filename;
-        return (function (mxcadassembly) {
-            mxcadassembly = mxcadassembly || {};
-            var b;
-            b || (b = typeof mxcadassembly !== 'undefined' ? mxcadassembly : {});
-            var g, k;
-            b.ready = new Promise(function (a, c) { g = a; k = c; });
-            var l = Object.assign({}, b), m = "object" == typeof window, n = "function" == typeof importScripts, p = "object" == typeof process && "object" == typeof process.versions && "string" == typeof process.versions.node, q = "", r, t, u, fs, v, w;
-            if (p)
-                q = n ? xxxxx("path").dirname(q) + "/" : __dirname + "/", w = function () { v || (fs = xxxxx("fs"), v = xxxxx("path")); }, r = function (a, c) { var d = x(a); if (d)
-                    return c ? d : d.toString(); w(); a = v.normalize(a); return fs.readFileSync(a, c ? void 0 : "utf8"); }, u = function (a) { a = r(a, !0); a.buffer || (a = new Uint8Array(a)); return a; }, t = function (a, c, d) { var e = x(a); e && c(e); w(); a = v.normalize(a); fs.readFile(a, function (f, h) { f ? d(f) : c(h.buffer); }); }, 1 < process.argv.length && process.argv[1].replace(/\\/g, "/"), process.argv.slice(2), process.on("uncaughtException", function (a) {
-                    throw a;
-                }), process.on("unhandledRejection", function (a) { throw a; }), b.inspect = function () { return "[Emscripten Module object]"; };
-            else if (m || n)
-                n ? q = self.location.href : "undefined" != typeof document && document.currentScript && (q = document.currentScript.src), _scriptDir && (q = _scriptDir), q = 0 !== q.indexOf("blob:") ? q.substr(0, q.replace(/[?#].*/, "").lastIndexOf("/") + 1) : "", r = function (a) {
-                    try {
-                        var c = new XMLHttpRequest;
-                        c.open("GET", a, !1);
-                        c.send(null);
-                        return c.responseText;
-                    }
-                    catch (f) {
-                        if (a = x(a)) {
-                            c = [];
-                            for (var d = 0; d < a.length; d++) {
-                                var e = a[d];
-                                255 <
-                                    e && (aa && y("Character code " + e + " (" + String.fromCharCode(e) + ")  at offset " + d + " not in 0x00-0xFF."), e &= 255);
-                                c.push(String.fromCharCode(e));
-                            }
-                            return c.join("");
-                        }
-                        throw f;
-                    }
-                }, n && (u = function (a) { try {
-                    var c = new XMLHttpRequest;
-                    c.open("GET", a, !1);
-                    c.responseType = "arraybuffer";
-                    c.send(null);
-                    return new Uint8Array(c.response);
-                }
-                catch (d) {
-                    if (a = x(a))
-                        return a;
-                    throw d;
-                } }), t = function (a, c, d) {
-                    var e = new XMLHttpRequest;
-                    e.open("GET", a, !0);
-                    e.responseType = "arraybuffer";
-                    e.onload = function () {
-                        if (200 == e.status || 0 == e.status && e.response)
-                            c(e.response);
-                        else {
-                            var f = x(a);
-                            f ? c(f.buffer) : d();
-                        }
-                    };
-                    e.onerror = d;
-                    e.send(null);
-                };
-            b.print || console.log.bind(console);
-            var z = b.printErr || console.warn.bind(console);
-            Object.assign(b, l);
-            l = null;
-            var A;
-            b.wasmBinary && (A = b.wasmBinary);
-            var noExitRuntime = b.noExitRuntime || !0;
-            function ba() { this.buffer = new ArrayBuffer(B / 65536 * 65536); }
-            function da() {
-                this.exports = (
-                // EMSCRIPTEN_START_ASM
-                function instantiate(X) {
-                    function e(f) { f.grow = function (b) { var a = this.length; this.length = this.length + b; return a; }; f.set = function (c, d) { this[c] = d; }; f.get = function (c) { return this[c]; }; return f; }
-                    var g;
-                    var h = new Uint8Array(123);
-                    for (var c = 25; c >= 0; --c) {
-                        h[48 + c] = 52 + c;
-                        h[65 + c] = c;
-                        h[97 + c] = 26 + c;
-                    }
-                    h[43] = 62;
-                    h[47] = 63;
-                    function n(o, p, q) { var i, j, c = 0, k = p, l = q.length, m = p + (l * 3 >> 2) - (q[l - 2] == "=") - (q[l - 1] == "="); for (; c < l; c += 4) {
-                        i = h[q.charCodeAt(c + 1)];
-                        j = h[q.charCodeAt(c + 2)];
-                        o[k++] = h[q.charCodeAt(c)] << 2 | i >> 4;
-                        if (k < m)
-                            o[k++] = i << 4 | j >> 2;
-                        if (k < m)
-                            o[k++] = j << 6 | h[q.charCodeAt(c + 3)];
-                    } }
-                    function r(s) { n(g, 1024, "YAZQ"); }
-                    function V(W) {
-                        var t = W.a;
-                        var u = t.buffer;
-                        var v = new Int8Array(u);
-                        var w = new Int16Array(u);
-                        var x = new Int32Array(u);
-                        var y = new Uint8Array(u);
-                        var z = new Uint16Array(u);
-                        var A = new Uint32Array(u);
-                        var B = new Float32Array(u);
-                        var C = new Float64Array(u);
-                        var D = Math.imul;
-                        var E = Math.fround;
-                        var F = Math.abs;
-                        var G = Math.clz32;
-                        var H = Math.min;
-                        var I = Math.max;
-                        var J = Math.floor;
-                        var K = Math.ceil;
-                        var L = Math.trunc;
-                        var M = Math.sqrt;
-                        var N = W.abort;
-                        var O = NaN;
-                        var P = Infinity;
-                        var Q = W.b;
-                        var R = W.c;
-                        var S = 5244512;
-                        // EMSCRIPTEN_START_FUNCS
-                        function Z() { var a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, i = 0, j = 0, k = 0; a: {
-                            while (1) {
-                                k = S - 16 | 0;
-                                S = k;
-                                e = x[283];
-                                a = e >>> 2 | 0;
-                                b: {
-                                    if (a & 3) {
-                                        c = ((a ^ -1) & 1) + 2 | 0;
-                                        f = c << 3;
-                                        b = x[f + 1180 >> 2];
-                                        a = b + 8 | 0;
-                                        d = x[b + 8 >> 2];
-                                        f = f + 1172 | 0;
-                                        c: {
-                                            if ((d | 0) == (f | 0)) {
-                                                x[283] = ea(c) & e;
-                                                break c;
-                                            }
-                                            x[d + 12 >> 2] = f;
-                                            x[f + 8 >> 2] = d;
-                                        }
-                                        c = c << 3;
-                                        x[b + 4 >> 2] = c | 3;
-                                        b = b + c | 0;
-                                        x[b + 4 >> 2] = x[b + 4 >> 2] | 1;
-                                        break b;
-                                    }
-                                    d: {
-                                        e: {
-                                            f: {
-                                                g: {
-                                                    h: {
-                                                        i: {
-                                                            j: {
-                                                                k: {
-                                                                    h = x[285];
-                                                                    if (h >>> 0 >= 16) {
-                                                                        break k;
-                                                                    }
-                                                                    if (a) {
-                                                                        a = a << 2 & -8;
-                                                                        a = (0 - a & a) - 1 | 0;
-                                                                        b = a >>> 12 & 16;
-                                                                        c = b;
-                                                                        a = a >>> b | 0;
-                                                                        b = a >>> 5 & 8;
-                                                                        c = c | b;
-                                                                        a = a >>> b | 0;
-                                                                        b = a >>> 2 & 4;
-                                                                        c = c | b;
-                                                                        a = a >>> b | 0;
-                                                                        b = a >>> 1 & 2;
-                                                                        c = c | b;
-                                                                        a = a >>> b | 0;
-                                                                        b = a >>> 1 & 1;
-                                                                        c = (c | b) + (a >>> b | 0) | 0;
-                                                                        d = c << 3;
-                                                                        b = x[d + 1180 >> 2];
-                                                                        a = x[b + 8 >> 2];
-                                                                        d = d + 1172 | 0;
-                                                                        l: {
-                                                                            if ((a | 0) == (d | 0)) {
-                                                                                e = ea(c) & e;
-                                                                                x[283] = e;
-                                                                                break l;
-                                                                            }
-                                                                            x[a + 12 >> 2] = d;
-                                                                            x[d + 8 >> 2] = a;
-                                                                        }
-                                                                        a = b + 8 | 0;
-                                                                        x[b + 4 >> 2] = 19;
-                                                                        g = b + 16 | 0;
-                                                                        c = c << 3;
-                                                                        f = c - 16 | 0;
-                                                                        x[g + 4 >> 2] = f | 1;
-                                                                        x[b + c >> 2] = f;
-                                                                        if (h) {
-                                                                            c = h >>> 3 | 0;
-                                                                            b = (c << 3) + 1172 | 0;
-                                                                            d = x[288];
-                                                                            c = 1 << c;
-                                                                            m: {
-                                                                                if (!(c & e)) {
-                                                                                    x[283] = c | e;
-                                                                                    c = b;
-                                                                                    break m;
-                                                                                }
-                                                                                c = x[b + 8 >> 2];
-                                                                            }
-                                                                            x[b + 8 >> 2] = d;
-                                                                            x[c + 12 >> 2] = d;
-                                                                            x[d + 12 >> 2] = b;
-                                                                            x[d + 8 >> 2] = c;
-                                                                        }
-                                                                        x[288] = g;
-                                                                        x[285] = f;
-                                                                        break b;
-                                                                    }
-                                                                    j = x[284];
-                                                                    if (!j) {
-                                                                        break k;
-                                                                    }
-                                                                    a = (j & 0 - j) - 1 | 0;
-                                                                    b = a >>> 12 & 16;
-                                                                    c = b;
-                                                                    a = a >>> b | 0;
-                                                                    b = a >>> 5 & 8;
-                                                                    c = c | b;
-                                                                    a = a >>> b | 0;
-                                                                    b = a >>> 2 & 4;
-                                                                    c = c | b;
-                                                                    a = a >>> b | 0;
-                                                                    b = a >>> 1 & 2;
-                                                                    c = c | b;
-                                                                    a = a >>> b | 0;
-                                                                    b = a >>> 1 & 1;
-                                                                    b = x[((c | b) + (a >>> b | 0) << 2) + 1436 >> 2];
-                                                                    f = (x[b + 4 >> 2] & -8) - 16 | 0;
-                                                                    c = b;
-                                                                    while (1) {
-                                                                        n: {
-                                                                            a = x[c + 16 >> 2];
-                                                                            if (!a) {
-                                                                                a = x[c + 20 >> 2];
-                                                                                if (!a) {
-                                                                                    break n;
-                                                                                }
-                                                                            }
-                                                                            d = (x[a + 4 >> 2] & -8) - 16 | 0;
-                                                                            c = d >>> 0 < f >>> 0;
-                                                                            f = c ? d : f;
-                                                                            b = c ? a : b;
-                                                                            c = a;
-                                                                            continue;
-                                                                        }
-                                                                        break;
-                                                                    }
-                                                                    i = x[b + 24 >> 2];
-                                                                    d = x[b + 12 >> 2];
-                                                                    if ((d | 0) != (b | 0)) {
-                                                                        a = x[b + 8 >> 2];
-                                                                        x[a + 12 >> 2] = d;
-                                                                        x[d + 8 >> 2] = a;
-                                                                        break d;
-                                                                    }
-                                                                    c = b + 20 | 0;
-                                                                    a = x[c >> 2];
-                                                                    if (!a) {
-                                                                        a = x[b + 16 >> 2];
-                                                                        if (!a) {
-                                                                            break j;
-                                                                        }
-                                                                        c = b + 16 | 0;
-                                                                    }
-                                                                    while (1) {
-                                                                        g = c;
-                                                                        d = a;
-                                                                        c = a + 20 | 0;
-                                                                        a = x[c >> 2];
-                                                                        if (a) {
-                                                                            continue;
-                                                                        }
-                                                                        c = d + 16 | 0;
-                                                                        a = x[d + 16 >> 2];
-                                                                        if (a) {
-                                                                            continue;
-                                                                        }
-                                                                        break;
-                                                                    }
-                                                                    x[g >> 2] = 0;
-                                                                    break d;
-                                                                }
-                                                                b = x[285];
-                                                                if (b >>> 0 >= 16) {
-                                                                    a = x[288];
-                                                                    c = b - 16 | 0;
-                                                                    o: {
-                                                                        if (c >>> 0 >= 16) {
-                                                                            x[285] = c;
-                                                                            x[288] = a + 16;
-                                                                            x[a + 20 >> 2] = c | 1;
-                                                                            x[a + b >> 2] = c;
-                                                                            x[a + 4 >> 2] = 19;
-                                                                            break o;
-                                                                        }
-                                                                        x[288] = 0;
-                                                                        x[285] = 0;
-                                                                        x[a + 4 >> 2] = b | 3;
-                                                                        b = a + b | 0;
-                                                                        x[b + 4 >> 2] = x[b + 4 >> 2] | 1;
-                                                                    }
-                                                                    a = a + 8 | 0;
-                                                                    break b;
-                                                                }
-                                                                e = x[286];
-                                                                if (e >>> 0 > 16) {
-                                                                    b = e - 16 | 0;
-                                                                    x[286] = b;
-                                                                    a = x[289];
-                                                                    x[289] = a + 16;
-                                                                    x[a + 20 >> 2] = b | 1;
-                                                                    x[a + 4 >> 2] = 19;
-                                                                    a = a + 8 | 0;
-                                                                    break b;
-                                                                }
-                                                                a = 0;
-                                                                if (x[401]) {
-                                                                    b = x[403];
-                                                                }
-                                                                else {
-                                                                    x[404] = -1;
-                                                                    x[405] = -1;
-                                                                    x[402] = 4096;
-                                                                    x[403] = 4096;
-                                                                    x[401] = k + 12 & -16 ^ 1431655768;
-                                                                    x[406] = 0;
-                                                                    x[394] = 0;
-                                                                    b = 4096;
-                                                                }
-                                                                d = b + 63 | 0;
-                                                                f = 0 - b | 0;
-                                                                c = d & f;
-                                                                if (c >>> 0 <= 16) {
-                                                                    break b;
-                                                                }
-                                                                g = x[393];
-                                                                if (g) {
-                                                                    h = x[391];
-                                                                    b = h + c | 0;
-                                                                    if (b >>> 0 <= h >>> 0 | b >>> 0 > g >>> 0) {
-                                                                        break b;
-                                                                    }
-                                                                }
-                                                                if (y[1576] & 4) {
-                                                                    break g;
-                                                                }
-                                                                p: {
-                                                                    q: {
-                                                                        b = x[289];
-                                                                        if (b) {
-                                                                            a = 1580;
-                                                                            while (1) {
-                                                                                g = x[a >> 2];
-                                                                                if (g >>> 0 <= b >>> 0 & b >>> 0 < g + x[a + 4 >> 2] >>> 0) {
-                                                                                    break q;
-                                                                                }
-                                                                                a = x[a + 8 >> 2];
-                                                                                if (a) {
-                                                                                    continue;
-                                                                                }
-                                                                                break;
-                                                                            }
-                                                                        }
-                                                                        b = Y(0);
-                                                                        if ((b | 0) == -1) {
-                                                                            break h;
-                                                                        }
-                                                                        e = c;
-                                                                        a = x[402];
-                                                                        d = a - 1 | 0;
-                                                                        if (d & b) {
-                                                                            e = (c - b | 0) + (b + d & 0 - a) | 0;
-                                                                        }
-                                                                        if (e >>> 0 <= 16 | e >>> 0 > 2147483646) {
-                                                                            break h;
-                                                                        }
-                                                                        d = x[393];
-                                                                        if (d) {
-                                                                            f = x[391];
-                                                                            a = f + e | 0;
-                                                                            if (a >>> 0 <= f >>> 0 | a >>> 0 > d >>> 0) {
-                                                                                break h;
-                                                                            }
-                                                                        }
-                                                                        a = Y(e);
-                                                                        if ((a | 0) != (b | 0)) {
-                                                                            break p;
-                                                                        }
-                                                                        break f;
-                                                                    }
-                                                                    e = f & d - e;
-                                                                    if (e >>> 0 > 2147483646) {
-                                                                        break h;
-                                                                    }
-                                                                    b = Y(e);
-                                                                    if ((b | 0) == (x[a >> 2] + x[a + 4 >> 2] | 0)) {
-                                                                        break i;
-                                                                    }
-                                                                    a = b;
-                                                                }
-                                                                if (!((a | 0) == -1 | e >>> 0 >= 64)) {
-                                                                    b = x[403];
-                                                                    b = b + (63 - e | 0) & 0 - b;
-                                                                    if (b >>> 0 > 2147483646) {
-                                                                        b = a;
-                                                                        break f;
-                                                                    }
-                                                                    if ((Y(b) | 0) != -1) {
-                                                                        e = b + e | 0;
-                                                                        b = a;
-                                                                        break f;
-                                                                    }
-                                                                    Y(0 - e | 0);
-                                                                    break h;
-                                                                }
-                                                                b = a;
-                                                                if ((a | 0) != -1) {
-                                                                    break f;
-                                                                }
-                                                                break h;
-                                                            }
-                                                            d = 0;
-                                                            break d;
-                                                        }
-                                                        if ((b | 0) != -1) {
-                                                            break f;
-                                                        }
-                                                    }
-                                                    x[394] = x[394] | 4;
-                                                }
-                                                if (c >>> 0 > 2147483646) {
-                                                    break e;
-                                                }
-                                                b = Y(c);
-                                                a = Y(0);
-                                                if ((b | 0) == -1 | (a | 0) == -1 | a >>> 0 <= b >>> 0) {
-                                                    break e;
-                                                }
-                                                e = a - b | 0;
-                                                if (e >>> 0 <= 56) {
-                                                    break e;
-                                                }
-                                            }
-                                            a = x[391] + e | 0;
-                                            x[391] = a;
-                                            if (a >>> 0 > A[392]) {
-                                                x[392] = a;
-                                            }
-                                            r: {
-                                                s: {
-                                                    t: {
-                                                        f = x[289];
-                                                        if (f) {
-                                                            a = 1580;
-                                                            while (1) {
-                                                                c = x[a >> 2];
-                                                                d = x[a + 4 >> 2];
-                                                                if ((c + d | 0) == (b | 0)) {
-                                                                    break t;
-                                                                }
-                                                                a = x[a + 8 >> 2];
-                                                                if (a) {
-                                                                    continue;
-                                                                }
-                                                                break;
-                                                            }
-                                                            break s;
-                                                        }
-                                                        a = x[287];
-                                                        if (!(a >>> 0 <= b >>> 0 ? a : 0)) {
-                                                            x[287] = b;
-                                                        }
-                                                        a = 0;
-                                                        x[396] = e;
-                                                        x[395] = b;
-                                                        x[291] = -1;
-                                                        x[292] = x[401];
-                                                        x[398] = 0;
-                                                        while (1) {
-                                                            c = a << 3;
-                                                            d = c + 1172 | 0;
-                                                            x[c + 1180 >> 2] = d;
-                                                            x[c + 1184 >> 2] = d;
-                                                            a = a + 1 | 0;
-                                                            if ((a | 0) != 32) {
-                                                                continue;
-                                                            }
-                                                            break;
-                                                        }
-                                                        a = e - 40 | 0;
-                                                        c = b + 8 & 7 ? -8 - b & 7 : 0;
-                                                        e = a - c | 0;
-                                                        x[286] = e;
-                                                        c = b + c | 0;
-                                                        x[289] = c;
-                                                        x[c + 4 >> 2] = e | 1;
-                                                        x[(a + b | 0) + 4 >> 2] = 40;
-                                                        x[290] = x[405];
-                                                        break r;
-                                                    }
-                                                    if (y[a + 12 | 0] & 8 | c >>> 0 > f >>> 0 | b >>> 0 <= f >>> 0) {
-                                                        break s;
-                                                    }
-                                                    x[a + 4 >> 2] = d + e;
-                                                    a = f + 8 & 7 ? -8 - f & 7 : 0;
-                                                    b = a + f | 0;
-                                                    x[289] = b;
-                                                    c = x[286] + e | 0;
-                                                    a = c - a | 0;
-                                                    x[286] = a;
-                                                    x[b + 4 >> 2] = a | 1;
-                                                    x[(c + f | 0) + 4 >> 2] = 40;
-                                                    x[290] = x[405];
-                                                    break r;
-                                                }
-                                                if (A[287] > b >>> 0) {
-                                                    x[287] = b;
-                                                }
-                                                c = b + e | 0;
-                                                a = 1580;
-                                                u: {
-                                                    v: {
-                                                        w: {
-                                                            x: {
-                                                                y: {
-                                                                    z: {
-                                                                        while (1) {
-                                                                            if ((c | 0) != x[a >> 2]) {
-                                                                                a = x[a + 8 >> 2];
-                                                                                if (a) {
-                                                                                    continue;
-                                                                                }
-                                                                                break z;
-                                                                            }
-                                                                            break;
-                                                                        }
-                                                                        if (!(y[a + 12 | 0] & 8)) {
-                                                                            break y;
-                                                                        }
-                                                                    }
-                                                                    a = 1580;
-                                                                    while (1) {
-                                                                        c = x[a >> 2];
-                                                                        if (c >>> 0 <= f >>> 0) {
-                                                                            d = c + x[a + 4 >> 2] | 0;
-                                                                            if (d >>> 0 > f >>> 0) {
-                                                                                break x;
-                                                                            }
-                                                                        }
-                                                                        a = x[a + 8 >> 2];
-                                                                        continue;
-                                                                    }
-                                                                }
-                                                                x[a >> 2] = b;
-                                                                x[a + 4 >> 2] = x[a + 4 >> 2] + e;
-                                                                i = (b + 8 & 7 ? -8 - b & 7 : 0) + b | 0;
-                                                                x[i + 4 >> 2] = 19;
-                                                                e = c + (c + 8 & 7 ? -8 - c & 7 : 0) | 0;
-                                                                g = i + 16 | 0;
-                                                                d = e - g | 0;
-                                                                if ((e | 0) == (f | 0)) {
-                                                                    x[289] = g;
-                                                                    a = x[286] + d | 0;
-                                                                    x[286] = a;
-                                                                    x[g + 4 >> 2] = a | 1;
-                                                                    break v;
-                                                                }
-                                                                if (x[288] == (e | 0)) {
-                                                                    x[288] = g;
-                                                                    a = x[285] + d | 0;
-                                                                    x[285] = a;
-                                                                    x[g + 4 >> 2] = a | 1;
-                                                                    x[a + g >> 2] = a;
-                                                                    break v;
-                                                                }
-                                                                a = x[e + 4 >> 2];
-                                                                if ((a & 3) == 1) {
-                                                                    j = a & -8;
-                                                                    A: {
-                                                                        if (a >>> 0 <= 255) {
-                                                                            c = a >>> 3 | 0;
-                                                                            a = x[e + 8 >> 2];
-                                                                            b = x[e + 12 >> 2];
-                                                                            if ((b | 0) == (a | 0)) {
-                                                                                x[283] = x[283] & ea(c);
-                                                                                break A;
-                                                                            }
-                                                                            x[a + 12 >> 2] = b;
-                                                                            x[b + 8 >> 2] = a;
-                                                                            break A;
-                                                                        }
-                                                                        h = x[e + 24 >> 2];
-                                                                        b = x[e + 12 >> 2];
-                                                                        B: {
-                                                                            if ((e | 0) != (b | 0)) {
-                                                                                a = x[e + 8 >> 2];
-                                                                                x[a + 12 >> 2] = b;
-                                                                                x[b + 8 >> 2] = a;
-                                                                                break B;
-                                                                            }
-                                                                            C: {
-                                                                                a = e + 20 | 0;
-                                                                                f = x[a >> 2];
-                                                                                if (f) {
-                                                                                    break C;
-                                                                                }
-                                                                                a = e + 16 | 0;
-                                                                                f = x[a >> 2];
-                                                                                if (f) {
-                                                                                    break C;
-                                                                                }
-                                                                                b = 0;
-                                                                                break B;
-                                                                            }
-                                                                            while (1) {
-                                                                                c = a;
-                                                                                b = f;
-                                                                                a = b + 20 | 0;
-                                                                                f = x[a >> 2];
-                                                                                if (f) {
-                                                                                    continue;
-                                                                                }
-                                                                                a = b + 16 | 0;
-                                                                                f = x[b + 16 >> 2];
-                                                                                if (f) {
-                                                                                    continue;
-                                                                                }
-                                                                                break;
-                                                                            }
-                                                                            x[c >> 2] = 0;
-                                                                        }
-                                                                        if (!h) {
-                                                                            break A;
-                                                                        }
-                                                                        a = x[e + 28 >> 2];
-                                                                        c = (a << 2) + 1436 | 0;
-                                                                        D: {
-                                                                            if (x[c >> 2] == (e | 0)) {
-                                                                                x[c >> 2] = b;
-                                                                                if (b) {
-                                                                                    break D;
-                                                                                }
-                                                                                x[284] = x[284] & ea(a);
-                                                                                break A;
-                                                                            }
-                                                                            x[h + (x[h + 16 >> 2] == (e | 0) ? 16 : 20) >> 2] = b;
-                                                                            if (!b) {
-                                                                                break A;
-                                                                            }
-                                                                        }
-                                                                        x[b + 24 >> 2] = h;
-                                                                        a = x[e + 16 >> 2];
-                                                                        if (a) {
-                                                                            x[b + 16 >> 2] = a;
-                                                                            x[a + 24 >> 2] = b;
-                                                                        }
-                                                                        a = x[e + 20 >> 2];
-                                                                        if (!a) {
-                                                                            break A;
-                                                                        }
-                                                                        x[b + 20 >> 2] = a;
-                                                                        x[a + 24 >> 2] = b;
-                                                                    }
-                                                                    d = d + j | 0;
-                                                                    e = e + j | 0;
-                                                                }
-                                                                x[e + 4 >> 2] = x[e + 4 >> 2] & -2;
-                                                                x[g + 4 >> 2] = d | 1;
-                                                                x[d + g >> 2] = d;
-                                                                if (d >>> 0 <= 255) {
-                                                                    b = d >>> 3 | 0;
-                                                                    a = (b << 3) + 1172 | 0;
-                                                                    c = x[283];
-                                                                    b = 1 << b;
-                                                                    E: {
-                                                                        if (!(c & b)) {
-                                                                            x[283] = b | c;
-                                                                            b = a;
-                                                                            break E;
-                                                                        }
-                                                                        b = x[a + 8 >> 2];
-                                                                    }
-                                                                    x[a + 8 >> 2] = g;
-                                                                    x[b + 12 >> 2] = g;
-                                                                    x[g + 12 >> 2] = a;
-                                                                    x[g + 8 >> 2] = b;
-                                                                    break v;
-                                                                }
-                                                                a = 31;
-                                                                if (d >>> 0 <= 16777215) {
-                                                                    b = d >>> 8 | 0;
-                                                                    a = b + 1048320 >>> 16 & 8;
-                                                                    c = b << a;
-                                                                    b = c + 520192 >>> 16 & 4;
-                                                                    e = c << b;
-                                                                    c = e + 245760 >>> 16 & 2;
-                                                                    a = (e << c >>> 15 | 0) - (c | (a | b)) | 0;
-                                                                    a = (a << 1 | d >>> a + 21 & 1) + 28 | 0;
-                                                                }
-                                                                x[g + 28 >> 2] = a;
-                                                                x[g + 16 >> 2] = 0;
-                                                                x[g + 20 >> 2] = 0;
-                                                                b = (a << 2) + 1436 | 0;
-                                                                c = x[284];
-                                                                e = 1 << a;
-                                                                F: {
-                                                                    if (!(c & e)) {
-                                                                        x[284] = c | e;
-                                                                        x[b >> 2] = g;
-                                                                        x[g + 24 >> 2] = b;
-                                                                        break F;
-                                                                    }
-                                                                    a = d << ((a | 0) == 31 ? 0 : 25 - (a >>> 1 | 0) | 0);
-                                                                    b = x[b >> 2];
-                                                                    while (1) {
-                                                                        c = b;
-                                                                        if ((x[b + 4 >> 2] & -8) == (d | 0)) {
-                                                                            break w;
-                                                                        }
-                                                                        b = a >>> 29 | 0;
-                                                                        a = a << 1;
-                                                                        e = c + (b & 4) | 0;
-                                                                        b = x[e + 16 >> 2];
-                                                                        if (b) {
-                                                                            continue;
-                                                                        }
-                                                                        break;
-                                                                    }
-                                                                    x[e + 16 >> 2] = g;
-                                                                    x[g + 24 >> 2] = c;
-                                                                }
-                                                                x[g + 12 >> 2] = g;
-                                                                x[g + 8 >> 2] = g;
-                                                                break v;
-                                                            }
-                                                            a = e - 40 | 0;
-                                                            c = b + 8 & 7 ? -8 - b & 7 : 0;
-                                                            g = a - c | 0;
-                                                            x[286] = g;
-                                                            c = b + c | 0;
-                                                            x[289] = c;
-                                                            x[c + 4 >> 2] = g | 1;
-                                                            x[(a + b | 0) + 4 >> 2] = 40;
-                                                            x[290] = x[405];
-                                                            a = (d + (d - 39 & 7 ? 39 - d & 7 : 0) | 0) - 47 | 0;
-                                                            c = a >>> 0 < f + 16 >>> 0 ? f : a;
-                                                            x[c + 4 >> 2] = 27;
-                                                            a = x[398];
-                                                            x[c + 16 >> 2] = x[397];
-                                                            x[c + 20 >> 2] = a;
-                                                            a = x[396];
-                                                            x[c + 8 >> 2] = x[395];
-                                                            x[c + 12 >> 2] = a;
-                                                            x[397] = c + 8;
-                                                            x[396] = e;
-                                                            x[395] = b;
-                                                            x[398] = 0;
-                                                            a = c + 24 | 0;
-                                                            while (1) {
-                                                                x[a + 4 >> 2] = 7;
-                                                                b = a + 8 | 0;
-                                                                a = a + 4 | 0;
-                                                                if (b >>> 0 < d >>> 0) {
-                                                                    continue;
-                                                                }
-                                                                break;
-                                                            }
-                                                            if ((c | 0) == (f | 0)) {
-                                                                break r;
-                                                            }
-                                                            x[c + 4 >> 2] = x[c + 4 >> 2] & -2;
-                                                            e = c - f | 0;
-                                                            x[f + 4 >> 2] = e | 1;
-                                                            x[c >> 2] = e;
-                                                            if (e >>> 0 <= 255) {
-                                                                b = e >>> 3 | 0;
-                                                                a = (b << 3) + 1172 | 0;
-                                                                c = x[283];
-                                                                b = 1 << b;
-                                                                G: {
-                                                                    if (!(c & b)) {
-                                                                        x[283] = b | c;
-                                                                        b = a;
-                                                                        break G;
-                                                                    }
-                                                                    b = x[a + 8 >> 2];
-                                                                }
-                                                                x[a + 8 >> 2] = f;
-                                                                x[b + 12 >> 2] = f;
-                                                                x[f + 12 >> 2] = a;
-                                                                x[f + 8 >> 2] = b;
-                                                                break r;
-                                                            }
-                                                            a = 31;
-                                                            x[f + 16 >> 2] = 0;
-                                                            x[f + 20 >> 2] = 0;
-                                                            if (e >>> 0 <= 16777215) {
-                                                                b = e >>> 8 | 0;
-                                                                a = b + 1048320 >>> 16 & 8;
-                                                                c = b << a;
-                                                                b = c + 520192 >>> 16 & 4;
-                                                                d = c << b;
-                                                                c = d + 245760 >>> 16 & 2;
-                                                                a = (d << c >>> 15 | 0) - (c | (a | b)) | 0;
-                                                                a = (a << 1 | e >>> a + 21 & 1) + 28 | 0;
-                                                            }
-                                                            x[f + 28 >> 2] = a;
-                                                            b = (a << 2) + 1436 | 0;
-                                                            c = x[284];
-                                                            d = 1 << a;
-                                                            H: {
-                                                                if (!(c & d)) {
-                                                                    x[284] = c | d;
-                                                                    x[b >> 2] = f;
-                                                                    x[f + 24 >> 2] = b;
-                                                                    break H;
-                                                                }
-                                                                a = e << ((a | 0) == 31 ? 0 : 25 - (a >>> 1 | 0) | 0);
-                                                                b = x[b >> 2];
-                                                                while (1) {
-                                                                    c = b;
-                                                                    if ((e | 0) == (x[b + 4 >> 2] & -8)) {
-                                                                        break u;
-                                                                    }
-                                                                    b = a >>> 29 | 0;
-                                                                    a = a << 1;
-                                                                    d = c + (b & 4) | 0;
-                                                                    b = x[d + 16 >> 2];
-                                                                    if (b) {
-                                                                        continue;
-                                                                    }
-                                                                    break;
-                                                                }
-                                                                x[d + 16 >> 2] = f;
-                                                                x[f + 24 >> 2] = c;
-                                                            }
-                                                            x[f + 12 >> 2] = f;
-                                                            x[f + 8 >> 2] = f;
-                                                            break r;
-                                                        }
-                                                        a = x[c + 8 >> 2];
-                                                        x[a + 12 >> 2] = g;
-                                                        x[c + 8 >> 2] = g;
-                                                        x[g + 24 >> 2] = 0;
-                                                        x[g + 12 >> 2] = c;
-                                                        x[g + 8 >> 2] = a;
-                                                    }
-                                                    a = i + 8 | 0;
-                                                    break b;
-                                                }
-                                                a = x[c + 8 >> 2];
-                                                x[a + 12 >> 2] = f;
-                                                x[c + 8 >> 2] = f;
-                                                x[f + 24 >> 2] = 0;
-                                                x[f + 12 >> 2] = c;
-                                                x[f + 8 >> 2] = a;
-                                            }
-                                            a = x[286];
-                                            if (a >>> 0 <= 16) {
-                                                break e;
-                                            }
-                                            b = a - 16 | 0;
-                                            x[286] = b;
-                                            a = x[289];
-                                            x[289] = a + 16;
-                                            x[a + 20 >> 2] = b | 1;
-                                            x[a + 4 >> 2] = 19;
-                                            a = a + 8 | 0;
-                                            break b;
-                                        }
-                                        x[282] = 48;
-                                        a = 0;
-                                        break b;
-                                    }
-                                    I: {
-                                        if (!i) {
-                                            break I;
-                                        }
-                                        a = x[b + 28 >> 2];
-                                        c = (a << 2) + 1436 | 0;
-                                        J: {
-                                            if (x[c >> 2] == (b | 0)) {
-                                                x[c >> 2] = d;
-                                                if (d) {
-                                                    break J;
-                                                }
-                                                x[284] = ea(a) & j;
-                                                break I;
-                                            }
-                                            x[i + (x[i + 16 >> 2] == (b | 0) ? 16 : 20) >> 2] = d;
-                                            if (!d) {
-                                                break I;
-                                            }
-                                        }
-                                        x[d + 24 >> 2] = i;
-                                        a = x[b + 16 >> 2];
-                                        if (a) {
-                                            x[d + 16 >> 2] = a;
-                                            x[a + 24 >> 2] = d;
-                                        }
-                                        a = x[b + 20 >> 2];
-                                        if (!a) {
-                                            break I;
-                                        }
-                                        x[d + 20 >> 2] = a;
-                                        x[a + 24 >> 2] = d;
-                                    }
-                                    K: {
-                                        if (f >>> 0 <= 15) {
-                                            a = f + 16 | 0;
-                                            x[b + 4 >> 2] = a | 3;
-                                            a = a + b | 0;
-                                            x[a + 4 >> 2] = x[a + 4 >> 2] | 1;
-                                            break K;
-                                        }
-                                        x[b + 4 >> 2] = 19;
-                                        g = b + 16 | 0;
-                                        x[g + 4 >> 2] = f | 1;
-                                        x[f + g >> 2] = f;
-                                        if (h) {
-                                            c = h >>> 3 | 0;
-                                            a = (c << 3) + 1172 | 0;
-                                            d = x[288];
-                                            c = 1 << c;
-                                            L: {
-                                                if (!(c & e)) {
-                                                    x[283] = c | e;
-                                                    c = a;
-                                                    break L;
-                                                }
-                                                c = x[a + 8 >> 2];
-                                            }
-                                            x[a + 8 >> 2] = d;
-                                            x[c + 12 >> 2] = d;
-                                            x[d + 12 >> 2] = a;
-                                            x[d + 8 >> 2] = c;
-                                        }
-                                        x[288] = g;
-                                        x[285] = f;
-                                    }
-                                    a = b + 8 | 0;
-                                }
-                                S = k + 16 | 0;
-                                if (a) {
-                                    break a;
-                                }
-                                a = x[407];
-                                if (a) {
-                                    T[a | 0]();
-                                    continue;
-                                }
-                                break;
-                            }
-                            R();
-                            N();
-                        } return a; }
-                        function _(a) { a = a | 0; var b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0; if (a) {
-                            a: {
-                                if (!a) {
-                                    break a;
-                                }
-                                c = a - 8 | 0;
-                                a = x[a - 4 >> 2];
-                                e = a & -8;
-                                f = c + e | 0;
-                                b: {
-                                    if (a & 1) {
-                                        break b;
-                                    }
-                                    if (!(a & 3)) {
-                                        break a;
-                                    }
-                                    a = x[c >> 2];
-                                    c = c - a | 0;
-                                    if (c >>> 0 < A[287]) {
-                                        break a;
-                                    }
-                                    e = a + e | 0;
-                                    if (x[288] != (c | 0)) {
-                                        if (a >>> 0 <= 255) {
-                                            d = a >>> 3 | 0;
-                                            a = x[c + 8 >> 2];
-                                            b = x[c + 12 >> 2];
-                                            if ((b | 0) == (a | 0)) {
-                                                x[283] = x[283] & ea(d);
-                                                break b;
-                                            }
-                                            x[a + 12 >> 2] = b;
-                                            x[b + 8 >> 2] = a;
-                                            break b;
-                                        }
-                                        h = x[c + 24 >> 2];
-                                        a = x[c + 12 >> 2];
-                                        c: {
-                                            if ((c | 0) != (a | 0)) {
-                                                b = x[c + 8 >> 2];
-                                                x[b + 12 >> 2] = a;
-                                                x[a + 8 >> 2] = b;
-                                                break c;
-                                            }
-                                            d: {
-                                                b = c + 20 | 0;
-                                                d = x[b >> 2];
-                                                if (d) {
-                                                    break d;
-                                                }
-                                                b = c + 16 | 0;
-                                                d = x[b >> 2];
-                                                if (d) {
-                                                    break d;
-                                                }
-                                                a = 0;
-                                                break c;
-                                            }
-                                            while (1) {
-                                                g = b;
-                                                a = d;
-                                                b = a + 20 | 0;
-                                                d = x[b >> 2];
-                                                if (d) {
-                                                    continue;
-                                                }
-                                                b = a + 16 | 0;
-                                                d = x[a + 16 >> 2];
-                                                if (d) {
-                                                    continue;
-                                                }
-                                                break;
-                                            }
-                                            x[g >> 2] = 0;
-                                        }
-                                        if (!h) {
-                                            break b;
-                                        }
-                                        b = x[c + 28 >> 2];
-                                        d = (b << 2) + 1436 | 0;
-                                        e: {
-                                            if (x[d >> 2] == (c | 0)) {
-                                                x[d >> 2] = a;
-                                                if (a) {
-                                                    break e;
-                                                }
-                                                x[284] = x[284] & ea(b);
-                                                break b;
-                                            }
-                                            x[h + (x[h + 16 >> 2] == (c | 0) ? 16 : 20) >> 2] = a;
-                                            if (!a) {
-                                                break b;
-                                            }
-                                        }
-                                        x[a + 24 >> 2] = h;
-                                        b = x[c + 16 >> 2];
-                                        if (b) {
-                                            x[a + 16 >> 2] = b;
-                                            x[b + 24 >> 2] = a;
-                                        }
-                                        b = x[c + 20 >> 2];
-                                        if (!b) {
-                                            break b;
-                                        }
-                                        x[a + 20 >> 2] = b;
-                                        x[b + 24 >> 2] = a;
-                                        break b;
-                                    }
-                                    a = x[f + 4 >> 2];
-                                    if ((a & 3) != 3) {
-                                        break b;
-                                    }
-                                    x[285] = e;
-                                    x[f + 4 >> 2] = a & -2;
-                                    x[c + 4 >> 2] = e | 1;
-                                    x[c + e >> 2] = e;
-                                    break a;
-                                }
-                                if (c >>> 0 >= f >>> 0) {
-                                    break a;
-                                }
-                                a = x[f + 4 >> 2];
-                                if (!(a & 1)) {
-                                    break a;
-                                }
-                                f: {
-                                    if (!(a & 2)) {
-                                        if (x[289] == (f | 0)) {
-                                            x[289] = c;
-                                            a = x[286] + e | 0;
-                                            x[286] = a;
-                                            x[c + 4 >> 2] = a | 1;
-                                            if (x[288] != (c | 0)) {
-                                                break a;
-                                            }
-                                            x[285] = 0;
-                                            x[288] = 0;
-                                            break a;
-                                        }
-                                        if (x[288] == (f | 0)) {
-                                            x[288] = c;
-                                            a = x[285] + e | 0;
-                                            x[285] = a;
-                                            x[c + 4 >> 2] = a | 1;
-                                            x[a + c >> 2] = a;
-                                            break a;
-                                        }
-                                        e = (a & -8) + e | 0;
-                                        g: {
-                                            if (a >>> 0 <= 255) {
-                                                d = a >>> 3 | 0;
-                                                a = x[f + 8 >> 2];
-                                                b = x[f + 12 >> 2];
-                                                if ((b | 0) == (a | 0)) {
-                                                    x[283] = x[283] & ea(d);
-                                                    break g;
-                                                }
-                                                x[a + 12 >> 2] = b;
-                                                x[b + 8 >> 2] = a;
-                                                break g;
-                                            }
-                                            h = x[f + 24 >> 2];
-                                            a = x[f + 12 >> 2];
-                                            h: {
-                                                if ((f | 0) != (a | 0)) {
-                                                    b = x[f + 8 >> 2];
-                                                    x[b + 12 >> 2] = a;
-                                                    x[a + 8 >> 2] = b;
-                                                    break h;
-                                                }
-                                                i: {
-                                                    b = f + 20 | 0;
-                                                    d = x[b >> 2];
-                                                    if (d) {
-                                                        break i;
-                                                    }
-                                                    b = f + 16 | 0;
-                                                    d = x[b >> 2];
-                                                    if (d) {
-                                                        break i;
-                                                    }
-                                                    a = 0;
-                                                    break h;
-                                                }
-                                                while (1) {
-                                                    g = b;
-                                                    a = d;
-                                                    b = a + 20 | 0;
-                                                    d = x[b >> 2];
-                                                    if (d) {
-                                                        continue;
-                                                    }
-                                                    b = a + 16 | 0;
-                                                    d = x[a + 16 >> 2];
-                                                    if (d) {
-                                                        continue;
-                                                    }
-                                                    break;
-                                                }
-                                                x[g >> 2] = 0;
-                                            }
-                                            if (!h) {
-                                                break g;
-                                            }
-                                            b = x[f + 28 >> 2];
-                                            d = (b << 2) + 1436 | 0;
-                                            j: {
-                                                if (x[d >> 2] == (f | 0)) {
-                                                    x[d >> 2] = a;
-                                                    if (a) {
-                                                        break j;
-                                                    }
-                                                    x[284] = x[284] & ea(b);
-                                                    break g;
-                                                }
-                                                x[h + (x[h + 16 >> 2] == (f | 0) ? 16 : 20) >> 2] = a;
-                                                if (!a) {
-                                                    break g;
-                                                }
-                                            }
-                                            x[a + 24 >> 2] = h;
-                                            b = x[f + 16 >> 2];
-                                            if (b) {
-                                                x[a + 16 >> 2] = b;
-                                                x[b + 24 >> 2] = a;
-                                            }
-                                            b = x[f + 20 >> 2];
-                                            if (!b) {
-                                                break g;
-                                            }
-                                            x[a + 20 >> 2] = b;
-                                            x[b + 24 >> 2] = a;
-                                        }
-                                        x[c + 4 >> 2] = e | 1;
-                                        x[c + e >> 2] = e;
-                                        if (x[288] != (c | 0)) {
-                                            break f;
-                                        }
-                                        x[285] = e;
-                                        break a;
-                                    }
-                                    x[f + 4 >> 2] = a & -2;
-                                    x[c + 4 >> 2] = e | 1;
-                                    x[c + e >> 2] = e;
-                                }
-                                if (e >>> 0 <= 255) {
-                                    b = e >>> 3 | 0;
-                                    a = (b << 3) + 1172 | 0;
-                                    d = x[283];
-                                    b = 1 << b;
-                                    k: {
-                                        if (!(d & b)) {
-                                            x[283] = b | d;
-                                            b = a;
-                                            break k;
-                                        }
-                                        b = x[a + 8 >> 2];
-                                    }
-                                    x[a + 8 >> 2] = c;
-                                    x[b + 12 >> 2] = c;
-                                    x[c + 12 >> 2] = a;
-                                    x[c + 8 >> 2] = b;
-                                    break a;
-                                }
-                                b = 31;
-                                x[c + 16 >> 2] = 0;
-                                x[c + 20 >> 2] = 0;
-                                if (e >>> 0 <= 16777215) {
-                                    b = e >>> 8 | 0;
-                                    a = b + 1048320 >>> 16 & 8;
-                                    d = b << a;
-                                    b = d + 520192 >>> 16 & 4;
-                                    g = d << b;
-                                    d = g + 245760 >>> 16 & 2;
-                                    a = (g << d >>> 15 | 0) - (d | (a | b)) | 0;
-                                    b = (a << 1 | e >>> a + 21 & 1) + 28 | 0;
-                                }
-                                x[c + 28 >> 2] = b;
-                                a = (b << 2) + 1436 | 0;
-                                l: {
-                                    m: {
-                                        d = x[284];
-                                        g = 1 << b;
-                                        n: {
-                                            if (!(d & g)) {
-                                                x[284] = d | g;
-                                                x[a >> 2] = c;
-                                                x[c + 24 >> 2] = a;
-                                                break n;
-                                            }
-                                            b = e << ((b | 0) == 31 ? 0 : 25 - (b >>> 1 | 0) | 0);
-                                            a = x[a >> 2];
-                                            while (1) {
-                                                d = a;
-                                                if ((x[a + 4 >> 2] & -8) == (e | 0)) {
-                                                    break m;
-                                                }
-                                                a = b >>> 29 | 0;
-                                                b = b << 1;
-                                                g = d + (a & 4) | 0;
-                                                a = x[g + 16 >> 2];
-                                                if (a) {
-                                                    continue;
-                                                }
-                                                break;
-                                            }
-                                            x[g + 16 >> 2] = c;
-                                            x[c + 24 >> 2] = d;
-                                        }
-                                        x[c + 12 >> 2] = c;
-                                        x[c + 8 >> 2] = c;
-                                        break l;
-                                    }
-                                    a = x[d + 8 >> 2];
-                                    x[a + 12 >> 2] = c;
-                                    x[d + 8 >> 2] = c;
-                                    x[c + 24 >> 2] = 0;
-                                    x[c + 12 >> 2] = d;
-                                    x[c + 8 >> 2] = a;
-                                }
-                                a = x[291] - 1 | 0;
-                                x[291] = a ? a : -1;
-                            }
-                        } }
-                        function Y(a) { var b = 0, c = 0; b = x[256]; c = a + 3 & -4; a = b + c | 0; a: {
-                            if (a >>> 0 <= b >>> 0 ? c : 0) {
-                                break a;
-                            }
-                            if (a >>> 0 > U() << 16 >>> 0) {
-                                if (!(Q(a | 0) | 0)) {
-                                    break a;
-                                }
-                            }
-                            x[256] = a;
-                            return b;
-                        } x[282] = 48; return -1; }
-                        function ea(a) { var b = 0; b = a & 31; a = 0 - a & 31; return (-1 >>> b & -2) << b | (-1 << a & -2) >>> a; }
-                        function ca(a, b, c) { a = E(a); b = E(b); c = E(c); return Z() | 0; }
-                        function ba(a, b) { a = a | 0; b = b | 0; return D(b, 4950) | 0; }
-                        function aa(a, b) { a = a | 0; b = b | 0; }
-                        function da() { return Z() | 0; }
-                        function $() { }
-                        // EMSCRIPTEN_END_FUNCS
-                        g = y;
-                        r(W);
-                        var T = e([]);
-                        function U() { return u.byteLength / 65536 | 0; }
-                        return { "d": $, "e": _, "f": da, "g": ca, "h": ba, "i": aa, "j": _, "k": T };
-                    }
-                    return V(X);
-                }
-                // EMSCRIPTEN_END_ASM
-                )(C);
-            }
-            function ea() { return { then: function (a) { a({ instance: new da }); } }; }
-            var fa = Error, WebAssembly = {};
-            A = [];
-            "object" != typeof WebAssembly && y("no native wasm support detected");
-            var D, E = !1, F, B = b.INITIAL_MEMORY || 16777216;
-            if (D = b.wasmMemory ? b.wasmMemory : new ba)
-                F = D.buffer;
-            B = F.byteLength;
-            var G = F;
-            F = G;
-            b.HEAP8 = new Int8Array(G);
-            b.HEAP16 = new Int16Array(G);
-            b.HEAP32 = new Int32Array(G);
-            b.HEAPU8 = new Uint8Array(G);
-            b.HEAPU16 = new Uint16Array(G);
-            b.HEAPU32 = new Uint32Array(G);
-            b.HEAPF32 = new Float32Array(G);
-            b.HEAPF64 = new Float64Array(G);
-            var H, I = [], J = [], K = [];
-            function ha() { var a = b.preRun.shift(); I.unshift(a); }
-            var L = 0, M = null, N = null;
-            b.preloadedImages = {};
-            b.preloadedAudios = {};
-            function y(a) { if (b.onAbort)
-                b.onAbort(a); a = "Aborted(" + a + ")"; z(a); E = !0; a = new fa(a + ". Build with -s ASSERTIONS=1 for more info."); k(a); throw a; }
-            var O = "data:application/octet-stream;base64,", P;
-            P = "mxcadassembly_min.wasm";
-            if (!P.startsWith(O)) {
-                var Q = P;
-                P = b.locateFile ? b.locateFile(Q, q) : q + Q;
-            }
-            function ia() { var a = P; try {
-                if (a == P && A)
-                    return new Uint8Array(A);
-                var c = x(a);
-                if (c)
-                    return c;
-                if (u)
-                    return u(a);
-                throw "both async and sync fetching of the wasm failed";
-            }
-            catch (d) {
-                y(d);
-            } }
-            function ja() { if (!A && (m || n)) {
-                if ("function" == typeof fetch && !P.startsWith("file://"))
-                    return fetch(P, { credentials: "same-origin" }).then(function (a) { if (!a.ok)
-                        throw "failed to load wasm binary file at '" + P + "'"; return a.arrayBuffer(); }).catch(function () { return ia(); });
-                if (t)
-                    return new Promise(function (a, c) { t(P, function (d) { a(new Uint8Array(d)); }, c); });
-            } return Promise.resolve().then(function () { return ia(); }); }
-            function R(a) { for (; 0 < a.length;) {
-                var c = a.shift();
-                if ("function" == typeof c)
-                    c(b);
-                else {
-                    var d = c.u;
-                    "number" == typeof d ? void 0 === c.s ? ka(d)() : ka(d)(c.s) : d(void 0 === c.s ? null : c.s);
-                }
-            } }
-            var S = [];
-            function ka(a) { var c = S[a]; c || (a >= S.length && (S.length = a + 1), S[a] = c = H.get(a)); return c; }
-            var aa = !1, la = "function" == typeof atob ? atob : function (a) {
-                var c = "", d = 0;
-                a = a.replace(/[^A-Za-z0-9\+\/=]/g, "");
-                do {
-                    var e = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=".indexOf(a.charAt(d++));
-                    var f = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=".indexOf(a.charAt(d++));
-                    var h = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=".indexOf(a.charAt(d++));
-                    var ca = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=".indexOf(a.charAt(d++));
-                    e = e <<
-                        2 | f >> 4;
-                    f = (f & 15) << 4 | h >> 2;
-                    var ra = (h & 3) << 6 | ca;
-                    c += String.fromCharCode(e);
-                    64 !== h && (c += String.fromCharCode(f));
-                    64 !== ca && (c += String.fromCharCode(ra));
-                } while (d < a.length);
-                return c;
-            };
-            function x(a) { if (a.startsWith(O)) {
-                a = a.slice(O.length);
-                if ("boolean" == typeof p && p) {
-                    var c = Buffer.from(a, "base64");
-                    c = new Uint8Array(c.buffer, c.byteOffset, c.byteLength);
-                }
-                else
-                    try {
-                        var d = la(a), e = new Uint8Array(d.length);
-                        for (a = 0; a < d.length; ++a)
-                            e[a] = d.charCodeAt(a);
-                        c = e;
-                    }
-                    catch (f) {
-                        throw Error("Converting base64 string to bytes failed.");
-                    }
-                return c;
-            } }
-            var C = { c: function () { y(""); }, b: function () { y("OOM"); }, a: D };
-            (function () {
-                function a(f) { b.asm = f.exports; H = b.asm.k; J.unshift(b.asm.d); L--; b.monitorRunDependencies && b.monitorRunDependencies(L); 0 == L && (null !== M && (clearInterval(M), M = null), N && (f = N, N = null, f())); }
-                function c(f) { a(f.instance); }
-                function d(f) { return ja().then(function () { return ea(); }).then(function (h) { return h; }).then(f, function (h) { z("failed to asynchronously prepare wasm: " + h); y(h); }); }
-                var e = { a: C };
-                L++;
-                b.monitorRunDependencies && b.monitorRunDependencies(L);
-                if (b.instantiateWasm)
-                    try {
-                        return b.instantiateWasm(e, a);
-                    }
-                    catch (f) {
-                        return z("Module.instantiateWasm callback failed with error: " +
-                            f), !1;
-                    }
-                (function () { return A || "function" != typeof WebAssembly.instantiateStreaming || P.startsWith(O) || P.startsWith("file://") || "function" != typeof fetch ? d(c) : fetch(P, { credentials: "same-origin" }).then(function (f) { return WebAssembly.instantiateStreaming(f, e).then(c, function (h) { z("wasm streaming compile failed: " + h); z("falling back to ArrayBuffer instantiation"); return d(c); }); }); })().catch(k);
-                return {};
-            })();
-            b.___wasm_call_ctors = function () { return (b.___wasm_call_ctors = b.asm.d).apply(null, arguments); };
-            var ma = b._emscripten_bind_VoidPtr___destroy___0 = function () { return (ma = b._emscripten_bind_VoidPtr___destroy___0 = b.asm.e).apply(null, arguments); }, na = b._emscripten_bind_McGeVector3d_McGeVector3d_0 = function () { return (na = b._emscripten_bind_McGeVector3d_McGeVector3d_0 = b.asm.f).apply(null, arguments); }, oa = b._emscripten_bind_McGeVector3d_McGeVector3d_3 = function () { return (oa = b._emscripten_bind_McGeVector3d_McGeVector3d_3 = b.asm.g).apply(null, arguments); }, pa = b._emscripten_bind_McGeVector3d_getVal_1 = function () {
-                return (pa =
-                    b._emscripten_bind_McGeVector3d_getVal_1 = b.asm.h).apply(null, arguments);
-            }, qa = b._emscripten_bind_McGeVector3d_setVal_1 = function () { return (qa = b._emscripten_bind_McGeVector3d_setVal_1 = b.asm.i).apply(null, arguments); }, sa = b._emscripten_bind_McGeVector3d___destroy___0 = function () { return (sa = b._emscripten_bind_McGeVector3d___destroy___0 = b.asm.j).apply(null, arguments); }, T;
-            N = function ta() { T || U(); T || (N = ta); };
-            function U() { function a() { if (!T && (T = !0, b.calledRun = !0, !E)) {
-                R(J);
-                g(b);
-                if (b.onRuntimeInitialized)
-                    b.onRuntimeInitialized();
-                if (b.postRun)
-                    for ("function" == typeof b.postRun && (b.postRun = [b.postRun]); b.postRun.length;) {
-                        var c = b.postRun.shift();
-                        K.unshift(c);
-                    }
-                R(K);
-            } } if (!(0 < L)) {
-                if (b.preRun)
-                    for ("function" == typeof b.preRun && (b.preRun = [b.preRun]); b.preRun.length;)
-                        ha();
-                R(I);
-                0 < L || (b.setStatus ? (b.setStatus("Running..."), setTimeout(function () { setTimeout(function () { b.setStatus(""); }, 1); a(); }, 1)) : a());
-            } }
-            b.run = U;
-            if (b.preInit)
-                for ("function" == typeof b.preInit && (b.preInit = [b.preInit]); 0 < b.preInit.length;)
-                    b.preInit.pop()();
-            U();
-            function V() { }
-            V.prototype = Object.create(V.prototype);
-            V.prototype.constructor = V;
-            V.prototype.m = V;
-            V.o = {};
-            b.WrapperObject = V;
-            function W(a) { return (a || V).o; }
-            b.getCache = W;
-            function X(a, c) { var d = W(c), e = d[a]; if (e)
-                return e; e = Object.create((c || V).prototype); e.l = a; return d[a] = e; }
-            b.wrapPointer = X;
-            b.castObject = function (a, c) { return X(a.l, c); };
-            b.NULL = X(0);
-            b.destroy = function (a) { if (!a.__destroy__)
-                throw "Error: Cannot destroy object. (Did you create it yourself?)"; a.__destroy__(); delete W(a.m)[a.l]; };
-            b.compare = function (a, c) { return a.l === c.l; };
-            b.getPointer = function (a) { return a.l; };
-            b.getClass = function (a) { return a.m; };
-            function Y() { throw "cannot construct a VoidPtr, no constructor in IDL"; }
-            Y.prototype = Object.create(V.prototype);
-            Y.prototype.constructor = Y;
-            Y.prototype.m = Y;
-            Y.o = {};
-            b.VoidPtr = Y;
-            Y.prototype.__destroy__ = function () { ma(this.l); };
-            function Z(a, c, d) { a && "object" === typeof a && (a = a.l); c && "object" === typeof c && (c = c.l); d && "object" === typeof d && (d = d.l); this.l = void 0 === a ? na() : void 0 === c ? _emscripten_bind_McGeVector3d_McGeVector3d_1(a) : void 0 === d ? _emscripten_bind_McGeVector3d_McGeVector3d_2(a, c) : oa(a, c, d); W(Z)[this.l] = this; }
-            Z.prototype = Object.create(V.prototype);
-            Z.prototype.constructor = Z;
-            Z.prototype.m = Z;
-            Z.o = {};
-            b.McGeVector3d = Z;
-            Z.prototype.getVal = function (a) { var c = this.l; a && "object" === typeof a && (a = a.l); return pa(c, a); };
-            Z.prototype.setVal = function (a) { var c = this.l; a && "object" === typeof a && (a = a.l); qa(c, a); };
-            Z.prototype.__destroy__ = function () { sa(this.l); };
-            return mxcadassembly.ready;
-        });
-    })();
-    if (typeof exports === 'object' && typeof module === 'object')
-        module.exports = mxcadassembly;
-    else if (typeof define === 'function' && define['amd'])
-        define([], function () { return mxcadassembly; });
-    else if (typeof exports === 'object')
-        exports["mxcadassembly"] = mxcadassembly;
-    return mxcadassembly();
-}
-exports.default = mxcadassemblyinit;
+"use strict";function mxcadassemblyinit(){var e,t=(e="undefined"!=typeof document&&document.currentScript?document.currentScript.src:void 0,"undefined"!=typeof __filename&&(e=e||__filename),function(t){var n,r,i;t=t||{},n||(n=void 0!==t?t:{}),n.ready=new Promise(function(e,t){r=e,i=t});var o,f,a,c,u,s,p=Object.assign({},n),_="object"==typeof window,A="function"==typeof importScripts,l="object"==typeof process&&"object"==typeof process.versions&&"string"==typeof process.versions.node,b="";l?(b=A?xxxxx("path").dirname(b)+"/":__dirname+"/",s=function(){u||(c=xxxxx("fs"),u=xxxxx("path"))},o=function(e,t){var n=Z(e);return n?t?n:n.toString():(s(),e=u.normalize(e),c.readFileSync(e,t?void 0:"utf8"))},a=function(e){return(e=o(e,!0)).buffer||(e=new Uint8Array(e)),e},f=function(e,t,n){var r=Z(e);r&&t(r),s(),e=u.normalize(e),c.readFile(e,function(e,r){e?n(e):t(r.buffer)})},1<process.argv.length&&process.argv[1].replace(/\\/g,"/"),process.argv.slice(2),process.on("uncaughtException",function(e){throw e}),process.on("unhandledRejection",function(e){throw e}),n.inspect=function(){return"[Emscripten Module object]"}):(_||A)&&(A?b=self.location.href:"undefined"!=typeof document&&document.currentScript&&(b=document.currentScript.src),e&&(b=e),b=0!==b.indexOf("blob:")?b.substr(0,b.replace(/[?#].*/,"").lastIndexOf("/")+1):"",o=function(e){try{var t=new XMLHttpRequest;return t.open("GET",e,!1),t.send(null),t.responseText}catch(i){if(e=Z(e)){t=[];for(var n=0;n<e.length;n++){var r=e[n];255<r&&(N&&F("Character code "+r+" ("+String.fromCharCode(r)+")  at offset "+n+" not in 0x00-0xFF."),r&=255),t.push(String.fromCharCode(r))}return t.join("")}throw i}},A&&(a=function(e){try{var t=new XMLHttpRequest;return t.open("GET",e,!1),t.responseType="arraybuffer",t.send(null),new Uint8Array(t.response)}catch(t){if(e=Z(e))return e;throw t}}),f=function(e,t,n){var r=new XMLHttpRequest;r.open("GET",e,!0),r.responseType="arraybuffer",r.onload=function(){if(200==r.status||0==r.status&&r.response)t(r.response);else{var i=Z(e);i?t(i.buffer):n()}},r.onerror=n,r.send(null)}),n.print||console.log.bind(console);var d,y=n.printErr||console.warn.bind(console);function h(){this.exports=function(e){for(var t,n=new Uint8Array(123),r=25;r>=0;--r)n[48+r]=52+r,n[65+r]=r,n[97+r]=26+r;function i(e,t,r){for(var i,o,f=0,a=t,c=r.length,u=t+(3*c>>2)-("="==r[c-2])-("="==r[c-1]);f<c;f+=4)i=n[r.charCodeAt(f+1)],o=n[r.charCodeAt(f+2)],e[a++]=n[r.charCodeAt(f)]<<2|i>>4,a<u&&(e[a++]=i<<4|o>>2),a<u&&(e[a++]=o<<6|n[r.charCodeAt(f+3)])}return n[43]=62,n[47]=63,function(e){var n=e.a.buffer,r=new Int8Array(n),o=new Int16Array(n),f=new Int32Array(n),a=new Uint8Array(n),c=(new Uint16Array(n),new Uint32Array(n)),u=(new Float32Array(n),new Float64Array(n)),s=Math.imul,p=(Math.fround,Math.abs,Math.clz32,Math.min,Math.max,Math.floor,Math.ceil,Math.trunc,Math.sqrt,e.abort),_=e.b,A=e.c,l=e.d,b=e.e,d=e.f,y=5245008;function h(e){var t,n=0,r=0,i=0,o=0,u=0,s=0,p=0,_=0,A=0,l=0;y=t=y-16|0;e:{t:{n:{r:{i:{o:{f:{a:{c:{u:{s:{if((e|=0)>>>0<=244){if(3&(n=(o=f[404])>>>(r=(s=e>>>0<11?16:e+11&-8)>>>3|0)|0)){e=(u=f[1664+(n=(i=r+(1&(-1^n))|0)<<3)>>2])+8|0,(0|(r=f[u+8>>2]))!=(0|(n=n+1656|0))?(f[r+12>>2]=n,f[n+8>>2]=r):f[404]=j(i)&o,n=i<<3,f[u+4>>2]=3|n,f[4+(n=n+u|0)>>2]=1|f[n+4>>2];break e}if((l=f[406])>>>0>=s>>>0)break s;if(n){r=e=(n=(0-(e=(0-(e=2<<r)|e)&n<<r)&e)-1|0)>>>12&16,r|=e=(n=n>>>e|0)>>>5&8,r|=e=(n=n>>>e|0)>>>2&4,A=f[1664+(e=(r=((r|=e=(n=n>>>e|0)>>>1&2)|(e=(n=n>>>e|0)>>>1&1))+(n>>>e|0)|0)<<3)>>2],(0|(n=f[A+8>>2]))!=(0|(e=e+1656|0))?(f[n+12>>2]=e,f[e+8>>2]=n):(o=j(r)&o,f[404]=o),e=A+8|0,f[A+4>>2]=3|s,u=(n=r<<3)-s|0,f[4+(i=s+A|0)>>2]=1|u,f[n+A>>2]=u,l&&(r=1656+((n=l>>>3|0)<<3)|0,A=f[409],(n=1<<n)&o?n=f[r+8>>2]:(f[404]=n|o,n=r),f[r+8>>2]=A,f[n+12>>2]=A,f[A+12>>2]=r,f[A+8>>2]=n),f[409]=i,f[406]=u;break e}if(!(p=f[405]))break s;for(r=e=(n=(0-p&p)-1|0)>>>12&16,r|=e=(n=n>>>e|0)>>>5&8,r|=e=(n=n>>>e|0)>>>2&4,n=f[1920+(((r|=e=(n=n>>>e|0)>>>1&2)|(e=(n=n>>>e|0)>>>1&1))+(n>>>e|0)<<2)>>2],i=(-8&f[n+4>>2])-s|0,r=n;(e=f[r+16>>2])||(e=f[r+20>>2]);)i=(u=(r=(-8&f[e+4>>2])-s|0)>>>0<i>>>0)?r:i,n=u?e:n,r=e;if(_=f[n+24>>2],(0|(u=f[n+12>>2]))!=(0|n)){e=f[n+8>>2],f[e+12>>2]=u,f[u+8>>2]=e;break t}if(!(e=f[(r=n+20|0)>>2])){if(!(e=f[n+16>>2]))break u;r=n+16|0}for(;A=r,u=e,(e=f[(r=e+20|0)>>2])||(r=u+16|0,e=f[u+16>>2]););f[A>>2]=0;break t}if(s=-1,!(e>>>0>4294967231)&&(s=-8&(e=e+11|0),_=f[405])){i=0-s|0,o=0,s>>>0<256||(o=31,s>>>0>16777215||(e=e>>>8|0,e<<=A=e+1048320>>>16&8,o=28+((e=((e<<=r=e+520192>>>16&4)<<(n=e+245760>>>16&2)>>>15|0)-(n|r|A)|0)<<1|s>>>e+21&1)|0)),r=f[1920+(o<<2)>>2];p:{_:{if(r)for(e=0,n=s<<(31==(0|o)?0:25-(o>>>1|0)|0);;){if(!((A=(p=-8&f[r+4>>2])-s|0)>>>0>=i>>>0)&&(i=A,u=r,(0|s)==(0|p))){i=0,e=r;break _}if(A=f[r+20>>2],r=f[16+((n>>>29&4)+r|0)>>2],e=A?(0|A)==(0|r)?e:A:e,n<<=1,!r)break}else e=0;if(!(e|u)){if(u=0,!(e=(0-(e=2<<o)|e)&_))break s;r=e=(n=(e&0-e)-1|0)>>>12&16,r|=e=(n=n>>>e|0)>>>5&8,r|=e=(n=n>>>e|0)>>>2&4,e=f[1920+(((r|=e=(n=n>>>e|0)>>>1&2)|(e=(n=n>>>e|0)>>>1&1))+(n>>>e|0)<<2)>>2]}if(!e)break p}for(;i=(r=(n=(-8&f[e+4>>2])-s|0)>>>0<i>>>0)?n:i,u=r?e:u,e=(n=f[e+16>>2])||f[e+20>>2];);}if(!(!u|f[406]-s>>>0<=i>>>0)){if(o=f[u+24>>2],(0|u)!=(0|(n=f[u+12>>2]))){e=f[u+8>>2],f[e+12>>2]=n,f[n+8>>2]=e;break n}if(!(e=f[(r=u+20|0)>>2])){if(!(e=f[u+16>>2]))break c;r=u+16|0}for(;A=r,n=e,(e=f[(r=e+20|0)>>2])||(r=n+16|0,e=f[n+16>>2]););f[A>>2]=0;break n}}}if((r=f[406])>>>0>=s>>>0){i=f[409],(n=r-s|0)>>>0>=16?(f[406]=n,e=i+s|0,f[409]=e,f[e+4>>2]=1|n,f[r+i>>2]=n,f[i+4>>2]=3|s):(f[409]=0,f[406]=0,f[i+4>>2]=3|r,f[4+(e=r+i|0)>>2]=1|f[e+4>>2]),e=i+8|0;break e}if((_=f[407])>>>0>s>>>0){n=_-s|0,f[407]=n,e=(r=f[410])+s|0,f[410]=e,f[e+4>>2]=1|n,f[r+4>>2]=3|s,e=r+8|0;break e}if(e=0,p=s+47|0,f[522]?r=f[524]:(f[525]=-1,f[526]=-1,f[523]=4096,f[524]=4096,f[522]=t+12&-16^1431655768,f[527]=0,f[515]=0,r=4096),(r=(A=p+r|0)&(u=0-r|0))>>>0<=s>>>0)break e;if((i=f[514])&&(o=(n=f[512])+r|0)>>>0>i>>>0|n>>>0>=o>>>0)break e;if(4&a[2060])break o;s:{p:{if(i=f[410])for(e=2064;;){if((n=f[e>>2])>>>0<=i>>>0&i>>>0<n+f[e+4>>2]>>>0)break p;if(!(e=f[e+8>>2]))break}if(-1==(0|(n=C(0))))break f;if(o=r,(e=(i=f[523])-1|0)&n&&(o=(r-n|0)+(e+n&0-i)|0),o>>>0<=s>>>0|o>>>0>2147483646)break f;if((i=f[514])&&i>>>0<(u=(e=f[512])+o|0)>>>0|e>>>0>=u>>>0)break f;if((0|n)!=(0|(e=C(o))))break s;break i}if((o=u&A-_)>>>0>2147483646)break f;if((0|(n=C(o)))==(f[e>>2]+f[e+4>>2]|0))break a;e=n}if(!(-1==(0|e)|s+48>>>0<=o>>>0)){if((n=(n=f[524])+(p-o|0)&0-n)>>>0>2147483646){n=e;break i}if(-1!=(0|C(n))){o=n+o|0,n=e;break i}C(0-o|0);break f}if(n=e,-1!=(0|e))break i;break f}u=0;break t}n=0;break n}if(-1!=(0|n))break i}f[515]=4|f[515]}if(r>>>0>2147483646)break r;if(-1==(0|(n=C(r)))|-1==(0|(e=C(0)))|e>>>0<=n>>>0)break r;if((o=e-n|0)>>>0<=s+40>>>0)break r}e=f[512]+o|0,f[512]=e,e>>>0>c[513]&&(f[513]=e);i:{o:{f:{if(p=f[410]){for(e=2064;;){if(((i=f[e>>2])+(r=f[e+4>>2])|0)==(0|n))break f;if(!(e=f[e+8>>2]))break}break o}for((e=f[408])>>>0<=n>>>0&&e||(f[408]=n),e=0,f[517]=o,f[516]=n,f[412]=-1,f[413]=f[522],f[519]=0;r=1656+(i=e<<3)|0,f[i+1664>>2]=r,f[i+1668>>2]=r,32!=(0|(e=e+1|0)););r=(i=o-40|0)-(e=n+8&7?-8-n&7:0)|0,f[407]=r,e=e+n|0,f[410]=e,f[e+4>>2]=1|r,f[4+(n+i|0)>>2]=40,f[411]=f[526];break i}if(!(8&a[e+12|0]|i>>>0>p>>>0|n>>>0<=p>>>0)){f[e+4>>2]=r+o,r=(e=p+8&7?-8-p&7:0)+p|0,f[410]=r,e=(n=f[407]+o|0)-e|0,f[407]=e,f[r+4>>2]=1|e,f[4+(n+p|0)>>2]=40,f[411]=f[526];break i}}c[408]>n>>>0&&(f[408]=n),r=n+o|0,e=2064;o:{f:{a:{c:{u:{s:{for(;;){if((0|r)!=f[e>>2]){if(e=f[e+8>>2])continue;break s}break}if(!(8&a[e+12|0]))break u}for(e=2064;;){if((r=f[e>>2])>>>0<=p>>>0&&(u=r+f[e+4>>2]|0)>>>0>p>>>0)break c;e=f[e+8>>2]}}if(f[e>>2]=n,f[e+4>>2]=f[e+4>>2]+o,f[4+(A=(n+8&7?-8-n&7:0)+n|0)>>2]=3|s,s=(o=r+(r+8&7?-8-r&7:0)|0)-(_=s+A|0)|0,(0|o)==(0|p)){f[410]=_,e=f[407]+s|0,f[407]=e,f[_+4>>2]=1|e;break f}if(f[409]==(0|o)){f[409]=_,e=f[406]+s|0,f[406]=e,f[_+4>>2]=1|e,f[e+_>>2]=e;break f}if(1==(3&(e=f[o+4>>2]))){u=-8&e;u:if(e>>>0<=255){if(r=f[o+8>>2],e=e>>>3|0,(0|(n=f[o+12>>2]))==(0|r)){f[404]=f[404]&j(e);break u}f[r+12>>2]=n,f[n+8>>2]=r}else{if(p=f[o+24>>2],(0|o)==(0|(n=f[o+12>>2])))if((i=f[(e=o+20|0)>>2])||(i=f[(e=o+16|0)>>2])){for(;r=e,(i=f[(e=(n=i)+20|0)>>2])||(e=n+16|0,i=f[n+16>>2]););f[r>>2]=0}else n=0;else e=f[o+8>>2],f[e+12>>2]=n,f[n+8>>2]=e;if(p){r=f[o+28>>2];s:{if(f[(e=1920+(r<<2)|0)>>2]==(0|o)){if(f[e>>2]=n,n)break s;f[405]=f[405]&j(r);break u}if(f[p+(f[p+16>>2]==(0|o)?16:20)>>2]=n,!n)break u}f[n+24>>2]=p,(e=f[o+16>>2])&&(f[n+16>>2]=e,f[e+24>>2]=n),(e=f[o+20>>2])&&(f[n+20>>2]=e,f[e+24>>2]=n)}}s=u+s|0,o=o+u|0}if(f[o+4>>2]=-2&f[o+4>>2],f[_+4>>2]=1|s,f[s+_>>2]=s,s>>>0<=255){n=1656+((e=s>>>3|0)<<3)|0,(r=f[404])&(e=1<<e)?e=f[n+8>>2]:(f[404]=e|r,e=n),f[n+8>>2]=_,f[e+12>>2]=_,f[_+12>>2]=n,f[_+8>>2]=e;break f}if(e=31,s>>>0<=16777215&&(e=s>>>8|0,e<<=i=e+1048320>>>16&8,e=28+((e=((e<<=r=e+520192>>>16&4)<<(n=e+245760>>>16&2)>>>15|0)-(n|r|i)|0)<<1|s>>>e+21&1)|0),f[_+28>>2]=e,f[_+16>>2]=0,f[_+20>>2]=0,i=1920+(e<<2)|0,(r=f[405])&(n=1<<e)){for(e=s<<(31==(0|e)?0:25-(e>>>1|0)|0),n=f[i>>2];;){if(r=n,(-8&f[n+4>>2])==(0|s))break a;if(n=e>>>29|0,e<<=1,!(n=f[16+(i=r+(4&n)|0)>>2]))break}f[i+16>>2]=_,f[_+24>>2]=r}else f[405]=n|r,f[i>>2]=_,f[_+24>>2]=i;f[_+12>>2]=_,f[_+8>>2]=_;break f}for(r=(i=o-40|0)-(e=n+8&7?-8-n&7:0)|0,f[407]=r,e=e+n|0,f[410]=e,f[e+4>>2]=1|r,f[4+(n+i|0)>>2]=40,f[411]=f[526],f[(r=(e=(u+(u-39&7?39-u&7:0)|0)-47|0)>>>0<p+16>>>0?p:e)+4>>2]=27,e=f[519],f[r+16>>2]=f[518],f[r+20>>2]=e,e=f[517],f[r+8>>2]=f[516],f[r+12>>2]=e,f[518]=r+8,f[517]=o,f[516]=n,f[519]=0,e=r+24|0;f[e+4>>2]=7,n=e+8|0,e=e+4|0,n>>>0<u>>>0;);if((0|r)==(0|p))break i;if(f[r+4>>2]=-2&f[r+4>>2],u=r-p|0,f[p+4>>2]=1|u,f[r>>2]=u,u>>>0<=255){n=1656+((e=u>>>3|0)<<3)|0,(r=f[404])&(e=1<<e)?e=f[n+8>>2]:(f[404]=e|r,e=n),f[n+8>>2]=p,f[e+12>>2]=p,f[p+12>>2]=n,f[p+8>>2]=e;break i}if(e=31,f[p+16>>2]=0,f[p+20>>2]=0,u>>>0<=16777215&&(e=u>>>8|0,e<<=i=e+1048320>>>16&8,e=28+((e=((e<<=r=e+520192>>>16&4)<<(n=e+245760>>>16&2)>>>15|0)-(n|r|i)|0)<<1|u>>>e+21&1)|0),f[p+28>>2]=e,i=1920+(e<<2)|0,(r=f[405])&(n=1<<e)){for(e=u<<(31==(0|e)?0:25-(e>>>1|0)|0),n=f[i>>2];;){if(r=n,(0|u)==(-8&f[n+4>>2]))break o;if(n=e>>>29|0,e<<=1,!(n=f[16+(i=r+(4&n)|0)>>2]))break}f[i+16>>2]=p,f[p+24>>2]=r}else f[405]=n|r,f[i>>2]=p,f[p+24>>2]=i;f[p+12>>2]=p,f[p+8>>2]=p;break i}e=f[r+8>>2],f[e+12>>2]=_,f[r+8>>2]=_,f[_+24>>2]=0,f[_+12>>2]=r,f[_+8>>2]=e}e=A+8|0;break e}e=f[r+8>>2],f[e+12>>2]=p,f[r+8>>2]=p,f[p+24>>2]=0,f[p+12>>2]=r,f[p+8>>2]=e}if(!((e=f[407])>>>0<=s>>>0)){n=e-s|0,f[407]=n,e=(r=f[410])+s|0,f[410]=e,f[e+4>>2]=1|n,f[r+4>>2]=3|s,e=r+8|0;break e}}f[403]=48,e=0;break e}n:if(o){r=f[u+28>>2];r:{if(f[(e=1920+(r<<2)|0)>>2]==(0|u)){if(f[e>>2]=n,n)break r;_=j(r)&_,f[405]=_;break n}if(f[o+(f[o+16>>2]==(0|u)?16:20)>>2]=n,!n)break n}f[n+24>>2]=o,(e=f[u+16>>2])&&(f[n+16>>2]=e,f[e+24>>2]=n),(e=f[u+20>>2])&&(f[n+20>>2]=e,f[e+24>>2]=n)}n:if(i>>>0<=15)e=i+s|0,f[u+4>>2]=3|e,f[4+(e=e+u|0)>>2]=1|f[e+4>>2];else if(f[u+4>>2]=3|s,f[4+(o=u+s|0)>>2]=1|i,f[o+i>>2]=i,i>>>0<=255)n=1656+((e=i>>>3|0)<<3)|0,(r=f[404])&(e=1<<e)?e=f[n+8>>2]:(f[404]=e|r,e=n),f[n+8>>2]=o,f[e+12>>2]=o,f[o+12>>2]=n,f[o+8>>2]=e;else{e=31,i>>>0<=16777215&&(e=i>>>8|0,e<<=A=e+1048320>>>16&8,e=28+((e=((e<<=r=e+520192>>>16&4)<<(n=e+245760>>>16&2)>>>15|0)-(n|r|A)|0)<<1|i>>>e+21&1)|0),f[o+28>>2]=e,f[o+16>>2]=0,f[o+20>>2]=0,n=1920+(e<<2)|0;r:{if((r=1<<e)&_){for(e=i<<(31==(0|e)?0:25-(e>>>1|0)|0),r=f[n>>2];;){if((-8&f[(n=r)+4>>2])==(0|i))break r;if(r=e>>>29|0,e<<=1,!(r=f[16+(A=(4&r)+n|0)>>2]))break}f[A+16>>2]=o}else f[405]=r|_,f[n>>2]=o;f[o+24>>2]=n,f[o+12>>2]=o,f[o+8>>2]=o;break n}e=f[n+8>>2],f[e+12>>2]=o,f[n+8>>2]=o,f[o+24>>2]=0,f[o+12>>2]=n,f[o+8>>2]=e}e=u+8|0;break e}t:if(_){r=f[n+28>>2];n:{if(f[(e=1920+(r<<2)|0)>>2]==(0|n)){if(f[e>>2]=u,u)break n;f[405]=j(r)&p;break t}if(f[_+(f[_+16>>2]==(0|n)?16:20)>>2]=u,!u)break t}f[u+24>>2]=_,(e=f[n+16>>2])&&(f[u+16>>2]=e,f[e+24>>2]=u),(e=f[n+20>>2])&&(f[u+20>>2]=e,f[e+24>>2]=u)}i>>>0<=15?(e=i+s|0,f[n+4>>2]=3|e,f[4+(e=e+n|0)>>2]=1|f[e+4>>2]):(f[n+4>>2]=3|s,f[4+(u=n+s|0)>>2]=1|i,f[i+u>>2]=i,l&&(r=1656+((e=l>>>3|0)<<3)|0,A=f[409],(e=1<<e)&o?e=f[r+8>>2]:(f[404]=e|o,e=r),f[r+8>>2]=A,f[e+12>>2]=A,f[A+12>>2]=r,f[A+8>>2]=e),f[409]=u,f[406]=i),e=n+8|0}return y=t+16|0,0|e}function m(e){var t=0,n=0,r=0,i=0,o=0,a=0,u=0;e:if(e){o=(r=e-8|0)+(e=-8&(t=f[e-4>>2]))|0;t:if(!(1&t)){if(!(3&t))break e;if((r=r-(t=f[r>>2])|0)>>>0<c[408])break e;if(e=e+t|0,f[409]==(0|r)){if(3==(3&(t=f[o+4>>2])))return f[406]=e,f[o+4>>2]=-2&t,f[r+4>>2]=1|e,void(f[e+r>>2]=e)}else{if(t>>>0<=255){if(i=f[r+8>>2],t=t>>>3|0,(0|(n=f[r+12>>2]))==(0|i)){f[404]=f[404]&j(t);break t}f[i+12>>2]=n,f[n+8>>2]=i;break t}if(u=f[r+24>>2],(0|r)==(0|(t=f[r+12>>2])))if((n=f[(i=r+20|0)>>2])||(n=f[(i=r+16|0)>>2])){for(;a=i,(n=f[(i=(t=n)+20|0)>>2])||(i=t+16|0,n=f[t+16>>2]););f[a>>2]=0}else t=0;else n=f[r+8>>2],f[n+12>>2]=t,f[t+8>>2]=n;if(!u)break t;i=f[r+28>>2];n:{if(f[(n=1920+(i<<2)|0)>>2]==(0|r)){if(f[n>>2]=t,t)break n;f[405]=f[405]&j(i);break t}if(f[u+(f[u+16>>2]==(0|r)?16:20)>>2]=t,!t)break t}if(f[t+24>>2]=u,(n=f[r+16>>2])&&(f[t+16>>2]=n,f[n+24>>2]=t),!(n=f[r+20>>2]))break t;f[t+20>>2]=n,f[n+24>>2]=t}}if(!(r>>>0>=o>>>0)&&1&(t=f[o+4>>2])){t:{if(!(2&t)){if(f[410]==(0|o)){if(f[410]=r,e=f[407]+e|0,f[407]=e,f[r+4>>2]=1|e,f[409]!=(0|r))break e;return f[406]=0,void(f[409]=0)}if(f[409]==(0|o))return f[409]=r,e=f[406]+e|0,f[406]=e,f[r+4>>2]=1|e,void(f[e+r>>2]=e);e=(-8&t)+e|0;n:if(t>>>0<=255){if(i=f[o+8>>2],t=t>>>3|0,(0|(n=f[o+12>>2]))==(0|i)){f[404]=f[404]&j(t);break n}f[i+12>>2]=n,f[n+8>>2]=i}else{if(u=f[o+24>>2],(0|o)==(0|(t=f[o+12>>2])))if((n=f[(i=o+20|0)>>2])||(n=f[(i=o+16|0)>>2])){for(;a=i,(n=f[(i=(t=n)+20|0)>>2])||(i=t+16|0,n=f[t+16>>2]););f[a>>2]=0}else t=0;else n=f[o+8>>2],f[n+12>>2]=t,f[t+8>>2]=n;if(u){i=f[o+28>>2];r:{if(f[(n=1920+(i<<2)|0)>>2]==(0|o)){if(f[n>>2]=t,t)break r;f[405]=f[405]&j(i);break n}if(f[u+(f[u+16>>2]==(0|o)?16:20)>>2]=t,!t)break n}f[t+24>>2]=u,(n=f[o+16>>2])&&(f[t+16>>2]=n,f[n+24>>2]=t),(n=f[o+20>>2])&&(f[t+20>>2]=n,f[n+24>>2]=t)}}if(f[r+4>>2]=1|e,f[e+r>>2]=e,f[409]!=(0|r))break t;return void(f[406]=e)}f[o+4>>2]=-2&t,f[r+4>>2]=1|e,f[e+r>>2]=e}if(e>>>0<=255)return t=1656+((e=e>>>3|0)<<3)|0,(n=f[404])&(e=1<<e)?e=f[t+8>>2]:(f[404]=e|n,e=t),f[t+8>>2]=r,f[e+12>>2]=r,f[r+12>>2]=t,void(f[r+8>>2]=e);i=31,f[r+16>>2]=0,f[r+20>>2]=0,e>>>0<=16777215&&(t=e>>>8|0,t<<=a=t+1048320>>>16&8,i=28+((t=((t<<=i=t+520192>>>16&4)<<(n=t+245760>>>16&2)>>>15|0)-(n|i|a)|0)<<1|e>>>t+21&1)|0),f[r+28>>2]=i,a=1920+(i<<2)|0;t:{n:{if((n=f[405])&(t=1<<i)){for(i=e<<(31==(0|i)?0:25-(i>>>1|0)|0),t=f[a>>2];;){if(n=t,(-8&f[t+4>>2])==(0|e))break n;if(t=i>>>29|0,i<<=1,!(t=f[16+(a=n+(4&t)|0)>>2]))break}f[a+16>>2]=r,f[r+24>>2]=n}else f[405]=t|n,f[a>>2]=r,f[r+24>>2]=a;f[r+12>>2]=r,f[r+8>>2]=r;break t}e=f[n+8>>2],f[e+12>>2]=r,f[n+8>>2]=r,f[r+24>>2]=0,f[r+12>>2]=n,f[r+8>>2]=e}e=f[412]-1|0,f[412]=e||-1}}}function k(e,t,n){var i,o=0,c=0;if(n>>>0>=512)return l(0|e,0|t,0|n),e;i=e+n|0;e:if(3&(e^t))if(i>>>0<4)n=e;else if((o=i-4|0)>>>0<e>>>0)n=e;else for(n=e;r[0|n]=a[0|t],r[n+1|0]=a[t+1|0],r[n+2|0]=a[t+2|0],r[n+3|0]=a[t+3|0],t=t+4|0,o>>>0>=(n=n+4|0)>>>0;);else{t:if(3&e)if(n)for(n=e;;){if(r[0|n]=a[0|t],t=t+1|0,!(3&(n=n+1|0)))break t;if(!(n>>>0<i>>>0))break}else n=e;else n=e;if(!((o=-4&i)>>>0<64||(c=o+-64|0)>>>0<n>>>0))for(;f[n>>2]=f[t>>2],f[n+4>>2]=f[t+4>>2],f[n+8>>2]=f[t+8>>2],f[n+12>>2]=f[t+12>>2],f[n+16>>2]=f[t+16>>2],f[n+20>>2]=f[t+20>>2],f[n+24>>2]=f[t+24>>2],f[n+28>>2]=f[t+28>>2],f[n+32>>2]=f[t+32>>2],f[n+36>>2]=f[t+36>>2],f[n+40>>2]=f[t+40>>2],f[n+44>>2]=f[t+44>>2],f[n+48>>2]=f[t+48>>2],f[n+52>>2]=f[t+52>>2],f[n+56>>2]=f[t+56>>2],f[n+60>>2]=f[t+60>>2],t=t- -64|0,c>>>0>=(n=n- -64|0)>>>0;);if(n>>>0>=o>>>0)break e;for(;f[n>>2]=f[t>>2],t=t+4|0,o>>>0>(n=n+4|0)>>>0;);}if(n>>>0<i>>>0)for(;r[0|n]=a[0|t],t=t+1|0,(0|i)!=(0|(n=n+1|0)););return e}function v(e,t){var n=0;if(t&&(r[0|e]=0,r[(n=e+t|0)-1|0]=0,!(t>>>0<3||(r[e+2|0]=0,r[e+1|0]=0,r[n-3|0]=0,r[n-2|0]=0,t>>>0<7||(r[e+3|0]=0,r[n-4|0]=0,t>>>0<9||(f[(e=(n=0-e&3)+e|0)>>2]=0,f[(t=(n=t-n&-4)+e|0)-4>>2]=0,n>>>0<9||(f[e+8>>2]=0,f[e+4>>2]=0,f[t-8>>2]=0,f[t-12>>2]=0,n>>>0<25||(f[e+24>>2]=0,f[e+20>>2]=0,f[e+16>>2]=0,f[e+12>>2]=0,f[t-16>>2]=0,f[t-20>>2]=0,f[t-24>>2]=0,f[t-28>>2]=0,(t=(t=n)-(n=4&e|24)|0)>>>0<32))))))))for(e=e+n|0;f[e+24>>2]=0,f[e+28>>2]=0,f[e+16>>2]=0,f[e+20>>2]=0,f[e+8>>2]=0,f[e+12>>2]=0,f[e>>2]=0,f[e+4>>2]=0,e=e+32|0,(t=t-32|0)>>>0>31;);}function M(e){var t,n=0,r=0,i=0;t=0|d(8),f[t>>2]=1348,f[t>>2]=1392;e:{t:{if(3&(n=e))for(;;){if(!a[0|n])break t;if(!(3&(n=n+1|0)))break}for(;r=n,n=n+4|0,!((-1^(i=f[r>>2]))&i-16843009&-2139062144););if(n=r-e|0,!(255&i))break e;for(;i=a[r+1|0],r=n=r+1|0,i;);}n=n-e|0}r=P(n+13|0),f[r+8>>2]=0,f[r+4>>2]=n,f[r>>2]=n,f[t+4>>2]=k(r+12|0,e,n+1|0),f[t>>2]=1440,b(0|t,1472,1),p()}function w(e,t,n,i){r[e+53|0]=1;e:if(f[e+4>>2]==(0|n)){r[e+52|0]=1,n=f[e+16>>2];t:{if(!n){if(f[e+36>>2]=1,f[e+24>>2]=i,f[e+16>>2]=t,1!=(0|i))break e;if(1==f[e+48>>2])break t;break e}if((0|t)==(0|n)){if(2==(0|(n=f[e+24>>2]))&&(f[e+24>>2]=i,n=i),1!=f[e+48>>2])break e;if(1==(0|n))break t;break e}f[e+36>>2]=f[e+36>>2]+1}r[e+54|0]=1}}function g(e,t,n){var r=0;if(!n)return f[e+4>>2]==f[t+4>>2];if((0|e)==(0|t))return 1;r=f[e+4>>2],e=a[0|r],n=f[t+4>>2],t=a[0|n];e:if(!(!e|(0|t)!=(0|e)))for(;;){if(t=a[n+1|0],!(e=a[r+1|0]))break e;if(n=n+1|0,r=r+1|0,(0|e)!=(0|t))break}return(0|e)==(0|t)}function G(e,t,n){var i;if(!(i=f[e+16>>2]))return f[e+36>>2]=1,f[e+24>>2]=n,void(f[e+16>>2]=t);e:{if((0|t)==(0|i)){if(2!=f[e+24>>2])break e;return void(f[e+24>>2]=n)}r[e+54|0]=1,f[e+24>>2]=2,f[e+36>>2]=f[e+36>>2]+1}}function C(e){var t,r;return(e=(t=f[377])+(r=e+3&-4)|0)>>>0<=t>>>0&&r||e>>>0>(n.byteLength/65536|0)<<16>>>0&&!(0|_(0|e))?(f[403]=48,-1):(f[377]=e,t)}function P(e){var t=0;e=e||1;e:{for(;;){if(t=h(e))break e;if(!(t=f[528]))break;U[0|t]()}A(),p()}return t}function x(e){var t,n;return f[(e|=0)>>2]=1392,t=f[e+4>>2]-12|0,n=f[t+8>>2]-1|0,f[t+8>>2]=n,(0|n)<0&&m(t),0|e}function j(e){var t;return(-1>>>(t=31&e)&-2)<<t|(-1<<(e=0-e&31)&-2)>>>e}function I(e){(e|=0)&&m(e)}function E(e){x(e|=0),m(e)}function R(e){return 0|(e|=0)}function B(e){m(e|=0)}function O(e){}i(t=a,1024,"dmVjdG9yAHN0ZDo6ZXhjZXB0aW9uAGFsbG9jYXRvcjxUPjo6YWxsb2NhdGUoc2l6ZV90IG4pICduJyBleGNlZWRzIG1heGltdW0gc3VwcG9ydGVkIHNpemUATjEwX19jeHhhYml2MTE2X19zaGltX3R5cGVfaW5mb0UAAOgEAABaBAAA3AUAAE4xMF9fY3h4YWJpdjExN19fY2xhc3NfdHlwZV9pbmZvRQAAAOgEAACIBAAAfAQAAAAAAACsBAAAAgAAAAMAAAAEAAAABQAAAAYAAAAHAAAACAAAAAkAAAAAAAAAMAUAAAIAAAAKAAAABAAAAAUAAAAGAAAACwAAAAwAAAANAAAATjEwX19jeHhhYml2MTIwX19zaV9jbGFzc190eXBlX2luZm9FAAAAAOgEAAAIBQAArAQAAAAAAABgBQAADgAAAA8AAAAQAAAAU3Q5ZXhjZXB0aW9uAAAAAMAEAABQBQAAAAAAAIwFAAABAAAAEQAAABIAAABTdDExbG9naWNfZXJyb3IA6AQAAHwFAABgBQAAAAAAAMAFAAABAAAAEwAAABIAAABTdDEybGVuZ3RoX2Vycm9yAAAAAOgEAACsBQAAjAUAAFN0OXR5cGVfaW5mbwAAAADABAAAzAU="),i(t,1508,"UAhQ");var T,U=((T=[null,x,R,B,O,O,function(e,t,n){n|=0;var r,i=0,o=0,a=0,c=0;if(y=r=y+-64|0,i=1,!g(e|=0,t|=0,0)&&(i=0,t)){y=i=y+-64|0,o=f[t>>2],a=f[o-4>>2],c=f[o-8>>2],f[i+20>>2]=0,f[i+16>>2]=1148,f[i+12>>2]=t,f[i+8>>2]=1196,o=0,v(i+24|0,39),t=t+c|0;e:if(g(a,1196,0))f[i+56>>2]=1,U[f[f[a>>2]+20>>2]](a,i+8|0,t,t,1,0),o=1==f[i+32>>2]?t:0;else{U[f[f[a>>2]+24>>2]](a,i+8|0,t,1,0);t:switch(f[i+44>>2]){case 0:o=1==f[i+48>>2]&&1==f[i+36>>2]&&1==f[i+40>>2]?f[i+28>>2]:0;break e;case 1:break t;default:break e}1!=f[i+32>>2]&&f[i+48>>2]|1!=f[i+36>>2]|1!=f[i+40>>2]||(o=f[i+24>>2])}y=i- -64|0,i=0,o&&(v(4|(t=r+8|0),52),f[r+56>>2]=1,f[r+20>>2]=-1,f[r+16>>2]=e,f[r+8>>2]=o,U[f[f[o>>2]+28>>2]](o,t,f[n>>2],1),1==(0|(e=f[r+32>>2]))&&(f[n>>2]=f[r+24>>2]),i=1==(0|e))}return y=r- -64|0,0|i},function(e,t,n,r,i,o){n|=0,r|=0,i|=0,o|=0,g(e|=0,f[8+(t|=0)>>2],o)&&w(t,n,r,i)},function(e,t,n,i,o){if(n|=0,i|=0,o|=0,g(e|=0,f[8+(t|=0)>>2],o))1==f[t+28>>2]|f[t+4>>2]!=(0|n)||(f[t+28>>2]=i);else e:if(g(e,f[t>>2],o)){if(!(f[t+16>>2]!=(0|n)&f[t+20>>2]!=(0|n))){if(1!=(0|i))break e;return void(f[t+32>>2]=1)}f[t+20>>2]=n,f[t+32>>2]=i,f[t+40>>2]=f[t+40>>2]+1,1!=f[t+36>>2]|2!=f[t+24>>2]||(r[t+54|0]=1),f[t+44>>2]=4}},function(e,t,n,r){n|=0,r|=0,g(e|=0,f[8+(t|=0)>>2],0)&&G(t,n,r)},B,function(e,t,n,r,i,o){n|=0,r|=0,i|=0,o|=0,g(e|=0,f[8+(t|=0)>>2],o)?w(t,n,r,i):(e=f[e+8>>2],U[f[f[e>>2]+20>>2]](e,t,n,r,i,o))},function(e,t,n,i,c){if(n|=0,i|=0,c|=0,g(e|=0,f[8+(t|=0)>>2],c))1==f[t+28>>2]|f[t+4>>2]!=(0|n)||(f[t+28>>2]=i);else e:{if(g(e,f[t>>2],c)){if(!(f[t+16>>2]!=(0|n)&f[t+20>>2]!=(0|n))){if(1!=(0|i))break e;return void(f[t+32>>2]=1)}f[t+32>>2]=i;t:if(4!=f[t+44>>2]){if(o[t+52>>1]=0,e=f[e+8>>2],U[f[f[e>>2]+20>>2]](e,t,n,n,1,c),a[t+53|0]){if(f[t+44>>2]=3,!a[t+52|0])break t;break e}f[t+44>>2]=4}if(f[t+20>>2]=n,f[t+40>>2]=f[t+40>>2]+1,1!=f[t+36>>2]|2!=f[t+24>>2])break e;return void(r[t+54|0]=1)}e=f[e+8>>2],U[f[f[e>>2]+24>>2]](e,t,n,i,c)}},function(e,t,n,r){n|=0,r|=0,g(e|=0,f[8+(t|=0)>>2],0)?G(t,n,r):(e=f[e+8>>2],U[f[f[e>>2]+28>>2]](e,t,n,r))},R,B,function(e){return 1031},E,function(e){return f[4+(e|=0)>>2]},E]).grow=function(e){var t=this.length;return this.length=this.length+e,t},T.set=function(e,t){this[e]=t},T.get=function(e){return this[e]},T);return{g:function(){},h:I,i:function(){var e;return e=P(24),f[e>>2]=0,f[e+4>>2]=0,f[e+16>>2]=0,f[e+20>>2]=0,f[e+8>>2]=0,f[e+12>>2]=0,0|e},j:function(e,t,n){var r;return e=+e,t=+t,n=+n,r=P(24),u[r+16>>3]=n,u[r+8>>3]=t,u[r>>3]=e,0|r},k:function(e,t){t|=0,u[(e|=0)>>3]=u[e>>3]+u[t>>3],u[e+8>>3]=u[e+8>>3]+u[t+8>>3],u[e+16>>3]=u[e+16>>3]+u[t+16>>3]},l:function(e,t){t|=0,u[(e|=0)>>3]=u[e>>3]-u[t>>3],u[e+8>>3]=u[e+8>>3]-u[t+8>>3],u[e+16>>3]=u[e+16>>3]-u[t+16>>3]},m:function(e){return+u[(e|=0)>>3]},n:function(e,t){t=+t,u[(e|=0)>>3]=t},o:function(e){return+u[8+(e|=0)>>3]},p:function(e,t){t=+t,u[8+(e|=0)>>3]=t},q:function(e){return+u[16+(e|=0)>>3]},r:function(e,t){t=+t,u[16+(e|=0)>>3]=t},s:I,t:function(){var e;return e=P(12),f[e+8>>2]=0,f[e>>2]=0,f[e+4>>2]=0,0|e},u:function(e,t){t|=0;var n=0,r=0,i=0,o=0,a=0,c=0;e:if((0|(n=f[4+(e|=0)>>2]))==f[e+8>>2]){t:{if((i=1+(n=(0|(c=n-(r=f[e>>2])|0))/24|0)|0)>>>0<178956971){if(o=n<<1,i=n>>>0<89478485?i>>>0<o>>>0?o:i:178956970){if(i>>>0>=178956971)break t;o=P(s(i,24))}else o=0;n=o+s(n,24)|0,a=f[t+4>>2],f[n>>2]=f[t>>2],f[n+4>>2]=a,a=f[t+20>>2],f[n+16>>2]=f[t+16>>2],f[n+20>>2]=a,a=f[t+12>>2],f[n+8>>2]=f[t+8>>2],f[n+12>>2]=a,t=n+s((0|c)/-24|0,24)|0,(0|c)>0&&k(t,r,c),f[e+8>>2]=o+s(i,24),f[e+4>>2]=n+24,f[e>>2]=t,r&&m(r);break e}M(1024),p()}M(1046),p()}else r=f[t+4>>2],f[n>>2]=f[t>>2],f[n+4>>2]=r,r=f[t+20>>2],f[n+16>>2]=f[t+16>>2],f[n+20>>2]=r,r=f[t+12>>2],f[n+8>>2]=f[t+8>>2],f[n+12>>2]=r,f[e+4>>2]=n+24},v:function(e){var t=0;(e|=0)&&((t=f[e>>2])&&(f[e+4>>2]=t,m(t)),m(e))},w:function(){return 0|P(1)},x:function(e,t){e|=0;var n=0,r=0,i=0,o=0,a=0,c=0,p=0,_=0,A=0,l=0,b=0,d=0;if(e=f[(t|=0)>>2],(r=(0|(i=f[t+4>>2]-e|0))/24|0)>>>0>=2){if(!(i-24>>>0<24)){if(n=u[e+8>>3],t=1,b=1&(r=r-1|0),a=u[e>>3],i-48>>>0<24)c=n;else for(d=-2&r,r=0,p=a,_=n;i=e+s(t,24)|0,o=.5*((a=u[i+24>>3])-(A=u[i>>3]))*((l=u[i+8>>3]-n)+((c=u[i+32>>3])-n))+(.5*(A-p)*(_-n+l)+o),t=t+2|0,p=a,_=c,(0|d)!=(0|(r=r+2|0)););b&&(e=e+s(t,24)|0,o=.5*(u[e>>3]-a)*(c-n+(u[e+8>>3]-n))+o)}n=o<0?-o:o}else n=0;return+n},y:function(e,t,n){e|=0,t|=0;var r,i=0,o=0,a=0,c=0,p=0,_=0,A=0;if((r=((e=f[4+(n|=0)>>2])-(n=f[n>>2])|0)/24|0)>>>0>=3)for(e=r-1|0,i=u[t+8>>3],A=u[t>>3],t=0;c=n+s(e,24)|0,a=u[c+8>>3],e=t,t=n+s(t,24)|0,!(i<a&(o=u[t+8>>3])<=i)&(!(i>=a)|!(i<o))||A-(p=u[t>>3])<(i-o)*(u[c>>3]-p)/(a-o)&&(_^=1),(0|r)!=(0|(t=e+1|0)););return 1&_},z:I,A:U,B:h}}(e)}(L)}Object.assign(n,p),p=null,n.wasmBinary&&(d=n.wasmBinary),n.noExitRuntime;var m=Error,k={};d=[],"object"!=typeof k&&F("no native wasm support detected");var v,M,w,g,G,C=!1,P=n.INITIAL_MEMORY||16777216;(v=n.wasmMemory?n.wasmMemory:new function(){this.buffer=new ArrayBuffer(P/65536*65536)})&&(M=v.buffer),P=M.byteLength;var x=M;M=x,n.HEAP8=w=new Int8Array(x),n.HEAP16=new Int16Array(x),n.HEAP32=G=new Int32Array(x),n.HEAPU8=g=new Uint8Array(x),n.HEAPU16=new Uint16Array(x),n.HEAPU32=new Uint32Array(x),n.HEAPF32=new Float32Array(x),n.HEAPF64=new Float64Array(x);var j,I=[],E=[],R=[];function B(){var e=n.preRun.shift();I.unshift(e)}var O=0,T=null,U=null;function F(e){throw n.onAbort&&n.onAbort(e),y(e="Aborted("+e+")"),C=!0,e=new m(e+". Build with -s ASSERTIONS=1 for more info."),i(e),e}n.preloadedImages={},n.preloadedAudios={};var S,z="data:application/octet-stream;base64,";if(!(S="mxcadassembly_min.wasm").startsWith(z)){var H=S;S=n.locateFile?n.locateFile(H,b):b+H}function W(){var e=S;try{if(e==S&&d)return new Uint8Array(d);var t=Z(e);if(t)return t;if(a)return a(e);throw"both async and sync fetching of the wasm failed"}catch(e){F(e)}}function D(e){for(;0<e.length;){var t=e.shift();if("function"==typeof t)t(n);else{var r=t.U;"number"==typeof r?void 0===t.G?Q(r)():Q(r)(t.G):r(void 0===t.G?null:t.G)}}}var X=[];function Q(e){var t=X[e];return t||(e>=X.length&&(X.length=e+1),X[e]=t=j.get(e)),t}var N=!1,V="function"==typeof atob?atob:function(e){var t="",n=0;e=e.replace(/[^A-Za-z0-9\+\/=]/g,"");do{var r="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=".indexOf(e.charAt(n++)),i="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=".indexOf(e.charAt(n++)),o="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=".indexOf(e.charAt(n++)),f="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=".indexOf(e.charAt(n++));r=r<<2|i>>4,i=(15&i)<<4|o>>2;var a=(3&o)<<6|f;t+=String.fromCharCode(r),64!==o&&(t+=String.fromCharCode(i)),64!==f&&(t+=String.fromCharCode(a))}while(n<e.length);return t};function Z(e){if(e.startsWith(z)){if(e=e.slice(z.length),"boolean"==typeof l&&l){var t=Buffer.from(e,"base64");t=new Uint8Array(t.buffer,t.byteOffset,t.byteLength)}else try{var n=V(e),r=new Uint8Array(n.length);for(e=0;e<n.length;++e)r[e]=n.charCodeAt(e);t=r}catch(e){throw Error("Converting base64 string to bytes failed.")}return t}}var L={f:function(e){return be(e+16)+16},e:function(e,t,n){throw new function(e){this.C=e-16,this.P=function(e){G[this.C+4>>2]=e},this.M=function(e){G[this.C+8>>2]=e},this.N=function(){G[this.C>>2]=0},this.L=function(){w[this.C+12>>0]=0},this.O=function(){w[this.C+13>>0]=0},this.K=function(e,t){this.P(e),this.M(t),this.N(),this.L(),this.O()}}(e).K(t,n),e},c:function(){F("")},d:function(e,t,n){g.copyWithin(e,t,t+n)},b:function(){F("OOM")},a:v};!function(){function e(e){n.asm=e.exports,j=n.asm.A,E.unshift(n.asm.g),O--,n.monitorRunDependencies&&n.monitorRunDependencies(O),0==O&&(null!==T&&(clearInterval(T),T=null),U&&(e=U,U=null,e()))}function t(t){e(t.instance)}function r(e){return function(){if(!d&&(_||A)){if("function"==typeof fetch&&!S.startsWith("file://"))return fetch(S,{credentials:"same-origin"}).then(function(e){if(!e.ok)throw"failed to load wasm binary file at '"+S+"'";return e.arrayBuffer()}).catch(function(){return W()});if(f)return new Promise(function(e,t){f(S,function(t){e(new Uint8Array(t))},t)})}return Promise.resolve().then(function(){return W()})}().then(function(){return{then:function(e){e({instance:new h})}}}).then(function(e){return e}).then(e,function(e){y("failed to asynchronously prepare wasm: "+e),F(e)})}var o={a:L};if(O++,n.monitorRunDependencies&&n.monitorRunDependencies(O),n.instantiateWasm)try{return n.instantiateWasm(o,e)}catch(e){return y("Module.instantiateWasm callback failed with error: "+e),!1}(d||"function"!=typeof k.instantiateStreaming||S.startsWith(z)||S.startsWith("file://")||"function"!=typeof fetch?r(t):fetch(S,{credentials:"same-origin"}).then(function(e){return k.instantiateStreaming(e,o).then(t,function(e){return y("wasm streaming compile failed: "+e),y("falling back to ArrayBuffer instantiation"),r(t)})})).catch(i)}(),n.___wasm_call_ctors=function(){return(n.___wasm_call_ctors=n.asm.g).apply(null,arguments)};var Y,q=n._emscripten_bind_VoidPtr___destroy___0=function(){return(q=n._emscripten_bind_VoidPtr___destroy___0=n.asm.h).apply(null,arguments)},J=n._emscripten_bind_McGePoint3d_McGePoint3d_0=function(){return(J=n._emscripten_bind_McGePoint3d_McGePoint3d_0=n.asm.i).apply(null,arguments)},K=n._emscripten_bind_McGePoint3d_McGePoint3d_3=function(){return(K=n._emscripten_bind_McGePoint3d_McGePoint3d_3=n.asm.j).apply(null,arguments)},$=n._emscripten_bind_McGePoint3d_op_add_1=function(){return($=n._emscripten_bind_McGePoint3d_op_add_1=n.asm.k).apply(null,arguments)},ee=n._emscripten_bind_McGePoint3d_op_sub_1=function(){return(ee=n._emscripten_bind_McGePoint3d_op_sub_1=n.asm.l).apply(null,arguments)},te=n._emscripten_bind_McGePoint3d_get_x_0=function(){return(te=n._emscripten_bind_McGePoint3d_get_x_0=n.asm.m).apply(null,arguments)},ne=n._emscripten_bind_McGePoint3d_set_x_1=function(){return(ne=n._emscripten_bind_McGePoint3d_set_x_1=n.asm.n).apply(null,arguments)},re=n._emscripten_bind_McGePoint3d_get_y_0=function(){return(re=n._emscripten_bind_McGePoint3d_get_y_0=n.asm.o).apply(null,arguments)},ie=n._emscripten_bind_McGePoint3d_set_y_1=function(){return(ie=n._emscripten_bind_McGePoint3d_set_y_1=n.asm.p).apply(null,arguments)},oe=n._emscripten_bind_McGePoint3d_get_z_0=function(){return(oe=n._emscripten_bind_McGePoint3d_get_z_0=n.asm.q).apply(null,arguments)},fe=n._emscripten_bind_McGePoint3d_set_z_1=function(){return(fe=n._emscripten_bind_McGePoint3d_set_z_1=n.asm.r).apply(null,arguments)},ae=n._emscripten_bind_McGePoint3d___destroy___0=function(){return(ae=n._emscripten_bind_McGePoint3d___destroy___0=n.asm.s).apply(null,arguments)},ce=n._emscripten_bind_McGePoint3dArray_McGePoint3dArray_0=function(){return(ce=n._emscripten_bind_McGePoint3dArray_McGePoint3dArray_0=n.asm.t).apply(null,arguments)},ue=n._emscripten_bind_McGePoint3dArray_append_1=function(){return(ue=n._emscripten_bind_McGePoint3dArray_append_1=n.asm.u).apply(null,arguments)},se=n._emscripten_bind_McGePoint3dArray___destroy___0=function(){return(se=n._emscripten_bind_McGePoint3dArray___destroy___0=n.asm.v).apply(null,arguments)},pe=n._emscripten_bind_McGeTool_McGeTool_0=function(){return(pe=n._emscripten_bind_McGeTool_McGeTool_0=n.asm.w).apply(null,arguments)},_e=n._emscripten_bind_McGeTool_calcArea_1=function(){return(_e=n._emscripten_bind_McGeTool_calcArea_1=n.asm.x).apply(null,arguments)},Ae=n._emscripten_bind_McGeTool_pointInPolyline_2=function(){return(Ae=n._emscripten_bind_McGeTool_pointInPolyline_2=n.asm.y).apply(null,arguments)},le=n._emscripten_bind_McGeTool___destroy___0=function(){return(le=n._emscripten_bind_McGeTool___destroy___0=n.asm.z).apply(null,arguments)},be=n._malloc=function(){return(be=n._malloc=n.asm.B).apply(null,arguments)};function de(){function e(){if(!Y&&(Y=!0,n.calledRun=!0,!C)){if(D(E),r(n),n.onRuntimeInitialized&&n.onRuntimeInitialized(),n.postRun)for("function"==typeof n.postRun&&(n.postRun=[n.postRun]);n.postRun.length;){var e=n.postRun.shift();R.unshift(e)}D(R)}}if(!(0<O)){if(n.preRun)for("function"==typeof n.preRun&&(n.preRun=[n.preRun]);n.preRun.length;)B();D(I),0<O||(n.setStatus?(n.setStatus("Running..."),setTimeout(function(){setTimeout(function(){n.setStatus("")},1),e()},1)):e())}}if(U=function e(){Y||de(),Y||(U=e)},n.run=de,n.preInit)for("function"==typeof n.preInit&&(n.preInit=[n.preInit]);0<n.preInit.length;)n.preInit.pop()();function ye(){}function he(e){return(e||ye).F}function me(e,t){var n=he(t),r=n[e];return r||((r=Object.create((t||ye).prototype)).C=e,n[e]=r)}function ke(){throw"cannot construct a VoidPtr, no constructor in IDL"}function ve(e,t,n){e&&"object"==typeof e&&(e=e.C),t&&"object"==typeof t&&(t=t.C),n&&"object"==typeof n&&(n=n.C),this.C=void 0===e?J():void 0===t?_emscripten_bind_McGePoint3d_McGePoint3d_1(e):void 0===n?_emscripten_bind_McGePoint3d_McGePoint3d_2(e,t):K(e,t,n),he(ve)[this.C]=this}function Me(){this.C=ce(),he(Me)[this.C]=this}function we(){this.C=pe(),he(we)[this.C]=this}return de(),ye.prototype=Object.create(ye.prototype),ye.prototype.constructor=ye,ye.prototype.D=ye,ye.F={},n.WrapperObject=ye,n.getCache=he,n.wrapPointer=me,n.castObject=function(e,t){return me(e.C,t)},n.NULL=me(0),n.destroy=function(e){if(!e.__destroy__)throw"Error: Cannot destroy object. (Did you create it yourself?)";e.__destroy__(),delete he(e.D)[e.C]},n.compare=function(e,t){return e.C===t.C},n.getPointer=function(e){return e.C},n.getClass=function(e){return e.D},ke.prototype=Object.create(ye.prototype),ke.prototype.constructor=ke,ke.prototype.D=ke,ke.F={},n.VoidPtr=ke,ke.prototype.__destroy__=function(){q(this.C)},ve.prototype=Object.create(ye.prototype),ve.prototype.constructor=ve,ve.prototype.D=ve,ve.F={},n.McGePoint3d=ve,ve.prototype.op_add=function(e){var t=this.C;e&&"object"==typeof e&&(e=e.C),$(t,e)},ve.prototype.op_sub=function(e){var t=this.C;e&&"object"==typeof e&&(e=e.C),ee(t,e)},ve.prototype.get_x=ve.prototype.H=function(){return te(this.C)},ve.prototype.set_x=ve.prototype.R=function(e){var t=this.C;e&&"object"==typeof e&&(e=e.C),ne(t,e)},Object.defineProperty(ve.prototype,"x",{get:ve.prototype.H,set:ve.prototype.R}),ve.prototype.get_y=ve.prototype.I=function(){return re(this.C)},ve.prototype.set_y=ve.prototype.S=function(e){var t=this.C;e&&"object"==typeof e&&(e=e.C),ie(t,e)},Object.defineProperty(ve.prototype,"y",{get:ve.prototype.I,set:ve.prototype.S}),ve.prototype.get_z=ve.prototype.J=function(){return oe(this.C)},ve.prototype.set_z=ve.prototype.T=function(e){var t=this.C;e&&"object"==typeof e&&(e=e.C),fe(t,e)},Object.defineProperty(ve.prototype,"z",{get:ve.prototype.J,set:ve.prototype.T}),ve.prototype.__destroy__=function(){ae(this.C)},Me.prototype=Object.create(ye.prototype),Me.prototype.constructor=Me,Me.prototype.D=Me,Me.F={},n.McGePoint3dArray=Me,Me.prototype.append=Me.prototype.append=function(e){var t=this.C;e&&"object"==typeof e&&(e=e.C),ue(t,e)},Me.prototype.__destroy__=function(){se(this.C)},we.prototype=Object.create(ye.prototype),we.prototype.constructor=we,we.prototype.D=we,we.F={},n.McGeTool=we,we.prototype.calcArea=function(e){var t=this.C;return e&&"object"==typeof e&&(e=e.C),_e(t,e)},we.prototype.pointInPolyline=function(e,t){var n=this.C;return e&&"object"==typeof e&&(e=e.C),t&&"object"==typeof t&&(t=t.C),!!Ae(n,e,t)},we.prototype.__destroy__=function(){le(this.C)},t.ready});return"object"==typeof exports&&"object"==typeof module?module.exports=t:"function"==typeof define&&define.amd?define([],function(){return t}):"object"==typeof exports&&(exports.mxcadassembly=t),t()}Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=mxcadassemblyinit;