@undp/data-viz 2.6.0 → 2.6.1

package/dist/delaunay-ZuH6I4Fh.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"delaunay-ZuH6I4Fh.js","names":["epsilon","epsilon","u","epsilon","bc","ca","ab","bct","cat","abt","u","_8","_8b","_16","fin","fin2","epsilon","bc","ab","_8","_16","_48","fin","epsilon"],"sources":["../node_modules/delaunator/node_modules/robust-predicates/esm/util.js","../node_modules/delaunator/node_modules/robust-predicates/esm/orient2d.js","../node_modules/delaunator/node_modules/robust-predicates/esm/orient3d.js","../node_modules/delaunator/node_modules/robust-predicates/esm/incircle.js","../node_modules/delaunator/node_modules/robust-predicates/esm/insphere.js","../node_modules/delaunator/index.js","../node_modules/d3-delaunay/src/path.js","../node_modules/d3-delaunay/src/polygon.js","../node_modules/d3-delaunay/src/voronoi.js","../node_modules/d3-delaunay/src/delaunay.js"],"sourcesContent":["export const epsilon = 1.1102230246251565e-16;\nexport const splitter = 134217729;\nexport const resulterrbound = (3 + 8 * epsilon) * epsilon;\n\n// fast_expansion_sum_zeroelim routine from oritinal code\nexport function sum(elen, e, flen, f, h) {\n    let Q, Qnew, hh, bvirt;\n    let enow = e[0];\n    let fnow = f[0];\n    let eindex = 0;\n    let findex = 0;\n    if ((fnow > enow) === (fnow > -enow)) {\n        Q = enow;\n        enow = e[++eindex];\n    } else {\n        Q = fnow;\n        fnow = f[++findex];\n    }\n    let hindex = 0;\n    if (eindex < elen && findex < flen) {\n        if ((fnow > enow) === (fnow > -enow)) {\n            Qnew = enow + Q;\n            hh = Q - (Qnew - enow);\n            enow = e[++eindex];\n        } else {\n            Qnew = fnow + Q;\n            hh = Q - (Qnew - fnow);\n            fnow = f[++findex];\n        }\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n        while (eindex < elen && findex < flen) {\n            if ((fnow > enow) === (fnow > -enow)) {\n                Qnew = Q + enow;\n                bvirt = Qnew - Q;\n                hh = Q - (Qnew - bvirt) + (enow - bvirt);\n                enow = e[++eindex];\n            } else {\n                Qnew = Q + fnow;\n                bvirt = Qnew - Q;\n                hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n                fnow = f[++findex];\n            }\n            Q = Qnew;\n            if (hh !== 0) {\n                h[hindex++] = hh;\n            }\n        }\n    }\n    while (eindex < elen) {\n        Qnew = Q + enow;\n        bvirt = Qnew - Q;\n        hh = Q - (Qnew - bvirt) + (enow - bvirt);\n        enow = e[++eindex];\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    while (findex < flen) {\n        Qnew = Q + fnow;\n        bvirt = Qnew - Q;\n        hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n        fnow = f[++findex];\n        Q = Qnew;\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    if (Q !== 0 || hindex === 0) {\n        h[hindex++] = Q;\n    }\n    return hindex;\n}\n\nexport function sum_three(alen, a, blen, b, clen, c, tmp, out) {\n    return sum(sum(alen, a, blen, b, tmp), tmp, clen, c, out);\n}\n\n// scale_expansion_zeroelim routine from oritinal code\nexport function scale(elen, e, b, h) {\n    let Q, sum, hh, product1, product0;\n    let bvirt, c, ahi, alo, bhi, blo;\n\n    c = splitter * b;\n    bhi = c - (c - b);\n    blo = b - bhi;\n    let enow = e[0];\n    Q = enow * b;\n    c = splitter * enow;\n    ahi = c - (c - enow);\n    alo = enow - ahi;\n    hh = alo * blo - (Q - ahi * bhi - alo * bhi - ahi * blo);\n    let hindex = 0;\n    if (hh !== 0) {\n        h[hindex++] = hh;\n    }\n    for (let i = 1; i < elen; i++) {\n        enow = e[i];\n        product1 = enow * b;\n        c = splitter * enow;\n        ahi = c - (c - enow);\n        alo = enow - ahi;\n        product0 = alo * blo - (product1 - ahi * bhi - alo * bhi - ahi * blo);\n        sum = Q + product0;\n        bvirt = sum - Q;\n        hh = Q - (sum - bvirt) + (product0 - bvirt);\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n        Q = product1 + sum;\n        hh = sum - (Q - product1);\n        if (hh !== 0) {\n            h[hindex++] = hh;\n        }\n    }\n    if (Q !== 0 || hindex === 0) {\n        h[hindex++] = Q;\n    }\n    return hindex;\n}\n\nexport function negate(elen, e) {\n    for (let i = 0; i < elen; i++) e[i] = -e[i];\n    return elen;\n}\n\nexport function estimate(elen, e) {\n    let Q = e[0];\n    for (let i = 1; i < elen; i++) Q += e[i];\n    return Q;\n}\n\nexport function vec(n) {\n    return new Float64Array(n);\n}\n","import {epsilon, splitter, resulterrbound, estimate, vec, sum} from './util.js';\n\nconst ccwerrboundA = (3 + 16 * epsilon) * epsilon;\nconst ccwerrboundB = (2 + 12 * epsilon) * epsilon;\nconst ccwerrboundC = (9 + 64 * epsilon) * epsilon * epsilon;\n\nconst B = vec(4);\nconst C1 = vec(8);\nconst C2 = vec(12);\nconst D = vec(16);\nconst u = vec(4);\n\nfunction orient2dadapt(ax, ay, bx, by, cx, cy, detsum) {\n    let acxtail, acytail, bcxtail, bcytail;\n    let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0, u3;\n\n    const acx = ax - cx;\n    const bcx = bx - cx;\n    const acy = ay - cy;\n    const bcy = by - cy;\n\n    s1 = acx * bcy;\n    c = splitter * acx;\n    ahi = c - (c - acx);\n    alo = acx - ahi;\n    c = splitter * bcy;\n    bhi = c - (c - bcy);\n    blo = bcy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = acy * bcx;\n    c = splitter * acy;\n    ahi = c - (c - acy);\n    alo = acy - ahi;\n    c = splitter * bcx;\n    bhi = c - (c - bcx);\n    blo = bcx - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    B[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    B[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    B[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    B[3] = u3;\n\n    let det = estimate(4, B);\n    let errbound = ccwerrboundB * detsum;\n    if (det >= errbound || -det >= errbound) {\n        return det;\n    }\n\n    bvirt = ax - acx;\n    acxtail = ax - (acx + bvirt) + (bvirt - cx);\n    bvirt = bx - bcx;\n    bcxtail = bx - (bcx + bvirt) + (bvirt - cx);\n    bvirt = ay - acy;\n    acytail = ay - (acy + bvirt) + (bvirt - cy);\n    bvirt = by - bcy;\n    bcytail = by - (bcy + bvirt) + (bvirt - cy);\n\n    if (acxtail === 0 && acytail === 0 && bcxtail === 0 && bcytail === 0) {\n        return det;\n    }\n\n    errbound = ccwerrboundC * detsum + resulterrbound * Math.abs(det);\n    det += (acx * bcytail + bcy * acxtail) - (acy * bcxtail + bcx * acytail);\n    if (det >= errbound || -det >= errbound) return det;\n\n    s1 = acxtail * bcy;\n    c = splitter * acxtail;\n    ahi = c - (c - acxtail);\n    alo = acxtail - ahi;\n    c = splitter * bcy;\n    bhi = c - (c - bcy);\n    blo = bcy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = acytail * bcx;\n    c = splitter * acytail;\n    ahi = c - (c - acytail);\n    alo = acytail - ahi;\n    c = splitter * bcx;\n    bhi = c - (c - bcx);\n    blo = bcx - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    u[3] = u3;\n    const C1len = sum(4, B, 4, u, C1);\n\n    s1 = acx * bcytail;\n    c = splitter * acx;\n    ahi = c - (c - acx);\n    alo = acx - ahi;\n    c = splitter * bcytail;\n    bhi = c - (c - bcytail);\n    blo = bcytail - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = acy * bcxtail;\n    c = splitter * acy;\n    ahi = c - (c - acy);\n    alo = acy - ahi;\n    c = splitter * bcxtail;\n    bhi = c - (c - bcxtail);\n    blo = bcxtail - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    u[3] = u3;\n    const C2len = sum(C1len, C1, 4, u, C2);\n\n    s1 = acxtail * bcytail;\n    c = splitter * acxtail;\n    ahi = c - (c - acxtail);\n    alo = acxtail - ahi;\n    c = splitter * bcytail;\n    bhi = c - (c - bcytail);\n    blo = bcytail - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = acytail * bcxtail;\n    c = splitter * acytail;\n    ahi = c - (c - acytail);\n    alo = acytail - ahi;\n    c = splitter * bcxtail;\n    bhi = c - (c - bcxtail);\n    blo = bcxtail - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    u[3] = u3;\n    const Dlen = sum(C2len, C2, 4, u, D);\n\n    return D[Dlen - 1];\n}\n\nexport function orient2d(ax, ay, bx, by, cx, cy) {\n    const detleft = (ay - cy) * (bx - cx);\n    const detright = (ax - cx) * (by - cy);\n    const det = detleft - detright;\n\n    const detsum = Math.abs(detleft + detright);\n    if (Math.abs(det) >= ccwerrboundA * detsum) return det;\n\n    return -orient2dadapt(ax, ay, bx, by, cx, cy, detsum);\n}\n\nexport function orient2dfast(ax, ay, bx, by, cx, cy) {\n    return (ay - cy) * (bx - cx) - (ax - cx) * (by - cy);\n}\n","import {epsilon, splitter, resulterrbound, estimate, vec, sum, scale} from './util.js';\n\nconst o3derrboundA = (7 + 56 * epsilon) * epsilon;\nconst o3derrboundB = (3 + 28 * epsilon) * epsilon;\nconst o3derrboundC = (26 + 288 * epsilon) * epsilon * epsilon;\n\nconst bc = vec(4);\nconst ca = vec(4);\nconst ab = vec(4);\nconst at_b = vec(4);\nconst at_c = vec(4);\nconst bt_c = vec(4);\nconst bt_a = vec(4);\nconst ct_a = vec(4);\nconst ct_b = vec(4);\nconst bct = vec(8);\nconst cat = vec(8);\nconst abt = vec(8);\nconst u = vec(4);\n\nconst _8 = vec(8);\nconst _8b = vec(8);\nconst _16 = vec(8);\nconst _12 = vec(12);\n\nlet fin = vec(192);\nlet fin2 = vec(192);\n\nfunction finadd(finlen, alen, a) {\n    finlen = sum(finlen, fin, alen, a, fin2);\n    const tmp = fin; fin = fin2; fin2 = tmp;\n    return finlen;\n}\n\nfunction tailinit(xtail, ytail, ax, ay, bx, by, a, b) {\n    let bvirt, c, ahi, alo, bhi, blo, _i, _j, _k, _0, s1, s0, t1, t0, u3, negate;\n    if (xtail === 0) {\n        if (ytail === 0) {\n            a[0] = 0;\n            b[0] = 0;\n            return 1;\n        } else {\n            negate = -ytail;\n            s1 = negate * ax;\n            c = splitter * negate;\n            ahi = c - (c - negate);\n            alo = negate - ahi;\n            c = splitter * ax;\n            bhi = c - (c - ax);\n            blo = ax - bhi;\n            a[0] = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            a[1] = s1;\n            s1 = ytail * bx;\n            c = splitter * ytail;\n            ahi = c - (c - ytail);\n            alo = ytail - ahi;\n            c = splitter * bx;\n            bhi = c - (c - bx);\n            blo = bx - bhi;\n            b[0] = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            b[1] = s1;\n            return 2;\n        }\n    } else {\n        if (ytail === 0) {\n            s1 = xtail * ay;\n            c = splitter * xtail;\n            ahi = c - (c - xtail);\n            alo = xtail - ahi;\n            c = splitter * ay;\n            bhi = c - (c - ay);\n            blo = ay - bhi;\n            a[0] = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            a[1] = s1;\n            negate = -xtail;\n            s1 = negate * by;\n            c = splitter * negate;\n            ahi = c - (c - negate);\n            alo = negate - ahi;\n            c = splitter * by;\n            bhi = c - (c - by);\n            blo = by - bhi;\n            b[0] = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            b[1] = s1;\n            return 2;\n        } else {\n            s1 = xtail * ay;\n            c = splitter * xtail;\n            ahi = c - (c - xtail);\n            alo = xtail - ahi;\n            c = splitter * ay;\n            bhi = c - (c - ay);\n            blo = ay - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = ytail * ax;\n            c = splitter * ytail;\n            ahi = c - (c - ytail);\n            alo = ytail - ahi;\n            c = splitter * ax;\n            bhi = c - (c - ax);\n            blo = ax - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 - t0;\n            bvirt = s0 - _i;\n            a[0] = s0 - (_i + bvirt) + (bvirt - t0);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 - t1;\n            bvirt = _0 - _i;\n            a[1] = _0 - (_i + bvirt) + (bvirt - t1);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            a[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            a[3] = u3;\n            s1 = ytail * bx;\n            c = splitter * ytail;\n            ahi = c - (c - ytail);\n            alo = ytail - ahi;\n            c = splitter * bx;\n            bhi = c - (c - bx);\n            blo = bx - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = xtail * by;\n            c = splitter * xtail;\n            ahi = c - (c - xtail);\n            alo = xtail - ahi;\n            c = splitter * by;\n            bhi = c - (c - by);\n            blo = by - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 - t0;\n            bvirt = s0 - _i;\n            b[0] = s0 - (_i + bvirt) + (bvirt - t0);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 - t1;\n            bvirt = _0 - _i;\n            b[1] = _0 - (_i + bvirt) + (bvirt - t1);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            b[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            b[3] = u3;\n            return 4;\n        }\n    }\n}\n\nfunction tailadd(finlen, a, b, k, z) {\n    let bvirt, c, ahi, alo, bhi, blo, _i, _j, _k, _0, s1, s0, u3;\n    s1 = a * b;\n    c = splitter * a;\n    ahi = c - (c - a);\n    alo = a - ahi;\n    c = splitter * b;\n    bhi = c - (c - b);\n    blo = b - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    c = splitter * k;\n    bhi = c - (c - k);\n    blo = k - bhi;\n    _i = s0 * k;\n    c = splitter * s0;\n    ahi = c - (c - s0);\n    alo = s0 - ahi;\n    u[0] = alo * blo - (_i - ahi * bhi - alo * bhi - ahi * blo);\n    _j = s1 * k;\n    c = splitter * s1;\n    ahi = c - (c - s1);\n    alo = s1 - ahi;\n    _0 = alo * blo - (_j - ahi * bhi - alo * bhi - ahi * blo);\n    _k = _i + _0;\n    bvirt = _k - _i;\n    u[1] = _i - (_k - bvirt) + (_0 - bvirt);\n    u3 = _j + _k;\n    u[2] = _k - (u3 - _j);\n    u[3] = u3;\n    finlen = finadd(finlen, 4, u);\n    if (z !== 0) {\n        c = splitter * z;\n        bhi = c - (c - z);\n        blo = z - bhi;\n        _i = s0 * z;\n        c = splitter * s0;\n        ahi = c - (c - s0);\n        alo = s0 - ahi;\n        u[0] = alo * blo - (_i - ahi * bhi - alo * bhi - ahi * blo);\n        _j = s1 * z;\n        c = splitter * s1;\n        ahi = c - (c - s1);\n        alo = s1 - ahi;\n        _0 = alo * blo - (_j - ahi * bhi - alo * bhi - ahi * blo);\n        _k = _i + _0;\n        bvirt = _k - _i;\n        u[1] = _i - (_k - bvirt) + (_0 - bvirt);\n        u3 = _j + _k;\n        u[2] = _k - (u3 - _j);\n        u[3] = u3;\n        finlen = finadd(finlen, 4, u);\n    }\n    return finlen;\n}\n\nfunction orient3dadapt(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, permanent) {\n    let finlen;\n    let adxtail, bdxtail, cdxtail;\n    let adytail, bdytail, cdytail;\n    let adztail, bdztail, cdztail;\n    let bvirt, c, ahi, alo, bhi, blo, _i, _j, _k, _0, s1, s0, t1, t0, u3;\n\n    const adx = ax - dx;\n    const bdx = bx - dx;\n    const cdx = cx - dx;\n    const ady = ay - dy;\n    const bdy = by - dy;\n    const cdy = cy - dy;\n    const adz = az - dz;\n    const bdz = bz - dz;\n    const cdz = cz - dz;\n\n    s1 = bdx * cdy;\n    c = splitter * bdx;\n    ahi = c - (c - bdx);\n    alo = bdx - ahi;\n    c = splitter * cdy;\n    bhi = c - (c - cdy);\n    blo = cdy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = cdx * bdy;\n    c = splitter * cdx;\n    ahi = c - (c - cdx);\n    alo = cdx - ahi;\n    c = splitter * bdy;\n    bhi = c - (c - bdy);\n    blo = bdy - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    bc[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    bc[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    bc[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    bc[3] = u3;\n    s1 = cdx * ady;\n    c = splitter * cdx;\n    ahi = c - (c - cdx);\n    alo = cdx - ahi;\n    c = splitter * ady;\n    bhi = c - (c - ady);\n    blo = ady - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = adx * cdy;\n    c = splitter * adx;\n    ahi = c - (c - adx);\n    alo = adx - ahi;\n    c = splitter * cdy;\n    bhi = c - (c - cdy);\n    blo = cdy - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ca[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ca[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    ca[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    ca[3] = u3;\n    s1 = adx * bdy;\n    c = splitter * adx;\n    ahi = c - (c - adx);\n    alo = adx - ahi;\n    c = splitter * bdy;\n    bhi = c - (c - bdy);\n    blo = bdy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = bdx * ady;\n    c = splitter * bdx;\n    ahi = c - (c - bdx);\n    alo = bdx - ahi;\n    c = splitter * ady;\n    bhi = c - (c - ady);\n    blo = ady - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ab[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ab[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    ab[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    ab[3] = u3;\n\n    finlen = sum(\n        sum(\n            scale(4, bc, adz, _8), _8,\n            scale(4, ca, bdz, _8b), _8b, _16), _16,\n        scale(4, ab, cdz, _8), _8, fin);\n\n    let det = estimate(finlen, fin);\n    let errbound = o3derrboundB * permanent;\n    if (det >= errbound || -det >= errbound) {\n        return det;\n    }\n\n    bvirt = ax - adx;\n    adxtail = ax - (adx + bvirt) + (bvirt - dx);\n    bvirt = bx - bdx;\n    bdxtail = bx - (bdx + bvirt) + (bvirt - dx);\n    bvirt = cx - cdx;\n    cdxtail = cx - (cdx + bvirt) + (bvirt - dx);\n    bvirt = ay - ady;\n    adytail = ay - (ady + bvirt) + (bvirt - dy);\n    bvirt = by - bdy;\n    bdytail = by - (bdy + bvirt) + (bvirt - dy);\n    bvirt = cy - cdy;\n    cdytail = cy - (cdy + bvirt) + (bvirt - dy);\n    bvirt = az - adz;\n    adztail = az - (adz + bvirt) + (bvirt - dz);\n    bvirt = bz - bdz;\n    bdztail = bz - (bdz + bvirt) + (bvirt - dz);\n    bvirt = cz - cdz;\n    cdztail = cz - (cdz + bvirt) + (bvirt - dz);\n\n    if (adxtail === 0 && bdxtail === 0 && cdxtail === 0 &&\n        adytail === 0 && bdytail === 0 && cdytail === 0 &&\n        adztail === 0 && bdztail === 0 && cdztail === 0) {\n        return det;\n    }\n\n    errbound = o3derrboundC * permanent + resulterrbound * Math.abs(det);\n    det +=\n        adz * (bdx * cdytail + cdy * bdxtail - (bdy * cdxtail + cdx * bdytail)) + adztail * (bdx * cdy - bdy * cdx) +\n        bdz * (cdx * adytail + ady * cdxtail - (cdy * adxtail + adx * cdytail)) + bdztail * (cdx * ady - cdy * adx) +\n        cdz * (adx * bdytail + bdy * adxtail - (ady * bdxtail + bdx * adytail)) + cdztail * (adx * bdy - ady * bdx);\n    if (det >= errbound || -det >= errbound) {\n        return det;\n    }\n\n    const at_len = tailinit(adxtail, adytail, bdx, bdy, cdx, cdy, at_b, at_c);\n    const bt_len = tailinit(bdxtail, bdytail, cdx, cdy, adx, ady, bt_c, bt_a);\n    const ct_len = tailinit(cdxtail, cdytail, adx, ady, bdx, bdy, ct_a, ct_b);\n\n    const bctlen = sum(bt_len, bt_c, ct_len, ct_b, bct);\n    finlen = finadd(finlen, scale(bctlen, bct, adz, _16), _16);\n\n    const catlen = sum(ct_len, ct_a, at_len, at_c, cat);\n    finlen = finadd(finlen, scale(catlen, cat, bdz, _16), _16);\n\n    const abtlen = sum(at_len, at_b, bt_len, bt_a, abt);\n    finlen = finadd(finlen, scale(abtlen, abt, cdz, _16), _16);\n\n    if (adztail !== 0) {\n        finlen = finadd(finlen, scale(4, bc, adztail, _12), _12);\n        finlen = finadd(finlen, scale(bctlen, bct, adztail, _16), _16);\n    }\n    if (bdztail !== 0) {\n        finlen = finadd(finlen, scale(4, ca, bdztail, _12), _12);\n        finlen = finadd(finlen, scale(catlen, cat, bdztail, _16), _16);\n    }\n    if (cdztail !== 0) {\n        finlen = finadd(finlen, scale(4, ab, cdztail, _12), _12);\n        finlen = finadd(finlen, scale(abtlen, abt, cdztail, _16), _16);\n    }\n\n    if (adxtail !== 0) {\n        if (bdytail !== 0) {\n            finlen = tailadd(finlen, adxtail, bdytail, cdz, cdztail);\n        }\n        if (cdytail !== 0) {\n            finlen = tailadd(finlen, -adxtail, cdytail, bdz, bdztail);\n        }\n    }\n    if (bdxtail !== 0) {\n        if (cdytail !== 0) {\n            finlen = tailadd(finlen, bdxtail, cdytail, adz, adztail);\n        }\n        if (adytail !== 0) {\n            finlen = tailadd(finlen, -bdxtail, adytail, cdz, cdztail);\n        }\n    }\n    if (cdxtail !== 0) {\n        if (adytail !== 0) {\n            finlen = tailadd(finlen, cdxtail, adytail, bdz, bdztail);\n        }\n        if (bdytail !== 0) {\n            finlen = tailadd(finlen, -cdxtail, bdytail, adz, adztail);\n        }\n    }\n\n    return fin[finlen - 1];\n}\n\nexport function orient3d(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz) {\n    const adx = ax - dx;\n    const bdx = bx - dx;\n    const cdx = cx - dx;\n    const ady = ay - dy;\n    const bdy = by - dy;\n    const cdy = cy - dy;\n    const adz = az - dz;\n    const bdz = bz - dz;\n    const cdz = cz - dz;\n\n    const bdxcdy = bdx * cdy;\n    const cdxbdy = cdx * bdy;\n\n    const cdxady = cdx * ady;\n    const adxcdy = adx * cdy;\n\n    const adxbdy = adx * bdy;\n    const bdxady = bdx * ady;\n\n    const det =\n        adz * (bdxcdy - cdxbdy) +\n        bdz * (cdxady - adxcdy) +\n        cdz * (adxbdy - bdxady);\n\n    const permanent =\n        (Math.abs(bdxcdy) + Math.abs(cdxbdy)) * Math.abs(adz) +\n        (Math.abs(cdxady) + Math.abs(adxcdy)) * Math.abs(bdz) +\n        (Math.abs(adxbdy) + Math.abs(bdxady)) * Math.abs(cdz);\n\n    const errbound = o3derrboundA * permanent;\n    if (det > errbound || -det > errbound) {\n        return det;\n    }\n\n    return orient3dadapt(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, permanent);\n}\n\nexport function orient3dfast(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz) {\n    const adx = ax - dx;\n    const bdx = bx - dx;\n    const cdx = cx - dx;\n    const ady = ay - dy;\n    const bdy = by - dy;\n    const cdy = cy - dy;\n    const adz = az - dz;\n    const bdz = bz - dz;\n    const cdz = cz - dz;\n\n    return adx * (bdy * cdz - bdz * cdy) +\n        bdx * (cdy * adz - cdz * ady) +\n        cdx * (ady * bdz - adz * bdy);\n}\n","import {epsilon, splitter, resulterrbound, estimate, vec, sum, sum_three, scale} from './util.js';\n\nconst iccerrboundA = (10 + 96 * epsilon) * epsilon;\nconst iccerrboundB = (4 + 48 * epsilon) * epsilon;\nconst iccerrboundC = (44 + 576 * epsilon) * epsilon * epsilon;\n\nconst bc = vec(4);\nconst ca = vec(4);\nconst ab = vec(4);\nconst aa = vec(4);\nconst bb = vec(4);\nconst cc = vec(4);\nconst u = vec(4);\nconst v = vec(4);\nconst axtbc = vec(8);\nconst aytbc = vec(8);\nconst bxtca = vec(8);\nconst bytca = vec(8);\nconst cxtab = vec(8);\nconst cytab = vec(8);\nconst abt = vec(8);\nconst bct = vec(8);\nconst cat = vec(8);\nconst abtt = vec(4);\nconst bctt = vec(4);\nconst catt = vec(4);\n\nconst _8 = vec(8);\nconst _16 = vec(16);\nconst _16b = vec(16);\nconst _16c = vec(16);\nconst _32 = vec(32);\nconst _32b = vec(32);\nconst _48 = vec(48);\nconst _64 = vec(64);\n\nlet fin = vec(1152);\nlet fin2 = vec(1152);\n\nfunction finadd(finlen, a, alen) {\n    finlen = sum(finlen, fin, a, alen, fin2);\n    const tmp = fin; fin = fin2; fin2 = tmp;\n    return finlen;\n}\n\nfunction incircleadapt(ax, ay, bx, by, cx, cy, dx, dy, permanent) {\n    let finlen;\n    let adxtail, bdxtail, cdxtail, adytail, bdytail, cdytail;\n    let axtbclen, aytbclen, bxtcalen, bytcalen, cxtablen, cytablen;\n    let abtlen, bctlen, catlen;\n    let abttlen, bcttlen, cattlen;\n    let n1, n0;\n\n    let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0, u3;\n\n    const adx = ax - dx;\n    const bdx = bx - dx;\n    const cdx = cx - dx;\n    const ady = ay - dy;\n    const bdy = by - dy;\n    const cdy = cy - dy;\n\n    s1 = bdx * cdy;\n    c = splitter * bdx;\n    ahi = c - (c - bdx);\n    alo = bdx - ahi;\n    c = splitter * cdy;\n    bhi = c - (c - cdy);\n    blo = cdy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = cdx * bdy;\n    c = splitter * cdx;\n    ahi = c - (c - cdx);\n    alo = cdx - ahi;\n    c = splitter * bdy;\n    bhi = c - (c - bdy);\n    blo = bdy - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    bc[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    bc[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    bc[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    bc[3] = u3;\n    s1 = cdx * ady;\n    c = splitter * cdx;\n    ahi = c - (c - cdx);\n    alo = cdx - ahi;\n    c = splitter * ady;\n    bhi = c - (c - ady);\n    blo = ady - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = adx * cdy;\n    c = splitter * adx;\n    ahi = c - (c - adx);\n    alo = adx - ahi;\n    c = splitter * cdy;\n    bhi = c - (c - cdy);\n    blo = cdy - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ca[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ca[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    ca[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    ca[3] = u3;\n    s1 = adx * bdy;\n    c = splitter * adx;\n    ahi = c - (c - adx);\n    alo = adx - ahi;\n    c = splitter * bdy;\n    bhi = c - (c - bdy);\n    blo = bdy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = bdx * ady;\n    c = splitter * bdx;\n    ahi = c - (c - bdx);\n    alo = bdx - ahi;\n    c = splitter * ady;\n    bhi = c - (c - ady);\n    blo = ady - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ab[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ab[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    ab[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    ab[3] = u3;\n\n    finlen = sum(\n        sum(\n            sum(\n                scale(scale(4, bc, adx, _8), _8, adx, _16), _16,\n                scale(scale(4, bc, ady, _8), _8, ady, _16b), _16b, _32), _32,\n            sum(\n                scale(scale(4, ca, bdx, _8), _8, bdx, _16), _16,\n                scale(scale(4, ca, bdy, _8), _8, bdy, _16b), _16b, _32b), _32b, _64), _64,\n        sum(\n            scale(scale(4, ab, cdx, _8), _8, cdx, _16), _16,\n            scale(scale(4, ab, cdy, _8), _8, cdy, _16b), _16b, _32), _32, fin);\n\n    let det = estimate(finlen, fin);\n    let errbound = iccerrboundB * permanent;\n    if (det >= errbound || -det >= errbound) {\n        return det;\n    }\n\n    bvirt = ax - adx;\n    adxtail = ax - (adx + bvirt) + (bvirt - dx);\n    bvirt = ay - ady;\n    adytail = ay - (ady + bvirt) + (bvirt - dy);\n    bvirt = bx - bdx;\n    bdxtail = bx - (bdx + bvirt) + (bvirt - dx);\n    bvirt = by - bdy;\n    bdytail = by - (bdy + bvirt) + (bvirt - dy);\n    bvirt = cx - cdx;\n    cdxtail = cx - (cdx + bvirt) + (bvirt - dx);\n    bvirt = cy - cdy;\n    cdytail = cy - (cdy + bvirt) + (bvirt - dy);\n    if (adxtail === 0 && bdxtail === 0 && cdxtail === 0 && adytail === 0 && bdytail === 0 && cdytail === 0) {\n        return det;\n    }\n\n    errbound = iccerrboundC * permanent + resulterrbound * Math.abs(det);\n    det += ((adx * adx + ady * ady) * ((bdx * cdytail + cdy * bdxtail) - (bdy * cdxtail + cdx * bdytail)) +\n        2 * (adx * adxtail + ady * adytail) * (bdx * cdy - bdy * cdx)) +\n        ((bdx * bdx + bdy * bdy) * ((cdx * adytail + ady * cdxtail) - (cdy * adxtail + adx * cdytail)) +\n        2 * (bdx * bdxtail + bdy * bdytail) * (cdx * ady - cdy * adx)) +\n        ((cdx * cdx + cdy * cdy) * ((adx * bdytail + bdy * adxtail) - (ady * bdxtail + bdx * adytail)) +\n        2 * (cdx * cdxtail + cdy * cdytail) * (adx * bdy - ady * bdx));\n\n    if (det >= errbound || -det >= errbound) {\n        return det;\n    }\n\n    if (bdxtail !== 0 || bdytail !== 0 || cdxtail !== 0 || cdytail !== 0) {\n        s1 = adx * adx;\n        c = splitter * adx;\n        ahi = c - (c - adx);\n        alo = adx - ahi;\n        s0 = alo * alo - (s1 - ahi * ahi - (ahi + ahi) * alo);\n        t1 = ady * ady;\n        c = splitter * ady;\n        ahi = c - (c - ady);\n        alo = ady - ahi;\n        t0 = alo * alo - (t1 - ahi * ahi - (ahi + ahi) * alo);\n        _i = s0 + t0;\n        bvirt = _i - s0;\n        aa[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n        _j = s1 + _i;\n        bvirt = _j - s1;\n        _0 = s1 - (_j - bvirt) + (_i - bvirt);\n        _i = _0 + t1;\n        bvirt = _i - _0;\n        aa[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n        u3 = _j + _i;\n        bvirt = u3 - _j;\n        aa[2] = _j - (u3 - bvirt) + (_i - bvirt);\n        aa[3] = u3;\n    }\n    if (cdxtail !== 0 || cdytail !== 0 || adxtail !== 0 || adytail !== 0) {\n        s1 = bdx * bdx;\n        c = splitter * bdx;\n        ahi = c - (c - bdx);\n        alo = bdx - ahi;\n        s0 = alo * alo - (s1 - ahi * ahi - (ahi + ahi) * alo);\n        t1 = bdy * bdy;\n        c = splitter * bdy;\n        ahi = c - (c - bdy);\n        alo = bdy - ahi;\n        t0 = alo * alo - (t1 - ahi * ahi - (ahi + ahi) * alo);\n        _i = s0 + t0;\n        bvirt = _i - s0;\n        bb[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n        _j = s1 + _i;\n        bvirt = _j - s1;\n        _0 = s1 - (_j - bvirt) + (_i - bvirt);\n        _i = _0 + t1;\n        bvirt = _i - _0;\n        bb[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n        u3 = _j + _i;\n        bvirt = u3 - _j;\n        bb[2] = _j - (u3 - bvirt) + (_i - bvirt);\n        bb[3] = u3;\n    }\n    if (adxtail !== 0 || adytail !== 0 || bdxtail !== 0 || bdytail !== 0) {\n        s1 = cdx * cdx;\n        c = splitter * cdx;\n        ahi = c - (c - cdx);\n        alo = cdx - ahi;\n        s0 = alo * alo - (s1 - ahi * ahi - (ahi + ahi) * alo);\n        t1 = cdy * cdy;\n        c = splitter * cdy;\n        ahi = c - (c - cdy);\n        alo = cdy - ahi;\n        t0 = alo * alo - (t1 - ahi * ahi - (ahi + ahi) * alo);\n        _i = s0 + t0;\n        bvirt = _i - s0;\n        cc[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n        _j = s1 + _i;\n        bvirt = _j - s1;\n        _0 = s1 - (_j - bvirt) + (_i - bvirt);\n        _i = _0 + t1;\n        bvirt = _i - _0;\n        cc[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n        u3 = _j + _i;\n        bvirt = u3 - _j;\n        cc[2] = _j - (u3 - bvirt) + (_i - bvirt);\n        cc[3] = u3;\n    }\n\n    if (adxtail !== 0) {\n        axtbclen = scale(4, bc, adxtail, axtbc);\n        finlen = finadd(finlen, sum_three(\n            scale(axtbclen, axtbc, 2 * adx, _16), _16,\n            scale(scale(4, cc, adxtail, _8), _8, bdy, _16b), _16b,\n            scale(scale(4, bb, adxtail, _8), _8, -cdy, _16c), _16c, _32, _48), _48);\n    }\n    if (adytail !== 0) {\n        aytbclen = scale(4, bc, adytail, aytbc);\n        finlen = finadd(finlen, sum_three(\n            scale(aytbclen, aytbc, 2 * ady, _16), _16,\n            scale(scale(4, bb, adytail, _8), _8, cdx, _16b), _16b,\n            scale(scale(4, cc, adytail, _8), _8, -bdx, _16c), _16c, _32, _48), _48);\n    }\n    if (bdxtail !== 0) {\n        bxtcalen = scale(4, ca, bdxtail, bxtca);\n        finlen = finadd(finlen, sum_three(\n            scale(bxtcalen, bxtca, 2 * bdx, _16), _16,\n            scale(scale(4, aa, bdxtail, _8), _8, cdy, _16b), _16b,\n            scale(scale(4, cc, bdxtail, _8), _8, -ady, _16c), _16c, _32, _48), _48);\n    }\n    if (bdytail !== 0) {\n        bytcalen = scale(4, ca, bdytail, bytca);\n        finlen = finadd(finlen, sum_three(\n            scale(bytcalen, bytca, 2 * bdy, _16), _16,\n            scale(scale(4, cc, bdytail, _8), _8, adx, _16b), _16b,\n            scale(scale(4, aa, bdytail, _8), _8, -cdx, _16c), _16c, _32, _48), _48);\n    }\n    if (cdxtail !== 0) {\n        cxtablen = scale(4, ab, cdxtail, cxtab);\n        finlen = finadd(finlen, sum_three(\n            scale(cxtablen, cxtab, 2 * cdx, _16), _16,\n            scale(scale(4, bb, cdxtail, _8), _8, ady, _16b), _16b,\n            scale(scale(4, aa, cdxtail, _8), _8, -bdy, _16c), _16c, _32, _48), _48);\n    }\n    if (cdytail !== 0) {\n        cytablen = scale(4, ab, cdytail, cytab);\n        finlen = finadd(finlen, sum_three(\n            scale(cytablen, cytab, 2 * cdy, _16), _16,\n            scale(scale(4, aa, cdytail, _8), _8, bdx, _16b), _16b,\n            scale(scale(4, bb, cdytail, _8), _8, -adx, _16c), _16c, _32, _48), _48);\n    }\n\n    if (adxtail !== 0 || adytail !== 0) {\n        if (bdxtail !== 0 || bdytail !== 0 || cdxtail !== 0 || cdytail !== 0) {\n            s1 = bdxtail * cdy;\n            c = splitter * bdxtail;\n            ahi = c - (c - bdxtail);\n            alo = bdxtail - ahi;\n            c = splitter * cdy;\n            bhi = c - (c - cdy);\n            blo = cdy - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = bdx * cdytail;\n            c = splitter * bdx;\n            ahi = c - (c - bdx);\n            alo = bdx - ahi;\n            c = splitter * cdytail;\n            bhi = c - (c - cdytail);\n            blo = cdytail - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 + t0;\n            bvirt = _i - s0;\n            u[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 + t1;\n            bvirt = _i - _0;\n            u[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            u[3] = u3;\n            s1 = cdxtail * -bdy;\n            c = splitter * cdxtail;\n            ahi = c - (c - cdxtail);\n            alo = cdxtail - ahi;\n            c = splitter * -bdy;\n            bhi = c - (c - -bdy);\n            blo = -bdy - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = cdx * -bdytail;\n            c = splitter * cdx;\n            ahi = c - (c - cdx);\n            alo = cdx - ahi;\n            c = splitter * -bdytail;\n            bhi = c - (c - -bdytail);\n            blo = -bdytail - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 + t0;\n            bvirt = _i - s0;\n            v[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 + t1;\n            bvirt = _i - _0;\n            v[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            v[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            v[3] = u3;\n            bctlen = sum(4, u, 4, v, bct);\n            s1 = bdxtail * cdytail;\n            c = splitter * bdxtail;\n            ahi = c - (c - bdxtail);\n            alo = bdxtail - ahi;\n            c = splitter * cdytail;\n            bhi = c - (c - cdytail);\n            blo = cdytail - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = cdxtail * bdytail;\n            c = splitter * cdxtail;\n            ahi = c - (c - cdxtail);\n            alo = cdxtail - ahi;\n            c = splitter * bdytail;\n            bhi = c - (c - bdytail);\n            blo = bdytail - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 - t0;\n            bvirt = s0 - _i;\n            bctt[0] = s0 - (_i + bvirt) + (bvirt - t0);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 - t1;\n            bvirt = _0 - _i;\n            bctt[1] = _0 - (_i + bvirt) + (bvirt - t1);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            bctt[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            bctt[3] = u3;\n            bcttlen = 4;\n        } else {\n            bct[0] = 0;\n            bctlen = 1;\n            bctt[0] = 0;\n            bcttlen = 1;\n        }\n        if (adxtail !== 0) {\n            const len = scale(bctlen, bct, adxtail, _16c);\n            finlen = finadd(finlen, sum(\n                scale(axtbclen, axtbc, adxtail, _16), _16,\n                scale(len, _16c, 2 * adx, _32), _32, _48), _48);\n\n            const len2 = scale(bcttlen, bctt, adxtail, _8);\n            finlen = finadd(finlen, sum_three(\n                scale(len2, _8, 2 * adx, _16), _16,\n                scale(len2, _8, adxtail, _16b), _16b,\n                scale(len, _16c, adxtail, _32), _32, _32b, _64), _64);\n\n            if (bdytail !== 0) {\n                finlen = finadd(finlen, scale(scale(4, cc, adxtail, _8), _8, bdytail, _16), _16);\n            }\n            if (cdytail !== 0) {\n                finlen = finadd(finlen, scale(scale(4, bb, -adxtail, _8), _8, cdytail, _16), _16);\n            }\n        }\n        if (adytail !== 0) {\n            const len = scale(bctlen, bct, adytail, _16c);\n            finlen = finadd(finlen, sum(\n                scale(aytbclen, aytbc, adytail, _16), _16,\n                scale(len, _16c, 2 * ady, _32), _32, _48), _48);\n\n            const len2 = scale(bcttlen, bctt, adytail, _8);\n            finlen = finadd(finlen, sum_three(\n                scale(len2, _8, 2 * ady, _16), _16,\n                scale(len2, _8, adytail, _16b), _16b,\n                scale(len, _16c, adytail, _32), _32, _32b, _64), _64);\n        }\n    }\n    if (bdxtail !== 0 || bdytail !== 0) {\n        if (cdxtail !== 0 || cdytail !== 0 || adxtail !== 0 || adytail !== 0) {\n            s1 = cdxtail * ady;\n            c = splitter * cdxtail;\n            ahi = c - (c - cdxtail);\n            alo = cdxtail - ahi;\n            c = splitter * ady;\n            bhi = c - (c - ady);\n            blo = ady - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = cdx * adytail;\n            c = splitter * cdx;\n            ahi = c - (c - cdx);\n            alo = cdx - ahi;\n            c = splitter * adytail;\n            bhi = c - (c - adytail);\n            blo = adytail - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 + t0;\n            bvirt = _i - s0;\n            u[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 + t1;\n            bvirt = _i - _0;\n            u[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            u[3] = u3;\n            n1 = -cdy;\n            n0 = -cdytail;\n            s1 = adxtail * n1;\n            c = splitter * adxtail;\n            ahi = c - (c - adxtail);\n            alo = adxtail - ahi;\n            c = splitter * n1;\n            bhi = c - (c - n1);\n            blo = n1 - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = adx * n0;\n            c = splitter * adx;\n            ahi = c - (c - adx);\n            alo = adx - ahi;\n            c = splitter * n0;\n            bhi = c - (c - n0);\n            blo = n0 - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 + t0;\n            bvirt = _i - s0;\n            v[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 + t1;\n            bvirt = _i - _0;\n            v[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            v[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            v[3] = u3;\n            catlen = sum(4, u, 4, v, cat);\n            s1 = cdxtail * adytail;\n            c = splitter * cdxtail;\n            ahi = c - (c - cdxtail);\n            alo = cdxtail - ahi;\n            c = splitter * adytail;\n            bhi = c - (c - adytail);\n            blo = adytail - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = adxtail * cdytail;\n            c = splitter * adxtail;\n            ahi = c - (c - adxtail);\n            alo = adxtail - ahi;\n            c = splitter * cdytail;\n            bhi = c - (c - cdytail);\n            blo = cdytail - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 - t0;\n            bvirt = s0 - _i;\n            catt[0] = s0 - (_i + bvirt) + (bvirt - t0);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 - t1;\n            bvirt = _0 - _i;\n            catt[1] = _0 - (_i + bvirt) + (bvirt - t1);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            catt[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            catt[3] = u3;\n            cattlen = 4;\n        } else {\n            cat[0] = 0;\n            catlen = 1;\n            catt[0] = 0;\n            cattlen = 1;\n        }\n        if (bdxtail !== 0) {\n            const len = scale(catlen, cat, bdxtail, _16c);\n            finlen = finadd(finlen, sum(\n                scale(bxtcalen, bxtca, bdxtail, _16), _16,\n                scale(len, _16c, 2 * bdx, _32), _32, _48), _48);\n\n            const len2 = scale(cattlen, catt, bdxtail, _8);\n            finlen = finadd(finlen, sum_three(\n                scale(len2, _8, 2 * bdx, _16), _16,\n                scale(len2, _8, bdxtail, _16b), _16b,\n                scale(len, _16c, bdxtail, _32), _32, _32b, _64), _64);\n\n            if (cdytail !== 0) {\n                finlen = finadd(finlen, scale(scale(4, aa, bdxtail, _8), _8, cdytail, _16), _16);\n            }\n            if (adytail !== 0) {\n                finlen = finadd(finlen, scale(scale(4, cc, -bdxtail, _8), _8, adytail, _16), _16);\n            }\n        }\n        if (bdytail !== 0) {\n            const len = scale(catlen, cat, bdytail, _16c);\n            finlen = finadd(finlen, sum(\n                scale(bytcalen, bytca, bdytail, _16), _16,\n                scale(len, _16c, 2 * bdy, _32), _32, _48), _48);\n\n            const len2 = scale(cattlen, catt, bdytail, _8);\n            finlen = finadd(finlen, sum_three(\n                scale(len2, _8, 2 * bdy, _16), _16,\n                scale(len2, _8, bdytail, _16b), _16b,\n                scale(len, _16c, bdytail, _32), _32,  _32b, _64), _64);\n        }\n    }\n    if (cdxtail !== 0 || cdytail !== 0) {\n        if (adxtail !== 0 || adytail !== 0 || bdxtail !== 0 || bdytail !== 0) {\n            s1 = adxtail * bdy;\n            c = splitter * adxtail;\n            ahi = c - (c - adxtail);\n            alo = adxtail - ahi;\n            c = splitter * bdy;\n            bhi = c - (c - bdy);\n            blo = bdy - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = adx * bdytail;\n            c = splitter * adx;\n            ahi = c - (c - adx);\n            alo = adx - ahi;\n            c = splitter * bdytail;\n            bhi = c - (c - bdytail);\n            blo = bdytail - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 + t0;\n            bvirt = _i - s0;\n            u[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 + t1;\n            bvirt = _i - _0;\n            u[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            u[3] = u3;\n            n1 = -ady;\n            n0 = -adytail;\n            s1 = bdxtail * n1;\n            c = splitter * bdxtail;\n            ahi = c - (c - bdxtail);\n            alo = bdxtail - ahi;\n            c = splitter * n1;\n            bhi = c - (c - n1);\n            blo = n1 - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = bdx * n0;\n            c = splitter * bdx;\n            ahi = c - (c - bdx);\n            alo = bdx - ahi;\n            c = splitter * n0;\n            bhi = c - (c - n0);\n            blo = n0 - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 + t0;\n            bvirt = _i - s0;\n            v[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 + t1;\n            bvirt = _i - _0;\n            v[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            v[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            v[3] = u3;\n            abtlen = sum(4, u, 4, v, abt);\n            s1 = adxtail * bdytail;\n            c = splitter * adxtail;\n            ahi = c - (c - adxtail);\n            alo = adxtail - ahi;\n            c = splitter * bdytail;\n            bhi = c - (c - bdytail);\n            blo = bdytail - bhi;\n            s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n            t1 = bdxtail * adytail;\n            c = splitter * bdxtail;\n            ahi = c - (c - bdxtail);\n            alo = bdxtail - ahi;\n            c = splitter * adytail;\n            bhi = c - (c - adytail);\n            blo = adytail - bhi;\n            t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n            _i = s0 - t0;\n            bvirt = s0 - _i;\n            abtt[0] = s0 - (_i + bvirt) + (bvirt - t0);\n            _j = s1 + _i;\n            bvirt = _j - s1;\n            _0 = s1 - (_j - bvirt) + (_i - bvirt);\n            _i = _0 - t1;\n            bvirt = _0 - _i;\n            abtt[1] = _0 - (_i + bvirt) + (bvirt - t1);\n            u3 = _j + _i;\n            bvirt = u3 - _j;\n            abtt[2] = _j - (u3 - bvirt) + (_i - bvirt);\n            abtt[3] = u3;\n            abttlen = 4;\n        } else {\n            abt[0] = 0;\n            abtlen = 1;\n            abtt[0] = 0;\n            abttlen = 1;\n        }\n        if (cdxtail !== 0) {\n            const len = scale(abtlen, abt, cdxtail, _16c);\n            finlen = finadd(finlen, sum(\n                scale(cxtablen, cxtab, cdxtail, _16), _16,\n                scale(len, _16c, 2 * cdx, _32), _32, _48), _48);\n\n            const len2 = scale(abttlen, abtt, cdxtail, _8);\n            finlen = finadd(finlen, sum_three(\n                scale(len2, _8, 2 * cdx, _16), _16,\n                scale(len2, _8, cdxtail, _16b), _16b,\n                scale(len, _16c, cdxtail, _32), _32, _32b, _64), _64);\n\n            if (adytail !== 0) {\n                finlen = finadd(finlen, scale(scale(4, bb, cdxtail, _8), _8, adytail, _16), _16);\n            }\n            if (bdytail !== 0) {\n                finlen = finadd(finlen, scale(scale(4, aa, -cdxtail, _8), _8, bdytail, _16), _16);\n            }\n        }\n        if (cdytail !== 0) {\n            const len = scale(abtlen, abt, cdytail, _16c);\n            finlen = finadd(finlen, sum(\n                scale(cytablen, cytab, cdytail, _16), _16,\n                scale(len, _16c, 2 * cdy, _32), _32, _48), _48);\n\n            const len2 = scale(abttlen, abtt, cdytail, _8);\n            finlen = finadd(finlen, sum_three(\n                scale(len2, _8, 2 * cdy, _16), _16,\n                scale(len2, _8, cdytail, _16b), _16b,\n                scale(len, _16c, cdytail, _32), _32, _32b, _64), _64);\n        }\n    }\n\n    return fin[finlen - 1];\n}\n\nexport function incircle(ax, ay, bx, by, cx, cy, dx, dy) {\n    const adx = ax - dx;\n    const bdx = bx - dx;\n    const cdx = cx - dx;\n    const ady = ay - dy;\n    const bdy = by - dy;\n    const cdy = cy - dy;\n\n    const bdxcdy = bdx * cdy;\n    const cdxbdy = cdx * bdy;\n    const alift = adx * adx + ady * ady;\n\n    const cdxady = cdx * ady;\n    const adxcdy = adx * cdy;\n    const blift = bdx * bdx + bdy * bdy;\n\n    const adxbdy = adx * bdy;\n    const bdxady = bdx * ady;\n    const clift = cdx * cdx + cdy * cdy;\n\n    const det =\n        alift * (bdxcdy - cdxbdy) +\n        blift * (cdxady - adxcdy) +\n        clift * (adxbdy - bdxady);\n\n    const permanent =\n        (Math.abs(bdxcdy) + Math.abs(cdxbdy)) * alift +\n        (Math.abs(cdxady) + Math.abs(adxcdy)) * blift +\n        (Math.abs(adxbdy) + Math.abs(bdxady)) * clift;\n\n    const errbound = iccerrboundA * permanent;\n\n    if (det > errbound || -det > errbound) {\n        return det;\n    }\n    return incircleadapt(ax, ay, bx, by, cx, cy, dx, dy, permanent);\n}\n\nexport function incirclefast(ax, ay, bx, by, cx, cy, dx, dy) {\n    const adx = ax - dx;\n    const ady = ay - dy;\n    const bdx = bx - dx;\n    const bdy = by - dy;\n    const cdx = cx - dx;\n    const cdy = cy - dy;\n\n    const abdet = adx * bdy - bdx * ady;\n    const bcdet = bdx * cdy - cdx * bdy;\n    const cadet = cdx * ady - adx * cdy;\n    const alift = adx * adx + ady * ady;\n    const blift = bdx * bdx + bdy * bdy;\n    const clift = cdx * cdx + cdy * cdy;\n\n    return alift * bcdet + blift * cadet + clift * abdet;\n}\n","import {epsilon, splitter, resulterrbound, estimate, vec, sum, sum_three, scale, negate} from './util.js';\n\nconst isperrboundA = (16 + 224 * epsilon) * epsilon;\nconst isperrboundB = (5 + 72 * epsilon) * epsilon;\nconst isperrboundC = (71 + 1408 * epsilon) * epsilon * epsilon;\n\nconst ab = vec(4);\nconst bc = vec(4);\nconst cd = vec(4);\nconst de = vec(4);\nconst ea = vec(4);\nconst ac = vec(4);\nconst bd = vec(4);\nconst ce = vec(4);\nconst da = vec(4);\nconst eb = vec(4);\n\nconst abc = vec(24);\nconst bcd = vec(24);\nconst cde = vec(24);\nconst dea = vec(24);\nconst eab = vec(24);\nconst abd = vec(24);\nconst bce = vec(24);\nconst cda = vec(24);\nconst deb = vec(24);\nconst eac = vec(24);\n\nconst adet = vec(1152);\nconst bdet = vec(1152);\nconst cdet = vec(1152);\nconst ddet = vec(1152);\nconst edet = vec(1152);\nconst abdet = vec(2304);\nconst cddet = vec(2304);\nconst cdedet = vec(3456);\nconst deter = vec(5760);\n\nconst _8 = vec(8);\nconst _8b = vec(8);\nconst _8c = vec(8);\nconst _16 = vec(16);\nconst _24 = vec(24);\nconst _48 = vec(48);\nconst _48b = vec(48);\nconst _96 = vec(96);\nconst _192 = vec(192);\nconst _384x = vec(384);\nconst _384y = vec(384);\nconst _384z = vec(384);\nconst _768 = vec(768);\n\nfunction sum_three_scale(a, b, c, az, bz, cz, out) {\n    return sum_three(\n        scale(4, a, az, _8), _8,\n        scale(4, b, bz, _8b), _8b,\n        scale(4, c, cz, _8c), _8c, _16, out);\n}\n\nfunction liftexact(alen, a, blen, b, clen, c, dlen, d, x, y, z, out) {\n    const len = sum(\n        sum(alen, a, blen, b, _48), _48,\n        negate(sum(clen, c, dlen, d, _48b), _48b), _48b, _96);\n\n    return sum_three(\n        scale(scale(len, _96, x, _192), _192, x, _384x), _384x,\n        scale(scale(len, _96, y, _192), _192, y, _384y), _384y,\n        scale(scale(len, _96, z, _192), _192, z, _384z), _384z, _768, out);\n}\n\nfunction insphereexact(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez) {\n    let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0, u3;\n\n    s1 = ax * by;\n    c = splitter * ax;\n    ahi = c - (c - ax);\n    alo = ax - ahi;\n    c = splitter * by;\n    bhi = c - (c - by);\n    blo = by - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = bx * ay;\n    c = splitter * bx;\n    ahi = c - (c - bx);\n    alo = bx - ahi;\n    c = splitter * ay;\n    bhi = c - (c - ay);\n    blo = ay - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ab[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ab[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    ab[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    ab[3] = u3;\n    s1 = bx * cy;\n    c = splitter * bx;\n    ahi = c - (c - bx);\n    alo = bx - ahi;\n    c = splitter * cy;\n    bhi = c - (c - cy);\n    blo = cy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = cx * by;\n    c = splitter * cx;\n    ahi = c - (c - cx);\n    alo = cx - ahi;\n    c = splitter * by;\n    bhi = c - (c - by);\n    blo = by - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    bc[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    bc[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    bc[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    bc[3] = u3;\n    s1 = cx * dy;\n    c = splitter * cx;\n    ahi = c - (c - cx);\n    alo = cx - ahi;\n    c = splitter * dy;\n    bhi = c - (c - dy);\n    blo = dy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = dx * cy;\n    c = splitter * dx;\n    ahi = c - (c - dx);\n    alo = dx - ahi;\n    c = splitter * cy;\n    bhi = c - (c - cy);\n    blo = cy - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    cd[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    cd[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    cd[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    cd[3] = u3;\n    s1 = dx * ey;\n    c = splitter * dx;\n    ahi = c - (c - dx);\n    alo = dx - ahi;\n    c = splitter * ey;\n    bhi = c - (c - ey);\n    blo = ey - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = ex * dy;\n    c = splitter * ex;\n    ahi = c - (c - ex);\n    alo = ex - ahi;\n    c = splitter * dy;\n    bhi = c - (c - dy);\n    blo = dy - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    de[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    de[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    de[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    de[3] = u3;\n    s1 = ex * ay;\n    c = splitter * ex;\n    ahi = c - (c - ex);\n    alo = ex - ahi;\n    c = splitter * ay;\n    bhi = c - (c - ay);\n    blo = ay - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = ax * ey;\n    c = splitter * ax;\n    ahi = c - (c - ax);\n    alo = ax - ahi;\n    c = splitter * ey;\n    bhi = c - (c - ey);\n    blo = ey - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ea[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ea[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    ea[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    ea[3] = u3;\n    s1 = ax * cy;\n    c = splitter * ax;\n    ahi = c - (c - ax);\n    alo = ax - ahi;\n    c = splitter * cy;\n    bhi = c - (c - cy);\n    blo = cy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = cx * ay;\n    c = splitter * cx;\n    ahi = c - (c - cx);\n    alo = cx - ahi;\n    c = splitter * ay;\n    bhi = c - (c - ay);\n    blo = ay - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ac[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ac[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    ac[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    ac[3] = u3;\n    s1 = bx * dy;\n    c = splitter * bx;\n    ahi = c - (c - bx);\n    alo = bx - ahi;\n    c = splitter * dy;\n    bhi = c - (c - dy);\n    blo = dy - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = dx * by;\n    c = splitter * dx;\n    ahi = c - (c - dx);\n    alo = dx - ahi;\n    c = splitter * by;\n    bhi = c - (c - by);\n    blo = by - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    bd[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    bd[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    bd[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    bd[3] = u3;\n    s1 = cx * ey;\n    c = splitter * cx;\n    ahi = c - (c - cx);\n    alo = cx - ahi;\n    c = splitter * ey;\n    bhi = c - (c - ey);\n    blo = ey - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = ex * cy;\n    c = splitter * ex;\n    ahi = c - (c - ex);\n    alo = ex - ahi;\n    c = splitter * cy;\n    bhi = c - (c - cy);\n    blo = cy - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ce[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ce[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    ce[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    ce[3] = u3;\n    s1 = dx * ay;\n    c = splitter * dx;\n    ahi = c - (c - dx);\n    alo = dx - ahi;\n    c = splitter * ay;\n    bhi = c - (c - ay);\n    blo = ay - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = ax * dy;\n    c = splitter * ax;\n    ahi = c - (c - ax);\n    alo = ax - ahi;\n    c = splitter * dy;\n    bhi = c - (c - dy);\n    blo = dy - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    da[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    da[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    da[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    da[3] = u3;\n    s1 = ex * by;\n    c = splitter * ex;\n    ahi = c - (c - ex);\n    alo = ex - ahi;\n    c = splitter * by;\n    bhi = c - (c - by);\n    blo = by - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = bx * ey;\n    c = splitter * bx;\n    ahi = c - (c - bx);\n    alo = bx - ahi;\n    c = splitter * ey;\n    bhi = c - (c - ey);\n    blo = ey - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    eb[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    eb[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    u3 = _j + _i;\n    bvirt = u3 - _j;\n    eb[2] = _j - (u3 - bvirt) + (_i - bvirt);\n    eb[3] = u3;\n\n    const abclen = sum_three_scale(ab, bc, ac, cz, az, -bz, abc);\n    const bcdlen = sum_three_scale(bc, cd, bd, dz, bz, -cz, bcd);\n    const cdelen = sum_three_scale(cd, de, ce, ez, cz, -dz, cde);\n    const dealen = sum_three_scale(de, ea, da, az, dz, -ez, dea);\n    const eablen = sum_three_scale(ea, ab, eb, bz, ez, -az, eab);\n    const abdlen = sum_three_scale(ab, bd, da, dz, az, bz, abd);\n    const bcelen = sum_three_scale(bc, ce, eb, ez, bz, cz, bce);\n    const cdalen = sum_three_scale(cd, da, ac, az, cz, dz, cda);\n    const deblen = sum_three_scale(de, eb, bd, bz, dz, ez, deb);\n    const eaclen = sum_three_scale(ea, ac, ce, cz, ez, az, eac);\n\n    const deterlen = sum_three(\n        liftexact(cdelen, cde, bcelen, bce, deblen, deb, bcdlen, bcd, ax, ay, az, adet), adet,\n        liftexact(dealen, dea, cdalen, cda, eaclen, eac, cdelen, cde, bx, by, bz, bdet), bdet,\n        sum_three(\n            liftexact(eablen, eab, deblen, deb, abdlen, abd, dealen, dea, cx, cy, cz, cdet), cdet,\n            liftexact(abclen, abc, eaclen, eac, bcelen, bce, eablen, eab, dx, dy, dz, ddet), ddet,\n            liftexact(bcdlen, bcd, abdlen, abd, cdalen, cda, abclen, abc, ex, ey, ez, edet), edet, cddet, cdedet), cdedet, abdet, deter);\n\n    return deter[deterlen - 1];\n}\n\nconst xdet = vec(96);\nconst ydet = vec(96);\nconst zdet = vec(96);\nconst fin = vec(1152);\n\nfunction liftadapt(a, b, c, az, bz, cz, x, y, z, out) {\n    const len = sum_three_scale(a, b, c, az, bz, cz, _24);\n    return sum_three(\n        scale(scale(len, _24, x, _48), _48, x, xdet), xdet,\n        scale(scale(len, _24, y, _48), _48, y, ydet), ydet,\n        scale(scale(len, _24, z, _48), _48, z, zdet), zdet, _192, out);\n}\n\nfunction insphereadapt(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez, permanent) {\n    let ab3, bc3, cd3, da3, ac3, bd3;\n\n    let aextail, bextail, cextail, dextail;\n    let aeytail, beytail, ceytail, deytail;\n    let aeztail, beztail, ceztail, deztail;\n\n    let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0;\n\n    const aex = ax - ex;\n    const bex = bx - ex;\n    const cex = cx - ex;\n    const dex = dx - ex;\n    const aey = ay - ey;\n    const bey = by - ey;\n    const cey = cy - ey;\n    const dey = dy - ey;\n    const aez = az - ez;\n    const bez = bz - ez;\n    const cez = cz - ez;\n    const dez = dz - ez;\n\n    s1 = aex * bey;\n    c = splitter * aex;\n    ahi = c - (c - aex);\n    alo = aex - ahi;\n    c = splitter * bey;\n    bhi = c - (c - bey);\n    blo = bey - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = bex * aey;\n    c = splitter * bex;\n    ahi = c - (c - bex);\n    alo = bex - ahi;\n    c = splitter * aey;\n    bhi = c - (c - aey);\n    blo = aey - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ab[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ab[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    ab3 = _j + _i;\n    bvirt = ab3 - _j;\n    ab[2] = _j - (ab3 - bvirt) + (_i - bvirt);\n    ab[3] = ab3;\n    s1 = bex * cey;\n    c = splitter * bex;\n    ahi = c - (c - bex);\n    alo = bex - ahi;\n    c = splitter * cey;\n    bhi = c - (c - cey);\n    blo = cey - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = cex * bey;\n    c = splitter * cex;\n    ahi = c - (c - cex);\n    alo = cex - ahi;\n    c = splitter * bey;\n    bhi = c - (c - bey);\n    blo = bey - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    bc[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    bc[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    bc3 = _j + _i;\n    bvirt = bc3 - _j;\n    bc[2] = _j - (bc3 - bvirt) + (_i - bvirt);\n    bc[3] = bc3;\n    s1 = cex * dey;\n    c = splitter * cex;\n    ahi = c - (c - cex);\n    alo = cex - ahi;\n    c = splitter * dey;\n    bhi = c - (c - dey);\n    blo = dey - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = dex * cey;\n    c = splitter * dex;\n    ahi = c - (c - dex);\n    alo = dex - ahi;\n    c = splitter * cey;\n    bhi = c - (c - cey);\n    blo = cey - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    cd[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    cd[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    cd3 = _j + _i;\n    bvirt = cd3 - _j;\n    cd[2] = _j - (cd3 - bvirt) + (_i - bvirt);\n    cd[3] = cd3;\n    s1 = dex * aey;\n    c = splitter * dex;\n    ahi = c - (c - dex);\n    alo = dex - ahi;\n    c = splitter * aey;\n    bhi = c - (c - aey);\n    blo = aey - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = aex * dey;\n    c = splitter * aex;\n    ahi = c - (c - aex);\n    alo = aex - ahi;\n    c = splitter * dey;\n    bhi = c - (c - dey);\n    blo = dey - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    da[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    da[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    da3 = _j + _i;\n    bvirt = da3 - _j;\n    da[2] = _j - (da3 - bvirt) + (_i - bvirt);\n    da[3] = da3;\n    s1 = aex * cey;\n    c = splitter * aex;\n    ahi = c - (c - aex);\n    alo = aex - ahi;\n    c = splitter * cey;\n    bhi = c - (c - cey);\n    blo = cey - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = cex * aey;\n    c = splitter * cex;\n    ahi = c - (c - cex);\n    alo = cex - ahi;\n    c = splitter * aey;\n    bhi = c - (c - aey);\n    blo = aey - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    ac[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    ac[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    ac3 = _j + _i;\n    bvirt = ac3 - _j;\n    ac[2] = _j - (ac3 - bvirt) + (_i - bvirt);\n    ac[3] = ac3;\n    s1 = bex * dey;\n    c = splitter * bex;\n    ahi = c - (c - bex);\n    alo = bex - ahi;\n    c = splitter * dey;\n    bhi = c - (c - dey);\n    blo = dey - bhi;\n    s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n    t1 = dex * bey;\n    c = splitter * dex;\n    ahi = c - (c - dex);\n    alo = dex - ahi;\n    c = splitter * bey;\n    bhi = c - (c - bey);\n    blo = bey - bhi;\n    t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n    _i = s0 - t0;\n    bvirt = s0 - _i;\n    bd[0] = s0 - (_i + bvirt) + (bvirt - t0);\n    _j = s1 + _i;\n    bvirt = _j - s1;\n    _0 = s1 - (_j - bvirt) + (_i - bvirt);\n    _i = _0 - t1;\n    bvirt = _0 - _i;\n    bd[1] = _0 - (_i + bvirt) + (bvirt - t1);\n    bd3 = _j + _i;\n    bvirt = bd3 - _j;\n    bd[2] = _j - (bd3 - bvirt) + (_i - bvirt);\n    bd[3] = bd3;\n\n    const finlen = sum(\n        sum(\n            negate(liftadapt(bc, cd, bd, dez, bez, -cez, aex, aey, aez, adet), adet), adet,\n            liftadapt(cd, da, ac, aez, cez, dez, bex, bey, bez, bdet), bdet, abdet), abdet,\n        sum(\n            negate(liftadapt(da, ab, bd, bez, dez, aez, cex, cey, cez, cdet), cdet), cdet,\n            liftadapt(ab, bc, ac, cez, aez, -bez, dex, dey, dez, ddet), ddet, cddet), cddet, fin);\n\n    let det = estimate(finlen, fin);\n    let errbound = isperrboundB * permanent;\n    if (det >= errbound || -det >= errbound) {\n        return det;\n    }\n\n    bvirt = ax - aex;\n    aextail = ax - (aex + bvirt) + (bvirt - ex);\n    bvirt = ay - aey;\n    aeytail = ay - (aey + bvirt) + (bvirt - ey);\n    bvirt = az - aez;\n    aeztail = az - (aez + bvirt) + (bvirt - ez);\n    bvirt = bx - bex;\n    bextail = bx - (bex + bvirt) + (bvirt - ex);\n    bvirt = by - bey;\n    beytail = by - (bey + bvirt) + (bvirt - ey);\n    bvirt = bz - bez;\n    beztail = bz - (bez + bvirt) + (bvirt - ez);\n    bvirt = cx - cex;\n    cextail = cx - (cex + bvirt) + (bvirt - ex);\n    bvirt = cy - cey;\n    ceytail = cy - (cey + bvirt) + (bvirt - ey);\n    bvirt = cz - cez;\n    ceztail = cz - (cez + bvirt) + (bvirt - ez);\n    bvirt = dx - dex;\n    dextail = dx - (dex + bvirt) + (bvirt - ex);\n    bvirt = dy - dey;\n    deytail = dy - (dey + bvirt) + (bvirt - ey);\n    bvirt = dz - dez;\n    deztail = dz - (dez + bvirt) + (bvirt - ez);\n    if (aextail === 0 && aeytail === 0 && aeztail === 0 &&\n        bextail === 0 && beytail === 0 && beztail === 0 &&\n        cextail === 0 && ceytail === 0 && ceztail === 0 &&\n        dextail === 0 && deytail === 0 && deztail === 0) {\n        return det;\n    }\n\n    errbound = isperrboundC * permanent + resulterrbound * Math.abs(det);\n\n    const abeps = (aex * beytail + bey * aextail) - (aey * bextail + bex * aeytail);\n    const bceps = (bex * ceytail + cey * bextail) - (bey * cextail + cex * beytail);\n    const cdeps = (cex * deytail + dey * cextail) - (cey * dextail + dex * ceytail);\n    const daeps = (dex * aeytail + aey * dextail) - (dey * aextail + aex * deytail);\n    const aceps = (aex * ceytail + cey * aextail) - (aey * cextail + cex * aeytail);\n    const bdeps = (bex * deytail + dey * bextail) - (bey * dextail + dex * beytail);\n    det +=\n        (((bex * bex + bey * bey + bez * bez) * ((cez * daeps + dez * aceps + aez * cdeps) +\n        (ceztail * da3 + deztail * ac3 + aeztail * cd3)) + (dex * dex + dey * dey + dez * dez) *\n        ((aez * bceps - bez * aceps + cez * abeps) + (aeztail * bc3 - beztail * ac3 + ceztail * ab3))) -\n        ((aex * aex + aey * aey + aez * aez) * ((bez * cdeps - cez * bdeps + dez * bceps) +\n        (beztail * cd3 - ceztail * bd3 + deztail * bc3)) + (cex * cex + cey * cey + cez * cez) *\n        ((dez * abeps + aez * bdeps + bez * daeps) + (deztail * ab3 + aeztail * bd3 + beztail * da3)))) +\n        2 * (((bex * bextail + bey * beytail + bez * beztail) * (cez * da3 + dez * ac3 + aez * cd3) +\n        (dex * dextail + dey * deytail + dez * deztail) * (aez * bc3 - bez * ac3 + cez * ab3)) -\n        ((aex * aextail + aey * aeytail + aez * aeztail) * (bez * cd3 - cez * bd3 + dez * bc3) +\n        (cex * cextail + cey * ceytail + cez * ceztail) * (dez * ab3 + aez * bd3 + bez * da3)));\n\n    if (det >= errbound || -det >= errbound) {\n        return det;\n    }\n\n    return insphereexact(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez);\n}\n\nexport function insphere(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez) {\n    const aex = ax - ex;\n    const bex = bx - ex;\n    const cex = cx - ex;\n    const dex = dx - ex;\n    const aey = ay - ey;\n    const bey = by - ey;\n    const cey = cy - ey;\n    const dey = dy - ey;\n    const aez = az - ez;\n    const bez = bz - ez;\n    const cez = cz - ez;\n    const dez = dz - ez;\n\n    const aexbey = aex * bey;\n    const bexaey = bex * aey;\n    const ab = aexbey - bexaey;\n    const bexcey = bex * cey;\n    const cexbey = cex * bey;\n    const bc = bexcey - cexbey;\n    const cexdey = cex * dey;\n    const dexcey = dex * cey;\n    const cd = cexdey - dexcey;\n    const dexaey = dex * aey;\n    const aexdey = aex * dey;\n    const da = dexaey - aexdey;\n    const aexcey = aex * cey;\n    const cexaey = cex * aey;\n    const ac = aexcey - cexaey;\n    const bexdey = bex * dey;\n    const dexbey = dex * bey;\n    const bd = bexdey - dexbey;\n\n    const alift = aex * aex + aey * aey + aez * aez;\n    const blift = bex * bex + bey * bey + bez * bez;\n    const clift = cex * cex + cey * cey + cez * cez;\n    const dlift = dex * dex + dey * dey + dez * dez;\n\n    const det =\n        (clift * (dez * ab + aez * bd + bez * da) - dlift * (aez * bc - bez * ac + cez * ab)) +\n        (alift * (bez * cd - cez * bd + dez * bc) - blift * (cez * da + dez * ac + aez * cd));\n\n    const aezplus = Math.abs(aez);\n    const bezplus = Math.abs(bez);\n    const cezplus = Math.abs(cez);\n    const dezplus = Math.abs(dez);\n    const aexbeyplus = Math.abs(aexbey) + Math.abs(bexaey);\n    const bexceyplus = Math.abs(bexcey) + Math.abs(cexbey);\n    const cexdeyplus = Math.abs(cexdey) + Math.abs(dexcey);\n    const dexaeyplus = Math.abs(dexaey) + Math.abs(aexdey);\n    const aexceyplus = Math.abs(aexcey) + Math.abs(cexaey);\n    const bexdeyplus = Math.abs(bexdey) + Math.abs(dexbey);\n    const permanent =\n        (cexdeyplus * bezplus + bexdeyplus * cezplus + bexceyplus * dezplus) * alift +\n        (dexaeyplus * cezplus + aexceyplus * dezplus + cexdeyplus * aezplus) * blift +\n        (aexbeyplus * dezplus + bexdeyplus * aezplus + dexaeyplus * bezplus) * clift +\n        (bexceyplus * aezplus + aexceyplus * bezplus + aexbeyplus * cezplus) * dlift;\n\n    const errbound = isperrboundA * permanent;\n    if (det > errbound || -det > errbound) {\n        return det;\n    }\n    return -insphereadapt(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez, permanent);\n}\n\nexport function inspherefast(pax, pay, paz, pbx, pby, pbz, pcx, pcy, pcz, pdx, pdy, pdz, pex, pey, pez) {\n    const aex = pax - pex;\n    const bex = pbx - pex;\n    const cex = pcx - pex;\n    const dex = pdx - pex;\n    const aey = pay - pey;\n    const bey = pby - pey;\n    const cey = pcy - pey;\n    const dey = pdy - pey;\n    const aez = paz - pez;\n    const bez = pbz - pez;\n    const cez = pcz - pez;\n    const dez = pdz - pez;\n\n    const ab = aex * bey - bex * aey;\n    const bc = bex * cey - cex * bey;\n    const cd = cex * dey - dex * cey;\n    const da = dex * aey - aex * dey;\n    const ac = aex * cey - cex * aey;\n    const bd = bex * dey - dex * bey;\n\n    const abc = aez * bc - bez * ac + cez * ab;\n    const bcd = bez * cd - cez * bd + dez * bc;\n    const cda = cez * da + dez * ac + aez * cd;\n    const dab = dez * ab + aez * bd + bez * da;\n\n    const alift = aex * aex + aey * aey + aez * aez;\n    const blift = bex * bex + bey * bey + bez * bez;\n    const clift = cex * cex + cey * cey + cez * cez;\n    const dlift = dex * dex + dey * dey + dez * dez;\n\n    return (clift * dab - dlift * abc) + (alift * bcd - blift * cda);\n}\n","\nconst EPSILON = Math.pow(2, -52);\nconst EDGE_STACK = new Uint32Array(512);\n\nimport {orient2d} from 'robust-predicates';\n\nexport default class Delaunator {\n\n    static from(points, getX = defaultGetX, getY = defaultGetY) {\n        const n = points.length;\n        const coords = new Float64Array(n * 2);\n\n        for (let i = 0; i < n; i++) {\n            const p = points[i];\n            coords[2 * i] = getX(p);\n            coords[2 * i + 1] = getY(p);\n        }\n\n        return new Delaunator(coords);\n    }\n\n    constructor(coords) {\n        const n = coords.length >> 1;\n        if (n > 0 && typeof coords[0] !== 'number') throw new Error('Expected coords to contain numbers.');\n\n        this.coords = coords;\n\n        // arrays that will store the triangulation graph\n        const maxTriangles = Math.max(2 * n - 5, 0);\n        this._triangles = new Uint32Array(maxTriangles * 3);\n        this._halfedges = new Int32Array(maxTriangles * 3);\n\n        // temporary arrays for tracking the edges of the advancing convex hull\n        this._hashSize = Math.ceil(Math.sqrt(n));\n        this._hullPrev = new Uint32Array(n); // edge to prev edge\n        this._hullNext = new Uint32Array(n); // edge to next edge\n        this._hullTri = new Uint32Array(n); // edge to adjacent triangle\n        this._hullHash = new Int32Array(this._hashSize); // angular edge hash\n\n        // temporary arrays for sorting points\n        this._ids = new Uint32Array(n);\n        this._dists = new Float64Array(n);\n\n        this.update();\n    }\n\n    update() {\n        const {coords, _hullPrev: hullPrev, _hullNext: hullNext, _hullTri: hullTri, _hullHash: hullHash} =  this;\n        const n = coords.length >> 1;\n\n        // populate an array of point indices; calculate input data bbox\n        let minX = Infinity;\n        let minY = Infinity;\n        let maxX = -Infinity;\n        let maxY = -Infinity;\n\n        for (let i = 0; i < n; i++) {\n            const x = coords[2 * i];\n            const y = coords[2 * i + 1];\n            if (x < minX) minX = x;\n            if (y < minY) minY = y;\n            if (x > maxX) maxX = x;\n            if (y > maxY) maxY = y;\n            this._ids[i] = i;\n        }\n        const cx = (minX + maxX) / 2;\n        const cy = (minY + maxY) / 2;\n\n        let i0, i1, i2;\n\n        // pick a seed point close to the center\n        for (let i = 0, minDist = Infinity; i < n; i++) {\n            const d = dist(cx, cy, coords[2 * i], coords[2 * i + 1]);\n            if (d < minDist) {\n                i0 = i;\n                minDist = d;\n            }\n        }\n        const i0x = coords[2 * i0];\n        const i0y = coords[2 * i0 + 1];\n\n        // find the point closest to the seed\n        for (let i = 0, minDist = Infinity; i < n; i++) {\n            if (i === i0) continue;\n            const d = dist(i0x, i0y, coords[2 * i], coords[2 * i + 1]);\n            if (d < minDist && d > 0) {\n                i1 = i;\n                minDist = d;\n            }\n        }\n        let i1x = coords[2 * i1];\n        let i1y = coords[2 * i1 + 1];\n\n        let minRadius = Infinity;\n\n        // find the third point which forms the smallest circumcircle with the first two\n        for (let i = 0; i < n; i++) {\n            if (i === i0 || i === i1) continue;\n            const r = circumradius(i0x, i0y, i1x, i1y, coords[2 * i], coords[2 * i + 1]);\n            if (r < minRadius) {\n                i2 = i;\n                minRadius = r;\n            }\n        }\n        let i2x = coords[2 * i2];\n        let i2y = coords[2 * i2 + 1];\n\n        if (minRadius === Infinity) {\n            // order collinear points by dx (or dy if all x are identical)\n            // and return the list as a hull\n            for (let i = 0; i < n; i++) {\n                this._dists[i] = (coords[2 * i] - coords[0]) || (coords[2 * i + 1] - coords[1]);\n            }\n            quicksort(this._ids, this._dists, 0, n - 1);\n            const hull = new Uint32Array(n);\n            let j = 0;\n            for (let i = 0, d0 = -Infinity; i < n; i++) {\n                const id = this._ids[i];\n                const d = this._dists[id];\n                if (d > d0) {\n                    hull[j++] = id;\n                    d0 = d;\n                }\n            }\n            this.hull = hull.subarray(0, j);\n            this.triangles = new Uint32Array(0);\n            this.halfedges = new Uint32Array(0);\n            return;\n        }\n\n        // swap the order of the seed points for counter-clockwise orientation\n        if (orient2d(i0x, i0y, i1x, i1y, i2x, i2y) < 0) {\n            const i = i1;\n            const x = i1x;\n            const y = i1y;\n            i1 = i2;\n            i1x = i2x;\n            i1y = i2y;\n            i2 = i;\n            i2x = x;\n            i2y = y;\n        }\n\n        const center = circumcenter(i0x, i0y, i1x, i1y, i2x, i2y);\n        this._cx = center.x;\n        this._cy = center.y;\n\n        for (let i = 0; i < n; i++) {\n            this._dists[i] = dist(coords[2 * i], coords[2 * i + 1], center.x, center.y);\n        }\n\n        // sort the points by distance from the seed triangle circumcenter\n        quicksort(this._ids, this._dists, 0, n - 1);\n\n        // set up the seed triangle as the starting hull\n        this._hullStart = i0;\n        let hullSize = 3;\n\n        hullNext[i0] = hullPrev[i2] = i1;\n        hullNext[i1] = hullPrev[i0] = i2;\n        hullNext[i2] = hullPrev[i1] = i0;\n\n        hullTri[i0] = 0;\n        hullTri[i1] = 1;\n        hullTri[i2] = 2;\n\n        hullHash.fill(-1);\n        hullHash[this._hashKey(i0x, i0y)] = i0;\n        hullHash[this._hashKey(i1x, i1y)] = i1;\n        hullHash[this._hashKey(i2x, i2y)] = i2;\n\n        this.trianglesLen = 0;\n        this._addTriangle(i0, i1, i2, -1, -1, -1);\n\n        for (let k = 0, xp, yp; k < this._ids.length; k++) {\n            const i = this._ids[k];\n            const x = coords[2 * i];\n            const y = coords[2 * i + 1];\n\n            // skip near-duplicate points\n            if (k > 0 && Math.abs(x - xp) <= EPSILON && Math.abs(y - yp) <= EPSILON) continue;\n            xp = x;\n            yp = y;\n\n            // skip seed triangle points\n            if (i === i0 || i === i1 || i === i2) continue;\n\n            // find a visible edge on the convex hull using edge hash\n            let start = 0;\n            for (let j = 0, key = this._hashKey(x, y); j < this._hashSize; j++) {\n                start = hullHash[(key + j) % this._hashSize];\n                if (start !== -1 && start !== hullNext[start]) break;\n            }\n\n            start = hullPrev[start];\n            let e = start, q;\n            while (q = hullNext[e], orient2d(x, y, coords[2 * e], coords[2 * e + 1], coords[2 * q], coords[2 * q + 1]) >= 0) {\n                e = q;\n                if (e === start) {\n                    e = -1;\n                    break;\n                }\n            }\n            if (e === -1) continue; // likely a near-duplicate point; skip it\n\n            // add the first triangle from the point\n            let t = this._addTriangle(e, i, hullNext[e], -1, -1, hullTri[e]);\n\n            // recursively flip triangles from the point until they satisfy the Delaunay condition\n            hullTri[i] = this._legalize(t + 2);\n            hullTri[e] = t; // keep track of boundary triangles on the hull\n            hullSize++;\n\n            // walk forward through the hull, adding more triangles and flipping recursively\n            let n = hullNext[e];\n            while (q = hullNext[n], orient2d(x, y, coords[2 * n], coords[2 * n + 1], coords[2 * q], coords[2 * q + 1]) < 0) {\n                t = this._addTriangle(n, i, q, hullTri[i], -1, hullTri[n]);\n                hullTri[i] = this._legalize(t + 2);\n                hullNext[n] = n; // mark as removed\n                hullSize--;\n                n = q;\n            }\n\n            // walk backward from the other side, adding more triangles and flipping\n            if (e === start) {\n                while (q = hullPrev[e], orient2d(x, y, coords[2 * q], coords[2 * q + 1], coords[2 * e], coords[2 * e + 1]) < 0) {\n                    t = this._addTriangle(q, i, e, -1, hullTri[e], hullTri[q]);\n                    this._legalize(t + 2);\n                    hullTri[q] = t;\n                    hullNext[e] = e; // mark as removed\n                    hullSize--;\n                    e = q;\n                }\n            }\n\n            // update the hull indices\n            this._hullStart = hullPrev[i] = e;\n            hullNext[e] = hullPrev[n] = i;\n            hullNext[i] = n;\n\n            // save the two new edges in the hash table\n            hullHash[this._hashKey(x, y)] = i;\n            hullHash[this._hashKey(coords[2 * e], coords[2 * e + 1])] = e;\n        }\n\n        this.hull = new Uint32Array(hullSize);\n        for (let i = 0, e = this._hullStart; i < hullSize; i++) {\n            this.hull[i] = e;\n            e = hullNext[e];\n        }\n\n        // trim typed triangle mesh arrays\n        this.triangles = this._triangles.subarray(0, this.trianglesLen);\n        this.halfedges = this._halfedges.subarray(0, this.trianglesLen);\n    }\n\n    _hashKey(x, y) {\n        return Math.floor(pseudoAngle(x - this._cx, y - this._cy) * this._hashSize) % this._hashSize;\n    }\n\n    _legalize(a) {\n        const {_triangles: triangles, _halfedges: halfedges, coords} = this;\n\n        let i = 0;\n        let ar = 0;\n\n        // recursion eliminated with a fixed-size stack\n        while (true) {\n            const b = halfedges[a];\n\n            /* if the pair of triangles doesn't satisfy the Delaunay condition\n             * (p1 is inside the circumcircle of [p0, pl, pr]), flip them,\n             * then do the same check/flip recursively for the new pair of triangles\n             *\n             *           pl                    pl\n             *          /||\\                  /  \\\n             *       al/ || \\bl            al/    \\a\n             *        /  ||  \\              /      \\\n             *       /  a||b  \\    flip    /___ar___\\\n             *     p0\\   ||   /p1   =>   p0\\---bl---/p1\n             *        \\  ||  /              \\      /\n             *       ar\\ || /br             b\\    /br\n             *          \\||/                  \\  /\n             *           pr                    pr\n             */\n            const a0 = a - a % 3;\n            ar = a0 + (a + 2) % 3;\n\n            if (b === -1) { // convex hull edge\n                if (i === 0) break;\n                a = EDGE_STACK[--i];\n                continue;\n            }\n\n            const b0 = b - b % 3;\n            const al = a0 + (a + 1) % 3;\n            const bl = b0 + (b + 2) % 3;\n\n            const p0 = triangles[ar];\n            const pr = triangles[a];\n            const pl = triangles[al];\n            const p1 = triangles[bl];\n\n            const illegal = inCircle(\n                coords[2 * p0], coords[2 * p0 + 1],\n                coords[2 * pr], coords[2 * pr + 1],\n                coords[2 * pl], coords[2 * pl + 1],\n                coords[2 * p1], coords[2 * p1 + 1]);\n\n            if (illegal) {\n                triangles[a] = p1;\n                triangles[b] = p0;\n\n                const hbl = halfedges[bl];\n\n                // edge swapped on the other side of the hull (rare); fix the halfedge reference\n                if (hbl === -1) {\n                    let e = this._hullStart;\n                    do {\n                        if (this._hullTri[e] === bl) {\n                            this._hullTri[e] = a;\n                            break;\n                        }\n                        e = this._hullPrev[e];\n                    } while (e !== this._hullStart);\n                }\n                this._link(a, hbl);\n                this._link(b, halfedges[ar]);\n                this._link(ar, bl);\n\n                const br = b0 + (b + 1) % 3;\n\n                // don't worry about hitting the cap: it can only happen on extremely degenerate input\n                if (i < EDGE_STACK.length) {\n                    EDGE_STACK[i++] = br;\n                }\n            } else {\n                if (i === 0) break;\n                a = EDGE_STACK[--i];\n            }\n        }\n\n        return ar;\n    }\n\n    _link(a, b) {\n        this._halfedges[a] = b;\n        if (b !== -1) this._halfedges[b] = a;\n    }\n\n    // add a new triangle given vertex indices and adjacent half-edge ids\n    _addTriangle(i0, i1, i2, a, b, c) {\n        const t = this.trianglesLen;\n\n        this._triangles[t] = i0;\n        this._triangles[t + 1] = i1;\n        this._triangles[t + 2] = i2;\n\n        this._link(t, a);\n        this._link(t + 1, b);\n        this._link(t + 2, c);\n\n        this.trianglesLen += 3;\n\n        return t;\n    }\n}\n\n// monotonically increases with real angle, but doesn't need expensive trigonometry\nfunction pseudoAngle(dx, dy) {\n    const p = dx / (Math.abs(dx) + Math.abs(dy));\n    return (dy > 0 ? 3 - p : 1 + p) / 4; // [0..1]\n}\n\nfunction dist(ax, ay, bx, by) {\n    const dx = ax - bx;\n    const dy = ay - by;\n    return dx * dx + dy * dy;\n}\n\nfunction inCircle(ax, ay, bx, by, cx, cy, px, py) {\n    const dx = ax - px;\n    const dy = ay - py;\n    const ex = bx - px;\n    const ey = by - py;\n    const fx = cx - px;\n    const fy = cy - py;\n\n    const ap = dx * dx + dy * dy;\n    const bp = ex * ex + ey * ey;\n    const cp = fx * fx + fy * fy;\n\n    return dx * (ey * cp - bp * fy) -\n           dy * (ex * cp - bp * fx) +\n           ap * (ex * fy - ey * fx) < 0;\n}\n\nfunction circumradius(ax, ay, bx, by, cx, cy) {\n    const dx = bx - ax;\n    const dy = by - ay;\n    const ex = cx - ax;\n    const ey = cy - ay;\n\n    const bl = dx * dx + dy * dy;\n    const cl = ex * ex + ey * ey;\n    const d = 0.5 / (dx * ey - dy * ex);\n\n    const x = (ey * bl - dy * cl) * d;\n    const y = (dx * cl - ex * bl) * d;\n\n    return x * x + y * y;\n}\n\nfunction circumcenter(ax, ay, bx, by, cx, cy) {\n    const dx = bx - ax;\n    const dy = by - ay;\n    const ex = cx - ax;\n    const ey = cy - ay;\n\n    const bl = dx * dx + dy * dy;\n    const cl = ex * ex + ey * ey;\n    const d = 0.5 / (dx * ey - dy * ex);\n\n    const x = ax + (ey * bl - dy * cl) * d;\n    const y = ay + (dx * cl - ex * bl) * d;\n\n    return {x, y};\n}\n\nfunction quicksort(ids, dists, left, right) {\n    if (right - left <= 20) {\n        for (let i = left + 1; i <= right; i++) {\n            const temp = ids[i];\n            const tempDist = dists[temp];\n            let j = i - 1;\n            while (j >= left && dists[ids[j]] > tempDist) ids[j + 1] = ids[j--];\n            ids[j + 1] = temp;\n        }\n    } else {\n        const median = (left + right) >> 1;\n        let i = left + 1;\n        let j = right;\n        swap(ids, median, i);\n        if (dists[ids[left]] > dists[ids[right]]) swap(ids, left, right);\n        if (dists[ids[i]] > dists[ids[right]]) swap(ids, i, right);\n        if (dists[ids[left]] > dists[ids[i]]) swap(ids, left, i);\n\n        const temp = ids[i];\n        const tempDist = dists[temp];\n        while (true) {\n            do i++; while (dists[ids[i]] < tempDist);\n            do j--; while (dists[ids[j]] > tempDist);\n            if (j < i) break;\n            swap(ids, i, j);\n        }\n        ids[left + 1] = ids[j];\n        ids[j] = temp;\n\n        if (right - i + 1 >= j - left) {\n            quicksort(ids, dists, i, right);\n            quicksort(ids, dists, left, j - 1);\n        } else {\n            quicksort(ids, dists, left, j - 1);\n            quicksort(ids, dists, i, right);\n        }\n    }\n}\n\nfunction swap(arr, i, j) {\n    const tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n}\n\nfunction defaultGetX(p) {\n    return p[0];\n}\nfunction defaultGetY(p) {\n    return p[1];\n}\n","const epsilon = 1e-6;\n\nexport default class Path {\n  constructor() {\n    this._x0 = this._y0 = // start of current subpath\n    this._x1 = this._y1 = null; // end of current subpath\n    this._ = \"\";\n  }\n  moveTo(x, y) {\n    this._ += `M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}`;\n  }\n  closePath() {\n    if (this._x1 !== null) {\n      this._x1 = this._x0, this._y1 = this._y0;\n      this._ += \"Z\";\n    }\n  }\n  lineTo(x, y) {\n    this._ += `L${this._x1 = +x},${this._y1 = +y}`;\n  }\n  arc(x, y, r) {\n    x = +x, y = +y, r = +r;\n    const x0 = x + r;\n    const y0 = y;\n    if (r < 0) throw new Error(\"negative radius\");\n    if (this._x1 === null) this._ += `M${x0},${y0}`;\n    else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) this._ += \"L\" + x0 + \",\" + y0;\n    if (!r) return;\n    this._ += `A${r},${r},0,1,1,${x - r},${y}A${r},${r},0,1,1,${this._x1 = x0},${this._y1 = y0}`;\n  }\n  rect(x, y, w, h) {\n    this._ += `M${this._x0 = this._x1 = +x},${this._y0 = this._y1 = +y}h${+w}v${+h}h${-w}Z`;\n  }\n  value() {\n    return this._ || null;\n  }\n}\n","export default class Polygon {\n  constructor() {\n    this._ = [];\n  }\n  moveTo(x, y) {\n    this._.push([x, y]);\n  }\n  closePath() {\n    this._.push(this._[0].slice());\n  }\n  lineTo(x, y) {\n    this._.push([x, y]);\n  }\n  value() {\n    return this._.length ? this._ : null;\n  }\n}\n","import Path from \"./path.js\";\nimport Polygon from \"./polygon.js\";\n\nexport default class Voronoi {\n  constructor(delaunay, [xmin, ymin, xmax, ymax] = [0, 0, 960, 500]) {\n    if (!((xmax = +xmax) >= (xmin = +xmin)) || !((ymax = +ymax) >= (ymin = +ymin))) throw new Error(\"invalid bounds\");\n    this.delaunay = delaunay;\n    this._circumcenters = new Float64Array(delaunay.points.length * 2);\n    this.vectors = new Float64Array(delaunay.points.length * 2);\n    this.xmax = xmax, this.xmin = xmin;\n    this.ymax = ymax, this.ymin = ymin;\n    this._init();\n  }\n  update() {\n    this.delaunay.update();\n    this._init();\n    return this;\n  }\n  _init() {\n    const {delaunay: {points, hull, triangles}, vectors} = this;\n    let bx, by; // lazily computed barycenter of the hull\n\n    // Compute circumcenters.\n    const circumcenters = this.circumcenters = this._circumcenters.subarray(0, triangles.length / 3 * 2);\n    for (let i = 0, j = 0, n = triangles.length, x, y; i < n; i += 3, j += 2) {\n      const t1 = triangles[i] * 2;\n      const t2 = triangles[i + 1] * 2;\n      const t3 = triangles[i + 2] * 2;\n      const x1 = points[t1];\n      const y1 = points[t1 + 1];\n      const x2 = points[t2];\n      const y2 = points[t2 + 1];\n      const x3 = points[t3];\n      const y3 = points[t3 + 1];\n\n      const dx = x2 - x1;\n      const dy = y2 - y1;\n      const ex = x3 - x1;\n      const ey = y3 - y1;\n      const ab = (dx * ey - dy * ex) * 2;\n\n      if (Math.abs(ab) < 1e-9) {\n        // For a degenerate triangle, the circumcenter is at the infinity, in a\n        // direction orthogonal to the halfedge and away from the “center” of\n        // the diagram <bx, by>, defined as the hull’s barycenter.\n        if (bx === undefined) {\n          bx = by = 0;\n          for (const i of hull) bx += points[i * 2], by += points[i * 2 + 1];\n          bx /= hull.length, by /= hull.length;\n        }\n        const a = 1e9 * Math.sign((bx - x1) * ey - (by - y1) * ex);\n        x = (x1 + x3) / 2 - a * ey;\n        y = (y1 + y3) / 2 + a * ex;\n      } else {\n        const d = 1 / ab;\n        const bl = dx * dx + dy * dy;\n        const cl = ex * ex + ey * ey;\n        x = x1 + (ey * bl - dy * cl) * d;\n        y = y1 + (dx * cl - ex * bl) * d;\n      }\n      circumcenters[j] = x;\n      circumcenters[j + 1] = y;\n    }\n\n    // Compute exterior cell rays.\n    let h = hull[hull.length - 1];\n    let p0, p1 = h * 4;\n    let x0, x1 = points[2 * h];\n    let y0, y1 = points[2 * h + 1];\n    vectors.fill(0);\n    for (let i = 0; i < hull.length; ++i) {\n      h = hull[i];\n      p0 = p1, x0 = x1, y0 = y1;\n      p1 = h * 4, x1 = points[2 * h], y1 = points[2 * h + 1];\n      vectors[p0 + 2] = vectors[p1] = y0 - y1;\n      vectors[p0 + 3] = vectors[p1 + 1] = x1 - x0;\n    }\n  }\n  render(context) {\n    const buffer = context == null ? context = new Path : undefined;\n    const {delaunay: {halfedges, inedges, hull}, circumcenters, vectors} = this;\n    if (hull.length <= 1) return null;\n    for (let i = 0, n = halfedges.length; i < n; ++i) {\n      const j = halfedges[i];\n      if (j < i) continue;\n      const ti = Math.floor(i / 3) * 2;\n      const tj = Math.floor(j / 3) * 2;\n      const xi = circumcenters[ti];\n      const yi = circumcenters[ti + 1];\n      const xj = circumcenters[tj];\n      const yj = circumcenters[tj + 1];\n      this._renderSegment(xi, yi, xj, yj, context);\n    }\n    let h0, h1 = hull[hull.length - 1];\n    for (let i = 0; i < hull.length; ++i) {\n      h0 = h1, h1 = hull[i];\n      const t = Math.floor(inedges[h1] / 3) * 2;\n      const x = circumcenters[t];\n      const y = circumcenters[t + 1];\n      const v = h0 * 4;\n      const p = this._project(x, y, vectors[v + 2], vectors[v + 3]);\n      if (p) this._renderSegment(x, y, p[0], p[1], context);\n    }\n    return buffer && buffer.value();\n  }\n  renderBounds(context) {\n    const buffer = context == null ? context = new Path : undefined;\n    context.rect(this.xmin, this.ymin, this.xmax - this.xmin, this.ymax - this.ymin);\n    return buffer && buffer.value();\n  }\n  renderCell(i, context) {\n    const buffer = context == null ? context = new Path : undefined;\n    const points = this._clip(i);\n    if (points === null || !points.length) return;\n    context.moveTo(points[0], points[1]);\n    let n = points.length;\n    while (points[0] === points[n-2] && points[1] === points[n-1] && n > 1) n -= 2;\n    for (let i = 2; i < n; i += 2) {\n      if (points[i] !== points[i-2] || points[i+1] !== points[i-1])\n        context.lineTo(points[i], points[i + 1]);\n    }\n    context.closePath();\n    return buffer && buffer.value();\n  }\n  *cellPolygons() {\n    const {delaunay: {points}} = this;\n    for (let i = 0, n = points.length / 2; i < n; ++i) {\n      const cell = this.cellPolygon(i);\n      if (cell) cell.index = i, yield cell;\n    }\n  }\n  cellPolygon(i) {\n    const polygon = new Polygon;\n    this.renderCell(i, polygon);\n    return polygon.value();\n  }\n  _renderSegment(x0, y0, x1, y1, context) {\n    let S;\n    const c0 = this._regioncode(x0, y0);\n    const c1 = this._regioncode(x1, y1);\n    if (c0 === 0 && c1 === 0) {\n      context.moveTo(x0, y0);\n      context.lineTo(x1, y1);\n    } else if (S = this._clipSegment(x0, y0, x1, y1, c0, c1)) {\n      context.moveTo(S[0], S[1]);\n      context.lineTo(S[2], S[3]);\n    }\n  }\n  contains(i, x, y) {\n    if ((x = +x, x !== x) || (y = +y, y !== y)) return false;\n    return this.delaunay._step(i, x, y) === i;\n  }\n  *neighbors(i) {\n    const ci = this._clip(i);\n    if (ci) for (const j of this.delaunay.neighbors(i)) {\n      const cj = this._clip(j);\n      // find the common edge\n      if (cj) loop: for (let ai = 0, li = ci.length; ai < li; ai += 2) {\n        for (let aj = 0, lj = cj.length; aj < lj; aj += 2) {\n          if (ci[ai] === cj[aj]\n              && ci[ai + 1] === cj[aj + 1]\n              && ci[(ai + 2) % li] === cj[(aj + lj - 2) % lj]\n              && ci[(ai + 3) % li] === cj[(aj + lj - 1) % lj]) {\n            yield j;\n            break loop;\n          }\n        }\n      }\n    }\n  }\n  _cell(i) {\n    const {circumcenters, delaunay: {inedges, halfedges, triangles}} = this;\n    const e0 = inedges[i];\n    if (e0 === -1) return null; // coincident point\n    const points = [];\n    let e = e0;\n    do {\n      const t = Math.floor(e / 3);\n      points.push(circumcenters[t * 2], circumcenters[t * 2 + 1]);\n      e = e % 3 === 2 ? e - 2 : e + 1;\n      if (triangles[e] !== i) break; // bad triangulation\n      e = halfedges[e];\n    } while (e !== e0 && e !== -1);\n    return points;\n  }\n  _clip(i) {\n    // degenerate case (1 valid point: return the box)\n    if (i === 0 && this.delaunay.hull.length === 1) {\n      return [this.xmax, this.ymin, this.xmax, this.ymax, this.xmin, this.ymax, this.xmin, this.ymin];\n    }\n    const points = this._cell(i);\n    if (points === null) return null;\n    const {vectors: V} = this;\n    const v = i * 4;\n    return this._simplify(V[v] || V[v + 1]\n        ? this._clipInfinite(i, points, V[v], V[v + 1], V[v + 2], V[v + 3])\n        : this._clipFinite(i, points));\n  }\n  _clipFinite(i, points) {\n    const n = points.length;\n    let P = null;\n    let x0, y0, x1 = points[n - 2], y1 = points[n - 1];\n    let c0, c1 = this._regioncode(x1, y1);\n    let e0, e1 = 0;\n    for (let j = 0; j < n; j += 2) {\n      x0 = x1, y0 = y1, x1 = points[j], y1 = points[j + 1];\n      c0 = c1, c1 = this._regioncode(x1, y1);\n      if (c0 === 0 && c1 === 0) {\n        e0 = e1, e1 = 0;\n        if (P) P.push(x1, y1);\n        else P = [x1, y1];\n      } else {\n        let S, sx0, sy0, sx1, sy1;\n        if (c0 === 0) {\n          if ((S = this._clipSegment(x0, y0, x1, y1, c0, c1)) === null) continue;\n          [sx0, sy0, sx1, sy1] = S;\n        } else {\n          if ((S = this._clipSegment(x1, y1, x0, y0, c1, c0)) === null) continue;\n          [sx1, sy1, sx0, sy0] = S;\n          e0 = e1, e1 = this._edgecode(sx0, sy0);\n          if (e0 && e1) this._edge(i, e0, e1, P, P.length);\n          if (P) P.push(sx0, sy0);\n          else P = [sx0, sy0];\n        }\n        e0 = e1, e1 = this._edgecode(sx1, sy1);\n        if (e0 && e1) this._edge(i, e0, e1, P, P.length);\n        if (P) P.push(sx1, sy1);\n        else P = [sx1, sy1];\n      }\n    }\n    if (P) {\n      e0 = e1, e1 = this._edgecode(P[0], P[1]);\n      if (e0 && e1) this._edge(i, e0, e1, P, P.length);\n    } else if (this.contains(i, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2)) {\n      return [this.xmax, this.ymin, this.xmax, this.ymax, this.xmin, this.ymax, this.xmin, this.ymin];\n    }\n    return P;\n  }\n  _clipSegment(x0, y0, x1, y1, c0, c1) {\n    // for more robustness, always consider the segment in the same order\n    const flip = c0 < c1;\n    if (flip) [x0, y0, x1, y1, c0, c1] = [x1, y1, x0, y0, c1, c0];\n    while (true) {\n      if (c0 === 0 && c1 === 0) return flip ? [x1, y1, x0, y0] : [x0, y0, x1, y1];\n      if (c0 & c1) return null;\n      let x, y, c = c0 || c1;\n      if (c & 0b1000) x = x0 + (x1 - x0) * (this.ymax - y0) / (y1 - y0), y = this.ymax;\n      else if (c & 0b0100) x = x0 + (x1 - x0) * (this.ymin - y0) / (y1 - y0), y = this.ymin;\n      else if (c & 0b0010) y = y0 + (y1 - y0) * (this.xmax - x0) / (x1 - x0), x = this.xmax;\n      else y = y0 + (y1 - y0) * (this.xmin - x0) / (x1 - x0), x = this.xmin;\n      if (c0) x0 = x, y0 = y, c0 = this._regioncode(x0, y0);\n      else x1 = x, y1 = y, c1 = this._regioncode(x1, y1);\n    }\n  }\n  _clipInfinite(i, points, vx0, vy0, vxn, vyn) {\n    let P = Array.from(points), p;\n    if (p = this._project(P[0], P[1], vx0, vy0)) P.unshift(p[0], p[1]);\n    if (p = this._project(P[P.length - 2], P[P.length - 1], vxn, vyn)) P.push(p[0], p[1]);\n    if (P = this._clipFinite(i, P)) {\n      for (let j = 0, n = P.length, c0, c1 = this._edgecode(P[n - 2], P[n - 1]); j < n; j += 2) {\n        c0 = c1, c1 = this._edgecode(P[j], P[j + 1]);\n        if (c0 && c1) j = this._edge(i, c0, c1, P, j), n = P.length;\n      }\n    } else if (this.contains(i, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2)) {\n      P = [this.xmin, this.ymin, this.xmax, this.ymin, this.xmax, this.ymax, this.xmin, this.ymax];\n    }\n    return P;\n  }\n  _edge(i, e0, e1, P, j) {\n    while (e0 !== e1) {\n      let x, y;\n      switch (e0) {\n        case 0b0101: e0 = 0b0100; continue; // top-left\n        case 0b0100: e0 = 0b0110, x = this.xmax, y = this.ymin; break; // top\n        case 0b0110: e0 = 0b0010; continue; // top-right\n        case 0b0010: e0 = 0b1010, x = this.xmax, y = this.ymax; break; // right\n        case 0b1010: e0 = 0b1000; continue; // bottom-right\n        case 0b1000: e0 = 0b1001, x = this.xmin, y = this.ymax; break; // bottom\n        case 0b1001: e0 = 0b0001; continue; // bottom-left\n        case 0b0001: e0 = 0b0101, x = this.xmin, y = this.ymin; break; // left\n      }\n      // Note: this implicitly checks for out of bounds: if P[j] or P[j+1] are\n      // undefined, the conditional statement will be executed.\n      if ((P[j] !== x || P[j + 1] !== y) && this.contains(i, x, y)) {\n        P.splice(j, 0, x, y), j += 2;\n      }\n    }\n    return j;\n  }\n  _project(x0, y0, vx, vy) {\n    let t = Infinity, c, x, y;\n    if (vy < 0) { // top\n      if (y0 <= this.ymin) return null;\n      if ((c = (this.ymin - y0) / vy) < t) y = this.ymin, x = x0 + (t = c) * vx;\n    } else if (vy > 0) { // bottom\n      if (y0 >= this.ymax) return null;\n      if ((c = (this.ymax - y0) / vy) < t) y = this.ymax, x = x0 + (t = c) * vx;\n    }\n    if (vx > 0) { // right\n      if (x0 >= this.xmax) return null;\n      if ((c = (this.xmax - x0) / vx) < t) x = this.xmax, y = y0 + (t = c) * vy;\n    } else if (vx < 0) { // left\n      if (x0 <= this.xmin) return null;\n      if ((c = (this.xmin - x0) / vx) < t) x = this.xmin, y = y0 + (t = c) * vy;\n    }\n    return [x, y];\n  }\n  _edgecode(x, y) {\n    return (x === this.xmin ? 0b0001\n        : x === this.xmax ? 0b0010 : 0b0000)\n        | (y === this.ymin ? 0b0100\n        : y === this.ymax ? 0b1000 : 0b0000);\n  }\n  _regioncode(x, y) {\n    return (x < this.xmin ? 0b0001\n        : x > this.xmax ? 0b0010 : 0b0000)\n        | (y < this.ymin ? 0b0100\n        : y > this.ymax ? 0b1000 : 0b0000);\n  }\n  _simplify(P) {\n    if (P && P.length > 4) {\n      for (let i = 0; i < P.length; i+= 2) {\n        const j = (i + 2) % P.length, k = (i + 4) % P.length;\n        if (P[i] === P[j] && P[j] === P[k] || P[i + 1] === P[j + 1] && P[j + 1] === P[k + 1]) {\n          P.splice(j, 2), i -= 2;\n        }\n      }\n      if (!P.length) P = null;\n    }\n    return P;\n  }\n}\n","import Delaunator from \"delaunator\";\nimport Path from \"./path.js\";\nimport Polygon from \"./polygon.js\";\nimport Voronoi from \"./voronoi.js\";\n\nconst tau = 2 * Math.PI, pow = Math.pow;\n\nfunction pointX(p) {\n  return p[0];\n}\n\nfunction pointY(p) {\n  return p[1];\n}\n\n// A triangulation is collinear if all its triangles have a non-null area\nfunction collinear(d) {\n  const {triangles, coords} = d;\n  for (let i = 0; i < triangles.length; i += 3) {\n    const a = 2 * triangles[i],\n          b = 2 * triangles[i + 1],\n          c = 2 * triangles[i + 2],\n          cross = (coords[c] - coords[a]) * (coords[b + 1] - coords[a + 1])\n                - (coords[b] - coords[a]) * (coords[c + 1] - coords[a + 1]);\n    if (cross > 1e-10) return false;\n  }\n  return true;\n}\n\nfunction jitter(x, y, r) {\n  return [x + Math.sin(x + y) * r, y + Math.cos(x - y) * r];\n}\n\nexport default class Delaunay {\n  static from(points, fx = pointX, fy = pointY, that) {\n    return new Delaunay(\"length\" in points\n        ? flatArray(points, fx, fy, that)\n        : Float64Array.from(flatIterable(points, fx, fy, that)));\n  }\n  constructor(points) {\n    this._delaunator = new Delaunator(points);\n    this.inedges = new Int32Array(points.length / 2);\n    this._hullIndex = new Int32Array(points.length / 2);\n    this.points = this._delaunator.coords;\n    this._init();\n  }\n  update() {\n    this._delaunator.update();\n    this._init();\n    return this;\n  }\n  _init() {\n    const d = this._delaunator, points = this.points;\n\n    // check for collinear\n    if (d.hull && d.hull.length > 2 && collinear(d)) {\n      this.collinear = Int32Array.from({length: points.length/2}, (_,i) => i)\n        .sort((i, j) => points[2 * i] - points[2 * j] || points[2 * i + 1] - points[2 * j + 1]); // for exact neighbors\n      const e = this.collinear[0], f = this.collinear[this.collinear.length - 1],\n        bounds = [ points[2 * e], points[2 * e + 1], points[2 * f], points[2 * f + 1] ],\n        r = 1e-8 * Math.hypot(bounds[3] - bounds[1], bounds[2] - bounds[0]);\n      for (let i = 0, n = points.length / 2; i < n; ++i) {\n        const p = jitter(points[2 * i], points[2 * i + 1], r);\n        points[2 * i] = p[0];\n        points[2 * i + 1] = p[1];\n      }\n      this._delaunator = new Delaunator(points);\n    } else {\n      delete this.collinear;\n    }\n\n    const halfedges = this.halfedges = this._delaunator.halfedges;\n    const hull = this.hull = this._delaunator.hull;\n    const triangles = this.triangles = this._delaunator.triangles;\n    const inedges = this.inedges.fill(-1);\n    const hullIndex = this._hullIndex.fill(-1);\n\n    // Compute an index from each point to an (arbitrary) incoming halfedge\n    // Used to give the first neighbor of each point; for this reason,\n    // on the hull we give priority to exterior halfedges\n    for (let e = 0, n = halfedges.length; e < n; ++e) {\n      const p = triangles[e % 3 === 2 ? e - 2 : e + 1];\n      if (halfedges[e] === -1 || inedges[p] === -1) inedges[p] = e;\n    }\n    for (let i = 0, n = hull.length; i < n; ++i) {\n      hullIndex[hull[i]] = i;\n    }\n\n    // degenerate case: 1 or 2 (distinct) points\n    if (hull.length <= 2 && hull.length > 0) {\n      this.triangles = new Int32Array(3).fill(-1);\n      this.halfedges = new Int32Array(3).fill(-1);\n      this.triangles[0] = hull[0];\n      inedges[hull[0]] = 1;\n      if (hull.length === 2) {\n        inedges[hull[1]] = 0;\n        this.triangles[1] = hull[1];\n        this.triangles[2] = hull[1];\n      }\n    }\n  }\n  voronoi(bounds) {\n    return new Voronoi(this, bounds);\n  }\n  *neighbors(i) {\n    const {inedges, hull, _hullIndex, halfedges, triangles, collinear} = this;\n\n    // degenerate case with several collinear points\n    if (collinear) {\n      const l = collinear.indexOf(i);\n      if (l > 0) yield collinear[l - 1];\n      if (l < collinear.length - 1) yield collinear[l + 1];\n      return;\n    }\n\n    const e0 = inedges[i];\n    if (e0 === -1) return; // coincident point\n    let e = e0, p0 = -1;\n    do {\n      yield p0 = triangles[e];\n      e = e % 3 === 2 ? e - 2 : e + 1;\n      if (triangles[e] !== i) return; // bad triangulation\n      e = halfedges[e];\n      if (e === -1) {\n        const p = hull[(_hullIndex[i] + 1) % hull.length];\n        if (p !== p0) yield p;\n        return;\n      }\n    } while (e !== e0);\n  }\n  find(x, y, i = 0) {\n    if ((x = +x, x !== x) || (y = +y, y !== y)) return -1;\n    const i0 = i;\n    let c;\n    while ((c = this._step(i, x, y)) >= 0 && c !== i && c !== i0) i = c;\n    return c;\n  }\n  _step(i, x, y) {\n    const {inedges, hull, _hullIndex, halfedges, triangles, points} = this;\n    if (inedges[i] === -1 || !points.length) return (i + 1) % (points.length >> 1);\n    let c = i;\n    let dc = pow(x - points[i * 2], 2) + pow(y - points[i * 2 + 1], 2);\n    const e0 = inedges[i];\n    let e = e0;\n    do {\n      let t = triangles[e];\n      const dt = pow(x - points[t * 2], 2) + pow(y - points[t * 2 + 1], 2);\n      if (dt < dc) dc = dt, c = t;\n      e = e % 3 === 2 ? e - 2 : e + 1;\n      if (triangles[e] !== i) break; // bad triangulation\n      e = halfedges[e];\n      if (e === -1) {\n        e = hull[(_hullIndex[i] + 1) % hull.length];\n        if (e !== t) {\n          if (pow(x - points[e * 2], 2) + pow(y - points[e * 2 + 1], 2) < dc) return e;\n        }\n        break;\n      }\n    } while (e !== e0);\n    return c;\n  }\n  render(context) {\n    const buffer = context == null ? context = new Path : undefined;\n    const {points, halfedges, triangles} = this;\n    for (let i = 0, n = halfedges.length; i < n; ++i) {\n      const j = halfedges[i];\n      if (j < i) continue;\n      const ti = triangles[i] * 2;\n      const tj = triangles[j] * 2;\n      context.moveTo(points[ti], points[ti + 1]);\n      context.lineTo(points[tj], points[tj + 1]);\n    }\n    this.renderHull(context);\n    return buffer && buffer.value();\n  }\n  renderPoints(context, r) {\n    if (r === undefined && (!context || typeof context.moveTo !== \"function\")) r = context, context = null;\n    r = r == undefined ? 2 : +r;\n    const buffer = context == null ? context = new Path : undefined;\n    const {points} = this;\n    for (let i = 0, n = points.length; i < n; i += 2) {\n      const x = points[i], y = points[i + 1];\n      context.moveTo(x + r, y);\n      context.arc(x, y, r, 0, tau);\n    }\n    return buffer && buffer.value();\n  }\n  renderHull(context) {\n    const buffer = context == null ? context = new Path : undefined;\n    const {hull, points} = this;\n    const h = hull[0] * 2, n = hull.length;\n    context.moveTo(points[h], points[h + 1]);\n    for (let i = 1; i < n; ++i) {\n      const h = 2 * hull[i];\n      context.lineTo(points[h], points[h + 1]);\n    }\n    context.closePath();\n    return buffer && buffer.value();\n  }\n  hullPolygon() {\n    const polygon = new Polygon;\n    this.renderHull(polygon);\n    return polygon.value();\n  }\n  renderTriangle(i, context) {\n    const buffer = context == null ? context = new Path : undefined;\n    const {points, triangles} = this;\n    const t0 = triangles[i *= 3] * 2;\n    const t1 = triangles[i + 1] * 2;\n    const t2 = triangles[i + 2] * 2;\n    context.moveTo(points[t0], points[t0 + 1]);\n    context.lineTo(points[t1], points[t1 + 1]);\n    context.lineTo(points[t2], points[t2 + 1]);\n    context.closePath();\n    return buffer && buffer.value();\n  }\n  *trianglePolygons() {\n    const {triangles} = this;\n    for (let i = 0, n = triangles.length / 3; i < n; ++i) {\n      yield this.trianglePolygon(i);\n    }\n  }\n  trianglePolygon(i) {\n    const polygon = new Polygon;\n    this.renderTriangle(i, polygon);\n    return polygon.value();\n  }\n}\n\nfunction flatArray(points, fx, fy, that) {\n  const n = points.length;\n  const array = new Float64Array(n * 2);\n  for (let i = 0; i < n; ++i) {\n    const p = points[i];\n    array[i * 2] = fx.call(that, p, i, points);\n    array[i * 2 + 1] = fy.call(that, p, i, points);\n  }\n  return array;\n}\n\nfunction* flatIterable(points, fx, fy, that) {\n  let i = 0;\n  for (const p of points) {\n    yield fx.call(that, p, i, points);\n    yield fy.call(that, p, i, points);\n    ++i;\n  }\n}\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9],"mappings":";AAAA,IAAaA,IAAU,uBACV,IAAW,WACX,KAAkB,IAAI,IAAIA,KAAWA;AAGlD,SAAgB,EAAI,GAAM,GAAG,GAAM,GAAG,GAAG;CACrC,IAAI,GAAG,GAAM,GAAI,GACb,IAAO,EAAE,IACT,IAAO,EAAE,IACT,IAAS,GACT,IAAS;CACb,AAAK,IAAO,KAAW,IAAO,CAAC,KAC3B,IAAI,GACJ,IAAO,EAAE,EAAE,OAEX,IAAI,GACJ,IAAO,EAAE,EAAE;CAEf,IAAI,IAAS;CACb,IAAI,IAAS,KAAQ,IAAS,GAc1B,KAbK,IAAO,KAAW,IAAO,CAAC,KAC3B,IAAO,IAAO,GACd,IAAK,KAAK,IAAO,IACjB,IAAO,EAAE,EAAE,OAEX,IAAO,IAAO,GACd,IAAK,KAAK,IAAO,IACjB,IAAO,EAAE,EAAE,KAEf,IAAI,GACA,MAAO,MACP,EAAE,OAAY,IAEX,IAAS,KAAQ,IAAS,IAa7B,AAZK,IAAO,KAAW,IAAO,CAAC,KAC3B,IAAO,IAAI,GACX,IAAQ,IAAO,GACf,IAAK,KAAK,IAAO,MAAU,IAAO,IAClC,IAAO,EAAE,EAAE,OAEX,IAAO,IAAI,GACX,IAAQ,IAAO,GACf,IAAK,KAAK,IAAO,MAAU,IAAO,IAClC,IAAO,EAAE,EAAE,KAEf,IAAI,GACA,MAAO,MACP,EAAE,OAAY;CAI1B,OAAO,IAAS,IAMZ,AALA,IAAO,IAAI,GACX,IAAQ,IAAO,GACf,IAAK,KAAK,IAAO,MAAU,IAAO,IAClC,IAAO,EAAE,EAAE,IACX,IAAI,GACA,MAAO,MACP,EAAE,OAAY;CAGtB,OAAO,IAAS,IAMZ,AALA,IAAO,IAAI,GACX,IAAQ,IAAO,GACf,IAAK,KAAK,IAAO,MAAU,IAAO,IAClC,IAAO,EAAE,EAAE,IACX,IAAI,GACA,MAAO,MACP,EAAE,OAAY;CAMtB,QAHI,MAAM,KAAK,MAAW,OACtB,EAAE,OAAY,IAEX;AACX;AAsDA,SAAgB,EAAS,GAAM,GAAG;CAC9B,IAAI,IAAI,EAAE;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAM,KAAK,KAAK,EAAE;CACtC,OAAO;AACX;AAEA,SAAgB,EAAI,GAAG;CACnB,OAAO,IAAI,aAAa,CAAC;AAC7B;;;ACvIA,IAAM,KAAgB,IAAI,KAAKC,KAAWA,GACpC,KAAgB,IAAI,KAAKA,KAAWA,GACpC,KAAgB,IAAI,KAAKA,KAAWA,IAAUA,GAE9C,IAAI,EAAI,CAAC,GACT,IAAK,EAAI,CAAC,GACV,IAAK,EAAI,EAAE,GACX,IAAI,EAAI,EAAE,GACVC,IAAI,EAAI,CAAC;AAEf,SAAS,EAAc,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAQ;CACnD,IAAI,GAAS,GAAS,GAAS,GAC3B,GAAO,GAAG,GAAK,GAAK,GAAK,GAAK,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAExD,IAAM,IAAK,GACX,IAAM,IAAK,GACX,IAAM,IAAK,GACX,IAAM,IAAK;CA8BjB,AA5BA,IAAK,IAAM,GACX,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAM,GACZ,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAM,GACZ,IAAK,IAAM,KAAO,IAAK,IAAM,IAAM,IAAM,IAAM,IAAM,IACrD,IAAK,IAAM,GACX,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAM,GACZ,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAM,GACZ,IAAK,IAAM,KAAO,IAAK,IAAM,IAAM,IAAM,IAAM,IAAM,IACrD,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAQ,IACpC,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,IAAK,KAAM,IAAK,MAAU,IAAK,IAC/B,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAQ,IACpC,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAK,IACjC,EAAE,KAAK;CAEP,IAAI,IAAM,EAAS,GAAG,CAAC,GACnB,IAAW,IAAe;CAoB9B,IAnBI,KAAO,KAAY,CAAC,KAAO,MAI/B,IAAQ,IAAK,GACb,IAAU,KAAM,IAAM,MAAU,IAAQ,IACxC,IAAQ,IAAK,GACb,IAAU,KAAM,IAAM,MAAU,IAAQ,IACxC,IAAQ,IAAK,GACb,IAAU,KAAM,IAAM,MAAU,IAAQ,IACxC,IAAQ,IAAK,GACb,IAAU,KAAM,IAAM,MAAU,IAAQ,IAEpC,MAAY,KAAK,MAAY,KAAK,MAAY,KAAK,MAAY,OAInE,IAAW,IAAe,IAAS,IAAiB,KAAK,IAAI,CAAG,GAChE,KAAQ,IAAM,IAAU,IAAM,KAAY,IAAM,IAAU,IAAM,IAC5D,KAAO,KAAY,CAAC,KAAO,IAAU,OAAO;CA8BhD,AA5BA,IAAK,IAAU,GACf,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAU,GAChB,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAM,GACZ,IAAK,IAAM,KAAO,IAAK,IAAM,IAAM,IAAM,IAAM,IAAM,IACrD,IAAK,IAAU,GACf,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAU,GAChB,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAM,GACZ,IAAK,IAAM,KAAO,IAAK,IAAM,IAAM,IAAM,IAAM,IAAM,IACrD,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAQ,IACpC,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,IAAK,KAAM,IAAK,MAAU,IAAK,IAC/B,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAQ,IACpC,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAK,IACjC,EAAE,KAAK;CACP,IAAM,IAAQ,EAAI,GAAG,GAAG,GAAGA,GAAG,CAAE;CA8BhC,AA5BA,IAAK,IAAM,GACX,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAM,GACZ,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAU,GAChB,IAAK,IAAM,KAAO,IAAK,IAAM,IAAM,IAAM,IAAM,IAAM,IACrD,IAAK,IAAM,GACX,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAM,GACZ,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAU,GAChB,IAAK,IAAM,KAAO,IAAK,IAAM,IAAM,IAAM,IAAM,IAAM,IACrD,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAQ,IACpC,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,IAAK,KAAM,IAAK,MAAU,IAAK,IAC/B,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAQ,IACpC,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAK,IACjC,EAAE,KAAK;CACP,IAAM,IAAQ,EAAI,GAAO,GAAI,GAAGA,GAAG,CAAE;CAiCrC,OA/BA,IAAK,IAAU,GACf,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAU,GAChB,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAU,GAChB,IAAK,IAAM,KAAO,IAAK,IAAM,IAAM,IAAM,IAAM,IAAM,IACrD,IAAK,IAAU,GACf,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAU,GAChB,IAAI,IAAW,GACf,IAAM,KAAK,IAAI,IACf,IAAM,IAAU,GAChB,IAAK,IAAM,KAAO,IAAK,IAAM,IAAM,IAAM,IAAM,IAAM,IACrD,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAQ,IACpC,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,IAAK,KAAM,IAAK,MAAU,IAAK,IAC/B,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAQ,IACpC,IAAK,IAAK,GACV,IAAQ,IAAK,GACb,EAAE,KAAK,KAAM,IAAK,MAAU,IAAK,IACjC,EAAE,KAAK,GAGA,EAFM,EAAI,GAAO,GAAI,GAAGA,GAAG,CAEtB,IAAI;AACpB;AAEA,SAAgB,EAAS,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI;CAC7C,IAAM,KAAW,IAAK,MAAO,IAAK,IAC5B,KAAY,IAAK,MAAO,IAAK,IAC7B,IAAM,IAAU,GAEhB,IAAS,KAAK,IAAI,IAAU,CAAQ;CAG1C,OAFI,KAAK,IAAI,CAAG,KAAK,IAAe,IAAe,IAE5C,CAAC,EAAc,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,CAAM;AACxD;CCjLsB,IAAI,KAAKC,KAAWA,IACpB,IAAI,KAAKA,KAAWA,IACpB,KAAK,MAAMA,KAAWA,IAAUA,GAE3C,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACH,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACN,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACP,EAAI,CAAC,GAEJ,EAAI,CAAC,GACJ,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,EAAE,GAER,EAAI,GAAG,GACN,EAAI,GAAG,ICxBI,KAAK,KAAKa,KAAWA,IACrB,IAAI,KAAKA,KAAWA,IACpB,KAAK,MAAMA,KAAWA,IAAUA,GAE3C,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACN,EAAI,CAAC,GACL,EAAI,CAAC,GACD,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACP,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACJ,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GAEP,EAAI,CAAC,GACJ,EAAI,EAAE,GACL,EAAI,EAAE,GACN,EAAI,EAAE,GACP,EAAI,EAAE,GACL,EAAI,EAAE,GACP,EAAI,EAAE,GACN,EAAI,EAAE,GAER,EAAI,IAAI,GACP,EAAI,IAAI,ICnCG,KAAK,MAAMO,KAAWA,IACtB,IAAI,KAAKA,KAAWA,IACpB,KAAK,OAAOA,KAAWA,IAAUA,GAE5C,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,CAAC,GAEJ,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GAEL,EAAI,IAAI,GACR,EAAI,IAAI,GACR,EAAI,IAAI,GACR,EAAI,IAAI,GACR,EAAI,IAAI,GACP,EAAI,IAAI,GACR,EAAI,IAAI,GACP,EAAI,IAAI,GACT,EAAI,IAAI,GAEX,EAAI,CAAC,GACJ,EAAI,CAAC,GACL,EAAI,CAAC,GACL,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACL,EAAI,EAAE,GACP,EAAI,EAAE,GACL,EAAI,GAAG,GACN,EAAI,GAAG,GACP,EAAI,GAAG,GACP,EAAI,GAAG,GACR,EAAI,GAAG,GAgVP,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACP,EAAI,IAAI;;;ACpYpB,IAAM,IAAmB,KAAG,KACtB,IAAa,IAAI,YAAY,GAAG,GAIjB,IAArB,MAAqB,EAAW;CAE5B,OAAO,KAAK,GAAQ,IAAO,GAAa,IAAO,GAAa;EACxD,IAAM,IAAI,EAAO,QACX,IAAS,IAAI,aAAa,IAAI,CAAC;EAErC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GACxB,IAAM,IAAI,EAAO;GAEjB,AADA,EAAO,IAAI,KAAK,EAAK,CAAC,GACtB,EAAO,IAAI,IAAI,KAAK,EAAK,CAAC;EAC9B;EAEA,OAAO,IAAI,EAAW,CAAM;CAChC;CAEA,YAAY,GAAQ;EAChB,IAAM,IAAI,EAAO,UAAU;EAC3B,IAAI,IAAI,KAAK,OAAO,EAAO,MAAO,UAAU,MAAU,MAAM,qCAAqC;EAEjG,KAAK,SAAS;EAGd,IAAM,IAAe,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;EAe1C,AAdA,KAAK,aAAa,IAAI,YAAY,IAAe,CAAC,GAClD,KAAK,aAAa,IAAI,WAAW,IAAe,CAAC,GAGjD,KAAK,YAAY,KAAK,KAAK,KAAK,KAAK,CAAC,CAAC,GACvC,KAAK,YAAY,IAAI,YAAY,CAAC,GAClC,KAAK,YAAY,IAAI,YAAY,CAAC,GAClC,KAAK,WAAW,IAAI,YAAY,CAAC,GACjC,KAAK,YAAY,IAAI,WAAW,KAAK,SAAS,GAG9C,KAAK,OAAO,IAAI,YAAY,CAAC,GAC7B,KAAK,SAAS,IAAI,aAAa,CAAC,GAEhC,KAAK,OAAO;CAChB;CAEA,SAAS;EACL,IAAM,EAAC,WAAQ,WAAW,GAAU,WAAW,GAAU,UAAU,GAAS,WAAW,MAAa,MAC9F,IAAI,EAAO,UAAU,GAGvB,IAAO,UACP,IAAO,UACP,IAAO,WACP,IAAO;EAEX,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GACxB,IAAM,IAAI,EAAO,IAAI,IACf,IAAI,EAAO,IAAI,IAAI;GAKzB,AAJI,IAAI,MAAM,IAAO,IACjB,IAAI,MAAM,IAAO,IACjB,IAAI,MAAM,IAAO,IACjB,IAAI,MAAM,IAAO,IACrB,KAAK,KAAK,KAAK;EACnB;EACA,IAAM,KAAM,IAAO,KAAQ,GACrB,KAAM,IAAO,KAAQ,GAEvB,GAAI,GAAI;EAGZ,KAAK,IAAI,IAAI,GAAG,IAAU,UAAU,IAAI,GAAG,KAAK;GAC5C,IAAM,IAAI,EAAK,GAAI,GAAI,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,EAAE;GACvD,AAAI,IAAI,MACJ,IAAK,GACL,IAAU;EAElB;EACA,IAAM,IAAM,EAAO,IAAI,IACjB,IAAM,EAAO,IAAI,IAAK;EAG5B,KAAK,IAAI,IAAI,GAAG,IAAU,UAAU,IAAI,GAAG,KAAK;GAC5C,IAAI,MAAM,GAAI;GACd,IAAM,IAAI,EAAK,GAAK,GAAK,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,EAAE;GACzD,AAAI,IAAI,KAAW,IAAI,MACnB,IAAK,GACL,IAAU;EAElB;EACA,IAAI,IAAM,EAAO,IAAI,IACjB,IAAM,EAAO,IAAI,IAAK,IAEtB,IAAY;EAGhB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GACxB,IAAI,MAAM,KAAM,MAAM,GAAI;GAC1B,IAAM,IAAI,EAAa,GAAK,GAAK,GAAK,GAAK,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,EAAE;GAC3E,AAAI,IAAI,MACJ,IAAK,GACL,IAAY;EAEpB;EACA,IAAI,IAAM,EAAO,IAAI,IACjB,IAAM,EAAO,IAAI,IAAK;EAE1B,IAAI,MAAc,UAAU;GAGxB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACnB,KAAK,OAAO,KAAM,EAAO,IAAI,KAAK,EAAO,MAAQ,EAAO,IAAI,IAAI,KAAK,EAAO;GAEhF,EAAU,KAAK,MAAM,KAAK,QAAQ,GAAG,IAAI,CAAC;GAC1C,IAAM,IAAO,IAAI,YAAY,CAAC,GAC1B,IAAI;GACR,KAAK,IAAI,IAAI,GAAG,IAAK,WAAW,IAAI,GAAG,KAAK;IACxC,IAAM,IAAK,KAAK,KAAK,IACf,IAAI,KAAK,OAAO;IACtB,AAAI,IAAI,MACJ,EAAK,OAAO,GACZ,IAAK;GAEb;GAGA,AAFA,KAAK,OAAO,EAAK,SAAS,GAAG,CAAC,GAC9B,KAAK,YAAY,IAAI,YAAa,GAClC,KAAK,YAAY,IAAI,YAAa;GAClC;EACJ;EAGA,IAAI,EAAS,GAAK,GAAK,GAAK,GAAK,GAAK,CAAG,IAAI,GAAG;GAC5C,IAAM,IAAI,GACJ,IAAI,GACJ,IAAI;GAMV,AALA,IAAK,GACL,IAAM,GACN,IAAM,GACN,IAAK,GACL,IAAM,GACN,IAAM;EACV;EAEA,IAAM,IAAS,EAAa,GAAK,GAAK,GAAK,GAAK,GAAK,CAAG;EAExD,AADA,KAAK,MAAM,EAAO,GAClB,KAAK,MAAM,EAAO;EAElB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACnB,KAAK,OAAO,KAAK,EAAK,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,IAAI,EAAO,GAAG,EAAO,CAAC;EAO9E,AAHA,EAAU,KAAK,MAAM,KAAK,QAAQ,GAAG,IAAI,CAAC,GAG1C,KAAK,aAAa;EAClB,IAAI,IAAW;EAgBf,AAdA,EAAS,KAAM,EAAS,KAAM,GAC9B,EAAS,KAAM,EAAS,KAAM,GAC9B,EAAS,KAAM,EAAS,KAAM,GAE9B,EAAQ,KAAM,GACd,EAAQ,KAAM,GACd,EAAQ,KAAM,GAEd,EAAS,KAAK,EAAE,GAChB,EAAS,KAAK,SAAS,GAAK,CAAG,KAAK,GACpC,EAAS,KAAK,SAAS,GAAK,CAAG,KAAK,GACpC,EAAS,KAAK,SAAS,GAAK,CAAG,KAAK,GAEpC,KAAK,eAAe,GACpB,KAAK,aAAa,GAAI,GAAI,GAAI,IAAI,IAAI,EAAE;EAExC,KAAK,IAAI,IAAI,GAAG,GAAI,GAAI,IAAI,KAAK,KAAK,QAAQ,KAAK;GAC/C,IAAM,IAAI,KAAK,KAAK,IACd,IAAI,EAAO,IAAI,IACf,IAAI,EAAO,IAAI,IAAI;GAQzB,IALI,IAAI,KAAK,KAAK,IAAI,IAAI,CAAE,KAAK,KAAW,KAAK,IAAI,IAAI,CAAE,KAAK,MAChE,IAAK,GACL,IAAK,GAGD,MAAM,KAAM,MAAM,KAAM,MAAM,IAAI;GAGtC,IAAI,IAAQ;GACZ,KAAK,IAAI,IAAI,GAAG,IAAM,KAAK,SAAS,GAAG,CAAC,GAAG,IAAI,KAAK,cAChD,IAAQ,GAAU,IAAM,KAAK,KAAK,YAC9B,QAAU,MAAM,MAAU,EAAS,MAFoB;GAK/D,IAAQ,EAAS;GACjB,IAAI,IAAI,GAAO;GACf,OAAO,IAAI,EAAS,IAAI,EAAS,GAAG,GAAG,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,IAAI,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,EAAE,KAAK,IAE1G,IADA,IAAI,GACA,MAAM,GAAO;IACb,IAAI;IACJ;GACJ;GAEJ,IAAI,MAAM,IAAI;GAGd,IAAI,IAAI,KAAK,aAAa,GAAG,GAAG,EAAS,IAAI,IAAI,IAAI,EAAQ,EAAE;GAK/D,AAFA,EAAQ,KAAK,KAAK,UAAU,IAAI,CAAC,GACjC,EAAQ,KAAK,GACb;GAGA,IAAI,IAAI,EAAS;GACjB,OAAO,IAAI,EAAS,IAAI,EAAS,GAAG,GAAG,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,IAAI,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,EAAE,IAAI,IAKzG,AAJA,IAAI,KAAK,aAAa,GAAG,GAAG,GAAG,EAAQ,IAAI,IAAI,EAAQ,EAAE,GACzD,EAAQ,KAAK,KAAK,UAAU,IAAI,CAAC,GACjC,EAAS,KAAK,GACd,KACA,IAAI;GAIR,IAAI,MAAM,GACN,OAAO,IAAI,EAAS,IAAI,EAAS,GAAG,GAAG,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,IAAI,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,EAAE,IAAI,IAMzG,AALA,IAAI,KAAK,aAAa,GAAG,GAAG,GAAG,IAAI,EAAQ,IAAI,EAAQ,EAAE,GACzD,KAAK,UAAU,IAAI,CAAC,GACpB,EAAQ,KAAK,GACb,EAAS,KAAK,GACd,KACA,IAAI;GAWZ,AANA,KAAK,aAAa,EAAS,KAAK,GAChC,EAAS,KAAK,EAAS,KAAK,GAC5B,EAAS,KAAK,GAGd,EAAS,KAAK,SAAS,GAAG,CAAC,KAAK,GAChC,EAAS,KAAK,SAAS,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,EAAE,KAAK;EAChE;EAEA,KAAK,OAAO,IAAI,YAAY,CAAQ;EACpC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,YAAY,IAAI,GAAU,KAE/C,AADA,KAAK,KAAK,KAAK,GACf,IAAI,EAAS;EAKjB,AADA,KAAK,YAAY,KAAK,WAAW,SAAS,GAAG,KAAK,YAAY,GAC9D,KAAK,YAAY,KAAK,WAAW,SAAS,GAAG,KAAK,YAAY;CAClE;CAEA,SAAS,GAAG,GAAG;EACX,OAAO,KAAK,MAAM,EAAY,IAAI,KAAK,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,SAAS,IAAI,KAAK;CACvF;CAEA,UAAU,GAAG;EACT,IAAM,EAAC,YAAY,GAAW,YAAY,GAAW,cAAU,MAE3D,IAAI,GACJ,IAAK;EAGT,SAAa;GACT,IAAM,IAAI,EAAU,IAiBd,IAAK,IAAI,IAAI;GAGnB,IAFA,IAAK,KAAM,IAAI,KAAK,GAEhB,MAAM,IAAI;IACV,IAAI,MAAM,GAAG;IACb,IAAI,EAAW,EAAE;IACjB;GACJ;GAEA,IAAM,IAAK,IAAI,IAAI,GACb,IAAK,KAAM,IAAI,KAAK,GACpB,IAAK,KAAM,IAAI,KAAK,GAEpB,IAAK,EAAU,IACf,IAAK,EAAU,IACf,IAAK,EAAU,IACf,IAAK,EAAU;GAQrB,IANgB,EACZ,EAAO,IAAI,IAAK,EAAO,IAAI,IAAK,IAChC,EAAO,IAAI,IAAK,EAAO,IAAI,IAAK,IAChC,EAAO,IAAI,IAAK,EAAO,IAAI,IAAK,IAChC,EAAO,IAAI,IAAK,EAAO,IAAI,IAAK,EAE1B,GAAG;IAET,AADA,EAAU,KAAK,GACf,EAAU,KAAK;IAEf,IAAM,IAAM,EAAU;IAGtB,IAAI,MAAQ,IAAI;KACZ,IAAI,IAAI,KAAK;KACb,GAAG;MACC,IAAI,KAAK,SAAS,OAAO,GAAI;OACzB,KAAK,SAAS,KAAK;OACnB;MACJ;MACA,IAAI,KAAK,UAAU;KACvB,SAAS,MAAM,KAAK;IACxB;IAGA,AAFA,KAAK,MAAM,GAAG,CAAG,GACjB,KAAK,MAAM,GAAG,EAAU,EAAG,GAC3B,KAAK,MAAM,GAAI,CAAE;IAEjB,IAAM,IAAK,KAAM,IAAI,KAAK;IAG1B,AAAI,IAAI,EAAW,WACf,EAAW,OAAO;GAE1B,OAAO;IACH,IAAI,MAAM,GAAG;IACb,IAAI,EAAW,EAAE;GACrB;EACJ;EAEA,OAAO;CACX;CAEA,MAAM,GAAG,GAAG;EAER,AADA,KAAK,WAAW,KAAK,GACjB,MAAM,OAAI,KAAK,WAAW,KAAK;CACvC;CAGA,aAAa,GAAI,GAAI,GAAI,GAAG,GAAG,GAAG;EAC9B,IAAM,IAAI,KAAK;EAYf,OAVA,KAAK,WAAW,KAAK,GACrB,KAAK,WAAW,IAAI,KAAK,GACzB,KAAK,WAAW,IAAI,KAAK,GAEzB,KAAK,MAAM,GAAG,CAAC,GACf,KAAK,MAAM,IAAI,GAAG,CAAC,GACnB,KAAK,MAAM,IAAI,GAAG,CAAC,GAEnB,KAAK,gBAAgB,GAEd;CACX;AACJ;AAGA,SAAS,EAAY,GAAI,GAAI;CACzB,IAAM,IAAI,KAAM,KAAK,IAAI,CAAE,IAAI,KAAK,IAAI,CAAE;CAC1C,QAAQ,IAAK,IAAI,IAAI,IAAI,IAAI,KAAK;AACtC;AAEA,SAAS,EAAK,GAAI,GAAI,GAAI,GAAI;CAC1B,IAAM,IAAK,IAAK,GACV,IAAK,IAAK;CAChB,OAAO,IAAK,IAAK,IAAK;AAC1B;AAEA,SAAS,EAAS,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI;CAC9C,IAAM,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GAEV,IAAK,IAAK,IAAK,IAAK,GACpB,IAAK,IAAK,IAAK,IAAK,GACpB,IAAK,IAAK,IAAK,IAAK;CAE1B,OAAO,KAAM,IAAK,IAAK,IAAK,KACrB,KAAM,IAAK,IAAK,IAAK,KACrB,KAAM,IAAK,IAAK,IAAK,KAAM;AACtC;AAEA,SAAS,EAAa,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI;CAC1C,IAAM,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GAEV,IAAK,IAAK,IAAK,IAAK,GACpB,IAAK,IAAK,IAAK,IAAK,GACpB,IAAI,MAAO,IAAK,IAAK,IAAK,IAE1B,KAAK,IAAK,IAAK,IAAK,KAAM,GAC1B,KAAK,IAAK,IAAK,IAAK,KAAM;CAEhC,OAAO,IAAI,IAAI,IAAI;AACvB;AAEA,SAAS,EAAa,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI;CAC1C,IAAM,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GAEV,IAAK,IAAK,IAAK,IAAK,GACpB,IAAK,IAAK,IAAK,IAAK,GACpB,IAAI,MAAO,IAAK,IAAK,IAAK;CAKhC,OAAO;EAAC,GAHE,KAAM,IAAK,IAAK,IAAK,KAAM;EAG1B,GAFD,KAAM,IAAK,IAAK,IAAK,KAAM;CAEzB;AAChB;AAEA,SAAS,EAAU,GAAK,GAAO,GAAM,GAAO;CACxC,IAAI,IAAQ,KAAQ,IAChB,KAAK,IAAI,IAAI,IAAO,GAAG,KAAK,GAAO,KAAK;EACpC,IAAM,IAAO,EAAI,IACX,IAAW,EAAM,IACnB,IAAI,IAAI;EACZ,OAAO,KAAK,KAAQ,EAAM,EAAI,MAAM,IAAU,EAAI,IAAI,KAAK,EAAI;EAC/D,EAAI,IAAI,KAAK;CACjB;MACG;EACH,IAAM,IAAU,IAAO,KAAU,GAC7B,IAAI,IAAO,GACX,IAAI;EAIR,AAHA,EAAK,GAAK,GAAQ,CAAC,GACf,EAAM,EAAI,MAAS,EAAM,EAAI,OAAS,EAAK,GAAK,GAAM,CAAK,GAC3D,EAAM,EAAI,MAAM,EAAM,EAAI,OAAS,EAAK,GAAK,GAAG,CAAK,GACrD,EAAM,EAAI,MAAS,EAAM,EAAI,OAAK,EAAK,GAAK,GAAM,CAAC;EAEvD,IAAM,IAAO,EAAI,IACX,IAAW,EAAM;EACvB,SAAa;GACT;IAAG;UAAY,EAAM,EAAI,MAAM;GAC/B;IAAG;UAAY,EAAM,EAAI,MAAM;GAC/B,IAAI,IAAI,GAAG;GACX,EAAK,GAAK,GAAG,CAAC;EAClB;EAIA,AAHA,EAAI,IAAO,KAAK,EAAI,IACpB,EAAI,KAAK,GAEL,IAAQ,IAAI,KAAK,IAAI,KACrB,EAAU,GAAK,GAAO,GAAG,CAAK,GAC9B,EAAU,GAAK,GAAO,GAAM,IAAI,CAAC,MAEjC,EAAU,GAAK,GAAO,GAAM,IAAI,CAAC,GACjC,EAAU,GAAK,GAAO,GAAG,CAAK;CAEtC;AACJ;AAEA,SAAS,EAAK,GAAK,GAAG,GAAG;CACrB,IAAM,IAAM,EAAI;CAEhB,AADA,EAAI,KAAK,EAAI,IACb,EAAI,KAAK;AACb;AAEA,SAAS,EAAY,GAAG;CACpB,OAAO,EAAE;AACb;AACA,SAAS,EAAY,GAAG;CACpB,OAAO,EAAE;AACb;;;AC/dA,IAAM,IAAU,MAEK,IAArB,MAA0B;CACxB,cAAc;EAGZ,AAFA,KAAK,MAAM,KAAK,MAChB,KAAK,MAAM,KAAK,MAAM,MACtB,KAAK,IAAI;CACX;CACA,OAAO,GAAG,GAAG;EACX,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,GAAG,KAAK,MAAM,KAAK,MAAM,CAAC;CACnE;CACA,YAAY;EACV,AAAI,KAAK,QAAQ,SACf,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KACrC,KAAK,KAAK;CAEd;CACA,OAAO,GAAG,GAAG;EACX,KAAK,KAAK,IAAI,KAAK,MAAM,CAAC,EAAE,GAAG,KAAK,MAAM,CAAC;CAC7C;CACA,IAAI,GAAG,GAAG,GAAG;EACX,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;EACrB,IAAM,IAAK,IAAI,GACT,IAAK;EACX,IAAI,IAAI,GAAG,MAAU,MAAM,iBAAiB;EAC5C,AAAI,KAAK,QAAQ,OAAM,KAAK,KAAK,IAAI,EAAG,GAAG,OAClC,KAAK,IAAI,KAAK,MAAM,CAAE,IAAI,KAAW,KAAK,IAAI,KAAK,MAAM,CAAE,IAAI,OAAS,KAAK,KAAK,MAAM,IAAK,MAAM,IACvG,MACL,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,SAAS,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,SAAS,KAAK,MAAM,EAAG,GAAG,KAAK,MAAM;CAC1F;CACA,KAAK,GAAG,GAAG,GAAG,GAAG;EACf,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,GAAG,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE;CACvF;CACA,QAAQ;EACN,OAAO,KAAK,KAAK;CACnB;AACF,GCpCqB,IAArB,MAA6B;CAC3B,cAAc;EACZ,KAAK,IAAI,CAAC;CACZ;CACA,OAAO,GAAG,GAAG;EACX,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;CACpB;CACA,YAAY;EACV,KAAK,EAAE,KAAK,KAAK,EAAE,GAAG,MAAM,CAAC;CAC/B;CACA,OAAO,GAAG,GAAG;EACX,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;CACpB;CACA,QAAQ;EACN,OAAO,KAAK,EAAE,SAAS,KAAK,IAAI;CAClC;AACF,GCbqB,IAArB,MAA6B;CAC3B,YAAY,GAAU,CAAC,GAAM,GAAM,GAAM,KAAQ;EAAC;EAAG;EAAG;EAAK;CAAG,GAAG;EACjE,IAAI,GAAG,IAAO,CAAC,OAAU,IAAO,CAAC,OAAU,GAAG,IAAO,CAAC,OAAU,IAAO,CAAC,KAAQ,MAAU,MAAM,gBAAgB;EAMhH,AALA,KAAK,WAAW,GAChB,KAAK,iBAAiB,IAAI,aAAa,EAAS,OAAO,SAAS,CAAC,GACjE,KAAK,UAAU,IAAI,aAAa,EAAS,OAAO,SAAS,CAAC,GAC1D,KAAK,OAAO,GAAM,KAAK,OAAO,GAC9B,KAAK,OAAO,GAAM,KAAK,OAAO,GAC9B,KAAK,MAAM;CACb;CACA,SAAS;EAGP,OAFA,KAAK,SAAS,OAAO,GACrB,KAAK,MAAM,GACJ;CACT;CACA,QAAQ;EACN,IAAM,EAAC,UAAU,EAAC,WAAQ,SAAM,gBAAY,eAAW,MACnD,GAAI,GAGF,IAAgB,KAAK,gBAAgB,KAAK,eAAe,SAAS,GAAG,EAAU,SAAS,IAAI,CAAC;EACnG,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,EAAU,QAAQ,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG;GACxE,IAAM,IAAK,EAAU,KAAK,GACpB,IAAK,EAAU,IAAI,KAAK,GACxB,IAAK,EAAU,IAAI,KAAK,GACxB,IAAK,EAAO,IACZ,IAAK,EAAO,IAAK,IACjB,IAAK,EAAO,IACZ,IAAK,EAAO,IAAK,IACjB,IAAK,EAAO,IACZ,IAAK,EAAO,IAAK,IAEjB,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,IAAK,IAAK,GACV,KAAM,IAAK,IAAK,IAAK,KAAM;GAEjC,IAAI,KAAK,IAAI,CAAE,IAAI,MAAM;IAIvB,IAAI,MAAO,KAAA,GAAW;KACpB,IAAK,IAAK;KACV,KAAK,IAAM,KAAK,GAAM,KAAM,EAAO,IAAI,IAAI,KAAM,EAAO,IAAI,IAAI;KAChE,KAAM,EAAK,QAAQ,KAAM,EAAK;IAChC;IACA,IAAM,IAAI,MAAM,KAAK,MAAM,IAAK,KAAM,KAAM,IAAK,KAAM,CAAE;IAEzD,AADA,KAAK,IAAK,KAAM,IAAI,IAAI,GACxB,KAAK,IAAK,KAAM,IAAI,IAAI;GAC1B,OAAO;IACL,IAAM,IAAI,IAAI,GACR,IAAK,IAAK,IAAK,IAAK,GACpB,IAAK,IAAK,IAAK,IAAK;IAE1B,AADA,IAAI,KAAM,IAAK,IAAK,IAAK,KAAM,GAC/B,IAAI,KAAM,IAAK,IAAK,IAAK,KAAM;GACjC;GAEA,AADA,EAAc,KAAK,GACnB,EAAc,IAAI,KAAK;EACzB;EAGA,IAAI,IAAI,EAAK,EAAK,SAAS,IACvB,GAAI,IAAK,IAAI,GACb,GAAI,IAAK,EAAO,IAAI,IACpB,GAAI,IAAK,EAAO,IAAI,IAAI;EAC5B,EAAQ,KAAK,CAAC;EACd,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,EAAE,GAKjC,AAJA,IAAI,EAAK,IACT,IAAK,GAAI,IAAK,GAAI,IAAK,GACvB,IAAK,IAAI,GAAG,IAAK,EAAO,IAAI,IAAI,IAAK,EAAO,IAAI,IAAI,IACpD,EAAQ,IAAK,KAAK,EAAQ,KAAM,IAAK,GACrC,EAAQ,IAAK,KAAK,EAAQ,IAAK,KAAK,IAAK;CAE7C;CACA,OAAO,GAAS;EACd,IAAM,IAAS,KAAW,OAAO,IAAU,IAAI,EAAG,IAAI,KAAA,GAChD,EAAC,UAAU,EAAC,cAAW,YAAS,WAAO,kBAAe,eAAW;EACvE,IAAI,EAAK,UAAU,GAAG,OAAO;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAU,QAAQ,IAAI,GAAG,EAAE,GAAG;GAChD,IAAM,IAAI,EAAU;GACpB,IAAI,IAAI,GAAG;GACX,IAAM,IAAK,KAAK,MAAM,IAAI,CAAC,IAAI,GACzB,IAAK,KAAK,MAAM,IAAI,CAAC,IAAI,GACzB,IAAK,EAAc,IACnB,IAAK,EAAc,IAAK,IACxB,IAAK,EAAc,IACnB,IAAK,EAAc,IAAK;GAC9B,KAAK,eAAe,GAAI,GAAI,GAAI,GAAI,CAAO;EAC7C;EACA,IAAI,GAAI,IAAK,EAAK,EAAK,SAAS;EAChC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,EAAE,GAAG;GACpC,IAAK,GAAI,IAAK,EAAK;GACnB,IAAM,IAAI,KAAK,MAAM,EAAQ,KAAM,CAAC,IAAI,GAClC,IAAI,EAAc,IAClB,IAAI,EAAc,IAAI,IACtB,IAAI,IAAK,GACT,IAAI,KAAK,SAAS,GAAG,GAAG,EAAQ,IAAI,IAAI,EAAQ,IAAI,EAAE;GAC5D,AAAI,KAAG,KAAK,eAAe,GAAG,GAAG,EAAE,IAAI,EAAE,IAAI,CAAO;EACtD;EACA,OAAO,KAAU,EAAO,MAAM;CAChC;CACA,aAAa,GAAS;EACpB,IAAM,IAAS,KAAW,OAAO,IAAU,IAAI,EAAG,IAAI,KAAA;EAEtD,OADA,EAAQ,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,GACxE,KAAU,EAAO,MAAM;CAChC;CACA,WAAW,GAAG,GAAS;EACrB,IAAM,IAAS,KAAW,OAAO,IAAU,IAAI,EAAG,IAAI,KAAA,GAChD,IAAS,KAAK,MAAM,CAAC;EAC3B,IAAI,MAAW,QAAQ,CAAC,EAAO,QAAQ;EACvC,EAAQ,OAAO,EAAO,IAAI,EAAO,EAAE;EACnC,IAAI,IAAI,EAAO;EACf,OAAO,EAAO,OAAO,EAAO,IAAE,MAAM,EAAO,OAAO,EAAO,IAAE,MAAM,IAAI,IAAG,KAAK;EAC7E,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAC1B,CAAI,EAAO,OAAO,EAAO,IAAE,MAAM,EAAO,IAAE,OAAO,EAAO,IAAE,OACxD,EAAQ,OAAO,EAAO,IAAI,EAAO,IAAI,EAAE;EAG3C,OADA,EAAQ,UAAU,GACX,KAAU,EAAO,MAAM;CAChC;CACA,CAAC,eAAe;EACd,IAAM,EAAC,UAAU,EAAC,gBAAW;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAO,SAAS,GAAG,IAAI,GAAG,EAAE,GAAG;GACjD,IAAM,IAAO,KAAK,YAAY,CAAC;GAC/B,AAAI,MAAM,EAAK,QAAQ,GAAG,MAAM;EAClC;CACF;CACA,YAAY,GAAG;EACb,IAAM,IAAU,IAAI,EAAM;EAE1B,OADA,KAAK,WAAW,GAAG,CAAO,GACnB,EAAQ,MAAM;CACvB;CACA,eAAe,GAAI,GAAI,GAAI,GAAI,GAAS;EACtC,IAAI,GACE,IAAK,KAAK,YAAY,GAAI,CAAE,GAC5B,IAAK,KAAK,YAAY,GAAI,CAAE;EAClC,AAAI,MAAO,KAAK,MAAO,KACrB,EAAQ,OAAO,GAAI,CAAE,GACrB,EAAQ,OAAO,GAAI,CAAE,MACZ,IAAI,KAAK,aAAa,GAAI,GAAI,GAAI,GAAI,GAAI,CAAE,OACrD,EAAQ,OAAO,EAAE,IAAI,EAAE,EAAE,GACzB,EAAQ,OAAO,EAAE,IAAI,EAAE,EAAE;CAE7B;CACA,SAAS,GAAG,GAAG,GAAG;EAEhB,QADK,IAAI,CAAC,GAAG,MAAM,OAAO,IAAI,CAAC,GAAG,MAAM,KAAW,KAC5C,KAAK,SAAS,MAAM,GAAG,GAAG,CAAC,MAAM;CAC1C;CACA,CAAC,UAAU,GAAG;EACZ,IAAM,IAAK,KAAK,MAAM,CAAC;EACvB,IAAI,GAAI,KAAK,IAAM,KAAK,KAAK,SAAS,UAAU,CAAC,GAAG;GAClD,IAAM,IAAK,KAAK,MAAM,CAAC;GAEvB,IAAI;UAAU,KAAK,IAAI,IAAK,GAAG,IAAK,EAAG,QAAQ,IAAK,GAAI,KAAM,GAC5D,KAAK,IAAI,IAAK,GAAG,IAAK,EAAG,QAAQ,IAAK,GAAI,KAAM,GAC9C,IAAI,EAAG,OAAQ,EAAG,MACX,EAAG,IAAK,OAAO,EAAG,IAAK,MACvB,GAAI,IAAK,KAAK,OAAQ,GAAI,IAAK,IAAK,KAAK,MACzC,GAAI,IAAK,KAAK,OAAQ,GAAI,IAAK,IAAK,KAAK,IAAK;KACnD,MAAM;KACN,MAAM;IACR;;EAGN;CACF;CACA,MAAM,GAAG;EACP,IAAM,EAAC,kBAAe,UAAU,EAAC,YAAS,cAAW,mBAAc,MAC7D,IAAK,EAAQ;EACnB,IAAI,MAAO,IAAI,OAAO;EACtB,IAAM,IAAS,CAAC,GACZ,IAAI;EACR,GAAG;GACD,IAAM,IAAI,KAAK,MAAM,IAAI,CAAC;GAG1B,IAFA,EAAO,KAAK,EAAc,IAAI,IAAI,EAAc,IAAI,IAAI,EAAE,GAC1D,IAAI,IAAI,KAAM,IAAI,IAAI,IAAI,IAAI,GAC1B,EAAU,OAAO,GAAG;GACxB,IAAI,EAAU;EAChB,SAAS,MAAM,KAAM,MAAM;EAC3B,OAAO;CACT;CACA,MAAM,GAAG;EAEP,IAAI,MAAM,KAAK,KAAK,SAAS,KAAK,WAAW,GAC3C,OAAO;GAAC,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;EAAI;EAEhG,IAAM,IAAS,KAAK,MAAM,CAAC;EAC3B,IAAI,MAAW,MAAM,OAAO;EAC5B,IAAM,EAAC,SAAS,MAAK,MACf,IAAI,IAAI;EACd,OAAO,KAAK,UAAU,EAAE,MAAM,EAAE,IAAI,KAC9B,KAAK,cAAc,GAAG,GAAQ,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE,IAChE,KAAK,YAAY,GAAG,CAAM,CAAC;CACnC;CACA,YAAY,GAAG,GAAQ;EACrB,IAAM,IAAI,EAAO,QACb,IAAI,MACJ,GAAI,GAAI,IAAK,EAAO,IAAI,IAAI,IAAK,EAAO,IAAI,IAC5C,GAAI,IAAK,KAAK,YAAY,GAAI,CAAE,GAChC,GAAI,IAAK;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAG1B,IAFA,IAAK,GAAI,IAAK,GAAI,IAAK,EAAO,IAAI,IAAK,EAAO,IAAI,IAClD,IAAK,GAAI,IAAK,KAAK,YAAY,GAAI,CAAE,GACjC,MAAO,KAAK,MAAO,GAErB,AADA,IAAK,GAAI,IAAK,GACV,IAAG,EAAE,KAAK,GAAI,CAAE,IACf,IAAI,CAAC,GAAI,CAAE;OACX;GACL,IAAI,GAAG,GAAK,GAAK,GAAK;GACtB,IAAI,MAAO,GAAG;IACZ,KAAK,IAAI,KAAK,aAAa,GAAI,GAAI,GAAI,GAAI,GAAI,CAAE,OAAO,MAAM;IAC9D,CAAC,GAAK,GAAK,GAAK,KAAO;GACzB,OAAO;IACL,KAAK,IAAI,KAAK,aAAa,GAAI,GAAI,GAAI,GAAI,GAAI,CAAE,OAAO,MAAM;IAI9D,AAHA,CAAC,GAAK,GAAK,GAAK,KAAO,GACvB,IAAK,GAAI,IAAK,KAAK,UAAU,GAAK,CAAG,GACjC,KAAM,KAAI,KAAK,MAAM,GAAG,GAAI,GAAI,GAAG,EAAE,MAAM,GAC3C,IAAG,EAAE,KAAK,GAAK,CAAG,IACjB,IAAI,CAAC,GAAK,CAAG;GACpB;GAGA,AAFA,IAAK,GAAI,IAAK,KAAK,UAAU,GAAK,CAAG,GACjC,KAAM,KAAI,KAAK,MAAM,GAAG,GAAI,GAAI,GAAG,EAAE,MAAM,GAC3C,IAAG,EAAE,KAAK,GAAK,CAAG,IACjB,IAAI,CAAC,GAAK,CAAG;EACpB;EAEF,IAAI,GAEF,AADA,IAAK,GAAI,IAAK,KAAK,UAAU,EAAE,IAAI,EAAE,EAAE,GACnC,KAAM,KAAI,KAAK,MAAM,GAAG,GAAI,GAAI,GAAG,EAAE,MAAM;OAC1C,IAAI,KAAK,SAAS,IAAI,KAAK,OAAO,KAAK,QAAQ,IAAI,KAAK,OAAO,KAAK,QAAQ,CAAC,GAClF,OAAO;GAAC,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;EAAI;EAEhG,OAAO;CACT;CACA,aAAa,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI;EAEnC,IAAM,IAAO,IAAK;EAElB,KADI,MAAM,CAAC,GAAI,GAAI,GAAI,GAAI,GAAI,KAAM;GAAC;GAAI;GAAI;GAAI;GAAI;GAAI;EAAE,MAC/C;GACX,IAAI,MAAO,KAAK,MAAO,GAAG,OAAO,IAAO;IAAC;IAAI;IAAI;IAAI;GAAE,IAAI;IAAC;IAAI;IAAI;IAAI;GAAE;GAC1E,IAAI,IAAK,GAAI,OAAO;GACpB,IAAI,GAAG,GAAG,IAAI,KAAM;GAKpB,AAJI,IAAI,KAAQ,IAAI,KAAM,IAAK,MAAO,KAAK,OAAO,MAAO,IAAK,IAAK,IAAI,KAAK,QACnE,IAAI,KAAQ,IAAI,KAAM,IAAK,MAAO,KAAK,OAAO,MAAO,IAAK,IAAK,IAAI,KAAK,QACxE,IAAI,KAAQ,IAAI,KAAM,IAAK,MAAO,KAAK,OAAO,MAAO,IAAK,IAAK,IAAI,KAAK,SAC5E,IAAI,KAAM,IAAK,MAAO,KAAK,OAAO,MAAO,IAAK,IAAK,IAAI,KAAK,OAC7D,KAAI,IAAK,GAAG,IAAK,GAAG,IAAK,KAAK,YAAY,GAAI,CAAE,MAC/C,IAAK,GAAG,IAAK,GAAG,IAAK,KAAK,YAAY,GAAI,CAAE;EACnD;CACF;CACA,cAAc,GAAG,GAAQ,GAAK,GAAK,GAAK,GAAK;EAC3C,IAAI,IAAI,MAAM,KAAK,CAAM,GAAG;EAG5B,KAFI,IAAI,KAAK,SAAS,EAAE,IAAI,EAAE,IAAI,GAAK,CAAG,MAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,IAC7D,IAAI,KAAK,SAAS,EAAE,EAAE,SAAS,IAAI,EAAE,EAAE,SAAS,IAAI,GAAK,CAAG,MAAG,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,GAChF,IAAI,KAAK,YAAY,GAAG,CAAC,GAC3B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,GAAI,IAAK,KAAK,UAAU,EAAE,IAAI,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,GAAG,KAAK,GAErF,AADA,IAAK,GAAI,IAAK,KAAK,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,GACvC,KAAM,MAAI,IAAI,KAAK,MAAM,GAAG,GAAI,GAAI,GAAG,CAAC,GAAG,IAAI,EAAE;OAElD,AAAI,KAAK,SAAS,IAAI,KAAK,OAAO,KAAK,QAAQ,IAAI,KAAK,OAAO,KAAK,QAAQ,CAAC,MAClF,IAAI;GAAC,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;GAAM,KAAK;EAAI;EAE7F,OAAO;CACT;CACA,MAAM,GAAG,GAAI,GAAI,GAAG,GAAG;EACrB,OAAO,MAAO,IAAI;GAChB,IAAI,GAAG;GACP,QAAQ,GAAR;IACE,KAAK;KAAQ,IAAK;KAAQ;IAC1B,KAAK;KAAQ,IAAK,GAAQ,IAAI,KAAK,MAAM,IAAI,KAAK;KAAM;IACxD,KAAK;KAAQ,IAAK;KAAQ;IAC1B,KAAK;KAAQ,IAAK,IAAQ,IAAI,KAAK,MAAM,IAAI,KAAK;KAAM;IACxD,KAAK;KAAQ,IAAK;KAAQ;IAC1B,KAAK;KAAQ,IAAK,GAAQ,IAAI,KAAK,MAAM,IAAI,KAAK;KAAM;IACxD,KAAK;KAAQ,IAAK;KAAQ;IAC1B,KAAK;KAAQ,IAAK,GAAQ,IAAI,KAAK,MAAM,IAAI,KAAK;KAAM;GAC1D;GAGA,CAAK,EAAE,OAAO,KAAK,EAAE,IAAI,OAAO,MAAM,KAAK,SAAS,GAAG,GAAG,CAAC,MACzD,EAAE,OAAO,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK;EAE/B;EACA,OAAO;CACT;CACA,SAAS,GAAI,GAAI,GAAI,GAAI;EACvB,IAAI,IAAI,UAAU,GAAG,GAAG;EACxB,IAAI,IAAK,GAAG;GACV,IAAI,KAAM,KAAK,MAAM,OAAO;GAC5B,CAAK,KAAK,KAAK,OAAO,KAAM,KAAM,MAAG,IAAI,KAAK,MAAM,IAAI,KAAM,IAAI,KAAK;EACzE,OAAO,IAAI,IAAK,GAAG;GACjB,IAAI,KAAM,KAAK,MAAM,OAAO;GAC5B,CAAK,KAAK,KAAK,OAAO,KAAM,KAAM,MAAG,IAAI,KAAK,MAAM,IAAI,KAAM,IAAI,KAAK;EACzE;EACA,IAAI,IAAK,GAAG;GACV,IAAI,KAAM,KAAK,MAAM,OAAO;GAC5B,CAAK,KAAK,KAAK,OAAO,KAAM,KAAM,MAAG,IAAI,KAAK,MAAM,IAAI,KAAM,IAAI,KAAK;EACzE,OAAO,IAAI,IAAK,GAAG;GACjB,IAAI,KAAM,KAAK,MAAM,OAAO;GAC5B,CAAK,KAAK,KAAK,OAAO,KAAM,KAAM,MAAG,IAAI,KAAK,MAAM,IAAI,KAAM,IAAI,KAAK;EACzE;EACA,OAAO,CAAC,GAAG,CAAC;CACd;CACA,UAAU,GAAG,GAAG;EACd,QAAQ,MAAM,KAAK,OAAO,IACpB,MAAM,KAAK,OAAO,IAAS,MAC1B,MAAM,KAAK,OAAO,IACnB,MAAM,KAAK,OAAO,IAAS;CACnC;CACA,YAAY,GAAG,GAAG;EAChB,QAAQ,IAAI,KAAK,OAAO,IAClB,IAAI,KAAK,OAAO,IAAS,MACxB,IAAI,KAAK,OAAO,IACjB,IAAI,KAAK,OAAO,IAAS;CACjC;CACA,UAAU,GAAG;EACX,IAAI,KAAK,EAAE,SAAS,GAAG;GACrB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAI,GAAG;IACnC,IAAM,KAAK,IAAI,KAAK,EAAE,QAAQ,KAAK,IAAI,KAAK,EAAE;IAC9C,CAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,OAAO,EAAE,IAAI,MAAM,EAAE,IAAI,OAAO,EAAE,IAAI,QAChF,EAAE,OAAO,GAAG,CAAC,GAAG,KAAK;GAEzB;GACA,AAAK,EAAE,WAAQ,IAAI;EACrB;EACA,OAAO;CACT;AACF,GCtUM,IAAM,IAAI,KAAK,IAAI,IAAM,KAAK;AAEpC,SAAS,EAAO,GAAG;CACjB,OAAO,EAAE;AACX;AAEA,SAAS,EAAO,GAAG;CACjB,OAAO,EAAE;AACX;AAGA,SAAS,EAAU,GAAG;CACpB,IAAM,EAAC,cAAW,cAAU;CAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAU,QAAQ,KAAK,GAAG;EAC5C,IAAM,IAAI,IAAI,EAAU,IAClB,IAAI,IAAI,EAAU,IAAI,IACtB,IAAI,IAAI,EAAU,IAAI;EAG5B,KAFe,EAAO,KAAK,EAAO,OAAO,EAAO,IAAI,KAAK,EAAO,IAAI,OACrD,EAAO,KAAK,EAAO,OAAO,EAAO,IAAI,KAAK,EAAO,IAAI,MACxD,OAAO,OAAO;CAC5B;CACA,OAAO;AACT;AAEA,SAAS,EAAO,GAAG,GAAG,GAAG;CACvB,OAAO,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;AAC1D;AAEA,IAAqB,IAArB,MAAqB,EAAS;CAC5B,OAAO,KAAK,GAAQ,IAAK,GAAQ,IAAK,GAAQ,GAAM;EAClD,OAAO,IAAI,EAAS,YAAY,IAC1B,EAAU,GAAQ,GAAI,GAAI,CAAI,IAC9B,aAAa,KAAK,EAAa,GAAQ,GAAI,GAAI,CAAI,CAAC,CAAC;CAC7D;CACA,YAAY,GAAQ;EAKlB,AAJA,KAAK,cAAc,IAAI,EAAW,CAAM,GACxC,KAAK,UAAU,IAAI,WAAW,EAAO,SAAS,CAAC,GAC/C,KAAK,aAAa,IAAI,WAAW,EAAO,SAAS,CAAC,GAClD,KAAK,SAAS,KAAK,YAAY,QAC/B,KAAK,MAAM;CACb;CACA,SAAS;EAGP,OAFA,KAAK,YAAY,OAAO,GACxB,KAAK,MAAM,GACJ;CACT;CACA,QAAQ;EACN,IAAM,IAAI,KAAK,aAAa,IAAS,KAAK;EAG1C,IAAI,EAAE,QAAQ,EAAE,KAAK,SAAS,KAAK,EAAU,CAAC,GAAG;GAC/C,KAAK,YAAY,WAAW,KAAK,EAAC,QAAQ,EAAO,SAAO,EAAC,IAAI,GAAE,MAAM,CAAC,EACnE,MAAM,GAAG,MAAM,EAAO,IAAI,KAAK,EAAO,IAAI,MAAM,EAAO,IAAI,IAAI,KAAK,EAAO,IAAI,IAAI,EAAE;GACxF,IAAM,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,UAAU,KAAK,UAAU,SAAS,IACtE,IAAS;IAAE,EAAO,IAAI;IAAI,EAAO,IAAI,IAAI;IAAI,EAAO,IAAI;IAAI,EAAO,IAAI,IAAI;GAAG,GAC9E,IAAI,OAAO,KAAK,MAAM,EAAO,KAAK,EAAO,IAAI,EAAO,KAAK,EAAO,EAAE;GACpE,KAAK,IAAI,IAAI,GAAG,IAAI,EAAO,SAAS,GAAG,IAAI,GAAG,EAAE,GAAG;IACjD,IAAM,IAAI,EAAO,EAAO,IAAI,IAAI,EAAO,IAAI,IAAI,IAAI,CAAC;IAEpD,AADA,EAAO,IAAI,KAAK,EAAE,IAClB,EAAO,IAAI,IAAI,KAAK,EAAE;GACxB;GACA,KAAK,cAAc,IAAI,EAAW,CAAM;EAC1C,OACE,OAAO,KAAK;EAGd,IAAM,IAAY,KAAK,YAAY,KAAK,YAAY,WAC9C,IAAO,KAAK,OAAO,KAAK,YAAY,MACpC,IAAY,KAAK,YAAY,KAAK,YAAY,WAC9C,IAAU,KAAK,QAAQ,KAAK,EAAE,GAC9B,IAAY,KAAK,WAAW,KAAK,EAAE;EAKzC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAU,QAAQ,IAAI,GAAG,EAAE,GAAG;GAChD,IAAM,IAAI,EAAU,IAAI,KAAM,IAAI,IAAI,IAAI,IAAI;GAC9C,CAAI,EAAU,OAAO,MAAM,EAAQ,OAAO,QAAI,EAAQ,KAAK;EAC7D;EACA,KAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,IAAI,GAAG,EAAE,GACxC,EAAU,EAAK,MAAM;EAIvB,AAAI,EAAK,UAAU,KAAK,EAAK,SAAS,MACpC,KAAK,YAAY,IAAI,WAAW,CAAC,EAAE,KAAK,EAAE,GAC1C,KAAK,YAAY,IAAI,WAAW,CAAC,EAAE,KAAK,EAAE,GAC1C,KAAK,UAAU,KAAK,EAAK,IACzB,EAAQ,EAAK,MAAM,GACf,EAAK,WAAW,MAClB,EAAQ,EAAK,MAAM,GACnB,KAAK,UAAU,KAAK,EAAK,IACzB,KAAK,UAAU,KAAK,EAAK;CAG/B;CACA,QAAQ,GAAQ;EACd,OAAO,IAAI,EAAQ,MAAM,CAAM;CACjC;CACA,CAAC,UAAU,GAAG;EACZ,IAAM,EAAC,YAAS,SAAM,eAAY,cAAW,cAAW,iBAAa;EAGrE,IAAI,GAAW;GACb,IAAM,IAAI,EAAU,QAAQ,CAAC;GAE7B,AADI,IAAI,MAAG,MAAM,EAAU,IAAI,KAC3B,IAAI,EAAU,SAAS,MAAG,MAAM,EAAU,IAAI;GAClD;EACF;EAEA,IAAM,IAAK,EAAQ;EACnB,IAAI,MAAO,IAAI;EACf,IAAI,IAAI,GAAI,IAAK;EACjB,GAAG;GAGD,IAFA,MAAM,IAAK,EAAU,IACrB,IAAI,IAAI,KAAM,IAAI,IAAI,IAAI,IAAI,GAC1B,EAAU,OAAO,GAAG;GAExB,IADA,IAAI,EAAU,IACV,MAAM,IAAI;IACZ,IAAM,IAAI,GAAM,EAAW,KAAK,KAAK,EAAK;IAC1C,AAAI,MAAM,MAAI,MAAM;IACpB;GACF;EACF,SAAS,MAAM;CACjB;CACA,KAAK,GAAG,GAAG,IAAI,GAAG;EAChB,KAAK,IAAI,CAAC,GAAG,MAAM,OAAO,IAAI,CAAC,GAAG,MAAM,IAAI,OAAO;EACnD,IAAM,IAAK,GACP;EACJ,QAAQ,IAAI,KAAK,MAAM,GAAG,GAAG,CAAC,MAAM,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI;EAClE,OAAO;CACT;CACA,MAAM,GAAG,GAAG,GAAG;EACb,IAAM,EAAC,YAAS,SAAM,eAAY,cAAW,cAAW,cAAU;EAClE,IAAI,EAAQ,OAAO,MAAM,CAAC,EAAO,QAAQ,QAAQ,IAAI,MAAM,EAAO,UAAU;EAC5E,IAAI,IAAI,GACJ,IAAK,EAAI,IAAI,EAAO,IAAI,IAAI,CAAC,IAAI,EAAI,IAAI,EAAO,IAAI,IAAI,IAAI,CAAC,GAC3D,IAAK,EAAQ,IACf,IAAI;EACR,GAAG;GACD,IAAI,IAAI,EAAU,IACZ,IAAK,EAAI,IAAI,EAAO,IAAI,IAAI,CAAC,IAAI,EAAI,IAAI,EAAO,IAAI,IAAI,IAAI,CAAC;GAGnE,IAFI,IAAK,MAAI,IAAK,GAAI,IAAI,IAC1B,IAAI,IAAI,KAAM,IAAI,IAAI,IAAI,IAAI,GAC1B,EAAU,OAAO,GAAG;GAExB,IADA,IAAI,EAAU,IACV,MAAM,IAAI;IAEZ,IADA,IAAI,GAAM,EAAW,KAAK,KAAK,EAAK,SAChC,MAAM,KACJ,EAAI,IAAI,EAAO,IAAI,IAAI,CAAC,IAAI,EAAI,IAAI,EAAO,IAAI,IAAI,IAAI,CAAC,IAAI,GAAI,OAAO;IAE7E;GACF;EACF,SAAS,MAAM;EACf,OAAO;CACT;CACA,OAAO,GAAS;EACd,IAAM,IAAS,KAAW,OAAO,IAAU,IAAI,EAAG,IAAI,KAAA,GAChD,EAAC,WAAQ,cAAW,iBAAa;EACvC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAU,QAAQ,IAAI,GAAG,EAAE,GAAG;GAChD,IAAM,IAAI,EAAU;GACpB,IAAI,IAAI,GAAG;GACX,IAAM,IAAK,EAAU,KAAK,GACpB,IAAK,EAAU,KAAK;GAE1B,AADA,EAAQ,OAAO,EAAO,IAAK,EAAO,IAAK,EAAE,GACzC,EAAQ,OAAO,EAAO,IAAK,EAAO,IAAK,EAAE;EAC3C;EAEA,OADA,KAAK,WAAW,CAAO,GAChB,KAAU,EAAO,MAAM;CAChC;CACA,aAAa,GAAS,GAAG;EAEvB,AADI,MAAM,KAAA,MAAc,CAAC,KAAW,OAAO,EAAQ,UAAW,gBAAa,IAAI,GAAS,IAAU,OAClG,IAAI,KAAK,OAAY,IAAI,CAAC;EAC1B,IAAM,IAAS,KAAW,OAAO,IAAU,IAAI,EAAG,IAAI,KAAA,GAChD,EAAC,cAAU;EACjB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,IAAI,GAAG,KAAK,GAAG;GAChD,IAAM,IAAI,EAAO,IAAI,IAAI,EAAO,IAAI;GAEpC,AADA,EAAQ,OAAO,IAAI,GAAG,CAAC,GACvB,EAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,CAAG;EAC7B;EACA,OAAO,KAAU,EAAO,MAAM;CAChC;CACA,WAAW,GAAS;EAClB,IAAM,IAAS,KAAW,OAAO,IAAU,IAAI,EAAG,IAAI,KAAA,GAChD,EAAC,SAAM,cAAU,MACjB,IAAI,EAAK,KAAK,GAAG,IAAI,EAAK;EAChC,EAAQ,OAAO,EAAO,IAAI,EAAO,IAAI,EAAE;EACvC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;GAC1B,IAAM,IAAI,IAAI,EAAK;GACnB,EAAQ,OAAO,EAAO,IAAI,EAAO,IAAI,EAAE;EACzC;EAEA,OADA,EAAQ,UAAU,GACX,KAAU,EAAO,MAAM;CAChC;CACA,cAAc;EACZ,IAAM,IAAU,IAAI,EAAM;EAE1B,OADA,KAAK,WAAW,CAAO,GAChB,EAAQ,MAAM;CACvB;CACA,eAAe,GAAG,GAAS;EACzB,IAAM,IAAS,KAAW,OAAO,IAAU,IAAI,EAAG,IAAI,KAAA,GAChD,EAAC,WAAQ,iBAAa,MACtB,IAAK,EAAU,KAAK,KAAK,GACzB,IAAK,EAAU,IAAI,KAAK,GACxB,IAAK,EAAU,IAAI,KAAK;EAK9B,OAJA,EAAQ,OAAO,EAAO,IAAK,EAAO,IAAK,EAAE,GACzC,EAAQ,OAAO,EAAO,IAAK,EAAO,IAAK,EAAE,GACzC,EAAQ,OAAO,EAAO,IAAK,EAAO,IAAK,EAAE,GACzC,EAAQ,UAAU,GACX,KAAU,EAAO,MAAM;CAChC;CACA,CAAC,mBAAmB;EAClB,IAAM,EAAC,iBAAa;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAU,SAAS,GAAG,IAAI,GAAG,EAAE,GACjD,MAAM,KAAK,gBAAgB,CAAC;CAEhC;CACA,gBAAgB,GAAG;EACjB,IAAM,IAAU,IAAI,EAAM;EAE1B,OADA,KAAK,eAAe,GAAG,CAAO,GACvB,EAAQ,MAAM;CACvB;AACF;AAEA,SAAS,EAAU,GAAQ,GAAI,GAAI,GAAM;CACvC,IAAM,IAAI,EAAO,QACX,IAAQ,IAAI,aAAa,IAAI,CAAC;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;EAC1B,IAAM,IAAI,EAAO;EAEjB,AADA,EAAM,IAAI,KAAK,EAAG,KAAK,GAAM,GAAG,GAAG,CAAM,GACzC,EAAM,IAAI,IAAI,KAAK,EAAG,KAAK,GAAM,GAAG,GAAG,CAAM;CAC/C;CACA,OAAO;AACT;AAEA,UAAU,EAAa,GAAQ,GAAI,GAAI,GAAM;CAC3C,IAAI,IAAI;CACR,KAAK,IAAM,KAAK,GAGd,AAFA,MAAM,EAAG,KAAK,GAAM,GAAG,GAAG,CAAM,GAChC,MAAM,EAAG,KAAK,GAAM,GAAG,GAAG,CAAM,GAChC,EAAE;AAEN"}

package/dist/ensureCompleteData-CqLz7Btq.cjs

@@ -0,0 +1,2 @@
+const e=require(`./chunk-gGpyby2o.cjs`),t=require(`./parse-C718o4YM.cjs`),n=require(`./lodash.orderby-Us2PHq2D.cjs`);var r=e.a(n.t(),1);function i(e,n){let i=Array.from(new Set(e.map(e=>e.label))),a=Array.from(new Set(e.map(e=>e.date))).filter(e=>e!==void 0);if(a.length===0)return e;let o=new Set(e.map(e=>`${e.label}-${e.date}`)),s=e.reduce((e,t)=>(e[t.label]||(e[t.label]=t.color),e),{}),c=[...e];return i.forEach(e=>{a.forEach(t=>{o.has(`${e}-${t}`)||c.push({label:e,color:s[e],size:void 0,date:t})})}),(0,r.default)(c,[e=>t.t(`${e.date}`,n||`yyyy`,new Date)],[`asc`])}function a(e,n){let i=Array.from(new Set(e.map(e=>e.label))),a=Array.from(new Set(e.map(e=>e.date))).filter(e=>e!==void 0);if(a.length===0)return e;let o=new Set(e.map(e=>`${e.label}-${e.date}`)),s=[...e];return i.forEach(t=>{a.forEach(n=>{o.has(`${t}-${n}`)||s.push({label:t,size:e[0].size.map(e=>null),date:n})})}),(0,r.default)(s,[e=>t.t(`${e.date}`,n||`yyyy`,new Date)],[`asc`])}function o(e,n){let i=Array.from(new Set(e.map(e=>e.label))),a=Array.from(new Set(e.map(e=>e.date))).filter(e=>e!==void 0);if(a.length===0)return e;let o=new Set(e.map(e=>`${e.label}-${e.date}`)),s=[...e];return i.forEach(e=>{a.forEach(t=>{o.has(`${e}-${t}`)||s.push({label:e,leftBar:void 0,rightBar:void 0,date:t})})}),(0,r.default)(s,[e=>t.t(`${e.date}`,n||`yyyy`,new Date)],[`asc`])}function s(e,n){let i=Array.from(new Set(e.map(e=>e.label))),a=Array.from(new Set(e.map(e=>e.date))).filter(e=>e!==void 0);if(a.length===0)return e;let o=new Set(e.map(e=>`${e.label}-${e.date}`)),s=e.reduce((e,t)=>(e[t.label]||(e[t.label]=t.color),e),{}),c=[...e];return i.forEach(e=>{a.forEach(t=>{o.has(`${e}-${t}`)||c.push({label:e,color:s[e],x:void 0,y:void 0,radius:void 0,date:t})})}),(0,r.default)(c,[e=>t.t(`${e.date}`,n||`yyyy`,new Date)],[`asc`])}function c(e,n){let i=Array.from(new Set(e.map(e=>e.label))),a=Array.from(new Set(e.map(e=>e.date))).filter(e=>e!==void 0);if(a.length===0)return e;let o=new Set(e.map(e=>`${e.label}-${e.date}`)),s=[...e];return i.forEach(t=>{a.forEach(n=>{o.has(`${t}-${n}`)||s.push({label:t,x:e[0].x.map(e=>null),date:n})})}),(0,r.default)(s,[e=>t.t(`${e.date}`,n||`yyyy`,new Date)],[`asc`])}function l(e,n){let i=Array.from(new Set(e.map(e=>e.label))),a=Array.from(new Set(e.map(e=>e.date))).filter(e=>e!==void 0);if(a.length===0)return e;let o=new Set(e.map(e=>`${e.label}-${e.date}`)),s=[...e];return i.forEach(e=>{a.forEach(t=>{o.has(`${e}-${t}`)||s.push({label:e,size:null,target:null,qualitativeRange:null,date:t})})}),(0,r.default)(s,[e=>t.t(`${e.date}`,n||`yyyy`,new Date)],[`asc`])}Object.defineProperty(exports,`a`,{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,`i`,{enumerable:!0,get:function(){return c}}),Object.defineProperty(exports,`n`,{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,`o`,{enumerable:!0,get:function(){return a}}),Object.defineProperty(exports,`r`,{enumerable:!0,get:function(){return o}}),Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return i}});
+//# sourceMappingURL=ensureCompleteData-CqLz7Btq.cjs.map

package/dist/ensureCompleteData-CqLz7Btq.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ensureCompleteData-CqLz7Btq.cjs","names":[],"sources":["../src/Utils/ensureCompleteData.ts"],"sourcesContent":["import { parse } from 'date-fns/parse';\nimport orderBy from 'lodash.orderby';\n\nimport type {\n  BarGraphDataType,\n  BulletChartDataType,\n  ButterflyChartDataType,\n  DumbbellChartDataType,\n  GroupedBarGraphDataType,\n  ScatterPlotDataType,\n} from '@/Types';\n\nexport function ensureCompleteDataForBarChart(data: BarGraphDataType[], dateFormat: string) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n  const colors = data.reduce((acc: any, curr: any) => {\n    if (!acc[curr.label]) {\n      acc[curr.label] = curr.color;\n    }\n    return acc;\n  }, {});\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          color: colors[label], // Keep the same color for the label\n          size: undefined,\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForStackedBarChart(\n  data: GroupedBarGraphDataType[],\n  dateFormat: string,\n) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          size: data[0].size.map((_d) => null),\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForButterFlyChart(\n  data: ButterflyChartDataType[],\n  dateFormat: string,\n) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          leftBar: undefined,\n          rightBar: undefined,\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForScatterPlot(data: ScatterPlotDataType[], dateFormat: string) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n  const colors = data.reduce((acc: any, curr: any) => {\n    if (!acc[curr.label]) {\n      acc[curr.label] = curr.color;\n    }\n    return acc;\n  }, {});\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          color: colors[label], // Keep the same color for the label\n          x: undefined,\n          y: undefined,\n          radius: undefined,\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForDumbbellChart(\n  data: DumbbellChartDataType[],\n  dateFormat: string,\n) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          x: data[0].x.map((_d) => null),\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForBulletChart(data: BulletChartDataType[], dateFormat: string) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          size: null,\n          target: null,\n          qualitativeRange: null,\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n"],"mappings":"wIAYA,SAAgB,EAA8B,EAA0B,EAAoB,CAE1F,IAAM,EAAS,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,KAAK,CAAC,CAAC,EACrD,EAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,IAAI,CAAC,CAAC,EAAE,OAAQ,GAAM,IAAM,IAAA,EAAS,EACxF,GAAI,EAAM,SAAW,EAAG,OAAO,EAG/B,IAAM,EAAuB,IAAI,IAE/B,EAAK,IAAK,GAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,EAGM,EAAS,EAAK,QAAQ,EAAU,KAC/B,EAAI,EAAK,SACZ,EAAI,EAAK,OAAS,EAAK,OAElB,GACN,CAAC,CAAC,EAGC,EAAe,CAAC,GAAG,CAAI,EAe7B,OAbA,EAAO,QAAS,GAAU,CACxB,EAAM,QAAS,GAAS,CACjB,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,GAC9C,EAAa,KAAK,CAChB,QACA,MAAO,EAAO,GACd,KAAM,IAAA,GACN,MACF,CAAC,CAEL,CAAC,CACH,CAAC,GAED,EAAA,EAAA,SACE,EACA,CAAE,GAAM,EAAA,EAAM,GAAG,EAAE,OAAQ,GAAc,OAAQ,IAAI,IAAM,CAAC,EAC5D,CAAC,KAAK,CACR,CACF,CAEA,SAAgB,EACd,EACA,EACA,CAEA,IAAM,EAAS,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,KAAK,CAAC,CAAC,EACrD,EAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,IAAI,CAAC,CAAC,EAAE,OAAQ,GAAM,IAAM,IAAA,EAAS,EACxF,GAAI,EAAM,SAAW,EAAG,OAAO,EAE/B,IAAM,EAAuB,IAAI,IAE/B,EAAK,IAAK,GAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,EAGM,EAAe,CAAC,GAAG,CAAI,EAc7B,OAZA,EAAO,QAAS,GAAU,CACxB,EAAM,QAAS,GAAS,CACjB,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,GAC9C,EAAa,KAAK,CAChB,QACA,KAAM,EAAK,GAAG,KAAK,IAAK,GAAO,IAAI,EACnC,MACF,CAAC,CAEL,CAAC,CACH,CAAC,GAED,EAAA,EAAA,SACE,EACA,CAAE,GAAM,EAAA,EAAM,GAAG,EAAE,OAAQ,GAAc,OAAQ,IAAI,IAAM,CAAC,EAC5D,CAAC,KAAK,CACR,CACF,CAEA,SAAgB,EACd,EACA,EACA,CAEA,IAAM,EAAS,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,KAAK,CAAC,CAAC,EACrD,EAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,IAAI,CAAC,CAAC,EAAE,OAAQ,GAAM,IAAM,IAAA,EAAS,EACxF,GAAI,EAAM,SAAW,EAAG,OAAO,EAG/B,IAAM,EAAuB,IAAI,IAE/B,EAAK,IAAK,GAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,EAGM,EAAe,CAAC,GAAG,CAAI,EAe7B,OAbA,EAAO,QAAS,GAAU,CACxB,EAAM,QAAS,GAAS,CACjB,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,GAC9C,EAAa,KAAK,CAChB,QACA,QAAS,IAAA,GACT,SAAU,IAAA,GACV,MACF,CAAC,CAEL,CAAC,CACH,CAAC,GAED,EAAA,EAAA,SACE,EACA,CAAE,GAAM,EAAA,EAAM,GAAG,EAAE,OAAQ,GAAc,OAAQ,IAAI,IAAM,CAAC,EAC5D,CAAC,KAAK,CACR,CACF,CAEA,SAAgB,EAAiC,EAA6B,EAAoB,CAEhG,IAAM,EAAS,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,KAAK,CAAC,CAAC,EACrD,EAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,IAAI,CAAC,CAAC,EAAE,OAAQ,GAAM,IAAM,IAAA,EAAS,EACxF,GAAI,EAAM,SAAW,EAAG,OAAO,EAG/B,IAAM,EAAuB,IAAI,IAE/B,EAAK,IAAK,GAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,EAGM,EAAS,EAAK,QAAQ,EAAU,KAC/B,EAAI,EAAK,SACZ,EAAI,EAAK,OAAS,EAAK,OAElB,GACN,CAAC,CAAC,EAGC,EAAe,CAAC,GAAG,CAAI,EAiB7B,OAfA,EAAO,QAAS,GAAU,CACxB,EAAM,QAAS,GAAS,CACjB,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,GAC9C,EAAa,KAAK,CAChB,QACA,MAAO,EAAO,GACd,EAAG,IAAA,GACH,EAAG,IAAA,GACH,OAAQ,IAAA,GACR,MACF,CAAC,CAEL,CAAC,CACH,CAAC,GAED,EAAA,EAAA,SACE,EACA,CAAE,GAAM,EAAA,EAAM,GAAG,EAAE,OAAQ,GAAc,OAAQ,IAAI,IAAM,CAAC,EAC5D,CAAC,KAAK,CACR,CACF,CAEA,SAAgB,EACd,EACA,EACA,CAEA,IAAM,EAAS,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,KAAK,CAAC,CAAC,EACrD,EAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,IAAI,CAAC,CAAC,EAAE,OAAQ,GAAM,IAAM,IAAA,EAAS,EACxF,GAAI,EAAM,SAAW,EAAG,OAAO,EAG/B,IAAM,EAAuB,IAAI,IAE/B,EAAK,IAAK,GAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,EAGM,EAAe,CAAC,GAAG,CAAI,EAc7B,OAZA,EAAO,QAAS,GAAU,CACxB,EAAM,QAAS,GAAS,CACjB,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,GAC9C,EAAa,KAAK,CAChB,QACA,EAAG,EAAK,GAAG,EAAE,IAAK,GAAO,IAAI,EAC7B,MACF,CAAC,CAEL,CAAC,CACH,CAAC,GAED,EAAA,EAAA,SACE,EACA,CAAE,GAAM,EAAA,EAAM,GAAG,EAAE,OAAQ,GAAc,OAAQ,IAAI,IAAM,CAAC,EAC5D,CAAC,KAAK,CACR,CACF,CAEA,SAAgB,EAAiC,EAA6B,EAAoB,CAEhG,IAAM,EAAS,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,KAAK,CAAC,CAAC,EACrD,EAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,IAAK,GAAM,EAAE,IAAI,CAAC,CAAC,EAAE,OAAQ,GAAM,IAAM,IAAA,EAAS,EACxF,GAAI,EAAM,SAAW,EAAG,OAAO,EAG/B,IAAM,EAAuB,IAAI,IAE/B,EAAK,IAAK,GAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,EAGM,EAAe,CAAC,GAAG,CAAI,EAgB7B,OAdA,EAAO,QAAS,GAAU,CACxB,EAAM,QAAS,GAAS,CACjB,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,GAC9C,EAAa,KAAK,CAChB,QACA,KAAM,KACN,OAAQ,KACR,iBAAkB,KAClB,MACF,CAAC,CAEL,CAAC,CACH,CAAC,GAED,EAAA,EAAA,SACE,EACA,CAAE,GAAM,EAAA,EAAM,GAAG,EAAE,OAAQ,GAAc,OAAQ,IAAI,IAAM,CAAC,EAC5D,CAAC,KAAK,CACR,CACF"}

package/dist/ensureCompleteData-VxAHq-s7.js

@@ -0,0 +1,100 @@
+import { o as e } from "./chunk-foFoljWS.js";
+import { t } from "./parse-5MWhaq6h.js";
+import { t as n } from "./lodash.orderby-Dn2sr3tw.js";
+//#region src/Utils/ensureCompleteData.ts
+var r = /* @__PURE__ */ e(n(), 1);
+function i(e, n) {
+	let i = Array.from(new Set(e.map((e) => e.label))), a = Array.from(new Set(e.map((e) => e.date))).filter((e) => e !== void 0);
+	if (a.length === 0) return e;
+	let o = new Set(e.map((e) => `${e.label}-${e.date}`)), s = e.reduce((e, t) => (e[t.label] || (e[t.label] = t.color), e), {}), c = [...e];
+	return i.forEach((e) => {
+		a.forEach((t) => {
+			o.has(`${e}-${t}`) || c.push({
+				label: e,
+				color: s[e],
+				size: void 0,
+				date: t
+			});
+		});
+	}), (0, r.default)(c, [(e) => t(`${e.date}`, n || "yyyy", /* @__PURE__ */ new Date())], ["asc"]);
+}
+function a(e, n) {
+	let i = Array.from(new Set(e.map((e) => e.label))), a = Array.from(new Set(e.map((e) => e.date))).filter((e) => e !== void 0);
+	if (a.length === 0) return e;
+	let o = new Set(e.map((e) => `${e.label}-${e.date}`)), s = [...e];
+	return i.forEach((t) => {
+		a.forEach((n) => {
+			o.has(`${t}-${n}`) || s.push({
+				label: t,
+				size: e[0].size.map((e) => null),
+				date: n
+			});
+		});
+	}), (0, r.default)(s, [(e) => t(`${e.date}`, n || "yyyy", /* @__PURE__ */ new Date())], ["asc"]);
+}
+function o(e, n) {
+	let i = Array.from(new Set(e.map((e) => e.label))), a = Array.from(new Set(e.map((e) => e.date))).filter((e) => e !== void 0);
+	if (a.length === 0) return e;
+	let o = new Set(e.map((e) => `${e.label}-${e.date}`)), s = [...e];
+	return i.forEach((e) => {
+		a.forEach((t) => {
+			o.has(`${e}-${t}`) || s.push({
+				label: e,
+				leftBar: void 0,
+				rightBar: void 0,
+				date: t
+			});
+		});
+	}), (0, r.default)(s, [(e) => t(`${e.date}`, n || "yyyy", /* @__PURE__ */ new Date())], ["asc"]);
+}
+function s(e, n) {
+	let i = Array.from(new Set(e.map((e) => e.label))), a = Array.from(new Set(e.map((e) => e.date))).filter((e) => e !== void 0);
+	if (a.length === 0) return e;
+	let o = new Set(e.map((e) => `${e.label}-${e.date}`)), s = e.reduce((e, t) => (e[t.label] || (e[t.label] = t.color), e), {}), c = [...e];
+	return i.forEach((e) => {
+		a.forEach((t) => {
+			o.has(`${e}-${t}`) || c.push({
+				label: e,
+				color: s[e],
+				x: void 0,
+				y: void 0,
+				radius: void 0,
+				date: t
+			});
+		});
+	}), (0, r.default)(c, [(e) => t(`${e.date}`, n || "yyyy", /* @__PURE__ */ new Date())], ["asc"]);
+}
+function c(e, n) {
+	let i = Array.from(new Set(e.map((e) => e.label))), a = Array.from(new Set(e.map((e) => e.date))).filter((e) => e !== void 0);
+	if (a.length === 0) return e;
+	let o = new Set(e.map((e) => `${e.label}-${e.date}`)), s = [...e];
+	return i.forEach((t) => {
+		a.forEach((n) => {
+			o.has(`${t}-${n}`) || s.push({
+				label: t,
+				x: e[0].x.map((e) => null),
+				date: n
+			});
+		});
+	}), (0, r.default)(s, [(e) => t(`${e.date}`, n || "yyyy", /* @__PURE__ */ new Date())], ["asc"]);
+}
+function l(e, n) {
+	let i = Array.from(new Set(e.map((e) => e.label))), a = Array.from(new Set(e.map((e) => e.date))).filter((e) => e !== void 0);
+	if (a.length === 0) return e;
+	let o = new Set(e.map((e) => `${e.label}-${e.date}`)), s = [...e];
+	return i.forEach((e) => {
+		a.forEach((t) => {
+			o.has(`${e}-${t}`) || s.push({
+				label: e,
+				size: null,
+				target: null,
+				qualitativeRange: null,
+				date: t
+			});
+		});
+	}), (0, r.default)(s, [(e) => t(`${e.date}`, n || "yyyy", /* @__PURE__ */ new Date())], ["asc"]);
+}
+//#endregion
+export { s as a, c as i, l as n, a as o, o as r, i as t };
+
+//# sourceMappingURL=ensureCompleteData-VxAHq-s7.js.map

package/dist/ensureCompleteData-VxAHq-s7.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ensureCompleteData-VxAHq-s7.js","names":[],"sources":["../src/Utils/ensureCompleteData.ts"],"sourcesContent":["import { parse } from 'date-fns/parse';\nimport orderBy from 'lodash.orderby';\n\nimport type {\n  BarGraphDataType,\n  BulletChartDataType,\n  ButterflyChartDataType,\n  DumbbellChartDataType,\n  GroupedBarGraphDataType,\n  ScatterPlotDataType,\n} from '@/Types';\n\nexport function ensureCompleteDataForBarChart(data: BarGraphDataType[], dateFormat: string) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n  const colors = data.reduce((acc: any, curr: any) => {\n    if (!acc[curr.label]) {\n      acc[curr.label] = curr.color;\n    }\n    return acc;\n  }, {});\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          color: colors[label], // Keep the same color for the label\n          size: undefined,\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForStackedBarChart(\n  data: GroupedBarGraphDataType[],\n  dateFormat: string,\n) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          size: data[0].size.map((_d) => null),\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForButterFlyChart(\n  data: ButterflyChartDataType[],\n  dateFormat: string,\n) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          leftBar: undefined,\n          rightBar: undefined,\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForScatterPlot(data: ScatterPlotDataType[], dateFormat: string) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n  const colors = data.reduce((acc: any, curr: any) => {\n    if (!acc[curr.label]) {\n      acc[curr.label] = curr.color;\n    }\n    return acc;\n  }, {});\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          color: colors[label], // Keep the same color for the label\n          x: undefined,\n          y: undefined,\n          radius: undefined,\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForDumbbellChart(\n  data: DumbbellChartDataType[],\n  dateFormat: string,\n) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          x: data[0].x.map((_d) => null),\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n\nexport function ensureCompleteDataForBulletChart(data: BulletChartDataType[], dateFormat: string) {\n  // Extract unique labels and dates\n  const labels = Array.from(new Set(data.map((d) => d.label)));\n  const dates = Array.from(new Set(data.map((d) => d.date))).filter((d) => d !== undefined);\n  if (dates.length === 0) return data;\n\n  // Create a set of existing label-date combinations\n  const existingCombinations = new Set(\n    // biome-ignore lint/suspicious/noExplicitAny: undefined data type\n    data.map((d: any) => `${d.label}-${d.date}`),\n  );\n\n  // Add missing label-date combinations with size as undefined\n  const completeData = [...data];\n\n  labels.forEach((label) => {\n    dates.forEach((date) => {\n      if (!existingCombinations.has(`${label}-${date}`)) {\n        completeData.push({\n          label,\n          size: null,\n          target: null,\n          qualitativeRange: null,\n          date,\n        });\n      }\n    });\n  });\n\n  return orderBy(\n    completeData,\n    [(d) => parse(`${d.date}`, dateFormat || 'yyyy', new Date())],\n    ['asc'],\n  );\n}\n"],"mappings":";;;;;AAYA,SAAgB,EAA8B,GAA0B,GAAoB;CAE1F,IAAM,IAAS,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,GACrD,IAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,QAAQ,MAAM,MAAM,KAAA,CAAS;CACxF,IAAI,EAAM,WAAW,GAAG,OAAO;CAG/B,IAAM,IAAuB,IAAI,IAE/B,EAAK,KAAK,MAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,GAGM,IAAS,EAAK,QAAQ,GAAU,OAC/B,EAAI,EAAK,WACZ,EAAI,EAAK,SAAS,EAAK,QAElB,IACN,CAAC,CAAC,GAGC,IAAe,CAAC,GAAG,CAAI;CAe7B,OAbA,EAAO,SAAS,MAAU;EACxB,EAAM,SAAS,MAAS;GACtB,AAAK,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,KAC9C,EAAa,KAAK;IAChB;IACA,OAAO,EAAO;IACd,MAAM,KAAA;IACN;GACF,CAAC;EAEL,CAAC;CACH,CAAC,IAED,GAAA,EAAA,SACE,GACA,EAAE,MAAM,EAAM,GAAG,EAAE,QAAQ,KAAc,wBAAQ,IAAI,KAAK,CAAC,CAAC,GAC5D,CAAC,KAAK,CACR;AACF;AAEA,SAAgB,EACd,GACA,GACA;CAEA,IAAM,IAAS,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,GACrD,IAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,QAAQ,MAAM,MAAM,KAAA,CAAS;CACxF,IAAI,EAAM,WAAW,GAAG,OAAO;CAE/B,IAAM,IAAuB,IAAI,IAE/B,EAAK,KAAK,MAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,GAGM,IAAe,CAAC,GAAG,CAAI;CAc7B,OAZA,EAAO,SAAS,MAAU;EACxB,EAAM,SAAS,MAAS;GACtB,AAAK,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,KAC9C,EAAa,KAAK;IAChB;IACA,MAAM,EAAK,GAAG,KAAK,KAAK,MAAO,IAAI;IACnC;GACF,CAAC;EAEL,CAAC;CACH,CAAC,IAED,GAAA,EAAA,SACE,GACA,EAAE,MAAM,EAAM,GAAG,EAAE,QAAQ,KAAc,wBAAQ,IAAI,KAAK,CAAC,CAAC,GAC5D,CAAC,KAAK,CACR;AACF;AAEA,SAAgB,EACd,GACA,GACA;CAEA,IAAM,IAAS,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,GACrD,IAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,QAAQ,MAAM,MAAM,KAAA,CAAS;CACxF,IAAI,EAAM,WAAW,GAAG,OAAO;CAG/B,IAAM,IAAuB,IAAI,IAE/B,EAAK,KAAK,MAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,GAGM,IAAe,CAAC,GAAG,CAAI;CAe7B,OAbA,EAAO,SAAS,MAAU;EACxB,EAAM,SAAS,MAAS;GACtB,AAAK,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,KAC9C,EAAa,KAAK;IAChB;IACA,SAAS,KAAA;IACT,UAAU,KAAA;IACV;GACF,CAAC;EAEL,CAAC;CACH,CAAC,IAED,GAAA,EAAA,SACE,GACA,EAAE,MAAM,EAAM,GAAG,EAAE,QAAQ,KAAc,wBAAQ,IAAI,KAAK,CAAC,CAAC,GAC5D,CAAC,KAAK,CACR;AACF;AAEA,SAAgB,EAAiC,GAA6B,GAAoB;CAEhG,IAAM,IAAS,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,GACrD,IAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,QAAQ,MAAM,MAAM,KAAA,CAAS;CACxF,IAAI,EAAM,WAAW,GAAG,OAAO;CAG/B,IAAM,IAAuB,IAAI,IAE/B,EAAK,KAAK,MAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,GAGM,IAAS,EAAK,QAAQ,GAAU,OAC/B,EAAI,EAAK,WACZ,EAAI,EAAK,SAAS,EAAK,QAElB,IACN,CAAC,CAAC,GAGC,IAAe,CAAC,GAAG,CAAI;CAiB7B,OAfA,EAAO,SAAS,MAAU;EACxB,EAAM,SAAS,MAAS;GACtB,AAAK,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,KAC9C,EAAa,KAAK;IAChB;IACA,OAAO,EAAO;IACd,GAAG,KAAA;IACH,GAAG,KAAA;IACH,QAAQ,KAAA;IACR;GACF,CAAC;EAEL,CAAC;CACH,CAAC,IAED,GAAA,EAAA,SACE,GACA,EAAE,MAAM,EAAM,GAAG,EAAE,QAAQ,KAAc,wBAAQ,IAAI,KAAK,CAAC,CAAC,GAC5D,CAAC,KAAK,CACR;AACF;AAEA,SAAgB,EACd,GACA,GACA;CAEA,IAAM,IAAS,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,GACrD,IAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,QAAQ,MAAM,MAAM,KAAA,CAAS;CACxF,IAAI,EAAM,WAAW,GAAG,OAAO;CAG/B,IAAM,IAAuB,IAAI,IAE/B,EAAK,KAAK,MAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,GAGM,IAAe,CAAC,GAAG,CAAI;CAc7B,OAZA,EAAO,SAAS,MAAU;EACxB,EAAM,SAAS,MAAS;GACtB,AAAK,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,KAC9C,EAAa,KAAK;IAChB;IACA,GAAG,EAAK,GAAG,EAAE,KAAK,MAAO,IAAI;IAC7B;GACF,CAAC;EAEL,CAAC;CACH,CAAC,IAED,GAAA,EAAA,SACE,GACA,EAAE,MAAM,EAAM,GAAG,EAAE,QAAQ,KAAc,wBAAQ,IAAI,KAAK,CAAC,CAAC,GAC5D,CAAC,KAAK,CACR;AACF;AAEA,SAAgB,EAAiC,GAA6B,GAAoB;CAEhG,IAAM,IAAS,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,GACrD,IAAQ,MAAM,KAAK,IAAI,IAAI,EAAK,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,QAAQ,MAAM,MAAM,KAAA,CAAS;CACxF,IAAI,EAAM,WAAW,GAAG,OAAO;CAG/B,IAAM,IAAuB,IAAI,IAE/B,EAAK,KAAK,MAAW,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,CAC7C,GAGM,IAAe,CAAC,GAAG,CAAI;CAgB7B,OAdA,EAAO,SAAS,MAAU;EACxB,EAAM,SAAS,MAAS;GACtB,AAAK,EAAqB,IAAI,GAAG,EAAM,GAAG,GAAM,KAC9C,EAAa,KAAK;IAChB;IACA,MAAM;IACN,QAAQ;IACR,kBAAkB;IAClB;GACF,CAAC;EAEL,CAAC;CACH,CAAC,IAED,GAAA,EAAA,SACE,GACA,EAAE,MAAM,EAAM,GAAG,EAAE,QAAQ,KAAc,wBAAQ,IAAI,KAAK,CAAC,CAAC,GAC5D,CAAC,KAAK,CACR;AACF"}

package/dist/esm-BwfGJUcL.cjs

@@ -0,0 +1,2 @@
+const e=require(`./chunk-gGpyby2o.cjs`);var t=6371008.8;t*100,t*100,360/(2*Math.PI),t*3.28084,t*39.37,t/1e3,t/1e3,t/1609.344,t*1e3,t*1e3,t/1852,t*1.0936;function n(e,t,n={}){let r={type:`Feature`};return(n.id===0||n.id)&&(r.id=n.id),n.bbox&&(r.bbox=n.bbox),r.properties=t||{},r.geometry=e,r}function r(e,t,r={}){if(!e)throw Error(`coordinates is required`);if(!Array.isArray(e))throw Error(`coordinates must be an Array`);if(e.length<2)throw Error(`coordinates must be at least 2 numbers long`);if(!a(e[0])||!a(e[1]))throw Error(`coordinates must contain numbers`);return n({type:`Point`,coordinates:e},t,r)}function i(e,t,r={}){for(let t of e){if(t.length<4)throw Error(`Each LinearRing of a Polygon must have 4 or more Positions.`);if(t[t.length-1].length!==t[0].length)throw Error(`First and last Position are not equivalent.`);for(let e=0;e<t[t.length-1].length;e++)if(t[t.length-1][e]!==t[0][e])throw Error(`First and last Position are not equivalent.`)}return n({type:`Polygon`,coordinates:e},t,r)}function a(e){return!isNaN(e)&&e!==null&&!Array.isArray(e)}function o(e,t,n){if(e!==null)for(var r,i,a,s,c,l,u,d=0,f=0,p,m=e.type,h=m===`FeatureCollection`,g=m===`Feature`,_=h?e.features.length:1,v=0;v<_;v++){u=h?e.features[v].geometry:g?e.geometry:e,p=u?u.type===`GeometryCollection`:!1,c=p?u.geometries.length:1;for(var y=0;y<c;y++){var b=0,x=0;if(s=p?u.geometries[y]:u,s!==null){l=s.coordinates;var S=s.type;switch(d=n&&(S===`Polygon`||S===`MultiPolygon`)?1:0,S){case null:break;case`Point`:if(t(l,f,v,b,x)===!1)return!1;f++,b++;break;case`LineString`:case`MultiPoint`:for(r=0;r<l.length;r++){if(t(l[r],f,v,b,x)===!1)return!1;f++,S===`MultiPoint`&&b++}S===`LineString`&&b++;break;case`Polygon`:case`MultiLineString`:for(r=0;r<l.length;r++){for(i=0;i<l[r].length-d;i++){if(t(l[r][i],f,v,b,x)===!1)return!1;f++}S===`MultiLineString`&&b++,S===`Polygon`&&x++}S===`Polygon`&&b++;break;case`MultiPolygon`:for(r=0;r<l.length;r++){for(x=0,i=0;i<l[r].length;i++){for(a=0;a<l[r][i].length-d;a++){if(t(l[r][i][a],f,v,b,x)===!1)return!1;f++}x++}b++}break;case`GeometryCollection`:for(r=0;r<s.geometries.length;r++)if(o(s.geometries[r],t,n)===!1)return!1;break;default:throw Error(`Unknown Geometry Type`)}}}}}function s(e,t){var n,r,i,a,o,s,c,l,u,d,f=0,p=e.type===`FeatureCollection`,m=e.type===`Feature`,h=p?e.features.length:1;for(n=0;n<h;n++){for(s=p?e.features[n].geometry:m?e.geometry:e,l=p?e.features[n].properties:m?e.properties:{},u=p?e.features[n].bbox:m?e.bbox:void 0,d=p?e.features[n].id:m?e.id:void 0,c=s?s.type===`GeometryCollection`:!1,o=c?s.geometries.length:1,i=0;i<o;i++){if(a=c?s.geometries[i]:s,a===null){if(t(null,f,l,u,d)===!1)return!1;continue}switch(a.type){case`Point`:case`LineString`:case`MultiPoint`:case`Polygon`:case`MultiLineString`:case`MultiPolygon`:if(t(a,f,l,u,d)===!1)return!1;break;case`GeometryCollection`:for(r=0;r<a.geometries.length;r++)if(t(a.geometries[r],f,l,u,d)===!1)return!1;break;default:throw Error(`Unknown Geometry Type`)}}f++}}function c(e,t,n){var r=n;return s(e,function(e,i,a,o,s){r=i===0&&n===void 0?e:t(r,e,i,a,o,s)}),r}var l=e.t(((e,t)=>{(function(n,r){typeof e==`object`&&t!==void 0?t.exports=r():typeof define==`function`&&define.amd?define(r):(n||=self).RBush=r()})(e,function(){"use strict";function e(e,r,i,a,o){(function e(n,r,i,a,o){for(;a>i;){if(a-i>600){var s=a-i+1,c=r-i+1,l=Math.log(s),u=.5*Math.exp(2*l/3),d=.5*Math.sqrt(l*u*(s-u)/s)*(c-s/2<0?-1:1);e(n,r,Math.max(i,Math.floor(r-c*u/s+d)),Math.min(a,Math.floor(r+(s-c)*u/s+d)),o)}var f=n[r],p=i,m=a;for(t(n,i,r),o(n[a],f)>0&&t(n,i,a);p<m;){for(t(n,p,m),p++,m--;o(n[p],f)<0;)p++;for(;o(n[m],f)>0;)m--}o(n[i],f)===0?t(n,i,m):t(n,++m,a),m<=r&&(i=m+1),r<=m&&(a=m-1)}})(e,r,i||0,a||e.length-1,o||n)}function t(e,t,n){var r=e[t];e[t]=e[n],e[n]=r}function n(e,t){return e<t?-1:+(e>t)}var r=function(e){e===void 0&&(e=9),this._maxEntries=Math.max(4,e),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()};function i(e,t,n){if(!n)return t.indexOf(e);for(var r=0;r<t.length;r++)if(n(e,t[r]))return r;return-1}function a(e,t){o(e,0,e.children.length,t,e)}function o(e,t,n,r,i){i||=m(null),i.minX=1/0,i.minY=1/0,i.maxX=-1/0,i.maxY=-1/0;for(var a=t;a<n;a++){var o=e.children[a];s(i,e.leaf?r(o):o)}return i}function s(e,t){return e.minX=Math.min(e.minX,t.minX),e.minY=Math.min(e.minY,t.minY),e.maxX=Math.max(e.maxX,t.maxX),e.maxY=Math.max(e.maxY,t.maxY),e}function c(e,t){return e.minX-t.minX}function l(e,t){return e.minY-t.minY}function u(e){return(e.maxX-e.minX)*(e.maxY-e.minY)}function d(e){return e.maxX-e.minX+(e.maxY-e.minY)}function f(e,t){return e.minX<=t.minX&&e.minY<=t.minY&&t.maxX<=e.maxX&&t.maxY<=e.maxY}function p(e,t){return t.minX<=e.maxX&&t.minY<=e.maxY&&t.maxX>=e.minX&&t.maxY>=e.minY}function m(e){return{children:e,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function h(t,n,r,i,a){for(var o=[n,r];o.length;)if(!((r=o.pop())-(n=o.pop())<=i)){var s=n+Math.ceil((r-n)/i/2)*i;e(t,s,n,r,a),o.push(n,s,s,r)}}return r.prototype.all=function(){return this._all(this.data,[])},r.prototype.search=function(e){var t=this.data,n=[];if(!p(e,t))return n;for(var r=this.toBBox,i=[];t;){for(var a=0;a<t.children.length;a++){var o=t.children[a],s=t.leaf?r(o):o;p(e,s)&&(t.leaf?n.push(o):f(e,s)?this._all(o,n):i.push(o))}t=i.pop()}return n},r.prototype.collides=function(e){var t=this.data;if(!p(e,t))return!1;for(var n=[];t;){for(var r=0;r<t.children.length;r++){var i=t.children[r],a=t.leaf?this.toBBox(i):i;if(p(e,a)){if(t.leaf||f(e,a))return!0;n.push(i)}}t=n.pop()}return!1},r.prototype.load=function(e){if(!e||!e.length)return this;if(e.length<this._minEntries){for(var t=0;t<e.length;t++)this.insert(e[t]);return this}var n=this._build(e.slice(),0,e.length-1,0);if(this.data.children.length)if(this.data.height===n.height)this._splitRoot(this.data,n);else{if(this.data.height<n.height){var r=this.data;this.data=n,n=r}this._insert(n,this.data.height-n.height-1,!0)}else this.data=n;return this},r.prototype.insert=function(e){return e&&this._insert(e,this.data.height-1),this},r.prototype.clear=function(){return this.data=m([]),this},r.prototype.remove=function(e,t){if(!e)return this;for(var n,r,a,o=this.data,s=this.toBBox(e),c=[],l=[];o||c.length;){if(o||(o=c.pop(),r=c[c.length-1],n=l.pop(),a=!0),o.leaf){var u=i(e,o.children,t);if(u!==-1)return o.children.splice(u,1),c.push(o),this._condense(c),this}a||o.leaf||!f(o,s)?r?(n++,o=r.children[n],a=!1):o=null:(c.push(o),l.push(n),n=0,r=o,o=o.children[0])}return this},r.prototype.toBBox=function(e){return e},r.prototype.compareMinX=function(e,t){return e.minX-t.minX},r.prototype.compareMinY=function(e,t){return e.minY-t.minY},r.prototype.toJSON=function(){return this.data},r.prototype.fromJSON=function(e){return this.data=e,this},r.prototype._all=function(e,t){for(var n=[];e;)e.leaf?t.push.apply(t,e.children):n.push.apply(n,e.children),e=n.pop();return t},r.prototype._build=function(e,t,n,r){var i,o=n-t+1,s=this._maxEntries;if(o<=s)return a(i=m(e.slice(t,n+1)),this.toBBox),i;r||(r=Math.ceil(Math.log(o)/Math.log(s)),s=Math.ceil(o/s**(r-1))),(i=m([])).leaf=!1,i.height=r;var c=Math.ceil(o/s),l=c*Math.ceil(Math.sqrt(s));h(e,t,n,l,this.compareMinX);for(var u=t;u<=n;u+=l){var d=Math.min(u+l-1,n);h(e,u,d,c,this.compareMinY);for(var f=u;f<=d;f+=c){var p=Math.min(f+c-1,d);i.children.push(this._build(e,f,p,r-1))}}return a(i,this.toBBox),i},r.prototype._chooseSubtree=function(e,t,n,r){for(;r.push(t),!t.leaf&&r.length-1!==n;){for(var i=1/0,a=1/0,o=void 0,s=0;s<t.children.length;s++){var c=t.children[s],l=u(c),d=(f=e,p=c,(Math.max(p.maxX,f.maxX)-Math.min(p.minX,f.minX))*(Math.max(p.maxY,f.maxY)-Math.min(p.minY,f.minY))-l);d<a?(a=d,i=l<i?l:i,o=c):d===a&&l<i&&(i=l,o=c)}t=o||t.children[0]}var f,p;return t},r.prototype._insert=function(e,t,n){var r=n?e:this.toBBox(e),i=[],a=this._chooseSubtree(r,this.data,t,i);for(a.children.push(e),s(a,r);t>=0&&i[t].children.length>this._maxEntries;)this._split(i,t),t--;this._adjustParentBBoxes(r,i,t)},r.prototype._split=function(e,t){var n=e[t],r=n.children.length,i=this._minEntries;this._chooseSplitAxis(n,i,r);var o=this._chooseSplitIndex(n,i,r),s=m(n.children.splice(o,n.children.length-o));s.height=n.height,s.leaf=n.leaf,a(n,this.toBBox),a(s,this.toBBox),t?e[t-1].children.push(s):this._splitRoot(n,s)},r.prototype._splitRoot=function(e,t){this.data=m([e,t]),this.data.height=e.height+1,this.data.leaf=!1,a(this.data,this.toBBox)},r.prototype._chooseSplitIndex=function(e,t,n){for(var r,i,a,s,c,l,d,f=1/0,p=1/0,m=t;m<=n-t;m++){var h=o(e,0,m,this.toBBox),g=o(e,m,n,this.toBBox),_=(i=h,a=g,s=void 0,c=void 0,l=void 0,d=void 0,s=Math.max(i.minX,a.minX),c=Math.max(i.minY,a.minY),l=Math.min(i.maxX,a.maxX),d=Math.min(i.maxY,a.maxY),Math.max(0,l-s)*Math.max(0,d-c)),v=u(h)+u(g);_<f?(f=_,r=m,p=v<p?v:p):_===f&&v<p&&(p=v,r=m)}return r||n-t},r.prototype._chooseSplitAxis=function(e,t,n){var r=e.leaf?this.compareMinX:c,i=e.leaf?this.compareMinY:l;this._allDistMargin(e,t,n,r)<this._allDistMargin(e,t,n,i)&&e.children.sort(r)},r.prototype._allDistMargin=function(e,t,n,r){e.children.sort(r);for(var i=this.toBBox,a=o(e,0,t,i),c=o(e,n-t,n,i),l=d(a)+d(c),u=t;u<n-t;u++){var f=e.children[u];s(a,e.leaf?i(f):f),l+=d(a)}for(var p=n-t-1;p>=t;p--){var m=e.children[p];s(c,e.leaf?i(m):m),l+=d(c)}return l},r.prototype._adjustParentBBoxes=function(e,t,n){for(var r=n;r>=0;r--)s(t[r],e)},r.prototype._condense=function(e){for(var t=e.length-1,n=void 0;t>=0;t--)e[t].children.length===0?t>0?(n=e[t-1].children).splice(n.indexOf(e[t]),1):this.clear():a(e[t],this.toBBox)},r})})),u=e.r({default:()=>f});function d(e,t){return e<t?-1:+(e>t)}var f,p=e.n((()=>{f=class{constructor(e=[],t=d){if(this.data=e,this.length=this.data.length,this.compare=t,this.length>0)for(let e=(this.length>>1)-1;e>=0;e--)this._down(e)}push(e){this.data.push(e),this.length++,this._up(this.length-1)}pop(){if(this.length===0)return;let e=this.data[0],t=this.data.pop();return this.length--,this.length>0&&(this.data[0]=t,this._down(0)),e}peek(){return this.data[0]}_up(e){let{data:t,compare:n}=this,r=t[e];for(;e>0;){let i=e-1>>1,a=t[i];if(n(r,a)>=0)break;t[e]=a,e=i}t[e]=r}_down(e){let{data:t,compare:n}=this,r=this.length>>1,i=t[e];for(;e<r;){let r=(e<<1)+1,a=t[r],o=r+1;if(o<this.length&&n(t[o],a)<0&&(r=o,a=t[o]),n(a,i)>=0)break;t[e]=a,e=r}t[e]=i}}})),m=e.t(((e,t)=>{t.exports=function(e,t,n,r){var i=e[0],a=e[1],o=!1;n===void 0&&(n=0),r===void 0&&(r=t.length);for(var s=(r-n)/2,c=0,l=s-1;c<s;l=c++){var u=t[n+c*2+0],d=t[n+c*2+1],f=t[n+l*2+0],p=t[n+l*2+1];d>a!=p>a&&i<(f-u)*(a-d)/(p-d)+u&&(o=!o)}return o}})),h=e.t(((e,t)=>{t.exports=function(e,t,n,r){var i=e[0],a=e[1],o=!1;n===void 0&&(n=0),r===void 0&&(r=t.length);for(var s=r-n,c=0,l=s-1;c<s;l=c++){var u=t[c+n][0],d=t[c+n][1],f=t[l+n][0],p=t[l+n][1];d>a!=p>a&&i<(f-u)*(a-d)/(p-d)+u&&(o=!o)}return o}})),g=e.t(((e,t)=>{var n=m(),r=h();t.exports=function(e,t,i,a){return t.length>0&&Array.isArray(t[0])?r(e,t,i,a):n(e,t,i,a)},t.exports.nested=r,t.exports.flat=n})),_=e.t(((e,t)=>{(function(n,r){typeof e==`object`&&t!==void 0?r(e):typeof define==`function`&&define.amd?define([`exports`],r):r((n||=self).predicates={})})(e,function(e){"use strict";let t=134217729;function n(e,t,n,r,i){let a,o,s,c,l=t[0],u=r[0],d=0,f=0;u>l==u>-l?(a=l,l=t[++d]):(a=u,u=r[++f]);let p=0;if(d<e&&f<n)for(u>l==u>-l?(s=a-((o=l+a)-l),l=t[++d]):(s=a-((o=u+a)-u),u=r[++f]),a=o,s!==0&&(i[p++]=s);d<e&&f<n;)u>l==u>-l?(s=a-((o=a+l)-(c=o-a))+(l-c),l=t[++d]):(s=a-((o=a+u)-(c=o-a))+(u-c),u=r[++f]),a=o,s!==0&&(i[p++]=s);for(;d<e;)s=a-((o=a+l)-(c=o-a))+(l-c),l=t[++d],a=o,s!==0&&(i[p++]=s);for(;f<n;)s=a-((o=a+u)-(c=o-a))+(u-c),u=r[++f],a=o,s!==0&&(i[p++]=s);return a===0&&p!==0||(i[p++]=a),p}function r(e){return new Float64Array(e)}let i=r(4),a=r(8),o=r(12),s=r(16),c=r(4);e.orient2d=function(e,r,l,u,d,f){let p=(r-f)*(l-d),m=(e-d)*(u-f),h=p-m;if(p===0||m===0||p>0!=m>0)return h;let g=Math.abs(p+m);return Math.abs(h)>=33306690738754716e-32*g?h:-function(e,r,l,u,d,f,p){let m,h,g,_,v,y,b,x,S,C,w,T,E,D,O,k,A,j,M=e-d,N=l-d,P=r-f,F=u-f;v=(O=(x=M-(b=(y=t*M)-(y-M)))*(C=F-(S=(y=t*F)-(y-F)))-((D=M*F)-b*S-x*S-b*C))-(w=O-(A=(x=P-(b=(y=t*P)-(y-P)))*(C=N-(S=(y=t*N)-(y-N)))-((k=P*N)-b*S-x*S-b*C))),i[0]=O-(w+v)+(v-A),v=(E=D-((T=D+w)-(v=T-D))+(w-v))-(w=E-k),i[1]=E-(w+v)+(v-k),v=(j=T+w)-T,i[2]=T-(j-v)+(w-v),i[3]=j;let I=function(e,t){let n=t[0];for(let r=1;r<e;r++)n+=t[r];return n}(4,i),L=22204460492503146e-32*p;if(I>=L||-I>=L||(m=e-(M+(v=e-M))+(v-d),g=l-(N+(v=l-N))+(v-d),h=r-(P+(v=r-P))+(v-f),_=u-(F+(v=u-F))+(v-f),m===0&&h===0&&g===0&&_===0)||(L=11093356479670487e-47*p+33306690738754706e-32*Math.abs(I),(I+=M*_+F*m-(P*g+N*h))>=L||-I>=L))return I;v=(O=(x=m-(b=(y=t*m)-(y-m)))*(C=F-(S=(y=t*F)-(y-F)))-((D=m*F)-b*S-x*S-b*C))-(w=O-(A=(x=h-(b=(y=t*h)-(y-h)))*(C=N-(S=(y=t*N)-(y-N)))-((k=h*N)-b*S-x*S-b*C))),c[0]=O-(w+v)+(v-A),v=(E=D-((T=D+w)-(v=T-D))+(w-v))-(w=E-k),c[1]=E-(w+v)+(v-k),v=(j=T+w)-T,c[2]=T-(j-v)+(w-v),c[3]=j;let R=n(4,i,4,c,a);v=(O=(x=M-(b=(y=t*M)-(y-M)))*(C=_-(S=(y=t*_)-(y-_)))-((D=M*_)-b*S-x*S-b*C))-(w=O-(A=(x=P-(b=(y=t*P)-(y-P)))*(C=g-(S=(y=t*g)-(y-g)))-((k=P*g)-b*S-x*S-b*C))),c[0]=O-(w+v)+(v-A),v=(E=D-((T=D+w)-(v=T-D))+(w-v))-(w=E-k),c[1]=E-(w+v)+(v-k),v=(j=T+w)-T,c[2]=T-(j-v)+(w-v),c[3]=j;let z=n(R,a,4,c,o);return v=(O=(x=m-(b=(y=t*m)-(y-m)))*(C=_-(S=(y=t*_)-(y-_)))-((D=m*_)-b*S-x*S-b*C))-(w=O-(A=(x=h-(b=(y=t*h)-(y-h)))*(C=g-(S=(y=t*g)-(y-g)))-((k=h*g)-b*S-x*S-b*C))),c[0]=O-(w+v)+(v-A),v=(E=D-((T=D+w)-(v=T-D))+(w-v))-(w=E-k),c[1]=E-(w+v)+(v-k),v=(j=T+w)-T,c[2]=T-(j-v)+(w-v),c[3]=j,s[n(z,o,4,c,s)-1]}(e,r,l,u,d,f,g)},e.orient2dfast=function(e,t,n,r,i,a){return(t-a)*(n-i)-(e-i)*(r-a)},Object.defineProperty(e,`__esModule`,{value:!0})})})),v=e.t(((t,n)=>{var r=l(),i=(p(),e.i(u)),a=g(),o=_().orient2d;i.default&&(i=i.default),n.exports=s,n.exports.default=s;function s(e,t,n){t=Math.max(0,t===void 0?2:t),n||=0;var i=x(e),a=new r(16);a.toBBox=function(e){return{minX:e[0],minY:e[1],maxX:e[0],maxY:e[1]}},a.compareMinX=function(e,t){return e[0]-t[0]},a.compareMinY=function(e,t){return e[1]-t[1]},a.load(e);for(var o=[],s=0,l;s<i.length;s++){var u=i[s];a.remove(u),l=S(u,l),o.push(l)}var d=new r(16);for(s=0;s<o.length;s++)d.insert(b(o[s]));for(var f=t*t,p=n*n;o.length;){var m=o.shift(),h=m.p,g=m.next.p,_=C(h,g);if(!(_<p)){var v=_/f;u=c(a,m.prev.p,h,g,m.next.next.p,v,d),u&&Math.min(C(u,h),C(u,g))<=v&&(o.push(m),o.push(S(u,m)),a.remove(u),d.remove(m),d.insert(b(m)),d.insert(b(m.next)))}}m=l;var y=[];do y.push(m.p),m=m.next;while(m!==l);return y.push(m.p),y}function c(e,t,n,r,a,o,s){for(var c=new i([],d),l=e.data;l;){for(var u=0;u<l.children.length;u++){var p=l.children[u],m=l.leaf?w(p,n,r):f(n,r,p);m>o||c.push({node:p,dist:m})}for(;c.length&&!c.peek().node.children;){var g=c.pop(),_=g.node,v=w(_,t,n),y=w(_,r,a);if(g.dist<v&&g.dist<y&&h(n,_,s)&&h(r,_,s))return _}l=c.pop(),l&&=l.node}return null}function d(e,t){return e.dist-t.dist}function f(e,t,n){if(m(e,n)||m(t,n))return 0;var r=T(e[0],e[1],t[0],t[1],n.minX,n.minY,n.maxX,n.minY);if(r===0)return 0;var i=T(e[0],e[1],t[0],t[1],n.minX,n.minY,n.minX,n.maxY);if(i===0)return 0;var a=T(e[0],e[1],t[0],t[1],n.maxX,n.minY,n.maxX,n.maxY);if(a===0)return 0;var o=T(e[0],e[1],t[0],t[1],n.minX,n.maxY,n.maxX,n.maxY);return o===0?0:Math.min(r,i,a,o)}function m(e,t){return e[0]>=t.minX&&e[0]<=t.maxX&&e[1]>=t.minY&&e[1]<=t.maxY}function h(e,t,n){for(var r=Math.min(e[0],t[0]),i=Math.min(e[1],t[1]),a=Math.max(e[0],t[0]),o=Math.max(e[1],t[1]),s=n.search({minX:r,minY:i,maxX:a,maxY:o}),c=0;c<s.length;c++)if(y(s[c].p,s[c].next.p,e,t))return!1;return!0}function v(e,t,n){return o(e[0],e[1],t[0],t[1],n[0],n[1])}function y(e,t,n,r){return e!==r&&t!==n&&v(e,t,n)>0!=v(e,t,r)>0&&v(n,r,e)>0!=v(n,r,t)>0}function b(e){var t=e.p,n=e.next.p;return e.minX=Math.min(t[0],n[0]),e.minY=Math.min(t[1],n[1]),e.maxX=Math.max(t[0],n[0]),e.maxY=Math.max(t[1],n[1]),e}function x(e){for(var t=e[0],n=e[0],r=e[0],i=e[0],o=0;o<e.length;o++){var s=e[o];s[0]<t[0]&&(t=s),s[0]>r[0]&&(r=s),s[1]<n[1]&&(n=s),s[1]>i[1]&&(i=s)}var c=[t,n,r,i],l=c.slice();for(o=0;o<e.length;o++)a(e[o],c)||l.push(e[o]);return D(l)}function S(e,t){var n={p:e,prev:null,next:null,minX:0,minY:0,maxX:0,maxY:0};return t?(n.next=t.next,n.prev=t,t.next.prev=n,t.next=n):(n.prev=n,n.next=n),n}function C(e,t){var n=e[0]-t[0],r=e[1]-t[1];return n*n+r*r}function w(e,t,n){var r=t[0],i=t[1],a=n[0]-r,o=n[1]-i;if(a!==0||o!==0){var s=((e[0]-r)*a+(e[1]-i)*o)/(a*a+o*o);s>1?(r=n[0],i=n[1]):s>0&&(r+=a*s,i+=o*s)}return a=e[0]-r,o=e[1]-i,a*a+o*o}function T(e,t,n,r,i,a,o,s){var c=n-e,l=r-t,u=o-i,d=s-a,f=e-i,p=t-a,m=c*c+l*l,h=c*u+l*d,g=u*u+d*d,_=c*f+l*p,v=u*f+d*p,y=m*g-h*h,b,x,S,C,w=y,T=y;y===0?(x=0,w=1,C=v,T=g):(x=h*v-g*_,C=m*v-h*_,x<0?(x=0,C=v,T=g):x>w&&(x=w,C=v+h,T=g)),C<0?(C=0,-_<0?x=0:-_>m?x=w:(x=-_,w=m)):C>T&&(C=T,-_+h<0?x=0:-_+h>m?x=w:(x=-_+h,w=m)),b=x===0?0:x/w,S=C===0?0:C/T;var E=(1-b)*e+b*n,D=(1-b)*t+b*r,O=(1-S)*i+S*o,k=(1-S)*a+S*s,A=O-E,j=k-D;return A*A+j*j}function E(e,t){return e[0]===t[0]?e[1]-t[1]:e[0]-t[0]}function D(e){e.sort(E);for(var t=[],n=0;n<e.length;n++){for(;t.length>=2&&v(t[t.length-2],t[t.length-1],e[n])<=0;)t.pop();t.push(e[n])}for(var r=[],i=e.length-1;i>=0;i--){for(;r.length>=2&&v(r[r.length-2],r[r.length-1],e[i])<=0;)r.pop();r.push(e[i])}return r.pop(),t.pop(),t.concat(r)}})),y=e.a(v(),1);function b(e,t={}){t.concavity=t.concavity||1/0;let n=[];if(o(e,e=>{n.push([e[0],e[1]])}),!n.length)return null;let r=(0,y.default)(n,t.concavity);return r.length>3?i([r]):null}function x(e,t={}){let n=0,i=0,a=0;return o(e,function(e){n+=e[0],i+=e[1],a++},!0),r([n/a,i/a],t.properties)}function S(e){if(!e)throw Error(`coord is required`);if(!Array.isArray(e)){if(e.type===`Feature`&&e.geometry!==null&&e.geometry.type===`Point`)return[...e.geometry.coordinates];if(e.type===`Point`)return[...e.coordinates]}if(Array.isArray(e)&&e.length>=2&&!Array.isArray(e[0])&&!Array.isArray(e[1]))return[...e];throw Error(`coord must be GeoJSON Point or an Array of numbers`)}function C(e,t){return e.type===`FeatureCollection`?`FeatureCollection`:e.type===`GeometryCollection`?`GeometryCollection`:e.type===`Feature`&&e.geometry!==null?e.geometry.type:e.type}function w(e,t={}){switch(C(e)){case`Point`:return r(S(e),t.properties);case`Polygon`:var n=[];o(e,function(e){n.push(e)});var i=x(e,{properties:t.properties}),a=i.geometry.coordinates,s=0,c=0,l=0,u,d,f,p,m,h,g,_,v=n.map(function(e){return[e[0]-a[0],e[1]-a[1]]});for(u=0;u<n.length-1;u++)d=v[u],p=d[0],h=d[1],f=v[u+1],m=f[0],g=f[1],_=p*g-m*h,l+=_,s+=(p+m)*_,c+=(h+g)*_;if(l===0)return i;var y=1/(l*.5*6);return r([a[0]+y*s,a[1]+y*c],t.properties);default:var T=b(e);return T?w(T,{properties:t.properties}):x(e,{properties:t.properties})}}var T=w;Object.defineProperty(exports,`i`,{enumerable:!0,get:function(){return t}}),Object.defineProperty(exports,`n`,{enumerable:!0,get:function(){return o}}),Object.defineProperty(exports,`r`,{enumerable:!0,get:function(){return c}}),Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return T}});
+//# sourceMappingURL=esm-BwfGJUcL.cjs.map