@fffattiger/pix-cli 0.1.0

package/client/assets/vennDiagram-DHZGUBPP-6ur4LT56.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vennDiagram-DHZGUBPP-6ur4LT56.js","sources":["../../../../node_modules/khroma/dist/methods/transparentize.js","../../../../node_modules/@upsetjs/venn.js/build/venn.esm.js","../../../../node_modules/mermaid/dist/chunks/mermaid.core/vennDiagram-DHZGUBPP.mjs"],"sourcesContent":["/* IMPORT */\nimport adjustChannel from './adjust_channel.js';\n/* MAIN */\nconst transparentize = (color, amount) => {\n    return adjustChannel(color, 'a', -amount);\n};\n/* EXPORT */\nexport default transparentize;\n","const SMALL$1 = 1e-10;\n\n/**\n * Returns the intersection area of a bunch of circles (where each circle\n * is an object having an x,y and radius property)\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @param {undefined | { area?: number, arcArea?: number, polygonArea?: number, arcs?: ReadonlyArray<{ circle: {x: number, y: number, radius: number}, width: number, p1: {x: number, y: number}, p2: {x: number, y: number} }>, innerPoints: ReadonlyArray<{\n    x: number;\n    y: number;\n    parentIndex: [number, number];\n}>, intersectionPoints: ReadonlyArray<{\n  x: number;\n  y: number;\n  parentIndex: [number, number];\n}> }} stats\n * @returns {number}\n */\nfunction intersectionArea(circles, stats) {\n  // get all the intersection points of the circles\n  const intersectionPoints = getIntersectionPoints(circles);\n\n  // filter out points that aren't included in all the circles\n  const innerPoints = intersectionPoints.filter((p) => containedInCircles(p, circles));\n\n  let arcArea = 0;\n  let polygonArea = 0;\n  /** @type {{ circle: {x: number, y: number, radius: number}, width: number, p1: {x: number, y: number}, p2: {x: number, y: number} }[]} */\n  const arcs = [];\n\n  // if we have intersection points that are within all the circles,\n  // then figure out the area contained by them\n  if (innerPoints.length > 1) {\n    // sort the points by angle from the center of the polygon, which lets\n    // us just iterate over points to get the edges\n    const center = getCenter(innerPoints);\n    for (let i = 0; i < innerPoints.length; ++i) {\n      const p = innerPoints[i];\n      p.angle = Math.atan2(p.x - center.x, p.y - center.y);\n    }\n    innerPoints.sort((a, b) => b.angle - a.angle);\n\n    // iterate over all points, get arc between the points\n    // and update the areas\n    let p2 = innerPoints[innerPoints.length - 1];\n    for (let i = 0; i < innerPoints.length; ++i) {\n      const p1 = innerPoints[i];\n\n      // polygon area updates easily ...\n      polygonArea += (p2.x + p1.x) * (p1.y - p2.y);\n\n      // updating the arc area is a little more involved\n      const midPoint = { x: (p1.x + p2.x) / 2, y: (p1.y + p2.y) / 2 };\n      /** @types null | { circle: {x: number, y: number, radius: number}, width: number, p1: {x: number, y: number}, p2: {x: number, y: number} } */\n      let arc = null;\n\n      for (let j = 0; j < p1.parentIndex.length; ++j) {\n        if (p2.parentIndex.includes(p1.parentIndex[j])) {\n          // figure out the angle halfway between the two points\n          // on the current circle\n          const circle = circles[p1.parentIndex[j]];\n          const a1 = Math.atan2(p1.x - circle.x, p1.y - circle.y);\n          const a2 = Math.atan2(p2.x - circle.x, p2.y - circle.y);\n\n          let angleDiff = a2 - a1;\n          if (angleDiff < 0) {\n            angleDiff += 2 * Math.PI;\n          }\n\n          // and use that angle to figure out the width of the\n          // arc\n          const a = a2 - angleDiff / 2;\n          let width = distance(midPoint, {\n            x: circle.x + circle.radius * Math.sin(a),\n            y: circle.y + circle.radius * Math.cos(a),\n          });\n\n          // clamp the width to the largest is can actually be\n          // (sometimes slightly overflows because of FP errors)\n          if (width > circle.radius * 2) {\n            width = circle.radius * 2;\n          }\n\n          // pick the circle whose arc has the smallest width\n          if (arc == null || arc.width > width) {\n            arc = { circle, width, p1, p2, large: width > circle.radius, sweep: true };\n          }\n        }\n      }\n\n      if (arc != null) {\n        arcs.push(arc);\n        arcArea += circleArea(arc.circle.radius, arc.width);\n        p2 = p1;\n      }\n    }\n  } else {\n    // no intersection points, is either disjoint - or is completely\n    // overlapped. figure out which by examining the smallest circle\n    let smallest = circles[0];\n    for (let i = 1; i < circles.length; ++i) {\n      if (circles[i].radius < smallest.radius) {\n        smallest = circles[i];\n      }\n    }\n\n    // make sure the smallest circle is completely contained in all\n    // the other circles\n    let disjoint = false;\n    for (let i = 0; i < circles.length; ++i) {\n      if (distance(circles[i], smallest) > Math.abs(smallest.radius - circles[i].radius)) {\n        disjoint = true;\n        break;\n      }\n    }\n\n    if (disjoint) {\n      arcArea = polygonArea = 0;\n    } else {\n      arcArea = smallest.radius * smallest.radius * Math.PI;\n      arcs.push({\n        circle: smallest,\n        p1: { x: smallest.x, y: smallest.y + smallest.radius },\n        p2: { x: smallest.x - SMALL$1, y: smallest.y + smallest.radius },\n        width: smallest.radius * 2,\n        large: true,\n        sweep: true,\n      });\n    }\n  }\n\n  polygonArea /= 2;\n\n  if (stats) {\n    stats.area = arcArea + polygonArea;\n    stats.arcArea = arcArea;\n    stats.polygonArea = polygonArea;\n    stats.arcs = arcs;\n    stats.innerPoints = innerPoints;\n    stats.intersectionPoints = intersectionPoints;\n  }\n\n  return arcArea + polygonArea;\n}\n\n/**\n * returns whether a point is contained by all of a list of circles\n * @param {{x: number, y: number}} point\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @returns {boolean}\n */\nfunction containedInCircles(point, circles) {\n  return circles.every((circle) => distance(point, circle) < circle.radius + SMALL$1);\n}\n\n/**\n * Gets all intersection points between a bunch of circles\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @returns {ReadonlyArray<{x: number, y: number, parentIndex: [number, number]}>}\n */\nfunction getIntersectionPoints(circles) {\n  /** @type {{x: number, y: number, parentIndex: [number, number]}[]} */\n  const ret = [];\n  for (let i = 0; i < circles.length; ++i) {\n    for (let j = i + 1; j < circles.length; ++j) {\n      const intersect = circleCircleIntersection(circles[i], circles[j]);\n      for (const p of intersect) {\n        p.parentIndex = [i, j];\n        ret.push(p);\n      }\n    }\n  }\n  return ret;\n}\n\n/**\n * Circular segment area calculation. See http://mathworld.wolfram.com/CircularSegment.html\n * @param {number} r\n * @param {number} width\n * @returns {number}\n **/\nfunction circleArea(r, width) {\n  return r * r * Math.acos(1 - width / r) - (r - width) * Math.sqrt(width * (2 * r - width));\n}\n\n/**\n * euclidean distance between two points\n * @param {{x: number, y: number}} p1\n * @param {{x: number, y: number}} p2\n * @returns {number}\n **/\nfunction distance(p1, p2) {\n  return Math.sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));\n}\n\n/**\n * Returns the overlap area of two circles of radius r1 and r2 - that\n * have their centers separated by distance d. Simpler faster\n * circle intersection for only two circles\n * @param {number} r1\n * @param {number} r2\n * @param {number} d\n * @returns {number}\n */\nfunction circleOverlap(r1, r2, d) {\n  // no overlap\n  if (d >= r1 + r2) {\n    return 0;\n  }\n\n  // completely overlapped\n  if (d <= Math.abs(r1 - r2)) {\n    return Math.PI * Math.min(r1, r2) * Math.min(r1, r2);\n  }\n\n  const w1 = r1 - (d * d - r2 * r2 + r1 * r1) / (2 * d);\n  const w2 = r2 - (d * d - r1 * r1 + r2 * r2) / (2 * d);\n  return circleArea(r1, w1) + circleArea(r2, w2);\n}\n\n/**\n * Given two circles (containing a x/y/radius attributes),\n * returns the intersecting points if possible\n * note: doesn't handle cases where there are infinitely many\n * intersection points (circles are equivalent):, or only one intersection point\n * @param {{x: number, y: number, radius: number}} p1\n * @param {{x: number, y: number, radius: number}} p2\n * @returns {ReadonlyArray<{x: number, y: number}>}\n **/\nfunction circleCircleIntersection(p1, p2) {\n  const d = distance(p1, p2);\n  const r1 = p1.radius;\n  const r2 = p2.radius;\n\n  // if to far away, or self contained - can't be done\n  if (d >= r1 + r2 || d <= Math.abs(r1 - r2)) {\n    return [];\n  }\n\n  const a = (r1 * r1 - r2 * r2 + d * d) / (2 * d);\n  const h = Math.sqrt(r1 * r1 - a * a);\n  const x0 = p1.x + (a * (p2.x - p1.x)) / d;\n  const y0 = p1.y + (a * (p2.y - p1.y)) / d;\n  const rx = -(p2.y - p1.y) * (h / d);\n  const ry = -(p2.x - p1.x) * (h / d);\n\n  return [\n    { x: x0 + rx, y: y0 - ry },\n    { x: x0 - rx, y: y0 + ry },\n  ];\n}\n\n/**\n * Returns the center of a bunch of points\n * @param {ReadonlyArray<{x: number, y: number}>} points\n * @returns {{x: number, y: number}}\n */\nfunction getCenter(points) {\n  const center = { x: 0, y: 0 };\n  for (const point of points) {\n    center.x += point.x;\n    center.y += point.y;\n  }\n  center.x /= points.length;\n  center.y /= points.length;\n  return center;\n}\n\n/** finds the zeros of a function, given two starting points (which must\n * have opposite signs */\nfunction bisect(f, a, b, parameters) {\n    parameters = parameters || {};\n    const maxIterations = parameters.maxIterations || 100;\n    const tolerance = parameters.tolerance || 1e-10;\n    const fA = f(a);\n    const fB = f(b);\n    let delta = b - a;\n\n    if (fA * fB > 0) {\n        throw 'Initial bisect points must have opposite signs';\n    }\n\n    if (fA === 0) return a;\n    if (fB === 0) return b;\n\n    for (let i = 0; i < maxIterations; ++i) {\n        delta /= 2;\n        const mid = a + delta;\n        const fMid = f(mid);\n\n        if (fMid * fA >= 0) {\n            a = mid;\n        }\n\n        if (Math.abs(delta) < tolerance || fMid === 0) {\n            return mid;\n        }\n    }\n    return a + delta;\n}\n\n// need some basic operations on vectors, rather than adding a dependency,\n// just define here\nfunction zeros(x) {\n    const r = new Array(x);\n    for (let i = 0; i < x; ++i) {\n        r[i] = 0;\n    }\n    return r;\n}\nfunction zerosM(x, y) {\n    return zeros(x).map(() => zeros(y));\n}\n\nfunction dot(a, b) {\n    let ret = 0;\n    for (let i = 0; i < a.length; ++i) {\n        ret += a[i] * b[i];\n    }\n    return ret;\n}\n\nfunction norm2(a) {\n    return Math.sqrt(dot(a, a));\n}\n\nfunction scale(ret, value, c) {\n    for (let i = 0; i < value.length; ++i) {\n        ret[i] = value[i] * c;\n    }\n}\n\nfunction weightedSum(ret, w1, v1, w2, v2) {\n    for (let j = 0; j < ret.length; ++j) {\n        ret[j] = w1 * v1[j] + w2 * v2[j];\n    }\n}\n\n/** minimizes a function using the downhill simplex method */\nfunction nelderMead(f, x0, parameters) {\n    parameters = parameters || {};\n\n    const maxIterations = parameters.maxIterations || x0.length * 200;\n    const nonZeroDelta = parameters.nonZeroDelta || 1.05;\n    const zeroDelta = parameters.zeroDelta || 0.001;\n    const minErrorDelta = parameters.minErrorDelta || 1e-6;\n    const minTolerance = parameters.minErrorDelta || 1e-5;\n    const rho = parameters.rho !== undefined ? parameters.rho : 1;\n    const chi = parameters.chi !== undefined ? parameters.chi : 2;\n    const psi = parameters.psi !== undefined ? parameters.psi : -0.5;\n    const sigma = parameters.sigma !== undefined ? parameters.sigma : 0.5;\n    let maxDiff;\n\n    // initialize simplex.\n    const N = x0.length;\n    const simplex = new Array(N + 1);\n    simplex[0] = x0;\n    simplex[0].fx = f(x0);\n    simplex[0].id = 0;\n    for (let i = 0; i < N; ++i) {\n        const point = x0.slice();\n        point[i] = point[i] ? point[i] * nonZeroDelta : zeroDelta;\n        simplex[i + 1] = point;\n        simplex[i + 1].fx = f(point);\n        simplex[i + 1].id = i + 1;\n    }\n\n    function updateSimplex(value) {\n        for (let i = 0; i < value.length; i++) {\n            simplex[N][i] = value[i];\n        }\n        simplex[N].fx = value.fx;\n    }\n\n    const sortOrder = (a, b) => a.fx - b.fx;\n\n    const centroid = x0.slice();\n    const reflected = x0.slice();\n    const contracted = x0.slice();\n    const expanded = x0.slice();\n\n    for (let iteration = 0; iteration < maxIterations; ++iteration) {\n        simplex.sort(sortOrder);\n\n        if (parameters.history) {\n            // copy the simplex (since later iterations will mutate) and\n            // sort it to have a consistent order between iterations\n            const sortedSimplex = simplex.map((x) => {\n                const state = x.slice();\n                state.fx = x.fx;\n                state.id = x.id;\n                return state;\n            });\n            sortedSimplex.sort((a, b) => a.id - b.id);\n\n            parameters.history.push({\n                x: simplex[0].slice(),\n                fx: simplex[0].fx,\n                simplex: sortedSimplex,\n            });\n        }\n\n        maxDiff = 0;\n        for (let i = 0; i < N; ++i) {\n            maxDiff = Math.max(maxDiff, Math.abs(simplex[0][i] - simplex[1][i]));\n        }\n\n        if (Math.abs(simplex[0].fx - simplex[N].fx) < minErrorDelta && maxDiff < minTolerance) {\n            break;\n        }\n\n        // compute the centroid of all but the worst point in the simplex\n        for (let i = 0; i < N; ++i) {\n            centroid[i] = 0;\n            for (let j = 0; j < N; ++j) {\n                centroid[i] += simplex[j][i];\n            }\n            centroid[i] /= N;\n        }\n\n        // reflect the worst point past the centroid  and compute loss at reflected\n        // point\n        const worst = simplex[N];\n        weightedSum(reflected, 1 + rho, centroid, -rho, worst);\n        reflected.fx = f(reflected);\n\n        // if the reflected point is the best seen, then possibly expand\n        if (reflected.fx < simplex[0].fx) {\n            weightedSum(expanded, 1 + chi, centroid, -chi, worst);\n            expanded.fx = f(expanded);\n            if (expanded.fx < reflected.fx) {\n                updateSimplex(expanded);\n            } else {\n                updateSimplex(reflected);\n            }\n        }\n\n        // if the reflected point is worse than the second worst, we need to\n        // contract\n        else if (reflected.fx >= simplex[N - 1].fx) {\n            let shouldReduce = false;\n\n            if (reflected.fx > worst.fx) {\n                // do an inside contraction\n                weightedSum(contracted, 1 + psi, centroid, -psi, worst);\n                contracted.fx = f(contracted);\n                if (contracted.fx < worst.fx) {\n                    updateSimplex(contracted);\n                } else {\n                    shouldReduce = true;\n                }\n            } else {\n                // do an outside contraction\n                weightedSum(contracted, 1 - psi * rho, centroid, psi * rho, worst);\n                contracted.fx = f(contracted);\n                if (contracted.fx < reflected.fx) {\n                    updateSimplex(contracted);\n                } else {\n                    shouldReduce = true;\n                }\n            }\n\n            if (shouldReduce) {\n                // if we don't contract here, we're done\n                if (sigma >= 1) break;\n\n                // do a reduction\n                for (let i = 1; i < simplex.length; ++i) {\n                    weightedSum(simplex[i], 1 - sigma, simplex[0], sigma, simplex[i]);\n                    simplex[i].fx = f(simplex[i]);\n                }\n            }\n        } else {\n            updateSimplex(reflected);\n        }\n    }\n\n    simplex.sort(sortOrder);\n    return { fx: simplex[0].fx, x: simplex[0] };\n}\n\n/// searches along line 'pk' for a point that satifies the wolfe conditions\n/// See 'Numerical Optimization' by Nocedal and Wright p59-60\n/// f : objective function\n/// pk : search direction\n/// current: object containing current gradient/loss\n/// next: output: contains next gradient/loss\n/// returns a: step size taken\nfunction wolfeLineSearch(f, pk, current, next, a, c1, c2) {\n    const phi0 = current.fx;\n    const phiPrime0 = dot(current.fxprime, pk);\n    let phi = phi0;\n    let phi_old = phi0;\n    let phiPrime = phiPrime0;\n    let a0 = 0;\n\n    a = a || 1;\n    c1 = c1 || 1e-6;\n    c2 = c2 || 0.1;\n\n    function zoom(a_lo, a_high, phi_lo) {\n        for (let iteration = 0; iteration < 16; ++iteration) {\n            a = (a_lo + a_high) / 2;\n            weightedSum(next.x, 1.0, current.x, a, pk);\n            phi = next.fx = f(next.x, next.fxprime);\n            phiPrime = dot(next.fxprime, pk);\n\n            if (phi > phi0 + c1 * a * phiPrime0 || phi >= phi_lo) {\n                a_high = a;\n            } else {\n                if (Math.abs(phiPrime) <= -c2 * phiPrime0) {\n                    return a;\n                }\n\n                if (phiPrime * (a_high - a_lo) >= 0) {\n                    a_high = a_lo;\n                }\n\n                a_lo = a;\n                phi_lo = phi;\n            }\n        }\n\n        return 0;\n    }\n\n    for (let iteration = 0; iteration < 10; ++iteration) {\n        weightedSum(next.x, 1.0, current.x, a, pk);\n        phi = next.fx = f(next.x, next.fxprime);\n        phiPrime = dot(next.fxprime, pk);\n        if (phi > phi0 + c1 * a * phiPrime0 || (iteration && phi >= phi_old)) {\n            return zoom(a0, a, phi_old);\n        }\n\n        if (Math.abs(phiPrime) <= -c2 * phiPrime0) {\n            return a;\n        }\n\n        if (phiPrime >= 0) {\n            return zoom(a, a0, phi);\n        }\n\n        phi_old = phi;\n        a0 = a;\n        a *= 2;\n    }\n\n    return a;\n}\n\nfunction conjugateGradient(f, initial, params) {\n    // allocate all memory up front here, keep out of the loop for perfomance\n    // reasons\n    let current = { x: initial.slice(), fx: 0, fxprime: initial.slice() };\n    let next = { x: initial.slice(), fx: 0, fxprime: initial.slice() };\n    const yk = initial.slice();\n    let pk;\n    let temp;\n    let a = 1;\n    let maxIterations;\n\n    params = params || {};\n    maxIterations = params.maxIterations || initial.length * 20;\n\n    current.fx = f(current.x, current.fxprime);\n    pk = current.fxprime.slice();\n    scale(pk, current.fxprime, -1);\n\n    for (let i = 0; i < maxIterations; ++i) {\n        a = wolfeLineSearch(f, pk, current, next, a);\n\n        // todo: history in wrong spot?\n        if (params.history) {\n            params.history.push({\n                x: current.x.slice(),\n                fx: current.fx,\n                fxprime: current.fxprime.slice(),\n                alpha: a,\n            });\n        }\n\n        if (!a) {\n            // faiiled to find point that satifies wolfe conditions.\n            // reset direction for next iteration\n            scale(pk, current.fxprime, -1);\n        } else {\n            // update direction using Polak–Ribiere CG method\n            weightedSum(yk, 1, next.fxprime, -1, current.fxprime);\n\n            const delta_k = dot(current.fxprime, current.fxprime);\n            const beta_k = Math.max(0, dot(yk, next.fxprime) / delta_k);\n\n            weightedSum(pk, beta_k, pk, -1, next.fxprime);\n\n            temp = current;\n            current = next;\n            next = temp;\n        }\n\n        if (norm2(current.fxprime) <= 1e-5) {\n            break;\n        }\n    }\n\n    if (params.history) {\n        params.history.push({\n            x: current.x.slice(),\n            fx: current.fx,\n            fxprime: current.fxprime.slice(),\n            alpha: a,\n        });\n    }\n\n    return current;\n}\n\n/**\n * given a list of set objects, and their corresponding overlaps\n * updates the (x, y, radius) attribute on each set such that their positions\n * roughly correspond to the desired overlaps\n * @param {readonly {sets: readonly string[]; size: number; weight?: number}[]} sets\n * @returns {{[setid: string]: {x: number, y: number, radius: number}}}\n */\nfunction venn(sets, parameters = {}) {\n  parameters.maxIterations = parameters.maxIterations || 500;\n\n  const initialLayout = parameters.initialLayout || bestInitialLayout;\n  const loss = parameters.lossFunction || lossFunction;\n\n  // add in missing pairwise areas as having 0 size\n  const areas = addMissingAreas(sets, parameters);\n\n  // initial layout is done greedily\n  const circles = initialLayout(areas, parameters);\n\n  // transform x/y coordinates to a vector to optimize\n  const setids = Object.keys(circles);\n  /** @type {number[]} */\n  const initial = [];\n  for (const setid of setids) {\n    initial.push(circles[setid].x);\n    initial.push(circles[setid].y);\n  }\n\n  // optimize initial layout from our loss function\n  const solution = nelderMead(\n    (values) => {\n      const current = {};\n      for (let i = 0; i < setids.length; ++i) {\n        const setid = setids[i];\n        current[setid] = {\n          x: values[2 * i],\n          y: values[2 * i + 1],\n          radius: circles[setid].radius,\n          // size : circles[setid].size\n        };\n      }\n      return loss(current, areas);\n    },\n    initial,\n    parameters\n  );\n\n  // transform solution vector back to x/y points\n  const positions = solution.x;\n  for (let i = 0; i < setids.length; ++i) {\n    const setid = setids[i];\n    circles[setid].x = positions[2 * i];\n    circles[setid].y = positions[2 * i + 1];\n  }\n\n  return circles;\n}\n\nconst SMALL = 1e-10;\n\n/**\n * Returns the distance necessary for two circles of radius r1 + r2 to\n * have the overlap area 'overlap'\n * @param {number} r1\n * @param {number} r2\n * @param {number} overlap\n * @returns {number}\n */\nfunction distanceFromIntersectArea(r1, r2, overlap) {\n  // handle complete overlapped circles\n  if (Math.min(r1, r2) * Math.min(r1, r2) * Math.PI <= overlap + SMALL) {\n    return Math.abs(r1 - r2);\n  }\n\n  return bisect((distance) => circleOverlap(r1, r2, distance) - overlap, 0, r1 + r2);\n}\n\n/**\n * Missing pair-wise intersection area data can cause problems:\n * treating as an unknown means that sets will be laid out overlapping,\n * which isn't what people expect. To reflect that we want disjoint sets\n * here, set the overlap to 0 for all missing pairwise set intersections\n * @param {ReadonlyArray<{sets: ReadonlyArray<string>, size: number}>} areas\n * @returns {ReadonlyArray<{sets: ReadonlyArray<string>, size: number}>}\n */\nfunction addMissingAreas(areas, parameters = {}) {\n  const distinct = parameters.distinct;\n  const r = areas.map((s) => Object.assign({}, s));\n\n  function toKey(arr) {\n    return arr.join(';');\n  }\n\n  if (distinct) {\n    // recreate the full ones by adding things up but just to level two since the rest doesn't matter\n    /** @types Map<string, number> */\n    const count = new Map();\n    for (const area of r) {\n      for (let i = 0; i < area.sets.length; i++) {\n        const si = String(area.sets[i]);\n        count.set(si, area.size + (count.get(si) || 0));\n        for (let j = i + 1; j < area.sets.length; j++) {\n          const sj = String(area.sets[j]);\n          const k1 = `${si};${sj}`;\n          const k2 = `${sj};${si}`;\n          count.set(k1, area.size + (count.get(k1) || 0));\n          count.set(k2, area.size + (count.get(k2) || 0));\n        }\n      }\n    }\n    for (const area of r) {\n      if (area.sets.length < 3) {\n        area.size = count.get(toKey(area.sets));\n      }\n    }\n  }\n\n  // two circle intersections that aren't defined\n  const ids = [];\n\n  /** @type {Set<string>} */\n  const pairs = new Set();\n  for (const area of r) {\n    if (area.sets.length === 1) {\n      ids.push(area.sets[0]);\n    } else if (area.sets.length === 2) {\n      const a = area.sets[0];\n      const b = area.sets[1];\n      pairs.add(toKey(area.sets));\n      pairs.add(toKey([b, a]));\n    }\n  }\n\n  ids.sort((a, b) => (a === b ? 0 : a < b ? -1 : +1));\n\n  for (let i = 0; i < ids.length; ++i) {\n    const a = ids[i];\n    for (let j = i + 1; j < ids.length; ++j) {\n      const b = ids[j];\n      if (!pairs.has(toKey([a, b]))) {\n        r.push({ sets: [a, b], size: 0 });\n      }\n    }\n  }\n  return r;\n}\n\n/**\n * Returns two matrices, one of the euclidean distances between the sets\n * and the other indicating if there are subset or disjoint set relationships\n * @param {ReadonlyArray<{sets: ReadonlyArray<number>}>} areas\n * @param {ReadonlyArray<{size: number}>} sets\n * @param {ReadonlyArray<number>} setids\n */\nfunction getDistanceMatrices(areas, sets, setids) {\n  // initialize an empty distance matrix between all the points\n  /**\n   * @type {number[][]}\n   */\n  const distances = zerosM(sets.length, sets.length);\n  /**\n   * @type {number[][]}\n   */\n  const constraints = zerosM(sets.length, sets.length);\n\n  // compute required distances between all the sets such that\n  // the areas match\n  areas\n    .filter((x) => x.sets.length === 2)\n    .forEach((current) => {\n      const left = setids[current.sets[0]];\n      const right = setids[current.sets[1]];\n      const r1 = Math.sqrt(sets[left].size / Math.PI);\n      const r2 = Math.sqrt(sets[right].size / Math.PI);\n      const distance = distanceFromIntersectArea(r1, r2, current.size);\n\n      distances[left][right] = distances[right][left] = distance;\n\n      // also update constraints to indicate if its a subset or disjoint\n      // relationship\n      let c = 0;\n      if (current.size + 1e-10 >= Math.min(sets[left].size, sets[right].size)) {\n        c = 1;\n      } else if (current.size <= 1e-10) {\n        c = -1;\n      }\n      constraints[left][right] = constraints[right][left] = c;\n    });\n\n  return { distances, constraints };\n}\n\n/// computes the gradient and loss simultaneously for our constrained MDS optimizer\nfunction constrainedMDSGradient(x, fxprime, distances, constraints) {\n  for (let i = 0; i < fxprime.length; ++i) {\n    fxprime[i] = 0;\n  }\n\n  let loss = 0;\n  for (let i = 0; i < distances.length; ++i) {\n    const xi = x[2 * i];\n    const yi = x[2 * i + 1];\n    for (let j = i + 1; j < distances.length; ++j) {\n      const xj = x[2 * j];\n      const yj = x[2 * j + 1];\n      const dij = distances[i][j];\n      const constraint = constraints[i][j];\n\n      const squaredDistance = (xj - xi) * (xj - xi) + (yj - yi) * (yj - yi);\n      const distance = Math.sqrt(squaredDistance);\n      const delta = squaredDistance - dij * dij;\n\n      if ((constraint > 0 && distance <= dij) || (constraint < 0 && distance >= dij)) {\n        continue;\n      }\n\n      loss += 2 * delta * delta;\n\n      fxprime[2 * i] += 4 * delta * (xi - xj);\n      fxprime[2 * i + 1] += 4 * delta * (yi - yj);\n\n      fxprime[2 * j] += 4 * delta * (xj - xi);\n      fxprime[2 * j + 1] += 4 * delta * (yj - yi);\n    }\n  }\n  return loss;\n}\n\n/**\n * takes the best working variant of either constrained MDS or greedy\n * @param {ReadonlyArray<{sets: ReadonlyArray<string>, size: number}>} areas\n */\nfunction bestInitialLayout(areas, params = {}) {\n  let initial = greedyLayout(areas, params);\n  const loss = params.lossFunction || lossFunction;\n\n  // greedylayout is sufficient for all 2/3 circle cases. try out\n  // constrained MDS for higher order problems, take its output\n  // if it outperforms. (greedy is aesthetically better on 2/3 circles\n  // since it axis aligns)\n  if (areas.length >= 8) {\n    const constrained = constrainedMDSLayout(areas, params);\n    const constrainedLoss = loss(constrained, areas);\n    const greedyLoss = loss(initial, areas);\n\n    if (constrainedLoss + 1e-8 < greedyLoss) {\n      initial = constrained;\n    }\n  }\n  return initial;\n}\n\n/**\n * use the constrained MDS variant to generate an initial layout\n * @param {ReadonlyArray<{sets: ReadonlyArray<string>, size: number}>} areas\n * @returns {{[key: string]: {x: number, y: number, radius: number}}}\n */\nfunction constrainedMDSLayout(areas, params = {}) {\n  const restarts = params.restarts || 10;\n\n  // bidirectionally map sets to a rowid  (so we can create a matrix)\n  const sets = [];\n  const setids = {};\n  for (const area of areas) {\n    if (area.sets.length === 1) {\n      setids[area.sets[0]] = sets.length;\n      sets.push(area);\n    }\n  }\n\n  let { distances, constraints } = getDistanceMatrices(areas, sets, setids);\n\n  // keep distances bounded, things get messed up otherwise.\n  // TODO: proper preconditioner?\n  const norm = norm2(distances.map(norm2)) / distances.length;\n  distances = distances.map((row) => row.map((value) => value / norm));\n\n  const obj = (x, fxprime) => constrainedMDSGradient(x, fxprime, distances, constraints);\n\n  let best = null;\n  for (let i = 0; i < restarts; ++i) {\n    const initial = zeros(distances.length * 2).map(Math.random);\n\n    const current = conjugateGradient(obj, initial, params);\n    if (!best || current.fx < best.fx) {\n      best = current;\n    }\n  }\n\n  const positions = best.x;\n\n  // translate rows back to (x,y,radius) coordinates\n  /** @type {{[key: string]: {x: number, y: number, radius: number}}} */\n  const circles = {};\n  for (let i = 0; i < sets.length; ++i) {\n    const set = sets[i];\n    circles[set.sets[0]] = {\n      x: positions[2 * i] * norm,\n      y: positions[2 * i + 1] * norm,\n      radius: Math.sqrt(set.size / Math.PI),\n    };\n  }\n\n  if (params.history) {\n    for (const h of params.history) {\n      scale(h.x, norm);\n    }\n  }\n  return circles;\n}\n\n/**\n * Lays out a Venn diagram greedily, going from most overlapped sets to\n * least overlapped, attempting to position each new set such that the\n * overlapping areas to already positioned sets are basically right\n * @param {ReadonlyArray<{size: number, sets: ReadonlyArray<string>}>} areas\n * @return {{[key: string]: {x: number, y: number, radius: number}}}\n */\nfunction greedyLayout(areas, params) {\n  const loss = params && params.lossFunction ? params.lossFunction : lossFunction;\n\n  // define a circle for each set\n  /** @type {{[key: string]: {x: number, y: number, radius: number}}} */\n  const circles = {};\n  /** @type {{[key: string]: {set: string, size: number, weight: number}[]}} */\n  const setOverlaps = {};\n  for (const area of areas) {\n    if (area.sets.length === 1) {\n      const set = area.sets[0];\n      circles[set] = {\n        x: 1e10,\n        y: 1e10,\n        rowid: circles.length,\n        size: area.size,\n        radius: Math.sqrt(area.size / Math.PI),\n      };\n      setOverlaps[set] = [];\n    }\n  }\n\n  areas = areas.filter((a) => a.sets.length === 2);\n\n  // map each set to a list of all the other sets that overlap it\n  for (const current of areas) {\n    let weight = current.weight != null ? current.weight : 1.0;\n    const left = current.sets[0];\n    const right = current.sets[1];\n\n    // completely overlapped circles shouldn't be positioned early here\n    if (current.size + SMALL >= Math.min(circles[left].size, circles[right].size)) {\n      weight = 0;\n    }\n\n    setOverlaps[left].push({ set: right, size: current.size, weight });\n    setOverlaps[right].push({ set: left, size: current.size, weight });\n  }\n\n  // get list of most overlapped sets\n  const mostOverlapped = [];\n  Object.keys(setOverlaps).forEach((set) => {\n    let size = 0;\n    for (let i = 0; i < setOverlaps[set].length; ++i) {\n      size += setOverlaps[set][i].size * setOverlaps[set][i].weight;\n    }\n\n    mostOverlapped.push({ set, size });\n  });\n\n  // sort by size desc\n  function sortOrder(a, b) {\n    return b.size - a.size;\n  }\n  mostOverlapped.sort(sortOrder);\n\n  // keep track of what sets have been laid out\n  const positioned = {};\n  function isPositioned(element) {\n    return element.set in positioned;\n  }\n\n  /**\n   * adds a point to the output\n   * @param {{x: number, y: number}} point\n   * @param {number} index\n   */\n  function positionSet(point, index) {\n    circles[index].x = point.x;\n    circles[index].y = point.y;\n    positioned[index] = true;\n  }\n\n  // add most overlapped set at (0,0)\n  positionSet({ x: 0, y: 0 }, mostOverlapped[0].set);\n\n  // get distances between all points. TODO, necessary?\n  // answer: probably not\n  // var distances = venn.getDistanceMatrices(circles, areas).distances;\n  for (let i = 1; i < mostOverlapped.length; ++i) {\n    const setIndex = mostOverlapped[i].set;\n    const overlap = setOverlaps[setIndex].filter(isPositioned);\n    const set = circles[setIndex];\n    overlap.sort(sortOrder);\n\n    if (overlap.length === 0) {\n      // this shouldn't happen anymore with addMissingAreas\n      throw 'ERROR: missing pairwise overlap information';\n    }\n\n    /** @type {{x: number, y: number}[]} */\n    const points = [];\n    for (var j = 0; j < overlap.length; ++j) {\n      // get appropriate distance from most overlapped already added set\n      const p1 = circles[overlap[j].set];\n      const d1 = distanceFromIntersectArea(set.radius, p1.radius, overlap[j].size);\n\n      // sample positions at 90 degrees for maximum aesthetics\n      points.push({ x: p1.x + d1, y: p1.y });\n      points.push({ x: p1.x - d1, y: p1.y });\n      points.push({ y: p1.y + d1, x: p1.x });\n      points.push({ y: p1.y - d1, x: p1.x });\n\n      // if we have at least 2 overlaps, then figure out where the\n      // set should be positioned analytically and try those too\n      for (let k = j + 1; k < overlap.length; ++k) {\n        const p2 = circles[overlap[k].set];\n        const d2 = distanceFromIntersectArea(set.radius, p2.radius, overlap[k].size);\n\n        const extraPoints = circleCircleIntersection(\n          { x: p1.x, y: p1.y, radius: d1 },\n          { x: p2.x, y: p2.y, radius: d2 }\n        );\n        points.push(...extraPoints);\n      }\n    }\n\n    // we have some candidate positions for the set, examine loss\n    // at each position to figure out where to put it at\n    let bestLoss = 1e50;\n    let bestPoint = points[0];\n    for (const point of points) {\n      circles[setIndex].x = point.x;\n      circles[setIndex].y = point.y;\n      const localLoss = loss(circles, areas);\n      if (localLoss < bestLoss) {\n        bestLoss = localLoss;\n        bestPoint = point;\n      }\n    }\n\n    positionSet(bestPoint, setIndex);\n  }\n\n  return circles;\n}\n\n/**\n * Given a bunch of sets, and the desired overlaps between these sets - computes\n * the distance from the actual overlaps to the desired overlaps. Note that\n * this method ignores overlaps of more than 2 circles\n * @param {{[key: string]: <{x: number, y: number, radius: number}>}} circles\n * @param {ReadonlyArray<{size: number, sets: ReadonlyArray<string>, weight?: number}>} overlaps\n * @returns {number}\n */\nfunction lossFunction(circles, overlaps) {\n  let output = 0;\n\n  for (const area of overlaps) {\n    if (area.sets.length === 1) {\n      continue;\n    }\n    /** @type {number} */\n    let overlap;\n    if (area.sets.length === 2) {\n      const left = circles[area.sets[0]];\n      const right = circles[area.sets[1]];\n      overlap = circleOverlap(left.radius, right.radius, distance(left, right));\n    } else {\n      overlap = intersectionArea(area.sets.map((d) => circles[d]));\n    }\n\n    const weight = area.weight != null ? area.weight : 1.0;\n    output += weight * (overlap - area.size) * (overlap - area.size);\n  }\n\n  return output;\n}\n\nfunction logRatioLossFunction(circles, overlaps) {\n  let output = 0;\n\n  for (const area of overlaps) {\n    if (area.sets.length === 1) {\n      continue;\n    }\n    /** @type {number} */\n    let overlap;\n    if (area.sets.length === 2) {\n      const left = circles[area.sets[0]];\n      const right = circles[area.sets[1]];\n      overlap = circleOverlap(left.radius, right.radius, distance(left, right));\n    } else {\n      overlap = intersectionArea(area.sets.map((d) => circles[d]));\n    }\n\n    const weight = area.weight != null ? area.weight : 1.0;\n    const differenceFromIdeal = Math.log((overlap + 1) / (area.size + 1));\n    output += weight * differenceFromIdeal * differenceFromIdeal;\n  }\n\n  return output;\n}\n\n/**\n * orientates a bunch of circles to point in orientation\n * @param {{x :number, y: number, radius: number}[]} circles\n * @param {number | undefined} orientation\n * @param {((a: {x :number, y: number, radius: number}, b: {x :number, y: number, radius: number}) => number) | undefined} orientationOrder\n */\nfunction orientateCircles(circles, orientation, orientationOrder) {\n  if (orientationOrder == null) {\n    circles.sort((a, b) => b.radius - a.radius);\n  } else {\n    circles.sort(orientationOrder);\n  }\n\n  // shift circles so largest circle is at (0, 0)\n  if (circles.length > 0) {\n    const largestX = circles[0].x;\n    const largestY = circles[0].y;\n\n    for (const circle of circles) {\n      circle.x -= largestX;\n      circle.y -= largestY;\n    }\n  }\n\n  if (circles.length === 2) {\n    // if the second circle is a subset of the first, arrange so that\n    // it is off to one side. hack for https://github.com/benfred/venn.js/issues/120\n    const dist = distance(circles[0], circles[1]);\n    if (dist < Math.abs(circles[1].radius - circles[0].radius)) {\n      circles[1].x = circles[0].x + circles[0].radius - circles[1].radius - 1e-10;\n      circles[1].y = circles[0].y;\n    }\n  }\n\n  // rotate circles so that second largest is at an angle of 'orientation'\n  // from largest\n  if (circles.length > 1) {\n    const rotation = Math.atan2(circles[1].x, circles[1].y) - orientation;\n    const c = Math.cos(rotation);\n    const s = Math.sin(rotation);\n\n    for (const circle of circles) {\n      const x = circle.x;\n      const y = circle.y;\n      circle.x = c * x - s * y;\n      circle.y = s * x + c * y;\n    }\n  }\n\n  // mirror solution if third solution is above plane specified by\n  // first two circles\n  if (circles.length > 2) {\n    let angle = Math.atan2(circles[2].x, circles[2].y) - orientation;\n    while (angle < 0) {\n      angle += 2 * Math.PI;\n    }\n    while (angle > 2 * Math.PI) {\n      angle -= 2 * Math.PI;\n    }\n    if (angle > Math.PI) {\n      const slope = circles[1].y / (1e-10 + circles[1].x);\n      for (const circle of circles) {\n        var d = (circle.x + slope * circle.y) / (1 + slope * slope);\n        circle.x = 2 * d - circle.x;\n        circle.y = 2 * d * slope - circle.y;\n      }\n    }\n  }\n}\n\n/**\n *\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @returns {{x: number, y: number, radius: number}[][]}\n */\nfunction disjointCluster(circles) {\n  // union-find clustering to get disjoint sets\n  circles.forEach((circle) => {\n    circle.parent = circle;\n  });\n\n  // path compression step in union find\n  function find(circle) {\n    if (circle.parent !== circle) {\n      circle.parent = find(circle.parent);\n    }\n    return circle.parent;\n  }\n\n  function union(x, y) {\n    const xRoot = find(x);\n    const yRoot = find(y);\n    xRoot.parent = yRoot;\n  }\n\n  // get the union of all overlapping sets\n  for (let i = 0; i < circles.length; ++i) {\n    for (let j = i + 1; j < circles.length; ++j) {\n      const maxDistance = circles[i].radius + circles[j].radius;\n      if (distance(circles[i], circles[j]) + 1e-10 < maxDistance) {\n        union(circles[j], circles[i]);\n      }\n    }\n  }\n\n  // find all the disjoint clusters and group them together\n  /** @type {Map<string, {x: number, y: number, radius: number}[]>} */\n  const disjointClusters = new Map();\n  for (let i = 0; i < circles.length; ++i) {\n    const setid = find(circles[i]).parent.setid;\n    if (!disjointClusters.has(setid)) {\n      disjointClusters.set(setid, []);\n    }\n    disjointClusters.get(setid).push(circles[i]);\n  }\n\n  // cleanup bookkeeping\n  circles.forEach((circle) => {\n    delete circle.parent;\n  });\n\n  // return in more usable form\n  return Array.from(disjointClusters.values());\n}\n\n/**\n * @param {ReadonlyArray<{x :number, y: number, radius: number}>} circles\n * @returns {{xRange: [number, number], yRange: [number, number]}}\n */\nfunction getBoundingBox(circles) {\n  const minMax = (d) => {\n    const hi = circles.reduce((acc, c) => Math.max(acc, c[d] + c.radius), Number.NEGATIVE_INFINITY);\n    const lo = circles.reduce((acc, c) => Math.min(acc, c[d] - c.radius), Number.POSITIVE_INFINITY);\n    return { max: hi, min: lo };\n  };\n  return { xRange: minMax('x'), yRange: minMax('y') };\n}\n\n/**\n *\n * @param {{[setid: string]: {x: number, y: number, radius: number}}} solution\n * @param {undefined | number} orientation\n * @param {((a: {x :number, y: number, radius: number}, b: {x :number, y: number, radius: number}) => number) | undefined} orientationOrder\n * @returns {{[setid: string]: {x: number, y: number, radius: number}}}\n */\nfunction normalizeSolution(solution, orientation, orientationOrder) {\n  if (orientation == null) {\n    orientation = Math.PI / 2;\n  }\n\n  // work with a list instead of a dictionary, and take a copy so we\n  // don't mutate input\n  let circles = fromObjectNotation(solution).map((d) => Object.assign({}, d));\n\n  // get all the disjoint clusters\n  const clusters = disjointCluster(circles);\n\n  // orientate all disjoint sets, get sizes\n  for (const cluster of clusters) {\n    orientateCircles(cluster, orientation, orientationOrder);\n    const bounds = getBoundingBox(cluster);\n    cluster.size = (bounds.xRange.max - bounds.xRange.min) * (bounds.yRange.max - bounds.yRange.min);\n    cluster.bounds = bounds;\n  }\n  clusters.sort((a, b) => b.size - a.size);\n\n  // orientate the largest at 0,0, and get the bounds\n  circles = clusters[0];\n  let returnBounds = circles.bounds;\n  const spacing = (returnBounds.xRange.max - returnBounds.xRange.min) / 50;\n\n  /**\n   * @param {ReadonlyArray<{x: number, y: number, radius: number, setid: string}>} cluster\n   * @param {boolean} right\n   * @param {boolean} bottom\n   */\n  function addCluster(cluster, right, bottom) {\n    if (!cluster) {\n      return;\n    }\n\n    const bounds = cluster.bounds;\n    /** @type {number} */\n    let xOffset;\n    /** @type {number} */\n    let yOffset;\n\n    if (right) {\n      xOffset = returnBounds.xRange.max - bounds.xRange.min + spacing;\n    } else {\n      xOffset = returnBounds.xRange.max - bounds.xRange.max;\n      const centreing =\n        (bounds.xRange.max - bounds.xRange.min) / 2 - (returnBounds.xRange.max - returnBounds.xRange.min) / 2;\n      if (centreing < 0) {\n        xOffset += centreing;\n      }\n    }\n\n    if (bottom) {\n      yOffset = returnBounds.yRange.max - bounds.yRange.min + spacing;\n    } else {\n      yOffset = returnBounds.yRange.max - bounds.yRange.max;\n      const centreing =\n        (bounds.yRange.max - bounds.yRange.min) / 2 - (returnBounds.yRange.max - returnBounds.yRange.min) / 2;\n      if (centreing < 0) {\n        yOffset += centreing;\n      }\n    }\n\n    for (const c of cluster) {\n      c.x += xOffset;\n      c.y += yOffset;\n      circles.push(c);\n    }\n  }\n\n  let index = 1;\n  while (index < clusters.length) {\n    addCluster(clusters[index], true, false);\n    addCluster(clusters[index + 1], false, true);\n    addCluster(clusters[index + 2], true, true);\n    index += 3;\n\n    // have one cluster (in top left). lay out next three relative\n    // to it in a grid\n    returnBounds = getBoundingBox(circles);\n  }\n\n  // convert back to solution form\n  return toObjectNotation(circles);\n}\n\n/**\n * Scales a solution from venn.venn or venn.greedyLayout such that it fits in\n * a rectangle of width/height - with padding around the borders. also\n * centers the diagram in the available space at the same time.\n * If the scale parameter is not null, this automatic scaling is ignored in favor of this custom one\n * @param {{[setid: string]: {x: number, y: number, radius: number}}} solution\n * @param {number} width\n * @param {number} height\n * @param {number} padding\n * @param {boolean} scaleToFit\n * @returns {{[setid: string]: {x: number, y: number, radius: number}}}\n */\nfunction scaleSolution(solution, width, height, padding, scaleToFit) {\n  const circles = fromObjectNotation(solution);\n\n  width -= 2 * padding;\n  height -= 2 * padding;\n\n  const { xRange, yRange } = getBoundingBox(circles);\n\n  if (xRange.max === xRange.min || yRange.max === yRange.min) {\n    console.log('not scaling solution: zero size detected');\n    return solution;\n  }\n\n  /** @type {number} */\n  let xScaling;\n  /** @type {number} */\n  let yScaling;\n  if (scaleToFit) {\n    const toScaleDiameter = Math.sqrt(scaleToFit / Math.PI) * 2;\n    xScaling = width / toScaleDiameter;\n    yScaling = height / toScaleDiameter;\n  } else {\n    xScaling = width / (xRange.max - xRange.min);\n    yScaling = height / (yRange.max - yRange.min);\n  }\n\n  const scaling = Math.min(yScaling, xScaling);\n  // while we're at it, center the diagram too\n  const xOffset = (width - (xRange.max - xRange.min) * scaling) / 2;\n  const yOffset = (height - (yRange.max - yRange.min) * scaling) / 2;\n\n  return toObjectNotation(\n    circles.map((circle) => ({\n      radius: scaling * circle.radius,\n      x: padding + xOffset + (circle.x - xRange.min) * scaling,\n      y: padding + yOffset + (circle.y - yRange.min) * scaling,\n      setid: circle.setid,\n    }))\n  );\n}\n\n/**\n * @param {readonly {x: number, y: number, radius: number, setid: string}[]} circles\n * @returns {{[setid: string]: {x: number, y: number, radius: number, setid: string}}}\n */\nfunction toObjectNotation(circles) {\n  /** @type {{[setid: string]: {x: number, y: number, radius: number, setid: string}}} */\n  const r = {};\n  for (const circle of circles) {\n    r[circle.setid] = circle;\n  }\n  return r;\n}\n/**\n * @param {{[setid: string]: {x: number, y: number, radius: number}}} solution\n * @returns {{x: number, y: number, radius: number, setid: string}[]}}\n */\nfunction fromObjectNotation(solution) {\n  const setids = Object.keys(solution);\n  return setids.map((id) => Object.assign(solution[id], { setid: id }));\n}\n\n/**\n * VennDiagram includes an optional `options` parameter containing the following option(s):\n *\n * `colourScheme: Array<String>`\n * A list of color values to be applied when coloring diagram circles.\n *\n * `symmetricalTextCentre: Boolean`\n * Whether to symmetrically center each circle's text horizontally and vertically.\n * Defaults to `false`.\n *\n * `textFill: String`\n * The color to be applied to the text within each circle.\n *\n * @param {object} options\n */\nfunction VennDiagram(options = {}) {\n  let useViewBox = false,\n    width = 600,\n    height = 350,\n    padding = 15,\n    duration = 1000,\n    orientation = Math.PI / 2,\n    normalize = true,\n    scaleToFit = null,\n    wrap = true,\n    styled = true,\n    fontSize = null,\n    orientationOrder = null,\n    distinct = false,\n    round = null,\n    symmetricalTextCentre = options && options.symmetricalTextCentre ? options.symmetricalTextCentre : false,\n    // mimic the behaviour of d3.scale.category10 from the previous\n    // version of d3\n    colourMap = {},\n    // so this is the same as d3.schemeCategory10, which is only defined in d3 4.0\n    // since we can support older versions of d3 as long as we don't force this,\n    // I'm hackily redefining below. TODO: remove this and change to d3.schemeCategory10\n    colourScheme =\n      options && options.colourScheme\n        ? options.colourScheme\n        : options && options.colorScheme\n          ? options.colorScheme\n          : [\n              '#1f77b4',\n              '#ff7f0e',\n              '#2ca02c',\n              '#d62728',\n              '#9467bd',\n              '#8c564b',\n              '#e377c2',\n              '#7f7f7f',\n              '#bcbd22',\n              '#17becf',\n            ],\n    colourIndex = 0,\n    colours = function (key) {\n      if (key in colourMap) {\n        return colourMap[key];\n      }\n      var ret = (colourMap[key] = colourScheme[colourIndex]);\n      colourIndex += 1;\n      if (colourIndex >= colourScheme.length) {\n        colourIndex = 0;\n      }\n      return ret;\n    },\n    layoutFunction = venn,\n    loss = lossFunction;\n\n  function chart(selection) {\n    let data = selection.datum();\n\n    // handle 0-sized sets by removing from input\n    const toRemove = new Set();\n    data.forEach((datum) => {\n      if (datum.size == 0 && datum.sets.length == 1) {\n        toRemove.add(datum.sets[0]);\n      }\n    });\n    data = data.filter((datum) => !datum.sets.some((set) => toRemove.has(set)));\n\n    let circles = {};\n    let textCentres = {};\n\n    if (data.length > 0) {\n      let solution = layoutFunction(data, { lossFunction: loss, distinct });\n\n      if (normalize) {\n        solution = normalizeSolution(solution, orientation, orientationOrder);\n      }\n\n      circles = scaleSolution(solution, width, height, padding, scaleToFit);\n      textCentres = computeTextCentres(circles, data, symmetricalTextCentre);\n    }\n\n    // Figure out the current label for each set. These can change\n    // and D3 won't necessarily update (fixes https://github.com/benfred/venn.js/issues/103)\n    const labels = {};\n    data.forEach((datum) => {\n      if (datum.label) {\n        labels[datum.sets] = datum.label;\n      }\n    });\n\n    function label(d) {\n      if (d.sets in labels) {\n        return labels[d.sets];\n      }\n      if (d.sets.length == 1) {\n        return '' + d.sets[0];\n      }\n    }\n\n    // create svg if not already existing\n    selection.selectAll('svg').data([circles]).enter().append('svg');\n\n    const svg = selection.select('svg');\n\n    if (useViewBox) {\n      svg.attr('viewBox', `0 0 ${width} ${height}`);\n    } else {\n      svg.attr('width', width).attr('height', height);\n    }\n\n    // to properly transition intersection areas, we need the\n    // previous circles locations. load from elements\n    const previous = {};\n    let hasPrevious = false;\n    svg.selectAll('.venn-area path').each(function (d) {\n      const path = this.getAttribute('d');\n      if (d.sets.length == 1 && path && !distinct) {\n        hasPrevious = true;\n        previous[d.sets[0]] = circleFromPath(path);\n      }\n    });\n    // interpolate intersection area paths between previous and\n    // current paths\n    function pathTween(d) {\n      return (t) => {\n        const c = d.sets.map((set) => {\n          let start = previous[set];\n          let end = circles[set];\n          if (!start) {\n            start = { x: width / 2, y: height / 2, radius: 1 };\n          }\n          if (!end) {\n            end = { x: width / 2, y: height / 2, radius: 1 };\n          }\n          return {\n            x: start.x * (1 - t) + end.x * t,\n            y: start.y * (1 - t) + end.y * t,\n            radius: start.radius * (1 - t) + end.radius * t,\n          };\n        });\n        return intersectionAreaPath(c, round);\n      };\n    }\n\n    // update data, joining on the set ids\n    const nodes = svg.selectAll('.venn-area').data(data, (d) => d.sets);\n\n    // create new nodes\n    const enter = nodes\n      .enter()\n      .append('g')\n      .attr(\n        'class',\n        (d) =>\n          `venn-area venn-${d.sets.length == 1 ? 'circle' : 'intersection'}${\n            d.colour || d.color ? ' venn-coloured' : ''\n          }`\n      )\n      .attr('data-venn-sets', (d) => d.sets.join('_'));\n\n    const enterPath = enter.append('path');\n    const enterText = enter\n      .append('text')\n      .attr('class', 'label')\n      .text((d) => label(d))\n      .attr('text-anchor', 'middle')\n      .attr('dy', '.35em')\n      .attr('x', width / 2)\n      .attr('y', height / 2);\n\n    // apply minimal style if wanted\n    if (styled) {\n      enterPath\n        .style('fill-opacity', '0')\n        .filter((d) => d.sets.length == 1)\n        .style('fill', (d) => (d.colour ? d.colour : d.color ? d.color : colours(d.sets)))\n        .style('fill-opacity', '.25');\n\n      enterText.style('fill', (d) => {\n        if (d.colour || d.color) {\n          return '#FFF';\n        }\n        if (options.textFill) {\n          return options.textFill;\n        }\n        return d.sets.length == 1 ? colours(d.sets) : '#444';\n      });\n    }\n\n    function asTransition(s) {\n      if (typeof s.transition === 'function') {\n        return s.transition('venn').duration(duration);\n      }\n      return s;\n    }\n\n    // update existing, using pathTween if necessary\n    let update = selection;\n    if (hasPrevious && typeof update.transition === 'function') {\n      update = asTransition(selection);\n      update.selectAll('path').attrTween('d', pathTween);\n    } else {\n      update.selectAll('path').attr('d', (d) => intersectionAreaPath(d.sets.map((set) => circles[set])), round);\n    }\n\n    const updateText = update\n      .selectAll('text')\n      .filter((d) => d.sets in textCentres)\n      .text((d) => label(d))\n      .attr('x', (d) => Math.floor(textCentres[d.sets].x))\n      .attr('y', (d) => Math.floor(textCentres[d.sets].y));\n\n    if (wrap) {\n      if (hasPrevious) {\n        // d3 4.0 uses 'on' for events on transitions,\n        // but d3 3.0 used 'each' instead. switch appropriately\n        if ('on' in updateText) {\n          updateText.on('end', wrapText(circles, label));\n        } else {\n          updateText.each('end', wrapText(circles, label));\n        }\n      } else {\n        updateText.each(wrapText(circles, label));\n      }\n    }\n\n    // remove old\n    const exit = asTransition(nodes.exit()).remove();\n    if (typeof nodes.transition === 'function') {\n      exit.selectAll('path').attrTween('d', pathTween);\n    }\n\n    const exitText = exit\n      .selectAll('text')\n      .attr('x', width / 2)\n      .attr('y', height / 2);\n\n    // if we've been passed a fontSize explicitly, use it to\n    // transition\n    if (fontSize !== null) {\n      enterText.style('font-size', '0px');\n      updateText.style('font-size', fontSize);\n      exitText.style('font-size', '0px');\n    }\n\n    return { circles, textCentres, nodes, enter, update, exit };\n  }\n\n  chart.wrap = function (_) {\n    if (!arguments.length) return wrap;\n    wrap = _;\n    return chart;\n  };\n\n  chart.useViewBox = function () {\n    useViewBox = true;\n    return chart;\n  };\n\n  chart.width = function (_) {\n    if (!arguments.length) return width;\n    width = _;\n    return chart;\n  };\n\n  chart.height = function (_) {\n    if (!arguments.length) return height;\n    height = _;\n    return chart;\n  };\n\n  chart.padding = function (_) {\n    if (!arguments.length) return padding;\n    padding = _;\n    return chart;\n  };\n\n  chart.distinct = function (_) {\n    if (!arguments.length) return distinct;\n    distinct = _;\n    return chart;\n  };\n\n  chart.colours = function (_) {\n    if (!arguments.length) return colours;\n    colours = _;\n    return chart;\n  };\n\n  chart.colors = function (_) {\n    if (!arguments.length) return colours;\n    colours = _;\n    return chart;\n  };\n\n  chart.fontSize = function (_) {\n    if (!arguments.length) return fontSize;\n    fontSize = _;\n    return chart;\n  };\n\n  chart.round = function (_) {\n    if (!arguments.length) return round;\n    round = _;\n    return chart;\n  };\n\n  chart.duration = function (_) {\n    if (!arguments.length) return duration;\n    duration = _;\n    return chart;\n  };\n\n  chart.layoutFunction = function (_) {\n    if (!arguments.length) return layoutFunction;\n    layoutFunction = _;\n    return chart;\n  };\n\n  chart.normalize = function (_) {\n    if (!arguments.length) return normalize;\n    normalize = _;\n    return chart;\n  };\n\n  chart.scaleToFit = function (_) {\n    if (!arguments.length) return scaleToFit;\n    scaleToFit = _;\n    return chart;\n  };\n\n  chart.styled = function (_) {\n    if (!arguments.length) return styled;\n    styled = _;\n    return chart;\n  };\n\n  chart.orientation = function (_) {\n    if (!arguments.length) return orientation;\n    orientation = _;\n    return chart;\n  };\n\n  chart.orientationOrder = function (_) {\n    if (!arguments.length) return orientationOrder;\n    orientationOrder = _;\n    return chart;\n  };\n\n  chart.lossFunction = function (_) {\n    if (!arguments.length) return loss;\n    loss = _ === 'default' ? lossFunction : _ === 'logRatio' ? logRatioLossFunction : _;\n    return chart;\n  };\n\n  return chart;\n}\n\n// sometimes text doesn't fit inside the circle, if thats the case lets wrap\n// the text here such that it fits\n// todo: looks like this might be merged into d3 (\n// https://github.com/mbostock/d3/issues/1642),\n// also worth checking out is\n// http://engineering.findthebest.com/wrapping-axis-labels-in-d3-js/\n// this seems to be one of those things that should be easy but isn't\nfunction wrapText(circles, labeller) {\n  return function (data) {\n    const text = this;\n    const width = circles[data.sets[0]].radius || 50;\n    const label = labeller(data) || '';\n\n    const words = label.split(/\\s+/).reverse();\n    const maxLines = 3;\n    const minChars = (label.length + words.length) / maxLines;\n\n    let word = words.pop();\n    let line = [word];\n    let lineNumber = 0;\n    const lineHeight = 1.1; // ems\n    text.textContent = null; // clear\n    const tspans = [];\n\n    function append(word) {\n      const tspan = text.ownerDocument.createElementNS(text.namespaceURI, 'tspan');\n      tspan.textContent = word;\n      tspans.push(tspan);\n      text.append(tspan);\n      return tspan;\n    }\n    let tspan = append(word);\n\n    while (true) {\n      word = words.pop();\n      if (!word) {\n        break;\n      }\n      line.push(word);\n      const joined = line.join(' ');\n      tspan.textContent = joined;\n      if (joined.length > minChars && tspan.getComputedTextLength() > width) {\n        line.pop();\n        tspan.textContent = line.join(' ');\n        line = [word];\n        tspan = append(word);\n        lineNumber++;\n      }\n    }\n\n    const initial = 0.35 - (lineNumber * lineHeight) / 2;\n    const x = text.getAttribute('x');\n    const y = text.getAttribute('y');\n    tspans.forEach((t, i) => {\n      t.setAttribute('x', x);\n      t.setAttribute('y', y);\n      t.setAttribute('dy', `${initial + i * lineHeight}em`);\n    });\n  };\n}\n\n/**\n *\n * @param {{x: number, y: number}} current\n * @param {ReadonlyArray<{x: number, y: number}>} interior\n * @param {ReadonlyArray<{x: number, y: number}>} exterior\n * @returns {number}\n */\nfunction circleMargin(current, interior, exterior) {\n  let margin = interior[0].radius - distance(interior[0], current);\n\n  for (let i = 1; i < interior.length; ++i) {\n    const m = interior[i].radius - distance(interior[i], current);\n    if (m <= margin) {\n      margin = m;\n    }\n  }\n\n  for (let i = 0; i < exterior.length; ++i) {\n    const m = distance(exterior[i], current) - exterior[i].radius;\n    if (m <= margin) {\n      margin = m;\n    }\n  }\n  return margin;\n}\n\n/**\n * compute the center of some circles by maximizing the margin of\n * the center point relative to the circles (interior) after subtracting\n * nearby circles (exterior)\n * @param {readonly {x: number, y: number, radius: number}[]} interior\n * @param {readonly {x: number, y: number, radius: number}[]} exterior\n * @param {boolean} symmetricalTextCentre\n * @returns {{x:number, y: number}}\n */\nfunction computeTextCentre(interior, exterior, symmetricalTextCentre) {\n  // get an initial estimate by sampling around the interior circles\n  // and taking the point with the biggest margin\n  /** @type {{x: number, y: number}[]} */\n  const points = [];\n  for (const c of interior) {\n    points.push({ x: c.x, y: c.y });\n    points.push({ x: c.x + c.radius / 2, y: c.y });\n    points.push({ x: c.x - c.radius / 2, y: c.y });\n    points.push({ x: c.x, y: c.y + c.radius / 2 });\n    points.push({ x: c.x, y: c.y - c.radius / 2 });\n  }\n\n  let initial = points[0];\n  let margin = circleMargin(points[0], interior, exterior);\n\n  for (let i = 1; i < points.length; ++i) {\n    const m = circleMargin(points[i], interior, exterior);\n    if (m >= margin) {\n      initial = points[i];\n      margin = m;\n    }\n  }\n\n  // maximize the margin numerically\n  const solution = nelderMead(\n    (p) => -1 * circleMargin({ x: p[0], y: p[1] }, interior, exterior),\n    [initial.x, initial.y],\n    { maxIterations: 500, minErrorDelta: 1e-10 }\n  ).x;\n\n  const ret = { x: symmetricalTextCentre ? 0 : solution[0], y: solution[1] };\n\n  // check solution, fallback as needed (happens if fully overlapped\n  // etc)\n  let valid = true;\n  for (const i of interior) {\n    if (distance(ret, i) > i.radius) {\n      valid = false;\n      break;\n    }\n  }\n\n  for (const e of exterior) {\n    if (distance(ret, e) < e.radius) {\n      valid = false;\n      break;\n    }\n  }\n  if (valid) {\n    return ret;\n  }\n\n  if (interior.length == 1) {\n    return { x: interior[0].x, y: interior[0].y };\n  }\n  const areaStats = {};\n  intersectionArea(interior, areaStats);\n\n  if (areaStats.arcs.length === 0) {\n    return { x: 0, y: -1000, disjoint: true };\n  }\n  if (areaStats.arcs.length == 1) {\n    return { x: areaStats.arcs[0].circle.x, y: areaStats.arcs[0].circle.y };\n  }\n  if (exterior.length) {\n    // try again without other circles\n    return computeTextCentre(interior, []);\n  }\n  // take average of all the points in the intersection\n  // polygon. this should basically never happen\n  // and has some issues:\n  // https://github.com/benfred/venn.js/issues/48#issuecomment-146069777\n  return getCenter(areaStats.arcs.map((a) => a.p1));\n}\n\n// given a dictionary of {setid : circle}, returns\n// a dictionary of setid to list of circles that completely overlap it\nfunction getOverlappingCircles(circles) {\n  const ret = {};\n  const circleids = Object.keys(circles);\n  for (const circleid of circleids) {\n    ret[circleid] = [];\n  }\n  for (let i = 0; i < circleids.length; i++) {\n    const ci = circleids[i];\n    const a = circles[ci];\n    for (let j = i + 1; j < circleids.length; ++j) {\n      const cj = circleids[j];\n      const b = circles[cj];\n      const d = distance(a, b);\n\n      if (d + b.radius <= a.radius + 1e-10) {\n        ret[cj].push(ci);\n      } else if (d + a.radius <= b.radius + 1e-10) {\n        ret[ci].push(cj);\n      }\n    }\n  }\n  return ret;\n}\n\nfunction computeTextCentres(circles, areas, symmetricalTextCentre) {\n  const ret = {};\n  const overlapped = getOverlappingCircles(circles);\n  for (let i = 0; i < areas.length; ++i) {\n    const area = areas[i].sets;\n    const areaids = {};\n    const exclude = {};\n\n    for (let j = 0; j < area.length; ++j) {\n      areaids[area[j]] = true;\n      const overlaps = overlapped[area[j]];\n      // keep track of any circles that overlap this area,\n      // and don't consider for purposes of computing the text\n      // centre\n      for (let k = 0; k < overlaps.length; ++k) {\n        exclude[overlaps[k]] = true;\n      }\n    }\n\n    const interior = [];\n    const exterior = [];\n    for (let setid in circles) {\n      if (setid in areaids) {\n        interior.push(circles[setid]);\n      } else if (!(setid in exclude)) {\n        exterior.push(circles[setid]);\n      }\n    }\n    const centre = computeTextCentre(interior, exterior, symmetricalTextCentre);\n    ret[area] = centre;\n    if (centre.disjoint && areas[i].size > 0) {\n      console.log('WARNING: area ' + area + ' not represented on screen');\n    }\n  }\n  return ret;\n}\n\n// sorts all areas in the venn diagram, so that\n// a particular area is on top (relativeTo) - and\n// all other areas are so that the smallest areas are on top\nfunction sortAreas(div, relativeTo) {\n  // figure out sets that are completely overlapped by relativeTo\n  const overlaps = getOverlappingCircles(div.selectAll('svg').datum());\n  const exclude = new Set();\n  for (const check of relativeTo.sets) {\n    for (let setid in overlaps) {\n      const overlap = overlaps[setid];\n      for (let j = 0; j < overlap.length; ++j) {\n        if (overlap[j] == check) {\n          exclude.add(setid);\n          break;\n        }\n      }\n    }\n  }\n\n  // checks that all sets are in exclude;\n  function shouldExclude(sets) {\n    return sets.every((set) => !exclude.has(set));\n  }\n\n  // need to sort div's so that Z order is correct\n  div.selectAll('g').sort((a, b) => {\n    // highest order set intersections first\n    if (a.sets.length != b.sets.length) {\n      return a.sets.length - b.sets.length;\n    }\n\n    if (a == relativeTo) {\n      return shouldExclude(b.sets) ? -1 : 1;\n    }\n    if (b == relativeTo) {\n      return shouldExclude(a.sets) ? 1 : -1;\n    }\n\n    // finally by size\n    return b.size - a.size;\n  });\n}\n\n/**\n * @param {number} x\n * @param {number} y\n * @param {number} r\n * @returns {string}\n */\nfunction circlePath(x, y, r) {\n  const ret = [];\n  ret.push('\\nM', x, y);\n  ret.push('\\nm', -r, 0);\n  ret.push('\\na', r, r, 0, 1, 0, r * 2, 0);\n  ret.push('\\na', r, r, 0, 1, 0, -r * 2, 0);\n  return ret.join(' ');\n}\n\n/**\n * inverse of the circlePath function, returns a circle object from an svg path\n * @param {string} path\n * @returns {{x: number, y: number, radius: number}}\n */\nfunction circleFromPath(path) {\n  const tokens = path.split(' ');\n  return { x: Number.parseFloat(tokens[1]), y: Number.parseFloat(tokens[2]), radius: -Number.parseFloat(tokens[4]) };\n}\n\nfunction intersectionAreaArcs(circles) {\n  if (circles.length === 0) {\n    return [];\n  }\n  const stats = {};\n  intersectionArea(circles, stats);\n  return stats.arcs;\n}\n\nfunction arcsToPath(arcs, round) {\n  if (arcs.length === 0) {\n    return 'M 0 0';\n  }\n  const rFactor = Math.pow(10, round || 0);\n  const r = round != null ? (v) => Math.round(v * rFactor) / rFactor : (v) => v;\n  if (arcs.length == 1) {\n    const circle = arcs[0].circle;\n    return circlePath(r(circle.x), r(circle.y), r(circle.radius));\n  }\n  // draw path around arcs\n  const ret = ['\\nM', r(arcs[0].p2.x), r(arcs[0].p2.y)];\n  for (const arc of arcs) {\n    const radius = r(arc.circle.radius);\n    ret.push('\\nA', radius, radius, 0, arc.large ? 1 : 0, arc.sweep ? 1 : 0, r(arc.p1.x), r(arc.p1.y));\n  }\n  return ret.join(' ');\n}\n\n/**\n * returns a svg path of the intersection area of a bunch of circles\n * @param {ReadonlyArray<{x: number, y: number, radius: number}>} circles\n * @returns {string}\n */\nfunction intersectionAreaPath(circles, round) {\n  return arcsToPath(intersectionAreaArcs(circles), round);\n}\n\nfunction layout(data, options = {}) {\n  const {\n    lossFunction: loss,\n    layoutFunction: layout = venn,\n    normalize = true,\n    orientation = Math.PI / 2,\n    orientationOrder,\n    width = 600,\n    height = 350,\n    padding = 15,\n    scaleToFit = false,\n    symmetricalTextCentre = false,\n    distinct,\n    round = 2,\n  } = options;\n\n  let solution = layout(data, {\n    lossFunction: loss === 'default' || !loss ? lossFunction : loss === 'logRatio' ? logRatioLossFunction : loss,\n    distinct,\n  });\n\n  if (normalize) {\n    solution = normalizeSolution(solution, orientation, orientationOrder);\n  }\n\n  const circles = scaleSolution(solution, width, height, padding, scaleToFit);\n  const textCentres = computeTextCentres(circles, data, symmetricalTextCentre);\n\n  const circleLookup = new Map(\n    Object.keys(circles).map((set) => [\n      set,\n      {\n        set,\n        x: circles[set].x,\n        y: circles[set].y,\n        radius: circles[set].radius,\n      },\n    ])\n  );\n  const helpers = data.map((area) => {\n    const circles = area.sets.map((s) => circleLookup.get(s));\n    const arcs = intersectionAreaArcs(circles);\n    const path = arcsToPath(arcs, round);\n    return { circles, arcs, path, area, has: new Set(area.sets) };\n  });\n\n  function genDistinctPath(sets) {\n    let r = '';\n    for (const e of helpers) {\n      if (e.has.size > sets.length && sets.every((s) => e.has.has(s))) {\n        r += ' ' + e.path;\n      }\n    }\n    return r;\n  }\n\n  return helpers.map(({ circles, arcs, path, area }) => {\n    return {\n      data: area,\n      text: textCentres[area.sets],\n      circles,\n      arcs,\n      path,\n      distinctPath: path + genDistinctPath(area.sets),\n    };\n  });\n}\n\nexport { VennDiagram, bestInitialLayout, circleArea, circleCircleIntersection, circleFromPath, circleOverlap, circlePath, computeTextCentre, computeTextCentres, disjointCluster, distance, distanceFromIntersectArea, greedyLayout, intersectionArea, intersectionAreaPath, layout, logRatioLossFunction, lossFunction, normalizeSolution, scaleSolution, sortAreas, venn, wrapText };\n","import {\n  selectSvgElement\n} from \"./chunk-426QAEUC.mjs\";\nimport {\n  cleanAndMerge\n} from \"./chunk-5PVQY5BW.mjs\";\nimport {\n  clear,\n  configureSvgSize,\n  defaultConfig_default,\n  getAccDescription,\n  getAccTitle,\n  getConfig,\n  getDiagramTitle,\n  setAccDescription,\n  setAccTitle,\n  setDiagramTitle\n} from \"./chunk-ICPOFSXX.mjs\";\nimport {\n  __name\n} from \"./chunk-AGHRB4JF.mjs\";\n\n// src/diagrams/venn/parser/venn.jison\nvar parser = (function() {\n  var o = /* @__PURE__ */ __name(function(k, v, o2, l) {\n    for (o2 = o2 || {}, l = k.length; l--; o2[k[l]] = v) ;\n    return o2;\n  }, \"o\"), $V0 = [5, 8], $V1 = [7, 8, 11, 12, 17, 19, 22, 24], $V2 = [1, 17], $V3 = [1, 18], $V4 = [7, 8, 11, 12, 14, 15, 16, 17, 19, 20, 21, 22, 24, 27], $V5 = [1, 31], $V6 = [1, 39], $V7 = [7, 8, 11, 12, 17, 19, 22, 24, 27], $V8 = [1, 57], $V9 = [1, 56], $Va = [1, 58], $Vb = [1, 59], $Vc = [1, 60], $Vd = [7, 8, 11, 12, 16, 17, 19, 20, 22, 24, 27, 31, 32, 33];\n  var parser2 = {\n    trace: /* @__PURE__ */ __name(function trace() {\n    }, \"trace\"),\n    yy: {},\n    symbols_: { \"error\": 2, \"start\": 3, \"optNewlines\": 4, \"VENN\": 5, \"document\": 6, \"EOF\": 7, \"NEWLINE\": 8, \"line\": 9, \"statement\": 10, \"TITLE\": 11, \"SET\": 12, \"identifier\": 13, \"BRACKET_LABEL\": 14, \"COLON\": 15, \"NUMERIC\": 16, \"UNION\": 17, \"identifierList\": 18, \"TEXT\": 19, \"IDENTIFIER\": 20, \"STRING\": 21, \"INDENT_TEXT\": 22, \"indentedTextTail\": 23, \"STYLE\": 24, \"stylesOpt\": 25, \"styleField\": 26, \"COMMA\": 27, \"styleValue\": 28, \"valueTokens\": 29, \"valueToken\": 30, \"HEXCOLOR\": 31, \"RGBCOLOR\": 32, \"RGBACOLOR\": 33, \"$accept\": 0, \"$end\": 1 },\n    terminals_: { 2: \"error\", 5: \"VENN\", 7: \"EOF\", 8: \"NEWLINE\", 11: \"TITLE\", 12: \"SET\", 14: \"BRACKET_LABEL\", 15: \"COLON\", 16: \"NUMERIC\", 17: \"UNION\", 19: \"TEXT\", 20: \"IDENTIFIER\", 21: \"STRING\", 22: \"INDENT_TEXT\", 24: \"STYLE\", 27: \"COMMA\", 31: \"HEXCOLOR\", 32: \"RGBCOLOR\", 33: \"RGBACOLOR\" },\n    productions_: [0, [3, 4], [4, 0], [4, 2], [6, 0], [6, 2], [9, 1], [9, 1], [10, 1], [10, 2], [10, 3], [10, 4], [10, 5], [10, 2], [10, 3], [10, 4], [10, 5], [10, 3], [10, 3], [10, 3], [10, 4], [10, 4], [10, 2], [10, 3], [23, 1], [23, 1], [23, 1], [23, 2], [23, 2], [25, 1], [25, 3], [26, 3], [28, 1], [28, 1], [29, 1], [29, 2], [30, 1], [30, 1], [30, 1], [30, 1], [30, 1], [18, 1], [18, 3], [13, 1], [13, 1]],\n    performAction: /* @__PURE__ */ __name(function anonymous(yytext, yyleng, yylineno, yy, yystate, $$, _$) {\n      var $0 = $$.length - 1;\n      switch (yystate) {\n        case 1:\n          return $$[$0 - 1];\n          break;\n        case 2:\n        case 3:\n        case 4:\n          this.$ = [];\n          break;\n        case 5:\n          $$[$0 - 1].push($$[$0]);\n          this.$ = $$[$0 - 1];\n          break;\n        case 6:\n          this.$ = [];\n          break;\n        case 7:\n        case 22:\n        case 32:\n        case 36:\n        case 37:\n        case 38:\n        case 39:\n        case 40:\n          this.$ = $$[$0];\n          break;\n        case 8:\n          yy.setDiagramTitle($$[$0].substr(6));\n          this.$ = $$[$0].substr(6);\n          break;\n        case 9:\n          yy.addSubsetData([$$[$0]], void 0, void 0);\n          if (yy.setIndentMode) {\n            yy.setIndentMode(true);\n          }\n          break;\n        case 10:\n          yy.addSubsetData([$$[$0 - 1]], $$[$0], void 0);\n          if (yy.setIndentMode) {\n            yy.setIndentMode(true);\n          }\n          break;\n        case 11:\n          yy.addSubsetData([$$[$0 - 2]], void 0, parseFloat($$[$0]));\n          if (yy.setIndentMode) {\n            yy.setIndentMode(true);\n          }\n          break;\n        case 12:\n          yy.addSubsetData([$$[$0 - 3]], $$[$0 - 2], parseFloat($$[$0]));\n          if (yy.setIndentMode) {\n            yy.setIndentMode(true);\n          }\n          break;\n        case 13:\n          if ($$[$0].length < 2) {\n            throw new Error(\"union requires multiple identifiers\");\n          }\n          if (yy.validateUnionIdentifiers) {\n            yy.validateUnionIdentifiers($$[$0]);\n          }\n          yy.addSubsetData($$[$0], void 0, void 0);\n          if (yy.setIndentMode) {\n            yy.setIndentMode(true);\n          }\n          break;\n        case 14:\n          if ($$[$0 - 1].length < 2) {\n            throw new Error(\"union requires multiple identifiers\");\n          }\n          if (yy.validateUnionIdentifiers) {\n            yy.validateUnionIdentifiers($$[$0 - 1]);\n          }\n          yy.addSubsetData($$[$0 - 1], $$[$0], void 0);\n          if (yy.setIndentMode) {\n            yy.setIndentMode(true);\n          }\n          break;\n        case 15:\n          if ($$[$0 - 2].length < 2) {\n            throw new Error(\"union requires multiple identifiers\");\n          }\n          if (yy.validateUnionIdentifiers) {\n            yy.validateUnionIdentifiers($$[$0 - 2]);\n          }\n          yy.addSubsetData($$[$0 - 2], void 0, parseFloat($$[$0]));\n          if (yy.setIndentMode) {\n            yy.setIndentMode(true);\n          }\n          break;\n        case 16:\n          if ($$[$0 - 3].length < 2) {\n            throw new Error(\"union requires multiple identifiers\");\n          }\n          if (yy.validateUnionIdentifiers) {\n            yy.validateUnionIdentifiers($$[$0 - 3]);\n          }\n          yy.addSubsetData($$[$0 - 3], $$[$0 - 2], parseFloat($$[$0]));\n          if (yy.setIndentMode) {\n            yy.setIndentMode(true);\n          }\n          break;\n        case 17:\n        case 18:\n        case 19:\n          yy.addTextData($$[$0 - 1], $$[$0], void 0);\n          break;\n        case 20:\n        case 21:\n          yy.addTextData($$[$0 - 2], $$[$0 - 1], $$[$0]);\n          break;\n        case 23:\n          yy.addStyleData($$[$0 - 1], $$[$0]);\n          break;\n        case 24:\n        case 25:\n        case 26:\n          var cs = yy.getCurrentSets();\n          if (!cs) throw new Error(\"text requires set\");\n          yy.addTextData(cs, $$[$0], void 0);\n          break;\n        case 27:\n        case 28:\n          var cs = yy.getCurrentSets();\n          if (!cs) throw new Error(\"text requires set\");\n          yy.addTextData(cs, $$[$0 - 1], $$[$0]);\n          break;\n        case 29:\n        case 41:\n          this.$ = [$$[$0]];\n          break;\n        case 30:\n        case 42:\n          this.$ = [...$$[$0 - 2], $$[$0]];\n          break;\n        case 31:\n          this.$ = [$$[$0 - 2], $$[$0]];\n          break;\n        case 33:\n          this.$ = $$[$0].join(\" \");\n          break;\n        case 34:\n          this.$ = [$$[$0]];\n          break;\n        case 35:\n          $$[$0 - 1].push($$[$0]);\n          this.$ = $$[$0 - 1];\n          break;\n        case 43:\n        case 44:\n          this.$ = $$[$0];\n          break;\n      }\n    }, \"anonymous\"),\n    table: [o($V0, [2, 2], { 3: 1, 4: 2 }), { 1: [3] }, { 5: [1, 3], 8: [1, 4] }, o($V1, [2, 4], { 6: 5 }), o($V0, [2, 3]), { 7: [1, 6], 8: [1, 8], 9: 7, 10: 9, 11: [1, 10], 12: [1, 11], 17: [1, 12], 19: [1, 13], 22: [1, 14], 24: [1, 15] }, { 1: [2, 1] }, o($V1, [2, 5]), o($V1, [2, 6]), o($V1, [2, 7]), o($V1, [2, 8]), { 13: 16, 20: $V2, 21: $V3 }, { 13: 20, 18: 19, 20: $V2, 21: $V3 }, { 13: 20, 18: 21, 20: $V2, 21: $V3 }, { 16: [1, 25], 20: [1, 23], 21: [1, 24], 23: 22 }, { 13: 20, 18: 26, 20: $V2, 21: $V3 }, o($V1, [2, 9], { 14: [1, 27], 15: [1, 28] }), o($V4, [2, 43]), o($V4, [2, 44]), o($V1, [2, 13], { 14: [1, 29], 15: [1, 30], 27: $V5 }), o($V4, [2, 41]), { 16: [1, 34], 20: [1, 32], 21: [1, 33], 27: $V5 }, o($V1, [2, 22]), o($V1, [2, 24], { 14: [1, 35] }), o($V1, [2, 25], { 14: [1, 36] }), o($V1, [2, 26]), { 20: $V6, 25: 37, 26: 38, 27: $V5 }, o($V1, [2, 10], { 15: [1, 40] }), { 16: [1, 41] }, o($V1, [2, 14], { 15: [1, 42] }), { 16: [1, 43] }, { 13: 44, 20: $V2, 21: $V3 }, o($V1, [2, 17], { 14: [1, 45] }), o($V1, [2, 18], { 14: [1, 46] }), o($V1, [2, 19]), o($V1, [2, 27]), o($V1, [2, 28]), o($V1, [2, 23], { 27: [1, 47] }), o($V7, [2, 29]), { 15: [1, 48] }, { 16: [1, 49] }, o($V1, [2, 11]), { 16: [1, 50] }, o($V1, [2, 15]), o($V4, [2, 42]), o($V1, [2, 20]), o($V1, [2, 21]), { 20: $V6, 26: 51 }, { 16: $V8, 20: $V9, 21: [1, 53], 28: 52, 29: 54, 30: 55, 31: $Va, 32: $Vb, 33: $Vc }, o($V1, [2, 12]), o($V1, [2, 16]), o($V7, [2, 30]), o($V7, [2, 31]), o($V7, [2, 32]), o($V7, [2, 33], { 30: 61, 16: $V8, 20: $V9, 31: $Va, 32: $Vb, 33: $Vc }), o($Vd, [2, 34]), o($Vd, [2, 36]), o($Vd, [2, 37]), o($Vd, [2, 38]), o($Vd, [2, 39]), o($Vd, [2, 40]), o($Vd, [2, 35])],\n    defaultActions: { 6: [2, 1] },\n    parseError: /* @__PURE__ */ __name(function parseError(str, hash) {\n      if (hash.recoverable) {\n        this.trace(str);\n      } else {\n        var error = new Error(str);\n        error.hash = hash;\n        throw error;\n      }\n    }, \"parseError\"),\n    parse: /* @__PURE__ */ __name(function parse(input) {\n      var self = this, stack = [0], tstack = [], vstack = [null], lstack = [], table = this.table, yytext = \"\", yylineno = 0, yyleng = 0, recovering = 0, TERROR = 2, EOF = 1;\n      var args = lstack.slice.call(arguments, 1);\n      var lexer2 = Object.create(this.lexer);\n      var sharedState = { yy: {} };\n      for (var k in this.yy) {\n        if (Object.prototype.hasOwnProperty.call(this.yy, k)) {\n          sharedState.yy[k] = this.yy[k];\n        }\n      }\n      lexer2.setInput(input, sharedState.yy);\n      sharedState.yy.lexer = lexer2;\n      sharedState.yy.parser = this;\n      if (typeof lexer2.yylloc == \"undefined\") {\n        lexer2.yylloc = {};\n      }\n      var yyloc = lexer2.yylloc;\n      lstack.push(yyloc);\n      var ranges = lexer2.options && lexer2.options.ranges;\n      if (typeof sharedState.yy.parseError === \"function\") {\n        this.parseError = sharedState.yy.parseError;\n      } else {\n        this.parseError = Object.getPrototypeOf(this).parseError;\n      }\n      function popStack(n) {\n        stack.length = stack.length - 2 * n;\n        vstack.length = vstack.length - n;\n        lstack.length = lstack.length - n;\n      }\n      __name(popStack, \"popStack\");\n      function lex() {\n        var token;\n        token = tstack.pop() || lexer2.lex() || EOF;\n        if (typeof token !== \"number\") {\n          if (token instanceof Array) {\n            tstack = token;\n            token = tstack.pop();\n          }\n          token = self.symbols_[token] || token;\n        }\n        return token;\n      }\n      __name(lex, \"lex\");\n      var symbol, preErrorSymbol, state, action, a, r, yyval = {}, p, len, newState, expected;\n      while (true) {\n        state = stack[stack.length - 1];\n        if (this.defaultActions[state]) {\n          action = this.defaultActions[state];\n        } else {\n          if (symbol === null || typeof symbol == \"undefined\") {\n            symbol = lex();\n          }\n          action = table[state] && table[state][symbol];\n        }\n        if (typeof action === \"undefined\" || !action.length || !action[0]) {\n          var errStr = \"\";\n          expected = [];\n          for (p in table[state]) {\n            if (this.terminals_[p] && p > TERROR) {\n              expected.push(\"'\" + this.terminals_[p] + \"'\");\n            }\n          }\n          if (lexer2.showPosition) {\n            errStr = \"Parse error on line \" + (yylineno + 1) + \":\\n\" + lexer2.showPosition() + \"\\nExpecting \" + expected.join(\", \") + \", got '\" + (this.terminals_[symbol] || symbol) + \"'\";\n          } else {\n            errStr = \"Parse error on line \" + (yylineno + 1) + \": Unexpected \" + (symbol == EOF ? \"end of input\" : \"'\" + (this.terminals_[symbol] || symbol) + \"'\");\n          }\n          this.parseError(errStr, {\n            text: lexer2.match,\n            token: this.terminals_[symbol] || symbol,\n            line: lexer2.yylineno,\n            loc: yyloc,\n            expected\n          });\n        }\n        if (action[0] instanceof Array && action.length > 1) {\n          throw new Error(\"Parse Error: multiple actions possible at state: \" + state + \", token: \" + symbol);\n        }\n        switch (action[0]) {\n          case 1:\n            stack.push(symbol);\n            vstack.push(lexer2.yytext);\n            lstack.push(lexer2.yylloc);\n            stack.push(action[1]);\n            symbol = null;\n            if (!preErrorSymbol) {\n              yyleng = lexer2.yyleng;\n              yytext = lexer2.yytext;\n              yylineno = lexer2.yylineno;\n              yyloc = lexer2.yylloc;\n              if (recovering > 0) {\n                recovering--;\n              }\n            } else {\n              symbol = preErrorSymbol;\n              preErrorSymbol = null;\n            }\n            break;\n          case 2:\n            len = this.productions_[action[1]][1];\n            yyval.$ = vstack[vstack.length - len];\n            yyval._$ = {\n              first_line: lstack[lstack.length - (len || 1)].first_line,\n              last_line: lstack[lstack.length - 1].last_line,\n              first_column: lstack[lstack.length - (len || 1)].first_column,\n              last_column: lstack[lstack.length - 1].last_column\n            };\n            if (ranges) {\n              yyval._$.range = [\n                lstack[lstack.length - (len || 1)].range[0],\n                lstack[lstack.length - 1].range[1]\n              ];\n            }\n            r = this.performAction.apply(yyval, [\n              yytext,\n              yyleng,\n              yylineno,\n              sharedState.yy,\n              action[1],\n              vstack,\n              lstack\n            ].concat(args));\n            if (typeof r !== \"undefined\") {\n              return r;\n            }\n            if (len) {\n              stack = stack.slice(0, -1 * len * 2);\n              vstack = vstack.slice(0, -1 * len);\n              lstack = lstack.slice(0, -1 * len);\n            }\n            stack.push(this.productions_[action[1]][0]);\n            vstack.push(yyval.$);\n            lstack.push(yyval._$);\n            newState = table[stack[stack.length - 2]][stack[stack.length - 1]];\n            stack.push(newState);\n            break;\n          case 3:\n            return true;\n        }\n      }\n      return true;\n    }, \"parse\")\n  };\n  var lexer = /* @__PURE__ */ (function() {\n    var lexer2 = {\n      EOF: 1,\n      parseError: /* @__PURE__ */ __name(function parseError(str, hash) {\n        if (this.yy.parser) {\n          this.yy.parser.parseError(str, hash);\n        } else {\n          throw new Error(str);\n        }\n      }, \"parseError\"),\n      // resets the lexer, sets new input\n      setInput: /* @__PURE__ */ __name(function(input, yy) {\n        this.yy = yy || this.yy || {};\n        this._input = input;\n        this._more = this._backtrack = this.done = false;\n        this.yylineno = this.yyleng = 0;\n        this.yytext = this.matched = this.match = \"\";\n        this.conditionStack = [\"INITIAL\"];\n        this.yylloc = {\n          first_line: 1,\n          first_column: 0,\n          last_line: 1,\n          last_column: 0\n        };\n        if (this.options.ranges) {\n          this.yylloc.range = [0, 0];\n        }\n        this.offset = 0;\n        return this;\n      }, \"setInput\"),\n      // consumes and returns one char from the input\n      input: /* @__PURE__ */ __name(function() {\n        var ch = this._input[0];\n        this.yytext += ch;\n        this.yyleng++;\n        this.offset++;\n        this.match += ch;\n        this.matched += ch;\n        var lines = ch.match(/(?:\\r\\n?|\\n).*/g);\n        if (lines) {\n          this.yylineno++;\n          this.yylloc.last_line++;\n        } else {\n          this.yylloc.last_column++;\n        }\n        if (this.options.ranges) {\n          this.yylloc.range[1]++;\n        }\n        this._input = this._input.slice(1);\n        return ch;\n      }, \"input\"),\n      // unshifts one char (or a string) into the input\n      unput: /* @__PURE__ */ __name(function(ch) {\n        var len = ch.length;\n        var lines = ch.split(/(?:\\r\\n?|\\n)/g);\n        this._input = ch + this._input;\n        this.yytext = this.yytext.substr(0, this.yytext.length - len);\n        this.offset -= len;\n        var oldLines = this.match.split(/(?:\\r\\n?|\\n)/g);\n        this.match = this.match.substr(0, this.match.length - 1);\n        this.matched = this.matched.substr(0, this.matched.length - 1);\n        if (lines.length - 1) {\n          this.yylineno -= lines.length - 1;\n        }\n        var r = this.yylloc.range;\n        this.yylloc = {\n          first_line: this.yylloc.first_line,\n          last_line: this.yylineno + 1,\n          first_column: this.yylloc.first_column,\n          last_column: lines ? (lines.length === oldLines.length ? this.yylloc.first_column : 0) + oldLines[oldLines.length - lines.length].length - lines[0].length : this.yylloc.first_column - len\n        };\n        if (this.options.ranges) {\n          this.yylloc.range = [r[0], r[0] + this.yyleng - len];\n        }\n        this.yyleng = this.yytext.length;\n        return this;\n      }, \"unput\"),\n      // When called from action, caches matched text and appends it on next action\n      more: /* @__PURE__ */ __name(function() {\n        this._more = true;\n        return this;\n      }, \"more\"),\n      // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.\n      reject: /* @__PURE__ */ __name(function() {\n        if (this.options.backtrack_lexer) {\n          this._backtrack = true;\n        } else {\n          return this.parseError(\"Lexical error on line \" + (this.yylineno + 1) + \". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\\n\" + this.showPosition(), {\n            text: \"\",\n            token: null,\n            line: this.yylineno\n          });\n        }\n        return this;\n      }, \"reject\"),\n      // retain first n characters of the match\n      less: /* @__PURE__ */ __name(function(n) {\n        this.unput(this.match.slice(n));\n      }, \"less\"),\n      // displays already matched input, i.e. for error messages\n      pastInput: /* @__PURE__ */ __name(function() {\n        var past = this.matched.substr(0, this.matched.length - this.match.length);\n        return (past.length > 20 ? \"...\" : \"\") + past.substr(-20).replace(/\\n/g, \"\");\n      }, \"pastInput\"),\n      // displays upcoming input, i.e. for error messages\n      upcomingInput: /* @__PURE__ */ __name(function() {\n        var next = this.match;\n        if (next.length < 20) {\n          next += this._input.substr(0, 20 - next.length);\n        }\n        return (next.substr(0, 20) + (next.length > 20 ? \"...\" : \"\")).replace(/\\n/g, \"\");\n      }, \"upcomingInput\"),\n      // displays the character position where the lexing error occurred, i.e. for error messages\n      showPosition: /* @__PURE__ */ __name(function() {\n        var pre = this.pastInput();\n        var c = new Array(pre.length + 1).join(\"-\");\n        return pre + this.upcomingInput() + \"\\n\" + c + \"^\";\n      }, \"showPosition\"),\n      // test the lexed token: return FALSE when not a match, otherwise return token\n      test_match: /* @__PURE__ */ __name(function(match, indexed_rule) {\n        var token, lines, backup;\n        if (this.options.backtrack_lexer) {\n          backup = {\n            yylineno: this.yylineno,\n            yylloc: {\n              first_line: this.yylloc.first_line,\n              last_line: this.last_line,\n              first_column: this.yylloc.first_column,\n              last_column: this.yylloc.last_column\n            },\n            yytext: this.yytext,\n            match: this.match,\n            matches: this.matches,\n            matched: this.matched,\n            yyleng: this.yyleng,\n            offset: this.offset,\n            _more: this._more,\n            _input: this._input,\n            yy: this.yy,\n            conditionStack: this.conditionStack.slice(0),\n            done: this.done\n          };\n          if (this.options.ranges) {\n            backup.yylloc.range = this.yylloc.range.slice(0);\n          }\n        }\n        lines = match[0].match(/(?:\\r\\n?|\\n).*/g);\n        if (lines) {\n          this.yylineno += lines.length;\n        }\n        this.yylloc = {\n          first_line: this.yylloc.last_line,\n          last_line: this.yylineno + 1,\n          first_column: this.yylloc.last_column,\n          last_column: lines ? lines[lines.length - 1].length - lines[lines.length - 1].match(/\\r?\\n?/)[0].length : this.yylloc.last_column + match[0].length\n        };\n        this.yytext += match[0];\n        this.match += match[0];\n        this.matches = match;\n        this.yyleng = this.yytext.length;\n        if (this.options.ranges) {\n          this.yylloc.range = [this.offset, this.offset += this.yyleng];\n        }\n        this._more = false;\n        this._backtrack = false;\n        this._input = this._input.slice(match[0].length);\n        this.matched += match[0];\n        token = this.performAction.call(this, this.yy, this, indexed_rule, this.conditionStack[this.conditionStack.length - 1]);\n        if (this.done && this._input) {\n          this.done = false;\n        }\n        if (token) {\n          return token;\n        } else if (this._backtrack) {\n          for (var k in backup) {\n            this[k] = backup[k];\n          }\n          return false;\n        }\n        return false;\n      }, \"test_match\"),\n      // return next match in input\n      next: /* @__PURE__ */ __name(function() {\n        if (this.done) {\n          return this.EOF;\n        }\n        if (!this._input) {\n          this.done = true;\n        }\n        var token, match, tempMatch, index;\n        if (!this._more) {\n          this.yytext = \"\";\n          this.match = \"\";\n        }\n        var rules = this._currentRules();\n        for (var i = 0; i < rules.length; i++) {\n          tempMatch = this._input.match(this.rules[rules[i]]);\n          if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {\n            match = tempMatch;\n            index = i;\n            if (this.options.backtrack_lexer) {\n              token = this.test_match(tempMatch, rules[i]);\n              if (token !== false) {\n                return token;\n              } else if (this._backtrack) {\n                match = false;\n                continue;\n              } else {\n                return false;\n              }\n            } else if (!this.options.flex) {\n              break;\n            }\n          }\n        }\n        if (match) {\n          token = this.test_match(match, rules[index]);\n          if (token !== false) {\n            return token;\n          }\n          return false;\n        }\n        if (this._input === \"\") {\n          return this.EOF;\n        } else {\n          return this.parseError(\"Lexical error on line \" + (this.yylineno + 1) + \". Unrecognized text.\\n\" + this.showPosition(), {\n            text: \"\",\n            token: null,\n            line: this.yylineno\n          });\n        }\n      }, \"next\"),\n      // return next match that has a token\n      lex: /* @__PURE__ */ __name(function lex() {\n        var r = this.next();\n        if (r) {\n          return r;\n        } else {\n          return this.lex();\n        }\n      }, \"lex\"),\n      // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)\n      begin: /* @__PURE__ */ __name(function begin(condition) {\n        this.conditionStack.push(condition);\n      }, \"begin\"),\n      // pop the previously active lexer condition state off the condition stack\n      popState: /* @__PURE__ */ __name(function popState() {\n        var n = this.conditionStack.length - 1;\n        if (n > 0) {\n          return this.conditionStack.pop();\n        } else {\n          return this.conditionStack[0];\n        }\n      }, \"popState\"),\n      // produce the lexer rule set which is active for the currently active lexer condition state\n      _currentRules: /* @__PURE__ */ __name(function _currentRules() {\n        if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {\n          return this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules;\n        } else {\n          return this.conditions[\"INITIAL\"].rules;\n        }\n      }, \"_currentRules\"),\n      // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available\n      topState: /* @__PURE__ */ __name(function topState(n) {\n        n = this.conditionStack.length - 1 - Math.abs(n || 0);\n        if (n >= 0) {\n          return this.conditionStack[n];\n        } else {\n          return \"INITIAL\";\n        }\n      }, \"topState\"),\n      // alias for begin(condition)\n      pushState: /* @__PURE__ */ __name(function pushState(condition) {\n        this.begin(condition);\n      }, \"pushState\"),\n      // return the number of states currently on the stack\n      stateStackSize: /* @__PURE__ */ __name(function stateStackSize() {\n        return this.conditionStack.length;\n      }, \"stateStackSize\"),\n      options: { \"case-insensitive\": true },\n      performAction: /* @__PURE__ */ __name(function anonymous(yy, yy_, $avoiding_name_collisions, YY_START) {\n        var YYSTATE = YY_START;\n        switch ($avoiding_name_collisions) {\n          case 0:\n            break;\n          case 1:\n            break;\n          case 2:\n            break;\n          case 3:\n            if (yy.getIndentMode && yy.getIndentMode()) {\n              yy.consumeIndentText = true;\n              this.begin(\"INITIAL\");\n              return 22;\n            }\n            break;\n          case 4:\n            break;\n          case 5:\n            if (yy.setIndentMode) {\n              yy.setIndentMode(false);\n            }\n            this.begin(\"INITIAL\");\n            this.unput(yy_.yytext);\n            break;\n          case 6:\n            this.begin(\"bol\");\n            return 8;\n            break;\n          case 7:\n            break;\n          case 8:\n            break;\n          case 9:\n            return 7;\n            break;\n          case 10:\n            return 11;\n            break;\n          case 11:\n            return 5;\n            break;\n          case 12:\n            return 12;\n            break;\n          case 13:\n            return 17;\n            break;\n          case 14:\n            if (yy.consumeIndentText) {\n              yy.consumeIndentText = false;\n            } else {\n              return 19;\n            }\n            break;\n          case 15:\n            return 24;\n            break;\n          case 16:\n            yy_.yytext = yy_.yytext.slice(2, -2);\n            return 14;\n            break;\n          case 17:\n            yy_.yytext = yy_.yytext.slice(1, -1).trim();\n            return 14;\n            break;\n          case 18:\n            return 16;\n            break;\n          case 19:\n            return 31;\n            break;\n          case 20:\n            return 33;\n            break;\n          case 21:\n            return 32;\n            break;\n          case 22:\n            return 20;\n            break;\n          case 23:\n            return 21;\n            break;\n          case 24:\n            return 27;\n            break;\n          case 25:\n            return 15;\n            break;\n        }\n      }, \"anonymous\"),\n      rules: [/^(?:%%(?!\\{)[^\\n]*)/i, /^(?:[^\\}]%%[^\\n]*)/i, /^(?:[ \\t]+(?=[\\n\\r]))/i, /^(?:[ \\t]+(?=text\\b))/i, /^(?:[ \\t]+)/i, /^(?:[^ \\t\\n\\r])/i, /^(?:[\\n\\r]+)/i, /^(?:%%[^\\n]*)/i, /^(?:[ \\t]+)/i, /^(?:$)/i, /^(?:title\\s[^#\\n;]+)/i, /^(?:venn-beta\\b)/i, /^(?:set\\b)/i, /^(?:union\\b)/i, /^(?:text\\b)/i, /^(?:style\\b)/i, /^(?:\\[\"[^\\\"]*\"\\])/i, /^(?:\\[[^\\]\\\"]+\\])/i, /^(?:[+-]?(\\d+(\\.\\d+)?|\\.\\d+))/i, /^(?:#[0-9a-fA-F]{3,8})/i, /^(?:rgba\\(\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*\\))/i, /^(?:rgb\\(\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*[,]\\s*[0-9.]+\\s*\\))/i, /^(?:[A-Za-z_][A-Za-z0-9\\-_]*)/i, /^(?:\"[^\\\"]*\")/i, /^(?:,)/i, /^(?::)/i],\n      conditions: { \"bol\": { \"rules\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25], \"inclusive\": true }, \"INITIAL\": { \"rules\": [0, 1, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25], \"inclusive\": true } }\n    };\n    return lexer2;\n  })();\n  parser2.lexer = lexer;\n  function Parser() {\n    this.yy = {};\n  }\n  __name(Parser, \"Parser\");\n  Parser.prototype = parser2;\n  parser2.Parser = Parser;\n  return new Parser();\n})();\nparser.parser = parser;\nvar venn_default = parser;\n\n// src/diagrams/venn/vennDB.ts\nvar subsets = [];\nvar textNodes = [];\nvar styleEntries = [];\nvar knownSets = /* @__PURE__ */ new Set();\nvar currentSets;\nvar indentMode = false;\nvar addSubsetData = /* @__PURE__ */ __name((identifierList, label, size) => {\n  const sets = normalizeIdentifierList(identifierList).sort();\n  const resolvedSize = size ?? 10 / Math.pow(identifierList.length, 2);\n  currentSets = sets;\n  if (sets.length === 1) {\n    knownSets.add(sets[0]);\n  }\n  subsets.push({\n    sets,\n    size: resolvedSize,\n    label: label ? normalizeText(label) : void 0\n  });\n}, \"addSubsetData\");\nvar getSubsetData = /* @__PURE__ */ __name(() => {\n  return subsets;\n}, \"getSubsetData\");\nvar normalizeText = /* @__PURE__ */ __name((text) => {\n  const trimmed = text.trim();\n  if (trimmed.length >= 2 && trimmed.startsWith('\"') && trimmed.endsWith('\"')) {\n    return trimmed.slice(1, -1);\n  }\n  return trimmed;\n}, \"normalizeText\");\nvar normalizeStyleValue = /* @__PURE__ */ __name((value) => {\n  return value ? normalizeText(value) : value;\n}, \"normalizeStyleValue\");\nvar addTextData = /* @__PURE__ */ __name((identifierList, id, label) => {\n  const normalizedId = normalizeText(id);\n  textNodes.push({\n    sets: normalizeIdentifierList(identifierList).sort(),\n    id: normalizedId,\n    label: label ? normalizeText(label) : void 0\n  });\n}, \"addTextData\");\nvar addStyleData = /* @__PURE__ */ __name((identifierList, data) => {\n  const targets = normalizeIdentifierList(identifierList).sort();\n  const styles = {};\n  for (const [key, value] of data) {\n    styles[key] = normalizeStyleValue(value) ?? value;\n  }\n  styleEntries.push({ targets, styles });\n}, \"addStyleData\");\nvar getStyleData = /* @__PURE__ */ __name(() => {\n  return styleEntries;\n}, \"getStyleData\");\nvar normalizeIdentifierList = /* @__PURE__ */ __name((identifierList) => {\n  return identifierList.map((identifier) => normalizeText(identifier));\n}, \"normalizeIdentifierList\");\nvar validateUnionIdentifiers = /* @__PURE__ */ __name((identifierList) => {\n  const normalized = normalizeIdentifierList(identifierList);\n  const unknown = normalized.filter((identifier) => !knownSets.has(identifier));\n  if (unknown.length > 0) {\n    throw new Error(`unknown set identifier: ${unknown.join(\", \")}`);\n  }\n}, \"validateUnionIdentifiers\");\nvar getTextData = /* @__PURE__ */ __name(() => {\n  return textNodes;\n}, \"getTextData\");\nvar getCurrentSets = /* @__PURE__ */ __name(() => currentSets, \"getCurrentSets\");\nvar getIndentMode = /* @__PURE__ */ __name(() => indentMode, \"getIndentMode\");\nvar setIndentMode = /* @__PURE__ */ __name((enabled) => {\n  indentMode = enabled;\n}, \"setIndentMode\");\nvar DEFAULT_VENN_CONFIG = defaultConfig_default.venn;\nfunction getConfig2() {\n  return cleanAndMerge(DEFAULT_VENN_CONFIG, getConfig().venn);\n}\n__name(getConfig2, \"getConfig\");\nvar customClear = /* @__PURE__ */ __name(() => {\n  clear();\n  subsets.length = 0;\n  textNodes.length = 0;\n  styleEntries.length = 0;\n  knownSets.clear();\n  currentSets = void 0;\n  indentMode = false;\n}, \"customClear\");\nvar db = {\n  getConfig: getConfig2,\n  clear: customClear,\n  setAccTitle,\n  getAccTitle,\n  setDiagramTitle,\n  getDiagramTitle,\n  getAccDescription,\n  setAccDescription,\n  addSubsetData,\n  getSubsetData,\n  addTextData,\n  addStyleData,\n  validateUnionIdentifiers,\n  getTextData,\n  getStyleData,\n  getCurrentSets,\n  getIndentMode,\n  setIndentMode\n};\n\n// src/diagrams/venn/styles.ts\nvar getStyles = /* @__PURE__ */ __name((options) => `\n  .venn-title {\n    font-size: 32px;\n    fill: ${options.vennTitleTextColor};\n    font-family: ${options.fontFamily};\n  }\n\n  .venn-circle text {\n    font-size: 48px;\n    font-family: ${options.fontFamily};\n  }\n\n  .venn-intersection text {\n    font-size: 48px;\n    fill: ${options.vennSetTextColor};\n    font-family: ${options.fontFamily};\n  }\n\n  .venn-text-node {\n    font-family: ${options.fontFamily};\n    color: ${options.vennSetTextColor};\n  }\n`, \"getStyles\");\nvar styles_default = getStyles;\n\n// src/diagrams/venn/vennRenderer.ts\nimport { select as d3select } from \"d3\";\nimport { isDark, lighten, darken, transparentize } from \"khroma\";\nimport * as venn from \"@upsetjs/venn.js\";\nimport rough from \"roughjs\";\nfunction buildStyleByKey(styleData) {\n  const map = /* @__PURE__ */ new Map();\n  for (const entry of styleData) {\n    const key = entry.targets.join(\"|\");\n    const existing = map.get(key);\n    if (existing) {\n      Object.assign(existing, entry.styles);\n    } else {\n      map.set(key, { ...entry.styles });\n    }\n  }\n  return map;\n}\n__name(buildStyleByKey, \"buildStyleByKey\");\nvar draw = /* @__PURE__ */ __name((_text, id, _version, diagObj) => {\n  const db2 = diagObj.db;\n  const config = db2.getConfig?.();\n  const { themeVariables, look, handDrawnSeed } = getConfig();\n  const isHandDrawn = look === \"handDrawn\";\n  const themeColors = [\n    themeVariables.venn1,\n    themeVariables.venn2,\n    themeVariables.venn3,\n    themeVariables.venn4,\n    themeVariables.venn5,\n    themeVariables.venn6,\n    themeVariables.venn7,\n    themeVariables.venn8\n  ].filter(Boolean);\n  const title = db2.getDiagramTitle?.();\n  const sets = db2.getSubsetData();\n  const textNodes2 = db2.getTextData();\n  const styleByKey = buildStyleByKey(db2.getStyleData());\n  const svgWidth = config?.width ?? 800;\n  const svgHeight = config?.height ?? 450;\n  const REFERENCE_WIDTH = 1600;\n  const scale = svgWidth / REFERENCE_WIDTH;\n  const titleHeight = title ? 48 * scale : 0;\n  const defaultTextColor = themeVariables.primaryTextColor ?? themeVariables.textColor;\n  const svg = selectSvgElement(id);\n  svg.attr(\"viewBox\", `0 0 ${svgWidth} ${svgHeight}`);\n  if (title) {\n    svg.append(\"text\").text(title).attr(\"class\", \"venn-title\").attr(\"font-size\", `${32 * scale}px`).attr(\"text-anchor\", \"middle\").attr(\"dominant-baseline\", \"middle\").attr(\"x\", \"50%\").attr(\"y\", 32 * scale).style(\"fill\", themeVariables.vennTitleTextColor || themeVariables.titleColor);\n  }\n  const dummyD3root = d3select(document.createElement(\"div\"));\n  const vennDiagram = venn.VennDiagram().width(svgWidth).height(svgHeight - titleHeight);\n  dummyD3root.datum(sets).call(vennDiagram);\n  const roughSvg = isHandDrawn ? rough.svg(dummyD3root.select(\"svg\").node()) : void 0;\n  const layoutAreas = venn.layout(sets, {\n    width: svgWidth,\n    height: svgHeight - titleHeight,\n    padding: config?.padding ?? 15\n  });\n  const layoutByKey = /* @__PURE__ */ new Map();\n  for (const area of layoutAreas) {\n    const key = stableSetsKey([...area.data.sets].sort());\n    layoutByKey.set(key, area);\n  }\n  if (textNodes2.length > 0) {\n    renderTextNodes(config, layoutByKey, dummyD3root, textNodes2, scale, styleByKey);\n  }\n  const themeDark = isDark(themeVariables.background || \"#f4f4f4\");\n  dummyD3root.selectAll(\".venn-circle\").each(function(d, i) {\n    const group = d3select(this);\n    const data = d;\n    const setsKey = stableSetsKey([...data.sets].sort());\n    const customStyle = styleByKey.get(setsKey);\n    const baseColor = customStyle?.fill || themeColors[i % themeColors.length] || themeVariables.primaryColor;\n    group.classed(`venn-set-${i % 8}`, true);\n    const fillOpacity = customStyle?.[\"fill-opacity\"] ?? 0.1;\n    const strokeColor = customStyle?.stroke || baseColor;\n    const strokeWidthVal = customStyle?.[\"stroke-width\"] || `${5 * scale}`;\n    if (isHandDrawn && roughSvg) {\n      const layoutArea = layoutByKey.get(setsKey);\n      if (layoutArea && layoutArea.circles.length > 0) {\n        const c = layoutArea.circles[0];\n        const roughNode = roughSvg.circle(c.x, c.y, c.radius * 2, {\n          roughness: 0.7,\n          seed: handDrawnSeed,\n          fill: transparentize(baseColor, 0.7),\n          fillStyle: \"hachure\",\n          fillWeight: 2,\n          hachureGap: 8,\n          hachureAngle: -41 + i * 60,\n          stroke: strokeColor,\n          strokeWidth: parseFloat(String(strokeWidthVal))\n        });\n        group.select(\"path\").remove();\n        group.node()?.insertBefore(roughNode, group.select(\"text\").node());\n      }\n    } else {\n      group.select(\"path\").style(\"fill\", baseColor).style(\"fill-opacity\", fillOpacity).style(\"stroke\", strokeColor).style(\"stroke-width\", strokeWidthVal).style(\"stroke-opacity\", 0.95);\n    }\n    const textColor = customStyle?.color || (themeDark ? lighten(baseColor, 30) : darken(baseColor, 30));\n    group.select(\"text\").style(\"font-size\", `${48 * scale}px`).style(\"fill\", textColor);\n  });\n  if (isHandDrawn && roughSvg) {\n    dummyD3root.selectAll(\".venn-intersection\").each(function(d) {\n      const group = d3select(this);\n      const data = d;\n      const setsKey = stableSetsKey([...data.sets].sort());\n      const customStyle = styleByKey.get(setsKey);\n      const customFill = customStyle?.fill;\n      if (customFill) {\n        const pathEl = group.select(\"path\");\n        const pathD = pathEl.attr(\"d\");\n        if (pathD) {\n          const roughNode = roughSvg.path(pathD, {\n            roughness: 0.7,\n            seed: handDrawnSeed,\n            fill: transparentize(customFill, 0.3),\n            fillStyle: \"cross-hatch\",\n            fillWeight: 2,\n            hachureGap: 6,\n            hachureAngle: 60,\n            stroke: \"none\"\n          });\n          const existingPath = pathEl.node();\n          existingPath?.parentNode?.insertBefore(roughNode, existingPath);\n          pathEl.remove();\n        }\n      } else {\n        group.select(\"path\").style(\"fill-opacity\", 0);\n      }\n      group.select(\"text\").style(\"font-size\", `${48 * scale}px`).style(\"fill\", customStyle?.color ?? themeVariables.vennSetTextColor ?? defaultTextColor);\n    });\n  } else {\n    dummyD3root.selectAll(\".venn-intersection text\").style(\"font-size\", `${48 * scale}px`).style(\"fill\", (e) => {\n      const data = e;\n      const setsKey = stableSetsKey([...data.sets].sort());\n      return styleByKey.get(setsKey)?.color ?? themeVariables.vennSetTextColor ?? defaultTextColor;\n    });\n    dummyD3root.selectAll(\".venn-intersection path\").style(\"fill-opacity\", (e) => {\n      const data = e;\n      const setsKey = stableSetsKey([...data.sets].sort());\n      return styleByKey.get(setsKey)?.fill ? 1 : 0;\n    }).style(\"fill\", (e) => {\n      const data = e;\n      const setsKey = stableSetsKey([...data.sets].sort());\n      return styleByKey.get(setsKey)?.fill ?? \"transparent\";\n    });\n  }\n  const vennGroup = svg.append(\"g\").attr(\"transform\", `translate(0, ${titleHeight})`);\n  const dummySvg = dummyD3root.select(\"svg\").node();\n  if (dummySvg && \"childNodes\" in dummySvg) {\n    for (const child of [...dummySvg.childNodes]) {\n      vennGroup.node()?.appendChild(child);\n    }\n  }\n  configureSvgSize(svg, svgHeight, svgWidth, config?.useMaxWidth ?? true);\n}, \"draw\");\nfunction stableSetsKey(setIds) {\n  return setIds.join(\"|\");\n}\n__name(stableSetsKey, \"stableSetsKey\");\nfunction renderTextNodes(config, layoutByKey, dummyD3root, textNodes2, scale, styleByKey) {\n  const useDebugLayout = config?.useDebugLayout ?? false;\n  const vennSvg = dummyD3root.select(\"svg\");\n  const textGroup = vennSvg.append(\"g\").attr(\"class\", \"venn-text-nodes\");\n  const nodesByArea = /* @__PURE__ */ new Map();\n  for (const node of textNodes2) {\n    const key = stableSetsKey(node.sets);\n    const existing = nodesByArea.get(key);\n    if (existing) {\n      existing.push(node);\n    } else {\n      nodesByArea.set(key, [node]);\n    }\n  }\n  for (const [key, nodes] of nodesByArea.entries()) {\n    const area = layoutByKey.get(key);\n    if (!area?.text) {\n      continue;\n    }\n    const centerX = area.text.x;\n    const centerY = area.text.y;\n    const minCircleRadius = Math.min(...area.circles.map((c) => c.radius));\n    const innerRadiusRaw = Math.min(\n      ...area.circles.map((c) => c.radius - Math.hypot(centerX - c.x, centerY - c.y))\n    );\n    let innerRadius = Number.isFinite(innerRadiusRaw) ? Math.max(0, innerRadiusRaw) : 0;\n    if (innerRadius === 0 && Number.isFinite(minCircleRadius)) {\n      innerRadius = minCircleRadius * 0.6;\n    }\n    const areaGroup = textGroup.append(\"g\").attr(\"class\", \"venn-text-area\").attr(\"font-size\", `${40 * scale}px`);\n    if (useDebugLayout) {\n      areaGroup.append(\"circle\").attr(\"class\", \"venn-text-debug-circle\").attr(\"cx\", centerX).attr(\"cy\", centerY).attr(\"r\", innerRadius).attr(\"fill\", \"none\").attr(\"stroke\", \"purple\").attr(\"stroke-width\", 1.5 * scale).attr(\"stroke-dasharray\", `${6 * scale} ${4 * scale}`);\n    }\n    const innerWidth = Math.max(80 * scale, innerRadius * 2 * 0.95);\n    const innerHeight = Math.max(60 * scale, innerRadius * 2 * 0.95);\n    const hasLabel = area.data.label && area.data.label.length > 0;\n    const labelOffsetBase = hasLabel ? Math.min(32 * scale, innerRadius * 0.25) : 0;\n    const labelOffset = labelOffsetBase + (nodes.length <= 2 ? 30 * scale : 0);\n    const startX = centerX - innerWidth / 2;\n    const startY = centerY - innerHeight / 2 + labelOffset;\n    const cols = Math.max(1, Math.ceil(Math.sqrt(nodes.length)));\n    const rows = Math.max(1, Math.ceil(nodes.length / cols));\n    const cellWidth = innerWidth / cols;\n    const cellHeight = innerHeight / rows;\n    for (const [i, node] of nodes.entries()) {\n      const col = i % cols;\n      const row = Math.floor(i / cols);\n      const x = startX + cellWidth * (col + 0.5);\n      const y = startY + cellHeight * (row + 0.5);\n      if (useDebugLayout) {\n        areaGroup.append(\"rect\").attr(\"class\", \"venn-text-debug-cell\").attr(\"x\", startX + cellWidth * col).attr(\"y\", startY + cellHeight * row).attr(\"width\", cellWidth).attr(\"height\", cellHeight).attr(\"fill\", \"none\").attr(\"stroke\", \"teal\").attr(\"stroke-width\", 1 * scale).attr(\"stroke-dasharray\", `${4 * scale} ${3 * scale}`);\n      }\n      const boxWidth = cellWidth * 0.9;\n      const boxHeight = cellHeight * 0.9;\n      const container = areaGroup.append(\"foreignObject\").attr(\"class\", \"venn-text-node-fo\").attr(\"width\", boxWidth).attr(\"height\", boxHeight).attr(\"x\", x - boxWidth / 2).attr(\"y\", y - boxHeight / 2).attr(\"overflow\", \"visible\");\n      const textColor = styleByKey.get(node.id)?.color;\n      const text = container.append(\"xhtml:span\").attr(\"class\", \"venn-text-node\").style(\"display\", \"flex\").style(\"width\", \"100%\").style(\"height\", \"100%\").style(\"white-space\", \"normal\").style(\"align-items\", \"center\").style(\"justify-content\", \"center\").style(\"text-align\", \"center\").style(\"overflow-wrap\", \"normal\").style(\"word-break\", \"normal\").text(node.label ?? node.id);\n      if (textColor) {\n        text.style(\"color\", textColor);\n      }\n    }\n  }\n}\n__name(renderTextNodes, \"renderTextNodes\");\nvar renderer = { draw };\n\n// src/diagrams/venn/vennDiagram.ts\nvar diagram = {\n  parser: venn_default,\n  db,\n  renderer,\n  styles: styles_default\n};\nexport {\n  diagram\n};\n"],"names":["transparentize","color","amount","adjustChannel","SMALL$1","intersectionArea","circles","stats","intersectionPoints","getIntersectionPoints","innerPoints","p","containedInCircles","arcArea","polygonArea","arcs","center","getCenter","i","a","b","p2","p1","midPoint","arc","j","circle","a1","a2","angleDiff","width","distance","circleArea","smallest","disjoint","point","ret","intersect","circleCircleIntersection","r","circleOverlap","r1","r2","d","w1","w2","h","x0","y0","rx","ry","points","bisect","f","parameters","maxIterations","tolerance","fA","fB","delta","mid","fMid","zeros","x","zerosM","y","dot","norm2","scale","value","c","weightedSum","v1","v2","nelderMead","nonZeroDelta","zeroDelta","minErrorDelta","minTolerance","rho","chi","psi","sigma","maxDiff","N","simplex","updateSimplex","sortOrder","centroid","reflected","contracted","expanded","iteration","sortedSimplex","state","worst","shouldReduce","wolfeLineSearch","pk","current","next","c1","c2","phi0","phiPrime0","phi","phi_old","phiPrime","a0","zoom","a_lo","a_high","phi_lo","conjugateGradient","initial","params","yk","temp","delta_k","beta_k","venn","sets","initialLayout","bestInitialLayout","loss","lossFunction","areas","addMissingAreas","setids","setid","positions","values","SMALL","distanceFromIntersectArea","overlap","distinct","s","toKey","arr","count","area","si","sj","k1","k2","ids","pairs","getDistanceMatrices","distances","constraints","left","right","constrainedMDSGradient","fxprime","xi","yi","xj","yj","dij","constraint","squaredDistance","greedyLayout","constrained","constrainedMDSLayout","constrainedLoss","greedyLoss","restarts","norm","row","obj","best","set","setOverlaps","weight","mostOverlapped","size","positioned","isPositioned","element","positionSet","index","setIndex","d1","k","d2","extraPoints","bestLoss","bestPoint","localLoss","overlaps","output","logRatioLossFunction","differenceFromIdeal","orientateCircles","orientation","orientationOrder","largestX","largestY","rotation","angle","slope","disjointCluster","find","union","xRoot","yRoot","maxDistance","disjointClusters","getBoundingBox","minMax","hi","acc","lo","normalizeSolution","solution","fromObjectNotation","clusters","cluster","bounds","returnBounds","spacing","addCluster","bottom","xOffset","yOffset","centreing","toObjectNotation","scaleSolution","height","padding","scaleToFit","xRange","yRange","xScaling","yScaling","toScaleDiameter","scaling","id","VennDiagram","options","useViewBox","duration","normalize","wrap","styled","fontSize","round","symmetricalTextCentre","colourMap","colourScheme","colourIndex","colours","key","layoutFunction","chart","selection","data","toRemove","datum","textCentres","computeTextCentres","labels","label","svg","previous","hasPrevious","path","circleFromPath","pathTween","t","start","end","intersectionAreaPath","nodes","enter","enterPath","enterText","asTransition","update","updateText","wrapText","exit","exitText","_","labeller","text","words","minChars","word","line","lineNumber","lineHeight","tspans","append","tspan","joined","circleMargin","interior","exterior","margin","m","computeTextCentre","valid","e","areaStats","getOverlappingCircles","circleids","circleid","ci","cj","overlapped","areaids","exclude","centre","circlePath","tokens","intersectionAreaArcs","arcsToPath","rFactor","v","radius","layout","circleLookup","helpers","genDistinctPath","parser","o","__name","o2","l","$V0","$V1","$V2","$V3","$V4","$V5","$V6","$V7","$V8","$V9","$Va","$Vb","$Vc","$Vd","parser2","yytext","yyleng","yylineno","yy","yystate","$$","_$","$0","cs","str","hash","error","input","self","stack","tstack","vstack","lstack","table","TERROR","EOF","args","lexer2","sharedState","yyloc","ranges","popStack","n","lex","token","symbol","action","yyval","len","newState","expected","errStr","lexer","ch","lines","oldLines","past","pre","match","indexed_rule","backup","tempMatch","rules","condition","yy_","$avoiding_name_collisions","YY_START","Parser","venn_default","subsets","textNodes","styleEntries","knownSets","currentSets","indentMode","addSubsetData","identifierList","normalizeIdentifierList","resolvedSize","normalizeText","getSubsetData","trimmed","normalizeStyleValue","addTextData","normalizedId","addStyleData","targets","styles","getStyleData","identifier","validateUnionIdentifiers","unknown","getTextData","getCurrentSets","getIndentMode","setIndentMode","enabled","DEFAULT_VENN_CONFIG","defaultConfig_default","getConfig2","cleanAndMerge","getConfig","customClear","clear","db","setAccTitle","getAccTitle","setDiagramTitle","getDiagramTitle","getAccDescription","setAccDescription","getStyles","styles_default","buildStyleByKey","styleData","map","entry","existing","draw","_text","_version","diagObj","db2","config","themeVariables","look","handDrawnSeed","isHandDrawn","themeColors","title","textNodes2","styleByKey","svgWidth","svgHeight","titleHeight","defaultTextColor","selectSvgElement","dummyD3root","d3select","vennDiagram","venn.VennDiagram","roughSvg","rough","layoutAreas","venn.layout","layoutByKey","stableSetsKey","renderTextNodes","themeDark","isDark","group","setsKey","customStyle","baseColor","fillOpacity","strokeColor","strokeWidthVal","layoutArea","roughNode","textColor","lighten","darken","customFill","pathEl","pathD","existingPath","vennGroup","dummySvg","child","configureSvgSize","setIds","useDebugLayout","textGroup","nodesByArea","node","centerX","centerY","minCircleRadius","innerRadiusRaw","innerRadius","areaGroup","innerWidth","innerHeight","labelOffset","startX","startY","cols","rows","cellWidth","cellHeight","col","boxWidth","boxHeight","container","renderer","diagram"],"mappings":"6NAGA,MAAMA,GAAiB,CAACC,EAAOC,IACpBC,GAAcF,EAAO,IAAK,CAACC,CAAM,ECJtCE,GAAU,MAiBhB,SAASC,GAAiBC,EAASC,EAAO,CAExC,MAAMC,EAAqBC,GAAsBH,CAAO,EAGlDI,EAAcF,EAAmB,OAAQG,GAAMC,GAAmBD,EAAGL,CAAO,CAAC,EAEnF,IAAIO,EAAU,EACVC,EAAc,EAElB,MAAMC,EAAO,CAAA,EAIb,GAAIL,EAAY,OAAS,EAAG,CAG1B,MAAMM,EAASC,GAAUP,CAAW,EACpC,QAASQ,EAAI,EAAGA,EAAIR,EAAY,OAAQ,EAAEQ,EAAG,CAC3C,MAAMP,EAAID,EAAYQ,CAAC,EACvBP,EAAE,MAAQ,KAAK,MAAMA,EAAE,EAAIK,EAAO,EAAGL,EAAE,EAAIK,EAAO,CAAC,CACrD,CACAN,EAAY,KAAK,CAACS,EAAGC,IAAMA,EAAE,MAAQD,EAAE,KAAK,EAI5C,IAAIE,EAAKX,EAAYA,EAAY,OAAS,CAAC,EAC3C,QAASQ,EAAI,EAAGA,EAAIR,EAAY,OAAQ,EAAEQ,EAAG,CAC3C,MAAMI,EAAKZ,EAAYQ,CAAC,EAGxBJ,IAAgBO,EAAG,EAAIC,EAAG,IAAMA,EAAG,EAAID,EAAG,GAG1C,MAAME,EAAW,CAAE,GAAID,EAAG,EAAID,EAAG,GAAK,EAAG,GAAIC,EAAG,EAAID,EAAG,GAAK,CAAC,EAE7D,IAAIG,EAAM,KAEV,QAASC,EAAI,EAAGA,EAAIH,EAAG,YAAY,OAAQ,EAAEG,EAC3C,GAAIJ,EAAG,YAAY,SAASC,EAAG,YAAYG,CAAC,CAAC,EAAG,CAG9C,MAAMC,EAASpB,EAAQgB,EAAG,YAAYG,CAAC,CAAC,EAClCE,EAAK,KAAK,MAAML,EAAG,EAAII,EAAO,EAAGJ,EAAG,EAAII,EAAO,CAAC,EAChDE,EAAK,KAAK,MAAMP,EAAG,EAAIK,EAAO,EAAGL,EAAG,EAAIK,EAAO,CAAC,EAEtD,IAAIG,EAAYD,EAAKD,EACjBE,EAAY,IACdA,GAAa,EAAI,KAAK,IAKxB,MAAMV,EAAIS,EAAKC,EAAY,EAC3B,IAAIC,EAAQC,EAASR,EAAU,CAC7B,EAAGG,EAAO,EAAIA,EAAO,OAAS,KAAK,IAAIP,CAAC,EACxC,EAAGO,EAAO,EAAIA,EAAO,OAAS,KAAK,IAAIP,CAAC,CACpD,CAAW,EAIGW,EAAQJ,EAAO,OAAS,IAC1BI,EAAQJ,EAAO,OAAS,IAItBF,GAAO,MAAQA,EAAI,MAAQM,KAC7BN,EAAM,CAAE,OAAAE,EAAQ,MAAAI,EAAO,GAAAR,EAAI,GAAAD,EAAI,MAAOS,EAAQJ,EAAO,OAAQ,MAAO,EAAI,EAE5E,CAGEF,GAAO,OACTT,EAAK,KAAKS,CAAG,EACbX,GAAWmB,GAAWR,EAAI,OAAO,OAAQA,EAAI,KAAK,EAClDH,EAAKC,EAET,CACF,KAAO,CAGL,IAAIW,EAAW3B,EAAQ,CAAC,EACxB,QAASY,EAAI,EAAGA,EAAIZ,EAAQ,OAAQ,EAAEY,EAChCZ,EAAQY,CAAC,EAAE,OAASe,EAAS,SAC/BA,EAAW3B,EAAQY,CAAC,GAMxB,IAAIgB,EAAW,GACf,QAAShB,EAAI,EAAGA,EAAIZ,EAAQ,OAAQ,EAAEY,EACpC,GAAIa,EAASzB,EAAQY,CAAC,EAAGe,CAAQ,EAAI,KAAK,IAAIA,EAAS,OAAS3B,EAAQY,CAAC,EAAE,MAAM,EAAG,CAClFgB,EAAW,GACX,KACF,CAGEA,EACFrB,EAAUC,EAAc,GAExBD,EAAUoB,EAAS,OAASA,EAAS,OAAS,KAAK,GACnDlB,EAAK,KAAK,CACR,OAAQkB,EACR,GAAI,CAAE,EAAGA,EAAS,EAAG,EAAGA,EAAS,EAAIA,EAAS,MAAM,EACpD,GAAI,CAAE,EAAGA,EAAS,EAAI7B,GAAS,EAAG6B,EAAS,EAAIA,EAAS,MAAM,EAC9D,MAAOA,EAAS,OAAS,EACzB,MAAO,GACP,MAAO,EACf,CAAO,EAEL,CAEA,OAAAnB,GAAe,EAEXP,IACFA,EAAM,KAAOM,EAAUC,EACvBP,EAAM,QAAUM,EAChBN,EAAM,YAAcO,EACpBP,EAAM,KAAOQ,EACbR,EAAM,YAAcG,EACpBH,EAAM,mBAAqBC,GAGtBK,EAAUC,CACnB,CAQA,SAASF,GAAmBuB,EAAO7B,EAAS,CAC1C,OAAOA,EAAQ,MAAOoB,GAAWK,EAASI,EAAOT,CAAM,EAAIA,EAAO,OAAStB,EAAO,CACpF,CAOA,SAASK,GAAsBH,EAAS,CAEtC,MAAM8B,EAAM,CAAA,EACZ,QAASlB,EAAI,EAAGA,EAAIZ,EAAQ,OAAQ,EAAEY,EACpC,QAASO,EAAIP,EAAI,EAAGO,EAAInB,EAAQ,OAAQ,EAAEmB,EAAG,CAC3C,MAAMY,EAAYC,GAAyBhC,EAAQY,CAAC,EAAGZ,EAAQmB,CAAC,CAAC,EACjE,UAAWd,KAAK0B,EACd1B,EAAE,YAAc,CAACO,EAAGO,CAAC,EACrBW,EAAI,KAAKzB,CAAC,CAEd,CAEF,OAAOyB,CACT,CAQA,SAASJ,GAAWO,EAAGT,EAAO,CAC5B,OAAOS,EAAIA,EAAI,KAAK,KAAK,EAAIT,EAAQS,CAAC,GAAKA,EAAIT,GAAS,KAAK,KAAKA,GAAS,EAAIS,EAAIT,EAAM,CAC3F,CAQA,SAASC,EAAST,EAAID,EAAI,CACxB,OAAO,KAAK,MAAMC,EAAG,EAAID,EAAG,IAAMC,EAAG,EAAID,EAAG,IAAMC,EAAG,EAAID,EAAG,IAAMC,EAAG,EAAID,EAAG,EAAE,CAChF,CAWA,SAASmB,GAAcC,EAAIC,EAAIC,EAAG,CAEhC,GAAIA,GAAKF,EAAKC,EACZ,MAAO,GAIT,GAAIC,GAAK,KAAK,IAAIF,EAAKC,CAAE,EACvB,OAAO,KAAK,GAAK,KAAK,IAAID,EAAIC,CAAE,EAAI,KAAK,IAAID,EAAIC,CAAE,EAGrD,MAAME,EAAKH,GAAME,EAAIA,EAAID,EAAKA,EAAKD,EAAKA,IAAO,EAAIE,GAC7CE,EAAKH,GAAMC,EAAIA,EAAIF,EAAKA,EAAKC,EAAKA,IAAO,EAAIC,GACnD,OAAOX,GAAWS,EAAIG,CAAE,EAAIZ,GAAWU,EAAIG,CAAE,CAC/C,CAWA,SAASP,GAAyBhB,EAAID,EAAI,CACxC,MAAMsB,EAAIZ,EAAST,EAAID,CAAE,EACnBoB,EAAKnB,EAAG,OACRoB,EAAKrB,EAAG,OAGd,GAAIsB,GAAKF,EAAKC,GAAMC,GAAK,KAAK,IAAIF,EAAKC,CAAE,EACvC,MAAO,CAAA,EAGT,MAAMvB,GAAKsB,EAAKA,EAAKC,EAAKA,EAAKC,EAAIA,IAAM,EAAIA,GACvCG,EAAI,KAAK,KAAKL,EAAKA,EAAKtB,EAAIA,CAAC,EAC7B4B,EAAKzB,EAAG,EAAKH,GAAKE,EAAG,EAAIC,EAAG,GAAMqB,EAClCK,EAAK1B,EAAG,EAAKH,GAAKE,EAAG,EAAIC,EAAG,GAAMqB,EAClCM,EAAK,EAAE5B,EAAG,EAAIC,EAAG,IAAMwB,EAAIH,GAC3BO,EAAK,EAAE7B,EAAG,EAAIC,EAAG,IAAMwB,EAAIH,GAEjC,MAAO,CACL,CAAE,EAAGI,EAAKE,EAAI,EAAGD,EAAKE,CAAE,EACxB,CAAE,EAAGH,EAAKE,EAAI,EAAGD,EAAKE,CAAE,CAC5B,CACA,CAOA,SAASjC,GAAUkC,EAAQ,CACzB,MAAMnC,EAAS,CAAE,EAAG,EAAG,EAAG,CAAC,EAC3B,UAAWmB,KAASgB,EAClBnC,EAAO,GAAKmB,EAAM,EAClBnB,EAAO,GAAKmB,EAAM,EAEpB,OAAAnB,EAAO,GAAKmC,EAAO,OACnBnC,EAAO,GAAKmC,EAAO,OACZnC,CACT,CAIA,SAASoC,GAAOC,EAAGlC,EAAGC,EAAGkC,EAAY,CACjCA,EAAaA,GAAc,CAAA,EAC3B,MAAMC,EAAgBD,EAAW,eAAiB,IAC5CE,EAAYF,EAAW,WAAa,MACpCG,EAAKJ,EAAElC,CAAC,EACRuC,EAAKL,EAAEjC,CAAC,EACd,IAAIuC,EAAQvC,EAAID,EAEhB,GAAIsC,EAAKC,EAAK,EACV,KAAM,iDAGV,GAAID,IAAO,EAAG,OAAOtC,EACrB,GAAIuC,IAAO,EAAG,OAAOtC,EAErB,QAASF,EAAI,EAAGA,EAAIqC,EAAe,EAAErC,EAAG,CACpCyC,GAAS,EACT,MAAMC,EAAMzC,EAAIwC,EACVE,EAAOR,EAAEO,CAAG,EAMlB,GAJIC,EAAOJ,GAAM,IACbtC,EAAIyC,GAGJ,KAAK,IAAID,CAAK,EAAIH,GAAaK,IAAS,EACxC,OAAOD,CAEf,CACA,OAAOzC,EAAIwC,CACf,CAIA,SAASG,GAAMC,EAAG,CACd,MAAMxB,EAAI,IAAI,MAAMwB,CAAC,EACrB,QAAS7C,EAAI,EAAGA,EAAI6C,EAAG,EAAE7C,EACrBqB,EAAErB,CAAC,EAAI,EAEX,OAAOqB,CACX,CACA,SAASyB,GAAOD,EAAGE,EAAG,CAClB,OAAOH,GAAMC,CAAC,EAAE,IAAI,IAAMD,GAAMG,CAAC,CAAC,CACtC,CAEA,SAASC,EAAI/C,EAAGC,EAAG,CACf,IAAIgB,EAAM,EACV,QAASlB,EAAI,EAAGA,EAAIC,EAAE,OAAQ,EAAED,EAC5BkB,GAAOjB,EAAED,CAAC,EAAIE,EAAEF,CAAC,EAErB,OAAOkB,CACX,CAEA,SAAS+B,GAAMhD,EAAG,CACd,OAAO,KAAK,KAAK+C,EAAI/C,EAAGA,CAAC,CAAC,CAC9B,CAEA,SAASiD,GAAMhC,EAAKiC,EAAOC,EAAG,CAC1B,QAASpD,EAAI,EAAGA,EAAImD,EAAM,OAAQ,EAAEnD,EAChCkB,EAAIlB,CAAC,EAAImD,EAAMnD,CAAC,EAAIoD,CAE5B,CAEA,SAASC,EAAYnC,EAAKQ,EAAI4B,EAAI3B,EAAI4B,EAAI,CACtC,QAAShD,EAAI,EAAGA,EAAIW,EAAI,OAAQ,EAAEX,EAC9BW,EAAIX,CAAC,EAAImB,EAAK4B,EAAG/C,CAAC,EAAIoB,EAAK4B,EAAGhD,CAAC,CAEvC,CAGA,SAASiD,GAAWrB,EAAGN,EAAIO,EAAY,CACnCA,EAAaA,GAAc,CAAA,EAE3B,MAAMC,EAAgBD,EAAW,eAAiBP,EAAG,OAAS,IACxD4B,EAAerB,EAAW,cAAgB,KAC1CsB,EAAYtB,EAAW,WAAa,KACpCuB,EAAgBvB,EAAW,eAAiB,KAC5CwB,EAAexB,EAAW,eAAiB,KAC3CyB,EAAMzB,EAAW,MAAQ,OAAYA,EAAW,IAAM,EACtD0B,EAAM1B,EAAW,MAAQ,OAAYA,EAAW,IAAM,EACtD2B,EAAM3B,EAAW,MAAQ,OAAYA,EAAW,IAAM,IACtD4B,EAAQ5B,EAAW,QAAU,OAAYA,EAAW,MAAQ,GAClE,IAAI6B,EAGJ,MAAMC,EAAIrC,EAAG,OACPsC,EAAU,IAAI,MAAMD,EAAI,CAAC,EAC/BC,EAAQ,CAAC,EAAItC,EACbsC,EAAQ,CAAC,EAAE,GAAKhC,EAAEN,CAAE,EACpBsC,EAAQ,CAAC,EAAE,GAAK,EAChB,QAASnE,EAAI,EAAGA,EAAIkE,EAAG,EAAElE,EAAG,CACxB,MAAMiB,EAAQY,EAAG,MAAK,EACtBZ,EAAMjB,CAAC,EAAIiB,EAAMjB,CAAC,EAAIiB,EAAMjB,CAAC,EAAIyD,EAAeC,EAChDS,EAAQnE,EAAI,CAAC,EAAIiB,EACjBkD,EAAQnE,EAAI,CAAC,EAAE,GAAKmC,EAAElB,CAAK,EAC3BkD,EAAQnE,EAAI,CAAC,EAAE,GAAKA,EAAI,CAC5B,CAEA,SAASoE,EAAcjB,EAAO,CAC1B,QAASnD,EAAI,EAAGA,EAAImD,EAAM,OAAQnD,IAC9BmE,EAAQD,CAAC,EAAElE,CAAC,EAAImD,EAAMnD,CAAC,EAE3BmE,EAAQD,CAAC,EAAE,GAAKf,EAAM,EAC1B,CAEA,MAAMkB,EAAY,CAACpE,EAAGC,IAAMD,EAAE,GAAKC,EAAE,GAE/BoE,EAAWzC,EAAG,MAAK,EACnB0C,EAAY1C,EAAG,MAAK,EACpB2C,EAAa3C,EAAG,MAAK,EACrB4C,EAAW5C,EAAG,MAAK,EAEzB,QAAS6C,EAAY,EAAGA,EAAYrC,EAAe,EAAEqC,EAAW,CAG5D,GAFAP,EAAQ,KAAKE,CAAS,EAElBjC,EAAW,QAAS,CAGpB,MAAMuC,EAAgBR,EAAQ,IAAKtB,GAAM,CACrC,MAAM+B,EAAQ/B,EAAE,MAAK,EACrB,OAAA+B,EAAM,GAAK/B,EAAE,GACb+B,EAAM,GAAK/B,EAAE,GACN+B,CACX,CAAC,EACDD,EAAc,KAAK,CAAC1E,EAAGC,IAAMD,EAAE,GAAKC,EAAE,EAAE,EAExCkC,EAAW,QAAQ,KAAK,CACpB,EAAG+B,EAAQ,CAAC,EAAE,MAAK,EACnB,GAAIA,EAAQ,CAAC,EAAE,GACf,QAASQ,CACzB,CAAa,CACL,CAEAV,EAAU,EACV,QAASjE,EAAI,EAAGA,EAAIkE,EAAG,EAAElE,EACrBiE,EAAU,KAAK,IAAIA,EAAS,KAAK,IAAIE,EAAQ,CAAC,EAAEnE,CAAC,EAAImE,EAAQ,CAAC,EAAEnE,CAAC,CAAC,CAAC,EAGvE,GAAI,KAAK,IAAImE,EAAQ,CAAC,EAAE,GAAKA,EAAQD,CAAC,EAAE,EAAE,EAAIP,GAAiBM,EAAUL,EACrE,MAIJ,QAAS5D,EAAI,EAAGA,EAAIkE,EAAG,EAAElE,EAAG,CACxBsE,EAAStE,CAAC,EAAI,EACd,QAASO,EAAI,EAAGA,EAAI2D,EAAG,EAAE3D,EACrB+D,EAAStE,CAAC,GAAKmE,EAAQ5D,CAAC,EAAEP,CAAC,EAE/BsE,EAAStE,CAAC,GAAKkE,CACnB,CAIA,MAAMW,EAAQV,EAAQD,CAAC,EAKvB,GAJAb,EAAYkB,EAAW,EAAIV,EAAKS,EAAU,CAACT,EAAKgB,CAAK,EACrDN,EAAU,GAAKpC,EAAEoC,CAAS,EAGtBA,EAAU,GAAKJ,EAAQ,CAAC,EAAE,GAC1Bd,EAAYoB,EAAU,EAAIX,EAAKQ,EAAU,CAACR,EAAKe,CAAK,EACpDJ,EAAS,GAAKtC,EAAEsC,CAAQ,EACpBA,EAAS,GAAKF,EAAU,GACxBH,EAAcK,CAAQ,EAEtBL,EAAcG,CAAS,UAMtBA,EAAU,IAAMJ,EAAQD,EAAI,CAAC,EAAE,GAAI,CACxC,IAAIY,EAAe,GAsBnB,GApBIP,EAAU,GAAKM,EAAM,IAErBxB,EAAYmB,EAAY,EAAIT,EAAKO,EAAU,CAACP,EAAKc,CAAK,EACtDL,EAAW,GAAKrC,EAAEqC,CAAU,EACxBA,EAAW,GAAKK,EAAM,GACtBT,EAAcI,CAAU,EAExBM,EAAe,KAInBzB,EAAYmB,EAAY,EAAIT,EAAMF,EAAKS,EAAUP,EAAMF,EAAKgB,CAAK,EACjEL,EAAW,GAAKrC,EAAEqC,CAAU,EACxBA,EAAW,GAAKD,EAAU,GAC1BH,EAAcI,CAAU,EAExBM,EAAe,IAInBA,EAAc,CAEd,GAAId,GAAS,EAAG,MAGhB,QAAShE,EAAI,EAAGA,EAAImE,EAAQ,OAAQ,EAAEnE,EAClCqD,EAAYc,EAAQnE,CAAC,EAAG,EAAIgE,EAAOG,EAAQ,CAAC,EAAGH,EAAOG,EAAQnE,CAAC,CAAC,EAChEmE,EAAQnE,CAAC,EAAE,GAAKmC,EAAEgC,EAAQnE,CAAC,CAAC,CAEpC,CACJ,MACIoE,EAAcG,CAAS,CAE/B,CAEA,OAAAJ,EAAQ,KAAKE,CAAS,EACf,CAAE,GAAIF,EAAQ,CAAC,EAAE,GAAI,EAAGA,EAAQ,CAAC,CAAC,CAC7C,CASA,SAASY,GAAgB5C,EAAG6C,EAAIC,EAASC,EAAMjF,EAAGkF,EAAIC,EAAI,CACtD,MAAMC,EAAOJ,EAAQ,GACfK,EAAYtC,EAAIiC,EAAQ,QAASD,CAAE,EACzC,IAAIO,EAAMF,EACNG,EAAUH,EACVI,EAAWH,EACXI,EAAK,EAETzF,EAAIA,GAAK,EACTkF,EAAKA,GAAM,KACXC,EAAKA,GAAM,GAEX,SAASO,EAAKC,EAAMC,EAAQC,EAAQ,CAChC,QAASpB,EAAY,EAAGA,EAAY,GAAI,EAAEA,EAMtC,GALAzE,GAAK2F,EAAOC,GAAU,EACtBxC,EAAY6B,EAAK,EAAG,EAAKD,EAAQ,EAAGhF,EAAG+E,CAAE,EACzCO,EAAML,EAAK,GAAK/C,EAAE+C,EAAK,EAAGA,EAAK,OAAO,EACtCO,EAAWzC,EAAIkC,EAAK,QAASF,CAAE,EAE3BO,EAAMF,EAAOF,EAAKlF,EAAIqF,GAAaC,GAAOO,EAC1CD,EAAS5F,MACN,CACH,GAAI,KAAK,IAAIwF,CAAQ,GAAK,CAACL,EAAKE,EAC5B,OAAOrF,EAGPwF,GAAYI,EAASD,IAAS,IAC9BC,EAASD,GAGbA,EAAO3F,EACP6F,EAASP,CACb,CAGJ,MAAO,EACX,CAEA,QAASb,EAAY,EAAGA,EAAY,GAAI,EAAEA,EAAW,CAIjD,GAHArB,EAAY6B,EAAK,EAAG,EAAKD,EAAQ,EAAGhF,EAAG+E,CAAE,EACzCO,EAAML,EAAK,GAAK/C,EAAE+C,EAAK,EAAGA,EAAK,OAAO,EACtCO,EAAWzC,EAAIkC,EAAK,QAASF,CAAE,EAC3BO,EAAMF,EAAOF,EAAKlF,EAAIqF,GAAcZ,GAAaa,GAAOC,EACxD,OAAOG,EAAKD,EAAIzF,EAAGuF,CAAO,EAG9B,GAAI,KAAK,IAAIC,CAAQ,GAAK,CAACL,EAAKE,EAC5B,OAAOrF,EAGX,GAAIwF,GAAY,EACZ,OAAOE,EAAK1F,EAAGyF,EAAIH,CAAG,EAG1BC,EAAUD,EACVG,EAAKzF,EACLA,GAAK,CACT,CAEA,OAAOA,CACX,CAEA,SAAS8F,GAAkB5D,EAAG6D,EAASC,EAAQ,CAG3C,IAAIhB,EAAU,CAAE,EAAGe,EAAQ,MAAK,EAAI,GAAI,EAAG,QAASA,EAAQ,MAAK,CAAE,EAC/Dd,EAAO,CAAE,EAAGc,EAAQ,MAAK,EAAI,GAAI,EAAG,QAASA,EAAQ,MAAK,CAAE,EAChE,MAAME,EAAKF,EAAQ,MAAK,EACxB,IAAIhB,EACAmB,EACAlG,EAAI,EACJoC,EAEJ4D,EAASA,GAAU,CAAA,EACnB5D,EAAgB4D,EAAO,eAAiBD,EAAQ,OAAS,GAEzDf,EAAQ,GAAK9C,EAAE8C,EAAQ,EAAGA,EAAQ,OAAO,EACzCD,EAAKC,EAAQ,QAAQ,MAAK,EAC1B/B,GAAM8B,EAAIC,EAAQ,QAAS,EAAE,EAE7B,QAASjF,EAAI,EAAGA,EAAIqC,EAAe,EAAErC,EAAG,CAapC,GAZAC,EAAI8E,GAAgB5C,EAAG6C,EAAIC,EAASC,EAAMjF,CAAC,EAGvCgG,EAAO,SACPA,EAAO,QAAQ,KAAK,CAChB,EAAGhB,EAAQ,EAAE,MAAK,EAClB,GAAIA,EAAQ,GACZ,QAASA,EAAQ,QAAQ,MAAK,EAC9B,MAAOhF,CACvB,CAAa,EAGD,CAACA,EAGDiD,GAAM8B,EAAIC,EAAQ,QAAS,EAAE,MAC1B,CAEH5B,EAAY6C,EAAI,EAAGhB,EAAK,QAAS,GAAID,EAAQ,OAAO,EAEpD,MAAMmB,EAAUpD,EAAIiC,EAAQ,QAASA,EAAQ,OAAO,EAC9CoB,EAAS,KAAK,IAAI,EAAGrD,EAAIkD,EAAIhB,EAAK,OAAO,EAAIkB,CAAO,EAE1D/C,EAAY2B,EAAIqB,EAAQrB,EAAI,GAAIE,EAAK,OAAO,EAE5CiB,EAAOlB,EACPA,EAAUC,EACVA,EAAOiB,CACX,CAEA,GAAIlD,GAAMgC,EAAQ,OAAO,GAAK,KAC1B,KAER,CAEA,OAAIgB,EAAO,SACPA,EAAO,QAAQ,KAAK,CAChB,EAAGhB,EAAQ,EAAE,MAAK,EAClB,GAAIA,EAAQ,GACZ,QAASA,EAAQ,QAAQ,MAAK,EAC9B,MAAOhF,CACnB,CAAS,EAGEgF,CACX,CASA,SAASqB,GAAKC,EAAMnE,EAAa,GAAI,CACnCA,EAAW,cAAgBA,EAAW,eAAiB,IAEvD,MAAMoE,EAAgBpE,EAAW,eAAiBqE,GAC5CC,EAAOtE,EAAW,cAAgBuE,GAGlCC,EAAQC,GAAgBN,EAAMnE,CAAU,EAGxChD,EAAUoH,EAAcI,EAAOxE,CAAU,EAGzC0E,EAAS,OAAO,KAAK1H,CAAO,EAE5B4G,EAAU,CAAA,EAChB,UAAWe,KAASD,EAClBd,EAAQ,KAAK5G,EAAQ2H,CAAK,EAAE,CAAC,EAC7Bf,EAAQ,KAAK5G,EAAQ2H,CAAK,EAAE,CAAC,EAuB/B,MAAMC,EAnBWxD,GACdyD,GAAW,CACV,MAAMhC,EAAU,CAAA,EAChB,QAASjF,EAAI,EAAGA,EAAI8G,EAAO,OAAQ,EAAE9G,EAAG,CACtC,MAAM+G,EAAQD,EAAO9G,CAAC,EACtBiF,EAAQ8B,CAAK,EAAI,CACf,EAAGE,EAAO,EAAIjH,CAAC,EACf,EAAGiH,EAAO,EAAIjH,EAAI,CAAC,EACnB,OAAQZ,EAAQ2H,CAAK,EAAE,MAEjC,CACM,CACA,OAAOL,EAAKzB,EAAS2B,CAAK,CAC5B,EACAZ,EACA5D,CACJ,EAG6B,EAC3B,QAASpC,EAAI,EAAGA,EAAI8G,EAAO,OAAQ,EAAE9G,EAAG,CACtC,MAAM+G,EAAQD,EAAO9G,CAAC,EACtBZ,EAAQ2H,CAAK,EAAE,EAAIC,EAAU,EAAIhH,CAAC,EAClCZ,EAAQ2H,CAAK,EAAE,EAAIC,EAAU,EAAIhH,EAAI,CAAC,CACxC,CAEA,OAAOZ,CACT,CAEA,MAAM8H,GAAQ,MAUd,SAASC,GAA0B5F,EAAIC,EAAI4F,EAAS,CAElD,OAAI,KAAK,IAAI7F,EAAIC,CAAE,EAAI,KAAK,IAAID,EAAIC,CAAE,EAAI,KAAK,IAAM4F,EAAUF,GACtD,KAAK,IAAI3F,EAAKC,CAAE,EAGlBU,GAAQrB,GAAaS,GAAcC,EAAIC,EAAIX,CAAQ,EAAIuG,EAAS,EAAG7F,EAAKC,CAAE,CACnF,CAUA,SAASqF,GAAgBD,EAAOxE,EAAa,GAAI,CAC/C,MAAMiF,EAAWjF,EAAW,SACtBf,EAAIuF,EAAM,IAAKU,GAAM,OAAO,OAAO,GAAIA,CAAC,CAAC,EAE/C,SAASC,EAAMC,EAAK,CAClB,OAAOA,EAAI,KAAK,GAAG,CACrB,CAEA,GAAIH,EAAU,CAGZ,MAAMI,EAAQ,IAAI,IAClB,UAAWC,KAAQrG,EACjB,QAASrB,EAAI,EAAGA,EAAI0H,EAAK,KAAK,OAAQ1H,IAAK,CACzC,MAAM2H,EAAK,OAAOD,EAAK,KAAK1H,CAAC,CAAC,EAC9ByH,EAAM,IAAIE,EAAID,EAAK,MAAQD,EAAM,IAAIE,CAAE,GAAK,EAAE,EAC9C,QAASpH,EAAIP,EAAI,EAAGO,EAAImH,EAAK,KAAK,OAAQnH,IAAK,CAC7C,MAAMqH,EAAK,OAAOF,EAAK,KAAKnH,CAAC,CAAC,EACxBsH,EAAK,GAAGF,CAAE,IAAIC,CAAE,GAChBE,EAAK,GAAGF,CAAE,IAAID,CAAE,GACtBF,EAAM,IAAII,EAAIH,EAAK,MAAQD,EAAM,IAAII,CAAE,GAAK,EAAE,EAC9CJ,EAAM,IAAIK,EAAIJ,EAAK,MAAQD,EAAM,IAAIK,CAAE,GAAK,EAAE,CAChD,CACF,CAEF,UAAWJ,KAAQrG,EACbqG,EAAK,KAAK,OAAS,IACrBA,EAAK,KAAOD,EAAM,IAAIF,EAAMG,EAAK,IAAI,CAAC,EAG5C,CAGA,MAAMK,EAAM,CAAA,EAGNC,EAAQ,IAAI,IAClB,UAAWN,KAAQrG,EACjB,GAAIqG,EAAK,KAAK,SAAW,EACvBK,EAAI,KAAKL,EAAK,KAAK,CAAC,CAAC,UACZA,EAAK,KAAK,SAAW,EAAG,CACjC,MAAMzH,EAAIyH,EAAK,KAAK,CAAC,EACfxH,EAAIwH,EAAK,KAAK,CAAC,EACrBM,EAAM,IAAIT,EAAMG,EAAK,IAAI,CAAC,EAC1BM,EAAM,IAAIT,EAAM,CAACrH,EAAGD,CAAC,CAAC,CAAC,CACzB,CAGF8H,EAAI,KAAK,CAAC9H,EAAGC,IAAOD,IAAMC,EAAI,EAAID,EAAIC,EAAI,GAAK,CAAG,EAElD,QAASF,EAAI,EAAGA,EAAI+H,EAAI,OAAQ,EAAE/H,EAAG,CACnC,MAAMC,EAAI8H,EAAI/H,CAAC,EACf,QAASO,EAAIP,EAAI,EAAGO,EAAIwH,EAAI,OAAQ,EAAExH,EAAG,CACvC,MAAML,EAAI6H,EAAIxH,CAAC,EACVyH,EAAM,IAAIT,EAAM,CAACtH,EAAGC,CAAC,CAAC,CAAC,GAC1BmB,EAAE,KAAK,CAAE,KAAM,CAACpB,EAAGC,CAAC,EAAG,KAAM,EAAG,CAEpC,CACF,CACA,OAAOmB,CACT,CASA,SAAS4G,GAAoBrB,EAAOL,EAAMO,EAAQ,CAKhD,MAAMoB,EAAYpF,GAAOyD,EAAK,OAAQA,EAAK,MAAM,EAI3C4B,EAAcrF,GAAOyD,EAAK,OAAQA,EAAK,MAAM,EAInD,OAAAK,EACG,OAAQ/D,GAAMA,EAAE,KAAK,SAAW,CAAC,EACjC,QAASoC,GAAY,CACpB,MAAMmD,EAAOtB,EAAO7B,EAAQ,KAAK,CAAC,CAAC,EAC7BoD,EAAQvB,EAAO7B,EAAQ,KAAK,CAAC,CAAC,EAC9B1D,EAAK,KAAK,KAAKgF,EAAK6B,CAAI,EAAE,KAAO,KAAK,EAAE,EACxC5G,EAAK,KAAK,KAAK+E,EAAK8B,CAAK,EAAE,KAAO,KAAK,EAAE,EACzCxH,EAAWsG,GAA0B5F,EAAIC,EAAIyD,EAAQ,IAAI,EAE/DiD,EAAUE,CAAI,EAAEC,CAAK,EAAIH,EAAUG,CAAK,EAAED,CAAI,EAAIvH,EAIlD,IAAIuC,EAAI,EACJ6B,EAAQ,KAAO,OAAS,KAAK,IAAIsB,EAAK6B,CAAI,EAAE,KAAM7B,EAAK8B,CAAK,EAAE,IAAI,EACpEjF,EAAI,EACK6B,EAAQ,MAAQ,QACzB7B,EAAI,IAEN+E,EAAYC,CAAI,EAAEC,CAAK,EAAIF,EAAYE,CAAK,EAAED,CAAI,EAAIhF,CACxD,CAAC,EAEI,CAAE,UAAA8E,EAAW,YAAAC,CAAW,CACjC,CAGA,SAASG,GAAuBzF,EAAG0F,EAASL,EAAWC,EAAa,CAClE,QAASnI,EAAI,EAAGA,EAAIuI,EAAQ,OAAQ,EAAEvI,EACpCuI,EAAQvI,CAAC,EAAI,EAGf,IAAI0G,EAAO,EACX,QAAS1G,EAAI,EAAGA,EAAIkI,EAAU,OAAQ,EAAElI,EAAG,CACzC,MAAMwI,EAAK3F,EAAE,EAAI7C,CAAC,EACZyI,EAAK5F,EAAE,EAAI7C,EAAI,CAAC,EACtB,QAASO,EAAIP,EAAI,EAAGO,EAAI2H,EAAU,OAAQ,EAAE3H,EAAG,CAC7C,MAAMmI,EAAK7F,EAAE,EAAItC,CAAC,EACZoI,EAAK9F,EAAE,EAAItC,EAAI,CAAC,EAChBqI,EAAMV,EAAUlI,CAAC,EAAEO,CAAC,EACpBsI,EAAaV,EAAYnI,CAAC,EAAEO,CAAC,EAE7BuI,GAAmBJ,EAAKF,IAAOE,EAAKF,IAAOG,EAAKF,IAAOE,EAAKF,GAC5D5H,EAAW,KAAK,KAAKiI,CAAe,EACpCrG,EAAQqG,EAAkBF,EAAMA,EAEjCC,EAAa,GAAKhI,GAAY+H,GAASC,EAAa,GAAKhI,GAAY+H,IAI1ElC,GAAQ,EAAIjE,EAAQA,EAEpB8F,EAAQ,EAAIvI,CAAC,GAAK,EAAIyC,GAAS+F,EAAKE,GACpCH,EAAQ,EAAIvI,EAAI,CAAC,GAAK,EAAIyC,GAASgG,EAAKE,GAExCJ,EAAQ,EAAIhI,CAAC,GAAK,EAAIkC,GAASiG,EAAKF,GACpCD,EAAQ,EAAIhI,EAAI,CAAC,GAAK,EAAIkC,GAASkG,EAAKF,GAC1C,CACF,CACA,OAAO/B,CACT,CAMA,SAASD,GAAkBG,EAAOX,EAAS,GAAI,CAC7C,IAAID,EAAU+C,GAAanC,EAAOX,CAAM,EACxC,MAAMS,EAAOT,EAAO,cAAgBU,GAMpC,GAAIC,EAAM,QAAU,EAAG,CACrB,MAAMoC,EAAcC,GAAqBrC,EAAOX,CAAM,EAChDiD,EAAkBxC,EAAKsC,EAAapC,CAAK,EACzCuC,EAAazC,EAAKV,EAASY,CAAK,EAElCsC,EAAkB,KAAOC,IAC3BnD,EAAUgD,EAEd,CACA,OAAOhD,CACT,CAOA,SAASiD,GAAqBrC,EAAOX,EAAS,GAAI,CAChD,MAAMmD,EAAWnD,EAAO,UAAY,GAG9BM,EAAO,CAAA,EACPO,EAAS,CAAA,EACf,UAAWY,KAAQd,EACbc,EAAK,KAAK,SAAW,IACvBZ,EAAOY,EAAK,KAAK,CAAC,CAAC,EAAInB,EAAK,OAC5BA,EAAK,KAAKmB,CAAI,GAIlB,GAAI,CAAE,UAAAQ,EAAW,YAAAC,CAAW,EAAKF,GAAoBrB,EAAOL,EAAMO,CAAM,EAIxE,MAAMuC,EAAOpG,GAAMiF,EAAU,IAAIjF,EAAK,CAAC,EAAIiF,EAAU,OACrDA,EAAYA,EAAU,IAAKoB,GAAQA,EAAI,IAAKnG,GAAUA,EAAQkG,CAAI,CAAC,EAEnE,MAAME,EAAM,CAAC1G,EAAG0F,IAAYD,GAAuBzF,EAAG0F,EAASL,EAAWC,CAAW,EAErF,IAAIqB,EAAO,KACX,QAASxJ,EAAI,EAAGA,EAAIoJ,EAAU,EAAEpJ,EAAG,CACjC,MAAMgG,EAAUpD,GAAMsF,EAAU,OAAS,CAAC,EAAE,IAAI,KAAK,MAAM,EAErDjD,EAAUc,GAAkBwD,EAAKvD,EAASC,CAAM,GAClD,CAACuD,GAAQvE,EAAQ,GAAKuE,EAAK,MAC7BA,EAAOvE,EAEX,CAEA,MAAM+B,EAAYwC,EAAK,EAIjBpK,EAAU,CAAA,EAChB,QAASY,EAAI,EAAGA,EAAIuG,EAAK,OAAQ,EAAEvG,EAAG,CACpC,MAAMyJ,EAAMlD,EAAKvG,CAAC,EAClBZ,EAAQqK,EAAI,KAAK,CAAC,CAAC,EAAI,CACrB,EAAGzC,EAAU,EAAIhH,CAAC,EAAIqJ,EACtB,EAAGrC,EAAU,EAAIhH,EAAI,CAAC,EAAIqJ,EAC1B,OAAQ,KAAK,KAAKI,EAAI,KAAO,KAAK,EAAE,CAC1C,CACE,CAEA,GAAIxD,EAAO,QACT,UAAWrE,KAAKqE,EAAO,QACrB/C,GAAMtB,EAAE,EAAGyH,CAAI,EAGnB,OAAOjK,CACT,CASA,SAAS2J,GAAanC,EAAOX,EAAQ,CACnC,MAAMS,EAAOT,GAAUA,EAAO,aAAeA,EAAO,aAAeU,GAI7DvH,EAAU,CAAA,EAEVsK,EAAc,CAAA,EACpB,UAAWhC,KAAQd,EACjB,GAAIc,EAAK,KAAK,SAAW,EAAG,CAC1B,MAAM+B,EAAM/B,EAAK,KAAK,CAAC,EACvBtI,EAAQqK,CAAG,EAAI,CACb,EAAG,KACH,EAAG,KACH,MAAOrK,EAAQ,OACf,KAAMsI,EAAK,KACX,OAAQ,KAAK,KAAKA,EAAK,KAAO,KAAK,EAAE,CAC7C,EACMgC,EAAYD,CAAG,EAAI,CAAA,CACrB,CAGF7C,EAAQA,EAAM,OAAQ3G,GAAMA,EAAE,KAAK,SAAW,CAAC,EAG/C,UAAWgF,KAAW2B,EAAO,CAC3B,IAAI+C,EAAS1E,EAAQ,QAAU,KAAOA,EAAQ,OAAS,EACvD,MAAMmD,EAAOnD,EAAQ,KAAK,CAAC,EACrBoD,EAAQpD,EAAQ,KAAK,CAAC,EAGxBA,EAAQ,KAAOiC,IAAS,KAAK,IAAI9H,EAAQgJ,CAAI,EAAE,KAAMhJ,EAAQiJ,CAAK,EAAE,IAAI,IAC1EsB,EAAS,GAGXD,EAAYtB,CAAI,EAAE,KAAK,CAAE,IAAKC,EAAO,KAAMpD,EAAQ,KAAM,OAAA0E,EAAQ,EACjED,EAAYrB,CAAK,EAAE,KAAK,CAAE,IAAKD,EAAM,KAAMnD,EAAQ,KAAM,OAAA0E,EAAQ,CACnE,CAGA,MAAMC,EAAiB,CAAA,EACvB,OAAO,KAAKF,CAAW,EAAE,QAASD,GAAQ,CACxC,IAAII,EAAO,EACX,QAAS7J,EAAI,EAAGA,EAAI0J,EAAYD,CAAG,EAAE,OAAQ,EAAEzJ,EAC7C6J,GAAQH,EAAYD,CAAG,EAAEzJ,CAAC,EAAE,KAAO0J,EAAYD,CAAG,EAAEzJ,CAAC,EAAE,OAGzD4J,EAAe,KAAK,CAAE,IAAAH,EAAK,KAAAI,CAAI,CAAE,CACnC,CAAC,EAGD,SAASxF,EAAUpE,EAAGC,EAAG,CACvB,OAAOA,EAAE,KAAOD,EAAE,IACpB,CACA2J,EAAe,KAAKvF,CAAS,EAG7B,MAAMyF,EAAa,CAAA,EACnB,SAASC,EAAaC,EAAS,CAC7B,OAAOA,EAAQ,OAAOF,CACxB,CAOA,SAASG,EAAYhJ,EAAOiJ,EAAO,CACjC9K,EAAQ8K,CAAK,EAAE,EAAIjJ,EAAM,EACzB7B,EAAQ8K,CAAK,EAAE,EAAIjJ,EAAM,EACzB6I,EAAWI,CAAK,EAAI,EACtB,CAGAD,EAAY,CAAE,EAAG,EAAG,EAAG,CAAC,EAAIL,EAAe,CAAC,EAAE,GAAG,EAKjD,QAAS5J,EAAI,EAAGA,EAAI4J,EAAe,OAAQ,EAAE5J,EAAG,CAC9C,MAAMmK,EAAWP,EAAe5J,CAAC,EAAE,IAC7BoH,EAAUsC,EAAYS,CAAQ,EAAE,OAAOJ,CAAY,EACnDN,EAAMrK,EAAQ+K,CAAQ,EAG5B,GAFA/C,EAAQ,KAAK/C,CAAS,EAElB+C,EAAQ,SAAW,EAErB,KAAM,8CAIR,MAAMnF,EAAS,CAAA,EACf,QAAS1B,EAAI,EAAGA,EAAI6G,EAAQ,OAAQ,EAAE7G,EAAG,CAEvC,MAAMH,EAAKhB,EAAQgI,EAAQ7G,CAAC,EAAE,GAAG,EAC3B6J,EAAKjD,GAA0BsC,EAAI,OAAQrJ,EAAG,OAAQgH,EAAQ7G,CAAC,EAAE,IAAI,EAG3E0B,EAAO,KAAK,CAAE,EAAG7B,EAAG,EAAIgK,EAAI,EAAGhK,EAAG,EAAG,EACrC6B,EAAO,KAAK,CAAE,EAAG7B,EAAG,EAAIgK,EAAI,EAAGhK,EAAG,EAAG,EACrC6B,EAAO,KAAK,CAAE,EAAG7B,EAAG,EAAIgK,EAAI,EAAGhK,EAAG,EAAG,EACrC6B,EAAO,KAAK,CAAE,EAAG7B,EAAG,EAAIgK,EAAI,EAAGhK,EAAG,EAAG,EAIrC,QAASiK,EAAI9J,EAAI,EAAG8J,EAAIjD,EAAQ,OAAQ,EAAEiD,EAAG,CAC3C,MAAMlK,EAAKf,EAAQgI,EAAQiD,CAAC,EAAE,GAAG,EAC3BC,EAAKnD,GAA0BsC,EAAI,OAAQtJ,EAAG,OAAQiH,EAAQiD,CAAC,EAAE,IAAI,EAErEE,EAAcnJ,GAClB,CAAE,EAAGhB,EAAG,EAAG,EAAGA,EAAG,EAAG,OAAQgK,CAAE,EAC9B,CAAE,EAAGjK,EAAG,EAAG,EAAGA,EAAG,EAAG,OAAQmK,CAAE,CACxC,EACQrI,EAAO,KAAK,GAAGsI,CAAW,CAC5B,CACF,CAIA,IAAIC,EAAW,KACXC,EAAYxI,EAAO,CAAC,EACxB,UAAWhB,KAASgB,EAAQ,CAC1B7C,EAAQ+K,CAAQ,EAAE,EAAIlJ,EAAM,EAC5B7B,EAAQ+K,CAAQ,EAAE,EAAIlJ,EAAM,EAC5B,MAAMyJ,EAAYhE,EAAKtH,EAASwH,CAAK,EACjC8D,EAAYF,IACdA,EAAWE,EACXD,EAAYxJ,EAEhB,CAEAgJ,EAAYQ,EAAWN,CAAQ,CACjC,CAEA,OAAO/K,CACT,CAUA,SAASuH,GAAavH,EAASuL,EAAU,CACvC,IAAIC,EAAS,EAEb,UAAWlD,KAAQiD,EAAU,CAC3B,GAAIjD,EAAK,KAAK,SAAW,EACvB,SAGF,IAAIN,EACJ,GAAIM,EAAK,KAAK,SAAW,EAAG,CAC1B,MAAMU,EAAOhJ,EAAQsI,EAAK,KAAK,CAAC,CAAC,EAC3BW,EAAQjJ,EAAQsI,EAAK,KAAK,CAAC,CAAC,EAClCN,EAAU9F,GAAc8G,EAAK,OAAQC,EAAM,OAAQxH,EAASuH,EAAMC,CAAK,CAAC,CAC1E,MACEjB,EAAUjI,GAAiBuI,EAAK,KAAK,IAAKjG,GAAMrC,EAAQqC,CAAC,CAAC,CAAC,EAG7D,MAAMkI,EAASjC,EAAK,QAAU,KAAOA,EAAK,OAAS,EACnDkD,GAAUjB,GAAUvC,EAAUM,EAAK,OAASN,EAAUM,EAAK,KAC7D,CAEA,OAAOkD,CACT,CAEA,SAASC,GAAqBzL,EAASuL,EAAU,CAC/C,IAAIC,EAAS,EAEb,UAAWlD,KAAQiD,EAAU,CAC3B,GAAIjD,EAAK,KAAK,SAAW,EACvB,SAGF,IAAIN,EACJ,GAAIM,EAAK,KAAK,SAAW,EAAG,CAC1B,MAAMU,EAAOhJ,EAAQsI,EAAK,KAAK,CAAC,CAAC,EAC3BW,EAAQjJ,EAAQsI,EAAK,KAAK,CAAC,CAAC,EAClCN,EAAU9F,GAAc8G,EAAK,OAAQC,EAAM,OAAQxH,EAASuH,EAAMC,CAAK,CAAC,CAC1E,MACEjB,EAAUjI,GAAiBuI,EAAK,KAAK,IAAKjG,GAAMrC,EAAQqC,CAAC,CAAC,CAAC,EAG7D,MAAMkI,EAASjC,EAAK,QAAU,KAAOA,EAAK,OAAS,EAC7CoD,EAAsB,KAAK,KAAK1D,EAAU,IAAMM,EAAK,KAAO,EAAE,EACpEkD,GAAUjB,EAASmB,EAAsBA,CAC3C,CAEA,OAAOF,CACT,CAQA,SAASG,GAAiB3L,EAAS4L,EAAaC,EAAkB,CAQhE,GAPIA,GAAoB,KACtB7L,EAAQ,KAAK,CAACa,EAAGC,IAAMA,EAAE,OAASD,EAAE,MAAM,EAE1Cb,EAAQ,KAAK6L,CAAgB,EAI3B7L,EAAQ,OAAS,EAAG,CACtB,MAAM8L,EAAW9L,EAAQ,CAAC,EAAE,EACtB+L,EAAW/L,EAAQ,CAAC,EAAE,EAE5B,UAAWoB,KAAUpB,EACnBoB,EAAO,GAAK0K,EACZ1K,EAAO,GAAK2K,CAEhB,CAcA,GAZI/L,EAAQ,SAAW,GAGRyB,EAASzB,EAAQ,CAAC,EAAGA,EAAQ,CAAC,CAAC,EACjC,KAAK,IAAIA,EAAQ,CAAC,EAAE,OAASA,EAAQ,CAAC,EAAE,MAAM,IACvDA,EAAQ,CAAC,EAAE,EAAIA,EAAQ,CAAC,EAAE,EAAIA,EAAQ,CAAC,EAAE,OAASA,EAAQ,CAAC,EAAE,OAAS,MACtEA,EAAQ,CAAC,EAAE,EAAIA,EAAQ,CAAC,EAAE,GAM1BA,EAAQ,OAAS,EAAG,CACtB,MAAMgM,EAAW,KAAK,MAAMhM,EAAQ,CAAC,EAAE,EAAGA,EAAQ,CAAC,EAAE,CAAC,EAAI4L,EACpD5H,EAAI,KAAK,IAAIgI,CAAQ,EACrB9D,EAAI,KAAK,IAAI8D,CAAQ,EAE3B,UAAW5K,KAAUpB,EAAS,CAC5B,MAAMyD,EAAIrC,EAAO,EACXuC,EAAIvC,EAAO,EACjBA,EAAO,EAAI4C,EAAIP,EAAIyE,EAAIvE,EACvBvC,EAAO,EAAI8G,EAAIzE,EAAIO,EAAIL,CACzB,CACF,CAIA,GAAI3D,EAAQ,OAAS,EAAG,CACtB,IAAIiM,EAAQ,KAAK,MAAMjM,EAAQ,CAAC,EAAE,EAAGA,EAAQ,CAAC,EAAE,CAAC,EAAI4L,EACrD,KAAOK,EAAQ,GACbA,GAAS,EAAI,KAAK,GAEpB,KAAOA,EAAQ,EAAI,KAAK,IACtBA,GAAS,EAAI,KAAK,GAEpB,GAAIA,EAAQ,KAAK,GAAI,CACnB,MAAMC,EAAQlM,EAAQ,CAAC,EAAE,GAAK,MAAQA,EAAQ,CAAC,EAAE,GACjD,UAAWoB,KAAUpB,EAAS,CAC5B,IAAIqC,GAAKjB,EAAO,EAAI8K,EAAQ9K,EAAO,IAAM,EAAI8K,EAAQA,GACrD9K,EAAO,EAAI,EAAIiB,EAAIjB,EAAO,EAC1BA,EAAO,EAAI,EAAIiB,EAAI6J,EAAQ9K,EAAO,CACpC,CACF,CACF,CACF,CAOA,SAAS+K,GAAgBnM,EAAS,CAEhCA,EAAQ,QAASoB,GAAW,CAC1BA,EAAO,OAASA,CAClB,CAAC,EAGD,SAASgL,EAAKhL,EAAQ,CACpB,OAAIA,EAAO,SAAWA,IACpBA,EAAO,OAASgL,EAAKhL,EAAO,MAAM,GAE7BA,EAAO,MAChB,CAEA,SAASiL,EAAM5I,EAAGE,EAAG,CACnB,MAAM2I,EAAQF,EAAK3I,CAAC,EACd8I,EAAQH,EAAKzI,CAAC,EACpB2I,EAAM,OAASC,CACjB,CAGA,QAAS,EAAI,EAAG,EAAIvM,EAAQ,OAAQ,EAAE,EACpC,QAASmB,EAAI,EAAI,EAAGA,EAAInB,EAAQ,OAAQ,EAAEmB,EAAG,CAC3C,MAAMqL,EAAcxM,EAAQ,CAAC,EAAE,OAASA,EAAQmB,CAAC,EAAE,OAC/CM,EAASzB,EAAQ,CAAC,EAAGA,EAAQmB,CAAC,CAAC,EAAI,MAAQqL,GAC7CH,EAAMrM,EAAQmB,CAAC,EAAGnB,EAAQ,CAAC,CAAC,CAEhC,CAKF,MAAMyM,EAAmB,IAAI,IAC7B,QAAS,EAAI,EAAG,EAAIzM,EAAQ,OAAQ,EAAE,EAAG,CACvC,MAAM2H,EAAQyE,EAAKpM,EAAQ,CAAC,CAAC,EAAE,OAAO,MACjCyM,EAAiB,IAAI9E,CAAK,GAC7B8E,EAAiB,IAAI9E,EAAO,EAAE,EAEhC8E,EAAiB,IAAI9E,CAAK,EAAE,KAAK3H,EAAQ,CAAC,CAAC,CAC7C,CAGA,OAAAA,EAAQ,QAASoB,GAAW,CAC1B,OAAOA,EAAO,MAChB,CAAC,EAGM,MAAM,KAAKqL,EAAiB,OAAM,CAAE,CAC7C,CAMA,SAASC,GAAe1M,EAAS,CAC/B,MAAM2M,EAAUtK,GAAM,CACpB,MAAMuK,EAAK5M,EAAQ,OAAO,CAAC6M,EAAK7I,IAAM,KAAK,IAAI6I,EAAK7I,EAAE3B,CAAC,EAAI2B,EAAE,MAAM,EAAG,OAAO,iBAAiB,EACxF8I,EAAK9M,EAAQ,OAAO,CAAC6M,EAAK7I,IAAM,KAAK,IAAI6I,EAAK7I,EAAE3B,CAAC,EAAI2B,EAAE,MAAM,EAAG,OAAO,iBAAiB,EAC9F,MAAO,CAAE,IAAK4I,EAAI,IAAKE,CAAE,CAC3B,EACA,MAAO,CAAE,OAAQH,EAAO,GAAG,EAAG,OAAQA,EAAO,GAAG,CAAC,CACnD,CASA,SAASI,GAAkBC,EAAUpB,EAAaC,EAAkB,CAC9DD,GAAe,OACjBA,EAAc,KAAK,GAAK,GAK1B,IAAI5L,EAAUiN,GAAmBD,CAAQ,EAAE,IAAK3K,GAAM,OAAO,OAAO,CAAA,EAAIA,CAAC,CAAC,EAG1E,MAAM6K,EAAWf,GAAgBnM,CAAO,EAGxC,UAAWmN,KAAWD,EAAU,CAC9BvB,GAAiBwB,EAASvB,EAAaC,CAAgB,EACvD,MAAMuB,EAASV,GAAeS,CAAO,EACrCA,EAAQ,MAAQC,EAAO,OAAO,IAAMA,EAAO,OAAO,MAAQA,EAAO,OAAO,IAAMA,EAAO,OAAO,KAC5FD,EAAQ,OAASC,CACnB,CACAF,EAAS,KAAK,CAACrM,EAAGC,IAAMA,EAAE,KAAOD,EAAE,IAAI,EAGvCb,EAAUkN,EAAS,CAAC,EACpB,IAAIG,EAAerN,EAAQ,OAC3B,MAAMsN,GAAWD,EAAa,OAAO,IAAMA,EAAa,OAAO,KAAO,GAOtE,SAASE,EAAWJ,EAASlE,EAAOuE,EAAQ,CAC1C,GAAI,CAACL,EACH,OAGF,MAAMC,EAASD,EAAQ,OAEvB,IAAIM,EAEAC,EAEJ,GAAIzE,EACFwE,EAAUJ,EAAa,OAAO,IAAMD,EAAO,OAAO,IAAME,MACnD,CACLG,EAAUJ,EAAa,OAAO,IAAMD,EAAO,OAAO,IAClD,MAAMO,GACHP,EAAO,OAAO,IAAMA,EAAO,OAAO,KAAO,GAAKC,EAAa,OAAO,IAAMA,EAAa,OAAO,KAAO,EAClGM,EAAY,IACdF,GAAWE,EAEf,CAEA,GAAIH,EACFE,EAAUL,EAAa,OAAO,IAAMD,EAAO,OAAO,IAAME,MACnD,CACLI,EAAUL,EAAa,OAAO,IAAMD,EAAO,OAAO,IAClD,MAAMO,GACHP,EAAO,OAAO,IAAMA,EAAO,OAAO,KAAO,GAAKC,EAAa,OAAO,IAAMA,EAAa,OAAO,KAAO,EAClGM,EAAY,IACdD,GAAWC,EAEf,CAEA,UAAW3J,KAAKmJ,EACdnJ,EAAE,GAAKyJ,EACPzJ,EAAE,GAAK0J,EACP1N,EAAQ,KAAKgE,CAAC,CAElB,CAEA,IAAI8G,EAAQ,EACZ,KAAOA,EAAQoC,EAAS,QACtBK,EAAWL,EAASpC,CAAK,EAAG,GAAM,EAAK,EACvCyC,EAAWL,EAASpC,EAAQ,CAAC,EAAG,GAAO,EAAI,EAC3CyC,EAAWL,EAASpC,EAAQ,CAAC,EAAG,GAAM,EAAI,EAC1CA,GAAS,EAITuC,EAAeX,GAAe1M,CAAO,EAIvC,OAAO4N,GAAiB5N,CAAO,CACjC,CAcA,SAAS6N,GAAcb,EAAUxL,EAAOsM,EAAQC,EAASC,EAAY,CACnE,MAAMhO,EAAUiN,GAAmBD,CAAQ,EAE3CxL,GAAS,EAAIuM,EACbD,GAAU,EAAIC,EAEd,KAAM,CAAE,OAAAE,EAAQ,OAAAC,GAAWxB,GAAe1M,CAAO,EAEjD,GAAIiO,EAAO,MAAQA,EAAO,KAAOC,EAAO,MAAQA,EAAO,IACrD,eAAQ,IAAI,0CAA0C,EAC/ClB,EAIT,IAAImB,EAEAC,EACJ,GAAIJ,EAAY,CACd,MAAMK,EAAkB,KAAK,KAAKL,EAAa,KAAK,EAAE,EAAI,EAC1DG,EAAW3M,EAAQ6M,EACnBD,EAAWN,EAASO,CACtB,MACEF,EAAW3M,GAASyM,EAAO,IAAMA,EAAO,KACxCG,EAAWN,GAAUI,EAAO,IAAMA,EAAO,KAG3C,MAAMI,EAAU,KAAK,IAAIF,EAAUD,CAAQ,EAErCV,GAAWjM,GAASyM,EAAO,IAAMA,EAAO,KAAOK,GAAW,EAC1DZ,GAAWI,GAAUI,EAAO,IAAMA,EAAO,KAAOI,GAAW,EAEjE,OAAOV,GACL5N,EAAQ,IAAKoB,IAAY,CACvB,OAAQkN,EAAUlN,EAAO,OACzB,EAAG2M,EAAUN,GAAWrM,EAAO,EAAI6M,EAAO,KAAOK,EACjD,EAAGP,EAAUL,GAAWtM,EAAO,EAAI8M,EAAO,KAAOI,EACjD,MAAOlN,EAAO,KACpB,EAAM,CACN,CACA,CAMA,SAASwM,GAAiB5N,EAAS,CAEjC,MAAMiC,EAAI,CAAA,EACV,UAAWb,KAAUpB,EACnBiC,EAAEb,EAAO,KAAK,EAAIA,EAEpB,OAAOa,CACT,CAKA,SAASgL,GAAmBD,EAAU,CAEpC,OADe,OAAO,KAAKA,CAAQ,EACrB,IAAKuB,GAAO,OAAO,OAAOvB,EAASuB,CAAE,EAAG,CAAE,MAAOA,CAAE,CAAE,CAAC,CACtE,CAiBA,SAASC,GAAYC,EAAU,GAAI,CACjC,IAAIC,EAAa,GACflN,EAAQ,IACRsM,EAAS,IACTC,EAAU,GACVY,EAAW,IACX/C,EAAc,KAAK,GAAK,EACxBgD,EAAY,GACZZ,EAAa,KACba,EAAO,GACPC,EAAS,GACTC,EAAW,KACXlD,EAAmB,KACnB5D,EAAW,GACX+G,EAAQ,KACRC,EAAwBR,GAAWA,EAAQ,sBAAwBA,EAAQ,sBAAwB,GAGnGS,EAAY,CAAA,EAIZC,EACEV,GAAWA,EAAQ,aACfA,EAAQ,aACRA,GAAWA,EAAQ,YACjBA,EAAQ,YACR,CACE,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,SACd,EACIW,EAAc,EACdC,EAAU,SAAUC,EAAK,CACvB,GAAIA,KAAOJ,EACT,OAAOA,EAAUI,CAAG,EAEtB,IAAIxN,EAAOoN,EAAUI,CAAG,EAAIH,EAAaC,CAAW,EACpD,OAAAA,GAAe,EACXA,GAAeD,EAAa,SAC9BC,EAAc,GAETtN,CACT,EACAyN,EAAiBrI,GACjBI,EAAOC,GAET,SAASiI,EAAMC,EAAW,CACxB,IAAIC,EAAOD,EAAU,MAAK,EAG1B,MAAME,EAAW,IAAI,IACrBD,EAAK,QAASE,GAAU,CAClBA,EAAM,MAAQ,GAAKA,EAAM,KAAK,QAAU,GAC1CD,EAAS,IAAIC,EAAM,KAAK,CAAC,CAAC,CAE9B,CAAC,EACDF,EAAOA,EAAK,OAAQE,GAAU,CAACA,EAAM,KAAK,KAAMvF,GAAQsF,EAAS,IAAItF,CAAG,CAAC,CAAC,EAE1E,IAAIrK,EAAU,CAAA,EACV6P,EAAc,CAAA,EAElB,GAAIH,EAAK,OAAS,EAAG,CACnB,IAAI1C,EAAWuC,EAAeG,EAAM,CAAE,aAAcpI,EAAM,SAAAW,EAAU,EAEhE2G,IACF5B,EAAWD,GAAkBC,EAAUpB,EAAaC,CAAgB,GAGtE7L,EAAU6N,GAAcb,EAAUxL,EAAOsM,EAAQC,EAASC,CAAU,EACpE6B,EAAcC,GAAmB9P,EAAS0P,EAAMT,CAAqB,CACvE,CAIA,MAAMc,EAAS,CAAA,EACfL,EAAK,QAASE,GAAU,CAClBA,EAAM,QACRG,EAAOH,EAAM,IAAI,EAAIA,EAAM,MAE/B,CAAC,EAED,SAASI,EAAM3N,EAAG,CAChB,GAAIA,EAAE,QAAQ0N,EACZ,OAAOA,EAAO1N,EAAE,IAAI,EAEtB,GAAIA,EAAE,KAAK,QAAU,EACnB,MAAO,GAAKA,EAAE,KAAK,CAAC,CAExB,CAGAoN,EAAU,UAAU,KAAK,EAAE,KAAK,CAACzP,CAAO,CAAC,EAAE,MAAK,EAAG,OAAO,KAAK,EAE/D,MAAMiQ,EAAMR,EAAU,OAAO,KAAK,EAE9Bf,EACFuB,EAAI,KAAK,UAAW,OAAOzO,CAAK,IAAIsM,CAAM,EAAE,EAE5CmC,EAAI,KAAK,QAASzO,CAAK,EAAE,KAAK,SAAUsM,CAAM,EAKhD,MAAMoC,EAAW,CAAA,EACjB,IAAIC,EAAc,GAClBF,EAAI,UAAU,iBAAiB,EAAE,KAAK,SAAU5N,EAAG,CACjD,MAAM+N,EAAO,KAAK,aAAa,GAAG,EAC9B/N,EAAE,KAAK,QAAU,GAAK+N,GAAQ,CAACnI,IACjCkI,EAAc,GACdD,EAAS7N,EAAE,KAAK,CAAC,CAAC,EAAIgO,GAAeD,CAAI,EAE7C,CAAC,EAGD,SAASE,EAAUjO,EAAG,CACpB,OAAQkO,GAAM,CACZ,MAAMvM,EAAI3B,EAAE,KAAK,IAAKgI,IAAQ,CAC5B,IAAImG,EAAQN,EAAS7F,EAAG,EACpBoG,EAAMzQ,EAAQqK,EAAG,EACrB,OAAKmG,IACHA,EAAQ,CAAE,EAAGhP,EAAQ,EAAG,EAAGsM,EAAS,EAAG,OAAQ,CAAC,GAE7C2C,IACHA,EAAM,CAAE,EAAGjP,EAAQ,EAAG,EAAGsM,EAAS,EAAG,OAAQ,CAAC,GAEzC,CACL,EAAG0C,EAAM,GAAK,EAAID,GAAKE,EAAI,EAAIF,EAC/B,EAAGC,EAAM,GAAK,EAAID,GAAKE,EAAI,EAAIF,EAC/B,OAAQC,EAAM,QAAU,EAAID,GAAKE,EAAI,OAASF,CAC1D,CACQ,CAAC,EACD,OAAOG,GAAqB1M,EAAGgL,CAAK,CACtC,CACF,CAGA,MAAM2B,EAAQV,EAAI,UAAU,YAAY,EAAE,KAAKP,EAAOrN,GAAMA,EAAE,IAAI,EAG5DuO,EAAQD,EACX,MAAK,EACL,OAAO,GAAG,EACV,KACC,QACCtO,GACC,kBAAkBA,EAAE,KAAK,QAAU,EAAI,SAAW,cAAc,GAC9DA,EAAE,QAAUA,EAAE,MAAQ,iBAAmB,EACrD,EACA,EACO,KAAK,iBAAmBA,GAAMA,EAAE,KAAK,KAAK,GAAG,CAAC,EAE3CwO,EAAYD,EAAM,OAAO,MAAM,EAC/BE,EAAYF,EACf,OAAO,MAAM,EACb,KAAK,QAAS,OAAO,EACrB,KAAMvO,GAAM2N,EAAM3N,CAAC,CAAC,EACpB,KAAK,cAAe,QAAQ,EAC5B,KAAK,KAAM,OAAO,EAClB,KAAK,IAAKb,EAAQ,CAAC,EACnB,KAAK,IAAKsM,EAAS,CAAC,EAGnBgB,IACF+B,EACG,MAAM,eAAgB,GAAG,EACzB,OAAQxO,GAAMA,EAAE,KAAK,QAAU,CAAC,EAChC,MAAM,OAASA,GAAOA,EAAE,OAASA,EAAE,OAASA,EAAE,MAAQA,EAAE,MAAQgN,EAAQhN,EAAE,IAAI,CAAE,EAChF,MAAM,eAAgB,KAAK,EAE9ByO,EAAU,MAAM,OAASzO,GACnBA,EAAE,QAAUA,EAAE,MACT,OAELoM,EAAQ,SACHA,EAAQ,SAEVpM,EAAE,KAAK,QAAU,EAAIgN,EAAQhN,EAAE,IAAI,EAAI,MAC/C,GAGH,SAAS0O,EAAa7I,EAAG,CACvB,OAAI,OAAOA,EAAE,YAAe,WACnBA,EAAE,WAAW,MAAM,EAAE,SAASyG,CAAQ,EAExCzG,CACT,CAGA,IAAI8I,EAASvB,EACTU,GAAe,OAAOa,EAAO,YAAe,YAC9CA,EAASD,EAAatB,CAAS,EAC/BuB,EAAO,UAAU,MAAM,EAAE,UAAU,IAAKV,CAAS,GAEjDU,EAAO,UAAU,MAAM,EAAE,KAAK,IAAM3O,GAAMqO,GAAqBrO,EAAE,KAAK,IAAKgI,GAAQrK,EAAQqK,CAAG,CAAC,CAAC,EAAG2E,CAAK,EAG1G,MAAMiC,EAAaD,EAChB,UAAU,MAAM,EAChB,OAAQ3O,GAAMA,EAAE,QAAQwN,CAAW,EACnC,KAAMxN,GAAM2N,EAAM3N,CAAC,CAAC,EACpB,KAAK,IAAMA,GAAM,KAAK,MAAMwN,EAAYxN,EAAE,IAAI,EAAE,CAAC,CAAC,EAClD,KAAK,IAAMA,GAAM,KAAK,MAAMwN,EAAYxN,EAAE,IAAI,EAAE,CAAC,CAAC,EAEjDwM,IACEsB,EAGE,OAAQc,EACVA,EAAW,GAAG,MAAOC,GAASlR,EAASgQ,CAAK,CAAC,EAE7CiB,EAAW,KAAK,MAAOC,GAASlR,EAASgQ,CAAK,CAAC,EAGjDiB,EAAW,KAAKC,GAASlR,EAASgQ,CAAK,CAAC,GAK5C,MAAMmB,EAAOJ,EAAaJ,EAAM,KAAI,CAAE,EAAE,OAAM,EAC1C,OAAOA,EAAM,YAAe,YAC9BQ,EAAK,UAAU,MAAM,EAAE,UAAU,IAAKb,CAAS,EAGjD,MAAMc,EAAWD,EACd,UAAU,MAAM,EAChB,KAAK,IAAK3P,EAAQ,CAAC,EACnB,KAAK,IAAKsM,EAAS,CAAC,EAIvB,OAAIiB,IAAa,OACf+B,EAAU,MAAM,YAAa,KAAK,EAClCG,EAAW,MAAM,YAAalC,CAAQ,EACtCqC,EAAS,MAAM,YAAa,KAAK,GAG5B,CAAE,QAAApR,EAAS,YAAA6P,EAAa,MAAAc,EAAO,MAAAC,EAAO,OAAAI,EAAQ,KAAAG,CAAI,CAC3D,CAEA,OAAA3B,EAAM,KAAO,SAAU6B,EAAG,CACxB,OAAK,UAAU,QACfxC,EAAOwC,EACA7B,GAFuBX,CAGhC,EAEAW,EAAM,WAAa,UAAY,CAC7B,OAAAd,EAAa,GACNc,CACT,EAEAA,EAAM,MAAQ,SAAU6B,EAAG,CACzB,OAAK,UAAU,QACf7P,EAAQ6P,EACD7B,GAFuBhO,CAGhC,EAEAgO,EAAM,OAAS,SAAU6B,EAAG,CAC1B,OAAK,UAAU,QACfvD,EAASuD,EACF7B,GAFuB1B,CAGhC,EAEA0B,EAAM,QAAU,SAAU6B,EAAG,CAC3B,OAAK,UAAU,QACftD,EAAUsD,EACH7B,GAFuBzB,CAGhC,EAEAyB,EAAM,SAAW,SAAU6B,EAAG,CAC5B,OAAK,UAAU,QACfpJ,EAAWoJ,EACJ7B,GAFuBvH,CAGhC,EAEAuH,EAAM,QAAU,SAAU6B,EAAG,CAC3B,OAAK,UAAU,QACfhC,EAAUgC,EACH7B,GAFuBH,CAGhC,EAEAG,EAAM,OAAS,SAAU6B,EAAG,CAC1B,OAAK,UAAU,QACfhC,EAAUgC,EACH7B,GAFuBH,CAGhC,EAEAG,EAAM,SAAW,SAAU6B,EAAG,CAC5B,OAAK,UAAU,QACftC,EAAWsC,EACJ7B,GAFuBT,CAGhC,EAEAS,EAAM,MAAQ,SAAU6B,EAAG,CACzB,OAAK,UAAU,QACfrC,EAAQqC,EACD7B,GAFuBR,CAGhC,EAEAQ,EAAM,SAAW,SAAU6B,EAAG,CAC5B,OAAK,UAAU,QACf1C,EAAW0C,EACJ7B,GAFuBb,CAGhC,EAEAa,EAAM,eAAiB,SAAU6B,EAAG,CAClC,OAAK,UAAU,QACf9B,EAAiB8B,EACV7B,GAFuBD,CAGhC,EAEAC,EAAM,UAAY,SAAU6B,EAAG,CAC7B,OAAK,UAAU,QACfzC,EAAYyC,EACL7B,GAFuBZ,CAGhC,EAEAY,EAAM,WAAa,SAAU6B,EAAG,CAC9B,OAAK,UAAU,QACfrD,EAAaqD,EACN7B,GAFuBxB,CAGhC,EAEAwB,EAAM,OAAS,SAAU6B,EAAG,CAC1B,OAAK,UAAU,QACfvC,EAASuC,EACF7B,GAFuBV,CAGhC,EAEAU,EAAM,YAAc,SAAU6B,EAAG,CAC/B,OAAK,UAAU,QACfzF,EAAcyF,EACP7B,GAFuB5D,CAGhC,EAEA4D,EAAM,iBAAmB,SAAU6B,EAAG,CACpC,OAAK,UAAU,QACfxF,EAAmBwF,EACZ7B,GAFuB3D,CAGhC,EAEA2D,EAAM,aAAe,SAAU6B,EAAG,CAChC,OAAK,UAAU,QACf/J,EAAO+J,IAAM,UAAY9J,GAAe8J,IAAM,WAAa5F,GAAuB4F,EAC3E7B,GAFuBlI,CAGhC,EAEOkI,CACT,CASA,SAAS0B,GAASlR,EAASsR,EAAU,CACnC,OAAO,SAAU5B,EAAM,CACrB,MAAM6B,EAAO,KACP/P,EAAQxB,EAAQ0P,EAAK,KAAK,CAAC,CAAC,EAAE,QAAU,GACxCM,EAAQsB,EAAS5B,CAAI,GAAK,GAE1B8B,EAAQxB,EAAM,MAAM,KAAK,EAAE,QAAO,EAElCyB,GAAYzB,EAAM,OAASwB,EAAM,QADtB,EAGjB,IAAIE,EAAOF,EAAM,IAAG,EAChBG,EAAO,CAACD,CAAI,EACZE,EAAa,EACjB,MAAMC,EAAa,IACnBN,EAAK,YAAc,KACnB,MAAMO,EAAS,CAAA,EAEf,SAASC,EAAOL,EAAM,CACpB,MAAMM,EAAQT,EAAK,cAAc,gBAAgBA,EAAK,aAAc,OAAO,EAC3E,OAAAS,EAAM,YAAcN,EACpBI,EAAO,KAAKE,CAAK,EACjBT,EAAK,OAAOS,CAAK,EACVA,CACT,CACA,IAAIA,EAAQD,EAAOL,CAAI,EAEvB,KACEA,EAAOF,EAAM,IAAG,EACZ,EAACE,GAFM,CAKXC,EAAK,KAAKD,CAAI,EACd,MAAMO,EAASN,EAAK,KAAK,GAAG,EAC5BK,EAAM,YAAcC,EAChBA,EAAO,OAASR,GAAYO,EAAM,sBAAqB,EAAKxQ,IAC9DmQ,EAAK,IAAG,EACRK,EAAM,YAAcL,EAAK,KAAK,GAAG,EACjCA,EAAO,CAACD,CAAI,EACZM,EAAQD,EAAOL,CAAI,EACnBE,IAEJ,CAEA,MAAMhL,EAAU,IAAQgL,EAAaC,EAAc,EAC7CpO,EAAI8N,EAAK,aAAa,GAAG,EACzB5N,EAAI4N,EAAK,aAAa,GAAG,EAC/BO,EAAO,QAAQ,CAACvB,EAAG3P,IAAM,CACvB2P,EAAE,aAAa,IAAK9M,CAAC,EACrB8M,EAAE,aAAa,IAAK5M,CAAC,EACrB4M,EAAE,aAAa,KAAM,GAAG3J,EAAUhG,EAAIiR,CAAU,IAAI,CACtD,CAAC,CACH,CACF,CASA,SAASK,GAAarM,EAASsM,EAAUC,EAAU,CACjD,IAAIC,EAASF,EAAS,CAAC,EAAE,OAAS1Q,EAAS0Q,EAAS,CAAC,EAAGtM,CAAO,EAE/D,QAAS,EAAI,EAAG,EAAIsM,EAAS,OAAQ,EAAE,EAAG,CACxC,MAAMG,EAAIH,EAAS,CAAC,EAAE,OAAS1Q,EAAS0Q,EAAS,CAAC,EAAGtM,CAAO,EACxDyM,GAAKD,IACPA,EAASC,EAEb,CAEA,QAAS,EAAI,EAAG,EAAIF,EAAS,OAAQ,EAAE,EAAG,CACxC,MAAME,EAAI7Q,EAAS2Q,EAAS,CAAC,EAAGvM,CAAO,EAAIuM,EAAS,CAAC,EAAE,OACnDE,GAAKD,IACPA,EAASC,EAEb,CACA,OAAOD,CACT,CAWA,SAASE,GAAkBJ,EAAUC,EAAUnD,EAAuB,CAIpE,MAAMpM,EAAS,CAAA,EACf,UAAWmB,KAAKmO,EACdtP,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAG,EAAGA,EAAE,EAAG,EAC9BnB,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAIA,EAAE,OAAS,EAAG,EAAGA,EAAE,CAAC,CAAE,EAC7CnB,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAIA,EAAE,OAAS,EAAG,EAAGA,EAAE,CAAC,CAAE,EAC7CnB,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAG,EAAGA,EAAE,EAAIA,EAAE,OAAS,CAAC,CAAE,EAC7CnB,EAAO,KAAK,CAAE,EAAGmB,EAAE,EAAG,EAAGA,EAAE,EAAIA,EAAE,OAAS,CAAC,CAAE,EAG/C,IAAI4C,EAAU/D,EAAO,CAAC,EAClBwP,EAASH,GAAarP,EAAO,CAAC,EAAGsP,EAAUC,CAAQ,EAEvD,QAASxR,EAAI,EAAGA,EAAIiC,EAAO,OAAQ,EAAEjC,EAAG,CACtC,MAAM0R,EAAIJ,GAAarP,EAAOjC,CAAC,EAAGuR,EAAUC,CAAQ,EAChDE,GAAKD,IACPzL,EAAU/D,EAAOjC,CAAC,EAClByR,EAASC,EAEb,CAGA,MAAMtF,EAAW5I,GACd/D,GAAM,GAAK6R,GAAa,CAAE,EAAG7R,EAAE,CAAC,EAAG,EAAGA,EAAE,CAAC,CAAC,EAAI8R,EAAUC,CAAQ,EACjE,CAACxL,EAAQ,EAAGA,EAAQ,CAAC,EACrB,CAAE,cAAe,IAAK,cAAe,KAAK,CAC9C,EAAI,EAEI9E,EAAM,CAAE,EAAGmN,EAAwB,EAAIjC,EAAS,CAAC,EAAG,EAAGA,EAAS,CAAC,CAAC,EAIxE,IAAIwF,EAAQ,GACZ,UAAW5R,KAAKuR,EACd,GAAI1Q,EAASK,EAAKlB,CAAC,EAAIA,EAAE,OAAQ,CAC/B4R,EAAQ,GACR,KACF,CAGF,UAAWC,KAAKL,EACd,GAAI3Q,EAASK,EAAK2Q,CAAC,EAAIA,EAAE,OAAQ,CAC/BD,EAAQ,GACR,KACF,CAEF,GAAIA,EACF,OAAO1Q,EAGT,GAAIqQ,EAAS,QAAU,EACrB,MAAO,CAAE,EAAGA,EAAS,CAAC,EAAE,EAAG,EAAGA,EAAS,CAAC,EAAE,CAAC,EAE7C,MAAMO,EAAY,CAAA,EAGlB,OAFA3S,GAAiBoS,EAAUO,CAAS,EAEhCA,EAAU,KAAK,SAAW,EACrB,CAAE,EAAG,EAAG,EAAG,KAAO,SAAU,EAAI,EAErCA,EAAU,KAAK,QAAU,EACpB,CAAE,EAAGA,EAAU,KAAK,CAAC,EAAE,OAAO,EAAG,EAAGA,EAAU,KAAK,CAAC,EAAE,OAAO,CAAC,EAEnEN,EAAS,OAEJG,GAAkBJ,EAAU,EAAE,EAMhCxR,GAAU+R,EAAU,KAAK,IAAK7R,GAAMA,EAAE,EAAE,CAAC,CAClD,CAIA,SAAS8R,GAAsB3S,EAAS,CACtC,MAAM8B,EAAM,CAAA,EACN8Q,EAAY,OAAO,KAAK5S,CAAO,EACrC,UAAW6S,KAAYD,EACrB9Q,EAAI+Q,CAAQ,EAAI,CAAA,EAElB,QAASjS,EAAI,EAAGA,EAAIgS,EAAU,OAAQhS,IAAK,CACzC,MAAMkS,EAAKF,EAAUhS,CAAC,EAChBC,EAAIb,EAAQ8S,CAAE,EACpB,QAAS3R,EAAIP,EAAI,EAAGO,EAAIyR,EAAU,OAAQ,EAAEzR,EAAG,CAC7C,MAAM4R,EAAKH,EAAUzR,CAAC,EAChBL,EAAId,EAAQ+S,CAAE,EACd1Q,EAAIZ,EAASZ,EAAGC,CAAC,EAEnBuB,EAAIvB,EAAE,QAAUD,EAAE,OAAS,MAC7BiB,EAAIiR,CAAE,EAAE,KAAKD,CAAE,EACNzQ,EAAIxB,EAAE,QAAUC,EAAE,OAAS,OACpCgB,EAAIgR,CAAE,EAAE,KAAKC,CAAE,CAEnB,CACF,CACA,OAAOjR,CACT,CAEA,SAASgO,GAAmB9P,EAASwH,EAAOyH,EAAuB,CACjE,MAAMnN,EAAM,CAAA,EACNkR,EAAaL,GAAsB3S,CAAO,EAChD,QAASY,EAAI,EAAGA,EAAI4G,EAAM,OAAQ,EAAE5G,EAAG,CACrC,MAAM0H,EAAOd,EAAM5G,CAAC,EAAE,KAChBqS,EAAU,CAAA,EACVC,EAAU,CAAA,EAEhB,QAAS/R,EAAI,EAAGA,EAAImH,EAAK,OAAQ,EAAEnH,EAAG,CACpC8R,EAAQ3K,EAAKnH,CAAC,CAAC,EAAI,GACnB,MAAMoK,EAAWyH,EAAW1K,EAAKnH,CAAC,CAAC,EAInC,QAAS8J,EAAI,EAAGA,EAAIM,EAAS,OAAQ,EAAEN,EACrCiI,EAAQ3H,EAASN,CAAC,CAAC,EAAI,EAE3B,CAEA,MAAMkH,EAAW,CAAA,EACXC,EAAW,CAAA,EACjB,QAASzK,KAAS3H,EACZ2H,KAASsL,EACXd,EAAS,KAAKnS,EAAQ2H,CAAK,CAAC,EACjBA,KAASuL,GACpBd,EAAS,KAAKpS,EAAQ2H,CAAK,CAAC,EAGhC,MAAMwL,EAASZ,GAAkBJ,EAAUC,EAAUnD,CAAqB,EAC1EnN,EAAIwG,CAAI,EAAI6K,EACRA,EAAO,UAAY3L,EAAM5G,CAAC,EAAE,KAAO,GACrC,QAAQ,IAAI,iBAAmB0H,EAAO,4BAA4B,CAEtE,CACA,OAAOxG,CACT,CAmDA,SAASsR,GAAW3P,EAAGE,EAAG1B,EAAG,CAC3B,MAAMH,EAAM,CAAA,EACZ,OAAAA,EAAI,KAAK;AAAA,GAAO2B,EAAGE,CAAC,EACpB7B,EAAI,KAAK;AAAA,GAAO,CAACG,EAAG,CAAC,EACrBH,EAAI,KAAK;AAAA,GAAOG,EAAGA,EAAG,EAAG,EAAG,EAAGA,EAAI,EAAG,CAAC,EACvCH,EAAI,KAAK;AAAA,GAAOG,EAAGA,EAAG,EAAG,EAAG,EAAG,CAACA,EAAI,EAAG,CAAC,EACjCH,EAAI,KAAK,GAAG,CACrB,CAOA,SAASuO,GAAeD,EAAM,CAC5B,MAAMiD,EAASjD,EAAK,MAAM,GAAG,EAC7B,MAAO,CAAE,EAAG,OAAO,WAAWiD,EAAO,CAAC,CAAC,EAAG,EAAG,OAAO,WAAWA,EAAO,CAAC,CAAC,EAAG,OAAQ,CAAC,OAAO,WAAWA,EAAO,CAAC,CAAC,CAAC,CAClH,CAEA,SAASC,GAAqBtT,EAAS,CACrC,GAAIA,EAAQ,SAAW,EACrB,MAAO,CAAA,EAET,MAAMC,EAAQ,CAAA,EACd,OAAAF,GAAiBC,EAASC,CAAK,EACxBA,EAAM,IACf,CAEA,SAASsT,GAAW9S,EAAMuO,EAAO,CAC/B,GAAIvO,EAAK,SAAW,EAClB,MAAO,QAET,MAAM+S,EAAU,KAAK,IAAI,GAAIxE,GAAS,CAAC,EACjC/M,EAAI+M,GAAS,KAAQyE,GAAM,KAAK,MAAMA,EAAID,CAAO,EAAIA,EAAWC,GAAMA,EAC5E,GAAIhT,EAAK,QAAU,EAAG,CACpB,MAAMW,EAASX,EAAK,CAAC,EAAE,OACvB,OAAO2S,GAAWnR,EAAEb,EAAO,CAAC,EAAGa,EAAEb,EAAO,CAAC,EAAGa,EAAEb,EAAO,MAAM,CAAC,CAC9D,CAEA,MAAMU,EAAM,CAAC;AAAA,GAAOG,EAAExB,EAAK,CAAC,EAAE,GAAG,CAAC,EAAGwB,EAAExB,EAAK,CAAC,EAAE,GAAG,CAAC,CAAC,EACpD,UAAWS,KAAOT,EAAM,CACtB,MAAMiT,EAASzR,EAAEf,EAAI,OAAO,MAAM,EAClCY,EAAI,KAAK;AAAA,GAAO4R,EAAQA,EAAQ,EAAGxS,EAAI,MAAQ,EAAI,EAAGA,EAAI,MAAQ,EAAI,EAAGe,EAAEf,EAAI,GAAG,CAAC,EAAGe,EAAEf,EAAI,GAAG,CAAC,CAAC,CACnG,CACA,OAAOY,EAAI,KAAK,GAAG,CACrB,CAOA,SAAS4O,GAAqB1Q,EAASgP,EAAO,CAC5C,OAAOuE,GAAWD,GAAqBtT,CAAO,EAAGgP,CAAK,CACxD,CAEA,SAAS2E,GAAOjE,EAAMjB,EAAU,GAAI,CAClC,KAAM,CACJ,aAAcnH,EACd,eAAgBqM,EAASzM,GACzB,UAAA0H,EAAY,GACZ,YAAAhD,EAAc,KAAK,GAAK,EACxB,iBAAAC,EACA,MAAArK,EAAQ,IACR,OAAAsM,EAAS,IACT,QAAAC,EAAU,GACV,WAAAC,EAAa,GACb,sBAAAiB,EAAwB,GACxB,SAAAhH,EACA,MAAA+G,EAAQ,CACZ,EAAMP,EAEJ,IAAIzB,EAAW2G,EAAOjE,EAAM,CAC1B,aAAcpI,IAAS,WAAa,CAACA,EAAOC,GAAeD,IAAS,WAAamE,GAAuBnE,EACxG,SAAAW,CACJ,CAAG,EAEG2G,IACF5B,EAAWD,GAAkBC,EAAUpB,EAAaC,CAAgB,GAGtE,MAAM7L,EAAU6N,GAAcb,EAAUxL,EAAOsM,EAAQC,EAASC,CAAU,EACpE6B,EAAcC,GAAmB9P,EAAS0P,EAAMT,CAAqB,EAErE2E,EAAe,IAAI,IACvB,OAAO,KAAK5T,CAAO,EAAE,IAAKqK,GAAQ,CAChCA,EACA,CACE,IAAAA,EACA,EAAGrK,EAAQqK,CAAG,EAAE,EAChB,EAAGrK,EAAQqK,CAAG,EAAE,EAChB,OAAQrK,EAAQqK,CAAG,EAAE,MAC7B,CACA,CAAK,CACL,EACQwJ,EAAUnE,EAAK,IAAKpH,GAAS,CACjC,MAAMtI,EAAUsI,EAAK,KAAK,IAAKJ,GAAM0L,EAAa,IAAI1L,CAAC,CAAC,EAClDzH,EAAO6S,GAAqBtT,CAAO,EACnCoQ,EAAOmD,GAAW9S,EAAMuO,CAAK,EACnC,MAAO,CAAE,QAAAhP,EAAS,KAAAS,EAAM,KAAA2P,EAAM,KAAA9H,EAAM,IAAK,IAAI,IAAIA,EAAK,IAAI,CAAC,CAC7D,CAAC,EAED,SAASwL,EAAgB3M,EAAM,CAC7B,IAAIlF,EAAI,GACR,UAAWwQ,KAAKoB,EACVpB,EAAE,IAAI,KAAOtL,EAAK,QAAUA,EAAK,MAAOe,GAAMuK,EAAE,IAAI,IAAIvK,CAAC,CAAC,IAC5DjG,GAAK,IAAMwQ,EAAE,MAGjB,OAAOxQ,CACT,CAEA,OAAO4R,EAAQ,IAAI,CAAC,CAAE,QAAA7T,EAAS,KAAAS,EAAM,KAAA2P,EAAM,KAAA9H,MAClC,CACL,KAAMA,EACN,KAAMuH,EAAYvH,EAAK,IAAI,EAC3B,QAAAtI,EACA,KAAAS,EACA,KAAA2P,EACA,aAAcA,EAAO0D,EAAgBxL,EAAK,IAAI,CACpD,EACG,CACH,CC5oEA,IAAIyL,IAAU,UAAW,CACvB,IAAIC,EAAoBC,EAAO,SAAShJ,EAAGwI,EAAGS,EAAIC,EAAG,CACnD,IAAKD,EAAKA,GAAM,GAAIC,EAAIlJ,EAAE,OAAQkJ,IAAKD,EAAGjJ,EAAEkJ,CAAC,CAAC,EAAIV,EAAG,CACrD,OAAOS,CACT,EAAG,GAAG,EAAGE,EAAM,CAAC,EAAG,CAAC,EAAGC,EAAM,CAAC,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAE,EAAGC,EAAM,CAAC,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EACnWC,EAAU,CACZ,MAAuBjB,EAAO,UAAiB,CAC/C,EAAG,OAAO,EACV,GAAI,CAAA,EACJ,SAAU,CAAE,MAAS,EAAG,MAAS,EAAG,YAAe,EAAG,KAAQ,EAAG,SAAY,EAAG,IAAO,EAAG,QAAW,EAAG,KAAQ,EAAG,UAAa,GAAI,MAAS,GAAI,IAAO,GAAI,WAAc,GAAI,cAAiB,GAAI,MAAS,GAAI,QAAW,GAAI,MAAS,GAAI,eAAkB,GAAI,KAAQ,GAAI,WAAc,GAAI,OAAU,GAAI,YAAe,GAAI,iBAAoB,GAAI,MAAS,GAAI,UAAa,GAAI,WAAc,GAAI,MAAS,GAAI,WAAc,GAAI,YAAe,GAAI,WAAc,GAAI,SAAY,GAAI,SAAY,GAAI,UAAa,GAAI,QAAW,EAAG,KAAQ,CAAC,EACrhB,WAAY,CAAE,EAAG,QAAS,EAAG,OAAQ,EAAG,MAAO,EAAG,UAAW,GAAI,QAAS,GAAI,MAAO,GAAI,gBAAiB,GAAI,QAAS,GAAI,UAAW,GAAI,QAAS,GAAI,OAAQ,GAAI,aAAc,GAAI,SAAU,GAAI,cAAe,GAAI,QAAS,GAAI,QAAS,GAAI,WAAY,GAAI,WAAY,GAAI,WAAW,EAC3R,aAAc,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,EAAG,CAAC,GAAI,CAAC,CAAC,EACrZ,cAA+BA,EAAO,SAAmBkB,EAAQC,EAAQC,EAAUC,EAAIC,EAASC,EAAIC,EAAI,CACtG,IAAIC,EAAKF,EAAG,OAAS,EACrB,OAAQD,EAAO,CACb,IAAK,GACH,OAAOC,EAAGE,EAAK,CAAC,EAElB,IAAK,GACL,IAAK,GACL,IAAK,GACH,KAAK,EAAI,CAAA,EACT,MACF,IAAK,GACHF,EAAGE,EAAK,CAAC,EAAE,KAAKF,EAAGE,CAAE,CAAC,EACtB,KAAK,EAAIF,EAAGE,EAAK,CAAC,EAClB,MACF,IAAK,GACH,KAAK,EAAI,CAAA,EACT,MACF,IAAK,GACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACH,KAAK,EAAIF,EAAGE,CAAE,EACd,MACF,IAAK,GACHJ,EAAG,gBAAgBE,EAAGE,CAAE,EAAE,OAAO,CAAC,CAAC,EACnC,KAAK,EAAIF,EAAGE,CAAE,EAAE,OAAO,CAAC,EACxB,MACF,IAAK,GACHJ,EAAG,cAAc,CAACE,EAAGE,CAAE,CAAC,EAAG,OAAQ,MAAM,EACrCJ,EAAG,eACLA,EAAG,cAAc,EAAI,EAEvB,MACF,IAAK,IACHA,EAAG,cAAc,CAACE,EAAGE,EAAK,CAAC,CAAC,EAAGF,EAAGE,CAAE,EAAG,MAAM,EACzCJ,EAAG,eACLA,EAAG,cAAc,EAAI,EAEvB,MACF,IAAK,IACHA,EAAG,cAAc,CAACE,EAAGE,EAAK,CAAC,CAAC,EAAG,OAAQ,WAAWF,EAAGE,CAAE,CAAC,CAAC,EACrDJ,EAAG,eACLA,EAAG,cAAc,EAAI,EAEvB,MACF,IAAK,IACHA,EAAG,cAAc,CAACE,EAAGE,EAAK,CAAC,CAAC,EAAGF,EAAGE,EAAK,CAAC,EAAG,WAAWF,EAAGE,CAAE,CAAC,CAAC,EACzDJ,EAAG,eACLA,EAAG,cAAc,EAAI,EAEvB,MACF,IAAK,IACH,GAAIE,EAAGE,CAAE,EAAE,OAAS,EAClB,MAAM,IAAI,MAAM,qCAAqC,EAEnDJ,EAAG,0BACLA,EAAG,yBAAyBE,EAAGE,CAAE,CAAC,EAEpCJ,EAAG,cAAcE,EAAGE,CAAE,EAAG,OAAQ,MAAM,EACnCJ,EAAG,eACLA,EAAG,cAAc,EAAI,EAEvB,MACF,IAAK,IACH,GAAIE,EAAGE,EAAK,CAAC,EAAE,OAAS,EACtB,MAAM,IAAI,MAAM,qCAAqC,EAEnDJ,EAAG,0BACLA,EAAG,yBAAyBE,EAAGE,EAAK,CAAC,CAAC,EAExCJ,EAAG,cAAcE,EAAGE,EAAK,CAAC,EAAGF,EAAGE,CAAE,EAAG,MAAM,EACvCJ,EAAG,eACLA,EAAG,cAAc,EAAI,EAEvB,MACF,IAAK,IACH,GAAIE,EAAGE,EAAK,CAAC,EAAE,OAAS,EACtB,MAAM,IAAI,MAAM,qCAAqC,EAEnDJ,EAAG,0BACLA,EAAG,yBAAyBE,EAAGE,EAAK,CAAC,CAAC,EAExCJ,EAAG,cAAcE,EAAGE,EAAK,CAAC,EAAG,OAAQ,WAAWF,EAAGE,CAAE,CAAC,CAAC,EACnDJ,EAAG,eACLA,EAAG,cAAc,EAAI,EAEvB,MACF,IAAK,IACH,GAAIE,EAAGE,EAAK,CAAC,EAAE,OAAS,EACtB,MAAM,IAAI,MAAM,qCAAqC,EAEnDJ,EAAG,0BACLA,EAAG,yBAAyBE,EAAGE,EAAK,CAAC,CAAC,EAExCJ,EAAG,cAAcE,EAAGE,EAAK,CAAC,EAAGF,EAAGE,EAAK,CAAC,EAAG,WAAWF,EAAGE,CAAE,CAAC,CAAC,EACvDJ,EAAG,eACLA,EAAG,cAAc,EAAI,EAEvB,MACF,IAAK,IACL,IAAK,IACL,IAAK,IACHA,EAAG,YAAYE,EAAGE,EAAK,CAAC,EAAGF,EAAGE,CAAE,EAAG,MAAM,EACzC,MACF,IAAK,IACL,IAAK,IACHJ,EAAG,YAAYE,EAAGE,EAAK,CAAC,EAAGF,EAAGE,EAAK,CAAC,EAAGF,EAAGE,CAAE,CAAC,EAC7C,MACF,IAAK,IACHJ,EAAG,aAAaE,EAAGE,EAAK,CAAC,EAAGF,EAAGE,CAAE,CAAC,EAClC,MACF,IAAK,IACL,IAAK,IACL,IAAK,IACH,IAAIC,EAAKL,EAAG,eAAc,EAC1B,GAAI,CAACK,EAAI,MAAM,IAAI,MAAM,mBAAmB,EAC5CL,EAAG,YAAYK,EAAIH,EAAGE,CAAE,EAAG,MAAM,EACjC,MACF,IAAK,IACL,IAAK,IACH,IAAIC,EAAKL,EAAG,eAAc,EAC1B,GAAI,CAACK,EAAI,MAAM,IAAI,MAAM,mBAAmB,EAC5CL,EAAG,YAAYK,EAAIH,EAAGE,EAAK,CAAC,EAAGF,EAAGE,CAAE,CAAC,EACrC,MACF,IAAK,IACL,IAAK,IACH,KAAK,EAAI,CAACF,EAAGE,CAAE,CAAC,EAChB,MACF,IAAK,IACL,IAAK,IACH,KAAK,EAAI,CAAC,GAAGF,EAAGE,EAAK,CAAC,EAAGF,EAAGE,CAAE,CAAC,EAC/B,MACF,IAAK,IACH,KAAK,EAAI,CAACF,EAAGE,EAAK,CAAC,EAAGF,EAAGE,CAAE,CAAC,EAC5B,MACF,IAAK,IACH,KAAK,EAAIF,EAAGE,CAAE,EAAE,KAAK,GAAG,EACxB,MACF,IAAK,IACH,KAAK,EAAI,CAACF,EAAGE,CAAE,CAAC,EAChB,MACF,IAAK,IACHF,EAAGE,EAAK,CAAC,EAAE,KAAKF,EAAGE,CAAE,CAAC,EACtB,KAAK,EAAIF,EAAGE,EAAK,CAAC,EAClB,MACF,IAAK,IACL,IAAK,IACH,KAAK,EAAIF,EAAGE,CAAE,EACd,KACV,CACI,EAAG,WAAW,EACd,MAAO,CAAC1B,EAAEI,EAAK,CAAC,EAAG,CAAC,EAAG,CAAE,EAAG,EAAG,EAAG,CAAC,CAAE,EAAG,CAAE,EAAG,CAAC,CAAC,CAAC,EAAI,CAAE,EAAG,CAAC,EAAG,CAAC,EAAG,EAAG,CAAC,EAAG,CAAC,CAAC,EAAIJ,EAAEK,EAAK,CAAC,EAAG,CAAC,EAAG,CAAE,EAAG,CAAC,CAAE,EAAGL,EAAEI,EAAK,CAAC,EAAG,CAAC,CAAC,EAAG,CAAE,EAAG,CAAC,EAAG,CAAC,EAAG,EAAG,CAAC,EAAG,CAAC,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,CAAC,EAAI,CAAE,EAAG,CAAC,EAAG,CAAC,CAAC,EAAIJ,EAAEK,EAAK,CAAC,EAAG,CAAC,CAAC,EAAGL,EAAEK,EAAK,CAAC,EAAG,CAAC,CAAC,EAAGL,EAAEK,EAAK,CAAC,EAAG,CAAC,CAAC,EAAGL,EAAEK,EAAK,CAAC,EAAG,CAAC,CAAC,EAAG,CAAE,GAAI,GAAI,GAAIC,EAAK,GAAIC,CAAG,EAAI,CAAE,GAAI,GAAI,GAAI,GAAI,GAAID,EAAK,GAAIC,CAAG,EAAI,CAAE,GAAI,GAAI,GAAI,GAAI,GAAID,EAAK,GAAIC,CAAG,EAAI,CAAE,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,EAAE,EAAI,CAAE,GAAI,GAAI,GAAI,GAAI,GAAID,EAAK,GAAIC,CAAG,EAAIP,EAAEK,EAAK,CAAC,EAAG,CAAC,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,CAAC,CAAE,EAAGL,EAAEQ,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGR,EAAEQ,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGR,EAAEK,EAAK,CAAC,EAAG,EAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAII,CAAG,CAAE,EAAGT,EAAEQ,EAAK,CAAC,EAAG,EAAE,CAAC,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,CAAC,EAAG,EAAE,EAAG,GAAIC,CAAG,EAAIT,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,CAAE,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,CAAE,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAG,CAAE,GAAIK,EAAK,GAAI,GAAI,GAAI,GAAI,GAAID,CAAG,EAAIT,EAAEK,EAAK,CAAC,EAAG,EAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,CAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,EAAIL,EAAEK,EAAK,CAAC,EAAG,EAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,CAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,EAAI,CAAE,GAAI,GAAI,GAAIC,EAAK,GAAIC,CAAG,EAAIP,EAAEK,EAAK,CAAC,EAAG,EAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,CAAE,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,CAAE,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,CAAE,EAAGL,EAAEW,EAAK,CAAC,EAAG,EAAE,CAAC,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,EAAI,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,EAAIX,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAG,CAAE,GAAI,CAAC,EAAG,EAAE,CAAC,EAAIL,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGL,EAAEQ,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGR,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAG,CAAE,GAAIK,EAAK,GAAI,EAAE,EAAI,CAAE,GAAIE,EAAK,GAAIC,EAAK,GAAI,CAAC,EAAG,EAAE,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAIC,EAAK,GAAIC,EAAK,GAAIC,CAAG,EAAIhB,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGL,EAAEK,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGL,EAAEW,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGX,EAAEW,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGX,EAAEW,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGX,EAAEW,EAAK,CAAC,EAAG,EAAE,EAAG,CAAE,GAAI,GAAI,GAAIC,EAAK,GAAIC,EAAK,GAAIC,EAAK,GAAIC,EAAK,GAAIC,CAAG,CAAE,EAAGhB,EAAEiB,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGjB,EAAEiB,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGjB,EAAEiB,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGjB,EAAEiB,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGjB,EAAEiB,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGjB,EAAEiB,EAAK,CAAC,EAAG,EAAE,CAAC,EAAGjB,EAAEiB,EAAK,CAAC,EAAG,EAAE,CAAC,CAAC,EAC7oD,eAAgB,CAAE,EAAG,CAAC,EAAG,CAAC,CAAC,EAC3B,WAA4BhB,EAAO,SAAoB2B,EAAKC,EAAM,CAChE,GAAIA,EAAK,YACP,KAAK,MAAMD,CAAG,MACT,CACL,IAAIE,EAAQ,IAAI,MAAMF,CAAG,EACzB,MAAAE,EAAM,KAAOD,EACPC,CACR,CACF,EAAG,YAAY,EACf,MAAuB7B,EAAO,SAAe8B,EAAO,CAC/C,IAACC,EAAO,KAAMC,EAAQ,CAAC,CAAC,EAAGC,EAAS,CAAA,EAAIC,EAAS,CAAC,IAAI,EAAGC,EAAS,CAAA,EAAIC,EAAQ,KAAK,MAAOlB,EAAS,GAAIE,EAAW,EAAGD,EAAS,EAAmBkB,EAAS,EAAGC,EAAM,EAClKC,EAAOJ,EAAO,MAAM,KAAK,UAAW,CAAC,EACrCK,EAAS,OAAO,OAAO,KAAK,KAAK,EACjCC,EAAc,CAAE,GAAI,EAAE,EAC1B,QAASzL,KAAK,KAAK,GACb,OAAO,UAAU,eAAe,KAAK,KAAK,GAAIA,CAAC,IACjDyL,EAAY,GAAGzL,CAAC,EAAI,KAAK,GAAGA,CAAC,GAGjCwL,EAAO,SAASV,EAAOW,EAAY,EAAE,EACrCA,EAAY,GAAG,MAAQD,EACvBC,EAAY,GAAG,OAAS,KACpB,OAAOD,EAAO,OAAU,MAC1BA,EAAO,OAAS,CAAA,GAElB,IAAIE,EAAQF,EAAO,OACnBL,EAAO,KAAKO,CAAK,EACjB,IAAIC,EAASH,EAAO,SAAWA,EAAO,QAAQ,OAC1C,OAAOC,EAAY,GAAG,YAAe,WACvC,KAAK,WAAaA,EAAY,GAAG,WAEjC,KAAK,WAAa,OAAO,eAAe,IAAI,EAAE,WAEhD,SAASG,EAASC,EAAG,CACnBb,EAAM,OAASA,EAAM,OAAS,EAAIa,EAClCX,EAAO,OAASA,EAAO,OAASW,EAChCV,EAAO,OAASA,EAAO,OAASU,CAClC,CACA7C,EAAO4C,EAAU,UAAU,EAC3B,SAASE,GAAM,CACb,IAAIC,EACJ,OAAAA,EAAQd,EAAO,IAAG,GAAMO,EAAO,IAAG,GAAMF,EACpC,OAAOS,GAAU,WACfA,aAAiB,QACnBd,EAASc,EACTA,EAAQd,EAAO,IAAG,GAEpBc,EAAQhB,EAAK,SAASgB,CAAK,GAAKA,GAE3BA,CACT,CACA/C,EAAO8C,EAAK,KAAK,EAEjB,QADIE,EAAwBzR,EAAO0R,EAAWjV,EAAGkV,EAAQ,CAAA,EAAI9W,EAAG+W,EAAKC,GAAUC,IAClE,CAUX,GATA9R,EAAQyQ,EAAMA,EAAM,OAAS,CAAC,EAC1B,KAAK,eAAezQ,CAAK,EAC3B0R,EAAS,KAAK,eAAe1R,CAAK,IAE9ByR,IAAW,MAAQ,OAAOA,EAAU,OACtCA,EAASF,EAAG,GAEdG,EAASb,EAAM7Q,CAAK,GAAK6Q,EAAM7Q,CAAK,EAAEyR,CAAM,GAE1C,OAAOC,EAAW,KAAe,CAACA,EAAO,QAAU,CAACA,EAAO,CAAC,EAAG,CACjE,IAAIK,EAAS,GACbD,EAAW,CAAA,EACX,IAAKjX,KAAKgW,EAAM7Q,CAAK,EACf,KAAK,WAAWnF,CAAC,GAAKA,EAAIiW,GAC5BgB,EAAS,KAAK,IAAM,KAAK,WAAWjX,CAAC,EAAI,GAAG,EAG5CoW,EAAO,aACTc,EAAS,wBAA0BlC,EAAW,GAAK;AAAA,EAAQoB,EAAO,aAAY,EAAK;AAAA,YAAiBa,EAAS,KAAK,IAAI,EAAI,WAAa,KAAK,WAAWL,CAAM,GAAKA,GAAU,IAE5KM,EAAS,wBAA0BlC,EAAW,GAAK,iBAAmB4B,GAAUV,EAAM,eAAiB,KAAO,KAAK,WAAWU,CAAM,GAAKA,GAAU,KAErJ,KAAK,WAAWM,EAAQ,CACtB,KAAMd,EAAO,MACb,MAAO,KAAK,WAAWQ,CAAM,GAAKA,EAClC,KAAMR,EAAO,SACb,IAAKE,EACL,SAAAW,CACZ,CAAW,CACH,CACA,GAAIJ,EAAO,CAAC,YAAa,OAASA,EAAO,OAAS,EAChD,MAAM,IAAI,MAAM,oDAAsD1R,EAAQ,YAAcyR,CAAM,EAEpG,OAAQC,EAAO,CAAC,EAAC,CACf,IAAK,GACHjB,EAAM,KAAKgB,CAAM,EACjBd,EAAO,KAAKM,EAAO,MAAM,EACzBL,EAAO,KAAKK,EAAO,MAAM,EACzBR,EAAM,KAAKiB,EAAO,CAAC,CAAC,EACpBD,EAAS,KAEP7B,EAASqB,EAAO,OAChBtB,EAASsB,EAAO,OAChBpB,EAAWoB,EAAO,SAClBE,EAAQF,EAAO,OAQjB,MACF,IAAK,GAwBH,GAvBAW,EAAM,KAAK,aAAaF,EAAO,CAAC,CAAC,EAAE,CAAC,EACpCC,EAAM,EAAIhB,EAAOA,EAAO,OAASiB,CAAG,EACpCD,EAAM,GAAK,CACT,WAAYf,EAAOA,EAAO,QAAUgB,GAAO,EAAE,EAAE,WAC/C,UAAWhB,EAAOA,EAAO,OAAS,CAAC,EAAE,UACrC,aAAcA,EAAOA,EAAO,QAAUgB,GAAO,EAAE,EAAE,aACjD,YAAahB,EAAOA,EAAO,OAAS,CAAC,EAAE,WACrD,EACgBQ,IACFO,EAAM,GAAG,MAAQ,CACff,EAAOA,EAAO,QAAUgB,GAAO,EAAE,EAAE,MAAM,CAAC,EAC1ChB,EAAOA,EAAO,OAAS,CAAC,EAAE,MAAM,CAAC,CACjD,GAEYnU,EAAI,KAAK,cAAc,MAAMkV,EAAO,CAClChC,EACAC,EACAC,EACAqB,EAAY,GACZQ,EAAO,CAAC,EACRf,EACAC,CACd,EAAc,OAAOI,CAAI,CAAC,EACV,OAAOvU,EAAM,IACf,OAAOA,EAELmV,IACFnB,EAAQA,EAAM,MAAM,EAAG,GAAKmB,EAAM,CAAC,EACnCjB,EAASA,EAAO,MAAM,EAAG,GAAKiB,CAAG,EACjChB,EAASA,EAAO,MAAM,EAAG,GAAKgB,CAAG,GAEnCnB,EAAM,KAAK,KAAK,aAAaiB,EAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1Cf,EAAO,KAAKgB,EAAM,CAAC,EACnBf,EAAO,KAAKe,EAAM,EAAE,EACpBE,GAAWhB,EAAMJ,EAAMA,EAAM,OAAS,CAAC,CAAC,EAAEA,EAAMA,EAAM,OAAS,CAAC,CAAC,EACjEA,EAAM,KAAKoB,EAAQ,EACnB,MACF,IAAK,GACH,MAAO,EACnB,CACM,CACA,MAAO,EACT,EAAG,OAAO,CACd,EACMG,GAAyB,UAAW,CACtC,IAAIf,EAAS,CACX,IAAK,EACL,WAA4BxC,EAAO,SAAoB2B,EAAKC,EAAM,CAChE,GAAI,KAAK,GAAG,OACV,KAAK,GAAG,OAAO,WAAWD,EAAKC,CAAI,MAEnC,OAAM,IAAI,MAAMD,CAAG,CAEvB,EAAG,YAAY,EAEf,SAA0B3B,EAAO,SAAS8B,EAAOT,EAAI,CACnD,YAAK,GAAKA,GAAM,KAAK,IAAM,CAAA,EAC3B,KAAK,OAASS,EACd,KAAK,MAAQ,KAAK,WAAa,KAAK,KAAO,GAC3C,KAAK,SAAW,KAAK,OAAS,EAC9B,KAAK,OAAS,KAAK,QAAU,KAAK,MAAQ,GAC1C,KAAK,eAAiB,CAAC,SAAS,EAChC,KAAK,OAAS,CACZ,WAAY,EACZ,aAAc,EACd,UAAW,EACX,YAAa,CACvB,EACY,KAAK,QAAQ,SACf,KAAK,OAAO,MAAQ,CAAC,EAAG,CAAC,GAE3B,KAAK,OAAS,EACP,IACT,EAAG,UAAU,EAEb,MAAuB9B,EAAO,UAAW,CACvC,IAAIwD,EAAK,KAAK,OAAO,CAAC,EACtB,KAAK,QAAUA,EACf,KAAK,SACL,KAAK,SACL,KAAK,OAASA,EACd,KAAK,SAAWA,EAChB,IAAIC,EAAQD,EAAG,MAAM,iBAAiB,EACtC,OAAIC,GACF,KAAK,WACL,KAAK,OAAO,aAEZ,KAAK,OAAO,cAEV,KAAK,QAAQ,QACf,KAAK,OAAO,MAAM,CAAC,IAErB,KAAK,OAAS,KAAK,OAAO,MAAM,CAAC,EAC1BD,CACT,EAAG,OAAO,EAEV,MAAuBxD,EAAO,SAASwD,EAAI,CACzC,IAAIL,EAAMK,EAAG,OACTC,EAAQD,EAAG,MAAM,eAAe,EACpC,KAAK,OAASA,EAAK,KAAK,OACxB,KAAK,OAAS,KAAK,OAAO,OAAO,EAAG,KAAK,OAAO,OAASL,CAAG,EAC5D,KAAK,QAAUA,EACf,IAAIO,EAAW,KAAK,MAAM,MAAM,eAAe,EAC/C,KAAK,MAAQ,KAAK,MAAM,OAAO,EAAG,KAAK,MAAM,OAAS,CAAC,EACvD,KAAK,QAAU,KAAK,QAAQ,OAAO,EAAG,KAAK,QAAQ,OAAS,CAAC,EACzDD,EAAM,OAAS,IACjB,KAAK,UAAYA,EAAM,OAAS,GAElC,IAAIzV,EAAI,KAAK,OAAO,MACpB,YAAK,OAAS,CACZ,WAAY,KAAK,OAAO,WACxB,UAAW,KAAK,SAAW,EAC3B,aAAc,KAAK,OAAO,aAC1B,YAAayV,GAASA,EAAM,SAAWC,EAAS,OAAS,KAAK,OAAO,aAAe,GAAKA,EAASA,EAAS,OAASD,EAAM,MAAM,EAAE,OAASA,EAAM,CAAC,EAAE,OAAS,KAAK,OAAO,aAAeN,CAClM,EACY,KAAK,QAAQ,SACf,KAAK,OAAO,MAAQ,CAACnV,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAI,KAAK,OAASmV,CAAG,GAErD,KAAK,OAAS,KAAK,OAAO,OACnB,IACT,EAAG,OAAO,EAEV,KAAsBnD,EAAO,UAAW,CACtC,YAAK,MAAQ,GACN,IACT,EAAG,MAAM,EAET,OAAwBA,EAAO,UAAW,CACxC,GAAI,KAAK,QAAQ,gBACf,KAAK,WAAa,OAElB,QAAO,KAAK,WAAW,0BAA4B,KAAK,SAAW,GAAK;AAAA,EAAqI,KAAK,eAAgB,CAChO,KAAM,GACN,MAAO,KACP,KAAM,KAAK,QACvB,CAAW,EAEH,OAAO,IACT,EAAG,QAAQ,EAEX,KAAsBA,EAAO,SAAS6C,EAAG,CACvC,KAAK,MAAM,KAAK,MAAM,MAAMA,CAAC,CAAC,CAChC,EAAG,MAAM,EAET,UAA2B7C,EAAO,UAAW,CAC3C,IAAI2D,EAAO,KAAK,QAAQ,OAAO,EAAG,KAAK,QAAQ,OAAS,KAAK,MAAM,MAAM,EACzE,OAAQA,EAAK,OAAS,GAAK,MAAQ,IAAMA,EAAK,OAAO,GAAG,EAAE,QAAQ,MAAO,EAAE,CAC7E,EAAG,WAAW,EAEd,cAA+B3D,EAAO,UAAW,CAC/C,IAAInO,EAAO,KAAK,MAChB,OAAIA,EAAK,OAAS,KAChBA,GAAQ,KAAK,OAAO,OAAO,EAAG,GAAKA,EAAK,MAAM,IAExCA,EAAK,OAAO,EAAG,EAAE,GAAKA,EAAK,OAAS,GAAK,MAAQ,KAAK,QAAQ,MAAO,EAAE,CACjF,EAAG,eAAe,EAElB,aAA8BmO,EAAO,UAAW,CAC9C,IAAI4D,EAAM,KAAK,UAAS,EACpB7T,EAAI,IAAI,MAAM6T,EAAI,OAAS,CAAC,EAAE,KAAK,GAAG,EAC1C,OAAOA,EAAM,KAAK,cAAa,EAAK;AAAA,EAAO7T,EAAI,GACjD,EAAG,cAAc,EAEjB,WAA4BiQ,EAAO,SAAS6D,EAAOC,EAAc,CAC/D,IAAIf,EAAOU,EAAOM,EAmDlB,GAlDI,KAAK,QAAQ,kBACfA,EAAS,CACP,SAAU,KAAK,SACf,OAAQ,CACN,WAAY,KAAK,OAAO,WACxB,UAAW,KAAK,UAChB,aAAc,KAAK,OAAO,aAC1B,YAAa,KAAK,OAAO,WACvC,EACY,OAAQ,KAAK,OACb,MAAO,KAAK,MACZ,QAAS,KAAK,QACd,QAAS,KAAK,QACd,OAAQ,KAAK,OACb,OAAQ,KAAK,OACb,MAAO,KAAK,MACZ,OAAQ,KAAK,OACb,GAAI,KAAK,GACT,eAAgB,KAAK,eAAe,MAAM,CAAC,EAC3C,KAAM,KAAK,IACvB,EACc,KAAK,QAAQ,SACfA,EAAO,OAAO,MAAQ,KAAK,OAAO,MAAM,MAAM,CAAC,IAGnDN,EAAQI,EAAM,CAAC,EAAE,MAAM,iBAAiB,EACpCJ,IACF,KAAK,UAAYA,EAAM,QAEzB,KAAK,OAAS,CACZ,WAAY,KAAK,OAAO,UACxB,UAAW,KAAK,SAAW,EAC3B,aAAc,KAAK,OAAO,YAC1B,YAAaA,EAAQA,EAAMA,EAAM,OAAS,CAAC,EAAE,OAASA,EAAMA,EAAM,OAAS,CAAC,EAAE,MAAM,QAAQ,EAAE,CAAC,EAAE,OAAS,KAAK,OAAO,YAAcI,EAAM,CAAC,EAAE,MACvJ,EACQ,KAAK,QAAUA,EAAM,CAAC,EACtB,KAAK,OAASA,EAAM,CAAC,EACrB,KAAK,QAAUA,EACf,KAAK,OAAS,KAAK,OAAO,OACtB,KAAK,QAAQ,SACf,KAAK,OAAO,MAAQ,CAAC,KAAK,OAAQ,KAAK,QAAU,KAAK,MAAM,GAE9D,KAAK,MAAQ,GACb,KAAK,WAAa,GAClB,KAAK,OAAS,KAAK,OAAO,MAAMA,EAAM,CAAC,EAAE,MAAM,EAC/C,KAAK,SAAWA,EAAM,CAAC,EACvBd,EAAQ,KAAK,cAAc,KAAK,KAAM,KAAK,GAAI,KAAMe,EAAc,KAAK,eAAe,KAAK,eAAe,OAAS,CAAC,CAAC,EAClH,KAAK,MAAQ,KAAK,SACpB,KAAK,KAAO,IAEVf,EACF,OAAOA,EACF,GAAI,KAAK,WAAY,CAC1B,QAAS/L,KAAK+M,EACZ,KAAK/M,CAAC,EAAI+M,EAAO/M,CAAC,EAEpB,MAAO,EACT,CACA,MAAO,EACT,EAAG,YAAY,EAEf,KAAsBgJ,EAAO,UAAW,CACtC,GAAI,KAAK,KACP,OAAO,KAAK,IAET,KAAK,SACR,KAAK,KAAO,IAEd,IAAI+C,EAAOc,EAAOG,EAAWnN,EACxB,KAAK,QACR,KAAK,OAAS,GACd,KAAK,MAAQ,IAGf,QADIoN,EAAQ,KAAK,cAAa,EACrBtX,EAAI,EAAGA,EAAIsX,EAAM,OAAQtX,IAEhC,GADAqX,EAAY,KAAK,OAAO,MAAM,KAAK,MAAMC,EAAMtX,CAAC,CAAC,CAAC,EAC9CqX,IAAc,CAACH,GAASG,EAAU,CAAC,EAAE,OAASH,EAAM,CAAC,EAAE,SAGzD,GAFAA,EAAQG,EACRnN,EAAQlK,EACJ,KAAK,QAAQ,gBAAiB,CAEhC,GADAoW,EAAQ,KAAK,WAAWiB,EAAWC,EAAMtX,CAAC,CAAC,EACvCoW,IAAU,GACZ,OAAOA,EACF,GAAI,KAAK,WAAY,CAC1Bc,EAAQ,GACR,QACF,KACE,OAAO,EAEX,SAAW,CAAC,KAAK,QAAQ,KACvB,MAIN,OAAIA,GACFd,EAAQ,KAAK,WAAWc,EAAOI,EAAMpN,CAAK,CAAC,EACvCkM,IAAU,GACLA,EAEF,IAEL,KAAK,SAAW,GACX,KAAK,IAEL,KAAK,WAAW,0BAA4B,KAAK,SAAW,GAAK;AAAA,EAA2B,KAAK,eAAgB,CACtH,KAAM,GACN,MAAO,KACP,KAAM,KAAK,QACvB,CAAW,CAEL,EAAG,MAAM,EAET,IAAqB/C,EAAO,UAAe,CACzC,IAAIhS,EAAI,KAAK,KAAI,EACjB,OAAIA,GAGK,KAAK,IAAG,CAEnB,EAAG,KAAK,EAER,MAAuBgS,EAAO,SAAekE,EAAW,CACtD,KAAK,eAAe,KAAKA,CAAS,CACpC,EAAG,OAAO,EAEV,SAA0BlE,EAAO,UAAoB,CACnD,IAAI6C,EAAI,KAAK,eAAe,OAAS,EACrC,OAAIA,EAAI,EACC,KAAK,eAAe,IAAG,EAEvB,KAAK,eAAe,CAAC,CAEhC,EAAG,UAAU,EAEb,cAA+B7C,EAAO,UAAyB,CAC7D,OAAI,KAAK,eAAe,QAAU,KAAK,eAAe,KAAK,eAAe,OAAS,CAAC,EAC3E,KAAK,WAAW,KAAK,eAAe,KAAK,eAAe,OAAS,CAAC,CAAC,EAAE,MAErE,KAAK,WAAW,QAAW,KAEtC,EAAG,eAAe,EAElB,SAA0BA,EAAO,SAAkB6C,EAAG,CAEpD,OADAA,EAAI,KAAK,eAAe,OAAS,EAAI,KAAK,IAAIA,GAAK,CAAC,EAChDA,GAAK,EACA,KAAK,eAAeA,CAAC,EAErB,SAEX,EAAG,UAAU,EAEb,UAA2B7C,EAAO,SAAmBkE,EAAW,CAC9D,KAAK,MAAMA,CAAS,CACtB,EAAG,WAAW,EAEd,eAAgClE,EAAO,UAA0B,CAC/D,OAAO,KAAK,eAAe,MAC7B,EAAG,gBAAgB,EACnB,QAAS,CAAE,mBAAoB,EAAI,EACnC,cAA+BA,EAAO,SAAmBqB,EAAI8C,EAAKC,EAA2BC,EAAU,CAErG,OAAQD,EAAyB,CAC/B,IAAK,GACH,MACF,IAAK,GACH,MACF,IAAK,GACH,MACF,IAAK,GACH,GAAI/C,EAAG,eAAiBA,EAAG,cAAa,EACtC,OAAAA,EAAG,kBAAoB,GACvB,KAAK,MAAM,SAAS,EACb,GAET,MACF,IAAK,GACH,MACF,IAAK,GACCA,EAAG,eACLA,EAAG,cAAc,EAAK,EAExB,KAAK,MAAM,SAAS,EACpB,KAAK,MAAM8C,EAAI,MAAM,EACrB,MACF,IAAK,GACH,YAAK,MAAM,KAAK,EACT,EAET,IAAK,GACH,MACF,IAAK,GACH,MACF,IAAK,GACH,MAAO,GAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,MAAO,GAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,GAAI9C,EAAG,kBACLA,EAAG,kBAAoB,OAEvB,OAAO,IAET,MACF,IAAK,IACH,MAAO,IAET,IAAK,IACH,OAAA8C,EAAI,OAASA,EAAI,OAAO,MAAM,EAAG,EAAE,EAC5B,GAET,IAAK,IACH,OAAAA,EAAI,OAASA,EAAI,OAAO,MAAM,EAAG,EAAE,EAAE,KAAI,EAClC,GAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,MAAO,IAET,IAAK,IACH,MAAO,GAEnB,CACM,EAAG,WAAW,EACd,MAAO,CAAC,uBAAwB,sBAAuB,yBAA0B,yBAA0B,eAAgB,mBAAoB,gBAAiB,iBAAkB,eAAgB,UAAW,wBAAyB,oBAAqB,cAAe,gBAAiB,eAAgB,gBAAiB,qBAAsB,qBAAsB,iCAAkC,0BAA2B,8EAA+E,6DAA8D,iCAAkC,iBAAkB,UAAW,SAAS,EAC1nB,WAAY,CAAE,IAAO,CAAE,MAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EAAG,UAAa,EAAI,EAAI,QAAW,CAAE,MAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EAAG,UAAa,EAAI,CAAE,CACxR,EACI,OAAO3B,CACT,GAAC,EACDvB,EAAQ,MAAQsC,EAChB,SAASe,GAAS,CAChB,KAAK,GAAK,CAAA,CACZ,CACA,OAAAtE,EAAOsE,EAAQ,QAAQ,EACvBA,EAAO,UAAYrD,EACnBA,EAAQ,OAASqD,EACV,IAAIA,CACb,GAAC,EACDxE,GAAO,OAASA,GAChB,IAAIyE,GAAezE,GAGf0E,GAAU,CAAA,EACVC,GAAY,CAAA,EACZC,GAAe,CAAA,EACfC,GAA4B,IAAI,IAChCC,GACAC,GAAa,GACbC,GAAgC9E,EAAO,CAAC+E,EAAgBhJ,EAAOvF,IAAS,CAC1E,MAAMtD,EAAO8R,GAAwBD,CAAc,EAAE,KAAI,EACnDE,EAAezO,GAAQ,GAAK,KAAK,IAAIuO,EAAe,OAAQ,CAAC,EACnEH,GAAc1R,EACVA,EAAK,SAAW,GAClByR,GAAU,IAAIzR,EAAK,CAAC,CAAC,EAEvBsR,GAAQ,KAAK,CACX,KAAAtR,EACA,KAAM+R,EACN,MAAOlJ,EAAQmJ,GAAcnJ,CAAK,EAAI,MAC1C,CAAG,CACH,EAAG,eAAe,EACdoJ,GAAgCnF,EAAO,IAClCwE,GACN,eAAe,EACdU,GAAgClF,EAAQ1C,GAAS,CACnD,MAAM8H,EAAU9H,EAAK,KAAI,EACzB,OAAI8H,EAAQ,QAAU,GAAKA,EAAQ,WAAW,GAAG,GAAKA,EAAQ,SAAS,GAAG,EACjEA,EAAQ,MAAM,EAAG,EAAE,EAErBA,CACT,EAAG,eAAe,EACdC,GAAsCrF,EAAQlQ,GACzCA,GAAQoV,GAAcpV,CAAK,EACjC,qBAAqB,EACpBwV,GAA8BtF,EAAO,CAAC+E,EAAgBzK,EAAIyB,IAAU,CACtE,MAAMwJ,EAAeL,GAAc5K,CAAE,EACrCmK,GAAU,KAAK,CACb,KAAMO,GAAwBD,CAAc,EAAE,KAAI,EAClD,GAAIQ,EACJ,MAAOxJ,EAAQmJ,GAAcnJ,CAAK,EAAI,MAC1C,CAAG,CACH,EAAG,aAAa,EACZyJ,GAA+BxF,EAAO,CAAC+E,EAAgBtJ,IAAS,CAClE,MAAMgK,EAAUT,GAAwBD,CAAc,EAAE,KAAI,EACtDW,EAAS,CAAA,EACf,SAAW,CAACrK,EAAKvL,CAAK,IAAK2L,EACzBiK,EAAOrK,CAAG,EAAIgK,GAAoBvV,CAAK,GAAKA,EAE9C4U,GAAa,KAAK,CAAE,QAAAe,EAAS,OAAAC,CAAM,CAAE,CACvC,EAAG,cAAc,EACbC,GAA+B3F,EAAO,IACjC0E,GACN,cAAc,EACbM,GAA0ChF,EAAQ+E,GAC7CA,EAAe,IAAKa,GAAeV,GAAcU,CAAU,CAAC,EAClE,yBAAyB,EACxBC,GAA2C7F,EAAQ+E,GAAmB,CAExE,MAAMe,EADad,GAAwBD,CAAc,EAC9B,OAAQa,GAAe,CAACjB,GAAU,IAAIiB,CAAU,CAAC,EAC5E,GAAIE,EAAQ,OAAS,EACnB,MAAM,IAAI,MAAM,2BAA2BA,EAAQ,KAAK,IAAI,CAAC,EAAE,CAEnE,EAAG,0BAA0B,EACzBC,GAA8B/F,EAAO,IAChCyE,GACN,aAAa,EACZuB,GAAiChG,EAAO,IAAM4E,GAAa,gBAAgB,EAC3EqB,GAAgCjG,EAAO,IAAM6E,GAAY,eAAe,EACxEqB,GAAgClG,EAAQmG,GAAY,CACtDtB,GAAasB,CACf,EAAG,eAAe,EACdC,GAAsBC,GAAsB,KAChD,SAASC,IAAa,CACpB,OAAOC,GAAcH,GAAqBI,GAAS,EAAG,IAAI,CAC5D,CACAxG,EAAOsG,GAAY,WAAW,EAC9B,IAAIG,GAA8BzG,EAAO,IAAM,CAC7C0G,GAAK,EACLlC,GAAQ,OAAS,EACjBC,GAAU,OAAS,EACnBC,GAAa,OAAS,EACtBC,GAAU,MAAK,EACfC,GAAc,OACdC,GAAa,EACf,EAAG,aAAa,EACZ8B,GAAK,CACP,UAAWL,GACX,MAAOG,GACP,YAAAG,GACA,YAAAC,GACA,gBAAAC,GACA,gBAAAC,GACA,kBAAAC,GACA,kBAAAC,GACA,cAAAnC,GACA,cAAAK,GACA,YAAAG,GACA,aAAAE,GACA,yBAAAK,GACA,YAAAE,GACA,aAAAJ,GACA,eAAAK,GACA,cAAAC,GACA,cAAAC,EACF,EAGIgB,GAA4BlH,EAAQxF,GAAY;AAAA;AAAA;AAAA,YAGxCA,EAAQ,kBAAkB;AAAA,mBACnBA,EAAQ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,mBAKlBA,EAAQ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,YAKzBA,EAAQ,gBAAgB;AAAA,mBACjBA,EAAQ,UAAU;AAAA;AAAA;AAAA;AAAA,mBAIlBA,EAAQ,UAAU;AAAA,aACxBA,EAAQ,gBAAgB;AAAA;AAAA,EAElC,WAAW,EACV2M,GAAiBD,GAOrB,SAASE,GAAgBC,EAAW,CAClC,MAAMC,EAAsB,IAAI,IAChC,UAAWC,KAASF,EAAW,CAC7B,MAAMhM,EAAMkM,EAAM,QAAQ,KAAK,GAAG,EAC5BC,EAAWF,EAAI,IAAIjM,CAAG,EACxBmM,EACF,OAAO,OAAOA,EAAUD,EAAM,MAAM,EAEpCD,EAAI,IAAIjM,EAAK,CAAE,GAAGkM,EAAM,MAAM,CAAE,CAEpC,CACA,OAAOD,CACT,CACAtH,EAAOoH,GAAiB,iBAAiB,EACzC,IAAIK,GAAuBzH,EAAO,CAAC0H,EAAOpN,EAAIqN,EAAUC,IAAY,CAClE,MAAMC,EAAMD,EAAQ,GACdE,EAASD,EAAI,YAAS,EACtB,CAAE,eAAAE,EAAgB,KAAAC,EAAM,cAAAC,CAAa,EAAKzB,GAAS,EACnD0B,EAAcF,IAAS,YACvBG,EAAc,CAClBJ,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,MACfA,EAAe,KACnB,EAAI,OAAO,OAAO,EACVK,EAAQP,EAAI,kBAAe,EAC3B3U,EAAO2U,EAAI,cAAa,EACxBQ,EAAaR,EAAI,YAAW,EAC5BS,EAAalB,GAAgBS,EAAI,aAAY,CAAE,EAC/CU,EAAWT,GAAQ,OAAS,IAC5BU,EAAYV,GAAQ,QAAU,IAE9BjY,EAAQ0Y,EADU,KAElBE,EAAcL,EAAQ,GAAKvY,EAAQ,EACnC6Y,EAAmBX,EAAe,kBAAoBA,EAAe,UACrE/L,EAAM2M,GAAiBrO,CAAE,EAC/B0B,EAAI,KAAK,UAAW,OAAOuM,CAAQ,IAAIC,CAAS,EAAE,EAC9CJ,GACFpM,EAAI,OAAO,MAAM,EAAE,KAAKoM,CAAK,EAAE,KAAK,QAAS,YAAY,EAAE,KAAK,YAAa,GAAG,GAAKvY,CAAK,IAAI,EAAE,KAAK,cAAe,QAAQ,EAAE,KAAK,oBAAqB,QAAQ,EAAE,KAAK,IAAK,KAAK,EAAE,KAAK,IAAK,GAAKA,CAAK,EAAE,MAAM,OAAQkY,EAAe,oBAAsBA,EAAe,UAAU,EAEvR,MAAMa,EAAcC,GAAS,SAAS,cAAc,KAAK,CAAC,EACpDC,EAAcC,GAAgB,EAAG,MAAMR,CAAQ,EAAE,OAAOC,EAAYC,CAAW,EACrFG,EAAY,MAAM1V,CAAI,EAAE,KAAK4V,CAAW,EACxC,MAAME,EAAWd,EAAce,GAAM,IAAIL,EAAY,OAAO,KAAK,EAAE,KAAI,CAAE,EAAI,OACvEM,EAAcC,GAAYjW,EAAM,CACpC,MAAOqV,EACP,OAAQC,EAAYC,EACpB,QAASX,GAAQ,SAAW,EAChC,CAAG,EACKsB,EAA8B,IAAI,IACxC,UAAW/U,KAAQ6U,EAAa,CAC9B,MAAM7N,EAAMgO,EAAc,CAAC,GAAGhV,EAAK,KAAK,IAAI,EAAE,MAAM,EACpD+U,EAAY,IAAI/N,EAAKhH,CAAI,CAC3B,CACIgU,EAAW,OAAS,GACtBiB,GAAgBxB,EAAQsB,EAAaR,EAAaP,EAAYxY,EAAOyY,CAAU,EAEjF,MAAMiB,EAAYC,GAAOzB,EAAe,YAAc,SAAS,EAC/Da,EAAY,UAAU,cAAc,EAAE,KAAK,SAASxa,EAAGzB,EAAG,CACxD,MAAM8c,EAAQZ,GAAS,IAAI,EAErBa,EAAUL,EAAc,CAAC,GADlBjb,EAC0B,IAAI,EAAE,MAAM,EAC7Cub,EAAcrB,EAAW,IAAIoB,CAAO,EACpCE,EAAYD,GAAa,MAAQxB,EAAYxb,EAAIwb,EAAY,MAAM,GAAKJ,EAAe,aAC7F0B,EAAM,QAAQ,YAAY9c,EAAI,CAAC,GAAI,EAAI,EACvC,MAAMkd,EAAcF,IAAc,cAAc,GAAK,GAC/CG,EAAcH,GAAa,QAAUC,EACrCG,EAAiBJ,IAAc,cAAc,GAAK,GAAG,EAAI9Z,CAAK,GACpE,GAAIqY,GAAec,EAAU,CAC3B,MAAMgB,EAAaZ,EAAY,IAAIM,CAAO,EAC1C,GAAIM,GAAcA,EAAW,QAAQ,OAAS,EAAG,CAC/C,MAAMja,EAAIia,EAAW,QAAQ,CAAC,EACxBC,EAAYjB,EAAS,OAAOjZ,EAAE,EAAGA,EAAE,EAAGA,EAAE,OAAS,EAAG,CACxD,UAAW,GACX,KAAMkY,EACN,KAAMxc,GAAeme,EAAW,EAAG,EACnC,UAAW,UACX,WAAY,EACZ,WAAY,EACZ,aAAc,IAAMjd,EAAI,GACxB,OAAQmd,EACR,YAAa,WAAW,OAAOC,CAAc,CAAC,CACxD,CAAS,EACDN,EAAM,OAAO,MAAM,EAAE,OAAM,EAC3BA,EAAM,QAAQ,aAAaQ,EAAWR,EAAM,OAAO,MAAM,EAAE,MAAM,CACnE,CACF,MACEA,EAAM,OAAO,MAAM,EAAE,MAAM,OAAQG,CAAS,EAAE,MAAM,eAAgBC,CAAW,EAAE,MAAM,SAAUC,CAAW,EAAE,MAAM,eAAgBC,CAAc,EAAE,MAAM,iBAAkB,GAAI,EAElL,MAAMG,EAAYP,GAAa,QAAUJ,EAAYY,GAAQP,EAAW,EAAE,EAAIQ,GAAOR,EAAW,EAAE,GAClGH,EAAM,OAAO,MAAM,EAAE,MAAM,YAAa,GAAG,GAAK5Z,CAAK,IAAI,EAAE,MAAM,OAAQqa,CAAS,CACpF,CAAC,EACGhC,GAAec,EACjBJ,EAAY,UAAU,oBAAoB,EAAE,KAAK,SAASxa,EAAG,CAC3D,MAAMqb,EAAQZ,GAAS,IAAI,EAErBa,EAAUL,EAAc,CAAC,GADlBjb,EAC0B,IAAI,EAAE,MAAM,EAC7Cub,EAAcrB,EAAW,IAAIoB,CAAO,EACpCW,EAAaV,GAAa,KAChC,GAAIU,EAAY,CACd,MAAMC,EAASb,EAAM,OAAO,MAAM,EAC5Bc,EAAQD,EAAO,KAAK,GAAG,EAC7B,GAAIC,EAAO,CACT,MAAMN,EAAYjB,EAAS,KAAKuB,EAAO,CACrC,UAAW,GACX,KAAMtC,EACN,KAAMxc,GAAe4e,EAAY,EAAG,EACpC,UAAW,cACX,WAAY,EACZ,WAAY,EACZ,aAAc,GACd,OAAQ,MACpB,CAAW,EACKG,EAAeF,EAAO,KAAI,EAChCE,GAAc,YAAY,aAAaP,EAAWO,CAAY,EAC9DF,EAAO,OAAM,CACf,CACF,MACEb,EAAM,OAAO,MAAM,EAAE,MAAM,eAAgB,CAAC,EAE9CA,EAAM,OAAO,MAAM,EAAE,MAAM,YAAa,GAAG,GAAK5Z,CAAK,IAAI,EAAE,MAAM,OAAQ8Z,GAAa,OAAS5B,EAAe,kBAAoBW,CAAgB,CACpJ,CAAC,GAEDE,EAAY,UAAU,yBAAyB,EAAE,MAAM,YAAa,GAAG,GAAK/Y,CAAK,IAAI,EAAE,MAAM,OAAS2O,GAAM,CAE1G,MAAMkL,EAAUL,EAAc,CAAC,GADlB7K,EAC0B,IAAI,EAAE,MAAM,EACnD,OAAO8J,EAAW,IAAIoB,CAAO,GAAG,OAAS3B,EAAe,kBAAoBW,CAC9E,CAAC,EACDE,EAAY,UAAU,yBAAyB,EAAE,MAAM,eAAiBpK,GAAM,CAE5E,MAAMkL,EAAUL,EAAc,CAAC,GADlB7K,EAC0B,IAAI,EAAE,MAAM,EACnD,OAAO8J,EAAW,IAAIoB,CAAO,GAAG,KAAO,EAAI,CAC7C,CAAC,EAAE,MAAM,OAASlL,GAAM,CAEtB,MAAMkL,EAAUL,EAAc,CAAC,GADlB7K,EAC0B,IAAI,EAAE,MAAM,EACnD,OAAO8J,EAAW,IAAIoB,CAAO,GAAG,MAAQ,aAC1C,CAAC,GAEH,MAAMe,EAAYzO,EAAI,OAAO,GAAG,EAAE,KAAK,YAAa,gBAAgByM,CAAW,GAAG,EAC5EiC,EAAW9B,EAAY,OAAO,KAAK,EAAE,KAAI,EAC/C,GAAI8B,GAAY,eAAgBA,EAC9B,UAAWC,IAAS,CAAC,GAAGD,EAAS,UAAU,EACzCD,EAAU,KAAI,GAAI,YAAYE,CAAK,EAGvCC,GAAiB5O,EAAKwM,EAAWD,EAAUT,GAAQ,aAAe,EAAI,CACxE,EAAG,MAAM,EACT,SAASuB,EAAcwB,EAAQ,CAC7B,OAAOA,EAAO,KAAK,GAAG,CACxB,CACA7K,EAAOqJ,EAAe,eAAe,EACrC,SAASC,GAAgBxB,EAAQsB,EAAaR,EAAaP,EAAYxY,EAAOyY,EAAY,CACxF,MAAMwC,EAAiBhD,GAAQ,gBAAkB,GAE3CiD,EADUnC,EAAY,OAAO,KAAK,EACd,OAAO,GAAG,EAAE,KAAK,QAAS,iBAAiB,EAC/DoC,EAA8B,IAAI,IACxC,UAAWC,KAAQ5C,EAAY,CAC7B,MAAMhN,EAAMgO,EAAc4B,EAAK,IAAI,EAC7BzD,EAAWwD,EAAY,IAAI3P,CAAG,EAChCmM,EACFA,EAAS,KAAKyD,CAAI,EAElBD,EAAY,IAAI3P,EAAK,CAAC4P,CAAI,CAAC,CAE/B,CACA,SAAW,CAAC5P,EAAKqB,CAAK,IAAKsO,EAAY,QAAO,EAAI,CAChD,MAAM3W,EAAO+U,EAAY,IAAI/N,CAAG,EAChC,GAAI,CAAChH,GAAM,KACT,SAEF,MAAM6W,EAAU7W,EAAK,KAAK,EACpB8W,EAAU9W,EAAK,KAAK,EACpB+W,EAAkB,KAAK,IAAI,GAAG/W,EAAK,QAAQ,IAAKtE,GAAMA,EAAE,MAAM,CAAC,EAC/Dsb,EAAiB,KAAK,IAC1B,GAAGhX,EAAK,QAAQ,IAAKtE,GAAMA,EAAE,OAAS,KAAK,MAAMmb,EAAUnb,EAAE,EAAGob,EAAUpb,EAAE,CAAC,CAAC,CACpF,EACI,IAAIub,EAAc,OAAO,SAASD,CAAc,EAAI,KAAK,IAAI,EAAGA,CAAc,EAAI,EAC9EC,IAAgB,GAAK,OAAO,SAASF,CAAe,IACtDE,EAAcF,EAAkB,IAElC,MAAMG,EAAYR,EAAU,OAAO,GAAG,EAAE,KAAK,QAAS,gBAAgB,EAAE,KAAK,YAAa,GAAG,GAAKlb,CAAK,IAAI,EACvGib,GACFS,EAAU,OAAO,QAAQ,EAAE,KAAK,QAAS,wBAAwB,EAAE,KAAK,KAAML,CAAO,EAAE,KAAK,KAAMC,CAAO,EAAE,KAAK,IAAKG,CAAW,EAAE,KAAK,OAAQ,MAAM,EAAE,KAAK,SAAU,QAAQ,EAAE,KAAK,eAAgB,IAAMzb,CAAK,EAAE,KAAK,mBAAoB,GAAG,EAAIA,CAAK,IAAI,EAAIA,CAAK,EAAE,EAExQ,MAAM2b,EAAa,KAAK,IAAI,GAAK3b,EAAOyb,EAAc,EAAI,GAAI,EACxDG,EAAc,KAAK,IAAI,GAAK5b,EAAOyb,EAAc,EAAI,GAAI,EAGzDI,GAFWrX,EAAK,KAAK,OAASA,EAAK,KAAK,MAAM,OAAS,EAC1B,KAAK,IAAI,GAAKxE,EAAOyb,EAAc,GAAI,EAAI,IACvC5O,EAAM,QAAU,EAAI,GAAK7M,EAAQ,GAClE8b,EAAST,EAAUM,EAAa,EAChCI,EAAST,EAAUM,EAAc,EAAIC,EACrCG,EAAO,KAAK,IAAI,EAAG,KAAK,KAAK,KAAK,KAAKnP,EAAM,MAAM,CAAC,CAAC,EACrDoP,EAAO,KAAK,IAAI,EAAG,KAAK,KAAKpP,EAAM,OAASmP,CAAI,CAAC,EACjDE,EAAYP,EAAaK,EACzBG,EAAaP,EAAcK,EACjC,SAAW,CAACnf,EAAGse,CAAI,IAAKvO,EAAM,QAAO,EAAI,CACvC,MAAMuP,EAAMtf,EAAIkf,EACV5V,EAAM,KAAK,MAAMtJ,EAAIkf,CAAI,EACzBrc,EAAImc,EAASI,GAAaE,EAAM,IAChCvc,EAAIkc,EAASI,GAAc/V,EAAM,IACnC6U,GACFS,EAAU,OAAO,MAAM,EAAE,KAAK,QAAS,sBAAsB,EAAE,KAAK,IAAKI,EAASI,EAAYE,CAAG,EAAE,KAAK,IAAKL,EAASI,EAAa/V,CAAG,EAAE,KAAK,QAAS8V,CAAS,EAAE,KAAK,SAAUC,CAAU,EAAE,KAAK,OAAQ,MAAM,EAAE,KAAK,SAAU,MAAM,EAAE,KAAK,eAAgB,EAAInc,CAAK,EAAE,KAAK,mBAAoB,GAAG,EAAIA,CAAK,IAAI,EAAIA,CAAK,EAAE,EAE9T,MAAMqc,EAAWH,EAAY,GACvBI,EAAYH,EAAa,GACzBI,EAAYb,EAAU,OAAO,eAAe,EAAE,KAAK,QAAS,mBAAmB,EAAE,KAAK,QAASW,CAAQ,EAAE,KAAK,SAAUC,CAAS,EAAE,KAAK,IAAK3c,EAAI0c,EAAW,CAAC,EAAE,KAAK,IAAKxc,EAAIyc,EAAY,CAAC,EAAE,KAAK,WAAY,SAAS,EACtNjC,EAAY5B,EAAW,IAAI2C,EAAK,EAAE,GAAG,MACrC3N,EAAO8O,EAAU,OAAO,YAAY,EAAE,KAAK,QAAS,gBAAgB,EAAE,MAAM,UAAW,MAAM,EAAE,MAAM,QAAS,MAAM,EAAE,MAAM,SAAU,MAAM,EAAE,MAAM,cAAe,QAAQ,EAAE,MAAM,cAAe,QAAQ,EAAE,MAAM,kBAAmB,QAAQ,EAAE,MAAM,aAAc,QAAQ,EAAE,MAAM,gBAAiB,QAAQ,EAAE,MAAM,aAAc,QAAQ,EAAE,KAAKnB,EAAK,OAASA,EAAK,EAAE,EACxWf,GACF5M,EAAK,MAAM,QAAS4M,CAAS,CAEjC,CACF,CACF,CACAlK,EAAOsJ,GAAiB,iBAAiB,EACzC,IAAI+C,GAAW,CAAE,KAAA5E,EAAI,EAGjB6E,GAAU,CACZ,OAAQ/H,GACR,GAAAoC,GACA,SAAA0F,GACA,OAAQlF,EACV","x_google_ignoreList":[0,1,2]}

package/client/assets/wardleyDiagram-NUSXRM2D-BnIpr1Bt.js

@@ -0,0 +1,21 @@
+import{s as $t,g as Mt,q as Ct,p as Nt,a as zt,b as Lt,_ as y,l as K,I as Xt,e as At,z as Et,c as q,i as Tt}from"./mermaid.core-BAZ_6TES.js";import{p as Yt}from"./chunk-4BX2VUAB-e81eyiRE.js";import{p as Bt}from"./cynefin-VYW2F7L2-COEZZ5bw.js";import"./index-BwOQYY4Q.js";var G=y((e,s)=>{const a=e<=1?e*100:e;if(a<0||a>100)throw new Error(`${s} must be between 0-1 (decimal) or 0-100 (percentage). Received: ${e}`);return a},"toPercent"),E=y((e,s,a)=>({x:G(s,`${a} evolution`),y:G(e,`${a} visibility`)}),"toCoordinates"),J=y(e=>{if(e){if(e==="+<>")return"bidirectional";if(e==="+<")return"backward";if(e==="+>")return"forward"}},"getFlowFromPort"),Rt=y(e=>{if(!e?.startsWith("+"))return{};const a=/^\+'([^']*)'/.exec(e)?.[1];return e.includes("<>")?{flow:"bidirectional",label:a}:e.includes("<")?{flow:"backward",label:a}:e.includes(">")?{flow:"forward",label:a}:{label:a}},"extractFlowFromArrow"),Ft=y((e,s)=>{if(Yt(e,s),e.size&&s.setSize(e.size.width,e.size.height),e.evolution){const a=e.evolution.stages.map(o=>o.secondName?`${o.name.trim()} / ${o.secondName.trim()}`:o.name.trim()),x=e.evolution.stages.filter(o=>o.boundary!==void 0).map(o=>o.boundary);s.updateAxes({stages:a,stageBoundaries:x})}if(e.anchors.forEach(a=>{const x=E(a.visibility,a.evolution,`Anchor "${a.name}"`);s.addNode(a.name,a.name,x.x,x.y,"anchor")}),e.components.forEach(a=>{const x=E(a.visibility,a.evolution,`Component "${a.name}"`),o=a.label?(a.label.negX?-1:1)*a.label.offsetX:void 0,d=a.label?(a.label.negY?-1:1)*a.label.offsetY:void 0,m=a.decorator?.strategy;s.addNode(a.name,a.name,x.x,x.y,"component",o,d,a.inertia,m)}),e.notes.forEach(a=>{const x=E(a.visibility,a.evolution,`Note "${a.text}"`);s.addNote(a.text,x.x,x.y)}),e.pipelines.forEach(a=>{const x=s.getNode(a.parent);if(!x||typeof x.y!="number")throw new Error(`Pipeline "${a.parent}" must reference an existing component with coordinates.`);const o=x.y;s.startPipeline(a.parent),a.components.forEach(d=>{const m=`${a.parent}_${d.name}`,M=d.label?(d.label.negX?-1:1)*d.label.offsetX:void 0,g=d.label?(d.label.negY?-1:1)*d.label.offsetY:void 0,I=G(d.evolution,`Pipeline component "${d.name}" evolution`);s.addNode(m,d.name,I,o,"pipeline-component",M,g),s.addPipelineComponent(a.parent,m)})}),e.links.forEach(a=>{const x=!!a.arrow&&(a.arrow.includes("-.->")||a.arrow.includes(".-."));let o=J(a.fromPort)??J(a.toPort);const{flow:d,label:m}=Rt(a.arrow);!o&&d&&(o=d);const M=a.linkLabel,g=m??M;s.addLink(a.from,a.to,x,g,o)}),e.evolves.forEach(a=>{const x=s.getNode(a.component);if(x?.y!==void 0){const o=G(a.target,`Evolve target for "${a.component}"`);s.addTrend(a.component,o,x.y)}}),e.annotations.length>0){const a=e.annotations[0],x=E(a.x,a.y,"Annotations box");s.setAnnotationsBox(x.x,x.y)}e.annotation.forEach(a=>{const x=E(a.x,a.y,`Annotation ${a.number}`);s.addAnnotation(a.number,[{x:x.x,y:x.y}],a.text)}),e.accelerators.forEach(a=>{const x=E(a.x,a.y,`Accelerator "${a.name}"`);s.addAccelerator(a.name,x.x,x.y)}),e.deaccelerators.forEach(a=>{const x=E(a.x,a.y,`Deaccelerator "${a.name}"`);s.addDeaccelerator(a.name,x.x,x.y)})},"populateDb"),Q={parser:{yy:void 0},parse:y(async e=>{const s=await Bt("wardley",e);K.debug(s);const a=Q.parser?.yy;if(!a||typeof a.addNode!="function")throw new Error("parser.parser?.yy was not a WardleyDB. This is due to a bug within Mermaid, please report this issue at https://github.com/mermaid-js/mermaid/issues.");Ft(s,a)},"parse")},It=class{constructor(){this.nodes=new Map,this.links=[],this.trends=new Map,this.pipelines=new Map,this.annotations=[],this.notes=[],this.accelerators=[],this.deaccelerators=[],this.axes={}}static{y(this,"WardleyBuilder")}addNode(e){const s=this.nodes.get(e.id)??{id:e.id,label:e.label},a={...s,...e,className:e.className??s.className,labelOffsetX:e.labelOffsetX??s.labelOffsetX,labelOffsetY:e.labelOffsetY??s.labelOffsetY};this.nodes.set(e.id,a)}addLink(e){this.links.push(e)}addTrend(e){this.trends.set(e.nodeId,e)}startPipeline(e){this.pipelines.set(e,{nodeId:e,componentIds:[]});const s=this.nodes.get(e);s&&(s.isPipelineParent=!0)}addPipelineComponent(e,s){const a=this.pipelines.get(e);a&&a.componentIds.push(s);const x=this.nodes.get(s);x&&(x.inPipeline=!0)}addAnnotation(e){this.annotations.push(e)}addNote(e){this.notes.push(e)}addAccelerator(e){this.accelerators.push(e)}addDeaccelerator(e){this.deaccelerators.push(e)}setAnnotationsBox(e,s){this.annotationsBox={x:e,y:s}}setAxes(e){this.axes={...this.axes,...e}}setSize(e,s){this.size={width:e,height:s}}getNode(e){return this.nodes.get(e)}build(){const e=[];for(const s of this.nodes.values()){if(typeof s.x!="number"||typeof s.y!="number")throw new Error(`Node "${s.label}" is missing coordinates`);e.push(s)}return{nodes:e,links:[...this.links],trends:[...this.trends.values()],pipelines:[...this.pipelines.values()],annotations:[...this.annotations],notes:[...this.notes],accelerators:[...this.accelerators],deaccelerators:[...this.deaccelerators],annotationsBox:this.annotationsBox,axes:{...this.axes},size:this.size}}clear(){this.nodes.clear(),this.links=[],this.trends.clear(),this.pipelines.clear(),this.annotations=[],this.notes=[],this.accelerators=[],this.deaccelerators=[],this.annotationsBox=void 0,this.axes={},this.size=void 0}},P=new It;function $(e){const s=q();return Tt(e.trim(),s)}y($,"textSanitizer");function tt(){return q()["wardley-beta"]}y(tt,"getConfig");function et(e,s,a,x,o,d,m,M,g){P.addNode({id:e,label:$(s),x:a,y:x,className:o,labelOffsetX:d,labelOffsetY:m,inertia:M,sourceStrategy:g})}y(et,"addNode");function at(e,s,a=!1,x,o){P.addLink({source:e,target:s,dashed:a,label:x,flow:o})}y(at,"addLink");function rt(e,s,a){P.addTrend({nodeId:e,targetX:s,targetY:a})}y(rt,"addTrend");function ot(e,s,a){P.addAnnotation({number:e,coordinates:s,text:a?$(a):void 0})}y(ot,"addAnnotation");function st(e,s,a){P.addNote({text:$(e),x:s,y:a})}y(st,"addNote");function nt(e,s,a){P.addAccelerator({name:$(e),x:s,y:a})}y(nt,"addAccelerator");function it(e,s,a){P.addDeaccelerator({name:$(e),x:s,y:a})}y(it,"addDeaccelerator");function dt(e,s){P.setAnnotationsBox(e,s)}y(dt,"setAnnotationsBox");function lt(e,s){P.setSize(e,s)}y(lt,"setSize");function ct(e){P.startPipeline(e)}y(ct,"startPipeline");function pt(e,s){P.addPipelineComponent(e,s)}y(pt,"addPipelineComponent");function ht(e){const s={};e.xLabel&&(s.xLabel=$(e.xLabel)),e.yLabel&&(s.yLabel=$(e.yLabel)),e.stages&&(s.stages=e.stages.map(a=>$(a))),e.stageBoundaries&&(s.stageBoundaries=e.stageBoundaries),P.setAxes(s)}y(ht,"updateAxes");function ft(e){return P.getNode(e)}y(ft,"getNode");function xt(){return P.build()}y(xt,"getWardleyData");function gt(){P.clear(),Et()}y(gt,"clear");var Ot={getConfig:tt,addNode:et,addLink:at,addTrend:rt,addAnnotation:ot,addNote:st,addAccelerator:nt,addDeaccelerator:it,setAnnotationsBox:dt,setSize:lt,startPipeline:ct,addPipelineComponent:pt,updateAxes:ht,getNode:ft,getWardleyData:xt,clear:gt,setAccTitle:Lt,getAccTitle:zt,setDiagramTitle:Nt,getDiagramTitle:Ct,getAccDescription:Mt,setAccDescription:$t},Wt=["Genesis","Custom Built","Product","Commodity"],Dt=y(()=>{const{themeVariables:e}=q();return{backgroundColor:e.wardley?.backgroundColor??e.background??"#fff",axisColor:e.wardley?.axisColor??"#000",axisTextColor:e.wardley?.axisTextColor??e.primaryTextColor??"#222",gridColor:e.wardley?.gridColor??"rgba(100, 100, 100, 0.2)",componentFill:e.wardley?.componentFill??"#fff",componentStroke:e.wardley?.componentStroke??"#000",componentLabelColor:e.wardley?.componentLabelColor??e.primaryTextColor??"#222",linkStroke:e.wardley?.linkStroke??"#000",evolutionStroke:e.wardley?.evolutionStroke??"#dc3545",annotationStroke:e.wardley?.annotationStroke??"#000",annotationTextColor:e.wardley?.annotationTextColor??e.primaryTextColor??"#222",annotationFill:e.wardley?.annotationFill??e.background??"#fff"}},"getTheme"),Gt=y(()=>{const e=q()["wardley-beta"];return{width:e?.width??900,height:e?.height??600,padding:e?.padding??48,nodeRadius:e?.nodeRadius??6,nodeLabelOffset:e?.nodeLabelOffset??8,axisFontSize:e?.axisFontSize??12,labelFontSize:e?.labelFontSize??10,showGrid:e?.showGrid??!1,useMaxWidth:e?.useMaxWidth??!0}},"getConfigValues"),qt=y((e,s,a,x)=>{K.debug(`Rendering Wardley map
+`+e);const o=Gt(),d=Dt(),m=o.nodeRadius*1.6,M=x.db,g=M.getWardleyData(),I=M.getDiagramTitle(),C=g.size?.width??o.width,b=g.size?.height??o.height,Y=Xt(s);Y.selectAll("*").remove(),At(Y,b,C,o.useMaxWidth),Y.attr("viewBox",`0 0 ${C} ${b}`);const v=Y.append("g").attr("class","wardley-map"),H=Y.append("defs");H.append("marker").attr("id",`arrow-${s}`).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerWidth",6).attr("markerHeight",6).attr("orient","auto-start-reverse").append("path").attr("d","M 0 0 L 10 5 L 0 10 z").attr("fill",d.evolutionStroke).attr("stroke","none"),H.append("marker").attr("id",`link-arrow-end-${s}`).attr("viewBox","0 0 10 10").attr("refX",9).attr("refY",5).attr("markerWidth",5).attr("markerHeight",5).attr("orient","auto").append("path").attr("d","M 0 0 L 10 5 L 0 10 z").attr("fill",d.linkStroke).attr("stroke","none"),H.append("marker").attr("id",`link-arrow-start-${s}`).attr("viewBox","0 0 10 10").attr("refX",1).attr("refY",5).attr("markerWidth",5).attr("markerHeight",5).attr("orient","auto").append("path").attr("d","M 10 0 L 0 5 L 10 10 z").attr("fill",d.linkStroke).attr("stroke","none"),v.append("rect").attr("class","wardley-background").attr("width",C).attr("height",b).attr("fill",d.backgroundColor);const B=C-o.padding*2,R=b-o.padding*2;I&&v.append("text").attr("class","wardley-title").attr("x",C/2).attr("y",o.padding/2).attr("fill",d.axisTextColor).attr("font-size",o.axisFontSize*1.05).attr("font-weight","bold").attr("text-anchor","middle").attr("dominant-baseline","middle").text(I);const L=y(t=>o.padding+t/100*B,"projectX"),X=y(t=>b-o.padding-t/100*R,"projectY"),O=v.append("g").attr("class","wardley-axes");O.append("line").attr("x1",o.padding).attr("x2",C-o.padding).attr("y1",b-o.padding).attr("y2",b-o.padding).attr("stroke",d.axisColor).attr("stroke-width",1),O.append("line").attr("x1",o.padding).attr("x2",o.padding).attr("y1",o.padding).attr("y2",b-o.padding).attr("stroke",d.axisColor).attr("stroke-width",1);const ut=g.axes.xLabel??"Evolution",yt=g.axes.yLabel??"Visibility";O.append("text").attr("class","wardley-axis-label wardley-axis-label-x").attr("x",o.padding+B/2).attr("y",b-o.padding/4).attr("fill",d.axisTextColor).attr("font-size",o.axisFontSize).attr("font-weight","bold").attr("text-anchor","middle").text(ut),O.append("text").attr("class","wardley-axis-label wardley-axis-label-y").attr("x",o.padding/3).attr("y",o.padding+R/2).attr("fill",d.axisTextColor).attr("font-size",o.axisFontSize).attr("font-weight","bold").attr("text-anchor","middle").attr("transform",`rotate(-90 ${o.padding/3} ${o.padding+R/2})`).text(yt);const F=g.axes.stages&&g.axes.stages.length>0?g.axes.stages:Wt;if(F.length>0){const t=v.append("g").attr("class","wardley-stages"),n=g.axes.stageBoundaries,r=[];if(n&&n.length===F.length){let i=0;n.forEach(p=>{r.push({start:i,end:p}),i=p})}else{const i=1/F.length;F.forEach((p,l)=>{r.push({start:l*i,end:(l+1)*i})})}F.forEach((i,p)=>{const l=r[p],h=o.padding+l.start*B,f=o.padding+l.end*B,u=(h+f)/2;p>0&&t.append("line").attr("x1",h).attr("x2",h).attr("y1",o.padding).attr("y2",b-o.padding).attr("stroke","#000").attr("stroke-width",1).attr("stroke-dasharray","5 5").attr("opacity",.8),t.append("text").attr("class","wardley-stage-label").attr("x",u).attr("y",b-o.padding/1.5).attr("fill",d.axisTextColor).attr("font-size",o.axisFontSize-2).attr("text-anchor","middle").text(i)})}if(o.showGrid){const t=v.append("g").attr("class","wardley-grid");for(let n=1;n<4;n++){const r=n/4,i=o.padding+B*r;t.append("line").attr("x1",i).attr("x2",i).attr("y1",o.padding).attr("y2",b-o.padding).attr("stroke",d.gridColor).attr("stroke-dasharray","2 6"),t.append("line").attr("x1",o.padding).attr("x2",C-o.padding).attr("y1",b-o.padding-R*r).attr("y2",b-o.padding-R*r).attr("stroke",d.gridColor).attr("stroke-dasharray","2 6")}}const c=new Map;if(g.nodes.forEach(t=>{c.set(t.id,{x:L(t.x),y:X(t.y),node:t})}),g.pipelines.length>0){const t=v.append("g").attr("class","wardley-pipelines"),n=v.append("g").attr("class","wardley-pipeline-links");g.pipelines.forEach(r=>{if(r.componentIds.length===0)return;const i=r.componentIds.map(f=>({id:f,pos:c.get(f),node:g.nodes.find(u=>u.id===f)})).filter(f=>f.pos&&f.node).sort((f,u)=>f.node.x-u.node.x);for(let f=0;f<i.length-1;f++){const u=i[f],w=i[f+1];n.append("line").attr("class","wardley-pipeline-evolution-link").attr("x1",u.pos.x).attr("y1",u.pos.y).attr("x2",w.pos.x).attr("y2",w.pos.y).attr("stroke",d.linkStroke).attr("stroke-width",1).attr("stroke-dasharray","4 4")}let p=1/0,l=-1/0,h=0;if(r.componentIds.forEach(f=>{const u=c.get(f);u&&(p=Math.min(p,u.x),l=Math.max(l,u.x),h=u.y)}),p!==1/0&&l!==-1/0){const u=o.nodeRadius*4,w=h-u/2,S=c.get(r.nodeId);if(S){const z=(p+l)/2;S.x=z,S.y=w-m/6}t.append("rect").attr("class","wardley-pipeline-box").attr("x",p-15).attr("y",w).attr("width",l-p+30).attr("height",u).attr("fill","none").attr("stroke",d.axisColor).attr("stroke-width",1.5).attr("rx",4).attr("ry",4)}})}const V=v.append("g").attr("class","wardley-links"),Z=new Map;g.pipelines.forEach(t=>{Z.set(t.nodeId,new Set(t.componentIds))});const U=g.links.filter(t=>!(!c.has(t.source)||!c.has(t.target)||Z.get(t.target)?.has(t.source)));V.selectAll("line").data(U).enter().append("line").attr("class",t=>`wardley-link${t.dashed?" wardley-link--dashed":""}`).attr("x1",t=>{const n=c.get(t.source),r=c.get(t.target),p=g.nodes.find(u=>u.id===t.source).isPipelineParent?m/Math.sqrt(2):o.nodeRadius,l=r.x-n.x,h=r.y-n.y,f=Math.sqrt(l*l+h*h);return n.x+l/f*p}).attr("y1",t=>{const n=c.get(t.source),r=c.get(t.target),p=g.nodes.find(u=>u.id===t.source).isPipelineParent?m/Math.sqrt(2):o.nodeRadius,l=r.x-n.x,h=r.y-n.y,f=Math.sqrt(l*l+h*h);return n.y+h/f*p}).attr("x2",t=>{const n=c.get(t.source),r=c.get(t.target),p=g.nodes.find(u=>u.id===t.target).isPipelineParent?m/Math.sqrt(2):o.nodeRadius,l=n.x-r.x,h=n.y-r.y,f=Math.sqrt(l*l+h*h);return r.x+l/f*p}).attr("y2",t=>{const n=c.get(t.source),r=c.get(t.target),p=g.nodes.find(u=>u.id===t.target).isPipelineParent?m/Math.sqrt(2):o.nodeRadius,l=n.x-r.x,h=n.y-r.y,f=Math.sqrt(l*l+h*h);return r.y+h/f*p}).attr("stroke",d.linkStroke).attr("stroke-width",1).attr("stroke-dasharray",t=>t.dashed?"6 6":null).attr("marker-end",t=>t.flow==="forward"||t.flow==="bidirectional"?`url(#link-arrow-end-${s})`:null).attr("marker-start",t=>t.flow==="backward"||t.flow==="bidirectional"?`url(#link-arrow-start-${s})`:null),V.selectAll("text").data(U.filter(t=>t.label)).enter().append("text").attr("class","wardley-link-label").attr("x",t=>{const n=c.get(t.source),r=c.get(t.target),i=(n.x+r.x)/2,p=r.y-n.y,l=r.x-n.x,h=Math.sqrt(l*l+p*p),f=8,u=p/h;return i+u*f}).attr("y",t=>{const n=c.get(t.source),r=c.get(t.target),i=(n.y+r.y)/2,p=r.x-n.x,l=r.y-n.y,h=Math.sqrt(p*p+l*l),f=8,u=-p/h;return i+u*f}).attr("fill",d.axisTextColor).attr("font-size",o.labelFontSize).attr("text-anchor","middle").attr("dominant-baseline","middle").attr("transform",t=>{const n=c.get(t.source),r=c.get(t.target),i=(n.x+r.x)/2,p=(n.y+r.y)/2,l=r.x-n.x,h=r.y-n.y,f=Math.sqrt(l*l+h*h),u=8,w=h/f,S=-l/f,z=i+w*u,W=p+S*u;let T=Math.atan2(h,l)*180/Math.PI;return(T>90||T<-90)&&(T+=180),`rotate(${T} ${z} ${W})`}).text(t=>t.label);const mt=v.append("g").attr("class","wardley-trends"),wt=g.trends.map(t=>{const n=c.get(t.nodeId);if(!n)return null;const r=L(t.targetX),i=X(t.targetY),p=r-n.x,l=i-n.y,h=Math.sqrt(p*p+l*l),f=o.nodeRadius+2,u=h>f?r-p/h*f:r,w=h>f?i-l/h*f:i;return{origin:n,targetX:r,targetY:i,adjustedX2:u,adjustedY2:w}}).filter(t=>t!==null);mt.selectAll("line").data(wt).enter().append("line").attr("class","wardley-trend").attr("x1",t=>t.origin.x).attr("y1",t=>t.origin.y).attr("x2",t=>t.adjustedX2).attr("y2",t=>t.adjustedY2).attr("stroke",d.evolutionStroke).attr("stroke-width",1).attr("stroke-dasharray","4 4").attr("marker-end",`url(#arrow-${s})`);const N=v.append("g").attr("class","wardley-nodes").selectAll("g").data(g.nodes).enter().append("g").attr("class",t=>["wardley-node",t.className?`wardley-node--${t.className}`:""].filter(Boolean).join(" "));N.filter(t=>t.sourceStrategy==="outsource").append("circle").attr("class","wardley-outsource-overlay").attr("cx",t=>c.get(t.id).x).attr("cy",t=>c.get(t.id).y).attr("r",o.nodeRadius*2).attr("fill","#666").attr("stroke",d.componentStroke).attr("stroke-width",1),N.filter(t=>t.sourceStrategy==="buy").append("circle").attr("class","wardley-buy-overlay").attr("cx",t=>c.get(t.id).x).attr("cy",t=>c.get(t.id).y).attr("r",o.nodeRadius*2).attr("fill","#ccc").attr("stroke",d.componentStroke).attr("stroke-width",1),N.filter(t=>t.sourceStrategy==="build").append("circle").attr("class","wardley-build-overlay").attr("cx",t=>c.get(t.id).x).attr("cy",t=>c.get(t.id).y).attr("r",o.nodeRadius*2).attr("fill","#eee").attr("stroke","#000").attr("stroke-width",1);const A=N.filter(t=>t.sourceStrategy==="market");A.append("circle").attr("class","wardley-market-overlay").attr("cx",t=>c.get(t.id).x).attr("cy",t=>c.get(t.id).y).attr("r",o.nodeRadius*2).attr("fill","white").attr("stroke",d.componentStroke).attr("stroke-width",1),N.filter(t=>!t.isPipelineParent&&t.sourceStrategy!=="market"&&t.className!=="anchor").append("circle").attr("cx",t=>c.get(t.id).x).attr("cy",t=>c.get(t.id).y).attr("r",o.nodeRadius).attr("fill",d.componentFill).attr("stroke",d.componentStroke).attr("stroke-width",1);const j=o.nodeRadius*.7,k=o.nodeRadius*1.2;if(A.append("line").attr("class","wardley-market-line").attr("x1",t=>c.get(t.id).x).attr("y1",t=>c.get(t.id).y-k).attr("x2",t=>c.get(t.id).x-k*Math.cos(Math.PI/6)).attr("y2",t=>c.get(t.id).y+k*Math.sin(Math.PI/6)).attr("stroke",d.componentStroke).attr("stroke-width",1),A.append("line").attr("class","wardley-market-line").attr("x1",t=>c.get(t.id).x-k*Math.cos(Math.PI/6)).attr("y1",t=>c.get(t.id).y+k*Math.sin(Math.PI/6)).attr("x2",t=>c.get(t.id).x+k*Math.cos(Math.PI/6)).attr("y2",t=>c.get(t.id).y+k*Math.sin(Math.PI/6)).attr("stroke",d.componentStroke).attr("stroke-width",1),A.append("line").attr("class","wardley-market-line").attr("x1",t=>c.get(t.id).x+k*Math.cos(Math.PI/6)).attr("y1",t=>c.get(t.id).y+k*Math.sin(Math.PI/6)).attr("x2",t=>c.get(t.id).x).attr("y2",t=>c.get(t.id).y-k).attr("stroke",d.componentStroke).attr("stroke-width",1),A.append("circle").attr("class","wardley-market-dot").attr("cx",t=>c.get(t.id).x).attr("cy",t=>c.get(t.id).y-k).attr("r",j).attr("fill","white").attr("stroke",d.componentStroke).attr("stroke-width",2),A.append("circle").attr("class","wardley-market-dot").attr("cx",t=>c.get(t.id).x-k*Math.cos(Math.PI/6)).attr("cy",t=>c.get(t.id).y+k*Math.sin(Math.PI/6)).attr("r",j).attr("fill","white").attr("stroke",d.componentStroke).attr("stroke-width",2),A.append("circle").attr("class","wardley-market-dot").attr("cx",t=>c.get(t.id).x+k*Math.cos(Math.PI/6)).attr("cy",t=>c.get(t.id).y+k*Math.sin(Math.PI/6)).attr("r",j).attr("fill","white").attr("stroke",d.componentStroke).attr("stroke-width",2),N.filter(t=>t.isPipelineParent===!0).append("rect").attr("x",t=>c.get(t.id).x-m/2).attr("y",t=>c.get(t.id).y-m/2).attr("width",m).attr("height",m).attr("fill",d.componentFill).attr("stroke",d.componentStroke).attr("stroke-width",1),N.filter(t=>t.inertia===!0).append("line").attr("class","wardley-inertia").attr("x1",t=>{const n=c.get(t.id);let r=t.isPipelineParent?m/2+15:o.nodeRadius+15;return t.sourceStrategy&&(r+=o.nodeRadius+10),n.x+r}).attr("y1",t=>{const n=c.get(t.id),r=t.isPipelineParent?m:o.nodeRadius*2;return n.y-r/2}).attr("x2",t=>{const n=c.get(t.id);let r=t.isPipelineParent?m/2+15:o.nodeRadius+15;return t.sourceStrategy&&(r+=o.nodeRadius+10),n.x+r}).attr("y2",t=>{const n=c.get(t.id),r=t.isPipelineParent?m:o.nodeRadius*2;return n.y+r/2}).attr("stroke",d.componentStroke).attr("stroke-width",6),N.append("text").attr("x",t=>{const n=c.get(t.id);if(t.className==="anchor")return t.labelOffsetX!==void 0?n.x+t.labelOffsetX:n.x;let r=o.nodeLabelOffset;t.sourceStrategy&&t.labelOffsetX===void 0&&(r+=10);const i=t.labelOffsetX??r;return n.x+i}).attr("y",t=>{const n=c.get(t.id);if(t.className==="anchor")return t.labelOffsetY!==void 0?n.y+t.labelOffsetY:n.y-3;let r=-o.nodeLabelOffset;t.sourceStrategy&&t.labelOffsetY===void 0&&(r-=10);const i=t.labelOffsetY??r;return n.y+i}).attr("class","wardley-node-label").attr("fill",t=>t.className==="evolved"?d.evolutionStroke:t.className==="anchor"?"#000":d.componentLabelColor).attr("font-size",o.labelFontSize).attr("font-weight",t=>t.className==="anchor"?"bold":"normal").attr("text-anchor",t=>t.className==="anchor"?"middle":"start").attr("dominant-baseline",t=>t.className==="anchor"?"middle":"auto").text(t=>t.label),g.annotations.length>0){const t=v.append("g").attr("class","wardley-annotations");if(g.annotations.forEach(n=>{const r=n.coordinates.map(i=>({x:L(i.x),y:X(i.y)}));if(r.length>1)for(let i=0;i<r.length-1;i++)t.append("line").attr("class","wardley-annotation-line").attr("x1",r[i].x).attr("y1",r[i].y).attr("x2",r[i+1].x).attr("y2",r[i+1].y).attr("stroke",d.axisColor).attr("stroke-width",1.5).attr("stroke-dasharray","4 4");r.forEach(i=>{const p=t.append("g").attr("class","wardley-annotation");p.append("circle").attr("cx",i.x).attr("cy",i.y).attr("r",10).attr("fill","white").attr("stroke",d.axisColor).attr("stroke-width",1.5),p.append("text").attr("x",i.x).attr("y",i.y).attr("text-anchor","middle").attr("dominant-baseline","central").attr("font-size",10).attr("fill",d.axisTextColor).attr("font-weight","bold").text(n.number)})}),g.annotationsBox){let n=L(g.annotationsBox.x),r=X(g.annotationsBox.y);const i=10,p=16,l=11,h=t.append("g").attr("class","wardley-annotations-box"),f=[...g.annotations].filter(w=>w.text).sort((w,S)=>w.number-S.number),u=[];if(f.forEach((w,S)=>{const z=h.append("text").attr("x",n+i).attr("y",r+i+(S+1)*p).attr("font-size",l).attr("fill",d.axisTextColor).attr("text-anchor","start").attr("dominant-baseline","middle").text(`${w.number}. ${w.text}`);u.push(z)}),u.length>0){let w=0,S=0;u.forEach(_=>{const D=_.node(),vt=D.getComputedTextLength();w=Math.max(w,vt);const St=D.getBBox();S=Math.max(S,St.height)});const z=w+i*2+105,W=f.length*p+i*2+S/2,T=o.padding,bt=C-o.padding-z,kt=o.padding,Pt=b-o.padding-W;n=Math.max(T,Math.min(n,bt)),r=Math.max(kt,Math.min(r,Pt)),u.forEach((_,D)=>{_.attr("x",n+i).attr("y",r+i+(D+1)*p)}),h.insert("rect","text").attr("x",n).attr("y",r).attr("width",z).attr("height",W).attr("fill","white").attr("stroke",d.axisColor).attr("stroke-width",1.5).attr("rx",4).attr("ry",4)}}}if(g.notes.length>0){const t=v.append("g").attr("class","wardley-notes");g.notes.forEach(n=>{const r=L(n.x),i=X(n.y);t.append("text").attr("x",r).attr("y",i).attr("text-anchor","start").attr("font-size",11).attr("fill",d.axisTextColor).attr("font-weight","bold").text(n.text)})}if(g.accelerators.length>0){const t=v.append("g").attr("class","wardley-accelerators");g.accelerators.forEach(n=>{const r=L(n.x),i=X(n.y),p=60,l=30,h=20,f=`
+        M ${r} ${i-l/2}
+        L ${r+p-h} ${i-l/2}
+        L ${r+p-h} ${i-l/2-8}
+        L ${r+p} ${i}
+        L ${r+p-h} ${i+l/2+8}
+        L ${r+p-h} ${i+l/2}
+        L ${r} ${i+l/2}
+        Z
+      `;t.append("path").attr("d",f).attr("fill","white").attr("stroke",d.componentStroke).attr("stroke-width",1),t.append("text").attr("x",r+p/2).attr("y",i+l/2+15).attr("text-anchor","middle").attr("font-size",10).attr("fill",d.axisTextColor).attr("font-weight","bold").text(n.name)})}if(g.deaccelerators.length>0){const t=v.append("g").attr("class","wardley-deaccelerators");g.deaccelerators.forEach(n=>{const r=L(n.x),i=X(n.y),p=60,l=30,h=20,f=`
+        M ${r+p} ${i-l/2}
+        L ${r+h} ${i-l/2}
+        L ${r+h} ${i-l/2-8}
+        L ${r} ${i}
+        L ${r+h} ${i+l/2+8}
+        L ${r+h} ${i+l/2}
+        L ${r+p} ${i+l/2}
+        Z
+      `;t.append("path").attr("d",f).attr("fill","white").attr("stroke",d.componentStroke).attr("stroke-width",1),t.append("text").attr("x",r+p/2).attr("y",i+l/2+15).attr("text-anchor","middle").attr("font-size",10).attr("fill",d.axisTextColor).attr("font-weight","bold").text(n.name)})}},"draw"),Ht={draw:qt},Jt={parser:Q,db:Ot,renderer:Ht,styles:y(()=>"","styles")};export{Jt as diagram};
+//# sourceMappingURL=wardleyDiagram-NUSXRM2D-BnIpr1Bt.js.map