jbrowse-plugin-graphgenomeviewer 8.7.0 → 8.7.2

package/dist/chunks/{chunk-OPWSPSAE.js.map → chunk-46O3IEW3.js.map}

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-CPMHA4W5.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-JJV2GT2Z.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HMXCN6PG.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-S43IBA5Y.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HNNP5QUN.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-H4UHV22B.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-ALGYCMMH.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-OPTHW6IZ.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-ZULVAGVE.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-XWH4LB56.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.5.1/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-DAEEMZ74.js"],
-  "sourcesContent": ["// src/layout/rowSpacing.ts\nvar ROW_HEIGHT_PX = 20;\n\nexport {\n  ROW_HEIGHT_PX\n};\n", "import {\n  ROW_HEIGHT_PX\n} from \"./chunk-CPMHA4W5.js\";\n\n// src/util/geometry.ts\nfunction svgPath(points) {\n  const round = (v) => Math.round(v * 100) / 100;\n  return points.map((p, i) => `${i ? \"L\" : \"M\"}${round(p.x)},${round(p.y)}`).join(\"\");\n}\nfunction projectLine(x1, y1, x2, y2, distance) {\n  const d = Math.hypot(y2 - y1, x2 - x1);\n  if (d === 0) {\n    return [x2, y2];\n  }\n  const vx = (x2 - x1) / d;\n  const vy = (y2 - y1) / d;\n  return [x2 + distance * vx, y2 + distance * vy];\n}\nfunction curvePointAt(c, t) {\n  const u = 1 - t;\n  const a = u * u * u;\n  const b = 3 * u * u * t;\n  const d = 3 * u * t * t;\n  const e = t * t * t;\n  return {\n    x: a * c.x0 + b * c.cx0 + d * c.cx1 + e * c.x1,\n    y: a * c.y0 + b * c.cy0 + d * c.cy1 + e * c.y1\n  };\n}\nfunction curveMidpoint(curves) {\n  const mid = curves[Math.floor(curves.length / 2)];\n  return mid ? curvePointAt(mid, 0.5) : void 0;\n}\nfunction curveBounds(curves) {\n  let minX = Infinity;\n  let minY = Infinity;\n  let maxX = -Infinity;\n  let maxY = -Infinity;\n  for (const c of curves) {\n    minX = Math.min(minX, c.x0, c.cx0, c.cx1, c.x1);\n    maxX = Math.max(maxX, c.x0, c.cx0, c.cx1, c.x1);\n    minY = Math.min(minY, c.y0, c.cy0, c.cy1, c.y1);\n    maxY = Math.max(maxY, c.y0, c.cy0, c.cy1, c.y1);\n  }\n  return { minX, minY, maxX, maxY };\n}\nfunction subCurve(c, t0, t1) {\n  const p0 = curvePointAt(c, t0);\n  const p1 = curvePointAt(c, t1);\n  const dt = (t1 - t0) / 3;\n  const d0 = curveTangentAt(c, t0);\n  const d1 = curveTangentAt(c, t1);\n  return {\n    x0: p0.x,\n    y0: p0.y,\n    cx0: p0.x + d0.x * dt,\n    cy0: p0.y + d0.y * dt,\n    cx1: p1.x - d1.x * dt,\n    cy1: p1.y - d1.y * dt,\n    x1: p1.x,\n    y1: p1.y\n  };\n}\nfunction curveTangentAt(c, t) {\n  const u = 1 - t;\n  const a = 3 * u * u;\n  const b = 6 * u * t;\n  const d = 3 * t * t;\n  return {\n    x: a * (c.cx0 - c.x0) + b * (c.cx1 - c.cx0) + d * (c.x1 - c.cx1),\n    y: a * (c.cy0 - c.y0) + b * (c.cy1 - c.cy0) + d * (c.y1 - c.cy1)\n  };\n}\nvar VISIBLE_SAMPLES = 32;\nfunction visibleStretches(curves, lengths, bounds, yToX) {\n  const stretches = [];\n  let start = 0;\n  curves.forEach((c, k) => {\n    const length = lengths[k];\n    const pad = length / VISIBLE_SAMPLES;\n    let last = curvePointAt(c, 0);\n    for (let i = 1; i <= VISIBLE_SAMPLES; i++) {\n      const next = curvePointAt(c, i / VISIBLE_SAMPLES);\n      if (Math.max(last.x, next.x) + pad >= bounds.minX && Math.min(last.x, next.x) - pad <= bounds.maxX && Math.max(last.y, next.y) + pad / yToX >= bounds.minY && Math.min(last.y, next.y) - pad / yToX <= bounds.maxY) {\n        const from = start + length * (i - 1) / VISIBLE_SAMPLES;\n        const to = start + length * i / VISIBLE_SAMPLES;\n        const prev = stretches.at(-1);\n        if (prev && prev[1] >= from) {\n          prev[1] = to;\n        } else {\n          stretches.push([from, to]);\n        }\n      }\n      last = next;\n    }\n    start += length;\n  });\n  return stretches;\n}\nvar dashCurves = (curves, dashWorld, yToX = 1, bounds) => dashSpans(curves, dashWorld, yToX, bounds).map((d) => d.curves);\nfunction dashSpans(curves, dashWorld, yToX = 1, bounds) {\n  const lengths = curves.map(\n    (c) => Math.hypot(c.cx0 - c.x0, (c.cy0 - c.y0) * yToX) + Math.hypot(c.cx1 - c.cx0, (c.cy1 - c.cy0) * yToX) + Math.hypot(c.x1 - c.cx1, (c.y1 - c.cy1) * yToX)\n  );\n  const total = lengths.reduce((a, b) => a + b, 0);\n  const periods = Math.round(total / dashWorld);\n  const spans = Math.max(3, periods % 2 ? periods : periods + 1);\n  const stretches = bounds ? visibleStretches(curves, lengths, bounds, yToX) : void 0;\n  let seen = 0;\n  const out = [];\n  for (let i = 0; i < spans; i += 2) {\n    const from = i / spans * total;\n    const to = (i + 1) / spans * total;\n    if (stretches) {\n      while (seen < stretches.length && stretches[seen][1] < from) {\n        seen++;\n      }\n      if (seen === stretches.length) {\n        break;\n      }\n      if (stretches[seen][0] > to) {\n        continue;\n      }\n    }\n    const dash = [];\n    const along = [];\n    let start = 0;\n    curves.forEach((c, k) => {\n      const length = lengths[k];\n      const end = start + length;\n      if (length > 0 && end > from && start < to) {\n        const t0 = Math.max(0, (from - start) / length);\n        const t1 = Math.min(1, (to - start) / length);\n        dash.push(subCurve(c, t0, t1));\n        along.push((k + t0) / curves.length, (k + t1) / curves.length);\n      }\n      start = end;\n    });\n    if (dash.length) {\n      out.push({\n        curves: dash,\n        startAlong: along[0],\n        endAlong: along.at(-1)\n      });\n    }\n  }\n  return out;\n}\nvar slideAt = (from, to, along) => ({\n  dx: from.dx + (to.dx - from.dx) * along,\n  dy: from.dy + (to.dy - from.dy) * along\n});\nfunction slideCurves(curves, fromDx, fromDy, toDx, toDy) {\n  const n = curves.length;\n  const out = new Array(n);\n  for (let i = 0; i < n; i++) {\n    const c = curves[i];\n    const a = i / n;\n    const b = (i + 1) / n;\n    const adx = fromDx + (toDx - fromDx) * a;\n    const ady = fromDy + (toDy - fromDy) * a;\n    const bdx = fromDx + (toDx - fromDx) * b;\n    const bdy = fromDy + (toDy - fromDy) * b;\n    out[i] = {\n      x0: c.x0 + adx,\n      y0: c.y0 + ady,\n      cx0: c.cx0 + adx,\n      cy0: c.cy0 + ady,\n      cx1: c.cx1 + bdx,\n      cy1: c.cy1 + bdy,\n      x1: c.x1 + bdx,\n      y1: c.y1 + bdy\n    };\n  }\n  return out;\n}\nfunction translateCurves(curves, dx, dy) {\n  const out = new Array(curves.length);\n  for (let i = 0; i < curves.length; i++) {\n    const c = curves[i];\n    out[i] = {\n      x0: c.x0 + dx,\n      y0: c.y0 + dy,\n      cx0: c.cx0 + dx,\n      cy0: c.cy0 + dy,\n      cx1: c.cx1 + dx,\n      cy1: c.cy1 + dy,\n      x1: c.x1 + dx,\n      y1: c.y1 + dy\n    };\n  }\n  return out;\n}\nfunction attachment(segments, side) {\n  const last = segments.length - 1;\n  return side === \"end\" ? { at: segments[last], inward: segments[last - 1] } : { at: segments[0], inward: segments[1] };\n}\nvar TANGENT_SPAN_FACTOR = 0.5;\nvar MAX_TANGENT = 80;\nfunction ownStrand(id) {\n  return id.endsWith(\"-\") ? \"-\" : \"+\";\n}\nfunction strandSides(edge) {\n  const own = (id, strand) => (strand ?? ownStrand(id)) === ownStrand(id);\n  return {\n    from: own(edge.from, edge.fromStrand) ? \"end\" : \"start\",\n    to: own(edge.to, edge.toStrand) ? \"start\" : \"end\"\n  };\n}\nfunction spanOf(segments) {\n  let min = Infinity;\n  let max = -Infinity;\n  for (const s of segments) {\n    min = Math.min(min, s.x);\n    max = Math.max(max, s.x);\n  }\n  return { min, max };\n}\nfunction distanceToSpan(x, span) {\n  return Math.max(0, span.min - x, x - span.max);\n}\nfunction facingSide(segments, other, tieBreak) {\n  const startGap = distanceToSpan(segments[0].x, other);\n  const endGap = distanceToSpan(segments[segments.length - 1].x, other);\n  return startGap === endGap ? tieBreak : startGap < endGap ? \"start\" : \"end\";\n}\nfunction facingSides(fromSegments, toSegments) {\n  return {\n    from: facingSide(fromSegments, spanOf(toSegments), \"end\"),\n    to: facingSide(toSegments, spanOf(fromSegments), \"start\")\n  };\n}\nvar laidSides = /* @__PURE__ */ new WeakMap();\nfunction heldFacingSides(fromSegments, toSegments) {\n  let byTo = laidSides.get(fromSegments);\n  if (!byTo) {\n    byTo = /* @__PURE__ */ new WeakMap();\n    laidSides.set(fromSegments, byTo);\n  }\n  let sides = byTo.get(toSegments);\n  if (!sides) {\n    sides = facingSides(fromSegments, toSegments);\n    byTo.set(toSegments, sides);\n  }\n  return sides;\n}\nvar APEX_FRACTION = 0.75;\nvar BOW_CLEARANCE = 1.15;\nvar ALONG_FRACTION = 0.35;\nvar MAX_ROW_BOW_PX = 3 * ROW_HEIGHT_PX;\nfunction bowAround(p1x, p1y, p2x, p2y, toward, maxBow) {\n  const chord = Math.hypot(p2x - p1x, p2y - p1y);\n  const ux = chord === 0 ? 1 : (p2x - p1x) / chord;\n  const uy = chord === 0 ? 0 : (p2y - p1y) / chord;\n  let reach = 0;\n  let minAlong = Infinity;\n  let maxAlong = -Infinity;\n  for (const p of toward) {\n    const dx = p.x - p1x;\n    const dy = p.y - p1y;\n    const perp = dx * -uy + dy * ux;\n    if (Math.abs(perp) > Math.abs(reach)) {\n      reach = perp;\n    }\n    const along = dx * ux + dy * uy;\n    minAlong = Math.min(minAlong, along);\n    maxAlong = Math.max(maxAlong, along);\n  }\n  const span = toward.length ? maxAlong - minAlong : 0;\n  const uncapped = Math.max(\n    Math.abs(reach) * BOW_CLEARANCE / APEX_FRACTION,\n    span * ALONG_FRACTION\n  );\n  const size = maxBow === void 0 ? uncapped : Math.min(uncapped, maxBow);\n  return reach < 0 ? -size : size;\n}\nfunction yToXOf({ scaleX, scaleY }) {\n  return scaleY / scaleX;\n}\nvar PATH_RIBBON_SPACING_PX = 3;\nfunction drawnDirection(a, b, yToX) {\n  const dx = b.x - a.x;\n  const dy = (b.y - a.y) * yToX;\n  const len = Math.hypot(dx, dy);\n  return len === 0 ? void 0 : { x: dx / len, y: dy / len };\n}\nfunction pathRibbonOffsets(fromSegments, toSegments, count, axis) {\n  const yToX = yToXOf(axis);\n  const spacing = PATH_RIBBON_SPACING_PX / Math.max(axis.scaleX, 1e-6);\n  const dir = drawnDirection(\n    fromSegments[fromSegments.length - 1],\n    toSegments[0],\n    yToX\n  ) ?? drawnDirection(fromSegments[0], fromSegments.at(-1), yToX) ?? drawnDirection(toSegments[0], toSegments.at(-1), yToX) ?? { x: 1, y: 0 };\n  const offsets = [];\n  for (let i = 0; i < count; i++) {\n    const distance = (i - (count - 1) / 2) * spacing;\n    offsets.push({ x: -dir.y * distance, y: dir.x * distance / yToX });\n  }\n  return offsets;\n}\nfunction scaleYOf(points, yToX) {\n  return points.map((p) => ({ x: p.x, y: p.y * yToX }));\n}\nfunction unscaleYOf(curves, yToX) {\n  for (const c of curves) {\n    c.y0 /= yToX;\n    c.cy0 /= yToX;\n    c.cy1 /= yToX;\n    c.y1 /= yToX;\n  }\n  return curves;\n}\nfunction polylinePx(points, scaleX, scaleY) {\n  let total = 0;\n  for (let i = 1; i < points.length; i++) {\n    const a = points[i - 1];\n    const b = points[i];\n    total += Math.hypot((b.x - a.x) * scaleX, (b.y - a.y) * scaleY);\n  }\n  return total;\n}\nvar SELF_LOOP_MIN_PX = 12;\nvar SELF_LOOP_MAX_PX = 40;\nfunction selfLoopReach(segments, scale) {\n  const nodePx = polylinePx(segments, scale, scale);\n  const reachPx = Math.min(\n    SELF_LOOP_MAX_PX,\n    Math.max(SELF_LOOP_MIN_PX, nodePx / 2)\n  );\n  return reachPx / Math.max(scale, Number.EPSILON);\n}\nfunction selfLinkOf(edge) {\n  if (edge.from !== edge.to) {\n    return false;\n  }\n  return edge.fromStrand && edge.toStrand && edge.fromStrand !== edge.toStrand ? edge.fromStrand === \"+\" ? \"end\" : \"start\" : true;\n}\nfunction edgeJoinOf(edge, stranded = false) {\n  const self = selfLinkOf(edge);\n  if (!stranded) {\n    return self;\n  }\n  const sides = strandSides(edge);\n  return self === false ? sides : sides.from === sides.to ? sides.from : true;\n}\nfunction hairpinCurves(attach, reach) {\n  const { at, inward } = attach;\n  const dx = inward ? at.x - inward.x : 1;\n  const dy = inward ? at.y - inward.y : 0;\n  const len = Math.hypot(dx, dy) || 1;\n  const ux = dx / len;\n  const uy = dy / len;\n  const px = at.x;\n  const py = at.y;\n  const nearX = px + ux * reach / 3;\n  const nearY = py + uy * reach / 3;\n  const apexX = px + ux * reach;\n  const apexY = py + uy * reach;\n  const sideX = -uy * reach / 2;\n  const sideY = ux * reach / 2;\n  return [\n    {\n      x0: px,\n      y0: py,\n      cx0: nearX,\n      cy0: nearY,\n      cx1: apexX + sideX,\n      cy1: apexY + sideY,\n      x1: apexX,\n      y1: apexY\n    },\n    {\n      x0: apexX,\n      y0: apexY,\n      cx0: apexX - sideX,\n      cy0: apexY - sideY,\n      cx1: nearX,\n      cy1: nearY,\n      x1: px,\n      y1: py\n    }\n  ];\n}\nfunction computeEdgeCurves(fromSegments, toSegments, join, axis, bypassed = [], maxBowIn) {\n  const scale = axis.scaleX;\n  const yToX = yToXOf(axis);\n  const maxBow = maxBowIn ?? (axis.pixelRows ? MAX_ROW_BOW_PX : void 0);\n  if (join === false) {\n    join = heldFacingSides(fromSegments, toSegments);\n  }\n  if (yToX !== 1) {\n    return unscaleYOf(\n      computeEdgeCurves(\n        scaleYOf(fromSegments, yToX),\n        scaleYOf(toSegments, yToX),\n        join,\n        { scaleX: scale, scaleY: scale },\n        scaleYOf(bypassed, yToX),\n        // the cap is a y measure and the body works in x units, so it converts\n        // with everything else that crosses this boundary\n        maxBow === void 0 ? void 0 : maxBow * yToX\n      ),\n      yToX\n    );\n  }\n  if (typeof join === \"string\") {\n    return hairpinCurves(\n      attachment(fromSegments, join),\n      selfLoopReach(fromSegments, scale)\n    );\n  }\n  const loop = join === true;\n  const sides = join === true ? { from: \"end\", to: \"start\" } : join;\n  const fromAttach = attachment(fromSegments, sides.from);\n  const toAttach = attachment(toSegments, sides.to);\n  const fromEnd = fromAttach.at;\n  const toStart = toAttach.at;\n  const p1x = fromEnd.x;\n  const p1y = fromEnd.y;\n  const p2x = toStart.x;\n  const p2y = toStart.y;\n  if (loop) {\n    let segDirX = 1;\n    let segDirY = 0;\n    if (fromAttach.inward) {\n      const dx = fromEnd.x - fromAttach.inward.x;\n      const dy = fromEnd.y - fromAttach.inward.y;\n      const len = Math.hypot(dx, dy);\n      if (len > 0) {\n        segDirX = dx / len;\n        segDirY = dy / len;\n      }\n    }\n    const ext = selfLoopReach(fromSegments, scale);\n    const perpX = -segDirY;\n    const perpY = segDirX;\n    const midX = (fromEnd.x + toStart.x) / 2 + perpX * ext;\n    const midY = (fromEnd.y + toStart.y) / 2 + perpY * ext;\n    const cp1x = p1x + segDirX * ext;\n    const cp1y = p1y + segDirY * ext;\n    const cp2x = p2x - segDirX * ext;\n    const cp2y = p2y - segDirY * ext;\n    return [\n      {\n        x0: p1x,\n        y0: p1y,\n        cx0: cp1x,\n        cy0: cp1y,\n        cx1: cp1x + perpX * ext,\n        cy1: cp1y + perpY * ext,\n        x1: midX,\n        y1: midY\n      },\n      {\n        x0: midX,\n        y0: midY,\n        cx0: cp2x + perpX * ext,\n        cy0: cp2y + perpY * ext,\n        cx1: cp2x,\n        cy1: cp2y,\n        x1: p2x,\n        y1: p2y\n      }\n    ];\n  } else {\n    const fromPrev = fromAttach.inward ?? {\n      x: fromEnd.x - (toStart.x - fromEnd.x),\n      y: fromEnd.y - (toStart.y - fromEnd.y)\n    };\n    const toNext = toAttach.inward ?? {\n      x: toStart.x - (fromEnd.x - toStart.x),\n      y: toStart.y - (fromEnd.y - toStart.y)\n    };\n    const dist = Math.hypot(p2x - p1x, p2y - p1y);\n    const tangentProj = (prev, at, towardX, towardY) => {\n      const dx = at.x - prev.x;\n      const dy = at.y - prev.y;\n      const len = Math.hypot(dx, dy);\n      const along = len === 0 ? 0 : (towardX * dx + towardY * dy) / len;\n      return Math.max(\n        0,\n        Math.min(dist * TANGENT_SPAN_FACTOR, MAX_TANGENT, along * 0.5)\n      );\n    };\n    const towardToX = toStart.x - fromEnd.x;\n    const towardToY = toStart.y - fromEnd.y;\n    const [cx1, cy1] = projectLine(\n      fromPrev.x,\n      fromPrev.y,\n      fromEnd.x,\n      fromEnd.y,\n      tangentProj(fromPrev, fromEnd, towardToX, towardToY)\n    );\n    const [cx2, cy2] = projectLine(\n      toNext.x,\n      toNext.y,\n      toStart.x,\n      toStart.y,\n      tangentProj(toNext, toStart, -towardToX, -towardToY)\n    );\n    const bulge = bypassed.length ? bowAround(p1x, p1y, p2x, p2y, bypassed, maxBow) : 0;\n    const chordLen = dist === 0 ? 1 : dist;\n    const ux = (p2x - p1x) / chordLen;\n    const uy = (p2y - p1y) / chordLen;\n    const bulgeX = -uy * bulge;\n    const bulgeY = ux * bulge;\n    const spreadX = ux * Math.abs(bulge);\n    const spreadY = uy * Math.abs(bulge);\n    return [\n      {\n        x0: p1x,\n        y0: p1y,\n        cx0: cx1 + bulgeX - spreadX,\n        cy0: cy1 + bulgeY - spreadY,\n        cx1: cx2 + bulgeX + spreadX,\n        cy1: cy2 + bulgeY + spreadY,\n        x1: p2x,\n        y1: p2y\n      }\n    ];\n  }\n}\nfunction nearerEnd(segments, to) {\n  const start = segments[0];\n  const end = segments.at(-1);\n  return Math.hypot(start.x - to.x, start.y - to.y) < Math.hypot(end.x - to.x, end.y - to.y) ? \"start\" : \"end\";\n}\nfunction routedEdgeCurves(fromSegments, toSegments, route, sides) {\n  const fromAttach = attachment(\n    fromSegments,\n    sides?.from ?? nearerEnd(fromSegments, route[0])\n  );\n  const toAttach = attachment(\n    toSegments,\n    sides?.to ?? nearerEnd(toSegments, route.at(-1))\n  );\n  const points = [fromAttach.at, ...route, toAttach.at];\n  const tangent = (i) => {\n    const p = points[i];\n    const span = (q) => Math.hypot(q.x - p.x, q.y - p.y);\n    const along = (inward, next) => {\n      const len = inward ? span(inward) : 0;\n      const reach = span(next);\n      return len === 0 ? { x: next.x - p.x, y: next.y - p.y } : {\n        x: (p.x - inward.x) / len * reach,\n        y: (p.y - inward.y) / len * reach\n      };\n    };\n    if (i === 0) {\n      return along(fromAttach.inward, points[1]);\n    }\n    if (i === points.length - 1) {\n      const out = along(toAttach.inward, points[i - 1]);\n      return { x: -out.x, y: -out.y };\n    }\n    return {\n      x: (points[i + 1].x - points[i - 1].x) / 2,\n      y: (points[i + 1].y - points[i - 1].y) / 2\n    };\n  };\n  const curves = [];\n  for (let i = 0; i < points.length - 1; i++) {\n    const a = points[i];\n    const b = points[i + 1];\n    const ta = tangent(i);\n    const tb = tangent(i + 1);\n    curves.push({\n      x0: a.x,\n      y0: a.y,\n      cx0: a.x + ta.x / 3,\n      cy0: a.y + ta.y / 3,\n      cx1: b.x - tb.x / 3,\n      cy1: b.y - tb.y / 3,\n      x1: b.x,\n      y1: b.y\n    });\n  }\n  return curves;\n}\n\nexport {\n  svgPath,\n  projectLine,\n  curvePointAt,\n  curveMidpoint,\n  curveBounds,\n  dashCurves,\n  dashSpans,\n  slideAt,\n  slideCurves,\n  translateCurves,\n  ownStrand,\n  strandSides,\n  bowAround,\n  yToXOf,\n  PATH_RIBBON_SPACING_PX,\n  pathRibbonOffsets,\n  polylinePx,\n  selfLinkOf,\n  edgeJoinOf,\n  computeEdgeCurves,\n  routedEdgeCurves\n};\n", "// src/util/weakMemo.ts\nfunction weakMemo() {\n  const cache = /* @__PURE__ */ new WeakMap();\n  return (key, deps, compute) => {\n    const hit = cache.get(key);\n    if (hit?.deps.length === deps.length && hit.deps.every((d, i) => Object.is(d, deps[i]))) {\n      return hit.value;\n    }\n    const value = compute();\n    cache.set(key, { deps, value });\n    return value;\n  };\n}\n\nexport {\n  weakMemo\n};\n", "// src/overlayLabels.ts\nvar LABEL_PX = 11;\nvar LABEL_CHAR_PX = 6.2;\nvar LABEL_PAD = 4;\nfunction labelWidth(text) {\n  return text.length * LABEL_CHAR_PX + LABEL_PAD * 2;\n}\nfunction overlaps(a, b) {\n  return a.x0 < b.x1 && a.x1 > b.x0 && a.y0 < b.y1 && a.y1 > b.y0;\n}\nfunction offFrame(box, frame) {\n  return box.x1 <= 0 || box.x0 >= frame.width || box.y1 <= 0 || box.y0 >= frame.height;\n}\nfunction insideFrame(box, frame) {\n  return box.x0 >= 0 && box.x1 <= frame.width && box.y0 >= 0 && box.y1 <= frame.height;\n}\nfunction occupancy(frame, reserved = []) {\n  const placed = [...reserved];\n  return (box) => {\n    if (offFrame(box, frame) || placed.some((p) => overlaps(p, box))) {\n      return false;\n    }\n    placed.push(box);\n    return true;\n  };\n}\nfunction placeLabels(candidates, frame, take) {\n  const out = [];\n  const row = LABEL_PX + LABEL_PAD * 2;\n  const stackFrom = (c, text, from, direction) => {\n    const w = labelWidth(text);\n    let crowded = false;\n    for (let tries = 0; tries <= (c.stack ?? 0); tries++) {\n      const y = from + direction * tries * row;\n      const box = {\n        x0: c.x - w / 2,\n        x1: c.x + w / 2,\n        y0: y - LABEL_PX - LABEL_PAD,\n        y1: y + LABEL_PAD\n      };\n      if (offFrame(box, frame)) {\n        break;\n      }\n      if (insideFrame(box, frame) && (c.fits?.(box) ?? true)) {\n        if (take(box)) {\n          return { placed: { ...c, text, y, w }, crowded };\n        }\n        crowded = true;\n      }\n    }\n    return { placed: void 0, crowded };\n  };\n  const place = (c, text) => {\n    const first = stackFrom(c, text, c.y, c.y > frame.height / 2 ? -1 : 1);\n    return first.placed ?? (c.flipY === void 0 || first.crowded ? void 0 : stackFrom(c, text, c.flipY, c.flipY < c.y ? -1 : 1).placed);\n  };\n  for (const c of candidates) {\n    const placed = place(c, c.text) ?? (c.fallback === void 0 ? void 0 : place(c, c.fallback));\n    if (placed) {\n      out.push(placed);\n    }\n  }\n  return out;\n}\n\nexport {\n  LABEL_PX,\n  LABEL_CHAR_PX,\n  LABEL_PAD,\n  labelWidth,\n  overlaps,\n  occupancy,\n  placeLabels\n};\n", "import {\n  ownStrand,\n  strandSides\n} from \"./chunk-JJV2GT2Z.js\";\nimport {\n  pushTo\n} from \"./chunk-BSOZW3FC.js\";\nimport {\n  isBackbone\n} from \"./chunk-RJWPJCIB.js\";\n\n// src/layout/mergeRuns.ts\nfunction flip(strand) {\n  return strand === \"+\" ? \"-\" : \"+\";\n}\nfunction mergeRuns(graph, alone = /* @__PURE__ */ new Set()) {\n  const sides = graph.edges.map(strandSides);\n  const at = /* @__PURE__ */ new Map();\n  const attach = (id, side, ei) => {\n    pushTo(at, `${id}|${side}`, ei);\n  };\n  graph.edges.forEach((edge, ei) => {\n    attach(edge.from, sides[ei].from, ei);\n    attach(edge.to, sides[ei].to, ei);\n  });\n  const joinAfter = (a) => {\n    const out = at.get(`${a}|end`);\n    if (out?.length !== 1) {\n      return void 0;\n    }\n    const ei = out[0];\n    const edge = graph.edges[ei];\n    return edge.from === a && edge.to !== a && !alone.has(a) && !alone.has(edge.to) && sides[ei].from === \"end\" && sides[ei].to === \"start\" && at.get(`${edge.to}|start`)?.length === 1 ? ei : void 0;\n  };\n  const joined = /* @__PURE__ */ new Set();\n  const runOf = /* @__PURE__ */ new Map();\n  const runs = /* @__PURE__ */ new Map();\n  for (const node of graph.nodes) {\n    const into = at.get(`${node.id}|start`);\n    const pred = into?.length === 1 ? graph.edges[into[0]].from : void 0;\n    if (runOf.has(node.id) || pred !== void 0 && joinAfter(pred) === into[0]) {\n      continue;\n    }\n    const run = [node.id];\n    for (; ; ) {\n      const ei = joinAfter(run.at(-1));\n      const next = ei === void 0 ? void 0 : graph.edges[ei].to;\n      if (next === void 0 || runOf.has(next)) {\n        break;\n      }\n      joined.add(ei);\n      run.push(next);\n    }\n    for (const id of run) {\n      runOf.set(id, node.id);\n    }\n    if (run.length > 1) {\n      runs.set(node.id, run);\n    }\n  }\n  for (const node of graph.nodes) {\n    if (!runOf.has(node.id)) {\n      runOf.set(node.id, node.id);\n    }\n  }\n  const byId = new Map(graph.nodes.map((n) => [n.id, n]));\n  const nodes = [];\n  for (const node of graph.nodes) {\n    if (runOf.get(node.id) !== node.id) {\n      continue;\n    }\n    const run = runs.get(node.id);\n    if (!run) {\n      nodes.push(node);\n      continue;\n    }\n    const members = run.map((id) => byId.get(id));\n    const backbone = members.filter(isBackbone);\n    const first = backbone.length ? backbone.reduce((a, b) => a.stable.start <= b.stable.start ? a : b) : members[0];\n    nodes.push({\n      id: node.id,\n      name: node.name,\n      length: members.reduce((sum, n) => sum + n.length, 0),\n      depth: node.depth,\n      stable: first.stable\n    });\n  }\n  const seen = /* @__PURE__ */ new Set();\n  const edges = [];\n  graph.edges.forEach((edge, ei) => {\n    const from = runOf.get(edge.from);\n    const to = runOf.get(edge.to);\n    const side = sides[ei];\n    const key = `${from}|${side.from}>${to}|${side.to}`;\n    if (joined.has(ei) || seen.has(key)) {\n      return;\n    }\n    seen.add(key);\n    edges.push({\n      from,\n      to,\n      ...side.from === \"start\" ? { fromStrand: flip(ownStrand(from)) } : {},\n      ...side.to === \"end\" ? { toStrand: flip(ownStrand(to)) } : {}\n    });\n  });\n  return {\n    graph: { ...graph, nodes, edges, paths: void 0, pathVisits: void 0 },\n    runs\n  };\n}\nfunction splitRuns(positions, runs, weightOf) {\n  const out = { ...positions };\n  for (const [id, members] of runs) {\n    const line = positions[id];\n    if (!line?.length) {\n      continue;\n    }\n    delete out[id];\n    const arc = arcPrefix(line);\n    const total = arc.at(-1);\n    const weights = members.map((m) => Math.max(weightOf(m), 0));\n    const weightSum = weights.reduce((a, b) => a + b, 0);\n    let from = 0;\n    members.forEach((member, k) => {\n      const share = weightSum ? weights[k] / weightSum * total : total / members.length;\n      const to = k === members.length - 1 ? total : from + share;\n      out[member] = slice(line, arc, from, to);\n      from = to;\n    });\n  }\n  return out;\n}\nfunction polylineSlice(line, from, to) {\n  if (line.length === 0) {\n    return [];\n  }\n  const arc = arcPrefix(line);\n  const total = arc.at(-1);\n  return slice(line, arc, from * total, to * total);\n}\nfunction polylineMidpoint(line) {\n  const arc = arcPrefix(line);\n  return pointAt(line, arc, arc.at(-1) / 2);\n}\nfunction arcPrefix(line) {\n  const arc = [0];\n  for (let i = 1; i < line.length; i++) {\n    arc.push(\n      arc[i - 1] + Math.hypot(line[i].x - line[i - 1].x, line[i].y - line[i - 1].y)\n    );\n  }\n  return arc;\n}\nfunction firstReaching(arc, s) {\n  let lo = 0;\n  let hi = arc.length;\n  while (lo < hi) {\n    const mid = lo + hi >> 1;\n    if (arc[mid] < s) {\n      lo = mid + 1;\n    } else {\n      hi = mid;\n    }\n  }\n  return lo;\n}\nfunction pointAt(line, arc, s) {\n  if (s <= 0) {\n    return { ...line[0] };\n  }\n  const i = firstReaching(arc, s);\n  if (i >= arc.length) {\n    return { ...line.at(-1) };\n  }\n  const span = arc[i] - arc[i - 1];\n  const t = span > 0 ? (s - arc[i - 1]) / span : 0;\n  const a = line[i - 1];\n  const b = line[i];\n  return { x: a.x + (b.x - a.x) * t, y: a.y + (b.y - a.y) * t };\n}\nfunction slice(line, arc, from, to) {\n  const points = [pointAt(line, arc, from)];\n  for (let i = firstReaching(arc, from); i < line.length && arc[i] < to; i++) {\n    if (arc[i] > from) {\n      points.push({ ...line[i] });\n    }\n  }\n  points.push(pointAt(line, arc, to));\n  return points;\n}\n\nexport {\n  mergeRuns,\n  splitRuns,\n  polylineSlice,\n  polylineMidpoint\n};\n", "import {\n  pathOrigin,\n  trimOrigins\n} from \"./chunk-BRH73RCH.js\";\nimport {\n  PathVisitsBuilder\n} from \"./chunk-BEUTROKU.js\";\nimport {\n  isBackbone,\n  overlapsWindow\n} from \"./chunk-RJWPJCIB.js\";\n\n// src/layout/trimToWindow.ts\nfunction trimToWindow(graph, window) {\n  const inWindow = new Set(\n    graph.nodes.filter((n) => isBackbone(n) && overlapsWindow(n, window)).map((n) => n.id)\n  );\n  const paths = graph.paths ?? [];\n  if (inWindow.size === 0 || paths.length === 0) {\n    return graph;\n  }\n  const spans = paths.map((path) => {\n    let first = -1;\n    let last = -1;\n    path.nodeIds.forEach((id, i) => {\n      if (inWindow.has(id)) {\n        if (first < 0) {\n          first = i;\n        }\n        last = i;\n      }\n    });\n    return first < 0 ? void 0 : { first, last };\n  });\n  if (spans.every(\n    (span, i) => span?.first === 0 && span.last === paths[i].nodeIds.length - 1\n  )) {\n    return graph;\n  }\n  const kept = /* @__PURE__ */ new Set();\n  const trimmed = [];\n  const stretches = /* @__PURE__ */ new Map();\n  paths.forEach((path, i) => {\n    const span = spans[i];\n    if (span) {\n      const nodeIds = path.nodeIds.slice(span.first, span.last + 1);\n      for (const id of nodeIds) {\n        kept.add(id);\n      }\n      trimmed.push({ ...path, nodeIds });\n      stretches.set(path.name, { first: span.first, nodeIds });\n    }\n  });\n  return {\n    ...graph,\n    nodes: graph.nodes.filter((n) => kept.has(n.id)),\n    edges: graph.edges.filter((e) => kept.has(e.from) && kept.has(e.to)),\n    paths: trimmed,\n    pathVisits: graph.pathVisits && trimVisits(\n      graph.pathVisits,\n      paths,\n      spans,\n      new Map(graph.nodes.map((n) => [n.id, n.name]))\n    ),\n    anchorPaths: trimOrigins(graph, stretches)\n  };\n}\nfunction trimVisits(visits, paths, spans, nameOf) {\n  const next = visits.replay();\n  const out = new PathVisitsBuilder();\n  paths.forEach((path, p) => {\n    const origin = visits.pathIndex(pathOrigin(path.name).name);\n    const span = spans[p];\n    path.nodeIds.forEach((id, i) => {\n      const segment = nameOf.get(id) ?? id;\n      const at = next(visits.slot(segment), origin);\n      if (at >= 0 && span && i >= span.first && i <= span.last) {\n        out.add(\n          segment,\n          visits.paths[origin],\n          visits.samples[origin],\n          visits.start[at],\n          visits.reversed[at] === 1\n        );\n      }\n    });\n  });\n  return out.build();\n}\nfunction clipToWindow(graph, window, reachBp) {\n  const nodes = graph.nodes.map((node) => {\n    if (!isBackbone(node)) {\n      return node;\n    }\n    const from = node.stable.start;\n    const to = from + node.length;\n    const [start, end] = overlapsWindow(node, window) ? [Math.max(from, window.start), Math.min(to, window.end)] : to <= window.start ? [Math.max(from, to - reachBp), to] : [from, Math.min(to, from + reachBp)];\n    return start === from && end === to ? node : {\n      ...node,\n      length: end - start,\n      stable: { ...node.stable, start },\n      unclipped: { start: from, length: node.length }\n    };\n  });\n  return nodes.some((node, i) => node !== graph.nodes[i]) ? { ...graph, nodes } : graph;\n}\nfunction unclipped(graph) {\n  return graph.nodes.some((n) => n.unclipped) ? {\n    ...graph,\n    nodes: graph.nodes.map(\n      ({ unclipped: full, ...node }) => full && node.stable ? {\n        ...node,\n        length: full.length,\n        stable: { ...node.stable, start: full.start }\n      } : node\n    )\n  } : graph;\n}\n\nexport {\n  trimToWindow,\n  clipToWindow,\n  unclipped\n};\n", "import {\n  unclipped\n} from \"./chunk-H4UHV22B.js\";\nimport {\n  referenceVisitStarts\n} from \"./chunk-BRH73RCH.js\";\nimport {\n  computeEdgeCurves,\n  edgeJoinOf,\n  routedEdgeCurves,\n  strandSides\n} from \"./chunk-JJV2GT2Z.js\";\nimport {\n  groupBy\n} from \"./chunk-BSOZW3FC.js\";\nimport {\n  firstNodeAtOrAfter,\n  isBackbone\n} from \"./chunk-RJWPJCIB.js\";\nimport {\n  partitionPoint\n} from \"./chunk-HOAIOEI7.js\";\n\n// src/deletionEdges.ts\nvar MIN_DELETION_BP = 1;\nvar deletionKey = (reference) => `skips ${reference ?? \"the reference\"} sequence (a deletion)`;\nfunction bypassedPoints(nodePositions, bypassed) {\n  return bypassed.flatMap((id) => nodePositions[id] ?? []);\n}\nfunction edgeCurvesOf(nodePositions, edge, axis, bypassed, route, stranded) {\n  const from = nodePositions[edge.from];\n  const to = nodePositions[edge.to];\n  if (!from?.length || !to?.length) {\n    return void 0;\n  }\n  return route ? routedEdgeCurves(\n    from,\n    to,\n    route,\n    stranded ? strandSides(edge) : void 0\n  ) : computeEdgeCurves(\n    from,\n    to,\n    edgeJoinOf(edge, stranded),\n    axis,\n    bypassed ? bypassedPoints(nodePositions, bypassed) : []\n  );\n}\nfunction backboneBySequence(graph) {\n  const bySequence = groupBy(\n    graph.nodes.filter(isBackbone),\n    (node) => node.stable.refName\n  );\n  for (const list of bySequence.values()) {\n    list.sort((a, b) => a.stable.start - b.stable.start);\n  }\n  return bySequence;\n}\nfunction bypassedNodes(nodes, start, end) {\n  const bypassed = [];\n  if (nodes) {\n    for (let i = firstNodeAtOrAfter(nodes, start); i < nodes.length; i++) {\n      const node = nodes[i];\n      if (node.stable.start >= end) {\n        break;\n      }\n      if (node.stable.start + node.length <= end) {\n        bypassed.push(node.id);\n      }\n    }\n  }\n  return bypassed;\n}\nfunction skipsBetween(edge, from, to, forwards) {\n  const { fromStrand, toStrand } = edge;\n  if (fromStrand === void 0 || toStrand === void 0) {\n    return true;\n  }\n  const leavesRight = fromStrand === (from.stable.strand ?? \"+\");\n  const arrivesLeft = toStrand === (to.stable.strand ?? \"+\");\n  return forwards ? leavesRight && arrivesLeft : !leavesRight && !arrivesLeft;\n}\nfunction skippedSpan(edge, from, to, startsOf) {\n  let best;\n  for (const a of startsOf(from)) {\n    for (const b of startsOf(to)) {\n      const forwards = a <= b;\n      const span = forwards ? { start: a + from.length, end: b } : { start: b + to.length, end: a };\n      if (skipsBetween(edge, from, to, forwards) && (!best || Math.abs(span.end - span.start) < Math.abs(best.end - best.start))) {\n        best = span;\n      }\n    }\n  }\n  return best;\n}\nvar COPY_SWITCH_SHARE = 0.01;\nfunction repeatCopies(backbone, startsOf) {\n  const bySequence = /* @__PURE__ */ new Map();\n  for (const [refName, nodes] of backbone) {\n    const copies = nodes.flatMap((node) => {\n      const starts = startsOf(node);\n      return starts.slice(1).map((next, i) => ({\n        at: starts[i],\n        copy: next - starts[i]\n      }));\n    });\n    if (copies.length) {\n      bySequence.set(\n        refName,\n        copies.sort((a, b) => a.at - b.at)\n      );\n    }\n  }\n  return bySequence;\n}\nfunction switchesCopy(copies, start, bp) {\n  if (!copies) {\n    return false;\n  }\n  const i = partitionPoint(copies.length, (k) => copies[k].at < start);\n  const near = [copies[i - 1], copies[i]].filter((c) => c !== void 0).sort((a, b) => Math.abs(a.at - start) - Math.abs(b.at - start))[0];\n  return near !== void 0 && Math.abs(near.at - start) <= near.copy && Math.abs(bp - near.copy) <= near.copy * COPY_SWITCH_SHARE;\n}\nfunction deletionEdges(cut) {\n  const graph = unclipped(cut);\n  const byId = new Map(graph.nodes.map((n) => [n.id, n]));\n  const backbone = backboneBySequence(graph);\n  const startsOf = referenceVisitStarts(graph);\n  const copies = repeatCopies(backbone, startsOf);\n  const found = [];\n  for (let edgeIndex = 0; edgeIndex < graph.edges.length; edgeIndex++) {\n    const edge = graph.edges[edgeIndex];\n    const from = byId.get(edge.from);\n    const to = byId.get(edge.to);\n    if (!edge.foldBridge && from !== void 0 && to !== void 0 && isBackbone(from) && isBackbone(to) && from.stable.refName === to.stable.refName) {\n      const span = skippedSpan(edge, from, to, startsOf);\n      const refName = from.stable.refName;\n      const bp = span ? span.end - span.start : 0;\n      if (span && bp >= MIN_DELETION_BP && !switchesCopy(copies.get(refName), span.start, bp)) {\n        const { start, end } = span;\n        found.push({\n          edgeIndex,\n          from: edge.from,\n          to: edge.to,\n          ...edge.fromStrand ? { fromStrand: edge.fromStrand } : {},\n          ...edge.toStrand ? { toStrand: edge.toStrand } : {},\n          refName,\n          start,\n          end,\n          bp,\n          bypassed: bypassedNodes(backbone.get(refName), start, end)\n        });\n      }\n    }\n  }\n  return found;\n}\nfunction closableDeletions(graph, deletions) {\n  const parent = /* @__PURE__ */ new Map();\n  const root = (id) => {\n    let r = id;\n    while (parent.has(r)) {\n      r = parent.get(r);\n    }\n    if (r !== id) {\n      parent.set(id, r);\n    }\n    return r;\n  };\n  const join = (a, b) => {\n    const [ra, rb] = [root(a), root(b)];\n    if (ra !== rb) {\n      parent.set(ra, rb);\n    }\n    return ra !== rb;\n  };\n  const candidates = new Set(deletions.map((d) => d.edgeIndex));\n  graph.edges.forEach((e, ei) => {\n    if (!candidates.has(ei)) {\n      join(e.from, e.to);\n    }\n  });\n  return new Set(\n    deletions.filter((d) => !join(d.from, d.to)).map((d) => d.edgeIndex)\n  );\n}\nfunction dashedDeletions(shown, lift) {\n  return lift?.walks.length ? shown.filter((d) => !lift.edgeIndexes.has(d.edgeIndex)) : shown;\n}\nvar drawings = /* @__PURE__ */ new WeakMap();\nfunction deletionDrawing(graph, deletions, show = true) {\n  let byShow = drawings.get(deletions);\n  if (!byShow) {\n    byShow = /* @__PURE__ */ new Map();\n    drawings.set(deletions, byShow);\n  }\n  let drawing = byShow.get(show);\n  if (!drawing) {\n    const hidden = show ? /* @__PURE__ */ new Set() : closableDeletions(graph, deletions);\n    drawing = {\n      shown: deletions.filter((d) => !hidden.has(d.edgeIndex)),\n      bypassed: new Map(deletions.map((d) => [d.edgeIndex, d.bypassed])),\n      hidden\n    };\n    byShow.set(show, drawing);\n  }\n  return drawing;\n}\n\nexport {\n  deletionKey,\n  edgeCurvesOf,\n  deletionEdges,\n  closableDeletions,\n  dashedDeletions,\n  deletionDrawing\n};\n", "import {\n  weakMemo\n} from \"./chunk-HMXCN6PG.js\";\nimport {\n  labelWidth,\n  occupancy\n} from \"./chunk-S43IBA5Y.js\";\nimport {\n  polylineMidpoint\n} from \"./chunk-HNNP5QUN.js\";\nimport {\n  edgeCurvesOf\n} from \"./chunk-ALGYCMMH.js\";\nimport {\n  curveBounds,\n  curveMidpoint,\n  polylinePx\n} from \"./chunk-JJV2GT2Z.js\";\n\n// src/graphLabels.ts\nvar MIN_DELETION_LABEL_PX = 26;\nvar PX_PER_NODE_LABEL = 4e4;\nvar MIN_NODE_LABELS = 8;\nvar LEADER_GAP_PX = 8;\nvar LABEL_CHAR_PX = 5.7;\nvar LABEL_PAD_PX = 6;\nvar LABEL_HEIGHT_PX = 13;\nvar LABEL_GAP_PX = 3;\nvar MAX_LABEL_OVERHANG = 2;\nfunction labelHalfWidth(text) {\n  return (text.length * LABEL_CHAR_PX + LABEL_PAD_PX + LABEL_GAP_PX) / 2;\n}\nvar LABEL_HALF_HEIGHT = (LABEL_HEIGHT_PX + LABEL_GAP_PX) / 2;\nvar MIN_LABEL_HALF_WIDTH = labelHalfWidth(\"1 bp\");\nfunction boxAt(halfW, x, y) {\n  return {\n    x0: x - halfW,\n    x1: x + halfW,\n    y0: y - LABEL_HALF_HEIGHT,\n    y1: y + LABEL_HALF_HEIGHT\n  };\n}\nfunction rowLabelBox(text, screenY) {\n  return {\n    x0: 6,\n    x1: 6 + labelWidth(text) + LABEL_GAP_PX,\n    y0: screenY - 8 - LABEL_GAP_PX / 2,\n    y1: screenY + 8 + LABEL_GAP_PX / 2\n  };\n}\nfunction clamp(v, lo, hi) {\n  return hi < lo ? v : Math.min(Math.max(v, lo), hi);\n}\nfunction groupDigits(n) {\n  return String(n).replace(/\\B(?=(\\d{3})+$)/g, \",\");\n}\nfunction formatBp(bp) {\n  const [value, unit] = bp >= 999500 ? [bp / 1e6, \"Mb\"] : bp >= 1e3 ? [bp / 1e3, \"kb\"] : [];\n  if (value === void 0) {\n    return `${bp} bp`;\n  }\n  return `${+value.toFixed(value >= 100 ? 0 : 1)} ${unit}`;\n}\nfunction deletionText(bp) {\n  return `${formatBp(bp)} del`;\n}\nfunction arcOutward(curves, apex, scaleX, scaleY) {\n  const first = curves[0];\n  const last = curves[curves.length - 1];\n  const dx = (apex.x - (first.x0 + last.x1) / 2) * scaleX;\n  const dy = (apex.y - (first.y0 + last.y1) / 2) * scaleY;\n  const len = Math.hypot(dx, dy);\n  return len === 0 ? { x: 0, y: -1 } : { x: dx / len, y: dy / len };\n}\nfunction boxSupport(box, dir) {\n  return Math.abs(dir.x) * (box.x1 - box.x0) / 2 + Math.abs(dir.y) * (box.y1 - box.y0) / 2;\n}\nfunction boxRayCrossing(box, dir) {\n  const halfW = (box.x1 - box.x0) / 2;\n  const halfH = (box.y1 - box.y0) / 2;\n  return Math.min(\n    dir.x === 0 ? Infinity : halfW / Math.abs(dir.x),\n    dir.y === 0 ? Infinity : halfH / Math.abs(dir.y)\n  );\n}\nfunction runBounds(nodeIds, nodePositions) {\n  let minX = Infinity;\n  let minY = Infinity;\n  let maxX = -Infinity;\n  let maxY = -Infinity;\n  for (const id of nodeIds) {\n    for (const p of nodePositions[id] ?? []) {\n      minX = Math.min(minX, p.x);\n      maxX = Math.max(maxX, p.x);\n      minY = Math.min(minY, p.y);\n      maxY = Math.max(maxY, p.y);\n    }\n  }\n  return minX === Infinity ? void 0 : { minX, minY, maxX, maxY };\n}\nvar nodeOrderCache = weakMemo();\nfunction labelOrder(nodePositions, nodeLengths) {\n  return nodeOrderCache(\n    nodePositions,\n    [nodeLengths],\n    () => Object.entries(nodePositions).filter(([id, segments]) => segments.length > 0 && nodeLengths.has(id)).sort(([a], [b]) => nodeLengths.get(b) - nodeLengths.get(a))\n  );\n}\nvar arcCache = weakMemo();\nfunction arcPlacements(nodePositions, deletions, axis, version, routes, stranded) {\n  const { scaleX, scaleY } = axis;\n  return arcCache(\n    nodePositions,\n    [deletions, routes, stranded, scaleX, scaleY, version],\n    () => {\n      const arcs = [];\n      for (const deletion of [...deletions].sort((a, b) => b.bp - a.bp)) {\n        const curves = edgeCurvesOf(\n          nodePositions,\n          deletion,\n          axis,\n          deletion.bypassed,\n          routes?.[deletion.edgeIndex],\n          stranded\n        );\n        const apex = curves ? curveMidpoint(curves) : void 0;\n        if (curves && apex) {\n          const { minX, minY, maxX, maxY } = curveBounds(curves);\n          arcs.push({\n            deletion,\n            curves,\n            apex,\n            // in screen px, so the two axes' units cannot be added by accident\n            extent: Math.max((maxX - minX) * scaleX, (maxY - minY) * scaleY)\n          });\n        }\n      }\n      return arcs;\n    }\n  );\n}\nfunction sizeLabelCandidates({\n  nodePositions,\n  nodeLengths,\n  deletions,\n  deletionRoutes,\n  stranded = false,\n  alleleDeletions,\n  axis,\n  translateX,\n  translateY,\n  width,\n  height,\n  version = 0\n}) {\n  const { scaleX, scaleY } = axis;\n  const deletionCandidates = [];\n  const nodeCandidates = [];\n  for (const { deletion, curves, apex, extent } of arcPlacements(\n    nodePositions,\n    deletions,\n    axis,\n    version,\n    deletionRoutes,\n    stranded\n  )) {\n    if (extent >= MIN_DELETION_LABEL_PX) {\n      const text = deletionText(deletion.bp);\n      const halfW = labelHalfWidth(text);\n      const box = boxAt(halfW, 0, 0);\n      const arcX = apex.x * scaleX + translateX;\n      const arcY = apex.y * scaleY + translateY;\n      if (arcX < 0 || arcX > width || arcY < 0 || arcY > height) {\n        continue;\n      }\n      const fits = extent >= halfW * 2 / MAX_LABEL_OVERHANG;\n      const bow = arcOutward(curves, apex, scaleX, scaleY);\n      const offset = boxSupport(box, bow) + LEADER_GAP_PX;\n      const x = fits ? arcX : clamp(arcX + bow.x * offset, halfW, width - halfW);\n      const y = fits ? arcY : clamp(\n        arcY + bow.y * offset,\n        LABEL_HALF_HEIGHT,\n        height - LABEL_HALF_HEIGHT\n      );\n      const away = Math.hypot(x - arcX, y - arcY);\n      let leader;\n      if (away > 0) {\n        const dir = { x: (x - arcX) / away, y: (y - arcY) / away };\n        const crossing = boxRayCrossing(box, dir);\n        leader = {\n          arcX,\n          arcY,\n          labelX: x - dir.x * crossing,\n          labelY: y - dir.y * crossing\n        };\n      }\n      deletionCandidates.push({\n        label: {\n          key: `del:${deletion.edgeIndex}`,\n          text,\n          x,\n          y,\n          kind: \"deletion\",\n          leader\n        },\n        box: boxAt(halfW, x, y)\n      });\n    }\n  }\n  const labelledByDeletion = /* @__PURE__ */ new Set();\n  const alleleRuns = [...alleleDeletions ?? []].sort((a, b) => b.bp - a.bp);\n  for (const run of alleleRuns) {\n    const drawn = runBounds(run.nodeIds, nodePositions);\n    if (!drawn) {\n      continue;\n    }\n    const shownLeft = Math.max(drawn.minX * scaleX + translateX, 0);\n    const shownRight = Math.min(drawn.maxX * scaleX + translateX, width);\n    const shownTop = Math.max(drawn.minY * scaleY + translateY, 0);\n    const shownBottom = Math.min(drawn.maxY * scaleY + translateY, height);\n    if (shownRight < shownLeft || shownBottom < shownTop) {\n      continue;\n    }\n    const extent = Math.max(shownRight - shownLeft, shownBottom - shownTop);\n    const text = deletionText(run.bp);\n    const halfW = labelHalfWidth(text);\n    if (extent >= halfW * 2 / MAX_LABEL_OVERHANG) {\n      for (const id of run.nodeIds) {\n        labelledByDeletion.add(id);\n      }\n      const x = clamp((shownLeft + shownRight) / 2, halfW, width - halfW);\n      const y = clamp(\n        (shownTop + shownBottom) / 2,\n        LABEL_HALF_HEIGHT,\n        height - LABEL_HALF_HEIGHT\n      );\n      deletionCandidates.push({\n        label: {\n          key: `alleledel:${run.nodeIds.join(\",\")}`,\n          text,\n          x,\n          y,\n          kind: \"deletion\"\n        },\n        box: boxAt(halfW, x, y)\n      });\n    }\n  }\n  for (const [id, segments] of labelOrder(nodePositions, nodeLengths)) {\n    if (labelledByDeletion.has(id)) {\n      continue;\n    }\n    const { x, y } = polylineMidpoint(segments);\n    const screenY = y * scaleY + translateY;\n    if (screenY + LABEL_HALF_HEIGHT <= 0 || screenY - LABEL_HALF_HEIGHT >= height) {\n      continue;\n    }\n    const drawn = polylinePx(segments, scaleX, scaleY);\n    if (drawn < MIN_LABEL_HALF_WIDTH * 2 / MAX_LABEL_OVERHANG) {\n      continue;\n    }\n    const text = formatBp(nodeLengths.get(id));\n    const halfW = labelHalfWidth(text);\n    if (drawn >= halfW * 2 / MAX_LABEL_OVERHANG) {\n      const screenX = x * scaleX + translateX;\n      nodeCandidates.push({\n        label: {\n          key: `node:${id}`,\n          text,\n          x: screenX,\n          y: screenY,\n          kind: \"node\"\n        },\n        box: boxAt(halfW, screenX, screenY)\n      });\n    }\n  }\n  return { deletions: deletionCandidates, nodes: nodeCandidates };\n}\nfunction nodeLabelBudget(width, height) {\n  return Math.max(\n    MIN_NODE_LABELS,\n    Math.floor(width * height / PX_PER_NODE_LABEL)\n  );\n}\nfunction placeSizeLabels(candidates, take, budget = Infinity) {\n  const labels = [];\n  for (const { label, box } of candidates) {\n    if (labels.length >= budget) {\n      break;\n    }\n    if (take(box)) {\n      labels.push(label);\n    }\n  }\n  return labels;\n}\nfunction graphLabels({\n  reserved,\n  take,\n  ...args\n}) {\n  take ??= occupancy(args, reserved);\n  const { deletions, nodes } = sizeLabelCandidates(args);\n  return [\n    ...placeSizeLabels(deletions, take),\n    ...placeSizeLabels(nodes, take, nodeLabelBudget(args.width, args.height))\n  ];\n}\n\nexport {\n  rowLabelBox,\n  groupDigits,\n  formatBp,\n  sizeLabelCandidates,\n  nodeLabelBudget,\n  placeSizeLabels,\n  graphLabels\n};\n", "import {\n  groupDigits\n} from \"./chunk-OPTHW6IZ.js\";\nimport {\n  pathOrigin\n} from \"./chunk-BRH73RCH.js\";\nimport {\n  isGenericSample\n} from \"./chunk-2JL2JVZ2.js\";\n\n// src/pathColors.ts\nfunction nameHue(name) {\n  let hash = 0;\n  for (let i = 0; i < name.length; i++) {\n    hash = name.charCodeAt(i) + ((hash << 5) - hash);\n  }\n  return Math.abs(hash % 360);\n}\nfunction pathHueAt(index, count) {\n  return index * 360 / count;\n}\nvar PATH_SATURATION = 0.7;\nvar PATH_LIGHTNESS = 0.5;\nvar MAX_PATH_COLORS = 16;\nfunction pathColorsLegible(pathCount) {\n  return pathCount > 0 && pathCount <= MAX_PATH_COLORS;\n}\nfunction pathCssColor(index, count) {\n  return `hsl(${pathHueAt(index, count)}, ${PATH_SATURATION * 100}%, ${PATH_LIGHTNESS * 100}%)`;\n}\nfunction pathGreyCssColor(index, count) {\n  const lightness = count > 1 ? 25 + 45 * index / (count - 1) : 45;\n  return `hsl(0, 0%, ${lightness}%)`;\n}\nfunction labelTiers(name) {\n  const parts = pathOrigin(name).name.split(\"#\");\n  const full = parts.join(\"#\");\n  if (parts.length >= 3 && isGenericSample(parts[0])) {\n    const contig = parts.slice(2).join(\"#\");\n    return [contig, contig, full];\n  }\n  return [parts[0], parts.slice(0, 2).join(\"#\"), full];\n}\nfunction offsetTiers(name, tiers) {\n  const { start } = pathOrigin(name);\n  return tiers.map((t) => `${t} @${groupDigits(start)}`);\n}\nfunction pathLegend(paths, colors) {\n  const firstOf = /* @__PURE__ */ new Map();\n  paths.forEach((path, i) => {\n    if (!firstOf.has(path.name)) {\n      firstOf.set(path.name, i);\n    }\n  });\n  const entries = [...firstOf].map(([name2, i]) => ({ name: name2, i }));\n  const named = entries.map((e) => labelTiers(e.name));\n  const name = (t) => entries.map((_, k) => named[k][t]);\n  const offset = (t) => entries.map((e, k) => offsetTiers(e.name, named[k])[t]);\n  const candidates = [\n    name(0),\n    name(1),\n    offset(0),\n    name(2),\n    offset(1),\n    offset(2)\n  ];\n  const distinct = candidates.find(\n    (labels2) => new Set(labels2).size === entries.length\n  );\n  const labels = distinct ?? candidates.at(-1);\n  return entries.map(({ name: name2, i }, k) => ({\n    name: name2,\n    label: labels[k],\n    color: colors?.[i] ?? pathCssColor(i, paths.length)\n  }));\n}\nfunction walkLabelsOf(entries) {\n  const seen = /* @__PURE__ */ new Map();\n  return new Map(\n    [...entries].sort((a, b) => a.label.localeCompare(b.label)).map((e) => {\n      const n = (seen.get(e.label) ?? 0) + 1;\n      seen.set(e.label, n);\n      return [e.name, n > 1 ? `${e.label} (${n})` : e.label];\n    })\n  );\n}\n\nexport {\n  nameHue,\n  pathHueAt,\n  PATH_SATURATION,\n  PATH_LIGHTNESS,\n  MAX_PATH_COLORS,\n  pathColorsLegible,\n  pathCssColor,\n  pathGreyCssColor,\n  pathLegend,\n  walkLabelsOf\n};\n", "import {\n  panSNHaplotype\n} from \"./chunk-2JL2JVZ2.js\";\n\n// src/nodeWidths.ts\nvar NODE_WIDTHS = [\n  {\n    value: \"depth\",\n    label: \"By depth\",\n    description: \"Thicker the more paths carry a node, on the square root of its depth against the mean. A graph with one depth everywhere draws uniform.\"\n  },\n  {\n    value: \"frequency\",\n    label: \"By frequency\",\n    description: \"As wide as the share of haplotypes that pass a node, or its AF tag: full width at 100%, half at 50%, and wider where a haplotype passes it more than once.\"\n  },\n  {\n    value: \"uniform\",\n    label: \"Uniform\",\n    description: \"Every node the same thickness.\"\n  }\n];\nvar MIN_FACTOR = 0.3;\nvar MAX_FACTOR = 3;\nvar MIN_FREQUENCY_FACTOR = 0.05;\nfunction meanDepth(graph) {\n  let weighted = 0;\n  let length = 0;\n  for (const node of graph.nodes) {\n    weighted += node.depth * node.length;\n    length += node.length;\n  }\n  return length > 0 ? weighted / length : 0;\n}\nfunction haplotypeOf(path) {\n  return path.sample === void 0 ? panSNHaplotype(path.name) ?? path.name : `${path.sample}#${path.haplotype ?? 0}`;\n}\nfunction haplotypeCount(graph) {\n  return new Set((graph.paths ?? []).map(haplotypeOf)).size;\n}\nfunction nodeFrequency(node, haplotypes) {\n  return node.frequency ?? (haplotypes > 0 ? node.depth / haplotypes : void 0);\n}\nfunction withFrequencies(graph, frequencies) {\n  if (!frequencies) {\n    return graph;\n  }\n  const nodes = graph.nodes.map((node) => {\n    const frequency = frequencies[node.name];\n    return frequency === void 0 ? node : { ...node, frequency };\n  });\n  return { ...graph, nodes };\n}\nfunction widthNorm(graph, nodeWidth) {\n  return nodeWidth === \"depth\" ? meanDepth(graph) : nodeWidth === \"frequency\" ? haplotypeCount(graph) : 0;\n}\nfunction frequencyFactor(f) {\n  return Math.min(MAX_FACTOR, Math.max(MIN_FREQUENCY_FACTOR, f));\n}\nfunction frequencyWidthFactor(node, haplotypes) {\n  const f = nodeFrequency(node, haplotypes);\n  return f === void 0 ? 1 : frequencyFactor(f);\n}\nfunction frequencyKey(contigThickness) {\n  return [1, 0.5, 0.1].map((f) => ({\n    label: `${f * 100}%`,\n    widthPx: contigThickness * frequencyFactor(f)\n  }));\n}\nfunction depthWidthFactor(node, mean) {\n  if (!(mean > 0) || !(node.depth > 0)) {\n    return 1;\n  }\n  return Math.min(\n    MAX_FACTOR,\n    Math.max(MIN_FACTOR, Math.sqrt(node.depth / mean))\n  );\n}\nfunction nodeWidthPx(node, contigThickness, nodeWidth, norm) {\n  return contigThickness * (nodeWidth === \"depth\" ? depthWidthFactor(node, norm) : nodeWidth === \"frequency\" ? frequencyWidthFactor(node, norm) : 1);\n}\nfunction maxNodeWidthPx(contigThickness, nodeWidth) {\n  return contigThickness * (nodeWidth === \"uniform\" ? 1 : MAX_FACTOR);\n}\nvar MIN_WALK_LANE_PX = 4;\nfunction walkLaneWidthPx(width, lanes) {\n  return Math.max(width / lanes, MIN_WALK_LANE_PX);\n}\nfunction nodeInk(graph, nodeById, contigThickness, nodeWidth, lanes = 0) {\n  const norm = graph ? widthNorm(graph, nodeWidth) : 0;\n  const reach = (width) => lanes > 0 ? walkLaneWidthPx(width, lanes) * lanes / 2 : width / 2;\n  return {\n    maxHalfWidthPx: reach(maxNodeWidthPx(contigThickness, nodeWidth)),\n    halfWidthPx: (id) => {\n      const node = nodeById?.get(id);\n      return reach(\n        node ? nodeWidthPx(node, contigThickness, nodeWidth, norm) : contigThickness\n      );\n    }\n  };\n}\n\nexport {\n  NODE_WIDTHS,\n  meanDepth,\n  haplotypeCount,\n  nodeFrequency,\n  withFrequencies,\n  widthNorm,\n  frequencyKey,\n  nodeWidthPx,\n  maxNodeWidthPx,\n  walkLaneWidthPx,\n  nodeInk\n};\n", "// src/edgeWidths.ts\nvar EDGE_WIDTHS = [\n  {\n    value: \"uniform\",\n    label: \"Uniform\",\n    description: \"Every link the same thickness.\"\n  },\n  {\n    value: \"walks\",\n    label: \"By walks\",\n    description: \"Thicker the more walks take a link, on the square root of its count against the busiest link in the cut. A graph without walks draws uniform.\"\n  }\n];\nvar MIN_FACTOR = 0.5;\nvar MAX_FACTOR = 4;\nfunction busiestEdge(graph) {\n  let most = 0;\n  for (const edge of graph.edges) {\n    most = Math.max(most, edge.pathIds?.length ?? 0);\n  }\n  return most;\n}\nfunction edgeWidthFactor(walks, busiest, edgeWidth) {\n  if (edgeWidth === \"uniform\" || busiest === 0) {\n    return 1;\n  }\n  return MIN_FACTOR + (MAX_FACTOR - MIN_FACTOR) * Math.sqrt(walks / busiest);\n}\n\nexport {\n  EDGE_WIDTHS,\n  busiestEdge,\n  edgeWidthFactor\n};\n"],
-  "mappings": "+JACA,IAAIA,GAAgB,GCIpB,SAASC,GAAQC,EAAQ,CACvB,IAAMC,EAASC,GAAM,KAAK,MAAMA,EAAI,GAAG,EAAI,IAC3C,OAAOF,EAAO,IAAI,CAACG,EAAGC,IAAM,GAAGA,EAAI,IAAM,GAAG,GAAGH,EAAME,EAAE,CAAC,CAAC,IAAIF,EAAME,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CACpF,CACA,SAASE,GAAYC,EAAIC,EAAIC,EAAIC,EAAIC,EAAU,CAC7C,IAAMC,EAAI,KAAK,MAAMF,EAAKF,EAAIC,EAAKF,CAAE,EACrC,GAAIK,IAAM,EACR,MAAO,CAACH,EAAIC,CAAE,EAEhB,IAAMG,GAAMJ,EAAKF,GAAMK,EACjBE,GAAMJ,EAAKF,GAAMI,EACvB,MAAO,CAACH,EAAKE,EAAWE,EAAIH,EAAKC,EAAWG,CAAE,CAChD,CACA,SAASC,EAAaC,EAAGC,EAAG,CAC1B,IAAMC,EAAI,EAAID,EACRE,EAAID,EAAIA,EAAIA,EACZE,EAAI,EAAIF,EAAIA,EAAID,EAChBL,EAAI,EAAIM,EAAID,EAAIA,EAChBI,EAAIJ,EAAIA,EAAIA,EAClB,MAAO,CACL,EAAGE,EAAIH,EAAE,GAAKI,EAAIJ,EAAE,IAAMJ,EAAII,EAAE,IAAMK,EAAIL,EAAE,GAC5C,EAAGG,EAAIH,EAAE,GAAKI,EAAIJ,EAAE,IAAMJ,EAAII,EAAE,IAAMK,EAAIL,EAAE,EAC9C,CACF,CACA,SAASM,GAAcC,EAAQ,CAC7B,IAAMC,EAAMD,EAAO,KAAK,MAAMA,EAAO,OAAS,CAAC,CAAC,EAChD,OAAOC,EAAMT,EAAaS,EAAK,EAAG,EAAI,MACxC,CACA,SAASC,GAAYF,EAAQ,CAC3B,IAAIG,EAAO,IACPC,EAAO,IACPC,EAAO,KACPC,EAAO,KACX,QAAWb,KAAKO,EACdG,EAAO,KAAK,IAAIA,EAAMV,EAAE,GAAIA,EAAE,IAAKA,EAAE,IAAKA,EAAE,EAAE,EAC9CY,EAAO,KAAK,IAAIA,EAAMZ,EAAE,GAAIA,EAAE,IAAKA,EAAE,IAAKA,EAAE,EAAE,EAC9CW,EAAO,KAAK,IAAIA,EAAMX,EAAE,GAAIA,EAAE,IAAKA,EAAE,IAAKA,EAAE,EAAE,EAC9Ca,EAAO,KAAK,IAAIA,EAAMb,EAAE,GAAIA,EAAE,IAAKA,EAAE,IAAKA,EAAE,EAAE,EAEhD,MAAO,CAAE,KAAAU,EAAM,KAAAC,EAAM,KAAAC,EAAM,KAAAC,CAAK,CAClC,CACA,SAASC,GAASd,EAAGe,EAAIC,EAAI,CAC3B,IAAMC,EAAKlB,EAAaC,EAAGe,CAAE,EACvBG,EAAKnB,EAAaC,EAAGgB,CAAE,EACvBG,GAAMH,EAAKD,GAAM,EACjBK,EAAKC,GAAerB,EAAGe,CAAE,EACzBO,EAAKD,GAAerB,EAAGgB,CAAE,EAC/B,MAAO,CACL,GAAIC,EAAG,EACP,GAAIA,EAAG,EACP,IAAKA,EAAG,EAAIG,EAAG,EAAID,EACnB,IAAKF,EAAG,EAAIG,EAAG,EAAID,EACnB,IAAKD,EAAG,EAAII,EAAG,EAAIH,EACnB,IAAKD,EAAG,EAAII,EAAG,EAAIH,EACnB,GAAID,EAAG,EACP,GAAIA,EAAG,CACT,CACF,CACA,SAASG,GAAerB,EAAGC,EAAG,CAC5B,IAAMC,EAAI,EAAID,EACRE,EAAI,EAAID,EAAIA,EACZE,EAAI,EAAIF,EAAID,EACZL,EAAI,EAAIK,EAAIA,EAClB,MAAO,CACL,EAAGE,GAAKH,EAAE,IAAMA,EAAE,IAAMI,GAAKJ,EAAE,IAAMA,EAAE,KAAOJ,GAAKI,EAAE,GAAKA,EAAE,KAC5D,EAAGG,GAAKH,EAAE,IAAMA,EAAE,IAAMI,GAAKJ,EAAE,IAAMA,EAAE,KAAOJ,GAAKI,EAAE,GAAKA,EAAE,IAC9D,CACF,CACA,IAAIuB,EAAkB,GACtB,SAASC,GAAiBjB,EAAQkB,EAASC,EAAQC,EAAM,CACvD,IAAMC,EAAY,CAAC,EACfC,EAAQ,EACZ,OAAAtB,EAAO,QAAQ,CAACP,EAAG8B,IAAM,CACvB,IAAMC,EAASN,EAAQK,CAAC,EAClBE,EAAMD,EAASR,EACjBU,EAAOlC,EAAaC,EAAG,CAAC,EAC5B,QAASX,EAAI,EAAGA,GAAKkC,EAAiBlC,IAAK,CACzC,IAAM6C,EAAOnC,EAAaC,EAAGX,EAAIkC,CAAe,EAChD,GAAI,KAAK,IAAIU,EAAK,EAAGC,EAAK,CAAC,EAAIF,GAAON,EAAO,MAAQ,KAAK,IAAIO,EAAK,EAAGC,EAAK,CAAC,EAAIF,GAAON,EAAO,MAAQ,KAAK,IAAIO,EAAK,EAAGC,EAAK,CAAC,EAAIF,EAAML,GAAQD,EAAO,MAAQ,KAAK,IAAIO,EAAK,EAAGC,EAAK,CAAC,EAAIF,EAAML,GAAQD,EAAO,KAAM,CAClN,IAAMS,EAAON,EAAQE,GAAU1C,EAAI,GAAKkC,EAClCa,EAAKP,EAAQE,EAAS1C,EAAIkC,EAC1Bc,EAAOT,EAAU,GAAG,EAAE,EACxBS,GAAQA,EAAK,CAAC,GAAKF,EACrBE,EAAK,CAAC,EAAID,EAEVR,EAAU,KAAK,CAACO,EAAMC,CAAE,CAAC,CAE7B,CACAH,EAAOC,CACT,CACAL,GAASE,CACX,CAAC,EACMH,CACT,CAEA,SAASU,GAAUC,EAAQC,EAAWC,EAAO,EAAGC,EAAQ,CACtD,IAAMC,EAAUJ,EAAO,IACpBK,GAAM,KAAK,MAAMA,EAAE,IAAMA,EAAE,IAAKA,EAAE,IAAMA,EAAE,IAAMH,CAAI,EAAI,KAAK,MAAMG,EAAE,IAAMA,EAAE,KAAMA,EAAE,IAAMA,EAAE,KAAOH,CAAI,EAAI,KAAK,MAAMG,EAAE,GAAKA,EAAE,KAAMA,EAAE,GAAKA,EAAE,KAAOH,CAAI,CAC7J,EACMI,EAAQF,EAAQ,OAAO,CAACG,EAAGC,IAAMD,EAAIC,EAAG,CAAC,EACzCC,EAAU,KAAK,MAAMH,EAAQL,CAAS,EACtCS,EAAQ,KAAK,IAAI,EAAGD,EAAU,EAAIA,EAAUA,EAAU,CAAC,EACvDE,EAAYR,EAASS,GAAiBZ,EAAQI,EAASD,EAAQD,CAAI,EAAI,OACzEW,EAAO,EACLC,EAAM,CAAC,EACb,QAASC,EAAI,EAAGA,EAAIL,EAAOK,GAAK,EAAG,CACjC,IAAMC,EAAOD,EAAIL,EAAQJ,EACnBW,GAAMF,EAAI,GAAKL,EAAQJ,EAC7B,GAAIK,EAAW,CACb,KAAOE,EAAOF,EAAU,QAAUA,EAAUE,CAAI,EAAE,CAAC,EAAIG,GACrDH,IAEF,GAAIA,IAASF,EAAU,OACrB,MAEF,GAAIA,EAAUE,CAAI,EAAE,CAAC,EAAII,EACvB,QAEJ,CACA,IAAMC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACXC,EAAQ,EACZpB,EAAO,QAAQ,CAACK,EAAGgB,IAAM,CACvB,IAAMC,EAASlB,EAAQiB,CAAC,EAClBE,EAAMH,EAAQE,EACpB,GAAIA,EAAS,GAAKC,EAAMP,GAAQI,EAAQH,EAAI,CAC1C,IAAMO,EAAK,KAAK,IAAI,GAAIR,EAAOI,GAASE,CAAM,EACxCG,EAAK,KAAK,IAAI,GAAIR,EAAKG,GAASE,CAAM,EAC5CJ,EAAK,KAAKQ,GAASrB,EAAGmB,EAAIC,CAAE,CAAC,EAC7BN,EAAM,MAAME,EAAIG,GAAMxB,EAAO,QAASqB,EAAII,GAAMzB,EAAO,MAAM,CAC/D,CACAoB,EAAQG,CACV,CAAC,EACGL,EAAK,QACPJ,EAAI,KAAK,CACP,OAAQI,EACR,WAAYC,EAAM,CAAC,EACnB,SAAUA,EAAM,GAAG,EAAE,CACvB,CAAC,CAEL,CACA,OAAOL,CACT,CAKA,SAASa,GAAYC,EAAQC,EAAQC,EAAQC,EAAMC,EAAM,CACvD,IAAMC,EAAIL,EAAO,OACXM,EAAM,IAAI,MAAMD,CAAC,EACvB,QAASE,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CAC1B,IAAMC,EAAIR,EAAOO,CAAC,EACZE,EAAIF,EAAIF,EACRK,GAAKH,EAAI,GAAKF,EACdM,EAAMV,GAAUE,EAAOF,GAAUQ,EACjCG,EAAMV,GAAUE,EAAOF,GAAUO,EACjCI,EAAMZ,GAAUE,EAAOF,GAAUS,EACjCI,EAAMZ,GAAUE,EAAOF,GAAUQ,EACvCJ,EAAIC,CAAC,EAAI,CACP,GAAIC,EAAE,GAAKG,EACX,GAAIH,EAAE,GAAKI,EACX,IAAKJ,EAAE,IAAMG,EACb,IAAKH,EAAE,IAAMI,EACb,IAAKJ,EAAE,IAAMK,EACb,IAAKL,EAAE,IAAMM,EACb,GAAIN,EAAE,GAAKK,EACX,GAAIL,EAAE,GAAKM,CACb,CACF,CACA,OAAOR,CACT,CACA,SAASS,GAAgBf,EAAQgB,EAAIC,EAAI,CACvC,IAAMX,EAAM,IAAI,MAAMN,EAAO,MAAM,EACnC,QAASO,EAAI,EAAGA,EAAIP,EAAO,OAAQO,IAAK,CACtC,IAAMC,EAAIR,EAAOO,CAAC,EAClBD,EAAIC,CAAC,EAAI,CACP,GAAIC,EAAE,GAAKQ,EACX,GAAIR,EAAE,GAAKS,EACX,IAAKT,EAAE,IAAMQ,EACb,IAAKR,EAAE,IAAMS,EACb,IAAKT,EAAE,IAAMQ,EACb,IAAKR,EAAE,IAAMS,EACb,GAAIT,EAAE,GAAKQ,EACX,GAAIR,EAAE,GAAKS,CACb,CACF,CACA,OAAOX,CACT,CACA,SAASY,EAAWC,EAAUC,EAAM,CAClC,IAAMC,EAAOF,EAAS,OAAS,EAC/B,OAAOC,IAAS,MAAQ,CAAE,GAAID,EAASE,CAAI,EAAG,OAAQF,EAASE,EAAO,CAAC,CAAE,EAAI,CAAE,GAAIF,EAAS,CAAC,EAAG,OAAQA,EAAS,CAAC,CAAE,CACtH,CACA,IAAIG,GAAsB,GACtBC,GAAc,GAClB,SAASC,EAAUC,EAAI,CACrB,OAAOA,EAAG,SAAS,GAAG,EAAI,IAAM,GAClC,CACA,SAASC,EAAYC,EAAM,CACzB,IAAMC,EAAM,CAACH,EAAII,KAAYA,GAAUL,EAAUC,CAAE,KAAOD,EAAUC,CAAE,EACtE,MAAO,CACL,KAAMG,EAAID,EAAK,KAAMA,EAAK,UAAU,EAAI,MAAQ,QAChD,GAAIC,EAAID,EAAK,GAAIA,EAAK,QAAQ,EAAI,QAAU,KAC9C,CACF,CACA,SAASG,GAAOX,EAAU,CACxB,IAAIY,EAAM,IACNC,EAAM,KACV,QAAWC,KAAKd,EACdY,EAAM,KAAK,IAAIA,EAAKE,EAAE,CAAC,EACvBD,EAAM,KAAK,IAAIA,EAAKC,EAAE,CAAC,EAEzB,MAAO,CAAE,IAAAF,EAAK,IAAAC,CAAI,CACpB,CACA,SAASE,GAAeC,EAAGC,EAAM,CAC/B,OAAO,KAAK,IAAI,EAAGA,EAAK,IAAMD,EAAGA,EAAIC,EAAK,GAAG,CAC/C,CACA,SAASC,GAAWlB,EAAUmB,EAAOC,EAAU,CAC7C,IAAMC,EAAWN,GAAef,EAAS,CAAC,EAAE,EAAGmB,CAAK,EAC9CG,EAASP,GAAef,EAASA,EAAS,OAAS,CAAC,EAAE,EAAGmB,CAAK,EACpE,OAAOE,IAAaC,EAASF,EAAWC,EAAWC,EAAS,QAAU,KACxE,CACA,SAASC,GAAYC,EAAcC,EAAY,CAC7C,MAAO,CACL,KAAMP,GAAWM,EAAcb,GAAOc,CAAU,EAAG,KAAK,EACxD,GAAIP,GAAWO,EAAYd,GAAOa,CAAY,EAAG,OAAO,CAC1D,CACF,CACA,IAAIE,GAA4B,IAAI,QACpC,SAASC,GAAgBH,EAAcC,EAAY,CACjD,IAAIG,EAAOF,GAAU,IAAIF,CAAY,EAChCI,IACHA,EAAuB,IAAI,QAC3BF,GAAU,IAAIF,EAAcI,CAAI,GAElC,IAAIC,EAAQD,EAAK,IAAIH,CAAU,EAC/B,OAAKI,IACHA,EAAQN,GAAYC,EAAcC,CAAU,EAC5CG,EAAK,IAAIH,EAAYI,CAAK,GAErBA,CACT,CACA,IAAIC,GAAgB,IAChBC,GAAgB,KAChBC,GAAiB,IACjBC,GAAiB,EAAIC,GACzB,SAASC,GAAUC,EAAKC,EAAKC,EAAKC,EAAKC,EAAQC,EAAQ,CACrD,IAAMC,EAAQ,KAAK,MAAMJ,EAAMF,EAAKG,EAAMF,CAAG,EACvCM,EAAKD,IAAU,EAAI,GAAKJ,EAAMF,GAAOM,EACrCE,EAAKF,IAAU,EAAI,GAAKH,EAAMF,GAAOK,EACvCG,EAAQ,EACRC,EAAW,IACXC,EAAW,KACf,QAAWC,KAAKR,EAAQ,CACtB,IAAM3C,EAAKmD,EAAE,EAAIZ,EACXtC,EAAKkD,EAAE,EAAIX,EACXY,EAAOpD,EAAK,CAAC+C,EAAK9C,EAAK6C,EACzB,KAAK,IAAIM,CAAI,EAAI,KAAK,IAAIJ,CAAK,IACjCA,EAAQI,GAEV,IAAMC,EAAQrD,EAAK8C,EAAK7C,EAAK8C,EAC7BE,EAAW,KAAK,IAAIA,EAAUI,CAAK,EACnCH,EAAW,KAAK,IAAIA,EAAUG,CAAK,CACrC,CACA,IAAMjC,EAAOuB,EAAO,OAASO,EAAWD,EAAW,EAC7CK,EAAW,KAAK,IACpB,KAAK,IAAIN,CAAK,EAAId,GAAgBD,GAClCb,EAAOe,EACT,EACMoB,EAAOX,IAAW,OAASU,EAAW,KAAK,IAAIA,EAAUV,CAAM,EACrE,OAAOI,EAAQ,EAAI,CAACO,EAAOA,CAC7B,CACA,SAASC,GAAO,CAAE,OAAAC,EAAQ,OAAAC,CAAO,EAAG,CAClC,OAAOA,EAASD,CAClB,CACA,IAAIE,GAAyB,EAC7B,SAASC,EAAenE,EAAGC,EAAGmE,EAAM,CAClC,IAAM7D,EAAKN,EAAE,EAAID,EAAE,EACbQ,GAAMP,EAAE,EAAID,EAAE,GAAKoE,EACnBC,EAAM,KAAK,MAAM9D,EAAIC,CAAE,EAC7B,OAAO6D,IAAQ,EAAI,OAAS,CAAE,EAAG9D,EAAK8D,EAAK,EAAG7D,EAAK6D,CAAI,CACzD,CACA,SAASC,GAAkBpC,EAAcC,EAAYoC,EAAOC,EAAM,CAChE,IAAMJ,EAAOL,GAAOS,CAAI,EAClBC,EAAUP,GAAyB,KAAK,IAAIM,EAAK,OAAQ,IAAI,EAC7DE,EAAMP,EACVjC,EAAaA,EAAa,OAAS,CAAC,EACpCC,EAAW,CAAC,EACZiC,CACF,GAAKD,EAAejC,EAAa,CAAC,EAAGA,EAAa,GAAG,EAAE,EAAGkC,CAAI,GAAKD,EAAehC,EAAW,CAAC,EAAGA,EAAW,GAAG,EAAE,EAAGiC,CAAI,GAAK,CAAE,EAAG,EAAG,EAAG,CAAE,EACpIO,EAAU,CAAC,EACjB,QAAS,EAAI,EAAG,EAAIJ,EAAO,IAAK,CAC9B,IAAMK,GAAY,GAAKL,EAAQ,GAAK,GAAKE,EACzCE,EAAQ,KAAK,CAAE,EAAG,CAACD,EAAI,EAAIE,EAAU,EAAGF,EAAI,EAAIE,EAAWR,CAAK,CAAC,CACnE,CACA,OAAOO,CACT,CACA,SAASE,EAASC,EAAQV,EAAM,CAC9B,OAAOU,EAAO,IAAKpB,IAAO,CAAE,EAAGA,EAAE,EAAG,EAAGA,EAAE,EAAIU,CAAK,EAAE,CACtD,CACA,SAASW,GAAWxF,EAAQ6E,EAAM,CAChC,QAAWrE,KAAKR,EACdQ,EAAE,IAAMqE,EACRrE,EAAE,KAAOqE,EACTrE,EAAE,KAAOqE,EACTrE,EAAE,IAAMqE,EAEV,OAAO7E,CACT,CACA,SAASyF,EAAWF,EAAQd,EAAQC,EAAQ,CAC1C,IAAIgB,EAAQ,EACZ,QAASnF,EAAI,EAAGA,EAAIgF,EAAO,OAAQhF,IAAK,CACtC,IAAME,EAAI8E,EAAOhF,EAAI,CAAC,EAChBG,EAAI6E,EAAOhF,CAAC,EAClBmF,GAAS,KAAK,OAAOhF,EAAE,EAAID,EAAE,GAAKgE,GAAS/D,EAAE,EAAID,EAAE,GAAKiE,CAAM,CAChE,CACA,OAAOgB,CACT,CACA,IAAIC,GAAmB,GACnBC,GAAmB,GACvB,SAASC,GAAc1E,EAAU2E,EAAO,CACtC,IAAMC,EAASN,EAAWtE,EAAU2E,EAAOA,CAAK,EAKhD,OAJgB,KAAK,IACnBF,GACA,KAAK,IAAID,GAAkBI,EAAS,CAAC,CACvC,EACiB,KAAK,IAAID,EAAO,OAAO,OAAO,CACjD,CACA,SAASE,GAAWrE,EAAM,CACxB,OAAIA,EAAK,OAASA,EAAK,GACd,GAEFA,EAAK,YAAcA,EAAK,UAAYA,EAAK,aAAeA,EAAK,SAAWA,EAAK,aAAe,IAAM,MAAQ,QAAU,EAC7H,CACA,SAASsE,GAAWtE,EAAMuE,EAAW,GAAO,CAC1C,IAAMC,EAAOH,GAAWrE,CAAI,EAC5B,GAAI,CAACuE,EACH,OAAOC,EAET,IAAMnD,EAAQtB,EAAYC,CAAI,EAC9B,OAAOwE,IAAS,GAAQnD,EAAQA,EAAM,OAASA,EAAM,GAAKA,EAAM,KAAO,EACzE,CACA,SAASoD,GAAcC,EAAQrC,EAAO,CACpC,GAAM,CAAE,GAAAsC,EAAI,OAAAC,CAAO,EAAIF,EACjBrF,EAAKuF,EAASD,EAAG,EAAIC,EAAO,EAAI,EAChCtF,EAAKsF,EAASD,EAAG,EAAIC,EAAO,EAAI,EAChCzB,EAAM,KAAK,MAAM9D,EAAIC,CAAE,GAAK,EAC5B6C,EAAK9C,EAAK8D,EACVf,EAAK9C,EAAK6D,EACV0B,EAAKF,EAAG,EACRG,EAAKH,EAAG,EACRI,EAAQF,EAAK1C,EAAKE,EAAQ,EAC1B2C,EAAQF,EAAK1C,EAAKC,EAAQ,EAC1B4C,EAAQJ,EAAK1C,EAAKE,EAClB6C,EAAQJ,EAAK1C,EAAKC,EAClB8C,EAAQ,CAAC/C,EAAKC,EAAQ,EACtB+C,EAAQjD,EAAKE,EAAQ,EAC3B,MAAO,CACL,CACE,GAAIwC,EACJ,GAAIC,EACJ,IAAKC,EACL,IAAKC,EACL,IAAKC,EAAQE,EACb,IAAKD,EAAQE,EACb,GAAIH,EACJ,GAAIC,CACN,EACA,CACE,GAAID,EACJ,GAAIC,EACJ,IAAKD,EAAQE,EACb,IAAKD,EAAQE,EACb,IAAKL,EACL,IAAKC,EACL,GAAIH,EACJ,GAAIC,CACN,CACF,CACF,CACA,SAASO,GAAkBrE,EAAcC,EAAYqE,EAAMhC,EAAMiC,EAAW,CAAC,EAAGC,EAAU,CACxF,IAAMrB,EAAQb,EAAK,OACbJ,EAAOL,GAAOS,CAAI,EAClBrB,EAASuD,IAAalC,EAAK,UAAY7B,GAAiB,QAI9D,GAHI6D,IAAS,KACXA,EAAOnE,GAAgBH,EAAcC,CAAU,GAE7CiC,IAAS,EACX,OAAOW,GACLwB,GACE1B,EAAS3C,EAAckC,CAAI,EAC3BS,EAAS1C,EAAYiC,CAAI,EACzBoC,EACA,CAAE,OAAQnB,EAAO,OAAQA,CAAM,EAC/BR,EAAS4B,EAAUrC,CAAI,EAGvBjB,IAAW,OAAS,OAASA,EAASiB,CACxC,EACAA,CACF,EAEF,GAAI,OAAOoC,GAAS,SAClB,OAAOb,GACLlF,EAAWyB,EAAcsE,CAAI,EAC7BpB,GAAclD,EAAcmD,CAAK,CACnC,EAEF,IAAMsB,EAAOH,IAAS,GAChBjE,EAAQiE,IAAS,GAAO,CAAE,KAAM,MAAO,GAAI,OAAQ,EAAIA,EACvDI,EAAanG,EAAWyB,EAAcK,EAAM,IAAI,EAChDsE,EAAWpG,EAAW0B,EAAYI,EAAM,EAAE,EAC1CuE,EAAUF,EAAW,GACrBG,EAAUF,EAAS,GACnB/D,EAAMgE,EAAQ,EACd/D,EAAM+D,EAAQ,EACd9D,EAAM+D,EAAQ,EACd9D,EAAM8D,EAAQ,EACpB,GAAIJ,EAAM,CACR,IAAIK,EAAU,EACVC,EAAU,EACd,GAAIL,EAAW,OAAQ,CACrB,IAAMrG,EAAKuG,EAAQ,EAAIF,EAAW,OAAO,EACnCpG,EAAKsG,EAAQ,EAAIF,EAAW,OAAO,EACnCvC,EAAM,KAAK,MAAM9D,EAAIC,CAAE,EACzB6D,EAAM,IACR2C,EAAUzG,EAAK8D,EACf4C,EAAUzG,EAAK6D,EAEnB,CACA,IAAM6C,EAAM9B,GAAclD,EAAcmD,CAAK,EACvC8B,EAAQ,CAACF,EACTG,EAAQJ,EACRK,GAAQP,EAAQ,EAAIC,EAAQ,GAAK,EAAII,EAAQD,EAC7CI,GAAQR,EAAQ,EAAIC,EAAQ,GAAK,EAAIK,EAAQF,EAC7CK,EAAOzE,EAAMkE,EAAUE,EACvBM,EAAOzE,EAAMkE,EAAUC,EACvBO,EAAOzE,EAAMgE,EAAUE,EACvBQ,EAAOzE,EAAMgE,EAAUC,EAC7B,MAAO,CACL,CACE,GAAIpE,EACJ,GAAIC,EACJ,IAAKwE,EACL,IAAKC,EACL,IAAKD,EAAOJ,EAAQD,EACpB,IAAKM,EAAOJ,EAAQF,EACpB,GAAIG,EACJ,GAAIC,CACN,EACA,CACE,GAAID,EACJ,GAAIC,EACJ,IAAKG,EAAON,EAAQD,EACpB,IAAKQ,EAAON,EAAQF,EACpB,IAAKO,EACL,IAAKC,EACL,GAAI1E,EACJ,GAAIC,CACN,CACF,CACF,KAAO,CACL,IAAM0E,EAAWf,EAAW,QAAU,CACpC,EAAGE,EAAQ,GAAKC,EAAQ,EAAID,EAAQ,GACpC,EAAGA,EAAQ,GAAKC,EAAQ,EAAID,EAAQ,EACtC,EACMc,EAASf,EAAS,QAAU,CAChC,EAAGE,EAAQ,GAAKD,EAAQ,EAAIC,EAAQ,GACpC,EAAGA,EAAQ,GAAKD,EAAQ,EAAIC,EAAQ,EACtC,EACMc,EAAO,KAAK,MAAM7E,EAAMF,EAAKG,EAAMF,CAAG,EACtC+E,EAAc,CAACC,GAAMlC,GAAImC,GAASC,KAAY,CAClD,IAAM1H,GAAKsF,GAAG,EAAIkC,GAAK,EACjBvH,GAAKqF,GAAG,EAAIkC,GAAK,EACjB1D,GAAM,KAAK,MAAM9D,GAAIC,EAAE,EACvBoD,GAAQS,KAAQ,EAAI,GAAK2D,GAAUzH,GAAK0H,GAAUzH,IAAM6D,GAC9D,OAAO,KAAK,IACV,EACA,KAAK,IAAIwD,EAAOhH,GAAqBC,GAAa8C,GAAQ,EAAG,CAC/D,CACF,EACMsE,EAAYnB,EAAQ,EAAID,EAAQ,EAChCqB,EAAYpB,EAAQ,EAAID,EAAQ,EAChC,CAACsB,EAAKC,CAAG,EAAIC,GACjBX,EAAS,EACTA,EAAS,EACTb,EAAQ,EACRA,EAAQ,EACRgB,EAAYH,EAAUb,EAASoB,EAAWC,CAAS,CACrD,EACM,CAACI,EAAKC,CAAG,EAAIF,GACjBV,EAAO,EACPA,EAAO,EACPb,EAAQ,EACRA,EAAQ,EACRe,EAAYF,EAAQb,EAAS,CAACmB,EAAW,CAACC,CAAS,CACrD,EACMM,EAAQhC,EAAS,OAAS5D,GAAUC,EAAKC,EAAKC,EAAKC,EAAKwD,EAAUtD,CAAM,EAAI,EAC5EuF,EAAWb,IAAS,EAAI,EAAIA,EAC5BxE,GAAML,EAAMF,GAAO4F,EACnBpF,GAAML,EAAMF,GAAO2F,EACnBC,EAAS,CAACrF,EAAKmF,EACfG,EAASvF,EAAKoF,EACdI,EAAUxF,EAAK,KAAK,IAAIoF,CAAK,EAC7BK,GAAUxF,EAAK,KAAK,IAAImF,CAAK,EACnC,MAAO,CACL,CACE,GAAI3F,EACJ,GAAIC,EACJ,IAAKqF,EAAMO,EAASE,EACpB,IAAKR,EAAMO,EAASE,GACpB,IAAKP,EAAMI,EAASE,EACpB,IAAKL,EAAMI,EAASE,GACpB,GAAI9F,EACJ,GAAIC,CACN,CACF,CACF,CACF,CACA,SAAS8F,GAAUrI,EAAUsI,EAAI,CAC/B,IAAMC,EAAQvI,EAAS,CAAC,EAClBwI,EAAMxI,EAAS,GAAG,EAAE,EAC1B,OAAO,KAAK,MAAMuI,EAAM,EAAID,EAAG,EAAGC,EAAM,EAAID,EAAG,CAAC,EAAI,KAAK,MAAME,EAAI,EAAIF,EAAG,EAAGE,EAAI,EAAIF,EAAG,CAAC,EAAI,QAAU,KACzG,CACA,SAASG,GAAiBjH,EAAcC,EAAYiH,EAAO7G,EAAO,CAChE,IAAMqE,EAAanG,EACjByB,EACAK,GAAO,MAAQwG,GAAU7G,EAAckH,EAAM,CAAC,CAAC,CACjD,EACMvC,EAAWpG,EACf0B,EACAI,GAAO,IAAMwG,GAAU5G,EAAYiH,EAAM,GAAG,EAAE,CAAC,CACjD,EACMtE,EAAS,CAAC8B,EAAW,GAAI,GAAGwC,EAAOvC,EAAS,EAAE,EAC9CwC,EAAWvJ,GAAM,CACrB,IAAM4D,EAAIoB,EAAOhF,CAAC,EACZ6B,EAAQ2H,GAAM,KAAK,MAAMA,EAAE,EAAI5F,EAAE,EAAG4F,EAAE,EAAI5F,EAAE,CAAC,EAC7CE,EAAQ,CAACkC,EAAQyD,IAAS,CAC9B,IAAMlF,EAAMyB,EAASnE,EAAKmE,CAAM,EAAI,EAC9BvC,EAAQ5B,EAAK4H,CAAI,EACvB,OAAOlF,IAAQ,EAAI,CAAE,EAAGkF,EAAK,EAAI7F,EAAE,EAAG,EAAG6F,EAAK,EAAI7F,EAAE,CAAE,EAAI,CACxD,GAAIA,EAAE,EAAIoC,EAAO,GAAKzB,EAAMd,EAC5B,GAAIG,EAAE,EAAIoC,EAAO,GAAKzB,EAAMd,CAC9B,CACF,EACA,GAAIzD,IAAM,EACR,OAAO8D,EAAMgD,EAAW,OAAQ9B,EAAO,CAAC,CAAC,EAE3C,GAAIhF,IAAMgF,EAAO,OAAS,EAAG,CAC3B,IAAMjF,EAAM+D,EAAMiD,EAAS,OAAQ/B,EAAOhF,EAAI,CAAC,CAAC,EAChD,MAAO,CAAE,EAAG,CAACD,EAAI,EAAG,EAAG,CAACA,EAAI,CAAE,CAChC,CACA,MAAO,CACL,GAAIiF,EAAOhF,EAAI,CAAC,EAAE,EAAIgF,EAAOhF,EAAI,CAAC,EAAE,GAAK,EACzC,GAAIgF,EAAOhF,EAAI,CAAC,EAAE,EAAIgF,EAAOhF,EAAI,CAAC,EAAE,GAAK,CAC3C,CACF,EACMP,EAAS,CAAC,EAChB,QAASO,EAAI,EAAGA,EAAIgF,EAAO,OAAS,EAAGhF,IAAK,CAC1C,IAAME,EAAI8E,EAAOhF,CAAC,EACZG,EAAI6E,EAAOhF,EAAI,CAAC,EAChB0J,EAAKH,EAAQvJ,CAAC,EACd2J,EAAKJ,EAAQvJ,EAAI,CAAC,EACxBP,EAAO,KAAK,CACV,GAAIS,EAAE,EACN,GAAIA,EAAE,EACN,IAAKA,EAAE,EAAIwJ,EAAG,EAAI,EAClB,IAAKxJ,EAAE,EAAIwJ,EAAG,EAAI,EAClB,IAAKvJ,EAAE,EAAIwJ,EAAG,EAAI,EAClB,IAAKxJ,EAAE,EAAIwJ,EAAG,EAAI,EAClB,GAAIxJ,EAAE,EACN,GAAIA,EAAE,CACR,CAAC,CACH,CACA,OAAOV,CACT,CClkBA,SAASmK,IAAW,CAClB,IAAMC,EAAwB,IAAI,QAClC,MAAO,CAACC,EAAKC,EAAMC,IAAY,CAC7B,IAAMC,EAAMJ,EAAM,IAAIC,CAAG,EACzB,GAAIG,GAAK,KAAK,SAAWF,EAAK,QAAUE,EAAI,KAAK,MAAM,CAACC,EAAGC,IAAM,OAAO,GAAGD,EAAGH,EAAKI,CAAC,CAAC,CAAC,EACpF,OAAOF,EAAI,MAEb,IAAMG,EAAQJ,EAAQ,EACtB,OAAAH,EAAM,IAAIC,EAAK,CAAE,KAAAC,EAAM,MAAAK,CAAM,CAAC,EACvBA,CACT,CACF,CCXA,IAAIC,GAAW,GACXC,GAAgB,IAChBC,EAAY,EAChB,SAASC,GAAWC,EAAM,CACxB,OAAOA,EAAK,OAASH,GAAgBC,EAAY,CACnD,CACA,SAASG,GAASC,EAAGC,EAAG,CACtB,OAAOD,EAAE,GAAKC,EAAE,IAAMD,EAAE,GAAKC,EAAE,IAAMD,EAAE,GAAKC,EAAE,IAAMD,EAAE,GAAKC,EAAE,EAC/D,CACA,SAASC,GAASC,EAAKC,EAAO,CAC5B,OAAOD,EAAI,IAAM,GAAKA,EAAI,IAAMC,EAAM,OAASD,EAAI,IAAM,GAAKA,EAAI,IAAMC,EAAM,MAChF,CACA,SAASC,GAAYF,EAAKC,EAAO,CAC/B,OAAOD,EAAI,IAAM,GAAKA,EAAI,IAAMC,EAAM,OAASD,EAAI,IAAM,GAAKA,EAAI,IAAMC,EAAM,MAChF,CACA,SAASE,GAAUF,EAAOG,EAAW,CAAC,EAAG,CACvC,IAAMC,EAAS,CAAC,GAAGD,CAAQ,EAC3B,OAAQJ,GACFD,GAASC,EAAKC,CAAK,GAAKI,EAAO,KAAMC,GAAMV,GAASU,EAAGN,CAAG,CAAC,EACtD,IAETK,EAAO,KAAKL,CAAG,EACR,GAEX,CACA,SAASO,GAAYC,EAAYP,EAAOQ,EAAM,CAC5C,IAAMC,EAAM,CAAC,EACPC,EAAMpB,GAAWE,EAAY,EAC7BmB,EAAY,CAAC,EAAGjB,EAAMkB,EAAMC,IAAc,CAC9C,IAAMC,EAAIrB,GAAWC,CAAI,EACrBqB,EAAU,GACd,QAASC,EAAQ,EAAGA,IAAU,EAAE,OAAS,GAAIA,IAAS,CACpD,IAAMC,EAAIL,EAAOC,EAAYG,EAAQN,EAC/BX,EAAM,CACV,GAAI,EAAE,EAAIe,EAAI,EACd,GAAI,EAAE,EAAIA,EAAI,EACd,GAAIG,EAAI3B,GAAWE,EACnB,GAAIyB,EAAIzB,CACV,EACA,GAAIM,GAASC,EAAKC,CAAK,EACrB,MAEF,GAAIC,GAAYF,EAAKC,CAAK,IAAM,EAAE,OAAOD,CAAG,GAAK,IAAO,CACtD,GAAIS,EAAKT,CAAG,EACV,MAAO,CAAE,OAAQ,CAAE,GAAG,EAAG,KAAAL,EAAM,EAAAuB,EAAG,EAAAH,CAAE,EAAG,QAAAC,CAAQ,EAEjDA,EAAU,EACZ,CACF,CACA,MAAO,CAAE,OAAQ,OAAQ,QAAAA,CAAQ,CACnC,EACMG,EAAQ,CAAC,EAAGxB,IAAS,CACzB,IAAMyB,EAAQR,EAAU,EAAGjB,EAAM,EAAE,EAAG,EAAE,EAAIM,EAAM,OAAS,EAAI,GAAK,CAAC,EACrE,OAAOmB,EAAM,SAAW,EAAE,QAAU,QAAUA,EAAM,QAAU,OAASR,EAAU,EAAGjB,EAAM,EAAE,MAAO,EAAE,MAAQ,EAAE,EAAI,GAAK,CAAC,EAAE,OAC7H,EACA,QAAW,KAAKa,EAAY,CAC1B,IAAMH,EAASc,EAAM,EAAG,EAAE,IAAI,IAAM,EAAE,WAAa,OAAS,OAASA,EAAM,EAAG,EAAE,QAAQ,GACpFd,GACFK,EAAI,KAAKL,CAAM,CAEnB,CACA,OAAOK,CACT,CCnDA,SAASW,GAAKC,EAAQ,CACpB,OAAOA,IAAW,IAAM,IAAM,GAChC,CACA,SAASC,GAAUC,EAAOC,EAAwB,IAAI,IAAO,CAC3D,IAAMC,EAAQF,EAAM,MAAM,IAAIG,CAAW,EACnCC,EAAqB,IAAI,IACzBC,EAAS,CAACC,EAAIC,EAAMC,IAAO,CAC/BC,GAAOL,EAAI,GAAGE,CAAE,IAAIC,CAAI,GAAIC,CAAE,CAChC,EACAR,EAAM,MAAM,QAAQ,CAACU,EAAMF,IAAO,CAChCH,EAAOK,EAAK,KAAMR,EAAMM,CAAE,EAAE,KAAMA,CAAE,EACpCH,EAAOK,EAAK,GAAIR,EAAMM,CAAE,EAAE,GAAIA,CAAE,CAClC,CAAC,EACD,IAAMG,EAAaC,GAAM,CACvB,IAAMC,EAAMT,EAAG,IAAI,GAAGQ,CAAC,MAAM,EAC7B,GAAIC,GAAK,SAAW,EAClB,OAEF,IAAML,EAAKK,EAAI,CAAC,EACVH,EAAOV,EAAM,MAAMQ,CAAE,EAC3B,OAAOE,EAAK,OAASE,GAAKF,EAAK,KAAOE,GAAK,CAACX,EAAM,IAAIW,CAAC,GAAK,CAACX,EAAM,IAAIS,EAAK,EAAE,GAAKR,EAAMM,CAAE,EAAE,OAAS,OAASN,EAAMM,CAAE,EAAE,KAAO,SAAWJ,EAAG,IAAI,GAAGM,EAAK,EAAE,QAAQ,GAAG,SAAW,EAAIF,EAAK,MAC7L,EACMM,EAAyB,IAAI,IAC7BC,EAAwB,IAAI,IAC5BC,EAAuB,IAAI,IACjC,QAAWC,KAAQjB,EAAM,MAAO,CAC9B,IAAMkB,EAAOd,EAAG,IAAI,GAAGa,EAAK,EAAE,QAAQ,EAChCE,EAAOD,GAAM,SAAW,EAAIlB,EAAM,MAAMkB,EAAK,CAAC,CAAC,EAAE,KAAO,OAC9D,GAAIH,EAAM,IAAIE,EAAK,EAAE,GAAKE,IAAS,QAAUR,EAAUQ,CAAI,IAAMD,EAAK,CAAC,EACrE,SAEF,IAAME,EAAM,CAACH,EAAK,EAAE,EACpB,OAAW,CACT,IAAMT,EAAKG,EAAUS,EAAI,GAAG,EAAE,CAAC,EACzBC,EAAOb,IAAO,OAAS,OAASR,EAAM,MAAMQ,CAAE,EAAE,GACtD,GAAIa,IAAS,QAAUN,EAAM,IAAIM,CAAI,EACnC,MAEFP,EAAO,IAAIN,CAAE,EACbY,EAAI,KAAKC,CAAI,CACf,CACA,QAAWf,KAAMc,EACfL,EAAM,IAAIT,EAAIW,EAAK,EAAE,EAEnBG,EAAI,OAAS,GACfJ,EAAK,IAAIC,EAAK,GAAIG,CAAG,CAEzB,CACA,QAAWH,KAAQjB,EAAM,MAClBe,EAAM,IAAIE,EAAK,EAAE,GACpBF,EAAM,IAAIE,EAAK,GAAIA,EAAK,EAAE,EAG9B,IAAMK,EAAO,IAAI,IAAItB,EAAM,MAAM,IAAKuB,GAAM,CAACA,EAAE,GAAIA,CAAC,CAAC,CAAC,EAChDC,EAAQ,CAAC,EACf,QAAWP,KAAQjB,EAAM,MAAO,CAC9B,GAAIe,EAAM,IAAIE,EAAK,EAAE,IAAMA,EAAK,GAC9B,SAEF,IAAMG,EAAMJ,EAAK,IAAIC,EAAK,EAAE,EAC5B,GAAI,CAACG,EAAK,CACRI,EAAM,KAAKP,CAAI,EACf,QACF,CACA,IAAMQ,EAAUL,EAAI,IAAKd,GAAOgB,EAAK,IAAIhB,CAAE,CAAC,EACtCoB,EAAWD,EAAQ,OAAOE,CAAU,EACpCC,EAAQF,EAAS,OAASA,EAAS,OAAO,CAACd,EAAGiB,IAAMjB,EAAE,OAAO,OAASiB,EAAE,OAAO,MAAQjB,EAAIiB,CAAC,EAAIJ,EAAQ,CAAC,EAC/GD,EAAM,KAAK,CACT,GAAIP,EAAK,GACT,KAAMA,EAAK,KACX,OAAQQ,EAAQ,OAAO,CAACK,EAAKP,IAAMO,EAAMP,EAAE,OAAQ,CAAC,EACpD,MAAON,EAAK,MACZ,OAAQW,EAAM,MAChB,CAAC,CACH,CACA,IAAMG,EAAuB,IAAI,IAC3BC,EAAQ,CAAC,EACf,OAAAhC,EAAM,MAAM,QAAQ,CAACU,EAAMF,IAAO,CAChC,IAAMyB,EAAOlB,EAAM,IAAIL,EAAK,IAAI,EAC1BwB,EAAKnB,EAAM,IAAIL,EAAK,EAAE,EACtBH,EAAOL,EAAMM,CAAE,EACf2B,EAAM,GAAGF,CAAI,IAAI1B,EAAK,IAAI,IAAI2B,CAAE,IAAI3B,EAAK,EAAE,GAC7CO,EAAO,IAAIN,CAAE,GAAKuB,EAAK,IAAII,CAAG,IAGlCJ,EAAK,IAAII,CAAG,EACZH,EAAM,KAAK,CACT,KAAAC,EACA,GAAAC,EACA,GAAG3B,EAAK,OAAS,QAAU,CAAE,WAAYV,GAAKuC,EAAUH,CAAI,CAAC,CAAE,EAAI,CAAC,EACpE,GAAG1B,EAAK,KAAO,MAAQ,CAAE,SAAUV,GAAKuC,EAAUF,CAAE,CAAC,CAAE,EAAI,CAAC,CAC9D,CAAC,EACH,CAAC,EACM,CACL,MAAO,CAAE,GAAGlC,EAAO,MAAAwB,EAAO,MAAAQ,EAAO,MAAO,OAAQ,WAAY,MAAO,EACnE,KAAAhB,CACF,CACF,CACA,SAASqB,GAAUC,EAAWtB,EAAMuB,EAAU,CAC5C,IAAM1B,EAAM,CAAE,GAAGyB,CAAU,EAC3B,OAAW,CAAChC,EAAImB,CAAO,IAAKT,EAAM,CAChC,IAAMwB,EAAOF,EAAUhC,CAAE,EACzB,GAAI,CAACkC,GAAM,OACT,SAEF,OAAO3B,EAAIP,CAAE,EACb,IAAMmC,EAAMC,GAAUF,CAAI,EACpBG,EAAQF,EAAI,GAAG,EAAE,EACjBG,EAAUnB,EAAQ,IAAKoB,GAAM,KAAK,IAAIN,EAASM,CAAC,EAAG,CAAC,CAAC,EACrDC,EAAYF,EAAQ,OAAO,CAAChC,EAAGiB,IAAMjB,EAAIiB,EAAG,CAAC,EAC/CI,EAAO,EACXR,EAAQ,QAAQ,CAACsB,EAAQC,IAAM,CAC7B,IAAMC,EAAQH,EAAYF,EAAQI,CAAC,EAAIF,EAAYH,EAAQA,EAAQlB,EAAQ,OACrES,EAAKc,IAAMvB,EAAQ,OAAS,EAAIkB,EAAQV,EAAOgB,EACrDpC,EAAIkC,CAAM,EAAIG,GAAMV,EAAMC,EAAKR,EAAMC,CAAE,EACvCD,EAAOC,CACT,CAAC,CACH,CACA,OAAOrB,CACT,CACA,SAASsC,GAAcX,EAAMP,EAAMC,EAAI,CACrC,GAAIM,EAAK,SAAW,EAClB,MAAO,CAAC,EAEV,IAAMC,EAAMC,GAAUF,CAAI,EACpBG,EAAQF,EAAI,GAAG,EAAE,EACvB,OAAOS,GAAMV,EAAMC,EAAKR,EAAOU,EAAOT,EAAKS,CAAK,CAClD,CACA,SAASS,GAAiBZ,EAAM,CAC9B,IAAMC,EAAMC,GAAUF,CAAI,EAC1B,OAAOa,GAAQb,EAAMC,EAAKA,EAAI,GAAG,EAAE,EAAI,CAAC,CAC1C,CACA,SAASC,GAAUF,EAAM,CACvB,IAAMC,EAAM,CAAC,CAAC,EACd,QAASa,EAAI,EAAGA,EAAId,EAAK,OAAQc,IAC/Bb,EAAI,KACFA,EAAIa,EAAI,CAAC,EAAI,KAAK,MAAMd,EAAKc,CAAC,EAAE,EAAId,EAAKc,EAAI,CAAC,EAAE,EAAGd,EAAKc,CAAC,EAAE,EAAId,EAAKc,EAAI,CAAC,EAAE,CAAC,CAC9E,EAEF,OAAOb,CACT,CACA,SAASc,GAAcd,EAAKe,EAAG,CAC7B,IAAIC,EAAK,EACLC,EAAKjB,EAAI,OACb,KAAOgB,EAAKC,GAAI,CACd,IAAMC,EAAMF,EAAKC,GAAM,EACnBjB,EAAIkB,CAAG,EAAIH,EACbC,EAAKE,EAAM,EAEXD,EAAKC,CAET,CACA,OAAOF,CACT,CACA,SAASJ,GAAQb,EAAMC,EAAKe,EAAG,CAC7B,GAAIA,GAAK,EACP,MAAO,CAAE,GAAGhB,EAAK,CAAC,CAAE,EAEtB,IAAMc,EAAIC,GAAcd,EAAKe,CAAC,EAC9B,GAAIF,GAAKb,EAAI,OACX,MAAO,CAAE,GAAGD,EAAK,GAAG,EAAE,CAAE,EAE1B,IAAMoB,EAAOnB,EAAIa,CAAC,EAAIb,EAAIa,EAAI,CAAC,EACzBO,EAAID,EAAO,GAAKJ,EAAIf,EAAIa,EAAI,CAAC,GAAKM,EAAO,EACzC,EAAIpB,EAAKc,EAAI,CAAC,EACdzB,EAAIW,EAAKc,CAAC,EAChB,MAAO,CAAE,EAAG,EAAE,GAAKzB,EAAE,EAAI,EAAE,GAAKgC,EAAG,EAAG,EAAE,GAAKhC,EAAE,EAAI,EAAE,GAAKgC,CAAE,CAC9D,CACA,SAASX,GAAMV,EAAMC,EAAKR,EAAMC,EAAI,CAClC,IAAM4B,EAAS,CAACT,GAAQb,EAAMC,EAAKR,CAAI,CAAC,EACxC,QAASqB,EAAIC,GAAcd,EAAKR,CAAI,EAAGqB,EAAId,EAAK,QAAUC,EAAIa,CAAC,EAAIpB,EAAIoB,IACjEb,EAAIa,CAAC,EAAIrB,GACX6B,EAAO,KAAK,CAAE,GAAGtB,EAAKc,CAAC,CAAE,CAAC,EAG9B,OAAAQ,EAAO,KAAKT,GAAQb,EAAMC,EAAKP,CAAE,CAAC,EAC3B4B,CACT,CChLA,SAASC,GAAaC,EAAOC,EAAQ,CACnC,IAAMC,EAAW,IAAI,IACnBF,EAAM,MAAM,OAAQG,GAAMC,EAAWD,CAAC,GAAKE,EAAeF,EAAGF,CAAM,CAAC,EAAE,IAAKE,GAAMA,EAAE,EAAE,CACvF,EACMG,EAAQN,EAAM,OAAS,CAAC,EAC9B,GAAIE,EAAS,OAAS,GAAKI,EAAM,SAAW,EAC1C,OAAON,EAET,IAAMO,EAAQD,EAAM,IAAKE,GAAS,CAChC,IAAIC,EAAQ,GACRC,EAAO,GACX,OAAAF,EAAK,QAAQ,QAAQ,CAACG,EAAIC,IAAM,CAC1BV,EAAS,IAAIS,CAAE,IACbF,EAAQ,IACVA,EAAQG,GAEVF,EAAOE,EAEX,CAAC,EACMH,EAAQ,EAAI,OAAS,CAAE,MAAAA,EAAO,KAAAC,CAAK,CAC5C,CAAC,EACD,GAAIH,EAAM,MACR,CAACM,EAAMD,IAAMC,GAAM,QAAU,GAAKA,EAAK,OAASP,EAAMM,CAAC,EAAE,QAAQ,OAAS,CAC5E,EACE,OAAOZ,EAET,IAAMc,EAAuB,IAAI,IAC3BC,EAAU,CAAC,EACXC,EAA4B,IAAI,IACtC,OAAAV,EAAM,QAAQ,CAACE,EAAMI,IAAM,CACzB,IAAMC,EAAON,EAAMK,CAAC,EACpB,GAAIC,EAAM,CACR,IAAMI,EAAUT,EAAK,QAAQ,MAAMK,EAAK,MAAOA,EAAK,KAAO,CAAC,EAC5D,QAAWF,KAAMM,EACfH,EAAK,IAAIH,CAAE,EAEbI,EAAQ,KAAK,CAAE,GAAGP,EAAM,QAAAS,CAAQ,CAAC,EACjCD,EAAU,IAAIR,EAAK,KAAM,CAAE,MAAOK,EAAK,MAAO,QAAAI,CAAQ,CAAC,CACzD,CACF,CAAC,EACM,CACL,GAAGjB,EACH,MAAOA,EAAM,MAAM,OAAQG,GAAMW,EAAK,IAAIX,EAAE,EAAE,CAAC,EAC/C,MAAOH,EAAM,MAAM,OAAQkB,GAAMJ,EAAK,IAAII,EAAE,IAAI,GAAKJ,EAAK,IAAII,EAAE,EAAE,CAAC,EACnE,MAAOH,EACP,WAAYf,EAAM,YAAcmB,GAC9BnB,EAAM,WACNM,EACAC,EACA,IAAI,IAAIP,EAAM,MAAM,IAAKG,GAAM,CAACA,EAAE,GAAIA,EAAE,IAAI,CAAC,CAAC,CAChD,EACA,YAAaiB,GAAYpB,EAAOgB,CAAS,CAC3C,CACF,CACA,SAASG,GAAWE,EAAQf,EAAOC,EAAOe,EAAQ,CAChD,IAAMC,EAAOF,EAAO,OAAO,EACrBG,EAAM,IAAIC,GAChB,OAAAnB,EAAM,QAAQ,CAACE,EAAMkB,IAAM,CACzB,IAAMC,EAASN,EAAO,UAAUO,EAAWpB,EAAK,IAAI,EAAE,IAAI,EACpDK,EAAON,EAAMmB,CAAC,EACpBlB,EAAK,QAAQ,QAAQ,CAACG,EAAIC,IAAM,CAC9B,IAAMiB,EAAUP,EAAO,IAAIX,CAAE,GAAKA,EAC5BmB,EAAKP,EAAKF,EAAO,KAAKQ,CAAO,EAAGF,CAAM,EACxCG,GAAM,GAAKjB,GAAQD,GAAKC,EAAK,OAASD,GAAKC,EAAK,MAClDW,EAAI,IACFK,EACAR,EAAO,MAAMM,CAAM,EACnBN,EAAO,QAAQM,CAAM,EACrBN,EAAO,MAAMS,CAAE,EACfT,EAAO,SAASS,CAAE,IAAM,CAC1B,CAEJ,CAAC,CACH,CAAC,EACMN,EAAI,MAAM,CACnB,CACA,SAASO,GAAa/B,EAAOC,EAAQ+B,EAAS,CAC5C,IAAMC,EAAQjC,EAAM,MAAM,IAAKkC,GAAS,CACtC,GAAI,CAAC9B,EAAW8B,CAAI,EAClB,OAAOA,EAET,IAAMC,EAAOD,EAAK,OAAO,MACnBE,EAAKD,EAAOD,EAAK,OACjB,CAACG,EAAOC,CAAG,EAAIjC,EAAe6B,EAAMjC,CAAM,EAAI,CAAC,KAAK,IAAIkC,EAAMlC,EAAO,KAAK,EAAG,KAAK,IAAImC,EAAInC,EAAO,GAAG,CAAC,EAAImC,GAAMnC,EAAO,MAAQ,CAAC,KAAK,IAAIkC,EAAMC,EAAKJ,CAAO,EAAGI,CAAE,EAAI,CAACD,EAAM,KAAK,IAAIC,EAAID,EAAOH,CAAO,CAAC,EAC5M,OAAOK,IAAUF,GAAQG,IAAQF,EAAKF,EAAO,CAC3C,GAAGA,EACH,OAAQI,EAAMD,EACd,OAAQ,CAAE,GAAGH,EAAK,OAAQ,MAAAG,CAAM,EAChC,UAAW,CAAE,MAAOF,EAAM,OAAQD,EAAK,MAAO,CAChD,CACF,CAAC,EACD,OAAOD,EAAM,KAAK,CAACC,EAAMtB,IAAMsB,IAASlC,EAAM,MAAMY,CAAC,CAAC,EAAI,CAAE,GAAGZ,EAAO,MAAAiC,CAAM,EAAIjC,CAClF,CACA,SAASuC,GAAUvC,EAAO,CACxB,OAAOA,EAAM,MAAM,KAAM,GAAM,EAAE,SAAS,EAAI,CAC5C,GAAGA,EACH,MAAOA,EAAM,MAAM,IACjB,CAAC,CAAE,UAAWwC,EAAM,GAAGN,CAAK,IAAMM,GAAQN,EAAK,OAAS,CACtD,GAAGA,EACH,OAAQM,EAAK,OACb,OAAQ,CAAE,GAAGN,EAAK,OAAQ,MAAOM,EAAK,KAAM,CAC9C,EAAIN,CACN,CACF,EAAIlC,CACN,CC7FA,IAAIyC,GAAkB,EAClBC,GAAeC,GAAc,SAASA,GAAa,eAAe,yBACtE,SAASC,GAAeC,EAAeC,EAAU,CAC/C,OAAOA,EAAS,QAASC,GAAOF,EAAcE,CAAE,GAAK,CAAC,CAAC,CACzD,CACA,SAASC,GAAaH,EAAeI,EAAMC,EAAMJ,EAAUK,EAAOC,EAAU,CAC1E,IAAMC,EAAOR,EAAcI,EAAK,IAAI,EAC9BK,EAAKT,EAAcI,EAAK,EAAE,EAChC,GAAI,GAACI,GAAM,QAAU,CAACC,GAAI,QAG1B,OAAOH,EAAQI,GACbF,EACAC,EACAH,EACAC,EAAWI,EAAYP,CAAI,EAAI,MACjC,EAAIQ,GACFJ,EACAC,EACAI,GAAWT,EAAMG,CAAQ,EACzBF,EACAJ,EAAWF,GAAeC,EAAeC,CAAQ,EAAI,CAAC,CACxD,CACF,CACA,SAASa,GAAmBC,EAAO,CACjC,IAAMC,EAAaC,GACjBF,EAAM,MAAM,OAAOG,CAAU,EAC5BC,GAASA,EAAK,OAAO,OACxB,EACA,QAAWC,KAAQJ,EAAW,OAAO,EACnCI,EAAK,KAAK,CAACC,EAAGC,IAAMD,EAAE,OAAO,MAAQC,EAAE,OAAO,KAAK,EAErD,OAAON,CACT,CACA,SAASO,GAAcC,EAAOC,EAAOC,EAAK,CACxC,IAAMzB,EAAW,CAAC,EAClB,GAAIuB,EACF,QAASG,EAAIC,GAAmBJ,EAAOC,CAAK,EAAGE,EAAIH,EAAM,OAAQG,IAAK,CACpE,IAAMR,EAAOK,EAAMG,CAAC,EACpB,GAAIR,EAAK,OAAO,OAASO,EACvB,MAEEP,EAAK,OAAO,MAAQA,EAAK,QAAUO,GACrCzB,EAAS,KAAKkB,EAAK,EAAE,CAEzB,CAEF,OAAOlB,CACT,CACA,SAAS4B,GAAazB,EAAMI,EAAMC,EAAIqB,EAAU,CAC9C,GAAM,CAAE,WAAAC,EAAY,SAAAC,CAAS,EAAI5B,EACjC,GAAI2B,IAAe,QAAUC,IAAa,OACxC,MAAO,GAET,IAAMC,EAAcF,KAAgBvB,EAAK,OAAO,QAAU,KACpD0B,EAAcF,KAAcvB,EAAG,OAAO,QAAU,KACtD,OAAOqB,EAAWG,GAAeC,EAAc,CAACD,GAAe,CAACC,CAClE,CACA,SAASC,GAAY/B,EAAMI,EAAMC,EAAI2B,EAAU,CAC7C,IAAIC,EACJ,QAAWhB,KAAKe,EAAS5B,CAAI,EAC3B,QAAWc,KAAKc,EAAS3B,CAAE,EAAG,CAC5B,IAAMqB,EAAWT,GAAKC,EAChBgB,EAAOR,EAAW,CAAE,MAAOT,EAAIb,EAAK,OAAQ,IAAKc,CAAE,EAAI,CAAE,MAAOA,EAAIb,EAAG,OAAQ,IAAKY,CAAE,EACxFQ,GAAazB,EAAMI,EAAMC,EAAIqB,CAAQ,IAAM,CAACO,GAAQ,KAAK,IAAIC,EAAK,IAAMA,EAAK,KAAK,EAAI,KAAK,IAAID,EAAK,IAAMA,EAAK,KAAK,KACtHA,EAAOC,EAEX,CAEF,OAAOD,CACT,CACA,IAAIE,GAAoB,IACxB,SAASC,GAAaC,EAAUL,EAAU,CACxC,IAAMpB,EAA6B,IAAI,IACvC,OAAW,CAAC0B,EAASlB,CAAK,IAAKiB,EAAU,CACvC,IAAME,EAASnB,EAAM,QAASL,GAAS,CACrC,IAAMyB,EAASR,EAASjB,CAAI,EAC5B,OAAOyB,EAAO,MAAM,CAAC,EAAE,IAAI,CAACC,EAAMlB,KAAO,CACvC,GAAIiB,EAAOjB,CAAC,EACZ,KAAMkB,EAAOD,EAAOjB,CAAC,CACvB,EAAE,CACJ,CAAC,EACGgB,EAAO,QACT3B,EAAW,IACT0B,EACAC,EAAO,KAAK,CAAC,EAAGrB,IAAM,EAAE,GAAKA,EAAE,EAAE,CACnC,CAEJ,CACA,OAAON,CACT,CACA,SAAS8B,GAAaH,EAAQlB,EAAOsB,EAAI,CACvC,GAAI,CAACJ,EACH,MAAO,GAET,IAAMhB,EAAIqB,GAAeL,EAAO,OAASM,GAAMN,EAAOM,CAAC,EAAE,GAAKxB,CAAK,EAC7DyB,EAAO,CAACP,EAAOhB,EAAI,CAAC,EAAGgB,EAAOhB,CAAC,CAAC,EAAE,OAAQwB,GAAMA,IAAM,MAAM,EAAE,KAAK,CAAC9B,EAAGC,IAAM,KAAK,IAAID,EAAE,GAAKI,CAAK,EAAI,KAAK,IAAIH,EAAE,GAAKG,CAAK,CAAC,EAAE,CAAC,EACrI,OAAOyB,IAAS,QAAU,KAAK,IAAIA,EAAK,GAAKzB,CAAK,GAAKyB,EAAK,MAAQ,KAAK,IAAIH,EAAKG,EAAK,IAAI,GAAKA,EAAK,KAAOX,EAC9G,CACA,SAASa,GAAcC,EAAK,CAC1B,IAAMtC,EAAQuC,GAAUD,CAAG,EACrBE,EAAO,IAAI,IAAIxC,EAAM,MAAM,IAAKyC,GAAM,CAACA,EAAE,GAAIA,CAAC,CAAC,CAAC,EAChDf,EAAW3B,GAAmBC,CAAK,EACnCqB,EAAWqB,GAAqB1C,CAAK,EACrC4B,EAASH,GAAaC,EAAUL,CAAQ,EACxCsB,EAAQ,CAAC,EACf,QAASC,EAAY,EAAGA,EAAY5C,EAAM,MAAM,OAAQ4C,IAAa,CACnE,IAAMvD,EAAOW,EAAM,MAAM4C,CAAS,EAC5BnD,EAAO+C,EAAK,IAAInD,EAAK,IAAI,EACzBK,EAAK8C,EAAK,IAAInD,EAAK,EAAE,EAC3B,GAAI,CAACA,EAAK,YAAcI,IAAS,QAAUC,IAAO,QAAUS,EAAWV,CAAI,GAAKU,EAAWT,CAAE,GAAKD,EAAK,OAAO,UAAYC,EAAG,OAAO,QAAS,CAC3I,IAAM6B,EAAOH,GAAY/B,EAAMI,EAAMC,EAAI2B,CAAQ,EAC3CM,EAAUlC,EAAK,OAAO,QACtBuC,EAAKT,EAAOA,EAAK,IAAMA,EAAK,MAAQ,EAC1C,GAAIA,GAAQS,GAAMnD,IAAmB,CAACkD,GAAaH,EAAO,IAAID,CAAO,EAAGJ,EAAK,MAAOS,CAAE,EAAG,CACvF,GAAM,CAAE,MAAAtB,EAAO,IAAAC,CAAI,EAAIY,EACvBoB,EAAM,KAAK,CACT,UAAAC,EACA,KAAMvD,EAAK,KACX,GAAIA,EAAK,GACT,GAAGA,EAAK,WAAa,CAAE,WAAYA,EAAK,UAAW,EAAI,CAAC,EACxD,GAAGA,EAAK,SAAW,CAAE,SAAUA,EAAK,QAAS,EAAI,CAAC,EAClD,QAAAsC,EACA,MAAAjB,EACA,IAAAC,EACA,GAAAqB,EACA,SAAUxB,GAAckB,EAAS,IAAIC,CAAO,EAAGjB,EAAOC,CAAG,CAC3D,CAAC,CACH,CACF,CACF,CACA,OAAOgC,CACT,CACA,SAASE,GAAkB7C,EAAO8C,EAAW,CAC3C,IAAMC,EAAyB,IAAI,IAC7BC,EAAQ7D,GAAO,CACnB,IAAI8D,EAAI9D,EACR,KAAO4D,EAAO,IAAIE,CAAC,GACjBA,EAAIF,EAAO,IAAIE,CAAC,EAElB,OAAIA,IAAM9D,GACR4D,EAAO,IAAI5D,EAAI8D,CAAC,EAEXA,CACT,EACMC,EAAO,CAAC,EAAG3C,IAAM,CACrB,GAAM,CAAC4C,EAAIC,CAAE,EAAI,CAACJ,EAAK,CAAC,EAAGA,EAAKzC,CAAC,CAAC,EAClC,OAAI4C,IAAOC,GACTL,EAAO,IAAII,EAAIC,CAAE,EAEZD,IAAOC,CAChB,EACMC,EAAa,IAAI,IAAIP,EAAU,IAAKQ,GAAMA,EAAE,SAAS,CAAC,EAC5D,OAAAtD,EAAM,MAAM,QAAQ,CAACuD,EAAGC,IAAO,CACxBH,EAAW,IAAIG,CAAE,GACpBN,EAAKK,EAAE,KAAMA,EAAE,EAAE,CAErB,CAAC,EACM,IAAI,IACTT,EAAU,OAAQQ,GAAM,CAACJ,EAAKI,EAAE,KAAMA,EAAE,EAAE,CAAC,EAAE,IAAKA,GAAMA,EAAE,SAAS,CACrE,CACF,CACA,SAASG,GAAgBC,EAAOC,EAAM,CACpC,OAAOA,GAAM,MAAM,OAASD,EAAM,OAAQJ,GAAM,CAACK,EAAK,YAAY,IAAIL,EAAE,SAAS,CAAC,EAAII,CACxF,CACA,IAAIE,GAA2B,IAAI,QACnC,SAASC,GAAgB7D,EAAO8C,EAAWgB,EAAO,GAAM,CACtD,IAAIC,EAASH,GAAS,IAAId,CAAS,EAC9BiB,IACHA,EAAyB,IAAI,IAC7BH,GAAS,IAAId,EAAWiB,CAAM,GAEhC,IAAIC,EAAUD,EAAO,IAAID,CAAI,EAC7B,GAAI,CAACE,EAAS,CACZ,IAAMC,EAASH,EAAuB,IAAI,IAAQjB,GAAkB7C,EAAO8C,CAAS,EACpFkB,EAAU,CACR,MAAOlB,EAAU,OAAQQ,GAAM,CAACW,EAAO,IAAIX,EAAE,SAAS,CAAC,EACvD,SAAU,IAAI,IAAIR,EAAU,IAAKQ,GAAM,CAACA,EAAE,UAAWA,EAAE,QAAQ,CAAC,CAAC,EACjE,OAAAW,CACF,EACAF,EAAO,IAAID,EAAME,CAAO,CAC1B,CACA,OAAOA,CACT,CC3LA,IAAIE,GAAwB,GACxBC,GAAoB,IACpBC,GAAkB,EAClBC,GAAgB,EAChBC,GAAgB,IAChBC,GAAe,EACfC,GAAkB,GAClBC,EAAe,EACfC,EAAqB,EACzB,SAASC,EAAeC,EAAM,CAC5B,OAAQA,EAAK,OAASN,GAAgBC,GAAeE,GAAgB,CACvE,CACA,IAAII,GAAqBL,GAAkBC,GAAgB,EACvDK,GAAuBH,EAAe,MAAM,EAChD,SAASI,EAAMC,EAAOC,EAAGC,EAAG,CAC1B,MAAO,CACL,GAAID,EAAID,EACR,GAAIC,EAAID,EACR,GAAIE,EAAIL,EACR,GAAIK,EAAIL,CACV,CACF,CACA,SAASM,GAAYP,EAAMQ,EAAS,CAClC,MAAO,CACL,GAAI,EACJ,GAAI,EAAIC,GAAWT,CAAI,EAAIH,EAC3B,GAAIW,EAAU,EAAIX,EAAe,EACjC,GAAIW,EAAU,EAAIX,EAAe,CACnC,CACF,CACA,SAASa,EAAMC,EAAGC,EAAIC,EAAI,CACxB,OAAOA,EAAKD,EAAKD,EAAI,KAAK,IAAI,KAAK,IAAIA,EAAGC,CAAE,EAAGC,CAAE,CACnD,CACA,SAASC,GAAYC,EAAG,CACtB,OAAO,OAAOA,CAAC,EAAE,QAAQ,mBAAoB,GAAG,CAClD,CACA,SAASC,GAASC,EAAI,CACpB,GAAM,CAACC,EAAOC,CAAI,EAAIF,GAAM,OAAS,CAACA,EAAK,IAAK,IAAI,EAAIA,GAAM,IAAM,CAACA,EAAK,IAAK,IAAI,EAAI,CAAC,EACxF,OAAIC,IAAU,OACL,GAAGD,CAAE,MAEP,GAAG,CAACC,EAAM,QAAQA,GAAS,IAAM,EAAI,CAAC,CAAC,IAAIC,CAAI,EACxD,CACA,SAASC,GAAaH,EAAI,CACxB,MAAO,GAAGD,GAASC,CAAE,CAAC,MACxB,CACA,SAASI,GAAWC,EAAQC,EAAMC,EAAQC,EAAQ,CAChD,IAAMC,EAAQJ,EAAO,CAAC,EAChBK,EAAOL,EAAOA,EAAO,OAAS,CAAC,EAC/BM,GAAML,EAAK,GAAKG,EAAM,GAAKC,EAAK,IAAM,GAAKH,EAC3CK,GAAMN,EAAK,GAAKG,EAAM,GAAKC,EAAK,IAAM,GAAKF,EAC3CK,EAAM,KAAK,MAAMF,EAAIC,CAAE,EAC7B,OAAOC,IAAQ,EAAI,CAAE,EAAG,EAAG,EAAG,EAAG,EAAI,CAAE,EAAGF,EAAKE,EAAK,EAAGD,EAAKC,CAAI,CAClE,CACA,SAASC,GAAWC,EAAKC,EAAK,CAC5B,OAAO,KAAK,IAAIA,EAAI,CAAC,GAAKD,EAAI,GAAKA,EAAI,IAAM,EAAI,KAAK,IAAIC,EAAI,CAAC,GAAKD,EAAI,GAAKA,EAAI,IAAM,CACzF,CACA,SAASE,GAAeF,EAAKC,EAAK,CAChC,IAAM7B,GAAS4B,EAAI,GAAKA,EAAI,IAAM,EAC5BG,GAASH,EAAI,GAAKA,EAAI,IAAM,EAClC,OAAO,KAAK,IACVC,EAAI,IAAM,EAAI,IAAW7B,EAAQ,KAAK,IAAI6B,EAAI,CAAC,EAC/CA,EAAI,IAAM,EAAI,IAAWE,EAAQ,KAAK,IAAIF,EAAI,CAAC,CACjD,CACF,CACA,SAASG,GAAUC,EAASC,EAAe,CACzC,IAAIC,EAAO,IACPC,EAAO,IACPC,EAAO,KACPC,EAAO,KACX,QAAWC,KAAMN,EACf,QAAWO,KAAKN,EAAcK,CAAE,GAAK,CAAC,EACpCJ,EAAO,KAAK,IAAIA,EAAMK,EAAE,CAAC,EACzBH,EAAO,KAAK,IAAIA,EAAMG,EAAE,CAAC,EACzBJ,EAAO,KAAK,IAAIA,EAAMI,EAAE,CAAC,EACzBF,EAAO,KAAK,IAAIA,EAAME,EAAE,CAAC,EAG7B,OAAOL,IAAS,IAAW,OAAS,CAAE,KAAAA,EAAM,KAAAC,EAAM,KAAAC,EAAM,KAAAC,CAAK,CAC/D,CACA,IAAIG,GAAiBC,GAAS,EAC9B,SAASC,GAAWT,EAAeU,EAAa,CAC9C,OAAOH,GACLP,EACA,CAACU,CAAW,EACZ,IAAM,OAAO,QAAQV,CAAa,EAAE,OAAO,CAAC,CAACK,EAAIM,CAAQ,IAAMA,EAAS,OAAS,GAAKD,EAAY,IAAIL,CAAE,CAAC,EAAE,KAAK,CAAC,CAACO,CAAC,EAAG,CAACC,CAAC,IAAMH,EAAY,IAAIG,CAAC,EAAIH,EAAY,IAAIE,CAAC,CAAC,CACvK,CACF,CACA,IAAIE,GAAWN,GAAS,EACxB,SAASO,GAAcf,EAAegB,EAAWC,EAAMC,EAASC,EAAQC,EAAU,CAChF,GAAM,CAAE,OAAAlC,EAAQ,OAAAC,CAAO,EAAI8B,EAC3B,OAAOH,GACLd,EACA,CAACgB,EAAWG,EAAQC,EAAUlC,EAAQC,EAAQ+B,CAAO,EACrD,IAAM,CACJ,IAAMG,EAAO,CAAC,EACd,QAAWC,IAAY,CAAC,GAAGN,CAAS,EAAE,KAAK,CAACJ,EAAGC,IAAMA,EAAE,GAAKD,EAAE,EAAE,EAAG,CACjE,IAAM5B,EAASuC,GACbvB,EACAsB,EACAL,EACAK,EAAS,SACTH,IAASG,EAAS,SAAS,EAC3BF,CACF,EACMnC,EAAOD,EAASwC,GAAcxC,CAAM,EAAI,OAC9C,GAAIA,GAAUC,EAAM,CAClB,GAAM,CAAE,KAAAgB,EAAM,KAAAC,EAAM,KAAAC,EAAM,KAAAC,CAAK,EAAIqB,GAAYzC,CAAM,EACrDqC,EAAK,KAAK,CACR,SAAAC,EACA,OAAAtC,EACA,KAAAC,EAEA,OAAQ,KAAK,KAAKkB,EAAOF,GAAQf,GAASkB,EAAOF,GAAQf,CAAM,CACjE,CAAC,CACH,CACF,CACA,OAAOkC,CACT,CACF,CACF,CACA,SAASK,GAAoB,CAC3B,cAAA1B,EACA,YAAAU,EACA,UAAAM,EACA,eAAAW,EACA,SAAAP,EAAW,GACX,gBAAAQ,EACA,KAAAX,EACA,WAAAY,EACA,WAAAC,EACA,MAAAC,EACA,OAAAC,EACA,QAAAd,EAAU,CACZ,EAAG,CACD,GAAM,CAAE,OAAAhC,EAAQ,OAAAC,CAAO,EAAI8B,EACrBgB,EAAqB,CAAC,EACtBC,EAAiB,CAAC,EACxB,OAAW,CAAE,SAAAZ,EAAU,OAAAtC,EAAQ,KAAAC,EAAM,OAAAkD,CAAO,IAAKpB,GAC/Cf,EACAgB,EACAC,EACAC,EACAS,EACAP,CACF,EACE,GAAIe,GAAUnF,GAAuB,CACnC,IAAMU,EAAOoB,GAAawC,EAAS,EAAE,EAC/BxD,EAAQL,EAAeC,CAAI,EAC3BgC,EAAM7B,EAAMC,EAAO,EAAG,CAAC,EACvBsE,EAAOnD,EAAK,EAAIC,EAAS2C,EACzBQ,EAAOpD,EAAK,EAAIE,EAAS2C,EAC/B,GAAIM,EAAO,GAAKA,EAAOL,GAASM,EAAO,GAAKA,EAAOL,EACjD,SAEF,IAAMM,EAAOH,GAAUrE,EAAQ,EAAIN,EAC7B+E,EAAMxD,GAAWC,EAAQC,EAAMC,EAAQC,CAAM,EAC7CqD,EAAS/C,GAAWC,EAAK6C,CAAG,EAAIpF,GAChCY,EAAIuE,EAAOF,EAAOhE,EAAMgE,EAAOG,EAAI,EAAIC,EAAQ1E,EAAOiE,EAAQjE,CAAK,EACnEE,EAAIsE,EAAOD,EAAOjE,EACtBiE,EAAOE,EAAI,EAAIC,EACf7E,EACAqE,EAASrE,CACX,EACM8E,EAAO,KAAK,MAAM1E,EAAIqE,EAAMpE,EAAIqE,CAAI,EACtCK,EACJ,GAAID,EAAO,EAAG,CACZ,IAAM9C,EAAM,CAAE,GAAI5B,EAAIqE,GAAQK,EAAM,GAAIzE,EAAIqE,GAAQI,CAAK,EACnDE,EAAW/C,GAAeF,EAAKC,CAAG,EACxC+C,EAAS,CACP,KAAAN,EACA,KAAAC,EACA,OAAQtE,EAAI4B,EAAI,EAAIgD,EACpB,OAAQ3E,EAAI2B,EAAI,EAAIgD,CACtB,CACF,CACAV,EAAmB,KAAK,CACtB,MAAO,CACL,IAAK,OAAOX,EAAS,SAAS,GAC9B,KAAA5D,EACA,EAAAK,EACA,EAAAC,EACA,KAAM,WACN,OAAA0E,CACF,EACA,IAAK7E,EAAMC,EAAOC,EAAGC,CAAC,CACxB,CAAC,CACH,CAEF,IAAM4E,EAAqC,IAAI,IACzCC,EAAa,CAAC,GAAGjB,GAAmB,CAAC,CAAC,EAAE,KAAK,CAAChB,EAAGC,IAAMA,EAAE,GAAKD,EAAE,EAAE,EACxE,QAAWkC,KAAOD,EAAY,CAC5B,IAAME,EAAQjD,GAAUgD,EAAI,QAAS9C,CAAa,EAClD,GAAI,CAAC+C,EACH,SAEF,IAAMC,EAAY,KAAK,IAAID,EAAM,KAAO7D,EAAS2C,EAAY,CAAC,EACxDoB,EAAa,KAAK,IAAIF,EAAM,KAAO7D,EAAS2C,EAAYE,CAAK,EAC7DmB,EAAW,KAAK,IAAIH,EAAM,KAAO5D,EAAS2C,EAAY,CAAC,EACvDqB,EAAc,KAAK,IAAIJ,EAAM,KAAO5D,EAAS2C,EAAYE,CAAM,EACrE,GAAIiB,EAAaD,GAAaG,EAAcD,EAC1C,SAEF,IAAMf,EAAS,KAAK,IAAIc,EAAaD,EAAWG,EAAcD,CAAQ,EAChExF,EAAOoB,GAAagE,EAAI,EAAE,EAC1BhF,EAAQL,EAAeC,CAAI,EACjC,GAAIyE,GAAUrE,EAAQ,EAAIN,EAAoB,CAC5C,QAAW6C,KAAMyC,EAAI,QACnBF,EAAmB,IAAIvC,CAAE,EAE3B,IAAMtC,EAAIK,GAAO4E,EAAYC,GAAc,EAAGnF,EAAOiE,EAAQjE,CAAK,EAC5DE,EAAII,GACP8E,EAAWC,GAAe,EAC3BxF,EACAqE,EAASrE,CACX,EACAsE,EAAmB,KAAK,CACtB,MAAO,CACL,IAAK,aAAaa,EAAI,QAAQ,KAAK,GAAG,CAAC,GACvC,KAAApF,EACA,EAAAK,EACA,EAAAC,EACA,KAAM,UACR,EACA,IAAKH,EAAMC,EAAOC,EAAGC,CAAC,CACxB,CAAC,CACH,CACF,CACA,OAAW,CAACqC,EAAIM,CAAQ,IAAKF,GAAWT,EAAeU,CAAW,EAAG,CACnE,GAAIkC,EAAmB,IAAIvC,CAAE,EAC3B,SAEF,GAAM,CAAE,EAAAtC,EAAG,EAAAC,CAAE,EAAIoF,GAAiBzC,CAAQ,EACpCzC,EAAUF,EAAImB,EAAS2C,EAC7B,GAAI5D,EAAUP,GAAqB,GAAKO,EAAUP,GAAqBqE,EACrE,SAEF,IAAMe,EAAQM,EAAW1C,EAAUzB,EAAQC,CAAM,EACjD,GAAI4D,EAAQnF,GAAuB,EAAIJ,EACrC,SAEF,IAAME,EAAOgB,GAASgC,EAAY,IAAIL,CAAE,CAAC,EACnCvC,EAAQL,EAAeC,CAAI,EACjC,GAAIqF,GAASjF,EAAQ,EAAIN,EAAoB,CAC3C,IAAM8F,EAAUvF,EAAImB,EAAS2C,EAC7BK,EAAe,KAAK,CAClB,MAAO,CACL,IAAK,QAAQ7B,CAAE,GACf,KAAA3C,EACA,EAAG4F,EACH,EAAGpF,EACH,KAAM,MACR,EACA,IAAKL,EAAMC,EAAOwF,EAASpF,CAAO,CACpC,CAAC,CACH,CACF,CACA,MAAO,CAAE,UAAW+D,EAAoB,MAAOC,CAAe,CAChE,CACA,SAASqB,GAAgBxB,EAAOC,EAAQ,CACtC,OAAO,KAAK,IACV9E,GACA,KAAK,MAAM6E,EAAQC,EAAS/E,EAAiB,CAC/C,CACF,CACA,SAASuG,GAAgBC,EAAYC,EAAMC,EAAS,IAAU,CAC5D,IAAMC,EAAS,CAAC,EAChB,OAAW,CAAE,MAAAC,EAAO,IAAAnE,CAAI,IAAK+D,EAAY,CACvC,GAAIG,EAAO,QAAUD,EACnB,MAEED,EAAKhE,CAAG,GACVkE,EAAO,KAAKC,CAAK,CAErB,CACA,OAAOD,CACT,CACA,SAASE,GAAY,CACnB,SAAAC,EACA,KAAAL,EACA,GAAGM,CACL,EAAG,CACDN,IAASO,GAAUD,EAAMD,CAAQ,EACjC,GAAM,CAAE,UAAA/C,EAAW,MAAAkD,CAAM,EAAIxC,GAAoBsC,CAAI,EACrD,MAAO,CACL,GAAGR,GAAgBxC,EAAW0C,CAAI,EAClC,GAAGF,GAAgBU,EAAOR,EAAMH,GAAgBS,EAAK,MAAOA,EAAK,MAAM,CAAC,CAC1E,CACF,CCzSA,SAASG,GAAQC,EAAM,CACrB,IAAIC,EAAO,EACX,QAASC,EAAI,EAAGA,EAAIF,EAAK,OAAQE,IAC/BD,EAAOD,EAAK,WAAWE,CAAC,IAAMD,GAAQ,GAAKA,GAE7C,OAAO,KAAK,IAAIA,EAAO,GAAG,CAC5B,CACA,SAASE,GAAUC,EAAOC,EAAO,CAC/B,OAAOD,EAAQ,IAAMC,CACvB,CACA,IAAIC,GAAkB,GAClBC,GAAiB,GACjBC,GAAkB,GACtB,SAASC,GAAkBC,EAAW,CACpC,OAAOA,EAAY,GAAKA,GAAaF,EACvC,CACA,SAASG,GAAaP,EAAOC,EAAO,CAClC,MAAO,OAAOF,GAAUC,EAAOC,CAAK,CAAC,KAAKC,GAAkB,GAAG,MAAMC,GAAiB,GAAG,IAC3F,CACA,SAASK,GAAiBR,EAAOC,EAAO,CAEtC,MAAO,cADWA,EAAQ,EAAI,GAAK,GAAKD,GAASC,EAAQ,GAAK,EAChC,IAChC,CACA,SAASQ,GAAWb,EAAM,CACxB,IAAMc,EAAQC,EAAWf,CAAI,EAAE,KAAK,MAAM,GAAG,EACvCgB,EAAOF,EAAM,KAAK,GAAG,EAC3B,GAAIA,EAAM,QAAU,GAAKG,GAAgBH,EAAM,CAAC,CAAC,EAAG,CAClD,IAAMI,EAASJ,EAAM,MAAM,CAAC,EAAE,KAAK,GAAG,EACtC,MAAO,CAACI,EAAQA,EAAQF,CAAI,CAC9B,CACA,MAAO,CAACF,EAAM,CAAC,EAAGA,EAAM,MAAM,EAAG,CAAC,EAAE,KAAK,GAAG,EAAGE,CAAI,CACrD,CACA,SAASG,GAAYnB,EAAMoB,EAAO,CAChC,GAAM,CAAE,MAAAC,CAAM,EAAIN,EAAWf,CAAI,EACjC,OAAOoB,EAAM,IAAKE,GAAM,GAAGA,CAAC,KAAKC,GAAYF,CAAK,CAAC,EAAE,CACvD,CACA,SAASG,GAAWC,EAAOC,EAAQ,CACjC,IAAMC,EAA0B,IAAI,IACpCF,EAAM,QAAQ,CAACG,EAAM1B,IAAM,CACpByB,EAAQ,IAAIC,EAAK,IAAI,GACxBD,EAAQ,IAAIC,EAAK,KAAM1B,CAAC,CAE5B,CAAC,EACD,IAAM2B,EAAU,CAAC,GAAGF,CAAO,EAAE,IAAI,CAAC,CAACG,EAAO5B,CAAC,KAAO,CAAE,KAAM4B,EAAO,EAAA5B,CAAE,EAAE,EAC/D6B,EAAQF,EAAQ,IAAKG,GAAMnB,GAAWmB,EAAE,IAAI,CAAC,EAC7ChC,EAAQsB,GAAMO,EAAQ,IAAI,CAACI,EAAGC,IAAMH,EAAMG,CAAC,EAAEZ,CAAC,CAAC,EAC/Ca,EAAUb,GAAMO,EAAQ,IAAI,CAACG,EAAGE,IAAMf,GAAYa,EAAE,KAAMD,EAAMG,CAAC,CAAC,EAAEZ,CAAC,CAAC,EACtEc,EAAa,CACjBpC,EAAK,CAAC,EACNA,EAAK,CAAC,EACNmC,EAAO,CAAC,EACRnC,EAAK,CAAC,EACNmC,EAAO,CAAC,EACRA,EAAO,CAAC,CACV,EAIME,EAHWD,EAAW,KACzBE,GAAY,IAAI,IAAIA,CAAO,EAAE,OAAST,EAAQ,MACjD,GAC2BO,EAAW,GAAG,EAAE,EAC3C,OAAOP,EAAQ,IAAI,CAAC,CAAE,KAAMC,EAAO,EAAA5B,CAAE,EAAGgC,KAAO,CAC7C,KAAMJ,EACN,MAAOO,EAAOH,CAAC,EACf,MAAOR,IAASxB,CAAC,GAAKS,GAAaT,EAAGuB,EAAM,MAAM,CACpD,EAAE,CACJ,CACA,SAASc,GAAaV,EAAS,CAC7B,IAAMW,EAAuB,IAAI,IACjC,OAAO,IAAI,IACT,CAAC,GAAGX,CAAO,EAAE,KAAK,CAACY,EAAGC,IAAMD,EAAE,MAAM,cAAcC,EAAE,KAAK,CAAC,EAAE,IAAK,GAAM,CACrE,IAAMC,GAAKH,EAAK,IAAI,EAAE,KAAK,GAAK,GAAK,EACrC,OAAAA,EAAK,IAAI,EAAE,MAAOG,CAAC,EACZ,CAAC,EAAE,KAAMA,EAAI,EAAI,GAAG,EAAE,KAAK,KAAKA,CAAC,IAAM,EAAE,KAAK,CACvD,CAAC,CACH,CACF,CChFA,IAAIC,GAAc,CAChB,CACE,MAAO,QACP,MAAO,WACP,YAAa,yIACf,EACA,CACE,MAAO,YACP,MAAO,eACP,YAAa,4JACf,EACA,CACE,MAAO,UACP,MAAO,UACP,YAAa,gCACf,CACF,EACIC,GAAa,GACbC,GAAa,EACbC,GAAuB,IAC3B,SAASC,GAAUC,EAAO,CACxB,IAAIC,EAAW,EACXC,EAAS,EACb,QAAWC,KAAQH,EAAM,MACvBC,GAAYE,EAAK,MAAQA,EAAK,OAC9BD,GAAUC,EAAK,OAEjB,OAAOD,EAAS,EAAID,EAAWC,EAAS,CAC1C,CACA,SAASE,GAAYC,EAAM,CACzB,OAAOA,EAAK,SAAW,OAASC,GAAeD,EAAK,IAAI,GAAKA,EAAK,KAAO,GAAGA,EAAK,MAAM,IAAIA,EAAK,WAAa,CAAC,EAChH,CACA,SAASE,GAAeP,EAAO,CAC7B,OAAO,IAAI,KAAKA,EAAM,OAAS,CAAC,GAAG,IAAII,EAAW,CAAC,EAAE,IACvD,CACA,SAASI,GAAcL,EAAMM,EAAY,CACvC,OAAON,EAAK,YAAcM,EAAa,EAAIN,EAAK,MAAQM,EAAa,OACvE,CAWA,SAASC,GAAUC,EAAOC,EAAW,CACnC,OAAOA,IAAc,QAAUC,GAAUF,CAAK,EAAIC,IAAc,YAAcE,GAAeH,CAAK,EAAI,CACxG,CACA,SAASI,GAAgBC,EAAG,CAC1B,OAAO,KAAK,IAAIC,GAAY,KAAK,IAAIC,GAAsBF,CAAC,CAAC,CAC/D,CACA,SAASG,GAAqBC,EAAMC,EAAY,CAC9C,IAAML,EAAIM,GAAcF,EAAMC,CAAU,EACxC,OAAOL,IAAM,OAAS,EAAID,GAAgBC,CAAC,CAC7C,CACA,SAASO,GAAaC,EAAiB,CACrC,MAAO,CAAC,EAAG,GAAK,EAAG,EAAE,IAAKR,IAAO,CAC/B,MAAO,GAAGA,EAAI,GAAG,IACjB,QAASQ,EAAkBT,GAAgBC,CAAC,CAC9C,EAAE,CACJ,CACA,SAASS,GAAiBL,EAAMM,EAAM,CACpC,MAAI,EAAEA,EAAO,IAAM,EAAEN,EAAK,MAAQ,GACzB,EAEF,KAAK,IACVH,GACA,KAAK,IAAIU,GAAY,KAAK,KAAKP,EAAK,MAAQM,CAAI,CAAC,CACnD,CACF,CACA,SAASE,GAAYR,EAAMI,EAAiBZ,EAAWiB,EAAM,CAC3D,OAAOL,GAAmBZ,IAAc,QAAUa,GAAiBL,EAAMS,CAAI,EAAIjB,IAAc,YAAcO,GAAqBC,EAAMS,CAAI,EAAI,EAClJ,CACA,SAASC,GAAeN,EAAiBZ,EAAW,CAClD,OAAOY,GAAmBZ,IAAc,UAAY,EAAIK,GAC1D,CACA,IAAIc,GAAmB,EACvB,SAASC,GAAgBC,EAAOC,EAAO,CACrC,OAAO,KAAK,IAAID,EAAQC,EAAOH,EAAgB,CACjD,CACA,SAASI,GAAQxB,EAAOyB,EAAUZ,EAAiBZ,EAAWsB,EAAQ,EAAG,CACvE,IAAML,EAAOlB,EAAQD,GAAUC,EAAOC,CAAS,EAAI,EAC7CyB,EAASJ,GAAUC,EAAQ,EAAIF,GAAgBC,EAAOC,CAAK,EAAIA,EAAQ,EAAID,EAAQ,EACzF,MAAO,CACL,eAAgBI,EAAMP,GAAeN,EAAiBZ,CAAS,CAAC,EAChE,YAAc0B,GAAO,CACnB,IAAMlB,EAAOgB,GAAU,IAAIE,CAAE,EAC7B,OAAOD,EACLjB,EAAOQ,GAAYR,EAAMI,EAAiBZ,EAAWiB,CAAI,EAAIL,CAC/D,CACF,CACF,CACF,CCnGA,IAAIe,GAAc,CAChB,CACE,MAAO,UACP,MAAO,UACP,YAAa,gCACf,EACA,CACE,MAAO,QACP,MAAO,WACP,YAAa,+IACf,CACF,EACIC,GAAa,GACbC,GAAa,EACjB,SAASC,GAAYC,EAAO,CAC1B,IAAIC,EAAO,EACX,QAAWC,KAAQF,EAAM,MACvBC,EAAO,KAAK,IAAIA,EAAMC,EAAK,SAAS,QAAU,CAAC,EAEjD,OAAOD,CACT,CACA,SAASE,GAAgBC,EAAOC,EAASC,EAAW,CAClD,OAAIA,IAAc,WAAaD,IAAY,EAClC,EAEFR,IAAcC,GAAaD,IAAc,KAAK,KAAKO,EAAQC,CAAO,CAC3E",
-  "names": ["ROW_HEIGHT_PX", "svgPath", "points", "round", "v", "p", "i", "projectLine", "x1", "y1", "x2", "y2", "distance", "d", "vx", "vy", "curvePointAt", "c", "t", "u", "a", "b", "e", "curveMidpoint", "curves", "mid", "curveBounds", "minX", "minY", "maxX", "maxY", "subCurve", "t0", "t1", "p0", "p1", "dt", "d0", "curveTangentAt", "d1", "VISIBLE_SAMPLES", "visibleStretches", "lengths", "bounds", "yToX", "stretches", "start", "k", "length", "pad", "last", "next", "from", "to", "prev", "dashSpans", "curves", "dashWorld", "yToX", "bounds", "lengths", "c", "total", "a", "b", "periods", "spans", "stretches", "visibleStretches", "seen", "out", "i", "from", "to", "dash", "along", "start", "k", "length", "end", "t0", "t1", "subCurve", "slideCurves", "curves", "fromDx", "fromDy", "toDx", "toDy", "n", "out", "i", "c", "a", "b", "adx", "ady", "bdx", "bdy", "translateCurves", "dx", "dy", "attachment", "segments", "side", "last", "TANGENT_SPAN_FACTOR", "MAX_TANGENT", "ownStrand", "id", "strandSides", "edge", "own", "strand", "spanOf", "min", "max", "s", "distanceToSpan", "x", "span", "facingSide", "other", "tieBreak", "startGap", "endGap", "facingSides", "fromSegments", "toSegments", "laidSides", "heldFacingSides", "byTo", "sides", "APEX_FRACTION", "BOW_CLEARANCE", "ALONG_FRACTION", "MAX_ROW_BOW_PX", "ROW_HEIGHT_PX", "bowAround", "p1x", "p1y", "p2x", "p2y", "toward", "maxBow", "chord", "ux", "uy", "reach", "minAlong", "maxAlong", "p", "perp", "along", "uncapped", "size", "yToXOf", "scaleX", "scaleY", "PATH_RIBBON_SPACING_PX", "drawnDirection", "yToX", "len", "pathRibbonOffsets", "count", "axis", "spacing", "dir", "offsets", "distance", "scaleYOf", "points", "unscaleYOf", "polylinePx", "total", "SELF_LOOP_MIN_PX", "SELF_LOOP_MAX_PX", "selfLoopReach", "scale", "nodePx", "selfLinkOf", "edgeJoinOf", "stranded", "self", "hairpinCurves", "attach", "at", "inward", "px", "py", "nearX", "nearY", "apexX", "apexY", "sideX", "sideY", "computeEdgeCurves", "join", "bypassed", "maxBowIn", "loop", "fromAttach", "toAttach", "fromEnd", "toStart", "segDirX", "segDirY", "ext", "perpX", "perpY", "midX", "midY", "cp1x", "cp1y", "cp2x", "cp2y", "fromPrev", "toNext", "dist", "tangentProj", "prev", "towardX", "towardY", "towardToX", "towardToY", "cx1", "cy1", "projectLine", "cx2", "cy2", "bulge", "chordLen", "bulgeX", "bulgeY", "spreadX", "spreadY", "nearerEnd", "to", "start", "end", "routedEdgeCurves", "route", "tangent", "q", "next", "ta", "tb", "weakMemo", "cache", "key", "deps", "compute", "hit", "d", "i", "value", "LABEL_PX", "LABEL_CHAR_PX", "LABEL_PAD", "labelWidth", "text", "overlaps", "a", "b", "offFrame", "box", "frame", "insideFrame", "occupancy", "reserved", "placed", "p", "placeLabels", "candidates", "take", "out", "row", "stackFrom", "from", "direction", "w", "crowded", "tries", "y", "place", "first", "flip", "strand", "mergeRuns", "graph", "alone", "sides", "strandSides", "at", "attach", "id", "side", "ei", "pushTo", "edge", "joinAfter", "a", "out", "joined", "runOf", "runs", "node", "into", "pred", "run", "next", "byId", "n", "nodes", "members", "backbone", "isBackbone", "first", "b", "sum", "seen", "edges", "from", "to", "key", "ownStrand", "splitRuns", "positions", "weightOf", "line", "arc", "arcPrefix", "total", "weights", "m", "weightSum", "member", "k", "share", "slice", "polylineSlice", "polylineMidpoint", "pointAt", "i", "firstReaching", "s", "lo", "hi", "mid", "span", "t", "points", "trimToWindow", "graph", "window", "inWindow", "n", "isBackbone", "overlapsWindow", "paths", "spans", "path", "first", "last", "id", "i", "span", "kept", "trimmed", "stretches", "nodeIds", "e", "trimVisits", "trimOrigins", "visits", "nameOf", "next", "out", "PathVisitsBuilder", "p", "origin", "pathOrigin", "segment", "at", "clipToWindow", "reachBp", "nodes", "node", "from", "to", "start", "end", "unclipped", "full", "MIN_DELETION_BP", "deletionKey", "reference", "bypassedPoints", "nodePositions", "bypassed", "id", "edgeCurvesOf", "edge", "axis", "route", "stranded", "from", "to", "routedEdgeCurves", "strandSides", "computeEdgeCurves", "edgeJoinOf", "backboneBySequence", "graph", "bySequence", "groupBy", "isBackbone", "node", "list", "a", "b", "bypassedNodes", "nodes", "start", "end", "i", "firstNodeAtOrAfter", "skipsBetween", "forwards", "fromStrand", "toStrand", "leavesRight", "arrivesLeft", "skippedSpan", "startsOf", "best", "span", "COPY_SWITCH_SHARE", "repeatCopies", "backbone", "refName", "copies", "starts", "next", "switchesCopy", "bp", "partitionPoint", "k", "near", "c", "deletionEdges", "cut", "unclipped", "byId", "n", "referenceVisitStarts", "found", "edgeIndex", "closableDeletions", "deletions", "parent", "root", "r", "join", "ra", "rb", "candidates", "d", "e", "ei", "dashedDeletions", "shown", "lift", "drawings", "deletionDrawing", "show", "byShow", "drawing", "hidden", "MIN_DELETION_LABEL_PX", "PX_PER_NODE_LABEL", "MIN_NODE_LABELS", "LEADER_GAP_PX", "LABEL_CHAR_PX", "LABEL_PAD_PX", "LABEL_HEIGHT_PX", "LABEL_GAP_PX", "MAX_LABEL_OVERHANG", "labelHalfWidth", "text", "LABEL_HALF_HEIGHT", "MIN_LABEL_HALF_WIDTH", "boxAt", "halfW", "x", "y", "rowLabelBox", "screenY", "labelWidth", "clamp", "v", "lo", "hi", "groupDigits", "n", "formatBp", "bp", "value", "unit", "deletionText", "arcOutward", "curves", "apex", "scaleX", "scaleY", "first", "last", "dx", "dy", "len", "boxSupport", "box", "dir", "boxRayCrossing", "halfH", "runBounds", "nodeIds", "nodePositions", "minX", "minY", "maxX", "maxY", "id", "p", "nodeOrderCache", "weakMemo", "labelOrder", "nodeLengths", "segments", "a", "b", "arcCache", "arcPlacements", "deletions", "axis", "version", "routes", "stranded", "arcs", "deletion", "edgeCurvesOf", "curveMidpoint", "curveBounds", "sizeLabelCandidates", "deletionRoutes", "alleleDeletions", "translateX", "translateY", "width", "height", "deletionCandidates", "nodeCandidates", "extent", "arcX", "arcY", "fits", "bow", "offset", "away", "leader", "crossing", "labelledByDeletion", "alleleRuns", "run", "drawn", "shownLeft", "shownRight", "shownTop", "shownBottom", "polylineMidpoint", "polylinePx", "screenX", "nodeLabelBudget", "placeSizeLabels", "candidates", "take", "budget", "labels", "label", "graphLabels", "reserved", "args", "occupancy", "nodes", "nameHue", "name", "hash", "i", "pathHueAt", "index", "count", "PATH_SATURATION", "PATH_LIGHTNESS", "MAX_PATH_COLORS", "pathColorsLegible", "pathCount", "pathCssColor", "pathGreyCssColor", "labelTiers", "parts", "pathOrigin", "full", "isGenericSample", "contig", "offsetTiers", "tiers", "start", "t", "groupDigits", "pathLegend", "paths", "colors", "firstOf", "path", "entries", "name2", "named", "e", "_", "k", "offset", "candidates", "labels", "labels2", "walkLabelsOf", "seen", "a", "b", "n", "NODE_WIDTHS", "MIN_FACTOR", "MAX_FACTOR", "MIN_FREQUENCY_FACTOR", "meanDepth", "graph", "weighted", "length", "node", "haplotypeOf", "path", "panSNHaplotype", "haplotypeCount", "nodeFrequency", "haplotypes", "widthNorm", "graph", "nodeWidth", "meanDepth", "haplotypeCount", "frequencyFactor", "f", "MAX_FACTOR", "MIN_FREQUENCY_FACTOR", "frequencyWidthFactor", "node", "haplotypes", "nodeFrequency", "frequencyKey", "contigThickness", "depthWidthFactor", "mean", "MIN_FACTOR", "nodeWidthPx", "norm", "maxNodeWidthPx", "MIN_WALK_LANE_PX", "walkLaneWidthPx", "width", "lanes", "nodeInk", "nodeById", "reach", "id", "EDGE_WIDTHS", "MIN_FACTOR", "MAX_FACTOR", "busiestEdge", "graph", "most", "edge", "edgeWidthFactor", "walks", "busiest", "edgeWidth"]
+  "sources": ["../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-CPMHA4W5.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-JJV2GT2Z.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HMXCN6PG.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-S43IBA5Y.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-HNNP5QUN.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-L2FHURWV.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-TJLERGAI.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-74A3MFUM.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-KKYPJITI.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-XWH4LB56.js", "../../node_modules/.pnpm/@jbrowse+bandage-core@12.6.2/node_modules/@jbrowse/bandage-core/dist/chunks/chunk-DAEEMZ74.js"],
+  "sourcesContent": ["// src/layout/rowSpacing.ts\nvar ROW_HEIGHT_PX = 20;\n\nexport {\n  ROW_HEIGHT_PX\n};\n", "import {\n  ROW_HEIGHT_PX\n} from \"./chunk-CPMHA4W5.js\";\n\n// src/util/geometry.ts\nfunction svgPath(points) {\n  const round = (v) => Math.round(v * 100) / 100;\n  return points.map((p, i) => `${i ? \"L\" : \"M\"}${round(p.x)},${round(p.y)}`).join(\"\");\n}\nfunction projectLine(x1, y1, x2, y2, distance) {\n  const d = Math.hypot(y2 - y1, x2 - x1);\n  if (d === 0) {\n    return [x2, y2];\n  }\n  const vx = (x2 - x1) / d;\n  const vy = (y2 - y1) / d;\n  return [x2 + distance * vx, y2 + distance * vy];\n}\nfunction curvePointAt(c, t) {\n  const u = 1 - t;\n  const a = u * u * u;\n  const b = 3 * u * u * t;\n  const d = 3 * u * t * t;\n  const e = t * t * t;\n  return {\n    x: a * c.x0 + b * c.cx0 + d * c.cx1 + e * c.x1,\n    y: a * c.y0 + b * c.cy0 + d * c.cy1 + e * c.y1\n  };\n}\nfunction curveMidpoint(curves) {\n  const mid = curves[Math.floor(curves.length / 2)];\n  return mid ? curvePointAt(mid, 0.5) : void 0;\n}\nfunction curveBounds(curves) {\n  let minX = Infinity;\n  let minY = Infinity;\n  let maxX = -Infinity;\n  let maxY = -Infinity;\n  for (const c of curves) {\n    minX = Math.min(minX, c.x0, c.cx0, c.cx1, c.x1);\n    maxX = Math.max(maxX, c.x0, c.cx0, c.cx1, c.x1);\n    minY = Math.min(minY, c.y0, c.cy0, c.cy1, c.y1);\n    maxY = Math.max(maxY, c.y0, c.cy0, c.cy1, c.y1);\n  }\n  return { minX, minY, maxX, maxY };\n}\nfunction subCurve(c, t0, t1) {\n  const p0 = curvePointAt(c, t0);\n  const p1 = curvePointAt(c, t1);\n  const dt = (t1 - t0) / 3;\n  const d0 = curveTangentAt(c, t0);\n  const d1 = curveTangentAt(c, t1);\n  return {\n    x0: p0.x,\n    y0: p0.y,\n    cx0: p0.x + d0.x * dt,\n    cy0: p0.y + d0.y * dt,\n    cx1: p1.x - d1.x * dt,\n    cy1: p1.y - d1.y * dt,\n    x1: p1.x,\n    y1: p1.y\n  };\n}\nfunction curveTangentAt(c, t) {\n  const u = 1 - t;\n  const a = 3 * u * u;\n  const b = 6 * u * t;\n  const d = 3 * t * t;\n  return {\n    x: a * (c.cx0 - c.x0) + b * (c.cx1 - c.cx0) + d * (c.x1 - c.cx1),\n    y: a * (c.cy0 - c.y0) + b * (c.cy1 - c.cy0) + d * (c.y1 - c.cy1)\n  };\n}\nvar VISIBLE_SAMPLES = 32;\nfunction visibleStretches(curves, lengths, bounds, yToX) {\n  const stretches = [];\n  let start = 0;\n  curves.forEach((c, k) => {\n    const length = lengths[k];\n    const pad = length / VISIBLE_SAMPLES;\n    let last = curvePointAt(c, 0);\n    for (let i = 1; i <= VISIBLE_SAMPLES; i++) {\n      const next = curvePointAt(c, i / VISIBLE_SAMPLES);\n      if (Math.max(last.x, next.x) + pad >= bounds.minX && Math.min(last.x, next.x) - pad <= bounds.maxX && Math.max(last.y, next.y) + pad / yToX >= bounds.minY && Math.min(last.y, next.y) - pad / yToX <= bounds.maxY) {\n        const from = start + length * (i - 1) / VISIBLE_SAMPLES;\n        const to = start + length * i / VISIBLE_SAMPLES;\n        const prev = stretches.at(-1);\n        if (prev && prev[1] >= from) {\n          prev[1] = to;\n        } else {\n          stretches.push([from, to]);\n        }\n      }\n      last = next;\n    }\n    start += length;\n  });\n  return stretches;\n}\nvar dashCurves = (curves, dashWorld, yToX = 1, bounds) => dashSpans(curves, dashWorld, yToX, bounds).map((d) => d.curves);\nfunction dashSpans(curves, dashWorld, yToX = 1, bounds) {\n  const lengths = curves.map(\n    (c) => Math.hypot(c.cx0 - c.x0, (c.cy0 - c.y0) * yToX) + Math.hypot(c.cx1 - c.cx0, (c.cy1 - c.cy0) * yToX) + Math.hypot(c.x1 - c.cx1, (c.y1 - c.cy1) * yToX)\n  );\n  const total = lengths.reduce((a, b) => a + b, 0);\n  const periods = Math.round(total / dashWorld);\n  const spans = Math.max(3, periods % 2 ? periods : periods + 1);\n  const stretches = bounds ? visibleStretches(curves, lengths, bounds, yToX) : void 0;\n  let seen = 0;\n  const out = [];\n  for (let i = 0; i < spans; i += 2) {\n    const from = i / spans * total;\n    const to = (i + 1) / spans * total;\n    if (stretches) {\n      while (seen < stretches.length && stretches[seen][1] < from) {\n        seen++;\n      }\n      if (seen === stretches.length) {\n        break;\n      }\n      if (stretches[seen][0] > to) {\n        continue;\n      }\n    }\n    const dash = [];\n    const along = [];\n    let start = 0;\n    curves.forEach((c, k) => {\n      const length = lengths[k];\n      const end = start + length;\n      if (length > 0 && end > from && start < to) {\n        const t0 = Math.max(0, (from - start) / length);\n        const t1 = Math.min(1, (to - start) / length);\n        dash.push(subCurve(c, t0, t1));\n        along.push((k + t0) / curves.length, (k + t1) / curves.length);\n      }\n      start = end;\n    });\n    if (dash.length) {\n      out.push({\n        curves: dash,\n        startAlong: along[0],\n        endAlong: along.at(-1)\n      });\n    }\n  }\n  return out;\n}\nvar slideAt = (from, to, along) => ({\n  dx: from.dx + (to.dx - from.dx) * along,\n  dy: from.dy + (to.dy - from.dy) * along\n});\nfunction slideCurves(curves, fromDx, fromDy, toDx, toDy) {\n  const n = curves.length;\n  const out = new Array(n);\n  for (let i = 0; i < n; i++) {\n    const c = curves[i];\n    const a = i / n;\n    const b = (i + 1) / n;\n    const adx = fromDx + (toDx - fromDx) * a;\n    const ady = fromDy + (toDy - fromDy) * a;\n    const bdx = fromDx + (toDx - fromDx) * b;\n    const bdy = fromDy + (toDy - fromDy) * b;\n    out[i] = {\n      x0: c.x0 + adx,\n      y0: c.y0 + ady,\n      cx0: c.cx0 + adx,\n      cy0: c.cy0 + ady,\n      cx1: c.cx1 + bdx,\n      cy1: c.cy1 + bdy,\n      x1: c.x1 + bdx,\n      y1: c.y1 + bdy\n    };\n  }\n  return out;\n}\nfunction translateCurves(curves, dx, dy) {\n  const out = new Array(curves.length);\n  for (let i = 0; i < curves.length; i++) {\n    const c = curves[i];\n    out[i] = {\n      x0: c.x0 + dx,\n      y0: c.y0 + dy,\n      cx0: c.cx0 + dx,\n      cy0: c.cy0 + dy,\n      cx1: c.cx1 + dx,\n      cy1: c.cy1 + dy,\n      x1: c.x1 + dx,\n      y1: c.y1 + dy\n    };\n  }\n  return out;\n}\nfunction attachment(segments, side) {\n  const last = segments.length - 1;\n  return side === \"end\" ? { at: segments[last], inward: segments[last - 1] } : { at: segments[0], inward: segments[1] };\n}\nvar TANGENT_SPAN_FACTOR = 0.5;\nvar MAX_TANGENT = 80;\nfunction ownStrand(id) {\n  return id.endsWith(\"-\") ? \"-\" : \"+\";\n}\nfunction strandSides(edge) {\n  const own = (id, strand) => (strand ?? ownStrand(id)) === ownStrand(id);\n  return {\n    from: own(edge.from, edge.fromStrand) ? \"end\" : \"start\",\n    to: own(edge.to, edge.toStrand) ? \"start\" : \"end\"\n  };\n}\nfunction spanOf(segments) {\n  let min = Infinity;\n  let max = -Infinity;\n  for (const s of segments) {\n    min = Math.min(min, s.x);\n    max = Math.max(max, s.x);\n  }\n  return { min, max };\n}\nfunction distanceToSpan(x, span) {\n  return Math.max(0, span.min - x, x - span.max);\n}\nfunction facingSide(segments, other, tieBreak) {\n  const startGap = distanceToSpan(segments[0].x, other);\n  const endGap = distanceToSpan(segments[segments.length - 1].x, other);\n  return startGap === endGap ? tieBreak : startGap < endGap ? \"start\" : \"end\";\n}\nfunction facingSides(fromSegments, toSegments) {\n  return {\n    from: facingSide(fromSegments, spanOf(toSegments), \"end\"),\n    to: facingSide(toSegments, spanOf(fromSegments), \"start\")\n  };\n}\nvar laidSides = /* @__PURE__ */ new WeakMap();\nfunction heldFacingSides(fromSegments, toSegments) {\n  let byTo = laidSides.get(fromSegments);\n  if (!byTo) {\n    byTo = /* @__PURE__ */ new WeakMap();\n    laidSides.set(fromSegments, byTo);\n  }\n  let sides = byTo.get(toSegments);\n  if (!sides) {\n    sides = facingSides(fromSegments, toSegments);\n    byTo.set(toSegments, sides);\n  }\n  return sides;\n}\nvar APEX_FRACTION = 0.75;\nvar BOW_CLEARANCE = 1.15;\nvar ALONG_FRACTION = 0.35;\nvar MAX_ROW_BOW_PX = 3 * ROW_HEIGHT_PX;\nfunction bowAround(p1x, p1y, p2x, p2y, toward, maxBow) {\n  const chord = Math.hypot(p2x - p1x, p2y - p1y);\n  const ux = chord === 0 ? 1 : (p2x - p1x) / chord;\n  const uy = chord === 0 ? 0 : (p2y - p1y) / chord;\n  let reach = 0;\n  let minAlong = Infinity;\n  let maxAlong = -Infinity;\n  for (const p of toward) {\n    const dx = p.x - p1x;\n    const dy = p.y - p1y;\n    const perp = dx * -uy + dy * ux;\n    if (Math.abs(perp) > Math.abs(reach)) {\n      reach = perp;\n    }\n    const along = dx * ux + dy * uy;\n    minAlong = Math.min(minAlong, along);\n    maxAlong = Math.max(maxAlong, along);\n  }\n  const span = toward.length ? maxAlong - minAlong : 0;\n  const uncapped = Math.max(\n    Math.abs(reach) * BOW_CLEARANCE / APEX_FRACTION,\n    span * ALONG_FRACTION\n  );\n  const size = maxBow === void 0 ? uncapped : Math.min(uncapped, maxBow);\n  return reach < 0 ? -size : size;\n}\nfunction yToXOf({ scaleX, scaleY }) {\n  return scaleY / scaleX;\n}\nvar PATH_RIBBON_SPACING_PX = 3;\nfunction drawnDirection(a, b, yToX) {\n  const dx = b.x - a.x;\n  const dy = (b.y - a.y) * yToX;\n  const len = Math.hypot(dx, dy);\n  return len === 0 ? void 0 : { x: dx / len, y: dy / len };\n}\nfunction pathRibbonOffsets(fromSegments, toSegments, count, axis) {\n  const yToX = yToXOf(axis);\n  const spacing = PATH_RIBBON_SPACING_PX / Math.max(axis.scaleX, 1e-6);\n  const dir = drawnDirection(\n    fromSegments[fromSegments.length - 1],\n    toSegments[0],\n    yToX\n  ) ?? drawnDirection(fromSegments[0], fromSegments.at(-1), yToX) ?? drawnDirection(toSegments[0], toSegments.at(-1), yToX) ?? { x: 1, y: 0 };\n  const offsets = [];\n  for (let i = 0; i < count; i++) {\n    const distance = (i - (count - 1) / 2) * spacing;\n    offsets.push({ x: -dir.y * distance, y: dir.x * distance / yToX });\n  }\n  return offsets;\n}\nfunction scaleYOf(points, yToX) {\n  return points.map((p) => ({ x: p.x, y: p.y * yToX }));\n}\nfunction unscaleYOf(curves, yToX) {\n  for (const c of curves) {\n    c.y0 /= yToX;\n    c.cy0 /= yToX;\n    c.cy1 /= yToX;\n    c.y1 /= yToX;\n  }\n  return curves;\n}\nfunction polylinePx(points, scaleX, scaleY) {\n  let total = 0;\n  for (let i = 1; i < points.length; i++) {\n    const a = points[i - 1];\n    const b = points[i];\n    total += Math.hypot((b.x - a.x) * scaleX, (b.y - a.y) * scaleY);\n  }\n  return total;\n}\nvar SELF_LOOP_MIN_PX = 12;\nvar SELF_LOOP_MAX_PX = 40;\nfunction selfLoopReach(segments, scale) {\n  const nodePx = polylinePx(segments, scale, scale);\n  const reachPx = Math.min(\n    SELF_LOOP_MAX_PX,\n    Math.max(SELF_LOOP_MIN_PX, nodePx / 2)\n  );\n  return reachPx / Math.max(scale, Number.EPSILON);\n}\nfunction selfLinkOf(edge) {\n  if (edge.from !== edge.to) {\n    return false;\n  }\n  return edge.fromStrand && edge.toStrand && edge.fromStrand !== edge.toStrand ? edge.fromStrand === \"+\" ? \"end\" : \"start\" : true;\n}\nfunction edgeJoinOf(edge, stranded = false) {\n  const self = selfLinkOf(edge);\n  if (!stranded) {\n    return self;\n  }\n  const sides = strandSides(edge);\n  return self === false ? sides : sides.from === sides.to ? sides.from : true;\n}\nfunction hairpinCurves(attach, reach) {\n  const { at, inward } = attach;\n  const dx = inward ? at.x - inward.x : 1;\n  const dy = inward ? at.y - inward.y : 0;\n  const len = Math.hypot(dx, dy) || 1;\n  const ux = dx / len;\n  const uy = dy / len;\n  const px = at.x;\n  const py = at.y;\n  const nearX = px + ux * reach / 3;\n  const nearY = py + uy * reach / 3;\n  const apexX = px + ux * reach;\n  const apexY = py + uy * reach;\n  const sideX = -uy * reach / 2;\n  const sideY = ux * reach / 2;\n  return [\n    {\n      x0: px,\n      y0: py,\n      cx0: nearX,\n      cy0: nearY,\n      cx1: apexX + sideX,\n      cy1: apexY + sideY,\n      x1: apexX,\n      y1: apexY\n    },\n    {\n      x0: apexX,\n      y0: apexY,\n      cx0: apexX - sideX,\n      cy0: apexY - sideY,\n      cx1: nearX,\n      cy1: nearY,\n      x1: px,\n      y1: py\n    }\n  ];\n}\nfunction computeEdgeCurves(fromSegments, toSegments, join, axis, bypassed = [], maxBowIn) {\n  const scale = axis.scaleX;\n  const yToX = yToXOf(axis);\n  const maxBow = maxBowIn ?? (axis.pixelRows ? MAX_ROW_BOW_PX : void 0);\n  if (join === false) {\n    join = heldFacingSides(fromSegments, toSegments);\n  }\n  if (yToX !== 1) {\n    return unscaleYOf(\n      computeEdgeCurves(\n        scaleYOf(fromSegments, yToX),\n        scaleYOf(toSegments, yToX),\n        join,\n        { scaleX: scale, scaleY: scale },\n        scaleYOf(bypassed, yToX),\n        // the cap is a y measure and the body works in x units, so it converts\n        // with everything else that crosses this boundary\n        maxBow === void 0 ? void 0 : maxBow * yToX\n      ),\n      yToX\n    );\n  }\n  if (typeof join === \"string\") {\n    return hairpinCurves(\n      attachment(fromSegments, join),\n      selfLoopReach(fromSegments, scale)\n    );\n  }\n  const loop = join === true;\n  const sides = join === true ? { from: \"end\", to: \"start\" } : join;\n  const fromAttach = attachment(fromSegments, sides.from);\n  const toAttach = attachment(toSegments, sides.to);\n  const fromEnd = fromAttach.at;\n  const toStart = toAttach.at;\n  const p1x = fromEnd.x;\n  const p1y = fromEnd.y;\n  const p2x = toStart.x;\n  const p2y = toStart.y;\n  if (loop) {\n    let segDirX = 1;\n    let segDirY = 0;\n    if (fromAttach.inward) {\n      const dx = fromEnd.x - fromAttach.inward.x;\n      const dy = fromEnd.y - fromAttach.inward.y;\n      const len = Math.hypot(dx, dy);\n      if (len > 0) {\n        segDirX = dx / len;\n        segDirY = dy / len;\n      }\n    }\n    const ext = selfLoopReach(fromSegments, scale);\n    const perpX = -segDirY;\n    const perpY = segDirX;\n    const midX = (fromEnd.x + toStart.x) / 2 + perpX * ext;\n    const midY = (fromEnd.y + toStart.y) / 2 + perpY * ext;\n    const cp1x = p1x + segDirX * ext;\n    const cp1y = p1y + segDirY * ext;\n    const cp2x = p2x - segDirX * ext;\n    const cp2y = p2y - segDirY * ext;\n    return [\n      {\n        x0: p1x,\n        y0: p1y,\n        cx0: cp1x,\n        cy0: cp1y,\n        cx1: cp1x + perpX * ext,\n        cy1: cp1y + perpY * ext,\n        x1: midX,\n        y1: midY\n      },\n      {\n        x0: midX,\n        y0: midY,\n        cx0: cp2x + perpX * ext,\n        cy0: cp2y + perpY * ext,\n        cx1: cp2x,\n        cy1: cp2y,\n        x1: p2x,\n        y1: p2y\n      }\n    ];\n  } else {\n    const fromPrev = fromAttach.inward ?? {\n      x: fromEnd.x - (toStart.x - fromEnd.x),\n      y: fromEnd.y - (toStart.y - fromEnd.y)\n    };\n    const toNext = toAttach.inward ?? {\n      x: toStart.x - (fromEnd.x - toStart.x),\n      y: toStart.y - (fromEnd.y - toStart.y)\n    };\n    const dist = Math.hypot(p2x - p1x, p2y - p1y);\n    const tangentProj = (prev, at, towardX, towardY) => {\n      const dx = at.x - prev.x;\n      const dy = at.y - prev.y;\n      const len = Math.hypot(dx, dy);\n      const along = len === 0 ? 0 : (towardX * dx + towardY * dy) / len;\n      return Math.max(\n        0,\n        Math.min(dist * TANGENT_SPAN_FACTOR, MAX_TANGENT, along * 0.5)\n      );\n    };\n    const towardToX = toStart.x - fromEnd.x;\n    const towardToY = toStart.y - fromEnd.y;\n    const [cx1, cy1] = projectLine(\n      fromPrev.x,\n      fromPrev.y,\n      fromEnd.x,\n      fromEnd.y,\n      tangentProj(fromPrev, fromEnd, towardToX, towardToY)\n    );\n    const [cx2, cy2] = projectLine(\n      toNext.x,\n      toNext.y,\n      toStart.x,\n      toStart.y,\n      tangentProj(toNext, toStart, -towardToX, -towardToY)\n    );\n    const bulge = bypassed.length ? bowAround(p1x, p1y, p2x, p2y, bypassed, maxBow) : 0;\n    const chordLen = dist === 0 ? 1 : dist;\n    const ux = (p2x - p1x) / chordLen;\n    const uy = (p2y - p1y) / chordLen;\n    const bulgeX = -uy * bulge;\n    const bulgeY = ux * bulge;\n    const spreadX = ux * Math.abs(bulge);\n    const spreadY = uy * Math.abs(bulge);\n    return [\n      {\n        x0: p1x,\n        y0: p1y,\n        cx0: cx1 + bulgeX - spreadX,\n        cy0: cy1 + bulgeY - spreadY,\n        cx1: cx2 + bulgeX + spreadX,\n        cy1: cy2 + bulgeY + spreadY,\n        x1: p2x,\n        y1: p2y\n      }\n    ];\n  }\n}\nfunction nearerEnd(segments, to) {\n  const start = segments[0];\n  const end = segments.at(-1);\n  return Math.hypot(start.x - to.x, start.y - to.y) < Math.hypot(end.x - to.x, end.y - to.y) ? \"start\" : \"end\";\n}\nfunction routedEdgeCurves(fromSegments, toSegments, route, sides) {\n  const fromAttach = attachment(\n    fromSegments,\n    sides?.from ?? nearerEnd(fromSegments, route[0])\n  );\n  const toAttach = attachment(\n    toSegments,\n    sides?.to ?? nearerEnd(toSegments, route.at(-1))\n  );\n  const points = [fromAttach.at, ...route, toAttach.at];\n  const tangent = (i) => {\n    const p = points[i];\n    const span = (q) => Math.hypot(q.x - p.x, q.y - p.y);\n    const along = (inward, next) => {\n      const len = inward ? span(inward) : 0;\n      const reach = span(next);\n      return len === 0 ? { x: next.x - p.x, y: next.y - p.y } : {\n        x: (p.x - inward.x) / len * reach,\n        y: (p.y - inward.y) / len * reach\n      };\n    };\n    if (i === 0) {\n      return along(fromAttach.inward, points[1]);\n    }\n    if (i === points.length - 1) {\n      const out = along(toAttach.inward, points[i - 1]);\n      return { x: -out.x, y: -out.y };\n    }\n    return {\n      x: (points[i + 1].x - points[i - 1].x) / 2,\n      y: (points[i + 1].y - points[i - 1].y) / 2\n    };\n  };\n  const curves = [];\n  for (let i = 0; i < points.length - 1; i++) {\n    const a = points[i];\n    const b = points[i + 1];\n    const ta = tangent(i);\n    const tb = tangent(i + 1);\n    curves.push({\n      x0: a.x,\n      y0: a.y,\n      cx0: a.x + ta.x / 3,\n      cy0: a.y + ta.y / 3,\n      cx1: b.x - tb.x / 3,\n      cy1: b.y - tb.y / 3,\n      x1: b.x,\n      y1: b.y\n    });\n  }\n  return curves;\n}\n\nexport {\n  svgPath,\n  projectLine,\n  curvePointAt,\n  curveMidpoint,\n  curveBounds,\n  dashCurves,\n  dashSpans,\n  slideAt,\n  slideCurves,\n  translateCurves,\n  ownStrand,\n  strandSides,\n  bowAround,\n  yToXOf,\n  PATH_RIBBON_SPACING_PX,\n  pathRibbonOffsets,\n  polylinePx,\n  selfLinkOf,\n  edgeJoinOf,\n  computeEdgeCurves,\n  routedEdgeCurves\n};\n", "// src/util/weakMemo.ts\nfunction weakMemo() {\n  const cache = /* @__PURE__ */ new WeakMap();\n  return (key, deps, compute) => {\n    const hit = cache.get(key);\n    if (hit?.deps.length === deps.length && hit.deps.every((d, i) => Object.is(d, deps[i]))) {\n      return hit.value;\n    }\n    const value = compute();\n    cache.set(key, { deps, value });\n    return value;\n  };\n}\n\nexport {\n  weakMemo\n};\n", "// src/overlayLabels.ts\nvar LABEL_PX = 11;\nvar LABEL_CHAR_PX = 6.2;\nvar LABEL_PAD = 4;\nfunction labelWidth(text) {\n  return text.length * LABEL_CHAR_PX + LABEL_PAD * 2;\n}\nfunction overlaps(a, b) {\n  return a.x0 < b.x1 && a.x1 > b.x0 && a.y0 < b.y1 && a.y1 > b.y0;\n}\nfunction offFrame(box, frame) {\n  return box.x1 <= 0 || box.x0 >= frame.width || box.y1 <= 0 || box.y0 >= frame.height;\n}\nfunction insideFrame(box, frame) {\n  return box.x0 >= 0 && box.x1 <= frame.width && box.y0 >= 0 && box.y1 <= frame.height;\n}\nfunction occupancy(frame, reserved = []) {\n  const placed = [...reserved];\n  return (box) => {\n    if (offFrame(box, frame) || placed.some((p) => overlaps(p, box))) {\n      return false;\n    }\n    placed.push(box);\n    return true;\n  };\n}\nfunction placeLabels(candidates, frame, take) {\n  const out = [];\n  const row = LABEL_PX + LABEL_PAD * 2;\n  const stackFrom = (c, text, from, direction) => {\n    const w = labelWidth(text);\n    let crowded = false;\n    for (let tries = 0; tries <= (c.stack ?? 0); tries++) {\n      const y = from + direction * tries * row;\n      const box = {\n        x0: c.x - w / 2,\n        x1: c.x + w / 2,\n        y0: y - LABEL_PX - LABEL_PAD,\n        y1: y + LABEL_PAD\n      };\n      if (offFrame(box, frame)) {\n        break;\n      }\n      if (insideFrame(box, frame) && (c.fits?.(box) ?? true)) {\n        if (take(box)) {\n          return { placed: { ...c, text, y, w }, crowded };\n        }\n        crowded = true;\n      }\n    }\n    return { placed: void 0, crowded };\n  };\n  const place = (c, text) => {\n    const first = stackFrom(c, text, c.y, c.y > frame.height / 2 ? -1 : 1);\n    return first.placed ?? (c.flipY === void 0 || first.crowded ? void 0 : stackFrom(c, text, c.flipY, c.flipY < c.y ? -1 : 1).placed);\n  };\n  for (const c of candidates) {\n    const placed = place(c, c.text) ?? (c.fallback === void 0 ? void 0 : place(c, c.fallback));\n    if (placed) {\n      out.push(placed);\n    }\n  }\n  return out;\n}\n\nexport {\n  LABEL_PX,\n  LABEL_CHAR_PX,\n  LABEL_PAD,\n  labelWidth,\n  overlaps,\n  occupancy,\n  placeLabels\n};\n", "import {\n  ownStrand,\n  strandSides\n} from \"./chunk-JJV2GT2Z.js\";\nimport {\n  pushTo\n} from \"./chunk-BSOZW3FC.js\";\nimport {\n  isBackbone\n} from \"./chunk-RJWPJCIB.js\";\n\n// src/layout/mergeRuns.ts\nfunction flip(strand) {\n  return strand === \"+\" ? \"-\" : \"+\";\n}\nfunction mergeRuns(graph, alone = /* @__PURE__ */ new Set()) {\n  const sides = graph.edges.map(strandSides);\n  const at = /* @__PURE__ */ new Map();\n  const attach = (id, side, ei) => {\n    pushTo(at, `${id}|${side}`, ei);\n  };\n  graph.edges.forEach((edge, ei) => {\n    attach(edge.from, sides[ei].from, ei);\n    attach(edge.to, sides[ei].to, ei);\n  });\n  const joinAfter = (a) => {\n    const out = at.get(`${a}|end`);\n    if (out?.length !== 1) {\n      return void 0;\n    }\n    const ei = out[0];\n    const edge = graph.edges[ei];\n    return edge.from === a && edge.to !== a && !alone.has(a) && !alone.has(edge.to) && sides[ei].from === \"end\" && sides[ei].to === \"start\" && at.get(`${edge.to}|start`)?.length === 1 ? ei : void 0;\n  };\n  const joined = /* @__PURE__ */ new Set();\n  const runOf = /* @__PURE__ */ new Map();\n  const runs = /* @__PURE__ */ new Map();\n  for (const node of graph.nodes) {\n    const into = at.get(`${node.id}|start`);\n    const pred = into?.length === 1 ? graph.edges[into[0]].from : void 0;\n    if (runOf.has(node.id) || pred !== void 0 && joinAfter(pred) === into[0]) {\n      continue;\n    }\n    const run = [node.id];\n    for (; ; ) {\n      const ei = joinAfter(run.at(-1));\n      const next = ei === void 0 ? void 0 : graph.edges[ei].to;\n      if (next === void 0 || runOf.has(next)) {\n        break;\n      }\n      joined.add(ei);\n      run.push(next);\n    }\n    for (const id of run) {\n      runOf.set(id, node.id);\n    }\n    if (run.length > 1) {\n      runs.set(node.id, run);\n    }\n  }\n  for (const node of graph.nodes) {\n    if (!runOf.has(node.id)) {\n      runOf.set(node.id, node.id);\n    }\n  }\n  const byId = new Map(graph.nodes.map((n) => [n.id, n]));\n  const nodes = [];\n  for (const node of graph.nodes) {\n    if (runOf.get(node.id) !== node.id) {\n      continue;\n    }\n    const run = runs.get(node.id);\n    if (!run) {\n      nodes.push(node);\n      continue;\n    }\n    const members = run.map((id) => byId.get(id));\n    const backbone = members.filter(isBackbone);\n    const first = backbone.length ? backbone.reduce((a, b) => a.stable.start <= b.stable.start ? a : b) : members[0];\n    nodes.push({\n      id: node.id,\n      name: node.name,\n      length: members.reduce((sum, n) => sum + n.length, 0),\n      depth: node.depth,\n      stable: first.stable\n    });\n  }\n  const seen = /* @__PURE__ */ new Set();\n  const edges = [];\n  graph.edges.forEach((edge, ei) => {\n    const from = runOf.get(edge.from);\n    const to = runOf.get(edge.to);\n    const side = sides[ei];\n    const key = `${from}|${side.from}>${to}|${side.to}`;\n    if (joined.has(ei) || seen.has(key)) {\n      return;\n    }\n    seen.add(key);\n    edges.push({\n      from,\n      to,\n      ...side.from === \"start\" ? { fromStrand: flip(ownStrand(from)) } : {},\n      ...side.to === \"end\" ? { toStrand: flip(ownStrand(to)) } : {}\n    });\n  });\n  return {\n    graph: { ...graph, nodes, edges, paths: void 0, pathVisits: void 0 },\n    runs\n  };\n}\nfunction splitRuns(positions, runs, weightOf) {\n  const out = { ...positions };\n  for (const [id, members] of runs) {\n    const line = positions[id];\n    if (!line?.length) {\n      continue;\n    }\n    delete out[id];\n    const arc = arcPrefix(line);\n    const total = arc.at(-1);\n    const weights = members.map((m) => Math.max(weightOf(m), 0));\n    const weightSum = weights.reduce((a, b) => a + b, 0);\n    let from = 0;\n    members.forEach((member, k) => {\n      const share = weightSum ? weights[k] / weightSum * total : total / members.length;\n      const to = k === members.length - 1 ? total : from + share;\n      out[member] = slice(line, arc, from, to);\n      from = to;\n    });\n  }\n  return out;\n}\nfunction polylineSlice(line, from, to) {\n  if (line.length === 0) {\n    return [];\n  }\n  const arc = arcPrefix(line);\n  const total = arc.at(-1);\n  return slice(line, arc, from * total, to * total);\n}\nfunction polylineMidpoint(line) {\n  const arc = arcPrefix(line);\n  return pointAt(line, arc, arc.at(-1) / 2);\n}\nfunction arcPrefix(line) {\n  const arc = [0];\n  for (let i = 1; i < line.length; i++) {\n    arc.push(\n      arc[i - 1] + Math.hypot(line[i].x - line[i - 1].x, line[i].y - line[i - 1].y)\n    );\n  }\n  return arc;\n}\nfunction firstReaching(arc, s) {\n  let lo = 0;\n  let hi = arc.length;\n  while (lo < hi) {\n    const mid = lo + hi >> 1;\n    if (arc[mid] < s) {\n      lo = mid + 1;\n    } else {\n      hi = mid;\n    }\n  }\n  return lo;\n}\nfunction pointAt(line, arc, s) {\n  if (s <= 0) {\n    return { ...line[0] };\n  }\n  const i = firstReaching(arc, s);\n  if (i >= arc.length) {\n    return { ...line.at(-1) };\n  }\n  const span = arc[i] - arc[i - 1];\n  const t = span > 0 ? (s - arc[i - 1]) / span : 0;\n  const a = line[i - 1];\n  const b = line[i];\n  return { x: a.x + (b.x - a.x) * t, y: a.y + (b.y - a.y) * t };\n}\nfunction slice(line, arc, from, to) {\n  const points = [pointAt(line, arc, from)];\n  for (let i = firstReaching(arc, from); i < line.length && arc[i] < to; i++) {\n    if (arc[i] > from) {\n      points.push({ ...line[i] });\n    }\n  }\n  points.push(pointAt(line, arc, to));\n  return points;\n}\n\nexport {\n  mergeRuns,\n  splitRuns,\n  polylineSlice,\n  polylineMidpoint\n};\n", "import {\n  pathOrigin,\n  trimOrigins\n} from \"./chunk-QBI6SC74.js\";\nimport {\n  PathVisitsBuilder\n} from \"./chunk-BEUTROKU.js\";\nimport {\n  isBackbone,\n  overlapsWindow\n} from \"./chunk-RJWPJCIB.js\";\n\n// src/layout/trimToWindow.ts\nfunction trimToWindow(graph, window) {\n  const inWindow = new Set(\n    graph.nodes.filter((n) => isBackbone(n) && overlapsWindow(n, window)).map((n) => n.id)\n  );\n  const paths = graph.paths ?? [];\n  if (inWindow.size === 0 || paths.length === 0) {\n    return graph;\n  }\n  const spans = paths.map((path) => {\n    let first = -1;\n    let last = -1;\n    path.nodeIds.forEach((id, i) => {\n      if (inWindow.has(id)) {\n        if (first < 0) {\n          first = i;\n        }\n        last = i;\n      }\n    });\n    return first < 0 ? void 0 : { first, last };\n  });\n  if (spans.every(\n    (span, i) => span?.first === 0 && span.last === paths[i].nodeIds.length - 1\n  )) {\n    return graph;\n  }\n  const kept = /* @__PURE__ */ new Set();\n  const trimmed = [];\n  const stretches = /* @__PURE__ */ new Map();\n  paths.forEach((path, i) => {\n    const span = spans[i];\n    if (span) {\n      const nodeIds = path.nodeIds.slice(span.first, span.last + 1);\n      for (const id of nodeIds) {\n        kept.add(id);\n      }\n      trimmed.push({ ...path, nodeIds });\n      stretches.set(path.name, { first: span.first, nodeIds });\n    }\n  });\n  return {\n    ...graph,\n    nodes: graph.nodes.filter((n) => kept.has(n.id)),\n    edges: graph.edges.filter((e) => kept.has(e.from) && kept.has(e.to)),\n    paths: trimmed,\n    pathVisits: graph.pathVisits && trimVisits(\n      graph.pathVisits,\n      paths,\n      spans,\n      new Map(graph.nodes.map((n) => [n.id, n.name]))\n    ),\n    anchorPaths: trimOrigins(graph, stretches)\n  };\n}\nfunction trimVisits(visits, paths, spans, nameOf) {\n  const next = visits.replay();\n  const out = new PathVisitsBuilder();\n  paths.forEach((path, p) => {\n    const origin = visits.pathIndex(pathOrigin(path.name).name);\n    const span = spans[p];\n    path.nodeIds.forEach((id, i) => {\n      const segment = nameOf.get(id) ?? id;\n      const at = next(visits.slot(segment), origin);\n      if (at >= 0 && span && i >= span.first && i <= span.last) {\n        out.add(\n          segment,\n          visits.paths[origin],\n          visits.samples[origin],\n          visits.start[at],\n          visits.reversed[at] === 1\n        );\n      }\n    });\n  });\n  return out.build();\n}\nfunction clipToWindow(graph, window, reachBp) {\n  const nodes = graph.nodes.map((node) => {\n    if (!isBackbone(node)) {\n      return node;\n    }\n    const from = node.stable.start;\n    const to = from + node.length;\n    const [start, end] = overlapsWindow(node, window) ? [Math.max(from, window.start), Math.min(to, window.end)] : to <= window.start ? [Math.max(from, to - reachBp), to] : [from, Math.min(to, from + reachBp)];\n    return start === from && end === to ? node : {\n      ...node,\n      length: end - start,\n      stable: { ...node.stable, start },\n      unclipped: { start: from, length: node.length }\n    };\n  });\n  return nodes.some((node, i) => node !== graph.nodes[i]) ? { ...graph, nodes } : graph;\n}\nfunction unclipped(graph) {\n  return graph.nodes.some((n) => n.unclipped) ? {\n    ...graph,\n    nodes: graph.nodes.map(\n      ({ unclipped: full, ...node }) => full && node.stable ? {\n        ...node,\n        length: full.length,\n        stable: { ...node.stable, start: full.start }\n      } : node\n    )\n  } : graph;\n}\n\nexport {\n  trimToWindow,\n  clipToWindow,\n  unclipped\n};\n", "import {\n  unclipped\n} from \"./chunk-L2FHURWV.js\";\nimport {\n  referenceVisits\n} from \"./chunk-QBI6SC74.js\";\nimport {\n  computeEdgeCurves,\n  edgeJoinOf,\n  routedEdgeCurves,\n  strandSides\n} from \"./chunk-JJV2GT2Z.js\";\nimport {\n  groupBy\n} from \"./chunk-BSOZW3FC.js\";\nimport {\n  firstNodeAtOrAfter,\n  isBackbone\n} from \"./chunk-RJWPJCIB.js\";\nimport {\n  partitionPoint\n} from \"./chunk-HOAIOEI7.js\";\n\n// src/deletionEdges.ts\nvar MIN_DELETION_BP = 1;\nvar deletionKey = (reference) => `skips ${reference ?? \"the reference\"} sequence (a deletion)`;\nfunction bypassedPoints(nodePositions, bypassed) {\n  return bypassed.flatMap((id) => nodePositions[id] ?? []);\n}\nfunction edgeCurvesOf(nodePositions, edge, axis, bypassed, route, stranded) {\n  const from = nodePositions[edge.from];\n  const to = nodePositions[edge.to];\n  if (!from?.length || !to?.length) {\n    return void 0;\n  }\n  return route ? routedEdgeCurves(\n    from,\n    to,\n    route,\n    stranded ? strandSides(edge) : void 0\n  ) : computeEdgeCurves(\n    from,\n    to,\n    edgeJoinOf(edge, stranded),\n    axis,\n    bypassed ? bypassedPoints(nodePositions, bypassed) : []\n  );\n}\nfunction backboneBySequence(graph) {\n  const bySequence = groupBy(\n    graph.nodes.filter(isBackbone),\n    (node) => node.stable.refName\n  );\n  for (const list of bySequence.values()) {\n    list.sort((a, b) => a.stable.start - b.stable.start);\n  }\n  return bySequence;\n}\nfunction bypassedNodes(nodes, start, end) {\n  const bypassed = [];\n  if (nodes) {\n    for (let i = firstNodeAtOrAfter(nodes, start); i < nodes.length; i++) {\n      const node = nodes[i];\n      if (node.stable.start >= end) {\n        break;\n      }\n      if (node.stable.start + node.length <= end) {\n        bypassed.push(node.id);\n      }\n    }\n  }\n  return bypassed;\n}\nfunction skipsBetween(edge, from, to, forwards) {\n  const { fromStrand, toStrand } = edge;\n  if (fromStrand === void 0 || toStrand === void 0) {\n    return true;\n  }\n  const leavesRight = fromStrand === from.strand;\n  const arrivesLeft = toStrand === to.strand;\n  return forwards ? leavesRight && arrivesLeft : !leavesRight && !arrivesLeft;\n}\nfunction skippedSpan(edge, from, to, visitsOf) {\n  let best;\n  for (const a of visitsOf(from)) {\n    for (const b of visitsOf(to)) {\n      const forwards = a.start <= b.start;\n      const span = forwards ? { start: a.start + from.length, end: b.start } : { start: b.start + to.length, end: a.start };\n      if (skipsBetween(edge, a, b, forwards) && (!best || Math.abs(span.end - span.start) < Math.abs(best.end - best.start))) {\n        best = span;\n      }\n    }\n  }\n  return best;\n}\nvar COPY_SWITCH_SHARE = 0.01;\nfunction repeatCopies(backbone, visitsOf) {\n  const bySequence = /* @__PURE__ */ new Map();\n  for (const [refName, nodes] of backbone) {\n    const copies = nodes.flatMap((node) => {\n      const starts = visitsOf(node).map((v) => v.start);\n      return starts.slice(1).map((next, i) => ({\n        at: starts[i],\n        copy: next - starts[i]\n      }));\n    });\n    if (copies.length) {\n      bySequence.set(\n        refName,\n        copies.sort((a, b) => a.at - b.at)\n      );\n    }\n  }\n  return bySequence;\n}\nfunction switchesCopy(copies, start, bp) {\n  if (!copies) {\n    return false;\n  }\n  const i = partitionPoint(copies.length, (k) => copies[k].at < start);\n  const near = [copies[i - 1], copies[i]].filter((c) => c !== void 0).sort((a, b) => Math.abs(a.at - start) - Math.abs(b.at - start))[0];\n  return near !== void 0 && Math.abs(near.at - start) <= near.copy && Math.abs(bp - near.copy) <= near.copy * COPY_SWITCH_SHARE;\n}\nfunction backboneLinks(cut) {\n  const graph = unclipped(cut);\n  const byId = new Map(graph.nodes.map((n) => [n.id, n]));\n  const backbone = backboneBySequence(graph);\n  const visitsOf = referenceVisits(graph);\n  const links = graph.edges.flatMap((edge, edgeIndex) => {\n    const from = byId.get(edge.from);\n    const to = byId.get(edge.to);\n    return !edge.foldBridge && from !== void 0 && to !== void 0 && isBackbone(from) && isBackbone(to) && from.stable.refName === to.stable.refName ? [\n      {\n        edgeIndex,\n        edge,\n        refName: from.stable.refName,\n        span: skippedSpan(edge, from, to, visitsOf)\n      }\n    ] : [];\n  });\n  return { links, backbone, copies: repeatCopies(backbone, visitsOf) };\n}\nfunction deletionEdges(cut) {\n  const { links, backbone, copies } = backboneLinks(cut);\n  return links.flatMap(({ edgeIndex, edge, refName, span }) => {\n    const bp = span ? span.end - span.start : 0;\n    return span && bp >= MIN_DELETION_BP && !switchesCopy(copies.get(refName), span.start, bp) ? [\n      {\n        edgeIndex,\n        from: edge.from,\n        to: edge.to,\n        ...edge.fromStrand ? { fromStrand: edge.fromStrand } : {},\n        ...edge.toStrand ? { toStrand: edge.toStrand } : {},\n        refName,\n        start: span.start,\n        end: span.end,\n        bp,\n        bypassed: bypassedNodes(\n          backbone.get(refName),\n          span.start,\n          span.end\n        )\n      }\n    ] : [];\n  });\n}\nfunction closableLinks(graph, edgeIndexes) {\n  const parent = /* @__PURE__ */ new Map();\n  const root = (id) => {\n    let r = id;\n    while (parent.has(r)) {\n      r = parent.get(r);\n    }\n    if (r !== id) {\n      parent.set(id, r);\n    }\n    return r;\n  };\n  const join = (a, b) => {\n    const [ra, rb] = [root(a), root(b)];\n    if (ra !== rb) {\n      parent.set(ra, rb);\n    }\n    return ra !== rb;\n  };\n  const candidates = new Set(edgeIndexes);\n  graph.edges.forEach((e, ei) => {\n    if (!candidates.has(ei)) {\n      join(e.from, e.to);\n    }\n  });\n  return new Set(\n    edgeIndexes.filter((ei) => {\n      const edge = graph.edges[ei];\n      return !join(edge.from, edge.to);\n    })\n  );\n}\nfunction dashedDeletions(shown, lift) {\n  return lift?.walks.length ? shown.filter((d) => !lift.edgeIndexes.has(d.edgeIndex)) : shown;\n}\nvar drawings = /* @__PURE__ */ new WeakMap();\nfunction deletionDrawing(graph, deletions, show = true) {\n  let byShow = drawings.get(deletions);\n  if (!byShow) {\n    byShow = /* @__PURE__ */ new Map();\n    drawings.set(deletions, byShow);\n  }\n  let drawing = byShow.get(show);\n  if (!drawing) {\n    const hidden = show ? /* @__PURE__ */ new Set() : closableLinks(\n      graph,\n      deletions.map((d) => d.edgeIndex)\n    );\n    drawing = {\n      shown: deletions.filter((d) => !hidden.has(d.edgeIndex)),\n      bypassed: new Map(deletions.map((d) => [d.edgeIndex, d.bypassed])),\n      hidden\n    };\n    byShow.set(show, drawing);\n  }\n  return drawing;\n}\n\nexport {\n  deletionKey,\n  edgeCurvesOf,\n  deletionEdges,\n  closableLinks,\n  dashedDeletions,\n  deletionDrawing\n};\n", "import {\n  weakMemo\n} from \"./chunk-HMXCN6PG.js\";\nimport {\n  labelWidth,\n  occupancy\n} from \"./chunk-S43IBA5Y.js\";\nimport {\n  polylineMidpoint\n} from \"./chunk-HNNP5QUN.js\";\nimport {\n  edgeCurvesOf\n} from \"./chunk-TJLERGAI.js\";\nimport {\n  curveBounds,\n  curveMidpoint,\n  polylinePx\n} from \"./chunk-JJV2GT2Z.js\";\n\n// src/graphLabels.ts\nvar MIN_DELETION_LABEL_PX = 26;\nvar PX_PER_NODE_LABEL = 4e4;\nvar MIN_NODE_LABELS = 8;\nvar LEADER_GAP_PX = 8;\nvar LABEL_CHAR_PX = 5.7;\nvar LABEL_PAD_PX = 6;\nvar LABEL_HEIGHT_PX = 13;\nvar LABEL_GAP_PX = 3;\nvar MAX_LABEL_OVERHANG = 2;\nfunction labelHalfWidth(text) {\n  return (text.length * LABEL_CHAR_PX + LABEL_PAD_PX + LABEL_GAP_PX) / 2;\n}\nvar LABEL_HALF_HEIGHT = (LABEL_HEIGHT_PX + LABEL_GAP_PX) / 2;\nvar MIN_LABEL_HALF_WIDTH = labelHalfWidth(\"1 bp\");\nfunction boxAt(halfW, x, y) {\n  return {\n    x0: x - halfW,\n    x1: x + halfW,\n    y0: y - LABEL_HALF_HEIGHT,\n    y1: y + LABEL_HALF_HEIGHT\n  };\n}\nfunction rowLabelBox(text, screenY) {\n  return {\n    x0: 6,\n    x1: 6 + labelWidth(text) + LABEL_GAP_PX,\n    y0: screenY - 8 - LABEL_GAP_PX / 2,\n    y1: screenY + 8 + LABEL_GAP_PX / 2\n  };\n}\nfunction clamp(v, lo, hi) {\n  return hi < lo ? v : Math.min(Math.max(v, lo), hi);\n}\nfunction groupDigits(n) {\n  return String(n).replace(/\\B(?=(\\d{3})+$)/g, \",\");\n}\nfunction formatBp(bp) {\n  const [value, unit] = bp >= 999500 ? [bp / 1e6, \"Mb\"] : bp >= 1e3 ? [bp / 1e3, \"kb\"] : [];\n  if (value === void 0) {\n    return `${bp} bp`;\n  }\n  return `${+value.toFixed(value >= 100 ? 0 : 1)} ${unit}`;\n}\nfunction deletionText(bp) {\n  return `${formatBp(bp)} del`;\n}\nfunction arcOutward(curves, apex, scaleX, scaleY) {\n  const first = curves[0];\n  const last = curves[curves.length - 1];\n  const dx = (apex.x - (first.x0 + last.x1) / 2) * scaleX;\n  const dy = (apex.y - (first.y0 + last.y1) / 2) * scaleY;\n  const len = Math.hypot(dx, dy);\n  return len === 0 ? { x: 0, y: -1 } : { x: dx / len, y: dy / len };\n}\nfunction boxSupport(box, dir) {\n  return Math.abs(dir.x) * (box.x1 - box.x0) / 2 + Math.abs(dir.y) * (box.y1 - box.y0) / 2;\n}\nfunction boxRayCrossing(box, dir) {\n  const halfW = (box.x1 - box.x0) / 2;\n  const halfH = (box.y1 - box.y0) / 2;\n  return Math.min(\n    dir.x === 0 ? Infinity : halfW / Math.abs(dir.x),\n    dir.y === 0 ? Infinity : halfH / Math.abs(dir.y)\n  );\n}\nfunction runBounds(nodeIds, nodePositions) {\n  let minX = Infinity;\n  let minY = Infinity;\n  let maxX = -Infinity;\n  let maxY = -Infinity;\n  for (const id of nodeIds) {\n    for (const p of nodePositions[id] ?? []) {\n      minX = Math.min(minX, p.x);\n      maxX = Math.max(maxX, p.x);\n      minY = Math.min(minY, p.y);\n      maxY = Math.max(maxY, p.y);\n    }\n  }\n  return minX === Infinity ? void 0 : { minX, minY, maxX, maxY };\n}\nvar nodeOrderCache = weakMemo();\nfunction labelOrder(nodePositions, nodeLengths) {\n  return nodeOrderCache(\n    nodePositions,\n    [nodeLengths],\n    () => Object.entries(nodePositions).filter(([id, segments]) => segments.length > 0 && nodeLengths.has(id)).sort(([a], [b]) => nodeLengths.get(b) - nodeLengths.get(a))\n  );\n}\nvar arcCache = weakMemo();\nfunction arcPlacements(nodePositions, deletions, axis, version, routes, stranded) {\n  const { scaleX, scaleY } = axis;\n  return arcCache(\n    nodePositions,\n    [deletions, routes, stranded, scaleX, scaleY, version],\n    () => {\n      const arcs = [];\n      for (const deletion of [...deletions].sort((a, b) => b.bp - a.bp)) {\n        const curves = edgeCurvesOf(\n          nodePositions,\n          deletion,\n          axis,\n          deletion.bypassed,\n          routes?.[deletion.edgeIndex],\n          stranded\n        );\n        const apex = curves ? curveMidpoint(curves) : void 0;\n        if (curves && apex) {\n          const { minX, minY, maxX, maxY } = curveBounds(curves);\n          arcs.push({\n            deletion,\n            curves,\n            apex,\n            // in screen px, so the two axes' units cannot be added by accident\n            extent: Math.max((maxX - minX) * scaleX, (maxY - minY) * scaleY)\n          });\n        }\n      }\n      return arcs;\n    }\n  );\n}\nfunction sizeLabelCandidates({\n  nodePositions,\n  nodeLengths,\n  deletions,\n  deletionRoutes,\n  stranded = false,\n  alleleDeletions,\n  axis,\n  translateX,\n  translateY,\n  width,\n  height,\n  version = 0\n}) {\n  const { scaleX, scaleY } = axis;\n  const deletionCandidates = [];\n  const nodeCandidates = [];\n  for (const { deletion, curves, apex, extent } of arcPlacements(\n    nodePositions,\n    deletions,\n    axis,\n    version,\n    deletionRoutes,\n    stranded\n  )) {\n    if (extent >= MIN_DELETION_LABEL_PX) {\n      const text = deletionText(deletion.bp);\n      const halfW = labelHalfWidth(text);\n      const box = boxAt(halfW, 0, 0);\n      const arcX = apex.x * scaleX + translateX;\n      const arcY = apex.y * scaleY + translateY;\n      if (arcX < 0 || arcX > width || arcY < 0 || arcY > height) {\n        continue;\n      }\n      const fits = extent >= halfW * 2 / MAX_LABEL_OVERHANG;\n      const bow = arcOutward(curves, apex, scaleX, scaleY);\n      const offset = boxSupport(box, bow) + LEADER_GAP_PX;\n      const x = fits ? arcX : clamp(arcX + bow.x * offset, halfW, width - halfW);\n      const y = fits ? arcY : clamp(\n        arcY + bow.y * offset,\n        LABEL_HALF_HEIGHT,\n        height - LABEL_HALF_HEIGHT\n      );\n      const away = Math.hypot(x - arcX, y - arcY);\n      let leader;\n      if (away > 0) {\n        const dir = { x: (x - arcX) / away, y: (y - arcY) / away };\n        const crossing = boxRayCrossing(box, dir);\n        leader = {\n          arcX,\n          arcY,\n          labelX: x - dir.x * crossing,\n          labelY: y - dir.y * crossing\n        };\n      }\n      deletionCandidates.push({\n        label: {\n          key: `del:${deletion.edgeIndex}`,\n          text,\n          x,\n          y,\n          kind: \"deletion\",\n          leader\n        },\n        box: boxAt(halfW, x, y)\n      });\n    }\n  }\n  const labelledByDeletion = /* @__PURE__ */ new Set();\n  const alleleRuns = [...alleleDeletions ?? []].sort((a, b) => b.bp - a.bp);\n  for (const run of alleleRuns) {\n    const drawn = runBounds(run.nodeIds, nodePositions);\n    if (!drawn) {\n      continue;\n    }\n    const shownLeft = Math.max(drawn.minX * scaleX + translateX, 0);\n    const shownRight = Math.min(drawn.maxX * scaleX + translateX, width);\n    const shownTop = Math.max(drawn.minY * scaleY + translateY, 0);\n    const shownBottom = Math.min(drawn.maxY * scaleY + translateY, height);\n    if (shownRight < shownLeft || shownBottom < shownTop) {\n      continue;\n    }\n    const extent = Math.max(shownRight - shownLeft, shownBottom - shownTop);\n    const text = deletionText(run.bp);\n    const halfW = labelHalfWidth(text);\n    if (extent >= halfW * 2 / MAX_LABEL_OVERHANG) {\n      for (const id of run.nodeIds) {\n        labelledByDeletion.add(id);\n      }\n      const x = clamp((shownLeft + shownRight) / 2, halfW, width - halfW);\n      const y = clamp(\n        (shownTop + shownBottom) / 2,\n        LABEL_HALF_HEIGHT,\n        height - LABEL_HALF_HEIGHT\n      );\n      deletionCandidates.push({\n        label: {\n          key: `alleledel:${run.nodeIds.join(\",\")}`,\n          text,\n          x,\n          y,\n          kind: \"deletion\"\n        },\n        box: boxAt(halfW, x, y)\n      });\n    }\n  }\n  for (const [id, segments] of labelOrder(nodePositions, nodeLengths)) {\n    if (labelledByDeletion.has(id)) {\n      continue;\n    }\n    const { x, y } = polylineMidpoint(segments);\n    const screenY = y * scaleY + translateY;\n    if (screenY + LABEL_HALF_HEIGHT <= 0 || screenY - LABEL_HALF_HEIGHT >= height) {\n      continue;\n    }\n    const drawn = polylinePx(segments, scaleX, scaleY);\n    if (drawn < MIN_LABEL_HALF_WIDTH * 2 / MAX_LABEL_OVERHANG) {\n      continue;\n    }\n    const text = formatBp(nodeLengths.get(id));\n    const halfW = labelHalfWidth(text);\n    if (drawn >= halfW * 2 / MAX_LABEL_OVERHANG) {\n      const screenX = x * scaleX + translateX;\n      nodeCandidates.push({\n        label: {\n          key: `node:${id}`,\n          text,\n          x: screenX,\n          y: screenY,\n          kind: \"node\"\n        },\n        box: boxAt(halfW, screenX, screenY)\n      });\n    }\n  }\n  return { deletions: deletionCandidates, nodes: nodeCandidates };\n}\nfunction nodeLabelBudget(width, height) {\n  return Math.max(\n    MIN_NODE_LABELS,\n    Math.floor(width * height / PX_PER_NODE_LABEL)\n  );\n}\nfunction placeSizeLabels(candidates, take, budget = Infinity) {\n  const labels = [];\n  for (const { label, box } of candidates) {\n    if (labels.length >= budget) {\n      break;\n    }\n    if (take(box)) {\n      labels.push(label);\n    }\n  }\n  return labels;\n}\nfunction graphLabels({\n  reserved,\n  take,\n  ...args\n}) {\n  take ??= occupancy(args, reserved);\n  const { deletions, nodes } = sizeLabelCandidates(args);\n  return [\n    ...placeSizeLabels(deletions, take),\n    ...placeSizeLabels(nodes, take, nodeLabelBudget(args.width, args.height))\n  ];\n}\n\nexport {\n  rowLabelBox,\n  groupDigits,\n  formatBp,\n  sizeLabelCandidates,\n  nodeLabelBudget,\n  placeSizeLabels,\n  graphLabels\n};\n", "import {\n  groupDigits\n} from \"./chunk-74A3MFUM.js\";\nimport {\n  pathOrigin\n} from \"./chunk-QBI6SC74.js\";\nimport {\n  isGenericSample\n} from \"./chunk-2JL2JVZ2.js\";\n\n// src/pathColors.ts\nfunction nameHue(name) {\n  let hash = 0;\n  for (let i = 0; i < name.length; i++) {\n    hash = name.charCodeAt(i) + ((hash << 5) - hash);\n  }\n  return Math.abs(hash % 360);\n}\nfunction pathHueAt(index, count) {\n  return index * 360 / count;\n}\nvar PATH_SATURATION = 0.7;\nvar PATH_LIGHTNESS = 0.5;\nvar MAX_PATH_COLORS = 16;\nfunction pathColorsLegible(pathCount) {\n  return pathCount > 0 && pathCount <= MAX_PATH_COLORS;\n}\nfunction pathCssColor(index, count) {\n  return `hsl(${pathHueAt(index, count)}, ${PATH_SATURATION * 100}%, ${PATH_LIGHTNESS * 100}%)`;\n}\nfunction pathGreyCssColor(index, count) {\n  const lightness = count > 1 ? 25 + 45 * index / (count - 1) : 45;\n  return `hsl(0, 0%, ${lightness}%)`;\n}\nfunction labelTiers(name) {\n  const parts = pathOrigin(name).name.split(\"#\");\n  const full = parts.join(\"#\");\n  if (parts.length >= 3 && isGenericSample(parts[0])) {\n    const contig = parts.slice(2).join(\"#\");\n    return [contig, contig, full];\n  }\n  return [parts[0], parts.slice(0, 2).join(\"#\"), full];\n}\nfunction offsetTiers(name, tiers) {\n  const { start } = pathOrigin(name);\n  return tiers.map((t) => `${t} @${groupDigits(start)}`);\n}\nfunction pathLegend(paths, colors) {\n  const firstOf = /* @__PURE__ */ new Map();\n  paths.forEach((path, i) => {\n    if (!firstOf.has(path.name)) {\n      firstOf.set(path.name, i);\n    }\n  });\n  const entries = [...firstOf].map(([name2, i]) => ({ name: name2, i }));\n  const named = entries.map((e) => labelTiers(e.name));\n  const name = (t) => entries.map((_, k) => named[k][t]);\n  const offset = (t) => entries.map((e, k) => offsetTiers(e.name, named[k])[t]);\n  const candidates = [\n    name(0),\n    name(1),\n    offset(0),\n    name(2),\n    offset(1),\n    offset(2)\n  ];\n  const distinct = candidates.find(\n    (labels2) => new Set(labels2).size === entries.length\n  );\n  const labels = distinct ?? candidates.at(-1);\n  return entries.map(({ name: name2, i }, k) => ({\n    name: name2,\n    label: labels[k],\n    color: colors?.[i] ?? pathCssColor(i, paths.length)\n  }));\n}\nfunction walkLabelsOf(entries) {\n  const seen = /* @__PURE__ */ new Map();\n  return new Map(\n    [...entries].sort((a, b) => a.label.localeCompare(b.label)).map((e) => {\n      const n = (seen.get(e.label) ?? 0) + 1;\n      seen.set(e.label, n);\n      return [e.name, n > 1 ? `${e.label} (${n})` : e.label];\n    })\n  );\n}\n\nexport {\n  nameHue,\n  pathHueAt,\n  PATH_SATURATION,\n  PATH_LIGHTNESS,\n  MAX_PATH_COLORS,\n  pathColorsLegible,\n  pathCssColor,\n  pathGreyCssColor,\n  pathLegend,\n  walkLabelsOf\n};\n", "import {\n  panSNHaplotype\n} from \"./chunk-2JL2JVZ2.js\";\n\n// src/nodeWidths.ts\nvar NODE_WIDTHS = [\n  {\n    value: \"depth\",\n    label: \"By depth\",\n    description: \"Thicker the more paths carry a node, on the square root of its depth against the mean. A graph with one depth everywhere draws uniform.\"\n  },\n  {\n    value: \"frequency\",\n    label: \"By frequency\",\n    description: \"As wide as the share of haplotypes that pass a node, or its AF tag: full width at 100%, half at 50%, and wider where a haplotype passes it more than once.\"\n  },\n  {\n    value: \"uniform\",\n    label: \"Uniform\",\n    description: \"Every node the same thickness.\"\n  }\n];\nvar MIN_FACTOR = 0.3;\nvar MAX_FACTOR = 3;\nvar MIN_FREQUENCY_FACTOR = 0.05;\nfunction meanDepth(graph) {\n  let weighted = 0;\n  let length = 0;\n  for (const node of graph.nodes) {\n    weighted += node.depth * node.length;\n    length += node.length;\n  }\n  return length > 0 ? weighted / length : 0;\n}\nfunction haplotypeOf(path) {\n  return path.sample === void 0 ? panSNHaplotype(path.name) ?? path.name : `${path.sample}#${path.haplotype ?? 0}`;\n}\nfunction haplotypeCount(graph) {\n  return new Set((graph.paths ?? []).map(haplotypeOf)).size;\n}\nfunction nodeFrequency(node, haplotypes) {\n  return node.frequency ?? (haplotypes > 0 ? node.depth / haplotypes : void 0);\n}\nfunction withFrequencies(graph, frequencies) {\n  if (!frequencies) {\n    return graph;\n  }\n  const nodes = graph.nodes.map((node) => {\n    const frequency = frequencies[node.name];\n    return frequency === void 0 ? node : { ...node, frequency };\n  });\n  return { ...graph, nodes };\n}\nfunction widthNorm(graph, nodeWidth) {\n  return nodeWidth === \"depth\" ? meanDepth(graph) : nodeWidth === \"frequency\" ? haplotypeCount(graph) : 0;\n}\nfunction frequencyFactor(f) {\n  return Math.min(MAX_FACTOR, Math.max(MIN_FREQUENCY_FACTOR, f));\n}\nfunction frequencyWidthFactor(node, haplotypes) {\n  const f = nodeFrequency(node, haplotypes);\n  return f === void 0 ? 1 : frequencyFactor(f);\n}\nfunction frequencyKey(contigThickness) {\n  return [1, 0.5, 0.1].map((f) => ({\n    label: `${f * 100}%`,\n    widthPx: contigThickness * frequencyFactor(f)\n  }));\n}\nfunction depthWidthFactor(node, mean) {\n  if (!(mean > 0) || !(node.depth > 0)) {\n    return 1;\n  }\n  return Math.min(\n    MAX_FACTOR,\n    Math.max(MIN_FACTOR, Math.sqrt(node.depth / mean))\n  );\n}\nfunction nodeWidthPx(node, contigThickness, nodeWidth, norm) {\n  return contigThickness * (nodeWidth === \"depth\" ? depthWidthFactor(node, norm) : nodeWidth === \"frequency\" ? frequencyWidthFactor(node, norm) : 1);\n}\nfunction maxNodeWidthPx(contigThickness, nodeWidth) {\n  return contigThickness * (nodeWidth === \"uniform\" ? 1 : MAX_FACTOR);\n}\nvar MIN_WALK_LANE_PX = 4;\nfunction walkLaneWidthPx(width, lanes) {\n  return Math.max(width / lanes, MIN_WALK_LANE_PX);\n}\nfunction nodeInk(graph, nodeById, contigThickness, nodeWidth, lanes = 0) {\n  const norm = graph ? widthNorm(graph, nodeWidth) : 0;\n  const reach = (width) => lanes > 0 ? walkLaneWidthPx(width, lanes) * lanes / 2 : width / 2;\n  return {\n    maxHalfWidthPx: reach(maxNodeWidthPx(contigThickness, nodeWidth)),\n    halfWidthPx: (id) => {\n      const node = nodeById?.get(id);\n      return reach(\n        node ? nodeWidthPx(node, contigThickness, nodeWidth, norm) : contigThickness\n      );\n    }\n  };\n}\n\nexport {\n  NODE_WIDTHS,\n  meanDepth,\n  haplotypeCount,\n  nodeFrequency,\n  withFrequencies,\n  widthNorm,\n  frequencyKey,\n  nodeWidthPx,\n  maxNodeWidthPx,\n  walkLaneWidthPx,\n  nodeInk\n};\n", "// src/edgeWidths.ts\nvar EDGE_WIDTHS = [\n  {\n    value: \"uniform\",\n    label: \"Uniform\",\n    description: \"Every link the same thickness.\"\n  },\n  {\n    value: \"walks\",\n    label: \"By walks\",\n    description: \"Thicker the more walks take a link, on the square root of its count against the busiest link in the cut. A graph without walks draws uniform.\"\n  }\n];\nvar MIN_FACTOR = 0.5;\nvar MAX_FACTOR = 4;\nfunction busiestEdge(graph) {\n  let most = 0;\n  for (const edge of graph.edges) {\n    most = Math.max(most, edge.pathIds?.length ?? 0);\n  }\n  return most;\n}\nfunction edgeWidthFactor(walks, busiest, edgeWidth) {\n  if (edgeWidth === \"uniform\" || busiest === 0) {\n    return 1;\n  }\n  return MIN_FACTOR + (MAX_FACTOR - MIN_FACTOR) * Math.sqrt(walks / busiest);\n}\n\nexport {\n  EDGE_WIDTHS,\n  busiestEdge,\n  edgeWidthFactor\n};\n"],
+  "mappings": "+JACA,IAAIA,GAAgB,GCIpB,SAASC,GAAQC,EAAQ,CACvB,IAAMC,EAASC,GAAM,KAAK,MAAMA,EAAI,GAAG,EAAI,IAC3C,OAAOF,EAAO,IAAI,CAACG,EAAGC,IAAM,GAAGA,EAAI,IAAM,GAAG,GAAGH,EAAME,EAAE,CAAC,CAAC,IAAIF,EAAME,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CACpF,CACA,SAASE,GAAYC,EAAIC,EAAIC,EAAIC,EAAIC,EAAU,CAC7C,IAAMC,EAAI,KAAK,MAAMF,EAAKF,EAAIC,EAAKF,CAAE,EACrC,GAAIK,IAAM,EACR,MAAO,CAACH,EAAIC,CAAE,EAEhB,IAAMG,GAAMJ,EAAKF,GAAMK,EACjBE,GAAMJ,EAAKF,GAAMI,EACvB,MAAO,CAACH,EAAKE,EAAWE,EAAIH,EAAKC,EAAWG,CAAE,CAChD,CACA,SAASC,EAAaC,EAAGC,EAAG,CAC1B,IAAMC,EAAI,EAAID,EACRE,EAAID,EAAIA,EAAIA,EACZE,EAAI,EAAIF,EAAIA,EAAID,EAChBL,EAAI,EAAIM,EAAID,EAAIA,EAChBI,EAAIJ,EAAIA,EAAIA,EAClB,MAAO,CACL,EAAGE,EAAIH,EAAE,GAAKI,EAAIJ,EAAE,IAAMJ,EAAII,EAAE,IAAMK,EAAIL,EAAE,GAC5C,EAAGG,EAAIH,EAAE,GAAKI,EAAIJ,EAAE,IAAMJ,EAAII,EAAE,IAAMK,EAAIL,EAAE,EAC9C,CACF,CACA,SAASM,GAAcC,EAAQ,CAC7B,IAAMC,EAAMD,EAAO,KAAK,MAAMA,EAAO,OAAS,CAAC,CAAC,EAChD,OAAOC,EAAMT,EAAaS,EAAK,EAAG,EAAI,MACxC,CACA,SAASC,GAAYF,EAAQ,CAC3B,IAAIG,EAAO,IACPC,EAAO,IACPC,EAAO,KACPC,EAAO,KACX,QAAWb,KAAKO,EACdG,EAAO,KAAK,IAAIA,EAAMV,EAAE,GAAIA,EAAE,IAAKA,EAAE,IAAKA,EAAE,EAAE,EAC9CY,EAAO,KAAK,IAAIA,EAAMZ,EAAE,GAAIA,EAAE,IAAKA,EAAE,IAAKA,EAAE,EAAE,EAC9CW,EAAO,KAAK,IAAIA,EAAMX,EAAE,GAAIA,EAAE,IAAKA,EAAE,IAAKA,EAAE,EAAE,EAC9Ca,EAAO,KAAK,IAAIA,EAAMb,EAAE,GAAIA,EAAE,IAAKA,EAAE,IAAKA,EAAE,EAAE,EAEhD,MAAO,CAAE,KAAAU,EAAM,KAAAC,EAAM,KAAAC,EAAM,KAAAC,CAAK,CAClC,CACA,SAASC,GAASd,EAAGe,EAAIC,EAAI,CAC3B,IAAMC,EAAKlB,EAAaC,EAAGe,CAAE,EACvBG,EAAKnB,EAAaC,EAAGgB,CAAE,EACvBG,GAAMH,EAAKD,GAAM,EACjBK,EAAKC,GAAerB,EAAGe,CAAE,EACzBO,EAAKD,GAAerB,EAAGgB,CAAE,EAC/B,MAAO,CACL,GAAIC,EAAG,EACP,GAAIA,EAAG,EACP,IAAKA,EAAG,EAAIG,EAAG,EAAID,EACnB,IAAKF,EAAG,EAAIG,EAAG,EAAID,EACnB,IAAKD,EAAG,EAAII,EAAG,EAAIH,EACnB,IAAKD,EAAG,EAAII,EAAG,EAAIH,EACnB,GAAID,EAAG,EACP,GAAIA,EAAG,CACT,CACF,CACA,SAASG,GAAerB,EAAGC,EAAG,CAC5B,IAAMC,EAAI,EAAID,EACRE,EAAI,EAAID,EAAIA,EACZE,EAAI,EAAIF,EAAID,EACZL,EAAI,EAAIK,EAAIA,EAClB,MAAO,CACL,EAAGE,GAAKH,EAAE,IAAMA,EAAE,IAAMI,GAAKJ,EAAE,IAAMA,EAAE,KAAOJ,GAAKI,EAAE,GAAKA,EAAE,KAC5D,EAAGG,GAAKH,EAAE,IAAMA,EAAE,IAAMI,GAAKJ,EAAE,IAAMA,EAAE,KAAOJ,GAAKI,EAAE,GAAKA,EAAE,IAC9D,CACF,CACA,IAAIuB,EAAkB,GACtB,SAASC,GAAiBjB,EAAQkB,EAASC,EAAQC,EAAM,CACvD,IAAMC,EAAY,CAAC,EACfC,EAAQ,EACZ,OAAAtB,EAAO,QAAQ,CAACP,EAAG8B,IAAM,CACvB,IAAMC,EAASN,EAAQK,CAAC,EAClBE,EAAMD,EAASR,EACjBU,EAAOlC,EAAaC,EAAG,CAAC,EAC5B,QAASX,EAAI,EAAGA,GAAKkC,EAAiBlC,IAAK,CACzC,IAAM6C,EAAOnC,EAAaC,EAAGX,EAAIkC,CAAe,EAChD,GAAI,KAAK,IAAIU,EAAK,EAAGC,EAAK,CAAC,EAAIF,GAAON,EAAO,MAAQ,KAAK,IAAIO,EAAK,EAAGC,EAAK,CAAC,EAAIF,GAAON,EAAO,MAAQ,KAAK,IAAIO,EAAK,EAAGC,EAAK,CAAC,EAAIF,EAAML,GAAQD,EAAO,MAAQ,KAAK,IAAIO,EAAK,EAAGC,EAAK,CAAC,EAAIF,EAAML,GAAQD,EAAO,KAAM,CAClN,IAAMS,EAAON,EAAQE,GAAU1C,EAAI,GAAKkC,EAClCa,EAAKP,EAAQE,EAAS1C,EAAIkC,EAC1Bc,EAAOT,EAAU,GAAG,EAAE,EACxBS,GAAQA,EAAK,CAAC,GAAKF,EACrBE,EAAK,CAAC,EAAID,EAEVR,EAAU,KAAK,CAACO,EAAMC,CAAE,CAAC,CAE7B,CACAH,EAAOC,CACT,CACAL,GAASE,CACX,CAAC,EACMH,CACT,CAEA,SAASU,GAAUC,EAAQC,EAAWC,EAAO,EAAGC,EAAQ,CACtD,IAAMC,EAAUJ,EAAO,IACpBK,GAAM,KAAK,MAAMA,EAAE,IAAMA,EAAE,IAAKA,EAAE,IAAMA,EAAE,IAAMH,CAAI,EAAI,KAAK,MAAMG,EAAE,IAAMA,EAAE,KAAMA,EAAE,IAAMA,EAAE,KAAOH,CAAI,EAAI,KAAK,MAAMG,EAAE,GAAKA,EAAE,KAAMA,EAAE,GAAKA,EAAE,KAAOH,CAAI,CAC7J,EACMI,EAAQF,EAAQ,OAAO,CAACG,EAAGC,IAAMD,EAAIC,EAAG,CAAC,EACzCC,EAAU,KAAK,MAAMH,EAAQL,CAAS,EACtCS,EAAQ,KAAK,IAAI,EAAGD,EAAU,EAAIA,EAAUA,EAAU,CAAC,EACvDE,EAAYR,EAASS,GAAiBZ,EAAQI,EAASD,EAAQD,CAAI,EAAI,OACzEW,EAAO,EACLC,EAAM,CAAC,EACb,QAASC,EAAI,EAAGA,EAAIL,EAAOK,GAAK,EAAG,CACjC,IAAMC,EAAOD,EAAIL,EAAQJ,EACnBW,GAAMF,EAAI,GAAKL,EAAQJ,EAC7B,GAAIK,EAAW,CACb,KAAOE,EAAOF,EAAU,QAAUA,EAAUE,CAAI,EAAE,CAAC,EAAIG,GACrDH,IAEF,GAAIA,IAASF,EAAU,OACrB,MAEF,GAAIA,EAAUE,CAAI,EAAE,CAAC,EAAII,EACvB,QAEJ,CACA,IAAMC,EAAO,CAAC,EACRC,EAAQ,CAAC,EACXC,EAAQ,EACZpB,EAAO,QAAQ,CAACK,EAAGgB,IAAM,CACvB,IAAMC,EAASlB,EAAQiB,CAAC,EAClBE,EAAMH,EAAQE,EACpB,GAAIA,EAAS,GAAKC,EAAMP,GAAQI,EAAQH,EAAI,CAC1C,IAAMO,EAAK,KAAK,IAAI,GAAIR,EAAOI,GAASE,CAAM,EACxCG,EAAK,KAAK,IAAI,GAAIR,EAAKG,GAASE,CAAM,EAC5CJ,EAAK,KAAKQ,GAASrB,EAAGmB,EAAIC,CAAE,CAAC,EAC7BN,EAAM,MAAME,EAAIG,GAAMxB,EAAO,QAASqB,EAAII,GAAMzB,EAAO,MAAM,CAC/D,CACAoB,EAAQG,CACV,CAAC,EACGL,EAAK,QACPJ,EAAI,KAAK,CACP,OAAQI,EACR,WAAYC,EAAM,CAAC,EACnB,SAAUA,EAAM,GAAG,EAAE,CACvB,CAAC,CAEL,CACA,OAAOL,CACT,CAKA,SAASa,GAAYC,EAAQC,EAAQC,EAAQC,EAAMC,EAAM,CACvD,IAAMC,EAAIL,EAAO,OACXM,EAAM,IAAI,MAAMD,CAAC,EACvB,QAASE,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CAC1B,IAAMC,EAAIR,EAAOO,CAAC,EACZE,EAAIF,EAAIF,EACRK,GAAKH,EAAI,GAAKF,EACdM,EAAMV,GAAUE,EAAOF,GAAUQ,EACjCG,EAAMV,GAAUE,EAAOF,GAAUO,EACjCI,EAAMZ,GAAUE,EAAOF,GAAUS,EACjCI,EAAMZ,GAAUE,EAAOF,GAAUQ,EACvCJ,EAAIC,CAAC,EAAI,CACP,GAAIC,EAAE,GAAKG,EACX,GAAIH,EAAE,GAAKI,EACX,IAAKJ,EAAE,IAAMG,EACb,IAAKH,EAAE,IAAMI,EACb,IAAKJ,EAAE,IAAMK,EACb,IAAKL,EAAE,IAAMM,EACb,GAAIN,EAAE,GAAKK,EACX,GAAIL,EAAE,GAAKM,CACb,CACF,CACA,OAAOR,CACT,CACA,SAASS,GAAgBf,EAAQgB,EAAIC,EAAI,CACvC,IAAMX,EAAM,IAAI,MAAMN,EAAO,MAAM,EACnC,QAASO,EAAI,EAAGA,EAAIP,EAAO,OAAQO,IAAK,CACtC,IAAMC,EAAIR,EAAOO,CAAC,EAClBD,EAAIC,CAAC,EAAI,CACP,GAAIC,EAAE,GAAKQ,EACX,GAAIR,EAAE,GAAKS,EACX,IAAKT,EAAE,IAAMQ,EACb,IAAKR,EAAE,IAAMS,EACb,IAAKT,EAAE,IAAMQ,EACb,IAAKR,EAAE,IAAMS,EACb,GAAIT,EAAE,GAAKQ,EACX,GAAIR,EAAE,GAAKS,CACb,CACF,CACA,OAAOX,CACT,CACA,SAASY,EAAWC,EAAUC,EAAM,CAClC,IAAMC,EAAOF,EAAS,OAAS,EAC/B,OAAOC,IAAS,MAAQ,CAAE,GAAID,EAASE,CAAI,EAAG,OAAQF,EAASE,EAAO,CAAC,CAAE,EAAI,CAAE,GAAIF,EAAS,CAAC,EAAG,OAAQA,EAAS,CAAC,CAAE,CACtH,CACA,IAAIG,GAAsB,GACtBC,GAAc,GAClB,SAASC,EAAUC,EAAI,CACrB,OAAOA,EAAG,SAAS,GAAG,EAAI,IAAM,GAClC,CACA,SAASC,EAAYC,EAAM,CACzB,IAAMC,EAAM,CAACH,EAAII,KAAYA,GAAUL,EAAUC,CAAE,KAAOD,EAAUC,CAAE,EACtE,MAAO,CACL,KAAMG,EAAID,EAAK,KAAMA,EAAK,UAAU,EAAI,MAAQ,QAChD,GAAIC,EAAID,EAAK,GAAIA,EAAK,QAAQ,EAAI,QAAU,KAC9C,CACF,CACA,SAASG,GAAOX,EAAU,CACxB,IAAIY,EAAM,IACNC,EAAM,KACV,QAAWC,KAAKd,EACdY,EAAM,KAAK,IAAIA,EAAKE,EAAE,CAAC,EACvBD,EAAM,KAAK,IAAIA,EAAKC,EAAE,CAAC,EAEzB,MAAO,CAAE,IAAAF,EAAK,IAAAC,CAAI,CACpB,CACA,SAASE,GAAeC,EAAGC,EAAM,CAC/B,OAAO,KAAK,IAAI,EAAGA,EAAK,IAAMD,EAAGA,EAAIC,EAAK,GAAG,CAC/C,CACA,SAASC,GAAWlB,EAAUmB,EAAOC,EAAU,CAC7C,IAAMC,EAAWN,GAAef,EAAS,CAAC,EAAE,EAAGmB,CAAK,EAC9CG,EAASP,GAAef,EAASA,EAAS,OAAS,CAAC,EAAE,EAAGmB,CAAK,EACpE,OAAOE,IAAaC,EAASF,EAAWC,EAAWC,EAAS,QAAU,KACxE,CACA,SAASC,GAAYC,EAAcC,EAAY,CAC7C,MAAO,CACL,KAAMP,GAAWM,EAAcb,GAAOc,CAAU,EAAG,KAAK,EACxD,GAAIP,GAAWO,EAAYd,GAAOa,CAAY,EAAG,OAAO,CAC1D,CACF,CACA,IAAIE,GAA4B,IAAI,QACpC,SAASC,GAAgBH,EAAcC,EAAY,CACjD,IAAIG,EAAOF,GAAU,IAAIF,CAAY,EAChCI,IACHA,EAAuB,IAAI,QAC3BF,GAAU,IAAIF,EAAcI,CAAI,GAElC,IAAIC,EAAQD,EAAK,IAAIH,CAAU,EAC/B,OAAKI,IACHA,EAAQN,GAAYC,EAAcC,CAAU,EAC5CG,EAAK,IAAIH,EAAYI,CAAK,GAErBA,CACT,CACA,IAAIC,GAAgB,IAChBC,GAAgB,KAChBC,GAAiB,IACjBC,GAAiB,EAAIC,GACzB,SAASC,GAAUC,EAAKC,EAAKC,EAAKC,EAAKC,EAAQC,EAAQ,CACrD,IAAMC,EAAQ,KAAK,MAAMJ,EAAMF,EAAKG,EAAMF,CAAG,EACvCM,EAAKD,IAAU,EAAI,GAAKJ,EAAMF,GAAOM,EACrCE,EAAKF,IAAU,EAAI,GAAKH,EAAMF,GAAOK,EACvCG,EAAQ,EACRC,EAAW,IACXC,EAAW,KACf,QAAWC,KAAKR,EAAQ,CACtB,IAAM3C,EAAKmD,EAAE,EAAIZ,EACXtC,EAAKkD,EAAE,EAAIX,EACXY,EAAOpD,EAAK,CAAC+C,EAAK9C,EAAK6C,EACzB,KAAK,IAAIM,CAAI,EAAI,KAAK,IAAIJ,CAAK,IACjCA,EAAQI,GAEV,IAAMC,EAAQrD,EAAK8C,EAAK7C,EAAK8C,EAC7BE,EAAW,KAAK,IAAIA,EAAUI,CAAK,EACnCH,EAAW,KAAK,IAAIA,EAAUG,CAAK,CACrC,CACA,IAAMjC,EAAOuB,EAAO,OAASO,EAAWD,EAAW,EAC7CK,EAAW,KAAK,IACpB,KAAK,IAAIN,CAAK,EAAId,GAAgBD,GAClCb,EAAOe,EACT,EACMoB,EAAOX,IAAW,OAASU,EAAW,KAAK,IAAIA,EAAUV,CAAM,EACrE,OAAOI,EAAQ,EAAI,CAACO,EAAOA,CAC7B,CACA,SAASC,GAAO,CAAE,OAAAC,EAAQ,OAAAC,CAAO,EAAG,CAClC,OAAOA,EAASD,CAClB,CACA,IAAIE,GAAyB,EAC7B,SAASC,EAAenE,EAAGC,EAAGmE,EAAM,CAClC,IAAM7D,EAAKN,EAAE,EAAID,EAAE,EACbQ,GAAMP,EAAE,EAAID,EAAE,GAAKoE,EACnBC,EAAM,KAAK,MAAM9D,EAAIC,CAAE,EAC7B,OAAO6D,IAAQ,EAAI,OAAS,CAAE,EAAG9D,EAAK8D,EAAK,EAAG7D,EAAK6D,CAAI,CACzD,CACA,SAASC,GAAkBpC,EAAcC,EAAYoC,EAAOC,EAAM,CAChE,IAAMJ,EAAOL,GAAOS,CAAI,EAClBC,EAAUP,GAAyB,KAAK,IAAIM,EAAK,OAAQ,IAAI,EAC7DE,EAAMP,EACVjC,EAAaA,EAAa,OAAS,CAAC,EACpCC,EAAW,CAAC,EACZiC,CACF,GAAKD,EAAejC,EAAa,CAAC,EAAGA,EAAa,GAAG,EAAE,EAAGkC,CAAI,GAAKD,EAAehC,EAAW,CAAC,EAAGA,EAAW,GAAG,EAAE,EAAGiC,CAAI,GAAK,CAAE,EAAG,EAAG,EAAG,CAAE,EACpIO,EAAU,CAAC,EACjB,QAAS,EAAI,EAAG,EAAIJ,EAAO,IAAK,CAC9B,IAAMK,GAAY,GAAKL,EAAQ,GAAK,GAAKE,EACzCE,EAAQ,KAAK,CAAE,EAAG,CAACD,EAAI,EAAIE,EAAU,EAAGF,EAAI,EAAIE,EAAWR,CAAK,CAAC,CACnE,CACA,OAAOO,CACT,CACA,SAASE,EAASC,EAAQV,EAAM,CAC9B,OAAOU,EAAO,IAAKpB,IAAO,CAAE,EAAGA,EAAE,EAAG,EAAGA,EAAE,EAAIU,CAAK,EAAE,CACtD,CACA,SAASW,GAAWxF,EAAQ6E,EAAM,CAChC,QAAWrE,KAAKR,EACdQ,EAAE,IAAMqE,EACRrE,EAAE,KAAOqE,EACTrE,EAAE,KAAOqE,EACTrE,EAAE,IAAMqE,EAEV,OAAO7E,CACT,CACA,SAASyF,EAAWF,EAAQd,EAAQC,EAAQ,CAC1C,IAAIgB,EAAQ,EACZ,QAASnF,EAAI,EAAGA,EAAIgF,EAAO,OAAQhF,IAAK,CACtC,IAAME,EAAI8E,EAAOhF,EAAI,CAAC,EAChBG,EAAI6E,EAAOhF,CAAC,EAClBmF,GAAS,KAAK,OAAOhF,EAAE,EAAID,EAAE,GAAKgE,GAAS/D,EAAE,EAAID,EAAE,GAAKiE,CAAM,CAChE,CACA,OAAOgB,CACT,CACA,IAAIC,GAAmB,GACnBC,GAAmB,GACvB,SAASC,GAAc1E,EAAU2E,EAAO,CACtC,IAAMC,EAASN,EAAWtE,EAAU2E,EAAOA,CAAK,EAKhD,OAJgB,KAAK,IACnBF,GACA,KAAK,IAAID,GAAkBI,EAAS,CAAC,CACvC,EACiB,KAAK,IAAID,EAAO,OAAO,OAAO,CACjD,CACA,SAASE,GAAWrE,EAAM,CACxB,OAAIA,EAAK,OAASA,EAAK,GACd,GAEFA,EAAK,YAAcA,EAAK,UAAYA,EAAK,aAAeA,EAAK,SAAWA,EAAK,aAAe,IAAM,MAAQ,QAAU,EAC7H,CACA,SAASsE,GAAWtE,EAAMuE,EAAW,GAAO,CAC1C,IAAMC,EAAOH,GAAWrE,CAAI,EAC5B,GAAI,CAACuE,EACH,OAAOC,EAET,IAAMnD,EAAQtB,EAAYC,CAAI,EAC9B,OAAOwE,IAAS,GAAQnD,EAAQA,EAAM,OAASA,EAAM,GAAKA,EAAM,KAAO,EACzE,CACA,SAASoD,GAAcC,EAAQrC,EAAO,CACpC,GAAM,CAAE,GAAAsC,EAAI,OAAAC,CAAO,EAAIF,EACjBrF,EAAKuF,EAASD,EAAG,EAAIC,EAAO,EAAI,EAChCtF,EAAKsF,EAASD,EAAG,EAAIC,EAAO,EAAI,EAChCzB,EAAM,KAAK,MAAM9D,EAAIC,CAAE,GAAK,EAC5B6C,EAAK9C,EAAK8D,EACVf,EAAK9C,EAAK6D,EACV0B,EAAKF,EAAG,EACRG,EAAKH,EAAG,EACRI,EAAQF,EAAK1C,EAAKE,EAAQ,EAC1B2C,EAAQF,EAAK1C,EAAKC,EAAQ,EAC1B4C,EAAQJ,EAAK1C,EAAKE,EAClB6C,EAAQJ,EAAK1C,EAAKC,EAClB8C,EAAQ,CAAC/C,EAAKC,EAAQ,EACtB+C,EAAQjD,EAAKE,EAAQ,EAC3B,MAAO,CACL,CACE,GAAIwC,EACJ,GAAIC,EACJ,IAAKC,EACL,IAAKC,EACL,IAAKC,EAAQE,EACb,IAAKD,EAAQE,EACb,GAAIH,EACJ,GAAIC,CACN,EACA,CACE,GAAID,EACJ,GAAIC,EACJ,IAAKD,EAAQE,EACb,IAAKD,EAAQE,EACb,IAAKL,EACL,IAAKC,EACL,GAAIH,EACJ,GAAIC,CACN,CACF,CACF,CACA,SAASO,GAAkBrE,EAAcC,EAAYqE,EAAMhC,EAAMiC,EAAW,CAAC,EAAGC,EAAU,CACxF,IAAMrB,EAAQb,EAAK,OACbJ,EAAOL,GAAOS,CAAI,EAClBrB,EAASuD,IAAalC,EAAK,UAAY7B,GAAiB,QAI9D,GAHI6D,IAAS,KACXA,EAAOnE,GAAgBH,EAAcC,CAAU,GAE7CiC,IAAS,EACX,OAAOW,GACLwB,GACE1B,EAAS3C,EAAckC,CAAI,EAC3BS,EAAS1C,EAAYiC,CAAI,EACzBoC,EACA,CAAE,OAAQnB,EAAO,OAAQA,CAAM,EAC/BR,EAAS4B,EAAUrC,CAAI,EAGvBjB,IAAW,OAAS,OAASA,EAASiB,CACxC,EACAA,CACF,EAEF,GAAI,OAAOoC,GAAS,SAClB,OAAOb,GACLlF,EAAWyB,EAAcsE,CAAI,EAC7BpB,GAAclD,EAAcmD,CAAK,CACnC,EAEF,IAAMsB,EAAOH,IAAS,GAChBjE,EAAQiE,IAAS,GAAO,CAAE,KAAM,MAAO,GAAI,OAAQ,EAAIA,EACvDI,EAAanG,EAAWyB,EAAcK,EAAM,IAAI,EAChDsE,EAAWpG,EAAW0B,EAAYI,EAAM,EAAE,EAC1CuE,EAAUF,EAAW,GACrBG,EAAUF,EAAS,GACnB/D,EAAMgE,EAAQ,EACd/D,EAAM+D,EAAQ,EACd9D,EAAM+D,EAAQ,EACd9D,EAAM8D,EAAQ,EACpB,GAAIJ,EAAM,CACR,IAAIK,EAAU,EACVC,EAAU,EACd,GAAIL,EAAW,OAAQ,CACrB,IAAMrG,EAAKuG,EAAQ,EAAIF,EAAW,OAAO,EACnCpG,EAAKsG,EAAQ,EAAIF,EAAW,OAAO,EACnCvC,EAAM,KAAK,MAAM9D,EAAIC,CAAE,EACzB6D,EAAM,IACR2C,EAAUzG,EAAK8D,EACf4C,EAAUzG,EAAK6D,EAEnB,CACA,IAAM6C,EAAM9B,GAAclD,EAAcmD,CAAK,EACvC8B,EAAQ,CAACF,EACTG,EAAQJ,EACRK,GAAQP,EAAQ,EAAIC,EAAQ,GAAK,EAAII,EAAQD,EAC7CI,GAAQR,EAAQ,EAAIC,EAAQ,GAAK,EAAIK,EAAQF,EAC7CK,EAAOzE,EAAMkE,EAAUE,EACvBM,EAAOzE,EAAMkE,EAAUC,EACvBO,EAAOzE,EAAMgE,EAAUE,EACvBQ,EAAOzE,EAAMgE,EAAUC,EAC7B,MAAO,CACL,CACE,GAAIpE,EACJ,GAAIC,EACJ,IAAKwE,EACL,IAAKC,EACL,IAAKD,EAAOJ,EAAQD,EACpB,IAAKM,EAAOJ,EAAQF,EACpB,GAAIG,EACJ,GAAIC,CACN,EACA,CACE,GAAID,EACJ,GAAIC,EACJ,IAAKG,EAAON,EAAQD,EACpB,IAAKQ,EAAON,EAAQF,EACpB,IAAKO,EACL,IAAKC,EACL,GAAI1E,EACJ,GAAIC,CACN,CACF,CACF,KAAO,CACL,IAAM0E,EAAWf,EAAW,QAAU,CACpC,EAAGE,EAAQ,GAAKC,EAAQ,EAAID,EAAQ,GACpC,EAAGA,EAAQ,GAAKC,EAAQ,EAAID,EAAQ,EACtC,EACMc,EAASf,EAAS,QAAU,CAChC,EAAGE,EAAQ,GAAKD,EAAQ,EAAIC,EAAQ,GACpC,EAAGA,EAAQ,GAAKD,EAAQ,EAAIC,EAAQ,EACtC,EACMc,EAAO,KAAK,MAAM7E,EAAMF,EAAKG,EAAMF,CAAG,EACtC+E,EAAc,CAACC,GAAMlC,GAAImC,GAASC,KAAY,CAClD,IAAM1H,GAAKsF,GAAG,EAAIkC,GAAK,EACjBvH,GAAKqF,GAAG,EAAIkC,GAAK,EACjB1D,GAAM,KAAK,MAAM9D,GAAIC,EAAE,EACvBoD,GAAQS,KAAQ,EAAI,GAAK2D,GAAUzH,GAAK0H,GAAUzH,IAAM6D,GAC9D,OAAO,KAAK,IACV,EACA,KAAK,IAAIwD,EAAOhH,GAAqBC,GAAa8C,GAAQ,EAAG,CAC/D,CACF,EACMsE,EAAYnB,EAAQ,EAAID,EAAQ,EAChCqB,EAAYpB,EAAQ,EAAID,EAAQ,EAChC,CAACsB,EAAKC,CAAG,EAAIC,GACjBX,EAAS,EACTA,EAAS,EACTb,EAAQ,EACRA,EAAQ,EACRgB,EAAYH,EAAUb,EAASoB,EAAWC,CAAS,CACrD,EACM,CAACI,EAAKC,CAAG,EAAIF,GACjBV,EAAO,EACPA,EAAO,EACPb,EAAQ,EACRA,EAAQ,EACRe,EAAYF,EAAQb,EAAS,CAACmB,EAAW,CAACC,CAAS,CACrD,EACMM,EAAQhC,EAAS,OAAS5D,GAAUC,EAAKC,EAAKC,EAAKC,EAAKwD,EAAUtD,CAAM,EAAI,EAC5EuF,EAAWb,IAAS,EAAI,EAAIA,EAC5BxE,GAAML,EAAMF,GAAO4F,EACnBpF,GAAML,EAAMF,GAAO2F,EACnBC,EAAS,CAACrF,EAAKmF,EACfG,EAASvF,EAAKoF,EACdI,EAAUxF,EAAK,KAAK,IAAIoF,CAAK,EAC7BK,GAAUxF,EAAK,KAAK,IAAImF,CAAK,EACnC,MAAO,CACL,CACE,GAAI3F,EACJ,GAAIC,EACJ,IAAKqF,EAAMO,EAASE,EACpB,IAAKR,EAAMO,EAASE,GACpB,IAAKP,EAAMI,EAASE,EACpB,IAAKL,EAAMI,EAASE,GACpB,GAAI9F,EACJ,GAAIC,CACN,CACF,CACF,CACF,CACA,SAAS8F,GAAUrI,EAAUsI,EAAI,CAC/B,IAAMC,EAAQvI,EAAS,CAAC,EAClBwI,EAAMxI,EAAS,GAAG,EAAE,EAC1B,OAAO,KAAK,MAAMuI,EAAM,EAAID,EAAG,EAAGC,EAAM,EAAID,EAAG,CAAC,EAAI,KAAK,MAAME,EAAI,EAAIF,EAAG,EAAGE,EAAI,EAAIF,EAAG,CAAC,EAAI,QAAU,KACzG,CACA,SAASG,GAAiBjH,EAAcC,EAAYiH,EAAO7G,EAAO,CAChE,IAAMqE,EAAanG,EACjByB,EACAK,GAAO,MAAQwG,GAAU7G,EAAckH,EAAM,CAAC,CAAC,CACjD,EACMvC,EAAWpG,EACf0B,EACAI,GAAO,IAAMwG,GAAU5G,EAAYiH,EAAM,GAAG,EAAE,CAAC,CACjD,EACMtE,EAAS,CAAC8B,EAAW,GAAI,GAAGwC,EAAOvC,EAAS,EAAE,EAC9CwC,EAAWvJ,GAAM,CACrB,IAAM4D,EAAIoB,EAAOhF,CAAC,EACZ6B,EAAQ2H,GAAM,KAAK,MAAMA,EAAE,EAAI5F,EAAE,EAAG4F,EAAE,EAAI5F,EAAE,CAAC,EAC7CE,EAAQ,CAACkC,EAAQyD,IAAS,CAC9B,IAAMlF,EAAMyB,EAASnE,EAAKmE,CAAM,EAAI,EAC9BvC,EAAQ5B,EAAK4H,CAAI,EACvB,OAAOlF,IAAQ,EAAI,CAAE,EAAGkF,EAAK,EAAI7F,EAAE,EAAG,EAAG6F,EAAK,EAAI7F,EAAE,CAAE,EAAI,CACxD,GAAIA,EAAE,EAAIoC,EAAO,GAAKzB,EAAMd,EAC5B,GAAIG,EAAE,EAAIoC,EAAO,GAAKzB,EAAMd,CAC9B,CACF,EACA,GAAIzD,IAAM,EACR,OAAO8D,EAAMgD,EAAW,OAAQ9B,EAAO,CAAC,CAAC,EAE3C,GAAIhF,IAAMgF,EAAO,OAAS,EAAG,CAC3B,IAAMjF,EAAM+D,EAAMiD,EAAS,OAAQ/B,EAAOhF,EAAI,CAAC,CAAC,EAChD,MAAO,CAAE,EAAG,CAACD,EAAI,EAAG,EAAG,CAACA,EAAI,CAAE,CAChC,CACA,MAAO,CACL,GAAIiF,EAAOhF,EAAI,CAAC,EAAE,EAAIgF,EAAOhF,EAAI,CAAC,EAAE,GAAK,EACzC,GAAIgF,EAAOhF,EAAI,CAAC,EAAE,EAAIgF,EAAOhF,EAAI,CAAC,EAAE,GAAK,CAC3C,CACF,EACMP,EAAS,CAAC,EAChB,QAASO,EAAI,EAAGA,EAAIgF,EAAO,OAAS,EAAGhF,IAAK,CAC1C,IAAME,EAAI8E,EAAOhF,CAAC,EACZG,EAAI6E,EAAOhF,EAAI,CAAC,EAChB0J,EAAKH,EAAQvJ,CAAC,EACd2J,EAAKJ,EAAQvJ,EAAI,CAAC,EACxBP,EAAO,KAAK,CACV,GAAIS,EAAE,EACN,GAAIA,EAAE,EACN,IAAKA,EAAE,EAAIwJ,EAAG,EAAI,EAClB,IAAKxJ,EAAE,EAAIwJ,EAAG,EAAI,EAClB,IAAKvJ,EAAE,EAAIwJ,EAAG,EAAI,EAClB,IAAKxJ,EAAE,EAAIwJ,EAAG,EAAI,EAClB,GAAIxJ,EAAE,EACN,GAAIA,EAAE,CACR,CAAC,CACH,CACA,OAAOV,CACT,CClkBA,SAASmK,IAAW,CAClB,IAAMC,EAAwB,IAAI,QAClC,MAAO,CAACC,EAAKC,EAAMC,IAAY,CAC7B,IAAMC,EAAMJ,EAAM,IAAIC,CAAG,EACzB,GAAIG,GAAK,KAAK,SAAWF,EAAK,QAAUE,EAAI,KAAK,MAAM,CAACC,EAAGC,IAAM,OAAO,GAAGD,EAAGH,EAAKI,CAAC,CAAC,CAAC,EACpF,OAAOF,EAAI,MAEb,IAAMG,EAAQJ,EAAQ,EACtB,OAAAH,EAAM,IAAIC,EAAK,CAAE,KAAAC,EAAM,MAAAK,CAAM,CAAC,EACvBA,CACT,CACF,CCXA,IAAIC,GAAW,GACXC,GAAgB,IAChBC,EAAY,EAChB,SAASC,GAAWC,EAAM,CACxB,OAAOA,EAAK,OAASH,GAAgBC,EAAY,CACnD,CACA,SAASG,GAASC,EAAGC,EAAG,CACtB,OAAOD,EAAE,GAAKC,EAAE,IAAMD,EAAE,GAAKC,EAAE,IAAMD,EAAE,GAAKC,EAAE,IAAMD,EAAE,GAAKC,EAAE,EAC/D,CACA,SAASC,GAASC,EAAKC,EAAO,CAC5B,OAAOD,EAAI,IAAM,GAAKA,EAAI,IAAMC,EAAM,OAASD,EAAI,IAAM,GAAKA,EAAI,IAAMC,EAAM,MAChF,CACA,SAASC,GAAYF,EAAKC,EAAO,CAC/B,OAAOD,EAAI,IAAM,GAAKA,EAAI,IAAMC,EAAM,OAASD,EAAI,IAAM,GAAKA,EAAI,IAAMC,EAAM,MAChF,CACA,SAASE,GAAUF,EAAOG,EAAW,CAAC,EAAG,CACvC,IAAMC,EAAS,CAAC,GAAGD,CAAQ,EAC3B,OAAQJ,GACFD,GAASC,EAAKC,CAAK,GAAKI,EAAO,KAAMC,GAAMV,GAASU,EAAGN,CAAG,CAAC,EACtD,IAETK,EAAO,KAAKL,CAAG,EACR,GAEX,CACA,SAASO,GAAYC,EAAYP,EAAOQ,EAAM,CAC5C,IAAMC,EAAM,CAAC,EACPC,EAAMpB,GAAWE,EAAY,EAC7BmB,EAAY,CAAC,EAAGjB,EAAMkB,EAAMC,IAAc,CAC9C,IAAMC,EAAIrB,GAAWC,CAAI,EACrBqB,EAAU,GACd,QAASC,EAAQ,EAAGA,IAAU,EAAE,OAAS,GAAIA,IAAS,CACpD,IAAMC,EAAIL,EAAOC,EAAYG,EAAQN,EAC/BX,EAAM,CACV,GAAI,EAAE,EAAIe,EAAI,EACd,GAAI,EAAE,EAAIA,EAAI,EACd,GAAIG,EAAI3B,GAAWE,EACnB,GAAIyB,EAAIzB,CACV,EACA,GAAIM,GAASC,EAAKC,CAAK,EACrB,MAEF,GAAIC,GAAYF,EAAKC,CAAK,IAAM,EAAE,OAAOD,CAAG,GAAK,IAAO,CACtD,GAAIS,EAAKT,CAAG,EACV,MAAO,CAAE,OAAQ,CAAE,GAAG,EAAG,KAAAL,EAAM,EAAAuB,EAAG,EAAAH,CAAE,EAAG,QAAAC,CAAQ,EAEjDA,EAAU,EACZ,CACF,CACA,MAAO,CAAE,OAAQ,OAAQ,QAAAA,CAAQ,CACnC,EACMG,EAAQ,CAAC,EAAGxB,IAAS,CACzB,IAAMyB,EAAQR,EAAU,EAAGjB,EAAM,EAAE,EAAG,EAAE,EAAIM,EAAM,OAAS,EAAI,GAAK,CAAC,EACrE,OAAOmB,EAAM,SAAW,EAAE,QAAU,QAAUA,EAAM,QAAU,OAASR,EAAU,EAAGjB,EAAM,EAAE,MAAO,EAAE,MAAQ,EAAE,EAAI,GAAK,CAAC,EAAE,OAC7H,EACA,QAAW,KAAKa,EAAY,CAC1B,IAAMH,EAASc,EAAM,EAAG,EAAE,IAAI,IAAM,EAAE,WAAa,OAAS,OAASA,EAAM,EAAG,EAAE,QAAQ,GACpFd,GACFK,EAAI,KAAKL,CAAM,CAEnB,CACA,OAAOK,CACT,CCnDA,SAASW,GAAKC,EAAQ,CACpB,OAAOA,IAAW,IAAM,IAAM,GAChC,CACA,SAASC,GAAUC,EAAOC,EAAwB,IAAI,IAAO,CAC3D,IAAMC,EAAQF,EAAM,MAAM,IAAIG,CAAW,EACnCC,EAAqB,IAAI,IACzBC,EAAS,CAACC,EAAIC,EAAMC,IAAO,CAC/BC,GAAOL,EAAI,GAAGE,CAAE,IAAIC,CAAI,GAAIC,CAAE,CAChC,EACAR,EAAM,MAAM,QAAQ,CAACU,EAAMF,IAAO,CAChCH,EAAOK,EAAK,KAAMR,EAAMM,CAAE,EAAE,KAAMA,CAAE,EACpCH,EAAOK,EAAK,GAAIR,EAAMM,CAAE,EAAE,GAAIA,CAAE,CAClC,CAAC,EACD,IAAMG,EAAaC,GAAM,CACvB,IAAMC,EAAMT,EAAG,IAAI,GAAGQ,CAAC,MAAM,EAC7B,GAAIC,GAAK,SAAW,EAClB,OAEF,IAAML,EAAKK,EAAI,CAAC,EACVH,EAAOV,EAAM,MAAMQ,CAAE,EAC3B,OAAOE,EAAK,OAASE,GAAKF,EAAK,KAAOE,GAAK,CAACX,EAAM,IAAIW,CAAC,GAAK,CAACX,EAAM,IAAIS,EAAK,EAAE,GAAKR,EAAMM,CAAE,EAAE,OAAS,OAASN,EAAMM,CAAE,EAAE,KAAO,SAAWJ,EAAG,IAAI,GAAGM,EAAK,EAAE,QAAQ,GAAG,SAAW,EAAIF,EAAK,MAC7L,EACMM,EAAyB,IAAI,IAC7BC,EAAwB,IAAI,IAC5BC,EAAuB,IAAI,IACjC,QAAWC,KAAQjB,EAAM,MAAO,CAC9B,IAAMkB,EAAOd,EAAG,IAAI,GAAGa,EAAK,EAAE,QAAQ,EAChCE,EAAOD,GAAM,SAAW,EAAIlB,EAAM,MAAMkB,EAAK,CAAC,CAAC,EAAE,KAAO,OAC9D,GAAIH,EAAM,IAAIE,EAAK,EAAE,GAAKE,IAAS,QAAUR,EAAUQ,CAAI,IAAMD,EAAK,CAAC,EACrE,SAEF,IAAME,EAAM,CAACH,EAAK,EAAE,EACpB,OAAW,CACT,IAAMT,EAAKG,EAAUS,EAAI,GAAG,EAAE,CAAC,EACzBC,EAAOb,IAAO,OAAS,OAASR,EAAM,MAAMQ,CAAE,EAAE,GACtD,GAAIa,IAAS,QAAUN,EAAM,IAAIM,CAAI,EACnC,MAEFP,EAAO,IAAIN,CAAE,EACbY,EAAI,KAAKC,CAAI,CACf,CACA,QAAWf,KAAMc,EACfL,EAAM,IAAIT,EAAIW,EAAK,EAAE,EAEnBG,EAAI,OAAS,GACfJ,EAAK,IAAIC,EAAK,GAAIG,CAAG,CAEzB,CACA,QAAWH,KAAQjB,EAAM,MAClBe,EAAM,IAAIE,EAAK,EAAE,GACpBF,EAAM,IAAIE,EAAK,GAAIA,EAAK,EAAE,EAG9B,IAAMK,EAAO,IAAI,IAAItB,EAAM,MAAM,IAAKuB,GAAM,CAACA,EAAE,GAAIA,CAAC,CAAC,CAAC,EAChDC,EAAQ,CAAC,EACf,QAAWP,KAAQjB,EAAM,MAAO,CAC9B,GAAIe,EAAM,IAAIE,EAAK,EAAE,IAAMA,EAAK,GAC9B,SAEF,IAAMG,EAAMJ,EAAK,IAAIC,EAAK,EAAE,EAC5B,GAAI,CAACG,EAAK,CACRI,EAAM,KAAKP,CAAI,EACf,QACF,CACA,IAAMQ,EAAUL,EAAI,IAAKd,GAAOgB,EAAK,IAAIhB,CAAE,CAAC,EACtCoB,EAAWD,EAAQ,OAAOE,CAAU,EACpCC,EAAQF,EAAS,OAASA,EAAS,OAAO,CAACd,EAAGiB,IAAMjB,EAAE,OAAO,OAASiB,EAAE,OAAO,MAAQjB,EAAIiB,CAAC,EAAIJ,EAAQ,CAAC,EAC/GD,EAAM,KAAK,CACT,GAAIP,EAAK,GACT,KAAMA,EAAK,KACX,OAAQQ,EAAQ,OAAO,CAACK,EAAKP,IAAMO,EAAMP,EAAE,OAAQ,CAAC,EACpD,MAAON,EAAK,MACZ,OAAQW,EAAM,MAChB,CAAC,CACH,CACA,IAAMG,EAAuB,IAAI,IAC3BC,EAAQ,CAAC,EACf,OAAAhC,EAAM,MAAM,QAAQ,CAACU,EAAMF,IAAO,CAChC,IAAMyB,EAAOlB,EAAM,IAAIL,EAAK,IAAI,EAC1BwB,EAAKnB,EAAM,IAAIL,EAAK,EAAE,EACtBH,EAAOL,EAAMM,CAAE,EACf2B,EAAM,GAAGF,CAAI,IAAI1B,EAAK,IAAI,IAAI2B,CAAE,IAAI3B,EAAK,EAAE,GAC7CO,EAAO,IAAIN,CAAE,GAAKuB,EAAK,IAAII,CAAG,IAGlCJ,EAAK,IAAII,CAAG,EACZH,EAAM,KAAK,CACT,KAAAC,EACA,GAAAC,EACA,GAAG3B,EAAK,OAAS,QAAU,CAAE,WAAYV,GAAKuC,EAAUH,CAAI,CAAC,CAAE,EAAI,CAAC,EACpE,GAAG1B,EAAK,KAAO,MAAQ,CAAE,SAAUV,GAAKuC,EAAUF,CAAE,CAAC,CAAE,EAAI,CAAC,CAC9D,CAAC,EACH,CAAC,EACM,CACL,MAAO,CAAE,GAAGlC,EAAO,MAAAwB,EAAO,MAAAQ,EAAO,MAAO,OAAQ,WAAY,MAAO,EACnE,KAAAhB,CACF,CACF,CACA,SAASqB,GAAUC,EAAWtB,EAAMuB,EAAU,CAC5C,IAAM1B,EAAM,CAAE,GAAGyB,CAAU,EAC3B,OAAW,CAAChC,EAAImB,CAAO,IAAKT,EAAM,CAChC,IAAMwB,EAAOF,EAAUhC,CAAE,EACzB,GAAI,CAACkC,GAAM,OACT,SAEF,OAAO3B,EAAIP,CAAE,EACb,IAAMmC,EAAMC,GAAUF,CAAI,EACpBG,EAAQF,EAAI,GAAG,EAAE,EACjBG,EAAUnB,EAAQ,IAAKoB,GAAM,KAAK,IAAIN,EAASM,CAAC,EAAG,CAAC,CAAC,EACrDC,EAAYF,EAAQ,OAAO,CAAChC,EAAGiB,IAAMjB,EAAIiB,EAAG,CAAC,EAC/CI,EAAO,EACXR,EAAQ,QAAQ,CAACsB,EAAQC,IAAM,CAC7B,IAAMC,EAAQH,EAAYF,EAAQI,CAAC,EAAIF,EAAYH,EAAQA,EAAQlB,EAAQ,OACrES,EAAKc,IAAMvB,EAAQ,OAAS,EAAIkB,EAAQV,EAAOgB,EACrDpC,EAAIkC,CAAM,EAAIG,GAAMV,EAAMC,EAAKR,EAAMC,CAAE,EACvCD,EAAOC,CACT,CAAC,CACH,CACA,OAAOrB,CACT,CACA,SAASsC,GAAcX,EAAMP,EAAMC,EAAI,CACrC,GAAIM,EAAK,SAAW,EAClB,MAAO,CAAC,EAEV,IAAMC,EAAMC,GAAUF,CAAI,EACpBG,EAAQF,EAAI,GAAG,EAAE,EACvB,OAAOS,GAAMV,EAAMC,EAAKR,EAAOU,EAAOT,EAAKS,CAAK,CAClD,CACA,SAASS,GAAiBZ,EAAM,CAC9B,IAAMC,EAAMC,GAAUF,CAAI,EAC1B,OAAOa,GAAQb,EAAMC,EAAKA,EAAI,GAAG,EAAE,EAAI,CAAC,CAC1C,CACA,SAASC,GAAUF,EAAM,CACvB,IAAMC,EAAM,CAAC,CAAC,EACd,QAASa,EAAI,EAAGA,EAAId,EAAK,OAAQc,IAC/Bb,EAAI,KACFA,EAAIa,EAAI,CAAC,EAAI,KAAK,MAAMd,EAAKc,CAAC,EAAE,EAAId,EAAKc,EAAI,CAAC,EAAE,EAAGd,EAAKc,CAAC,EAAE,EAAId,EAAKc,EAAI,CAAC,EAAE,CAAC,CAC9E,EAEF,OAAOb,CACT,CACA,SAASc,GAAcd,EAAKe,EAAG,CAC7B,IAAIC,EAAK,EACLC,EAAKjB,EAAI,OACb,KAAOgB,EAAKC,GAAI,CACd,IAAMC,EAAMF,EAAKC,GAAM,EACnBjB,EAAIkB,CAAG,EAAIH,EACbC,EAAKE,EAAM,EAEXD,EAAKC,CAET,CACA,OAAOF,CACT,CACA,SAASJ,GAAQb,EAAMC,EAAKe,EAAG,CAC7B,GAAIA,GAAK,EACP,MAAO,CAAE,GAAGhB,EAAK,CAAC,CAAE,EAEtB,IAAMc,EAAIC,GAAcd,EAAKe,CAAC,EAC9B,GAAIF,GAAKb,EAAI,OACX,MAAO,CAAE,GAAGD,EAAK,GAAG,EAAE,CAAE,EAE1B,IAAMoB,EAAOnB,EAAIa,CAAC,EAAIb,EAAIa,EAAI,CAAC,EACzBO,EAAID,EAAO,GAAKJ,EAAIf,EAAIa,EAAI,CAAC,GAAKM,EAAO,EACzC,EAAIpB,EAAKc,EAAI,CAAC,EACdzB,EAAIW,EAAKc,CAAC,EAChB,MAAO,CAAE,EAAG,EAAE,GAAKzB,EAAE,EAAI,EAAE,GAAKgC,EAAG,EAAG,EAAE,GAAKhC,EAAE,EAAI,EAAE,GAAKgC,CAAE,CAC9D,CACA,SAASX,GAAMV,EAAMC,EAAKR,EAAMC,EAAI,CAClC,IAAM4B,EAAS,CAACT,GAAQb,EAAMC,EAAKR,CAAI,CAAC,EACxC,QAASqB,EAAIC,GAAcd,EAAKR,CAAI,EAAGqB,EAAId,EAAK,QAAUC,EAAIa,CAAC,EAAIpB,EAAIoB,IACjEb,EAAIa,CAAC,EAAIrB,GACX6B,EAAO,KAAK,CAAE,GAAGtB,EAAKc,CAAC,CAAE,CAAC,EAG9B,OAAAQ,EAAO,KAAKT,GAAQb,EAAMC,EAAKP,CAAE,CAAC,EAC3B4B,CACT,CChLA,SAASC,GAAaC,EAAOC,EAAQ,CACnC,IAAMC,EAAW,IAAI,IACnBF,EAAM,MAAM,OAAQG,GAAMC,EAAWD,CAAC,GAAKE,EAAeF,EAAGF,CAAM,CAAC,EAAE,IAAKE,GAAMA,EAAE,EAAE,CACvF,EACMG,EAAQN,EAAM,OAAS,CAAC,EAC9B,GAAIE,EAAS,OAAS,GAAKI,EAAM,SAAW,EAC1C,OAAON,EAET,IAAMO,EAAQD,EAAM,IAAKE,GAAS,CAChC,IAAIC,EAAQ,GACRC,EAAO,GACX,OAAAF,EAAK,QAAQ,QAAQ,CAACG,EAAIC,IAAM,CAC1BV,EAAS,IAAIS,CAAE,IACbF,EAAQ,IACVA,EAAQG,GAEVF,EAAOE,EAEX,CAAC,EACMH,EAAQ,EAAI,OAAS,CAAE,MAAAA,EAAO,KAAAC,CAAK,CAC5C,CAAC,EACD,GAAIH,EAAM,MACR,CAACM,EAAMD,IAAMC,GAAM,QAAU,GAAKA,EAAK,OAASP,EAAMM,CAAC,EAAE,QAAQ,OAAS,CAC5E,EACE,OAAOZ,EAET,IAAMc,EAAuB,IAAI,IAC3BC,EAAU,CAAC,EACXC,EAA4B,IAAI,IACtC,OAAAV,EAAM,QAAQ,CAACE,EAAMI,IAAM,CACzB,IAAMC,EAAON,EAAMK,CAAC,EACpB,GAAIC,EAAM,CACR,IAAMI,EAAUT,EAAK,QAAQ,MAAMK,EAAK,MAAOA,EAAK,KAAO,CAAC,EAC5D,QAAWF,KAAMM,EACfH,EAAK,IAAIH,CAAE,EAEbI,EAAQ,KAAK,CAAE,GAAGP,EAAM,QAAAS,CAAQ,CAAC,EACjCD,EAAU,IAAIR,EAAK,KAAM,CAAE,MAAOK,EAAK,MAAO,QAAAI,CAAQ,CAAC,CACzD,CACF,CAAC,EACM,CACL,GAAGjB,EACH,MAAOA,EAAM,MAAM,OAAQG,GAAMW,EAAK,IAAIX,EAAE,EAAE,CAAC,EAC/C,MAAOH,EAAM,MAAM,OAAQkB,GAAMJ,EAAK,IAAII,EAAE,IAAI,GAAKJ,EAAK,IAAII,EAAE,EAAE,CAAC,EACnE,MAAOH,EACP,WAAYf,EAAM,YAAcmB,GAC9BnB,EAAM,WACNM,EACAC,EACA,IAAI,IAAIP,EAAM,MAAM,IAAKG,GAAM,CAACA,EAAE,GAAIA,EAAE,IAAI,CAAC,CAAC,CAChD,EACA,YAAaiB,GAAYpB,EAAOgB,CAAS,CAC3C,CACF,CACA,SAASG,GAAWE,EAAQf,EAAOC,EAAOe,EAAQ,CAChD,IAAMC,EAAOF,EAAO,OAAO,EACrBG,EAAM,IAAIC,GAChB,OAAAnB,EAAM,QAAQ,CAACE,EAAMkB,IAAM,CACzB,IAAMC,EAASN,EAAO,UAAUO,EAAWpB,EAAK,IAAI,EAAE,IAAI,EACpDK,EAAON,EAAMmB,CAAC,EACpBlB,EAAK,QAAQ,QAAQ,CAACG,EAAIC,IAAM,CAC9B,IAAMiB,EAAUP,EAAO,IAAIX,CAAE,GAAKA,EAC5BmB,EAAKP,EAAKF,EAAO,KAAKQ,CAAO,EAAGF,CAAM,EACxCG,GAAM,GAAKjB,GAAQD,GAAKC,EAAK,OAASD,GAAKC,EAAK,MAClDW,EAAI,IACFK,EACAR,EAAO,MAAMM,CAAM,EACnBN,EAAO,QAAQM,CAAM,EACrBN,EAAO,MAAMS,CAAE,EACfT,EAAO,SAASS,CAAE,IAAM,CAC1B,CAEJ,CAAC,CACH,CAAC,EACMN,EAAI,MAAM,CACnB,CACA,SAASO,GAAa/B,EAAOC,EAAQ+B,EAAS,CAC5C,IAAMC,EAAQjC,EAAM,MAAM,IAAKkC,GAAS,CACtC,GAAI,CAAC9B,EAAW8B,CAAI,EAClB,OAAOA,EAET,IAAMC,EAAOD,EAAK,OAAO,MACnBE,EAAKD,EAAOD,EAAK,OACjB,CAACG,EAAOC,CAAG,EAAIjC,EAAe6B,EAAMjC,CAAM,EAAI,CAAC,KAAK,IAAIkC,EAAMlC,EAAO,KAAK,EAAG,KAAK,IAAImC,EAAInC,EAAO,GAAG,CAAC,EAAImC,GAAMnC,EAAO,MAAQ,CAAC,KAAK,IAAIkC,EAAMC,EAAKJ,CAAO,EAAGI,CAAE,EAAI,CAACD,EAAM,KAAK,IAAIC,EAAID,EAAOH,CAAO,CAAC,EAC5M,OAAOK,IAAUF,GAAQG,IAAQF,EAAKF,EAAO,CAC3C,GAAGA,EACH,OAAQI,EAAMD,EACd,OAAQ,CAAE,GAAGH,EAAK,OAAQ,MAAAG,CAAM,EAChC,UAAW,CAAE,MAAOF,EAAM,OAAQD,EAAK,MAAO,CAChD,CACF,CAAC,EACD,OAAOD,EAAM,KAAK,CAACC,EAAMtB,IAAMsB,IAASlC,EAAM,MAAMY,CAAC,CAAC,EAAI,CAAE,GAAGZ,EAAO,MAAAiC,CAAM,EAAIjC,CAClF,CACA,SAASuC,GAAUvC,EAAO,CACxB,OAAOA,EAAM,MAAM,KAAM,GAAM,EAAE,SAAS,EAAI,CAC5C,GAAGA,EACH,MAAOA,EAAM,MAAM,IACjB,CAAC,CAAE,UAAWwC,EAAM,GAAGN,CAAK,IAAMM,GAAQN,EAAK,OAAS,CACtD,GAAGA,EACH,OAAQM,EAAK,OACb,OAAQ,CAAE,GAAGN,EAAK,OAAQ,MAAOM,EAAK,KAAM,CAC9C,EAAIN,CACN,CACF,EAAIlC,CACN,CC7FA,IAAIyC,GAAkB,EAClBC,GAAeC,GAAc,SAASA,GAAa,eAAe,yBACtE,SAASC,GAAeC,EAAeC,EAAU,CAC/C,OAAOA,EAAS,QAASC,GAAOF,EAAcE,CAAE,GAAK,CAAC,CAAC,CACzD,CACA,SAASC,GAAaH,EAAeI,EAAMC,EAAMJ,EAAUK,EAAOC,EAAU,CAC1E,IAAMC,EAAOR,EAAcI,EAAK,IAAI,EAC9BK,EAAKT,EAAcI,EAAK,EAAE,EAChC,GAAI,GAACI,GAAM,QAAU,CAACC,GAAI,QAG1B,OAAOH,EAAQI,GACbF,EACAC,EACAH,EACAC,EAAWI,EAAYP,CAAI,EAAI,MACjC,EAAIQ,GACFJ,EACAC,EACAI,GAAWT,EAAMG,CAAQ,EACzBF,EACAJ,EAAWF,GAAeC,EAAeC,CAAQ,EAAI,CAAC,CACxD,CACF,CACA,SAASa,GAAmBC,EAAO,CACjC,IAAMC,EAAaC,GACjBF,EAAM,MAAM,OAAOG,CAAU,EAC5BC,GAASA,EAAK,OAAO,OACxB,EACA,QAAWC,KAAQJ,EAAW,OAAO,EACnCI,EAAK,KAAK,CAACC,EAAGC,IAAMD,EAAE,OAAO,MAAQC,EAAE,OAAO,KAAK,EAErD,OAAON,CACT,CACA,SAASO,GAAcC,EAAOC,EAAOC,EAAK,CACxC,IAAMzB,EAAW,CAAC,EAClB,GAAIuB,EACF,QAASG,EAAIC,GAAmBJ,EAAOC,CAAK,EAAGE,EAAIH,EAAM,OAAQG,IAAK,CACpE,IAAMR,EAAOK,EAAMG,CAAC,EACpB,GAAIR,EAAK,OAAO,OAASO,EACvB,MAEEP,EAAK,OAAO,MAAQA,EAAK,QAAUO,GACrCzB,EAAS,KAAKkB,EAAK,EAAE,CAEzB,CAEF,OAAOlB,CACT,CACA,SAAS4B,GAAazB,EAAMI,EAAMC,EAAIqB,EAAU,CAC9C,GAAM,CAAE,WAAAC,EAAY,SAAAC,CAAS,EAAI5B,EACjC,GAAI2B,IAAe,QAAUC,IAAa,OACxC,MAAO,GAET,IAAMC,EAAcF,IAAevB,EAAK,OAClC0B,EAAcF,IAAavB,EAAG,OACpC,OAAOqB,EAAWG,GAAeC,EAAc,CAACD,GAAe,CAACC,CAClE,CACA,SAASC,GAAY/B,EAAMI,EAAMC,EAAI2B,EAAU,CAC7C,IAAIC,EACJ,QAAWhB,KAAKe,EAAS5B,CAAI,EAC3B,QAAWc,KAAKc,EAAS3B,CAAE,EAAG,CAC5B,IAAMqB,EAAWT,EAAE,OAASC,EAAE,MACxBgB,EAAOR,EAAW,CAAE,MAAOT,EAAE,MAAQb,EAAK,OAAQ,IAAKc,EAAE,KAAM,EAAI,CAAE,MAAOA,EAAE,MAAQb,EAAG,OAAQ,IAAKY,EAAE,KAAM,EAChHQ,GAAazB,EAAMiB,EAAGC,EAAGQ,CAAQ,IAAM,CAACO,GAAQ,KAAK,IAAIC,EAAK,IAAMA,EAAK,KAAK,EAAI,KAAK,IAAID,EAAK,IAAMA,EAAK,KAAK,KAClHA,EAAOC,EAEX,CAEF,OAAOD,CACT,CACA,IAAIE,GAAoB,IACxB,SAASC,GAAaC,EAAUL,EAAU,CACxC,IAAMpB,EAA6B,IAAI,IACvC,OAAW,CAAC0B,EAASlB,CAAK,IAAKiB,EAAU,CACvC,IAAME,EAASnB,EAAM,QAASL,GAAS,CACrC,IAAMyB,EAASR,EAASjB,CAAI,EAAE,IAAK0B,GAAMA,EAAE,KAAK,EAChD,OAAOD,EAAO,MAAM,CAAC,EAAE,IAAI,CAACE,EAAMnB,KAAO,CACvC,GAAIiB,EAAOjB,CAAC,EACZ,KAAMmB,EAAOF,EAAOjB,CAAC,CACvB,EAAE,CACJ,CAAC,EACGgB,EAAO,QACT3B,EAAW,IACT0B,EACAC,EAAO,KAAK,CAAC,EAAGrB,IAAM,EAAE,GAAKA,EAAE,EAAE,CACnC,CAEJ,CACA,OAAON,CACT,CACA,SAAS+B,GAAaJ,EAAQlB,EAAOuB,EAAI,CACvC,GAAI,CAACL,EACH,MAAO,GAET,IAAMhB,EAAIsB,GAAeN,EAAO,OAASO,GAAMP,EAAOO,CAAC,EAAE,GAAKzB,CAAK,EAC7D0B,EAAO,CAACR,EAAOhB,EAAI,CAAC,EAAGgB,EAAOhB,CAAC,CAAC,EAAE,OAAQyB,GAAMA,IAAM,MAAM,EAAE,KAAK,CAAC/B,EAAGC,IAAM,KAAK,IAAID,EAAE,GAAKI,CAAK,EAAI,KAAK,IAAIH,EAAE,GAAKG,CAAK,CAAC,EAAE,CAAC,EACrI,OAAO0B,IAAS,QAAU,KAAK,IAAIA,EAAK,GAAK1B,CAAK,GAAK0B,EAAK,MAAQ,KAAK,IAAIH,EAAKG,EAAK,IAAI,GAAKA,EAAK,KAAOZ,EAC9G,CACA,SAASc,GAAcC,EAAK,CAC1B,IAAMvC,EAAQwC,GAAUD,CAAG,EACrBE,EAAO,IAAI,IAAIzC,EAAM,MAAM,IAAK0C,GAAM,CAACA,EAAE,GAAIA,CAAC,CAAC,CAAC,EAChDhB,EAAW3B,GAAmBC,CAAK,EACnCqB,EAAWsB,GAAgB3C,CAAK,EAatC,MAAO,CAAE,MAZKA,EAAM,MAAM,QAAQ,CAACX,EAAMuD,IAAc,CACrD,IAAMnD,EAAOgD,EAAK,IAAIpD,EAAK,IAAI,EACzBK,EAAK+C,EAAK,IAAIpD,EAAK,EAAE,EAC3B,MAAO,CAACA,EAAK,YAAcI,IAAS,QAAUC,IAAO,QAAUS,EAAWV,CAAI,GAAKU,EAAWT,CAAE,GAAKD,EAAK,OAAO,UAAYC,EAAG,OAAO,QAAU,CAC/I,CACE,UAAAkD,EACA,KAAAvD,EACA,QAASI,EAAK,OAAO,QACrB,KAAM2B,GAAY/B,EAAMI,EAAMC,EAAI2B,CAAQ,CAC5C,CACF,EAAI,CAAC,CACP,CAAC,EACe,SAAAK,EAAU,OAAQD,GAAaC,EAAUL,CAAQ,CAAE,CACrE,CACA,SAASwB,GAAcN,EAAK,CAC1B,GAAM,CAAE,MAAAO,EAAO,SAAApB,EAAU,OAAAE,CAAO,EAAIU,GAAcC,CAAG,EACrD,OAAOO,EAAM,QAAQ,CAAC,CAAE,UAAAF,EAAW,KAAAvD,EAAM,QAAAsC,EAAS,KAAAJ,CAAK,IAAM,CAC3D,IAAMU,EAAKV,EAAOA,EAAK,IAAMA,EAAK,MAAQ,EAC1C,OAAOA,GAAQU,GAAMpD,IAAmB,CAACmD,GAAaJ,EAAO,IAAID,CAAO,EAAGJ,EAAK,MAAOU,CAAE,EAAI,CAC3F,CACE,UAAAW,EACA,KAAMvD,EAAK,KACX,GAAIA,EAAK,GACT,GAAGA,EAAK,WAAa,CAAE,WAAYA,EAAK,UAAW,EAAI,CAAC,EACxD,GAAGA,EAAK,SAAW,CAAE,SAAUA,EAAK,QAAS,EAAI,CAAC,EAClD,QAAAsC,EACA,MAAOJ,EAAK,MACZ,IAAKA,EAAK,IACV,GAAAU,EACA,SAAUzB,GACRkB,EAAS,IAAIC,CAAO,EACpBJ,EAAK,MACLA,EAAK,GACP,CACF,CACF,EAAI,CAAC,CACP,CAAC,CACH,CACA,SAASwB,GAAc/C,EAAOgD,EAAa,CACzC,IAAMC,EAAyB,IAAI,IAC7BC,EAAQ/D,GAAO,CACnB,IAAIgE,EAAIhE,EACR,KAAO8D,EAAO,IAAIE,CAAC,GACjBA,EAAIF,EAAO,IAAIE,CAAC,EAElB,OAAIA,IAAMhE,GACR8D,EAAO,IAAI9D,EAAIgE,CAAC,EAEXA,CACT,EACMC,EAAO,CAAC,EAAG7C,IAAM,CACrB,GAAM,CAAC8C,EAAIC,CAAE,EAAI,CAACJ,EAAK,CAAC,EAAGA,EAAK3C,CAAC,CAAC,EAClC,OAAI8C,IAAOC,GACTL,EAAO,IAAII,EAAIC,CAAE,EAEZD,IAAOC,CAChB,EACMC,EAAa,IAAI,IAAIP,CAAW,EACtC,OAAAhD,EAAM,MAAM,QAAQ,CAACwD,EAAGC,IAAO,CACxBF,EAAW,IAAIE,CAAE,GACpBL,EAAKI,EAAE,KAAMA,EAAE,EAAE,CAErB,CAAC,EACM,IAAI,IACTR,EAAY,OAAQS,GAAO,CACzB,IAAMpE,EAAOW,EAAM,MAAMyD,CAAE,EAC3B,MAAO,CAACL,EAAK/D,EAAK,KAAMA,EAAK,EAAE,CACjC,CAAC,CACH,CACF,CACA,SAASqE,GAAgBC,EAAOC,EAAM,CACpC,OAAOA,GAAM,MAAM,OAASD,EAAM,OAAQE,GAAM,CAACD,EAAK,YAAY,IAAIC,EAAE,SAAS,CAAC,EAAIF,CACxF,CACA,IAAIG,GAA2B,IAAI,QACnC,SAASC,GAAgB/D,EAAOgE,EAAWC,EAAO,GAAM,CACtD,IAAIC,EAASJ,GAAS,IAAIE,CAAS,EAC9BE,IACHA,EAAyB,IAAI,IAC7BJ,GAAS,IAAIE,EAAWE,CAAM,GAEhC,IAAIC,EAAUD,EAAO,IAAID,CAAI,EAC7B,GAAI,CAACE,EAAS,CACZ,IAAMC,EAASH,EAAuB,IAAI,IAAQlB,GAChD/C,EACAgE,EAAU,IAAKH,GAAMA,EAAE,SAAS,CAClC,EACAM,EAAU,CACR,MAAOH,EAAU,OAAQH,GAAM,CAACO,EAAO,IAAIP,EAAE,SAAS,CAAC,EACvD,SAAU,IAAI,IAAIG,EAAU,IAAKH,GAAM,CAACA,EAAE,UAAWA,EAAE,QAAQ,CAAC,CAAC,EACjE,OAAAO,CACF,EACAF,EAAO,IAAID,EAAME,CAAO,CAC1B,CACA,OAAOA,CACT,CC1MA,IAAIE,GAAwB,GACxBC,GAAoB,IACpBC,GAAkB,EAClBC,GAAgB,EAChBC,GAAgB,IAChBC,GAAe,EACfC,GAAkB,GAClBC,EAAe,EACfC,EAAqB,EACzB,SAASC,EAAeC,EAAM,CAC5B,OAAQA,EAAK,OAASN,GAAgBC,GAAeE,GAAgB,CACvE,CACA,IAAII,GAAqBL,GAAkBC,GAAgB,EACvDK,GAAuBH,EAAe,MAAM,EAChD,SAASI,EAAMC,EAAOC,EAAGC,EAAG,CAC1B,MAAO,CACL,GAAID,EAAID,EACR,GAAIC,EAAID,EACR,GAAIE,EAAIL,EACR,GAAIK,EAAIL,CACV,CACF,CACA,SAASM,GAAYP,EAAMQ,EAAS,CAClC,MAAO,CACL,GAAI,EACJ,GAAI,EAAIC,GAAWT,CAAI,EAAIH,EAC3B,GAAIW,EAAU,EAAIX,EAAe,EACjC,GAAIW,EAAU,EAAIX,EAAe,CACnC,CACF,CACA,SAASa,EAAMC,EAAGC,EAAIC,EAAI,CACxB,OAAOA,EAAKD,EAAKD,EAAI,KAAK,IAAI,KAAK,IAAIA,EAAGC,CAAE,EAAGC,CAAE,CACnD,CACA,SAASC,GAAYC,EAAG,CACtB,OAAO,OAAOA,CAAC,EAAE,QAAQ,mBAAoB,GAAG,CAClD,CACA,SAASC,GAASC,EAAI,CACpB,GAAM,CAACC,EAAOC,CAAI,EAAIF,GAAM,OAAS,CAACA,EAAK,IAAK,IAAI,EAAIA,GAAM,IAAM,CAACA,EAAK,IAAK,IAAI,EAAI,CAAC,EACxF,OAAIC,IAAU,OACL,GAAGD,CAAE,MAEP,GAAG,CAACC,EAAM,QAAQA,GAAS,IAAM,EAAI,CAAC,CAAC,IAAIC,CAAI,EACxD,CACA,SAASC,GAAaH,EAAI,CACxB,MAAO,GAAGD,GAASC,CAAE,CAAC,MACxB,CACA,SAASI,GAAWC,EAAQC,EAAMC,EAAQC,EAAQ,CAChD,IAAMC,EAAQJ,EAAO,CAAC,EAChBK,EAAOL,EAAOA,EAAO,OAAS,CAAC,EAC/BM,GAAML,EAAK,GAAKG,EAAM,GAAKC,EAAK,IAAM,GAAKH,EAC3CK,GAAMN,EAAK,GAAKG,EAAM,GAAKC,EAAK,IAAM,GAAKF,EAC3CK,EAAM,KAAK,MAAMF,EAAIC,CAAE,EAC7B,OAAOC,IAAQ,EAAI,CAAE,EAAG,EAAG,EAAG,EAAG,EAAI,CAAE,EAAGF,EAAKE,EAAK,EAAGD,EAAKC,CAAI,CAClE,CACA,SAASC,GAAWC,EAAKC,EAAK,CAC5B,OAAO,KAAK,IAAIA,EAAI,CAAC,GAAKD,EAAI,GAAKA,EAAI,IAAM,EAAI,KAAK,IAAIC,EAAI,CAAC,GAAKD,EAAI,GAAKA,EAAI,IAAM,CACzF,CACA,SAASE,GAAeF,EAAKC,EAAK,CAChC,IAAM7B,GAAS4B,EAAI,GAAKA,EAAI,IAAM,EAC5BG,GAASH,EAAI,GAAKA,EAAI,IAAM,EAClC,OAAO,KAAK,IACVC,EAAI,IAAM,EAAI,IAAW7B,EAAQ,KAAK,IAAI6B,EAAI,CAAC,EAC/CA,EAAI,IAAM,EAAI,IAAWE,EAAQ,KAAK,IAAIF,EAAI,CAAC,CACjD,CACF,CACA,SAASG,GAAUC,EAASC,EAAe,CACzC,IAAIC,EAAO,IACPC,EAAO,IACPC,EAAO,KACPC,EAAO,KACX,QAAWC,KAAMN,EACf,QAAWO,KAAKN,EAAcK,CAAE,GAAK,CAAC,EACpCJ,EAAO,KAAK,IAAIA,EAAMK,EAAE,CAAC,EACzBH,EAAO,KAAK,IAAIA,EAAMG,EAAE,CAAC,EACzBJ,EAAO,KAAK,IAAIA,EAAMI,EAAE,CAAC,EACzBF,EAAO,KAAK,IAAIA,EAAME,EAAE,CAAC,EAG7B,OAAOL,IAAS,IAAW,OAAS,CAAE,KAAAA,EAAM,KAAAC,EAAM,KAAAC,EAAM,KAAAC,CAAK,CAC/D,CACA,IAAIG,GAAiBC,GAAS,EAC9B,SAASC,GAAWT,EAAeU,EAAa,CAC9C,OAAOH,GACLP,EACA,CAACU,CAAW,EACZ,IAAM,OAAO,QAAQV,CAAa,EAAE,OAAO,CAAC,CAACK,EAAIM,CAAQ,IAAMA,EAAS,OAAS,GAAKD,EAAY,IAAIL,CAAE,CAAC,EAAE,KAAK,CAAC,CAACO,CAAC,EAAG,CAACC,CAAC,IAAMH,EAAY,IAAIG,CAAC,EAAIH,EAAY,IAAIE,CAAC,CAAC,CACvK,CACF,CACA,IAAIE,GAAWN,GAAS,EACxB,SAASO,GAAcf,EAAegB,EAAWC,EAAMC,EAASC,EAAQC,EAAU,CAChF,GAAM,CAAE,OAAAlC,EAAQ,OAAAC,CAAO,EAAI8B,EAC3B,OAAOH,GACLd,EACA,CAACgB,EAAWG,EAAQC,EAAUlC,EAAQC,EAAQ+B,CAAO,EACrD,IAAM,CACJ,IAAMG,EAAO,CAAC,EACd,QAAWC,IAAY,CAAC,GAAGN,CAAS,EAAE,KAAK,CAACJ,EAAGC,IAAMA,EAAE,GAAKD,EAAE,EAAE,EAAG,CACjE,IAAM5B,EAASuC,GACbvB,EACAsB,EACAL,EACAK,EAAS,SACTH,IAASG,EAAS,SAAS,EAC3BF,CACF,EACMnC,EAAOD,EAASwC,GAAcxC,CAAM,EAAI,OAC9C,GAAIA,GAAUC,EAAM,CAClB,GAAM,CAAE,KAAAgB,EAAM,KAAAC,EAAM,KAAAC,EAAM,KAAAC,CAAK,EAAIqB,GAAYzC,CAAM,EACrDqC,EAAK,KAAK,CACR,SAAAC,EACA,OAAAtC,EACA,KAAAC,EAEA,OAAQ,KAAK,KAAKkB,EAAOF,GAAQf,GAASkB,EAAOF,GAAQf,CAAM,CACjE,CAAC,CACH,CACF,CACA,OAAOkC,CACT,CACF,CACF,CACA,SAASK,GAAoB,CAC3B,cAAA1B,EACA,YAAAU,EACA,UAAAM,EACA,eAAAW,EACA,SAAAP,EAAW,GACX,gBAAAQ,EACA,KAAAX,EACA,WAAAY,EACA,WAAAC,EACA,MAAAC,EACA,OAAAC,EACA,QAAAd,EAAU,CACZ,EAAG,CACD,GAAM,CAAE,OAAAhC,EAAQ,OAAAC,CAAO,EAAI8B,EACrBgB,EAAqB,CAAC,EACtBC,EAAiB,CAAC,EACxB,OAAW,CAAE,SAAAZ,EAAU,OAAAtC,EAAQ,KAAAC,EAAM,OAAAkD,CAAO,IAAKpB,GAC/Cf,EACAgB,EACAC,EACAC,EACAS,EACAP,CACF,EACE,GAAIe,GAAUnF,GAAuB,CACnC,IAAMU,EAAOoB,GAAawC,EAAS,EAAE,EAC/BxD,EAAQL,EAAeC,CAAI,EAC3BgC,EAAM7B,EAAMC,EAAO,EAAG,CAAC,EACvBsE,EAAOnD,EAAK,EAAIC,EAAS2C,EACzBQ,EAAOpD,EAAK,EAAIE,EAAS2C,EAC/B,GAAIM,EAAO,GAAKA,EAAOL,GAASM,EAAO,GAAKA,EAAOL,EACjD,SAEF,IAAMM,EAAOH,GAAUrE,EAAQ,EAAIN,EAC7B+E,EAAMxD,GAAWC,EAAQC,EAAMC,EAAQC,CAAM,EAC7CqD,EAAS/C,GAAWC,EAAK6C,CAAG,EAAIpF,GAChCY,EAAIuE,EAAOF,EAAOhE,EAAMgE,EAAOG,EAAI,EAAIC,EAAQ1E,EAAOiE,EAAQjE,CAAK,EACnEE,EAAIsE,EAAOD,EAAOjE,EACtBiE,EAAOE,EAAI,EAAIC,EACf7E,EACAqE,EAASrE,CACX,EACM8E,EAAO,KAAK,MAAM1E,EAAIqE,EAAMpE,EAAIqE,CAAI,EACtCK,EACJ,GAAID,EAAO,EAAG,CACZ,IAAM9C,EAAM,CAAE,GAAI5B,EAAIqE,GAAQK,EAAM,GAAIzE,EAAIqE,GAAQI,CAAK,EACnDE,EAAW/C,GAAeF,EAAKC,CAAG,EACxC+C,EAAS,CACP,KAAAN,EACA,KAAAC,EACA,OAAQtE,EAAI4B,EAAI,EAAIgD,EACpB,OAAQ3E,EAAI2B,EAAI,EAAIgD,CACtB,CACF,CACAV,EAAmB,KAAK,CACtB,MAAO,CACL,IAAK,OAAOX,EAAS,SAAS,GAC9B,KAAA5D,EACA,EAAAK,EACA,EAAAC,EACA,KAAM,WACN,OAAA0E,CACF,EACA,IAAK7E,EAAMC,EAAOC,EAAGC,CAAC,CACxB,CAAC,CACH,CAEF,IAAM4E,EAAqC,IAAI,IACzCC,EAAa,CAAC,GAAGjB,GAAmB,CAAC,CAAC,EAAE,KAAK,CAAChB,EAAGC,IAAMA,EAAE,GAAKD,EAAE,EAAE,EACxE,QAAWkC,KAAOD,EAAY,CAC5B,IAAME,EAAQjD,GAAUgD,EAAI,QAAS9C,CAAa,EAClD,GAAI,CAAC+C,EACH,SAEF,IAAMC,EAAY,KAAK,IAAID,EAAM,KAAO7D,EAAS2C,EAAY,CAAC,EACxDoB,EAAa,KAAK,IAAIF,EAAM,KAAO7D,EAAS2C,EAAYE,CAAK,EAC7DmB,EAAW,KAAK,IAAIH,EAAM,KAAO5D,EAAS2C,EAAY,CAAC,EACvDqB,EAAc,KAAK,IAAIJ,EAAM,KAAO5D,EAAS2C,EAAYE,CAAM,EACrE,GAAIiB,EAAaD,GAAaG,EAAcD,EAC1C,SAEF,IAAMf,EAAS,KAAK,IAAIc,EAAaD,EAAWG,EAAcD,CAAQ,EAChExF,EAAOoB,GAAagE,EAAI,EAAE,EAC1BhF,EAAQL,EAAeC,CAAI,EACjC,GAAIyE,GAAUrE,EAAQ,EAAIN,EAAoB,CAC5C,QAAW6C,KAAMyC,EAAI,QACnBF,EAAmB,IAAIvC,CAAE,EAE3B,IAAMtC,EAAIK,GAAO4E,EAAYC,GAAc,EAAGnF,EAAOiE,EAAQjE,CAAK,EAC5DE,EAAII,GACP8E,EAAWC,GAAe,EAC3BxF,EACAqE,EAASrE,CACX,EACAsE,EAAmB,KAAK,CACtB,MAAO,CACL,IAAK,aAAaa,EAAI,QAAQ,KAAK,GAAG,CAAC,GACvC,KAAApF,EACA,EAAAK,EACA,EAAAC,EACA,KAAM,UACR,EACA,IAAKH,EAAMC,EAAOC,EAAGC,CAAC,CACxB,CAAC,CACH,CACF,CACA,OAAW,CAACqC,EAAIM,CAAQ,IAAKF,GAAWT,EAAeU,CAAW,EAAG,CACnE,GAAIkC,EAAmB,IAAIvC,CAAE,EAC3B,SAEF,GAAM,CAAE,EAAAtC,EAAG,EAAAC,CAAE,EAAIoF,GAAiBzC,CAAQ,EACpCzC,EAAUF,EAAImB,EAAS2C,EAC7B,GAAI5D,EAAUP,GAAqB,GAAKO,EAAUP,GAAqBqE,EACrE,SAEF,IAAMe,EAAQM,EAAW1C,EAAUzB,EAAQC,CAAM,EACjD,GAAI4D,EAAQnF,GAAuB,EAAIJ,EACrC,SAEF,IAAME,EAAOgB,GAASgC,EAAY,IAAIL,CAAE,CAAC,EACnCvC,EAAQL,EAAeC,CAAI,EACjC,GAAIqF,GAASjF,EAAQ,EAAIN,EAAoB,CAC3C,IAAM8F,EAAUvF,EAAImB,EAAS2C,EAC7BK,EAAe,KAAK,CAClB,MAAO,CACL,IAAK,QAAQ7B,CAAE,GACf,KAAA3C,EACA,EAAG4F,EACH,EAAGpF,EACH,KAAM,MACR,EACA,IAAKL,EAAMC,EAAOwF,EAASpF,CAAO,CACpC,CAAC,CACH,CACF,CACA,MAAO,CAAE,UAAW+D,EAAoB,MAAOC,CAAe,CAChE,CACA,SAASqB,GAAgBxB,EAAOC,EAAQ,CACtC,OAAO,KAAK,IACV9E,GACA,KAAK,MAAM6E,EAAQC,EAAS/E,EAAiB,CAC/C,CACF,CACA,SAASuG,GAAgBC,EAAYC,EAAMC,EAAS,IAAU,CAC5D,IAAMC,EAAS,CAAC,EAChB,OAAW,CAAE,MAAAC,EAAO,IAAAnE,CAAI,IAAK+D,EAAY,CACvC,GAAIG,EAAO,QAAUD,EACnB,MAEED,EAAKhE,CAAG,GACVkE,EAAO,KAAKC,CAAK,CAErB,CACA,OAAOD,CACT,CACA,SAASE,GAAY,CACnB,SAAAC,EACA,KAAAL,EACA,GAAGM,CACL,EAAG,CACDN,IAASO,GAAUD,EAAMD,CAAQ,EACjC,GAAM,CAAE,UAAA/C,EAAW,MAAAkD,CAAM,EAAIxC,GAAoBsC,CAAI,EACrD,MAAO,CACL,GAAGR,GAAgBxC,EAAW0C,CAAI,EAClC,GAAGF,GAAgBU,EAAOR,EAAMH,GAAgBS,EAAK,MAAOA,EAAK,MAAM,CAAC,CAC1E,CACF,CCzSA,SAASG,GAAQC,EAAM,CACrB,IAAIC,EAAO,EACX,QAASC,EAAI,EAAGA,EAAIF,EAAK,OAAQE,IAC/BD,EAAOD,EAAK,WAAWE,CAAC,IAAMD,GAAQ,GAAKA,GAE7C,OAAO,KAAK,IAAIA,EAAO,GAAG,CAC5B,CACA,SAASE,GAAUC,EAAOC,EAAO,CAC/B,OAAOD,EAAQ,IAAMC,CACvB,CACA,IAAIC,GAAkB,GAClBC,GAAiB,GACjBC,GAAkB,GACtB,SAASC,GAAkBC,EAAW,CACpC,OAAOA,EAAY,GAAKA,GAAaF,EACvC,CACA,SAASG,GAAaP,EAAOC,EAAO,CAClC,MAAO,OAAOF,GAAUC,EAAOC,CAAK,CAAC,KAAKC,GAAkB,GAAG,MAAMC,GAAiB,GAAG,IAC3F,CACA,SAASK,GAAiBR,EAAOC,EAAO,CAEtC,MAAO,cADWA,EAAQ,EAAI,GAAK,GAAKD,GAASC,EAAQ,GAAK,EAChC,IAChC,CACA,SAASQ,GAAWb,EAAM,CACxB,IAAMc,EAAQC,EAAWf,CAAI,EAAE,KAAK,MAAM,GAAG,EACvCgB,EAAOF,EAAM,KAAK,GAAG,EAC3B,GAAIA,EAAM,QAAU,GAAKG,GAAgBH,EAAM,CAAC,CAAC,EAAG,CAClD,IAAMI,EAASJ,EAAM,MAAM,CAAC,EAAE,KAAK,GAAG,EACtC,MAAO,CAACI,EAAQA,EAAQF,CAAI,CAC9B,CACA,MAAO,CAACF,EAAM,CAAC,EAAGA,EAAM,MAAM,EAAG,CAAC,EAAE,KAAK,GAAG,EAAGE,CAAI,CACrD,CACA,SAASG,GAAYnB,EAAMoB,EAAO,CAChC,GAAM,CAAE,MAAAC,CAAM,EAAIN,EAAWf,CAAI,EACjC,OAAOoB,EAAM,IAAKE,GAAM,GAAGA,CAAC,KAAKC,GAAYF,CAAK,CAAC,EAAE,CACvD,CACA,SAASG,GAAWC,EAAOC,EAAQ,CACjC,IAAMC,EAA0B,IAAI,IACpCF,EAAM,QAAQ,CAACG,EAAM1B,IAAM,CACpByB,EAAQ,IAAIC,EAAK,IAAI,GACxBD,EAAQ,IAAIC,EAAK,KAAM1B,CAAC,CAE5B,CAAC,EACD,IAAM2B,EAAU,CAAC,GAAGF,CAAO,EAAE,IAAI,CAAC,CAACG,EAAO5B,CAAC,KAAO,CAAE,KAAM4B,EAAO,EAAA5B,CAAE,EAAE,EAC/D6B,EAAQF,EAAQ,IAAKG,GAAMnB,GAAWmB,EAAE,IAAI,CAAC,EAC7ChC,EAAQsB,GAAMO,EAAQ,IAAI,CAACI,EAAGC,IAAMH,EAAMG,CAAC,EAAEZ,CAAC,CAAC,EAC/Ca,EAAUb,GAAMO,EAAQ,IAAI,CAACG,EAAGE,IAAMf,GAAYa,EAAE,KAAMD,EAAMG,CAAC,CAAC,EAAEZ,CAAC,CAAC,EACtEc,EAAa,CACjBpC,EAAK,CAAC,EACNA,EAAK,CAAC,EACNmC,EAAO,CAAC,EACRnC,EAAK,CAAC,EACNmC,EAAO,CAAC,EACRA,EAAO,CAAC,CACV,EAIME,EAHWD,EAAW,KACzBE,GAAY,IAAI,IAAIA,CAAO,EAAE,OAAST,EAAQ,MACjD,GAC2BO,EAAW,GAAG,EAAE,EAC3C,OAAOP,EAAQ,IAAI,CAAC,CAAE,KAAMC,EAAO,EAAA5B,CAAE,EAAGgC,KAAO,CAC7C,KAAMJ,EACN,MAAOO,EAAOH,CAAC,EACf,MAAOR,IAASxB,CAAC,GAAKS,GAAaT,EAAGuB,EAAM,MAAM,CACpD,EAAE,CACJ,CACA,SAASc,GAAaV,EAAS,CAC7B,IAAMW,EAAuB,IAAI,IACjC,OAAO,IAAI,IACT,CAAC,GAAGX,CAAO,EAAE,KAAK,CAACY,EAAGC,IAAMD,EAAE,MAAM,cAAcC,EAAE,KAAK,CAAC,EAAE,IAAKV,GAAM,CACrE,IAAMW,GAAKH,EAAK,IAAIR,EAAE,KAAK,GAAK,GAAK,EACrC,OAAAQ,EAAK,IAAIR,EAAE,MAAOW,CAAC,EACZ,CAACX,EAAE,KAAMW,EAAI,EAAI,GAAGX,EAAE,KAAK,KAAKW,CAAC,IAAMX,EAAE,KAAK,CACvD,CAAC,CACH,CACF,CChFA,IAAIY,GAAc,CAChB,CACE,MAAO,QACP,MAAO,WACP,YAAa,yIACf,EACA,CACE,MAAO,YACP,MAAO,eACP,YAAa,4JACf,EACA,CACE,MAAO,UACP,MAAO,UACP,YAAa,gCACf,CACF,EACIC,GAAa,GACbC,GAAa,EACbC,GAAuB,IAC3B,SAASC,GAAUC,EAAO,CACxB,IAAIC,EAAW,EACXC,EAAS,EACb,QAAWC,KAAQH,EAAM,MACvBC,GAAYE,EAAK,MAAQA,EAAK,OAC9BD,GAAUC,EAAK,OAEjB,OAAOD,EAAS,EAAID,EAAWC,EAAS,CAC1C,CACA,SAASE,GAAYC,EAAM,CACzB,OAAOA,EAAK,SAAW,OAASC,GAAeD,EAAK,IAAI,GAAKA,EAAK,KAAO,GAAGA,EAAK,MAAM,IAAIA,EAAK,WAAa,CAAC,EAChH,CACA,SAASE,GAAeP,EAAO,CAC7B,OAAO,IAAI,KAAKA,EAAM,OAAS,CAAC,GAAG,IAAII,EAAW,CAAC,EAAE,IACvD,CACA,SAASI,GAAcL,EAAMM,EAAY,CACvC,OAAON,EAAK,YAAcM,EAAa,EAAIN,EAAK,MAAQM,EAAa,OACvE,CAWA,SAASC,GAAUC,EAAOC,EAAW,CACnC,OAAOA,IAAc,QAAUC,GAAUF,CAAK,EAAIC,IAAc,YAAcE,GAAeH,CAAK,EAAI,CACxG,CACA,SAASI,GAAgBC,EAAG,CAC1B,OAAO,KAAK,IAAIC,GAAY,KAAK,IAAIC,GAAsBF,CAAC,CAAC,CAC/D,CACA,SAASG,GAAqBC,EAAMC,EAAY,CAC9C,IAAML,EAAIM,GAAcF,EAAMC,CAAU,EACxC,OAAOL,IAAM,OAAS,EAAID,GAAgBC,CAAC,CAC7C,CACA,SAASO,GAAaC,EAAiB,CACrC,MAAO,CAAC,EAAG,GAAK,EAAG,EAAE,IAAKR,IAAO,CAC/B,MAAO,GAAGA,EAAI,GAAG,IACjB,QAASQ,EAAkBT,GAAgBC,CAAC,CAC9C,EAAE,CACJ,CACA,SAASS,GAAiBL,EAAMM,EAAM,CACpC,MAAI,EAAEA,EAAO,IAAM,EAAEN,EAAK,MAAQ,GACzB,EAEF,KAAK,IACVH,GACA,KAAK,IAAIU,GAAY,KAAK,KAAKP,EAAK,MAAQM,CAAI,CAAC,CACnD,CACF,CACA,SAASE,GAAYR,EAAMI,EAAiBZ,EAAWiB,EAAM,CAC3D,OAAOL,GAAmBZ,IAAc,QAAUa,GAAiBL,EAAMS,CAAI,EAAIjB,IAAc,YAAcO,GAAqBC,EAAMS,CAAI,EAAI,EAClJ,CACA,SAASC,GAAeN,EAAiBZ,EAAW,CAClD,OAAOY,GAAmBZ,IAAc,UAAY,EAAIK,GAC1D,CACA,IAAIc,GAAmB,EACvB,SAASC,GAAgBC,EAAOC,EAAO,CACrC,OAAO,KAAK,IAAID,EAAQC,EAAOH,EAAgB,CACjD,CACA,SAASI,GAAQxB,EAAOyB,EAAUZ,EAAiBZ,EAAWsB,EAAQ,EAAG,CACvE,IAAML,EAAOlB,EAAQD,GAAUC,EAAOC,CAAS,EAAI,EAC7CyB,EAASJ,GAAUC,EAAQ,EAAIF,GAAgBC,EAAOC,CAAK,EAAIA,EAAQ,EAAID,EAAQ,EACzF,MAAO,CACL,eAAgBI,EAAMP,GAAeN,EAAiBZ,CAAS,CAAC,EAChE,YAAc0B,GAAO,CACnB,IAAMlB,EAAOgB,GAAU,IAAIE,CAAE,EAC7B,OAAOD,EACLjB,EAAOQ,GAAYR,EAAMI,EAAiBZ,EAAWiB,CAAI,EAAIL,CAC/D,CACF,CACF,CACF,CCnGA,IAAIe,GAAc,CAChB,CACE,MAAO,UACP,MAAO,UACP,YAAa,gCACf,EACA,CACE,MAAO,QACP,MAAO,WACP,YAAa,+IACf,CACF,EACIC,GAAa,GACbC,GAAa,EACjB,SAASC,GAAYC,EAAO,CAC1B,IAAIC,EAAO,EACX,QAAWC,KAAQF,EAAM,MACvBC,EAAO,KAAK,IAAIA,EAAMC,EAAK,SAAS,QAAU,CAAC,EAEjD,OAAOD,CACT,CACA,SAASE,GAAgBC,EAAOC,EAASC,EAAW,CAClD,OAAIA,IAAc,WAAaD,IAAY,EAClC,EAEFR,IAAcC,GAAaD,IAAc,KAAK,KAAKO,EAAQC,CAAO,CAC3E",
+  "names": ["ROW_HEIGHT_PX", "svgPath", "points", "round", "v", "p", "i", "projectLine", "x1", "y1", "x2", "y2", "distance", "d", "vx", "vy", "curvePointAt", "c", "t", "u", "a", "b", "e", "curveMidpoint", "curves", "mid", "curveBounds", "minX", "minY", "maxX", "maxY", "subCurve", "t0", "t1", "p0", "p1", "dt", "d0", "curveTangentAt", "d1", "VISIBLE_SAMPLES", "visibleStretches", "lengths", "bounds", "yToX", "stretches", "start", "k", "length", "pad", "last", "next", "from", "to", "prev", "dashSpans", "curves", "dashWorld", "yToX", "bounds", "lengths", "c", "total", "a", "b", "periods", "spans", "stretches", "visibleStretches", "seen", "out", "i", "from", "to", "dash", "along", "start", "k", "length", "end", "t0", "t1", "subCurve", "slideCurves", "curves", "fromDx", "fromDy", "toDx", "toDy", "n", "out", "i", "c", "a", "b", "adx", "ady", "bdx", "bdy", "translateCurves", "dx", "dy", "attachment", "segments", "side", "last", "TANGENT_SPAN_FACTOR", "MAX_TANGENT", "ownStrand", "id", "strandSides", "edge", "own", "strand", "spanOf", "min", "max", "s", "distanceToSpan", "x", "span", "facingSide", "other", "tieBreak", "startGap", "endGap", "facingSides", "fromSegments", "toSegments", "laidSides", "heldFacingSides", "byTo", "sides", "APEX_FRACTION", "BOW_CLEARANCE", "ALONG_FRACTION", "MAX_ROW_BOW_PX", "ROW_HEIGHT_PX", "bowAround", "p1x", "p1y", "p2x", "p2y", "toward", "maxBow", "chord", "ux", "uy", "reach", "minAlong", "maxAlong", "p", "perp", "along", "uncapped", "size", "yToXOf", "scaleX", "scaleY", "PATH_RIBBON_SPACING_PX", "drawnDirection", "yToX", "len", "pathRibbonOffsets", "count", "axis", "spacing", "dir", "offsets", "distance", "scaleYOf", "points", "unscaleYOf", "polylinePx", "total", "SELF_LOOP_MIN_PX", "SELF_LOOP_MAX_PX", "selfLoopReach", "scale", "nodePx", "selfLinkOf", "edgeJoinOf", "stranded", "self", "hairpinCurves", "attach", "at", "inward", "px", "py", "nearX", "nearY", "apexX", "apexY", "sideX", "sideY", "computeEdgeCurves", "join", "bypassed", "maxBowIn", "loop", "fromAttach", "toAttach", "fromEnd", "toStart", "segDirX", "segDirY", "ext", "perpX", "perpY", "midX", "midY", "cp1x", "cp1y", "cp2x", "cp2y", "fromPrev", "toNext", "dist", "tangentProj", "prev", "towardX", "towardY", "towardToX", "towardToY", "cx1", "cy1", "projectLine", "cx2", "cy2", "bulge", "chordLen", "bulgeX", "bulgeY", "spreadX", "spreadY", "nearerEnd", "to", "start", "end", "routedEdgeCurves", "route", "tangent", "q", "next", "ta", "tb", "weakMemo", "cache", "key", "deps", "compute", "hit", "d", "i", "value", "LABEL_PX", "LABEL_CHAR_PX", "LABEL_PAD", "labelWidth", "text", "overlaps", "a", "b", "offFrame", "box", "frame", "insideFrame", "occupancy", "reserved", "placed", "p", "placeLabels", "candidates", "take", "out", "row", "stackFrom", "from", "direction", "w", "crowded", "tries", "y", "place", "first", "flip", "strand", "mergeRuns", "graph", "alone", "sides", "strandSides", "at", "attach", "id", "side", "ei", "pushTo", "edge", "joinAfter", "a", "out", "joined", "runOf", "runs", "node", "into", "pred", "run", "next", "byId", "n", "nodes", "members", "backbone", "isBackbone", "first", "b", "sum", "seen", "edges", "from", "to", "key", "ownStrand", "splitRuns", "positions", "weightOf", "line", "arc", "arcPrefix", "total", "weights", "m", "weightSum", "member", "k", "share", "slice", "polylineSlice", "polylineMidpoint", "pointAt", "i", "firstReaching", "s", "lo", "hi", "mid", "span", "t", "points", "trimToWindow", "graph", "window", "inWindow", "n", "isBackbone", "overlapsWindow", "paths", "spans", "path", "first", "last", "id", "i", "span", "kept", "trimmed", "stretches", "nodeIds", "e", "trimVisits", "trimOrigins", "visits", "nameOf", "next", "out", "PathVisitsBuilder", "p", "origin", "pathOrigin", "segment", "at", "clipToWindow", "reachBp", "nodes", "node", "from", "to", "start", "end", "unclipped", "full", "MIN_DELETION_BP", "deletionKey", "reference", "bypassedPoints", "nodePositions", "bypassed", "id", "edgeCurvesOf", "edge", "axis", "route", "stranded", "from", "to", "routedEdgeCurves", "strandSides", "computeEdgeCurves", "edgeJoinOf", "backboneBySequence", "graph", "bySequence", "groupBy", "isBackbone", "node", "list", "a", "b", "bypassedNodes", "nodes", "start", "end", "i", "firstNodeAtOrAfter", "skipsBetween", "forwards", "fromStrand", "toStrand", "leavesRight", "arrivesLeft", "skippedSpan", "visitsOf", "best", "span", "COPY_SWITCH_SHARE", "repeatCopies", "backbone", "refName", "copies", "starts", "v", "next", "switchesCopy", "bp", "partitionPoint", "k", "near", "c", "backboneLinks", "cut", "unclipped", "byId", "n", "referenceVisits", "edgeIndex", "deletionEdges", "links", "closableLinks", "edgeIndexes", "parent", "root", "r", "join", "ra", "rb", "candidates", "e", "ei", "dashedDeletions", "shown", "lift", "d", "drawings", "deletionDrawing", "deletions", "show", "byShow", "drawing", "hidden", "MIN_DELETION_LABEL_PX", "PX_PER_NODE_LABEL", "MIN_NODE_LABELS", "LEADER_GAP_PX", "LABEL_CHAR_PX", "LABEL_PAD_PX", "LABEL_HEIGHT_PX", "LABEL_GAP_PX", "MAX_LABEL_OVERHANG", "labelHalfWidth", "text", "LABEL_HALF_HEIGHT", "MIN_LABEL_HALF_WIDTH", "boxAt", "halfW", "x", "y", "rowLabelBox", "screenY", "labelWidth", "clamp", "v", "lo", "hi", "groupDigits", "n", "formatBp", "bp", "value", "unit", "deletionText", "arcOutward", "curves", "apex", "scaleX", "scaleY", "first", "last", "dx", "dy", "len", "boxSupport", "box", "dir", "boxRayCrossing", "halfH", "runBounds", "nodeIds", "nodePositions", "minX", "minY", "maxX", "maxY", "id", "p", "nodeOrderCache", "weakMemo", "labelOrder", "nodeLengths", "segments", "a", "b", "arcCache", "arcPlacements", "deletions", "axis", "version", "routes", "stranded", "arcs", "deletion", "edgeCurvesOf", "curveMidpoint", "curveBounds", "sizeLabelCandidates", "deletionRoutes", "alleleDeletions", "translateX", "translateY", "width", "height", "deletionCandidates", "nodeCandidates", "extent", "arcX", "arcY", "fits", "bow", "offset", "away", "leader", "crossing", "labelledByDeletion", "alleleRuns", "run", "drawn", "shownLeft", "shownRight", "shownTop", "shownBottom", "polylineMidpoint", "polylinePx", "screenX", "nodeLabelBudget", "placeSizeLabels", "candidates", "take", "budget", "labels", "label", "graphLabels", "reserved", "args", "occupancy", "nodes", "nameHue", "name", "hash", "i", "pathHueAt", "index", "count", "PATH_SATURATION", "PATH_LIGHTNESS", "MAX_PATH_COLORS", "pathColorsLegible", "pathCount", "pathCssColor", "pathGreyCssColor", "labelTiers", "parts", "pathOrigin", "full", "isGenericSample", "contig", "offsetTiers", "tiers", "start", "t", "groupDigits", "pathLegend", "paths", "colors", "firstOf", "path", "entries", "name2", "named", "e", "_", "k", "offset", "candidates", "labels", "labels2", "walkLabelsOf", "seen", "a", "b", "n", "NODE_WIDTHS", "MIN_FACTOR", "MAX_FACTOR", "MIN_FREQUENCY_FACTOR", "meanDepth", "graph", "weighted", "length", "node", "haplotypeOf", "path", "panSNHaplotype", "haplotypeCount", "nodeFrequency", "haplotypes", "widthNorm", "graph", "nodeWidth", "meanDepth", "haplotypeCount", "frequencyFactor", "f", "MAX_FACTOR", "MIN_FREQUENCY_FACTOR", "frequencyWidthFactor", "node", "haplotypes", "nodeFrequency", "frequencyKey", "contigThickness", "depthWidthFactor", "mean", "MIN_FACTOR", "nodeWidthPx", "norm", "maxNodeWidthPx", "MIN_WALK_LANE_PX", "walkLaneWidthPx", "width", "lanes", "nodeInk", "nodeById", "reach", "id", "EDGE_WIDTHS", "MIN_FACTOR", "MAX_FACTOR", "busiestEdge", "graph", "most", "edge", "edgeWidthFactor", "walks", "busiest", "edgeWidth"]
 }

package/dist/chunks/{chunk-ULPW4VGT.js → chunk-5QJ2ANXK.js}

@@ -1,2 +1,2 @@
-import{l as b,m as $,n as S,p as E,q as x,r as T}from"./chunk-VNWCN47G.js";function A(e){let{refName:n,start:t,end:r}=e??{};return typeof n=="string"&&Number.isFinite(t)&&Number.isFinite(r)&&t<r?{refName:n,start:t,end:r}:void 0}function D(e){let n=Number(e);return e!=="auto"&&Number.isFinite(n)?n:"auto"}var w=e=>e.toLocaleString("en-US"),v=({refName:e,start:n,end:t})=>`${e}:${w(n+1)}-${w(t)}`,L=e=>`Forms of ${v(e)}: `;var C={deletion:{svType:"DEL",type:"deletion",alt:"<DEL>"},insertion:{svType:"INS",type:"insertion",alt:"<INS>"},duplication:{svType:"DUP",type:"tandem_duplication",alt:"<DUP:TANDEM>"},replacement:{svType:"CPX",type:"complex_substitution",alt:"<CPX>"},inversion:{svType:"INV",type:"inversion",alt:"<INV>",consequence:"inversion"},shift:{svType:"CPX",type:"complex_structural_alteration",alt:"<CPX>",consequence:"shift"},net:{svType:"CPX",type:"complex_structural_alteration",alt:"<CPX>",consequence:"net"}},_=e=>e.lopsided??(e.delta<0?"deletion":"insertion"),P=e=>C[e.kind].consequence??(_(e)==="deletion"?"loss":"gain"),f=e=>`F${e+1}`,O="other",l=8;function F(e,n){let t=100*e/n;return t>0&&t<1?"<1%":`${Math.round(t)}%`}var d=({forms:e},n)=>e.length>n+1?Math.max(0,n):e.length,m=e=>e.reduce((n,t)=>n+t.members.length,0);function U(e,n=l){let t=d(e,n),r=e.forms.slice(t);return[...e.forms.slice(0,t).map((s,a)=>({name:f(a),label:`${F(s.members.length,e.placed)} \xB7 ${T(s,e)}`,haplotypes:s.members.length,forms:1})),...r.length>0?[{name:O,label:`other forms \xB7 ${F(m(r),e.placed)}`,haplotypes:m(r),forms:r.length}]:[]]}var N=5;function k(e){let n=e.slice(0,N).join(", "),t=e.length-N;return t>0?`${n} and ${t} more`:n}var u=e=>`${e} haplotype${e===1?"":"s"}`;function j(e,n=l){let{abridged:t,unplaced:r,forms:s}=e,a=d(e,n),i=s.slice(a);return[...i.length>0?[`${i.length} smaller forms, ${u(m(i))}, share the empty "other forms" row; maxForms sets how many forms get a row of their own`]:[],...t.length>0?[`${u(t.length)} kept an abridged walk past the forms cut's step budget, which shows as a net change over its span: ${k(t)}`]:[],...r.length>0?[`${u(r.length)} ${r.length===1?"has":"have"} no walk over the pinned window, so no form: ${k(r)}`]:[]]}function V(e,n=l){return Object.fromEntries(e.forms.slice(0,d(e,n)).map((t,r)=>[f(r),"0"]))}function q({copied:e,refStart:n,refEnd:t}){let[r,s]=e??[n,t];return{start:r,end:Math.max(s,r+1)}}var R=(e,n)=>e===n?"1":e===$||e===S?".":"0";function K(e,n=l){let{sites:t,forms:r,placed:s}=e,a=d(e,n);return t.flatMap((i,g)=>i.edge?[]:i.states.flatMap(c=>{if(c.key===b)return[];let h=r.map(o=>x(e,o,g)),y=Object.fromEntries(h.slice(0,a).map((o,p)=>[f(p),R(o,c.key)])),M=m(r.filter((o,p)=>h[p]===c.key));return Object.values(y).includes("1")?c.marks.map((o,p)=>({id:`${g}:${c.key}:${p}`,...q(o),name:E(o),description:`${M} of ${u(s)}`,...C[o.kind],consequence:P(o),mark:o,genotypes:y})):[]}))}export{A as a,D as b,v as c,L as d,l as e,U as f,j as g,V as h,K as i};
-//# sourceMappingURL=chunk-ULPW4VGT.js.map
+import{l as b,m as $,n as S,p as E,q as x,r as T}from"./chunk-YNMEZ4EZ.js";function A(e){let{refName:n,start:t,end:r}=e??{};return typeof n=="string"&&Number.isFinite(t)&&Number.isFinite(r)&&t<r?{refName:n,start:t,end:r}:void 0}function D(e){let n=Number(e);return e!=="auto"&&Number.isFinite(n)?n:"auto"}var w=e=>e.toLocaleString("en-US"),v=({refName:e,start:n,end:t})=>`${e}:${w(n+1)}-${w(t)}`,L=e=>`Forms of ${v(e)}: `;var C={deletion:{svType:"DEL",type:"deletion",alt:"<DEL>"},insertion:{svType:"INS",type:"insertion",alt:"<INS>"},duplication:{svType:"DUP",type:"tandem_duplication",alt:"<DUP:TANDEM>"},replacement:{svType:"CPX",type:"complex_substitution",alt:"<CPX>"},inversion:{svType:"INV",type:"inversion",alt:"<INV>",consequence:"inversion"},shift:{svType:"CPX",type:"complex_structural_alteration",alt:"<CPX>",consequence:"shift"},net:{svType:"CPX",type:"complex_structural_alteration",alt:"<CPX>",consequence:"net"}},_=e=>e.lopsided??(e.delta<0?"deletion":"insertion"),P=e=>C[e.kind].consequence??(_(e)==="deletion"?"loss":"gain"),f=e=>`F${e+1}`,O="other",l=8;function F(e,n){let t=100*e/n;return t>0&&t<1?"<1%":`${Math.round(t)}%`}var d=({forms:e},n)=>e.length>n+1?Math.max(0,n):e.length,m=e=>e.reduce((n,t)=>n+t.members.length,0);function U(e,n=l){let t=d(e,n),r=e.forms.slice(t);return[...e.forms.slice(0,t).map((s,a)=>({name:f(a),label:`${F(s.members.length,e.placed)} \xB7 ${T(s,e)}`,haplotypes:s.members.length,forms:1})),...r.length>0?[{name:O,label:`other forms \xB7 ${F(m(r),e.placed)}`,haplotypes:m(r),forms:r.length}]:[]]}var N=5;function k(e){let n=e.slice(0,N).join(", "),t=e.length-N;return t>0?`${n} and ${t} more`:n}var u=e=>`${e} haplotype${e===1?"":"s"}`;function j(e,n=l){let{abridged:t,unplaced:r,forms:s}=e,a=d(e,n),i=s.slice(a);return[...i.length>0?[`${i.length} smaller forms, ${u(m(i))}, share the empty "other forms" row; maxForms sets how many forms get a row of their own`]:[],...t.length>0?[`${u(t.length)} kept an abridged walk past the forms cut's step budget, which shows as a net change over its span: ${k(t)}`]:[],...r.length>0?[`${u(r.length)} ${r.length===1?"has":"have"} no walk over the pinned window, so no form: ${k(r)}`]:[]]}function V(e,n=l){return Object.fromEntries(e.forms.slice(0,d(e,n)).map((t,r)=>[f(r),"0"]))}function q({copied:e,refStart:n,refEnd:t}){let[r,s]=e??[n,t];return{start:r,end:Math.max(s,r+1)}}var R=(e,n)=>e===n?"1":e===$||e===S?".":"0";function K(e,n=l){let{sites:t,forms:r,placed:s}=e,a=d(e,n);return t.flatMap((i,g)=>i.edge?[]:i.states.flatMap(c=>{if(c.key===b)return[];let h=r.map(o=>x(e,o,g)),y=Object.fromEntries(h.slice(0,a).map((o,p)=>[f(p),R(o,c.key)])),M=m(r.filter((o,p)=>h[p]===c.key));return Object.values(y).includes("1")?c.marks.map((o,p)=>({id:`${g}:${c.key}:${p}`,...q(o),name:E(o),description:`${M} of ${u(s)}`,...C[o.kind],consequence:P(o),mark:o,genotypes:y})):[]}))}export{A as a,D as b,v as c,L as d,l as e,U as f,j as g,V as h,K as i};
+//# sourceMappingURL=chunk-5QJ2ANXK.js.map

package/dist/chunks/chunk-5TT5TG4Q.js

@@ -0,0 +1,2 @@
+import{c as se,o as re,r as ht}from"./chunk-WJHTNDTQ.js";import{a as Tt,c as ne,d as Gt,e as Pt}from"./chunk-2FG67WIZ.js";var Se="ws",Ae="we",oe=["elsewhere","break","end"],Te={missing:"not in the graph",elsewhere:"on nodes filed elsewhere",unknown:"gap, cause unknown",abridged:"abridged: steps not loaded",deleted:"no step on the reference"},Pe="outside the extracted subgraph";function ie(t,e,s){if(!e&&!s)return[{bp:t}];let n=Math.min(e?.trimmed??0,t),r=Math.min(s?.trimmed??0,t-n),a=t-n-r,p=e?.kind==="break"?Math.min(e.bp,a):0;a-=p;let l=s?.kind==="break"?Math.min(s.bp,a):0;a-=l;let d=[e,s].find(f=>f?.kind==="elsewhere");return[{bp:n},{bp:p,cause:"missing"},d?.kind==="elsewhere"?{bp:a,cause:"elsewhere",chunk:d.chunk}:{bp:a,cause:"unknown"},{bp:l,cause:"missing"},{bp:r}].filter(f=>f.bp>0)}function Lt(t,e){let s=t.bp[e],n=t.chunkRefs[e];return ce(t.kindNames[t.kinds[e]],Number.isNaN(s)?void 0:s,t.trimmed[e],n<0?void 0:{refName:t.chunkRefNames[n],start:t.chunkStarts[e]})}function ce(t,e,s,n){let r=s>0?{trimmed:s}:{};return t==="elsewhere"&&n?{kind:t,chunk:n,...e===void 0?{}:{bp:e},...r}:t==="break"&&e!==void 0?{kind:t,bp:e,...n?{chunk:n}:{},...r}:t==="end"?{kind:t,...r}:void 0}function ae(t){let[e,...s]=t.split(","),n,r=0,a;for(let p of s)if(p.startsWith("bp="))n=+p.slice(3);else if(p.startsWith("trimmed="))r=+p.slice(8);else if(p.startsWith("chunk=")){let l=p.lastIndexOf(":");a={refName:p.slice(6,l),start:+p.slice(l+1)}}return ce(e,n,r,a)}function Wt(t,e){return{...t?{before:t}:{},...e?{after:e}:{}}}function _e(t){let e=t[Se],s=t[Ae];return Wt(typeof e=="string"?ae(e):void 0,typeof s=="string"?ae(s):void 0)}var Ue=class{constructor(){this.kinds=[],this.bp=[],this.trimmed=[],this.chunkRefs=[],this.chunkStarts=[],this.chunkRefNames=[],this.refIndex=new Map}push(t){this.kinds.push(oe.indexOf(t.kind)),this.bp.push("bp"in t&&t.bp!==void 0?t.bp:NaN),this.trimmed.push(t.trimmed??0);let e="chunk"in t?t.chunk:void 0;if(e){let s=this.refIndex.get(e.refName);s===void 0&&(s=this.chunkRefNames.length,this.refIndex.set(e.refName,s),this.chunkRefNames.push(e.refName)),this.chunkRefs.push(s),this.chunkStarts.push(e.start)}else this.chunkRefs.push(-1),this.chunkStarts.push(NaN)}table(){return{kinds:Uint8Array.from(this.kinds),kindNames:[...oe],bp:Float64Array.from(this.bp),trimmed:Float64Array.from(this.trimmed),chunkRefs:Int32Array.from(this.chunkRefs),chunkStarts:Float64Array.from(this.chunkStarts),chunkRefNames:this.chunkRefNames}}};function Ie(t,e,s){return e===0?t:`${t}:${e}-${s}`}function Dt(t,e){let s=t.names[e],n=Pt(s),r=t.starts[e],a=t.abridgedSteps?.[e]??Number.NaN,p=Number.isNaN(a)?{}:{abridged:{steps:a,bp:t.abridgedBp?.[e]??0}};return n?{name:`${n.sample}#${n.haplotype}#${n.contig}`,start:r,...n,...Wt(t.before&&Lt(t.before,e),t.after&&Lt(t.after,e)),...p}:{name:Ie(s,r,t.ends[e]),start:r}}function Re(t,e,s,n){let r=new Int32Array(s+1);for(let d of t)r[d+1]++;for(let d=0;d<s;d++)r[d+1]+=r[d];let a=r.slice(0,s),p=new Int32Array(t.length);t.forEach((d,k)=>{p[a[d]++]=e[k]});let l=new Int32Array(n.length).fill(-1);return Array.from({length:s},(d,k)=>{let f=[];for(let T=r[k];T<r[k+1];T++){let b=p[T];l[b]!==k&&(l[b]=k,f.push(n[b]))}return f})}function Vt({nodes:t,links:e,walks:s},n){let r=new Uint8Array(t.names.length),a=(l,d)=>{r[l]===0&&(r[l]=d?2:1)};for(let l=0;l<e.from.length;l++)a(e.from[l],e.strands[l]&1),a(e.to[l],e.strands[l]&2);let p=s.offsets[s.names.length]??0;for(let l=0;l<p;l++){let d=s.steps[l];a(d,s.reversed[l]),n&&n[d]++}return t.names.map((l,d)=>`${l}${r[d]===2?"-":"+"}`)}function De({nodes:t,links:e,walks:s,skips:n},r="Imported GFA"){let a=t.names.length,p=t.lengths.length,l=[];for(let o=0;o<s.names.length;o++)s.offsets[o+1]>s.offsets[o]&&l.push(o);let d=new Int32Array(a),k=Vt({nodes:t,links:e,walks:s},d),f=[];for(let o=0;o<p;o++){let w=t.refs[o];f.push({id:k[o],name:t.names[o],length:t.lengths[o],depth:Math.max(d[o],1),stable:w<0?void 0:{refName:t.refNames[w],start:t.starts[o],rank:t.ranks[o]},samples:void 0})}let T=[],b=new Array(a),O=(o,w)=>{let g=b[o];if(g){for(let I=0;I<g.length;I+=2)if(g[I]===w)return g[I+1]}},B=(o,w,g)=>{let I=b[o];I?I.push(w,g):b[o]=[w,g]},dt=[],Y=0;for(let o=0;o<e.from.length;o++){let w=e.from[o],g=e.to[o];T.push({from:k[w],to:k[g],fromStrand:e.strands[o]&1?"-":"+",toStrand:e.strands[o]&2?"-":"+"});let I=O(w,g);I===void 0&&(I=Y++,B(w,g,I),B(g,w,I)),dt.push(I)}let U=new Int32Array(a+1);for(let o=0;o<a;o++)U[o+1]=U[o]+(b[o]?.length??0)/2;let pt=new Int32Array(U[a]),mt=new Int32Array(U[a]);b.forEach((o,w)=>{for(let g=0;g<o.length;g+=2)pt[U[w]+g/2]=o[g],mt[U[w]+g/2]=o[g+1]});let tt=(o,w)=>{for(let g=U[o];g<U[o+1];g++)if(pt[g]===w)return mt[g];return-1},ut=new Map,P=[],et=new Int32Array(s.offsets[s.names.length]??0),st=new Int32Array(et.length),Z=0,X=new Int32Array(Y).fill(-1),F=[],wt=[],_=s.offsets[s.names.length]??0,nt=new Int32Array(_),gt=new Float64Array(_),St=new Uint8Array(_),C=new Int32Array(a).fill(-1),$=[],E=[0],rt=[],At=new Map,L=[];for(let o of l){let w=Dt(s,o),{start:g,name:I}=w,z=w.sample===void 0?s.names[o]:I,K=ut.get(z);K===void 0&&(K=P.length,ut.set(z,K),P.push(z),rt.push(Tt(z)));let at=At.get(I);at===void 0&&(at=L.length,At.set(I,at),L.push(I));let _t=rt[K],Nt=s.offsets[o],It=new Array(s.offsets[o+1]-Nt),bt=g,i=-1;for(let h=Nt;h<s.offsets[o+1];h++){let N=s.steps[h];It[h-Nt]=k[N],C[N]===-1&&(C[N]=E.at(-1),E.push(C[N]+d[N]),$.push(N));let M=C[N]++;if(nt[M]=K,gt[M]=bt,St[M]=s.reversed[h],bt+=N<p?t.lengths[N]:0,i>=0){let x=tt(i,N);x>=0&&X[x]!==o&&(X[x]=o,et[Z]=x,st[Z++]=at)}i=N}F.push({...w,nodeIds:It}),wt.push({name:z,sample:_t,start:g,length:bt-g})}let H=Re(et.subarray(0,Z),st,Y,L);T.forEach((o,w)=>{let g=H[dt[w]];g.length>0&&(o.pathIds=g)});let ot=l.length>0;return{name:r,nodes:f,edges:T,paths:ot?F:void 0,anchorPaths:ot?wt:void 0,pathVisits:ot?new re({segments:$.map(o=>t.names[o]),offsets:Int32Array.from(E),path:nt.subarray(0,E.at(-1)),start:gt.subarray(0,E.at(-1)),reversed:St.subarray(0,E.at(-1)),paths:P,samples:rt}):void 0,anchoredBy:f.some(o=>o.stable)?"tags":void 0,...n?.names.length?{skips:n}:{}}}var Zt=1,de=2,kt=4,pe=[void 0,"missing","elsewhere","unknown","abridged","deleted"],me=3,fe=t=>pe.indexOf(t)<<me;function ue(t,e,s){return e!==void 0&&t.includes(e)?e:t.find(n=>s.has(n))??t[0]}function $e(t){return ue((t.paths??[]).map(e=>ht(e.name).name),t.referencePath,new Set(t.nodes.flatMap(e=>e.stable?.rank===0?[e.stable.refName]:[])))}var ge=t=>{let e=t&&Gt(t);return s=>s!==void 0&&(s===t||s===e)};function xe(t){let e=new Map,s=[],n=[],r=b=>{let O=e.get(b);return O===void 0&&(O=s.length,e.set(b,O),s.push(b),n.push(0)),O},a=$e(t),p=ge(a),l=new Map;for(let b of t.nodes){let O=r(b.id);n[O]=b.length,b.stable?.rank===0&&p(b.stable.refName)&&l.set(O,b.stable.start)}let d=t.paths??[],k=new Int32Array(d.length),f=new Int32Array(d.length),T=[];return d.forEach((b,O)=>{k[O]=T.length;for(let B of b.nodeIds)T.push(r(B));f[O]=T.length}),{heads:d,from:k,to:f,steps:Int32Array.from(T),lengths:Int32Array.from(n),names:s,reference:a,stableStart:b=>l.get(b)??Number.NaN}}function Me(t,e,s){let{nodes:n,walks:r}=t,a=[];for(let f=0;f<r.names.length;f++)r.offsets[f+1]>r.offsets[f]&&a.push(f);let p=a.map(f=>Dt(r,f)),l=new Set;for(let f=0;f<n.lengths.length;f++)n.refs[f]>=0&&n.ranks[f]===0&&l.add(n.refNames[n.refs[f]]);let d=ue(p.map(f=>ht(f.name).name),e,l),k=ge(d);return{heads:p,from:Int32Array.from(a,f=>r.offsets[f]),to:Int32Array.from(a,f=>r.offsets[f+1]),steps:r.steps,lengths:n.lengths,names:s?Vt(t):n.names,reference:d,stableStart:f=>f<n.lengths.length&&n.ranks[f]===0&&k(n.refNames[n.refs[f]])?n.starts[f]:Number.NaN}}function Ht(t){return t.sample??Tt(t.name)}function le(t){return t.haplotype!==void 0&&t.sample!==void 0?`${t.sample}#${t.haplotype}`:Ht(t)}var he=class{constructor(t){this.offsets=[0],this.values=Array.from({length:t},()=>[])}get length(){return this.values[0].length}push(t,e,s,n,r){let a=this.values;a[0].push(t),a[1].push(e),a[2].push(s),a[3].push(n),r!==void 0&&a[4].push(r)}endRow(){this.offsets.push(this.length)}reorder(t,e){let s=new Uint32Array(t.length+1);t.forEach((r,a)=>{s[a+1]=s[a]+this.offsets[r+1]-this.offsets[r]});let n=e.map((r,a)=>{let p=this.values[a],l=r(this.length),d=0;for(let k of t)for(let f=this.offsets[k];f<this.offsets[k+1];f++)l[d++]=p[f];return l});return{offsets:s,columns:n}}},yt=t=>new Float64Array(t);function qe(t,e,s={}){let{heads:n,from:r,to:a,steps:p,lengths:l,names:d,reference:k,stableStart:f}="walks"in t?Me(t,s.referencePath,s.visits):xe(t),T=l.length,b=i=>i<T?l[i]:0,O=i=>ht(n[i].name).name,B=i=>n[i].start,dt=(i,h)=>(B(i)??0)-(B(h)??0),Y=n.map((i,h)=>h),U=Y.filter(i=>O(i)===k).sort(dt),pt=U[0],mt=Y.filter(i=>O(i)!==k),{skips:tt}=t;if(pt===void 0||mt.length===0&&!tt?.names.length)return;let ut=se(mt,O),P=new Float64Array(d.length).fill(Number.NaN),et=new Float64Array(d.length),st=new Map,Z=-1/0,X=1/0,F=e&&e.end>e.start?e:void 0;for(let i of U){let h=B(i)??0;for(let N=r[i],M=a[i];N<M;N++){let x=p[N],A=b(x);if(Number.isNaN(P[x]))P[x]=h,et[x]=h+A,F&&(h+A<=F.start&&(Z=Math.max(Z,h+A)),h>=F.end&&(X=Math.min(X,h)));else{let W=st.get(x);W?W.push(h):st.set(x,[P[x],h])}h+=A}}let wt=F===void 0||Z>-1/0&&X<1/0,_=new he(5),nt=[],gt=new Map,St=i=>{if(!i)return-1;let h=`${i.refName}:${i.start}`,N=gt.get(h);return N===void 0&&(N=nt.length,gt.set(h,N),nt.push(i)),N},C=s.visits?new he(4):void 0,$=new Int32Array(0),E=new Float64Array(0),rt=i=>{let h=n[i[0]],N=[...i].sort(dt),M=N.length-1,x=0;for(let c of N)M+=a[c]-r[c]+(n[c].abridged?1:0),x+=n[c].abridged?.steps??0;M>$.length&&($=new Int32Array(M*2),E=new Float64Array(M*2));let A=0,W=!1,Rt,$t,q=new Map,Ut=0;for(let c of N){let m=B(c),y=m===void 0||Rt===void 0?0:m-Rt;(m===void 0||y<0)&&(W=!0),y<0&&n[$t].abridged&&(Ut-=y);let S=Math.min(Ut,Math.max(y,0));Ut-=S;let u=y-S;u>0&&(q.set(A,ie(u,$t===void 0?void 0:n[$t].after,n[c].before)),$[A]=-u,E[A++]=Rt);let v=m??0,R=n[c].abridged;for(let j=r[c],Q=a[c];j<Q;j++){let G=p[j],V=R?R.bp-(v-(m??0))-b(G):0;V>0&&j===Q-1&&j>r[c]&&(q.set(A,[{bp:V,cause:"abridged"}]),$[A]=-V,E[A++]=v,v+=V),$[A]=G,E[A++]=v,v+=b(G)}Rt=m===void 0?void 0:v,$t=c}let Xt=c=>c>=0&&c<A&&$[c]>=0&&!Number.isNaN(P[$[c]]),jt=c=>{let m=$[c];return E[c]+(m<0?-m:b(m))},Ne=(c,m)=>{let y=c>=0?c:m,S=-1;for(let G=1;S<0&&G<A;G++)S=[y-G,y+G].find(Xt)??-1;if(S<0)return;let u=S>y==P[$[S]]>P[$[y]],v=u===(y===c),R=v?A-1:0,j=Xt(R);return{stop:{contigEnds:j,shortBp:j?Math.max(0,F.start-et[$[R]],P[$[R]]-F.end):0},lo:v?y+1:0,hi:v?A:y,backward:!u,axisStart:u?v?jt(y):E[0]:v?jt(A-1):E[y]}},xt=0,Mt=A,it=!1,zt=!0,vt=-1,Kt=-1,Bt,qt,Jt=(c,m)=>{let S=q.get(c)?.[0];if(m<=0||S?.cause!=="abridged")return 0;let u=Math.min(m,S.bp);return q.set(c,S.bp>u?[{...S,bp:S.bp-u}]:[]),$[c]+=u,u},Qt=c=>q.get(c)?.[0]?.cause==="abridged",be=c=>{let m=$[c];return m<0||q.has(c)?Number.NaN:Number.isNaN(P[m])&&(Qt(c-1)||Qt(c+1))?f(m):P[m]},Ot=0,Yt=0;if(F&&wt){let c=-1,m=-1,y=-1/0,S=1/0;for(let u=0;u<A;u++){let v=be(u);if(!Number.isNaN(v)){let R=v+b($[u]);R<=F.start&&R>y&&(y=R,c=u),v>=F.end&&v<S&&(S=v,m=u)}}if(c<0||m<0){zt=!1;let u=c>=0||m>=0?Ne(c,m):void 0;u&&({lo:xt,hi:Mt,backward:it,axisStart:Bt,stop:qt}=u)}else{xt=Math.min(c,m)+1,Mt=Math.max(c,m),it=c>m,vt=c,Kt=m;let u=it?-1:1;Ot=Jt(c+u,Z-y),Yt=Jt(m-u,S-X)}}let Et=h.contig??Gt(ht(h.name).name),ve=W||A===0?void 0:Bt!==void 0?{contig:Et,start:Bt,reversed:it}:vt<0?{contig:Et,start:E[0],reversed:!1}:vt<Kt?{contig:Et,start:jt(vt)+Ot,reversed:!1}:{contig:Et,start:E[vt]-Ot,reversed:!0},ct=0,te=0,ee=0,ft=0,D=-1,lt=0,J=Number.NaN,Ft=Number.NaN,ke=c=>{let m=st.get(c);if(!m||Number.isNaN(Ft))return P[c];let y=b(c),S=m[0],u=1/0;for(let v of m){let R=Math.min(Math.abs(v-Ft),Math.abs(v+y-Ft));R<u&&(S=v,u=R)}return S},[,Ct,ye,we]=_.values;for(let c=xt;c<Mt;c++){let m=it?Mt-1-(c-xt):c,y=$[m],S=q.get(m);if(S){for(let V of it?[...S].reverse():S)_.push(ct,V.bp,Number.NaN,kt|fe(V.cause),St(V.chunk)),ct+=V.bp;D=_.length-1,lt=kt,J=Number.NaN,ee+=-y,ft=0;continue}let u=b(y),v=ke(y),R=!Number.isNaN(v);C?.push(y,ct,u,R?1:0);let j=D>=0&&!Number.isNaN(J),Q=R&&j&&ft>=0&&J+(Ct[D]??0)===v,G=R&&j&&ft<=0&&v+u===J;!R&&D>=0&&!(lt&(Zt|kt))?Ct[D]+=u:Q||G?(Ct[D]+=u,Q||(J=v,ye[D]=v,lt|=de,we[D]=lt),ft=Q?1:-1):(lt=R?Zt:0,J=R?v:Number.NaN,_.push(ct,u,J,lt,-1),D=_.length-1,ft=0),ct+=u,R?Ft=ft<0?v:v+u:te+=u}return _.endRow(),C?.endRow(),{name:h.name,label:le(h),sample:Ht(h),haplotype:h.haplotype,bp:ct,offReferenceBp:te,gapBp:ee,complete:zt,stop:qt,axis:ve,...x>0?{abridgedSteps:x}:{},...Ot+Yt>0?{estimated:!0}:{}}},At=(i,h,N,M)=>{let x=M?Math.max(h,M.start):h,A=Math.max((M?Math.min(N,M.end):N)-x,0);_.push(x-(M?M.start:h),A,Number.NaN,kt|fe("deleted"),-1),_.endRow(),C?.endRow();let W={name:i,...Pt(i)};return{name:i,label:le(W),sample:Ht(W),haplotype:W.haplotype,bp:0,offReferenceBp:0,gapBp:A,complete:!0,stop:void 0,axis:void 0,deletionBp:N-h}},L=rt(U),H=[...ut.values()].map((i,h)=>({meta:rt(i),row:h+1})),ot=new Set(ut.keys()),{axis:o}=L,w=o?{start:o.start,end:o.start+L.bp+L.gapBp}:F;tt?.names.forEach((i,h)=>{let N=ht(i).name;ot.has(N)||(ot.add(N),H.push({meta:At(N,tt.starts[h],tt.ends[h],w),row:H.length+1}))});let g=[L,...H.map(i=>i.meta)];if(new Set(g.map(i=>i.label)).size<g.length)for(let i of g)i.label=ne(i.name)??i.label;H.sort((i,h)=>Number(h.meta.complete)-Number(i.meta.complete)||h.meta.bp-i.meta.bp||i.meta.label.localeCompare(h.meta.label));let I=[0,...H.map(i=>i.row)],{offsets:z,columns:K}=_.reorder(I,[yt,yt,yt,i=>new Uint8Array(i),i=>new Int32Array(i)]),[at,_t,Nt,It,bt]=K;return{origin:F?F.start:B(pt)??0,rows:[L,...H.map(i=>i.meta)],offsets:z,start:at,bp:_t,referenceStart:Nt,flags:It,chunk:bt,chunks:nt,visits:C&&Oe(C,I,d)}}function Oe(t,e,s){let{offsets:n,columns:r}=t.reorder(e,[k=>new Int32Array(k),yt,yt,k=>new Uint8Array(k)]),[a,p,l,d]=r;return{offsets:n,node:a,start:p,bp:l,onReference:d,names:s}}function Ee(t,e){let s=t.flags[e],n={start:t.start[e],bp:t.bp[e],onReference:(s&Zt)!==0};if(s&kt){n.gap=!0;let r=pe[s>>me&7];r&&(n.cause=r);let a=t.chunks[t.chunk[e]];a&&(n.chunk=a)}else n.referenceStart=Number.isNaN(t.referenceStart[e])?void 0:t.referenceStart[e];return s&de&&(n.reversed=!0),n}function Fe(t,e){let s=[];for(let n=t.offsets[e];n<t.offsets[e+1];n++)s.push({node:t.names[t.node[n]],start:t.start[n],bp:t.bp[n],onReference:t.onReference[n]===1});return s}function Je(t,e){let s=t.rows.map((n,r)=>{let a=[];for(let p=t.offsets[r];p<t.offsets[r+1];p++)a.push(Ee(t,p));return{...n,runs:a,visits:t.visits&&Fe(t.visits,r)}});return{origin:t.origin,unit:e,reference:s[0],rows:s.slice(1)}}export{Se as a,Ae as b,Te as c,Pe as d,ie as e,ae as f,_e as g,Ue as h,Dt as i,De as j,$e as k,qe as l,Je as m};
+//# sourceMappingURL=chunk-5TT5TG4Q.js.map